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

International Conference on Networking, architecture, and Storage (NAS)

作者： Bo Li Panyong Zhang Zhigang Huo Dan Meng National Research Center for Intelligent Computing Systems Institute of Computing Technology Key Laboratory of Computer System and Architecture Chinese Academy of Sciences China National Research Center for Intelligent Computing Systems Institute of Computing Technology Key Laboratory of Computer System and Architecture Chinese Academy and Sciences China

The network file system (NFS) protocol, as the de facto standard for sharing files in a distributed environment, has deployed Infiniband as the underlying transport of sunRPC, namely NFS over RDMA. In the current Read-Write design of NFS over RDMA, NFS write performance is limited for not fully utilizing the features of Infiniband. In this paper, we take on the challenge of enhancing the write performance of NFS. We propose and evaluate a new design of sunRPC over RDMA, namely Write-Write design. To guarantee the security of our design, we propose an HCA-based memory protection extension of Infiniband. Evaluations show that our Write-Write design increases the kernel-to-kernel RPC bandwidth by 15~27%. In real disk test, our Write-Write design gains 15%~22% in multi-client benchmarks compared with the Read-Write design.

关键词： Security Protection Bandwidth Scalability computer architecture computer networks Distributed computing File systems Benchmark testing Protocols

来源：评论

学校读者我要写书评

暂无评论

PDP: Parallel Dynamic Programming

引用

IEEE/CAA Journal of Automatica Sinica 2017年第1期4卷 1-5页

作者： Fei-Yue Wang Jie Zhang Qinglai Wei Xinhu Zheng Li Li IEEE State Key Laboratory of Management and Control for Complex Systems(SKL-MCCS) Institute of AutomationChinese Academy of Sciences(CASIA) School of Computer and Control Engineering University of Chinese Academy of Sciences Research Center for Military Computational Experiments and Parallel Systems Technology National University of Defense Technology State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of Sciences(SKL-MCCSCASIA) Qingdao Academy of Intelligent Industries Department of Computer Science and Engineering University of Minnesota Department of Automation Tsinghua University

Deep reinforcement learning is a focus research area in artificial intelligence. The principle of optimality in dynamic programming is a key to the success of reinforcement learning methods. The principle of adaptive dynamic programming ADP is first presented instead of direct dynamic programming DP , and the inherent relationship between ADP and deep reinforcement learning is developed. Next, analytics intelligence, as the necessary requirement, for the real reinforcement learning, is discussed. Finally, the principle of the parallel dynamic programming, which integrates dynamic programming and analytics intelligence, is presented as the future computational intelligence. © 2014 Chinese Association of Automation.

关键词： Artificial intelligence Neural networks Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Extinction Chains Reveal Intermediate Phases Between the Safety and Collapse in Mutualistic Ecosystems

引用

Engineering 2024年第12期43卷 89-98页

作者： Guangwei Wang Xueming Liu Ying Xiao Ye Yuan Linqiang Pan Xiaohong Guan Jianxi Gao Hai-Tao Zhang The MOE Engineering Research Center of Autonomous Intelligent Unmanned Systems State Key Laboratory of Digital Manufacturing Equipment and TechnologySchool of Artificial Intelligence and AutomationHuazhong University of Science and TechnologyWuhan 430074China Guangdong HUST Industrial Technology Research Institute Huazhong University of Science and TechnologyDongguan 523808China Guangdong Provincial Engineering Technology Center of Autonomous Unmanned Vessels Dongguan 523808China MOE Key Laboratory of Intelligent Networks and Network Security&State Key Laboratory of Manufacturing Systems Xi’an Jiaotong UniversityXi’an 710049China Tsinghua National Laboratory of Information Science and Technology Department of AutomationTsinghua UniversityBeijing 100084China Department of Computer Science Rensselaer Polytechnic InstituteTroyNY 12180USA

