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

2022 International Applied Computational Electromagnetics Society Symposium, ACES-China 2022

作者： Yao, Yichang Shi, Wanlu Li, Yingsong Huang, Zhixiang Yang, Guohui Zhang, Kuang Harbin Engineering University College of Information and Communication Engineering Harbin150001 China Anhui Province Key Laboratory of Target Recognition and Feature Extraction LuAn230088 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education China School of Electronics and Information Engineering Harbin Institute of Technology Harbin150086 China

ISBN: (纸本)9781665452366

A low coupling sparse array (LCSA) is presented, analyzed and discussed on the basis of the recent proposed uniform linear array (ULA) fitting scheme with close-expressions, and its performance with different uniform subarrays in the basic layer is investigated via parameter estimation like direction-of-arrival(DOA). The results gives a superior performance for the presented LCSA. © 2022 IEEE.

关键词： Low mutual coupling sparse array uniform linear array fitting

来源：评论

学校读者我要写书评

暂无评论

A Global-Energy-Balancing Real-Time Routing in Wireless Sensor Networks

A Global-Energy-Balancing Real-Time Routing in Wireless Sens...

引用

IEEE Asia-Pacific Conference on Services computing (APSCC)

作者： Peilong Li Yu Gu Baohua Zhao Department of Computer Science Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei Anhui China

Many applications in wireless sensor networks like video surveillance have the requirement of timely data delivery. Real-time routing is needed in these applications. Because of the limitation of node energy, energy efficiency is also an important concern in routing protocol design in order to increase the network lifetime. In this paper, we propose a global-energy-balancing routing scheme (GEBR) for real-time traffic based on directed diffusion (DD), which balances node energy utilization to increase the network lifetime. GEBR can find an optimal path in sensor networks for data transfer considering global energy balance and limited delivery delay. Simulation results show that GEBR significantly outperforms DD in uniform energy utilization. GEBR achieves better global energy balance and longer network lifetime. The time for real-time service of the sensor networks using GEBR is prolonged by about 4.37% and the network lifetime is prolonged by 44.6%.

关键词： Wireless sensor networks Routing protocols Delay Computer networks Energy efficiency Computer science Laboratories Wireless application protocol Global Positioning System Video surveillance

来源：评论

学校读者我要写书评

暂无评论

Evolutionary repair for evolutionary design of combinational logic circuits

Evolutionary repair for evolutionary design of combinational...

引用

Congress on Evolutionary Computation

作者： Xin Zhang Wenjian Luo School of Computer Science and Technology Anhui Province key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

Evolutionary algorithms have been adopted to design logic circuits for many years. However, it takes too much time for evolutionary algorithms to generate circuits directly. Recently, the repair technique has been introduced into evolutionary design of the circuit to significantly decrease the time cost. And yet, the repair technique costs a lot of gate resource. In this paper, the evolutionary repair for evolutionary design of the combinational circuit is proposed, which generates the repair circuits with an evolutionary algorithm. The evolutionary repair could reduce the gate resource cost and does not spend much more time. The evolutionary repair is merged into the traditional evolutionary algorithm to form a novel evolutionary design algorithm, i.e. the erEDA. The experimental results demonstrate that the erEDA could balance the time cost and the gate resource consumption.

关键词： Maintenance engineering Logic gates Evolutionary computation Vectors Pins Adders Layout

来源：评论

学校读者我要写书评

暂无评论

A Secure Routing Protocol with Malicious Nodes Detecting and Diagnosing Mechanism for Wireless Sensor Networks

A Secure Routing Protocol with Malicious Nodes Detecting and...

引用

IEEE Asia-Pacific Conference on Services computing (APSCC)

作者： Yuan-xi Jiang Bao-hua Zhao Department of Computer Science Anhui Province Key Laboratory of software in Computing and Communication University of Science and Technology Hefei Anhui China

Routing protocol security is the key element in the research of secure wireless sensor networks. Due to its special characteristic, designing security routing protocol is a challenge in these networks. A secure routing protocol with malicious nodes detecting and diagnosing mechanism is used to reduce the malicious nodes' threat to the WSNs.

