检索结果-内蒙古大学图书馆

57th Annual IEEE/ACM International Symposium on Microarchitecture, MICRO 2024

作者： Song, Zhuoran He, Houshu Liu, Fangxin Hao, Yifan Song, Xinkai Jiang, Li Liang, Xiaoyao Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai China Institute of Computing Technology Chinese Academy of Sciences State Key Lab of Processors Beijing China

ISBN: (纸本)9798350350579

Neural Radiance Field (NeRF) holds immense promise for generating photo-realistic images and videos. How-ever, the computation and memory demands significantly impede its applicability in real-Time tasks such as virtual reality and augmented reality. While accelerators dedicatedly designed for NeRF have emerged, they may not be the optimal solution as they only consider the optimization of full-precision NeRF models, leading to unsatisfactory memory and computation saving. This paper proposes Sensitivity-Aware Dynamic Precision Rendering, abbreviated as SRender, an algorithm-hardware co-design framework that borrows the idea of Adaptive Rendering commonly used in conventional graphics rendering to accelerate the rendering process of NeRF exploiting the fine-grained per-ray and per-point levels sensitivity. The fundamental idea behind SRender is that rays and points with high sensitivity require high-precision data types, while the insensitive rays and points do not, allowing them to be sacrificed for greater acceleration. Accordingly, the algorithm part of SRender dynamically configures the precision of the hash table and the multilayer perceptron (MLP), and the hardware part features a specialized accelerator that exploits such mixed-precision memory access and computation patterns. Specifically, we predict the sensitive rays and points based on low-precision hash encoding and feature computation. Then, we trigger a high-precision rendering again on the sensitive ones to guarantee the rendering quality. The hardware design of SRender includes a sensitivity prediction engine, coarse-Then-fine-grained encoding engines, and a recovery engine, which translates the computational saving in the algorithm to real speedup. Using the coarse-Then-fine-grained encoding engine, we maximize the data reuse on-chip, thereby reducing the stress of off-chip memory bandwidth. Experiments show that the edge-level SRender can achieve 3.94x and 34.06x speedup over state-of-The-Art NeRF

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Quantum Byzantine Agreement Against Full-Information Adversary 38

Quantum Byzantine Agreement Against Full-Information Adversa...

引用

38th International Symposium on Distributed Computing, DISC 2024

作者： Li, Longcheng Sun, Xiaoming Zhu, Jiadong State Key Lab of Processors Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9783959773522

We exhibit that, when given a classical Byzantine agreement protocol designed in the private-channel model, it is feasible to construct a quantum agreement protocol that can effectively handle a full-information adversary. Notably, both protocols have equivalent levels of resilience, round complexity, and communication complexity. In the classical private-channel scenario, participating players are limited to exchanging classical bits, with the adversary lacking knowledge of the exchanged messages. In contrast, in the quantum full-information setting, participating players can exchange qubits, while the adversary possesses comprehensive and accurate visibility into the system’s state and messages. By showcasing the reduction from quantum to classical frameworks, this paper demonstrates the strength and flexibility of quantum protocols in addressing security challenges posed by adversaries with increased visibility. It underscores the potential of leveraging quantum principles to improve security measures without compromising on efficiency or resilience. By applying our reduction, we demonstrate quantum advantages in the round complexity of asynchronous Byzantine agreement protocols in the full-information model. It is well known that in the full-information model, any classical protocol requires Ω(n) rounds to solve Byzantine agreement with probability one even against Fail-stop adversary when resilience t = Θ(n) [2]. We show that quantum protocols can achieve O(1) rounds (i) with resilience t 0, therefore surpassing the classical lower bound. © Longcheng Li, Xiaoming Sun, and Jiadong Zhu.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Anaphora Ambiguity Detection Method Based on Cross-domain Pronoun Substitution 35

Anaphora Ambiguity Detection Method Based on Cross-domain Pr...

引用

35th International Conference on software Engineering and Knowledge Engineering, SEKE 2023

作者： Peng, Fengyong Wu, Xi Zhao, Yongxin Li, Yongjian Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China The University of Sydney Australia State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China