Ecosystems are undergoing unprecedented persistent deterioration due to unsustainable anthropogenic human activities,such as overfishing and deforestation,and the effects of such damage on ecological stability are *** recent advances in experimental and theoretical studies on regime shifts and tipping points,theoretical tools for understanding the extinction chain,which is the sequence of species extinctions resulting from overexploitation,are still lacking,especially for large-scale nonlinear networked *** this study,we developed a mathematical tool to predict regime shifts and extinction chains in ecosystems under multiple exploitation situations and verified it in 26 real-world mutualistic networks of various sizes and *** discovered five phases during the exploitation process:safe,partial extinction,bistable,tristable,and collapse,which enabled the optimal design of restoration strategies for degraded or collapsed *** validated our approach using a 20-year dataset from an eelgrass restoration ***,we also found a specific region in the diagram spanning exploitation rates and competition intensities,where exploiting more species helps increase *** computational tool provides insights into harvesting,fishing,exploitation,or deforestation plans while conserving or restoring the biodiversity of mutualistic ecosystems.

关键词： Complex system Network science Overexploitation Regime shift Metastability

来源：评论

学校读者我要写书评

暂无评论

Relaying Strategy Based on Estimated Information for Multi-Antenna Cooperative Networks

引用

China Communications 2017年第8期14卷 157-165页

作者： Shuangshuang Han Peng Zhang Feijin Shi Fei-Yue Wang The State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of SciencesBeijingChina and Qingdao Academy of Intelligent Industries School of Computer Engineering Weifang University Communications Headquarters Ministry of Foreign Affairs of the People's Republic of China State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of SciencesBeijingChina and Research Center of Computational Experiments and Parallel SystemsThe National University of Defense Technology

A sphere-based list forwarding scheme for multiple-input multiple-output(MIMO) relay networks is proposed and analyzed. Firstly, an estimate forwarding(EF) method is proposed, which forwards the minimum mean squared error(MMSE) estimate of the source data to the destination. Since it performs like amplify-and-forward(AF) and decode-and-forward(DF) for the low and high signal-to-noise ratio(SNR) regions, respectively, the EF relay thus outperforms conventional AF and DF across all SNRs without the need for switching algorithms for different SNRs. Because computational complexity is however high for relays with a large number of antennas(large MIMO) and/or high order constellations, list EF for large MIMO relay networks is proposed. It computes a list sphere decoder based MMSE estimate and retains the advantages of the exact EF relay at a negligible performance loss. The proposed list EF could offer a flexible trade-off between the performance and computational complexity.

关键词： MIMO system cooperative network soft information

来源：评论

学校读者我要写书评

暂无评论

Two-Stage Safe Reinforcement Learning for High-Speed Autonomous Racing

Two-Stage Safe Reinforcement Learning for High-Speed Autonom...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： Jingyu Niu Yu Hu Beibei Jin Yinhe Han Xiaowei Li Research Center for Intelligent Computing Systems State Key Laboratory of Computer Architecture ICT CAS University of Chinese Academy of Sciences Beijing China

ISBN: (数字)9781728185262

ISBN: (纸本)9781728185279

Decision making for autonomous driving is a safety-critical control problem. Prior works of safe reinforcement learning either tackle the problem with reward shaping or with modifying the reinforcement learning exploration process. However, the former cannot guarantee the safety during the learning process, while the latter relies heavily on expertise to design exquisite exploration policy. Currently, only short-term decision makings for low-speed driving were achieved in road scenes with basic geometries. In this paper, we propose a two-stage safe reinforcement learning algorithm to automatically learn a long-term policy for high-speed driving that guarantees safety during the entire training. In the first learning stage, model-free reinforcement learning is followed by a rule-based safeguard module to avoid danger at low speed without expert ne-tuning. In the second learning stage, the rule-based module is replaced with a data-driven counterpart to develop a closed-form analytical safety solution for high-speed driving. Moreover, an adaptive reward function is designed to match the different objectives of the two learning stages for faster convergence to an optimal policy. Experiments are conducted on a racing simulator TORCS which has complex racing tracks (e.g. sharp turns, hills). Compared with the state-of-the-art baselines, the results show that our method achieves zero safety violation and quickly converges to a more efficient and stable policy with an average speed of 127 km/h (3.3% higher than the best result of baselines) and an average swing of 3.96 degrees.

关键词： Training Geometry Roads Decision making Reinforcement learning Safety Cybernetics

来源：评论

学校读者我要写书评

暂无评论

CADEC: A Combinatorial Auction for Dynamic Distributed DNN Inference Scheduling in Edge-Cloud Networks

