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

27th International Conference on Field Programmable Logic and Applications, FPL 2017

作者： Lu, Weina Lu, Wenyan Ye, Jing Hu, Yu Li, Xiaowei State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China Graduate University of Chinese Academy of Sciences China

ISBN: (纸本)9789090304281

The performance of an FPGA based CNN accelerator is determined by both parallelism and frequency, however, most prior works optimize the parallelism in the RTL design and resolve the frequency after the synthesis. This paper presents a design space exploration method for the pipeline implementation of the deep CNN models, which concurrently optimizes parallelism and frequency to achieve a comprehensive optimization on throughput. In addition to the quantitative modeling on parallelism, the maximum achievable system frequency under various parallelism is explored to leverage the PVT-margins in real-life scenarios and is adopted to guide the design space exploration for further performance boost. A case study of the AlexNet model is implemented using the proposed method on the Altera DE5a-Net board. The experimental results demonstrate that our method can achieve the throughput up to 906.25GOP/s, which gains 1.39× improvement compared to state-of-the-art RTL optimization methods. © 2017 Ghent University.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Construction of Traditional Culture Ontology Based on Representation and Role 23

Construction of Traditional Culture Ontology Based on Repres...

引用

2023 4th International Conference on Control, Robotics and Intelligent System, CCRIS 2023

作者： Li, Min Xu, Jianliang Wu, Xiaoquan Ocean University of China Qingdao China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Qingdao China

ISBN: (纸本)9798400708190

Traditional culture refers to a culture that has evolved from civilization and can reflect the characteristics and spirit of a nation. However, at present, the traditional cultural ontology only focuses on modeling and data organization of a certain type of traditional culture, which is a certain distance from the massive cultural information and urgent cultural needs. This article starts from the perspective of protecting and inheriting traditional culture, and based on representation, incorporates role theory to construct a cultural ontology centered on poetry, calligraphy, and painting. The traditional cultural ontology constructed in this article can further contribute to the field of artificial intelligence. © 2023 ACM.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Variant quantifiers in L_(3)-valued first-order logic

引用

Frontiers of computer Science 2021年第5期15卷 151-159页

作者： Wei LI Yuefei SUI State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100083China Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China School of Computer Science and Technology University of Chinese Academy of SciencesBeijing 100049China

Traditional first-order logic has four definitions for quantifiers,which are defined by universal and existential *** L_(3)-valued(three-valued)first-order logic,there are eight kinds of definitions for quantifiers;and corresponding Gentzen deduction systems will be given and their soundness and completeness theorems will be proved.

关键词： L_(3)-valued(three-valued)first-order logic sequent quantifier soundness theorem completeness theorem

来源：评论

学校读者我要写书评

暂无评论

Analysis and mitigation of function interaction risks in robot apps 21

Analysis and mitigation of function interaction risks in rob...

引用

24th International Symposium on Research in Attacks, Intrusions and Defenses, RAID 2021

作者： Xu, Yuan Zhang, Tianwei Bao, Yungang State Key Laboratory of Computer Architecture Institute of Computing Technology University of Chinese Academy of Sciences Peng Cheng Laboratory China Nanyang Technological University China

ISBN: (纸本)9781450390583

Robot apps are becoming more automated, complex and diverse. An app usually consists of many functions, interacting with each other and the environment. This allows robots to conduct various tasks. However, it also opens a new door for cyber attacks: adversaries can leverage these interactions to threaten the safety of robot operations. Unfortunately, this issue is rarely explored in past works. We present the first systematic investigation about the function interactions in common robot apps. First, we disclose the potential risks and damages caused by malicious interactions. By investigating the relationships among different functions, we identify and categorize three types of interaction risks. Second, we propose RTron, a novel system to detect and mitigate these risks and protect the operations of robot apps. We introduce security policies for each type of risks, and design coordination nodes to enforce the policies and regulate the interactions. We conduct extensive experiments on 110 robot apps from the ROS platform and two complex apps (Baidu Apollo and Autoware) widely adopted in industry. Evaluation results indicated RTron can correctly identify and mitigate all potential risks with negligible performance cost. To validate the practicality of the risks and solutions, we implement and evaluate RTron on a physical UGV (Turtlebot) with real-word apps and environments. © 2021 ACM.

关键词： Risk analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Models of parallel computation :a survey and classification

引用

中国高等学校学术文摘·计算机科学 2007年第2期1卷 156-165页

作者： ZHANG Yunquan CHEN Guoliang SUN Guangzhong MIAO Qiankun Laboratory of Parallel Computing Institute of SoftwareChinese Academy of SciencesBeijing 100080China State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing 100080China Anhui Province-MOST Key Co-Lab of High Performance Computing and Its Applications Department of Computer Science and TechnologyUniversity of Science and Technology of ChinaHefei 230027China

In this paper,the state-of-the-art parallel computational model research is *** will introduce various models that were developed during the past *** to their targeting architecture features,especially memory organization,we classify these parallel computational models into three *** models and their characteristics are discussed based on three generations *** believe that with the ever increasing speed gap between the CPU and memory systems,incorporating non-uniform memory hierarchy into computational models will become *** the emergence of multi-core CPUs,the parallelism hierarchy of current computing platforms becomes more and more *** this complicated parallelism hierarchy in future computational models becomes more and more important.A semi-automatic toolkit that can extract model parameters and their values on real computers can reduce the model analysis complexity,thus allowing more complicated models with more parameters to be *** memory and hierarchical parallelism will be two very important features that should be considered in future model design and research.

