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

2012年全国理论计算机科学学术年会(NCTCS2012)

作者： Licai Guo Zhangjin Huang School of Computer Science and Technology University of Science and Technology of China PR China USTC-SICT Joint Laboratory on Network and Key Laboratory of Software in Computing and Communication Anhui Province PR China USTC-SICT Joint Laboratory on Network and Communication PR China School of Computer Science and Technology University of Science and Technology of China PR China

parallel framework for NURBS-based isogeometric analysis on multi-core cpus is presented in this *** framework is composed of two parts:(1) construction of the stiffness matrix and right hand side vector; (2) a parall...

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-robot cooperative pursuit based on combinatorial auction mechanism under dynamic environment

Multi-robot cooperative pursuit based on combinatorial aucti...

引用

2008 2nd International Symposium on Systems and Control in Aerospace and Astronautics, ISSCAA 2008

作者： Su, Cai Ze Ning, Sun Li Bo, Gao Hai Cheng, Zhou Pu State Key Laboratory of Advanced Robot and System Harbin Institute of Technology Harbin 150001 Heilongjiang China School of Computer Science and Technology Harbin Institute of Technology Harbin 150001 Heilongjiang China Department of Information Engineering Artillery Academy of PLA Hefei 230031 AnHui Province China

This paper mainly discusses the pursuit-evasion games, in which a team of autonomous mobile robots act as pursuers to pursue multiple moving targets cooperatively. In order to reduce the communication load during the task negotiation process, the auction mechanism in Economics was introduced,and an improved task negotiation process based on Multi-Unit Combinatorial Auction was proposed. It allocated task dynamically through capability classification and independent competition. A kind of multi-robot cooperative pursuit algorithm that allows dynamic alliance is proposed. Simulation results show the feasibility and validity ofthe given algorithm.

关键词： Multipurpose robots

来源：评论

学校读者我要写书评

暂无评论

Analysis and Design of Mobile Model for DTN

引用

Chinese Journal of Electronics 2023年第4期18卷 635-638页

作者： Zhiting Lin Yugui Qu Yusheng Ji Baohua Zhao Department of Computer Science University of Science and Technology of China Hefei China Province Key Laboratory of Software in Computing and Communication Hefei China Information Systems Architecture Science Research Division National Institute of Informatics Tokyo Japan

Delay tolerant networks may become unexpectedly partitioned due to node mobility or variation in signal strength. However, most widely used models in some relative works are generally very simplistic. In order to exploit intelligent forwarding algorithms, a novel nodal mobile model of delay tolerant networks is presented to map reality with more accuracy. And several approaches are introduced to analyze the network structure, such as n-cliques, n-clans, degree, closeness and betweenness. Our research results showed that the centralizations became smaller when the wireless connections were concerned. It meant that quite a number of nodes became potential relays because of the new structure of networks.

关键词： Wireless communication Analytical models Wireless sensor networks Protocols Social networking (online) Sensitivity analysis Social network theory

来源：评论

学校读者我要写书评

暂无评论

Physical Layer Covert communication in B5G Wireless Networks - its Research, Applications, and Challenges

引用

Proceedings of the IEEE 2024年第1期112卷 47-82页

作者： Jiang, Yu'e Wang, Liangmin Chen, Hsiao-Hwa Shen, Xuemin University Key Laboratory of Intelligent Perception and Computing of Anhui Province Anqing Normal University Anqing246011 China Southeast University School of Cyber Science and Engineering Nanjing211189 China National Cheng Kung University Department of Engineering Science Taiwan70101 Taiwan University of Waterloo Department of Electrical and Computer Engineering WaterlooN2L 3G1 Canada

Physical layer covert communication is a crucial secure communication technology that enables a transmitter to convey information covertly to a recipient without being detected by adversaries. Unlike typical cryptography and physical layer security systems that concentrate on protecting the sent signal content, covert communications seek to conceal the existence of legitimate transmission. Thus, with beyond fifth-generation (B5G) wireless communications, covert communications can operate in tandem or as a supplement to conventional security techniques. We provide an extensive overview of the basic theories and several strategies in physical layer covert communications in this article. In particular, we go into great detail about the basic theories of physical layer covert communications, such as channel models, codes, secret keys, and covertness metrics, as well as various covert schemes in progressively more complicated scenarios, such as covert communications in single-antenna and multiantenna three-node systems and covert communications in jammer- and relay-aided systems. In addition, we identify the challenges and future directions for research on covert communications in B5G wireless networks. © 1963-2012 IEEE.