引用

IEEE Transactions on Mobile computing 2025年

作者： Xu, Xiaolong Hu, Yuhao Cui, Guangming Qi, Lianyong Dou, Wanchun Nanjing University of Information Science and Technology School of Software Nanjing 210044 China Nanjing University of Information Science and Technology Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services School of Software China Nanjing University State Key Laboratory for Novel Software Technology China China University of Petroleum (East China) College of Computer science and technology Qingdao China Georgia State University Department of Computer Science United States

Deep Neural Network (DNN) Inference, as a key enabler of intelligent applications, is often computation-intensive and latency-sensitive. Combining the advantages of cloud computing (abundant computing resources) and edge computing (fast transmission), edge-cloud collaborative DNN inference is a powerful solution to these problems. However, in edge-cloud networks with heterogeneous resources, how to obtain reasonable decisions on server selection, model partition and resource allocation for efficient distributed DNN inference is a hard challenge. Furthermore, it is non-trivial to design suitable resource prices to maximize the social welfare. These challenges even escalate in dynamic edge-cloud networks where decisions should be generated as soon as each user arrives without future information. Therefore, we design a combinatorial auction for dynamic distributed DNN inference scheduling, named CADEC. CADEC first constructs a bid set for each user based on convex optimization theory for optimal solution searching. Next, prices of resources in the edge-cloud network are adjusted according to changes in supply-demand relationship, and whether to admit the request of each user is decided. Finally, the dynamic distributed inference scheduling decisions are generated through the primal-dual algorithm to maximize the social welfare. Theoretical analysis shows the good competitive ratio and polynomial time complexity of CADEC. Results of simulation experiments present that CADEC improves social welfare by up to 46% compared with state-of-the-art distributed DNN inference schemes. © 2002-2012 IEEE.

关键词： Combinatorial auction distributed DNN inference dynamic scheduling edge-cloud networks resource pricing

来源：评论

学校读者我要写书评

暂无评论

Vehicle detection method based on active basis model and symmetry in ITS

Vehicle detection method based on active basis model and sym...

引用

2013 16th International IEEE Conference on intelligent Transportation systems: intelligent Transportation systems for All Modes, ITSC 2013

作者： Yao, Yanjie Gang, Xiong Wang, Kunfeng Zhu, Fenghua Wang, Fei-Yue State Key Laboratory of Management and Control for Complex Systems Beijing Engineering Research Center of Intelligent Systems and Technology Chinese Academy of Sciences Beijing 100190 China Dongguan Research Institute of CASIA Cloud Computing Center Chinese Academy of Sciences Dongguan China

ISBN: (纸本)9781479929146

Vehicle detection is a foundational and significant task in video surveillance systems. In this paper, a vehicle detection method using a deformable model and symmetry is proposed. First, we learn the active basis model (ABM) from the target training sample set by using the shared sketch algorithm. Then, we utilize the edge information obtained by ABM and HSV color information to do symmetry analysis for vehicle objects. The ABM can detect vehicles in various poses, shapes, and sizes for its deformability. By doing edge and color symmetry analysis, subtle difference between two images and environment noises can be adapted. The results of experiments indicate that our approach is capable of detection different vehicles and localization vehicle in bad environment. What's important, the detection results support the capability of the proposed method to enable the introduction of novel intelligent transportation systems applications. © 2013 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Artificial power system based on ACP approach

Artificial power system based on ACP approach

引用

2012 IEEE International Conference on Service Operations and Logistics, and Informatics, SOLI 2012

作者： Dong, Xisong Xiong, Gang Hou, Jiachen Fan, Dong State Key Laboratory of Management and Control for Complex Systems Beijing Engineering Research Center of Intelligent Systems and Technology Institute of Automation Beijing China Dongguan Research Institute of CASIA Cloud Computing Center Chinese Academy of Sciences Songshan Lake Dongguan China

ISBN: (纸本)9781467324007