Pronoun anaphora ambiguity is very common in natural language descriptions, especially in specilized fileds such as computing, medicine and aerospace. When multiple antecedents appear before a pronoun word, readers with different background knowledge often have completely different understandings on a same word. In order to reduce such misunderstandings caused by ambiguity in the process of document propogation, we usually use manual methods to check the ambiguity of reference, which however cannot meet the increasing needs of detection with the development of various disciplines. In this paper, we propose a method to intelligently detect sentences with anaphora ambiguity. First of all, we identify criteria for ambiguous sentences and then use word embeddings to further detect ambiguity. Specifically, we propose a pronoun substitution strategy based on coreference resolution, and combine this strategy with word embedding techniques to generate a cross-domain anaphora ambiguity detection method. Finally, we carry out experiments on aerospace documents, which verify the effectiveness of our proposed method in anaphora ambiguity detection. © 2023 Knowledge Systems institute Graduate School. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Towards an effective method of ReDoS detection for non-backtracking engines 24

Towards an effective method of ReDoS detection for non-backt...

引用

Proceedings of the 33rd USENIX Conference on Security Symposium

作者： Weihao Su Hong Huang Rongchen Li Haiming Chen Tingjian Ge Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences and University of Chinese Academy of Sciences Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Miner School of Computer & Information Sciences University of Massachusetts Lowell

ISBN: (纸本)9781939133441

Regular expressions (regexes) are a fundamental concept across the fields of computer science. However, they can also induce the Regular expression Denial of Service (Re-DoS) attacks, which are a class of denial of service attacks, caused by super-linear worst-case matching time. Due to the severity and prevalence of ReDoS attacks, the detection of ReDoS-vulnerable regexes in software is thus vital. Although various ReDoS detection approaches have been proposed, these methods have focused mainly on backtracking regex engines, leaving the problem of ReDoS vulnerability detection on non-backtracking regex engines largely *** address the above challenges, in this paper, we first systematically analyze the major causes that could contribute to ReDoS vulnerabilities on non-backtracking regex engines. We then propose a novel type of ReDoS attack strings that builds on the concept of simple strings. Next we propose EVILSTRGEN, a tool for generating attack strings for ReDoS-vulnerable regexes on non-backtracking engines. It is based on a novel incremental determinisation algorithm with heuristic strategies to lazily find the k-simple strings without explicit construction of finite automata. We evaluate EVILSTRGEN against six state-of-the-art approaches on a broad range of publicly available datasets containing 736,535 unique regexes. The results illustrate the significant efficacy of our tool. We also apply our tool to 85 intensively-tested projects, and have identified 34 unrevealed ReDoS vulnerabilities.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dispatching and Scheduling Dependent Tasks Based on Multi-agent Deep Reinforcement Learning 35

Dispatching and Scheduling Dependent Tasks Based on Multi-ag...

引用

35th International Conference on software Engineering and Knowledge Engineering, SEKE 2023

作者： Feng, Shuaishuai Wu, Xi Zhao, Yongxin Li, Yongjian Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China The University of Sydney Australia State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China

With the development of edge computing, a large number of tasks can be offloaded to the edge server for computing, among which the dispatching and scheduling of dependent tasks has attracted extensive attention. The offloading of dependent tasks mainly has the following problems: how to select an appropriate edge server for dispatching, how to arrange the scheduling order of edge servers to better schedule tasks, and how to solve the task dependency problem. In this paper, we proposal a dispatching and scheduling method DAMD, based on reinforcement learning and multi-agent reinforcement learning, to solve the above three problems. Specifically, as the first step of DAMD, a reinforcement learning approach is designed to estimate the network load and dynamically dispatch tasks to the appropriate edge servers. Each edge server is regarded as an agent by a multi-agent reinforcement learning method, the second step of DAMD, which comprehensively considers the dependency relationship between tasks and the scheduling relationship between servers to achieve the efficiency and fairness of task scheduling. Finally, the results show that our method can better complete the task within the deadline and greatly reduce the average response time according to the time sensitivity requirement. © 2023 Knowledge Systems institute Graduate School. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Cambricon-QR:a sparse and bitwise reproducible quantized training accelerator

引用

High Technology Letters 2024年第1期30卷 52-60页