关键词： Transmitters

来源：评论

学校读者我要写书评

暂无评论

IPRAR: A DFG-based approach to instruction clustering for multicluster VLIW DSP processor with SIMD structure

引用

Journal of Computational Information Systems 2014年第3期10卷 1257-1269页

作者： Yang, Yangzhao Gu, Naijie Zhao, Zeng Ren, Kaixin School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Anhui Province Key Laboratory of Computing and Communication Software Hefei 230027 China USTC and Loongson Technology Associated Laboratory Institute of Advanced Technology University of Science and Technology of China Hefei 230027 China

Modern Very Long Instruction (VLIW) DSP can improve performance by using instruction-level parallelism (ILP) and obtain better parallelism through instruction clustering. The essence of clustering is resource allocation. Traditional clustering method assumes that one instruction can only be assigned to a certain cluster, which is inapplicable to the architecture with SIMD structure. To address this issue, this paper presents IPRAR, a novel instruction clustering algorithm for the features of SIMD structure based on DFG. Due to considering the features of SIMD structure, IPRAR can be implemented on BWDSP100 with satisfactory. Besides, IPRAR can make the load of cluster more balanced and minimize the intercluster communication overload. Finally, numerous experiment results show that the IPRAR has an average of 7-10% performance improvement compared to the traditional methods. © 2014 Binary Information Press.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Completion time-a ware flow scheduling in heterogenous networks 1

引用

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： He, Shiming Xie, Kun Zhang, Dafang Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication Engineering Hunan Province Engineering Research Center of Electric Transportation and Smart Distributed Network Changsha University of Science and Technology Changsha410114 China College of Computer Science and Electronics Engineering Hunan University Changsha410082 China Department of Electrical and Computer Engineering State University of New York at Stony Brook NY United States

ISBN: (数字)9783319271194

ISBN: (纸本)9783319271187

In China, the expressway isn’t free. When a vehicle exits, the exit toll station needs to calculate the toll according to the vehicle trajectory obtained by sending a trajectory query task to the trajectory center remotely. For the accurate of toll and keep the exit smoothly, transmitting the trajectory result reliably and in time is a key issue. There are three heterogenous networks in expressway, Fibernet, Telecommunications Network and 3G. We concurrently exploit three heterogenous networks by allocating the trajectory result into three sub-flows where each sub-flow is transmitted in one kind of networks. But existing multipath transfer solution(FMTCP) doesn’t consider the difference of completed time among all sub-flows and can’t make sure the completed time in time. Therefore, we formulate the sub-flows schedule as a integer programming problem, which is proved to be NP-hard problem, and propose a Completion time-aware Flow Scheduling scheme (CaFS) which calculates the size of sub-flows. For the reliably, it exploits generation-based network coding. For the transmission in time, CaFS allocates the size of sub-flow into suitable generation and scheduling the generations. The simulation results demonstrate that, comparing with the FMTCP, CaFS improves 31. 9% in completion time and 30% in task finished rate. © Springer International Publishing Switzerland 2015.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Optimizing BLAS2 for a decoupled access/execute architecture processor

引用

Journal of Computational Information Systems 2014年第3期10卷 1231-1241页

作者： Zhao, Zeng Gu, Naijie Yang, Yangzhao Ren, Kaixin School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China USTC and Loongson Technology Associated Laboratory Institute of Advanced Technology University of Science and Technology of China Hefei 230027 China Anhui Province Key Laboratory of Computing and Communication Software Hefei 230027 China