Modern power system is a typical multi-level complex giant system consisting of physical infrastructures, human operators, and social resources, etc. The conventional analytical methods and simulation systems can't provide sufficient guidance for its operation and management, because they are mainly based on physical models, natural phenomenon, or other existing control methods which are based on reductionism. ACP approach, mainly consisting of artificial systems (A), computational experiments (C) and parallel execution (P), which is based on holism and complex system theory, has its specific advantages in the research on power systems. In this article, ACP approach is applied to build up artificial power system (APS) by using multi-agent complex networks. With the help of APS, actual power system's control, scheduling, optimization and management can be improved further via providing theoretical guidance and technical support for the rolling optimizations in normal situations and emergency management in abnormal situations. As a case study, an APS constructed with actual data from North China power grid is constructed and its vulnerability is simulated and analyzed under random, dynamic and static attacks. © 2012 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

EDOA: an efficient delay optimization approach for mixed-polarity Reed-Muller logic circuits under the unit delay model

引用

Frontiers of computer Science 2019年第5期13卷 1102-1115页

作者： Zhenxue HE Limin XIAO Fei GU Li RUAN Zhisheng HUO Mingzhe LI Mingfa ZHU Longbing ZHANG Rui LIU Xiang WANG College of Information Science and Technology Hebei Agricultural University Baoding 071001 China State Key Laboratory of Software Development Environment Beihang University Beijing 100083 China School of Computer Science and Engineering Beihang University Beijing 100083 China School of Electronic and Information Engineering Beihang University Beijing 100083 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China National Engineering Research Center for Science & Technology Resources Sharing Service Beijing 100083 China

Delay optimization has recently attracted signif-icant attention. However, few studies have focused on the delay optimization of mixed-polarity Reed-Muller (MPRM) logic circuits. In this paper, we propose an efficient delay op-timization approach (EDOA) for MPRM logic circuits under the unit delay model, which can derive an optimal MPRM logic circuit with minimum delay. First, the simplest MPRM expression with the fewest number of product terms is ob-tained using a novel Reed-Muller expression simplification approach (RMESA) considering don't-care terms. Second, a minimum delay decomposition approach based on a Huffman tree construction algorithm is utilized on the simplest MPRM expression. Experimental results on MCNC benchmark cir-cuits demonstrate that compared to the Berkeley SIS 1.2 and ABC, the EDOA can significantly reduce delay for most cir-cuits. Furthermore, for a few circuits, while reducing delay, the EDOA incurs an area penalty.

关键词： delay optimization mixed-polarity Reed-Muller logic circuits unit delay model don't-care terms,

来源：评论

学校读者我要写书评

暂无评论

A Power and Area Optimization Approach of Mixed Polarity Reed-Muller Expression for Incompletely Specified Boolean Functions

引用

Journal of computer Science & Technology 2017年第2期32卷 297-311页

作者： Zhen-Xue He Li-Min Xiao Li Ruan Fei Gu Zhi-Sheng Huo Guang-Jun Qin Ming-Fa Zhu F Long-Bing Zhang Rui Liu Xiang Wang State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China School of Electronic and Information Engineering Beihang University Beijing 100191 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China National Engineering Research Center for Science and Technology Resources Sharing Service Beihang University Beijing 100191 China

The power and area optimization of Reed-Muller （RM） circuits has been widely concerned. However, almost none of the exiting power and area optimization approaches can obtain all the Pareto optimal solutions of the original problem and are efficient enough. Moreover, they have not considered the don＇t care terms, which makes the circuit performance unable to be further optimized. In this paper, we propose a power and area optimization approach of mixed polarity RM expression （MPRM） for incompletely specified Boolean functions based on Non-Dominated Sorting Genetic Algorithm II （NSGA-II）. Firstly, the incompletely specified Boolean function is transformed into zero polarity incompletely specified MPRM （ISMPRM） by using a novel ISMPRM acquisition algorithm. Secondly, the polarity and allocation of don＇t care terms of ISMPRM is encoded as chromosome. Lastly, the Pareto optimal solutions are obtained by using NSGA-II, in which MPRM corresponding to the given chromosome is obtained by using a chromosome conversion algorithm. The results on incompletely specified Boolean functions and MCNC benchmark circuits show that a significant power and area improvement can be made compared with the existing power and area optimization approaches of RM circuits.

关键词： power and area optimization Reed-Muller （RM） circuit Pareto optimal solution don＇t care term chromosomeconversion

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：