作者：李楠 ZHAO Yongwei ZHI Tian LIU Chang DU Zidong HU Xing LI Wei ZHANG Xishan LI Ling SUN Guangzhong School of Computer Science and Technology University of Science and Technology of ChinaHefei 230026P.R.China State Key Laboratory of Processors Institute of Computing TechnologyChinese Academy of SciencesBeijing 100086P.R.China Cambricon Tech.Ltd Beijing 100191P.R.China Institute of Software Chinese Academy of SciencesBeijing 100086P.R.China

Quantized training has been proven to be a prominent method to achieve deep neural network training under limited computational *** uses low bit-width arithmetics with a proper scaling factor to achieve negligible accuracy ***-Q is the ASIC design proposed to efficiently support quantized training,and achieves significant performance ***,there are still two caveats in the ***,Cambricon-Q with different hardware specifications may lead to different numerical errors,resulting in non-reproducible behaviors which may become a major concern in critical ***,Cambricon-Q cannot leverage data sparsity,where considerable cycles could still be squeezed *** address the caveats,the acceleration core of Cambricon-Q is redesigned to support fine-grained irregular data *** new design not only enables acceleration on sparse data,but also enables performing local dynamic quantization by contiguous value ranges(which is hardware independent),instead of contiguous addresses(which is dependent on hardware factors).Experimental results show that the accuracy loss of the method still keeps negligible,and the accelerator achieves 1.61×performance improvement over Cambricon-Q,with about 10%energy increase.

关键词： quantized training sparse accelerator Cambricon-QR

来源：评论

学校读者我要写书评

暂无评论

Monotonicity and nonmonotonicity in L3-valued propositional logic

引用

Frontiers of computer science 2022年第4期16卷 33-43页

作者： Wei Li Yuefei Sui State Key Laboratory of Software Development Environment Beihang UniversityBeijing100083China Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of SciencesBeijing100190China School of Computer Science and Technology University of Chinese Academy of SciencesBeijing100049China

A sequent is a pair (Γ, Δ), which is true under an assignment if either some formula in Γ is false, or some formula in Δ is true. In L_(3)-valued propositional logic, a multisequent is a triple Δ∣Θ∣Γ, which is true under an assignment if either some formula in Δ has truth-value t, or some formula in Θ has truth-value m, or some formula in Γ has truth-value f. There is a sound, complete and monotonic Gentzen deduction system G for sequents. Dually, there is a sound, complete and nonmonotonic Gentzen deduction system G′ for co-sequents Δ: Θ: Γ. By taking different quantifiers some or every, there are 8 kinds of definitions of validity of multisequent Δ∣Θ∣Γ and 8 kinds of definitions of validity of co-multisequent Δ: Θ: Γ, and correspondingly there are 8 sound and complete Gentzen deduction systems for sequents and 8 sound and complete Gentzen deduction systems for co-sequents. Correspondingly their monotonicity is discussed.

关键词： sequent mulisequent gentzen deduction system monotonicity nonmonotonicity

来源：评论

学校读者我要写书评

暂无评论

Joint Mobile Edge Caching and Pricing: A Mean-Field Game Approach 40

Joint Mobile Edge Caching and Pricing: A Mean-Field Game App...

引用

40th IEEE International Conference on Data Engineering, ICDE 2024

作者： Xu, Yin Zhang, Xichong Xiao, Mingjun Wu, Jie Liu, An Zhang, Sheng School of Computer Science and Technology University of Science and Technology of China Hefei China Suzhou Institute for Advanced Research University of Science and Technology of China Suzhou China Temple University Department of Computer and Information Sciences Philadelphia United States School of Computer Science and Technology Soochow University Suzhou China Nanjing University State Key Laboratory for Novel Software Technology Nanjing China

ISBN: (纸本)9798350317152