关键词： parallel computational models hierarchicalmemory hierarchical parallelism three generations memorymodel

来源：评论

学校读者我要写书评

暂无评论

Skyrmion transport driven by pure voltage generated strain gradient

引用

Chinese Physics B 2022年第11期31卷 566-570页

作者： Shan Qiu Jia-Hao Liu Ya-Bo Chen Yun-Ping Zhao Bo Wei Liang Fang Institute for Quantum Information&State Key Laboratory of High Performance Computing College of ComputerNational University of Defense TechnologyChangsha 410073China Hunan University of Humanities Science and Technology Loudi 417000China

The magnetic skyrmion transport driven by pure voltage-induced strain gradient is proposed and studied via micromagnetic *** combining the skyrmion with multiferroic heterojunction,a voltage-induced uniaxial strain gradient is adjusted to move *** the system,a pair of short-circuited trapezoidal top electrodes can generate the symmetric *** to the symmetry of strain,the magnetic skyrmion can be driven with a linear motion in the middle of the nanostrip without *** calculate the strain distribution generated by the trapezoidal top electrodes pair,and further investigate the influence of the strain intensity as well as the strain gradient on the skyrmion *** findings provide a stable and low-energy regulation method for skyrmion transport.

关键词： skyrmion strain gradient multiferroic heterojunction spintronics

来源：评论

学校读者我要写书评

暂无评论

POSTER: STAR (Space-Time Adaptive and Reductive) Algorithms for Real-World Space-Time Optimality

引用

ACM SIGPLAN Notices 2017年第8期52卷 455-456页

作者： Tang, Yuan You, Ronghui School of Computer Science School of Software Fudan University Shanghai Key Lab. of Intelligent Information Processing State Key Lab. of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China

It's important to hit a space-time balance for a real-world algorithm to achieve high performance on modern shared-memory multi-core or many-core systems. However, a large class of dynamic programs with more than $O(1)$ dependency achieve optimality either in space or time, but not both. In the literature, the problem is known as the fundamental space-time tradeoff. By exploiting properly on the runtime system, we show that our STAR (Space-Time Adaptive and Reductive) technique can help these dynamic programs to achieve sublinear parallel time bounds while still maintaining work-, space-, and cache-optimality in a processor- and cache-oblivious fashion. © 2017 ACM.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Using index in the MapReduce framework

Using index in the MapReduce framework

引用

12th International Asia Pacific Web Conference, APWeb 2010

作者： An, Mingyuan Wang, Yang Wang, Weiping Key Laboratory of Computer System and Architecture Graduate University of Chinese Academy of Sciences Beijing China Key Laboratory of Computer System and Architecture Chinese Academy of Sciences Institute of Computing Technology Beijing China

ISBN: (纸本)9780769540122

MapReduce is a programming framework introduced by Google for large-scale data processing. It is usually used in a scan-centric fashion where all the data are split into blocks and Maps are generated for each block to scan and process the data in the block, then Reduces merge outputs from all the Maps. When a query intends to process only a subset of the data selected by a predicate, this brute-force method may cause extra I/O overhead spent on irrelevant data, and the overhead for initiating so many Maps may be nontrivial given that the actually interesting data for the query is comparatively small in volume. We propose an approach to integrate the index into the MapReduce execution in which only an appropriate number of Maps are generated, each of which accesses the data using an index. This approach incurs random I/O and remote access to data, so the overall performance depends on both system parameters and the query characteristics. We build a cost model for both this index access execution and the traditional full scan execution. This cost model can be used to choose between the two execution modes before executing a query. Experiments show that the index access execution can greatly outperform full scan execution when the selectivity of the predicate is low, and the cost model predicts the actual execution cost very well so can be used to determine the execution plan for a query. © 2010 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

A benchmark test of boson sampling on Tianhe-2 supercomputer

引用

National Science Review 2018年第5期5卷 715-720页

作者： Junjie Wu Yong Liu Baida Zhang Xianmin Jin Yang Wang Huiquan Wang Xuejun Yang Institute for Quantum Information & State Key Laboratory of High Performance Computing College of ComputerNational University of Defense Technology State Key Laboratory of Advanced Optical Communication Systems and Networks School of Physics and AstronomyShanghai Jiao Tong University Synergetic Innovation Center of Quantum Information and Quantum Physics University of Science and Technology of China

Boson sampling, thought to be intractable classically, can be solved by a quantum machine composed of merely generation, linear evolution and detection of single photons. Such an analog quantum computer for this specific problem provides a shortcut to boost the absolute computing power of quantum computers to beat classical ones. However, the capacity bound of classical computers for simulating boson sampling has not yet been identified. Here we simulate boson sampling on the Tianhe-2 supercomputer, which occupied the first place in the world ranking six times from 2013 to 2016. We computed the permanent of the largest matrix using up to 312 000 CPU cores of Tianhe-2, and inferred from the current most efficient permanent-computing algorithms that an upper bound on the performance of Tianhe-2 is one 50-photon sample per ～100 min. In addition, we found a precision issue with one of two permanent-computing algorithms.

关键词： boson sampling permanent quantum supremacy quantum computing supercomputer

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：