关键词： Routing protocols Wireless sensor networks Data security Monitoring communication system security Computer networks Sensor phenomena and characterization Cryptography Relays Resumes

来源：评论

学校读者我要写书评

暂无评论

Many-Modal Optimization by Difficulty-Based Cooperative Co-evolution

Many-Modal Optimization by Difficulty-Based Cooperative Co-e...

引用

IEEE Symposium Series on Computational Intelligence (SSCI)

作者： Wenjian Luo Yingying Qiao Xin Lin Peilan Xu Mike Preuss Anhui Province Key Laboratory of Software Engineering in Computing and Communication School of Computer Science and Technology University of Science and Technology of China Hefei Anhui China

ISBN: (数字)9781728124858

ISBN: (纸本)9781728124865

Evolutionary multimodal optimization has received considerable attention in the past decade. Most existing evolutionary multimodal optimization algorithms are designed to solve problems with relatively few global optima. However, in real-world applications, the problems can possess a lot of global optima (and sometimes acceptable local optima). Finding more global optima can help us learn more about their landscapes and distributions. However, solving these problems with limited computational resources is a challenge for current algorithms. In this paper, many-modal optimization problems are studied, and each of them has more than 100 global optima. We first present a benchmark with 10 many-modal problems based on the existing multimodal optimization benchmarks. The numbers of global optima of these 10 problems vary from 108 to 7776. Second, we propose the difficulty-based cooperative co-evolution (DBCC) strategy for solving many-modal optimization problems. DBCC comprises four primary steps: problem separation, resource allocation, optimization, and solution reconstruction. The clonal selection algorithm is selected as the optimizer in DBCC. Experimental results demonstrate that DBCC provides satisfactory performance.

关键词： Optimization Benchmark testing Sociology Statistics Heuristic algorithms Resource management Search problems

来源：评论

学校读者我要写书评

暂无评论

Secure Location Verification Using Hop-Distance Relationship in Wireless Sensor Networks

Secure Location Verification Using Hop-Distance Relationship...

引用

IEEE Asia-Pacific Conference on Services computing (APSCC)

作者： Yongsheng Liu Hao Zhou Baohua Zhao Department of Computer Science Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei Anhui China

With the growing prevalence of wireless sensor networks comes a new need for location-based access control mechanisms. Thus we need a method to perform location verification to enforce location-based access to information resources. In this work, a statistic location verification algorithm in randomly deployed sensor networks is proposed. The nodes in the networks are classified to three roles. The claimer broadcasts the position message. The witnesses rebroadcast it and report the distance and lowest hop information to the verifier. The verifier makes use of hypothesis tests to make a decision. At last the simulation results confirm the validation of the algorithm.

关键词： Wireless sensor networks Computer networks Access control Information resources Statistics Broadcasting Computer science Laboratories Testing Computer worms

来源：评论

学校读者我要写书评

暂无评论

Zone routing protocol based on energy consumption

引用

Jisuanji Gongcheng/Computer engineering 2006年第12期32卷 117-118+135页

作者： Zhai, Weifeng Gu, Naijie Zhang, Jianming Department 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

A zone routing protocol based on the energy consumption speed of nodes in mobile Adhoc networks is presented. A route select parameter computed by residual lifetime of nodes and hop count of route is used to be selected the best route, the nodes that have more energy have more probability of chosen. The mechanism can balance the energy consumption of node and prolong network's life. Simulation result comparing with zone routing protocol in NS-2 shows EZRP has less number of death nodes, lower routing overhead, and longer lifetime of network.

关键词： Energy consumption EZRP Hybrid routing protocol MANET

来源：评论

学校读者我要写书评

暂无评论

Community-based 3-SAT formulas with a predefined solution

arXiv

引用

arXiv 2019年

作者： Hu, Yamin Luo, Wenjian Wang, Junteng Anhui Province Key Laboratory of Software Engineering in Computing and Communication School of Computer Science and Technology University of Science and Technology of China China