In this paper, we investigate the competitive content placement problem in Mobile Edge Caching (MEC) systems, where Edge Data Providers (EDPs) cache appropriate contents and trade them with requesters at a suitable price. Most of the existing works ignore the complicated strategic and economic interplay between content caching, pricing, and content sharing. Therefore, we propose a joint Mean-Field Game framework for mobile edge Caching and Pricing (MFG-CP) in large-scale dynamic MEC systems, which can facilitate distributed optimal decision-making based on the mean-field game theory. Specifi-cally, we first formulate the competitive content placement issue among EDPs as a non-cooperative stochastic differential game. To significantly reduce the communication and computation complexity, we further devise a mean-field model to approximate the collective impact of all EDPs on caching, trading, and sharing, by which each EDP can quickly estimate some unknown information without considerable interactions. Then, we develop a distributed best response scheme based on iterative learning, enabling each EDP to solely customize its optimal caching strategy and pricing policy. Besides, we theoretically prove the existence of a unique MFG equilibrium. Finally, trace-driven simulations demonstrate the effectiveness of MFG-CP compared with some baselines. © 2024 IEEE.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

AgileShard: Turning the Sharded Blockchain into a Real-Time Transaction Processing System 44

AgileShard: Turning the Sharded Blockchain into a Real-Time ...

引用

44th IEEE Real-Time Systems Symposium, RTSS 2023

作者： Shi, Jianfeng Wu, Heng Liu, Wang Gao, Heran Zhang, Wenbo University of Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Nanjing China Software Engineering Technology Research and Development Center Institute of Software Chinese Academy of Sciences Beijing China Nanjing Institute of Software Technology Nanjing China Institute of Software Chinese Academy of Sciences State Key Laboratory of Computer Science Beijing China

ISBN: (纸本)9798350328578

Blockchain, as an emerging transaction processing system, suffers from low throughput and high latency. Sharded blockchains can significantly increase throughput by dividing nodes into groups (i.e., shards) to process disjoint transactions in parallel. However, the diverse latency requirements of transactions in current sharded blockchains are not well met. Three challenges prevent the sharded blockchain from becoming a real-time transaction processing system, namely, the static block size, the first-come-first-served transaction packing strategy, and the load imbalance. Therefore, this paper proposes 3 methods to help turn the sharded blockchain into a real-time transaction processing system. First, we propose an inter-shard dynamic block size negotiation method that enables shards to adaptively determine the globally optimal block size based on the deadlines of pending transactions. Then, we propose a DAG-based transaction packing method for reducing the number of deadline violations and improving parallelism. Finally, we propose a minimum-cost-flow-based shard reconfiguration method to address load imbalance. Under real datasets on Ethereum, experimental results show that AgileShard using the above three methods can effectively improve the transaction deadline satisfaction rate. © 2023 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Multiobjective Sequential Transfer Optimization: Benchmark Problems and Preliminary Results 13

Multiobjective Sequential Transfer Optimization: Benchmark P...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Xue, Xiaoming Feng, Liang Yang, Cuie Liu, Songbai Song, Linqi Tan, Kay Chen City University of Hong Kong Department of Computer Science Hong Kong College of Computer Science Chongqing University Chongqing China Northeastern University State Key Lab of Synthetic Automation for Process Industries Shenyang China College of Computer Science and Software Engineering Shenzhen University Shenzhen China The Hong Kong Polytechnic University Department of Computing Hong Kong

ISBN: (纸本)9798350308365

In cases of frequent problem-solving of multiobjective optimization tasks from a domain due to changing conditions or problem features, a growing number of individual tasks will be solved and stored in a database, providing an opportunity for a target task at hand to achieve better optimization performance through knowledge transfer from the previously-solved tasks, which is also known as sequential transfer optimization. Despite a variety of transfer algorithms that have been developed over the years, the research on the design of benchmark problems for evaluating such algorithms received far less attention. Oftentimes, the source and target tasks in existing test problems are manually assembled or extended from specific practical problems, limiting their ability to represent the diverse yet complex source-target similarity relationships in real-world problems. In light of this, we propose design methods to generate multiobjective sequential transfer optimization problems (MSTOPs) systematically in this work, wherein the Pareto manifolds of individual tasks and the manifold-based similarity between the tasks can be customized with ease, enabling a broad spectrum of representation of the diverse similarity relationships between the source-target Pareto manifolds of MSTOPs. Lastly, a benchmark suite with 12 test problems is developed using the proposed methods, which would serve as an arena for electing superior multiobjective sequential transfer optimization algorithms. The source code is available at https://***/XmingHsueh/MSTOP. © 2024 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：