Basic Linear Algebra Subroutines (BLAS) is a widely used basic mathematical library for high-performance computing. It has a great impact on the performance of supercomputers. This paper focuses on memory accessing optimization for the level-2 library of BLAS (BLAS2) based on Godson-3B chips. The key contribution of this work is proposing several methods to make full use of the Godson-3B's hardware features, as well as to improve the performance of memory access. GEMV, the kernel function of BLAS2, is selected to demonstrate the optimization methods for Godson-3B. Using Single Instruction Multiple Data (SIMD) instructions, Direct Register Access (DRA) and Direct Cache Access (DCA) of Godson-3B, two optimization algorithms for GEMV are introduced in this paper. Experiments show that the best computing performance of the optimized GEMVs on Godson-3B is more than 1.8Gops, which is far superior to that of other versions. While the test scale of GEMVs is greater than the size of L2-cache, its average performance exceeds UBLAS and OpenBlas, the two most famous optimized BLAS libraries for GODSON, by more than 60% and 20% respectively. © 2014 Binary Information Press.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Ant colony optimization for enhancing scheduling reliability in wireless sensor networks

Ant colony optimization for enhancing scheduling reliability...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Xiao-Min Hu Jun Zhang Department of Computer Science Key Laboratory of Intelligent Sensor Networks Ministry of Education Key Laboratory of Software Technology Education Department of Guangdong Province Sun Yat-sen University China

In the application of wireless sensor networks (WSNs), energy efficiency is always an important topic for extending the network lifetime. Scheduling the operation modes of sensors can reduce the energy wasted by redundant sensors, but frequent alterations of sensors' modes and different data transmission routes influence the reliability of the WSN. In this paper, a novel algorithm for maximizing the reliable working lifetime of a WSN is proposed. The considered problem restricts the minimum working period of the sensors before changing their operation modes. In order to extend the working lifetime of a reliable WSN, the proposed algorithm adopts the ant colony optimization (ACO) for finding the maximum number of reliable working periods of sensors. The performance of the proposed algorithm has been tested on various WSNs and compared with the state-of-the-art algorithms. The results show that the proposed algorithm can enhance the scheduling reliability of WSNs.

关键词： Sensors Wireless sensor networks Reliability Energy consumption Heuristic algorithms Data communication Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Test wrapper optimization technique using BDF and GA for 3D IP cores 5

Test wrapper optimization technique using BDF and GA for 3D ...

引用

5th International Conference on Computing communication and Networking Technologies, ICCCNT 2014

作者： Liu, Jun Qian, Qingqing Wu, Xi Ren, Fuji Wang, Wei Chen, Tian School of Computer and Information Hefei University of Technology Hefei230009 China AnHui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of Technology Hefei230009 China Department of Information Science and Intelligent Systems Faculty of Engineering University of Tokushima Tokushima7708502 Japan

ISBN: (纸本)9781479926961

To reduce pre-bond and post-bond test cost for 3D IP (Three Dimensional Intellectual Property) cores, this paper proposed a test wrapper optimization technique using BFD(Best Fit Decreasing) and GA (Genetic Algorithm) algorithm under the constraints of TSVs(Through Silicon Vias) number, the proposed technique firstly used BFD to balance the length of pre-bond wrapper chains to reduce pre-bond test time. Then, on the basis of optimization results of pre-bond wrapper chains, the GA was used to stitch pre-bond wrapper chains to form balanced post-bond wrapper chains under the constrained TSVs number to reduce hardware overhead and post-bond test time. Experimental results demonstrated the presented methodology can effectively reduce hardware overhead at the cost of little increased test time. © 2014 IEEE.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

Smoothness in noise reduction of chaotic time series

Smoothness in noise reduction of chaotic time series

引用

2011 International Conference on computers, communications, Control and Automation

作者： Chenxi Shao Jiangong Ji Jingyuan Shao Lipeng Xiao Department of Computer Science and Technology University of Science and Technology of China Department of Modern Physics and Nonlinear Science Center University of Science and Technology of China Anhui Province Key Laboratory of Software in Computing and Communication Information center Jianghuai Automobile Co.Ltd.

Noise is an omnipresent phenomenon. It obscures the real behavior of dynamical system. Lots of methods are proposed to remove the noise contaminating time series. However, almost all the methods consider the noise reduction in the phase space and often sharp points are kept. Different with these methods, this paper proposes a method directly on the time series itself, considering the gauss noise feature and the smoothness of the real data, uses curve-fitting way to eliminate the sharp points. The numeral results verify the effectiveness of our method.

关键词： smoothness,noise reduction,curve-fitting,Local-Geometric-Projection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：