It is crucial to generate crafted SAT formulas with predefined solutions for the testing and development of SAT solvers since many SAT formulas from real-world applications have solutions. Although some generating algorithms have been proposed to generate SAT formulas with predefined solutions, community structures of SAT formulas are not considered in these algorithms. Consequently, we propose a 3-SAT formula generating algorithm that not only guarantees the existence of a predefined solution, but also simultaneously considers community structures and clause distributions. The proposed 3-SAT formula generating algorithm controls the quality of community structures through controlling (1) the number of clauses whose variables have a common community, which we call intra-community clauses, and (2) the number of variables that only belong to one community, which we call intra-community variables. For a SAT formula, more intra-community clauses and intracommunity variables, higher quality of community structures. To study the combined effect of community structures and clause distributions on the hardness of SAT formulas, we measure solving runtimes of two solvers, gluHack (a leading CDCL solver) and CPSparrow (a leading SLS solver), on the generated SAT formulas under different groups of parameter settings. Through extensive experiments, we obtain some noteworthy observations on the SAT formulas generated by the proposed algorithm: (1) The community structure has little or no effects on the hardness of SAT formulas with regard to CPSparrow but a strong effect with regard to gluHack. (2) Only when the proportion of true literals in a SAT formula in terms of the predefined solution is 0.5, SAT formulas are hard-to-solve with regard to gluHack;when this proportion is below 0.5, SAT formulas are hard-to-solve with regard to CPSparrow. (3) When the ratio of the number of clauses to that of variables is around 4.25, the SAT formulas are hard-to-solve with regard to both glu

关键词： Hardness

来源：评论

学校读者我要写书评

暂无评论

A qualitative modeling and simulation method based on cloud model

A qualitative modeling and simulation method based on cloud ...

引用

2013 5th International Conference on Modeling, Simulation and Applied Optimization, ICMSAO 2013

作者： Shao, Chenxi Sun, Kelu Zhenzhong, Shao Computer Science and Technology Dept. University of Science and Technology of China Hefei 230027 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230027 China Jianghuai Automobile Co. Ltd. Hefei 230022 China

ISBN: (纸本)9781467358149

Qualitative simulation is effective methods processing incomplete knowledge, how to represent qualitative knowledge and reduce spurious behaviors is its research emphasis. Contraposing the limitations of existing methods representing qualitative knowledge and filtering spurious behaviors, an approach is proposed to qualitatively model and simulate on the basis of normal cloud model. In this research, the cloud numeric characteristics and cloud measurement are introduced into this approach;consequently, it can more accurately assess the qualitative knowledge, and expand the variables expression and quantity space;meanwhile, it is constructed the means of modeling and simulation by adopting more amply portraying the system status, more intuitively transforming status and more accurately filtering spurious behaviors. Furthermore, in simulation algorithm, cloud measurement indices are employed to significantly select the successor status which can not be determined by existing constraint means. The results of simulation example demonstrate that our approach effectively improves the ability to filter spurious behaviors, and it is a feasible method. © 2013 IEEE.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

NURBS model for chaotic time series

NURBS model for chaotic time series

引用

2011 3rd International Conference on Computer Research and Development, ICCRD 2011

作者： Shao, Chenxi Xiao, Lipeng Department of Computer Science and Technology University of Science and Technology of China Hefei China Department of Modern Physics Nonlinear Science Center University of Science and Technology of China Hefei China Anhui Province Key Laboratory of Software in Computing and Communication Hefei China

ISBN: (纸本)9781612848372

NURBS method is extensively used in the field of Geometric Modeling. Since the original NURBS method does not have time factor, it can not display the huge advantage in the dynamics field. In this article, inspired by the segmented nature of basis functions, we propose a time factor method which can be directly applied in reconstruction of missing data, with remarkable performance in matching the original data. This work does not only give an expression of chaotic time series, but also highlights a possible way for the challenge in reconstruction of missing data. © 2011 IEEE.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：