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

Coverage-preserving Data Gathering in Wireless Sensor Networks

Coverage-preserving Data Gathering in Wireless Sensor Networ...

ACIS International Conference on software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed computing (SNPD)

作者： Hongli Xu Liusheng Huang Jumin Wu Yang Wang Depart. of Computer Science and Technology Anhui Province key Laboratory of Software in Computing and Communication University of Science and Technology Hefei China

The power is the most significant resource in wireless sensor nodes, so energy conservation is the most important factor in designing the protocol for sensor networks. In this paper, we study the problem of energy-efficient collection of the physical information from the target area. The coverage-preserving data gathering (CPDG) problem is to build up a tree, which minimizes the total energy consumption, and preserves the original coverage to ensure the result correctness. This problem can be formalized as 0-1 integer linear programming, and solved by an efficient heuristic algorithm. Furthermore, an improved algorithm is also proposed to balance the energy consumption among all the sensor nodes. The experimental results show that CPDG algorithm can conserve the energy about 30% of PEDAP protocol, which is regarded as one of the most efficient data gathering protocols as we know.

关键词： Wireless sensor networks Energy efficiency Energy consumption Heuristic algorithms Monitoring Distributed computing Computer networks Energy conservation Wireless application protocol Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A Hormone-based Clustering Algorithm in Wireless Sensor Networks

A Hormone-based Clustering Algorithm in Wireless Sensor Netw...

引用

2010 2nd International Conference on Computer Engineering and Technology(2010年第二届计算机工程与技术国际会议 ICCET 2010)

作者： Dayuan Dong Haifeng You Yipeng Zhang Xufa Wang Key Laboratory of Software in Computing and Communication Anhui Province School of Computer Science and Technology University of Science and Technology of China HefeiChina

ISBN: (纸本)9781424463473;9781424463497;9781424463503

Clustering problem is one of the hottest issues in wireless sensor networks (WSNs). The strategy for selection of cluster head has not been sufficiently investigated. In this paper,we propose a hormone-based clustering algorithm (HCA) inspired by the communication mechanism of bioendocrine system to prolong the lifetime of the sensor nodes. Two kinds of hormones,cluster hormone and member hormone,are used in the algorithm. Hormone message can promote a node to become a cluster head or a member node. Comparative experiment shows that the proposed algorithm has effectively prolong the lifetime of WSN compared with LEACH[1] and HEED[2].

关键词： hormone:clustering:wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Z-NetMF: A Biased Embedding Method Based on Matrix Factorization 9th

Z-NetMF: A Biased Embedding Method Based on Matrix Factoriza...

引用

9th International Conference on communications, Signal Processing, and Systems, CSPS 2020

作者： Sun, Yuchen Wan, Liangtian Sun, Lu Wang, Xianpeng Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province School of Software Dalian University of Technology Dalian116620 China Department of Communication Engineering Institute of Information Science Technology Dalian Maritime University Dalian116026 China State Key Laboratory of Marine Resource Utilization in South China Sea and School of Information and Communication Engineering Hainan University Haikou570228 China

ISBN: (纸本)9789811584107

Network embedding represents the graph in low dimensions, improving the processing of big scale tasks. As node2vec can only be modeled as a tensor, and NetMF cannot be generalized to a biased form directly. In this paper, we draw Z-Laplacian, a framework that describes the dynamic process on the graph, into NetMF, so that NetMF can be extends to a biased form. The biased version of NetMF is named as Z-NetMF. We analyze the biased random walk in the view of graph signal processing and prove the effectiveness of Z-NetMF in the node classification task. The result shows that Z-NetMF outperforms the comparison methods, NetMF and node2vec. © 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Network embeddings

来源：评论

学校读者我要写书评

暂无评论

Accurate classification of time series based on a new robust similarity measure

引用

Journal of Computational Information Systems 2013年第9期9卷 3521-3528页

作者： He, Xiaoxu Shao, Chenxi Xiong, Yan School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230027 China

Among different time series data mining, time series classification is one of the most important aspects. How to design a suitable similarity measure of similarity is a burning issue for accurate time series classification. In this paper, we propose a new similarity measure based on feature exaction of the original time series. The new similarity measure is used in classification with the nearest neighbor rule. In order to provide a comprehensive comparison, we conducted three sets of experiments, testing effectiveness on different time series datasets from a wide variety of application domains. Experimental evaluations show that the proposed similarity measure can tolerate the most distortions than other three typical similarity;besides, the new classifier is not only superior to other conventional classifier, but also more excellent in 1nn classifier than other similarity measure. © 2013 by Binary Information Press.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Load-Balanced and Length-Minimized Link Scheduling for Multi-Channel TDMA Wireless Mesh Networks

引用

Chinese Journal of Electronics 2023年第4期19卷 733-736页

作者： Junfeng Jin Baohua Zhao Hao Zhou School of Computer Science and Technology University of Science and Technology of China Hefei China State Key Laboratory of Networking and Switching Technology Beijing China Province Key Laboratory of Software in Computing and Communication Hefei China

To minimize the length of scheduling and guarantee the load balance of channels, a Load-balanced and length-minimized link scheduling (LBLM) algorithm is proposed. LBLM algorithm is a heuristic scheme, which assigns time slots for unicast traffic based on link's weight and hop-count in the routing traffic tree. Thus the algorithm considers both primary and secondary interference, as well as guarantees the proportional fairness. The ns2 simulation results show that in multi-channel TDMA Wireless mesh networks (WMNs), the proposed algorithm has the benefits of lower complexity, shorter frame length and better channel balance compared to other well-known schedule mechanisms.

关键词： Wireless communication Time division multiple access Schedules Unicast Simulation Wireless mesh networks Routing

来源：评论

学校读者我要写书评

暂无评论

Test Case Generation Based on Program Invariant and Adaptive Random Algorithm

Test Case Generation Based on Program Invariant and Adaptive...

引用

Advances in Information Technology and Education

作者： Yuan Yuan Zeng Fanping Zhu Guanmiao Deng Chaoqiang Xiong Neng Department of Computer University of Science and Technology of China Anhui Province Key Lab of Software in Computing and Communication

Testing is a critical activity to find software errors. And choosing an effective test suite is the key problem in software testing area. Program invariant, as an attribute of program, can record the implementation state of test case very well and reveal the coverage of program data. In this paper, we integrate adaptive random testing and invariant technology, and present a new method which makes full use of the feedback information of program invariant and invalid case suite to generate the next case. Experiment results show that, compared with other similar methods, running for the same time, our method can achieve higher coverage and faster convergence speed.

关键词： Random testing Program invariant Adaptive random algorithm Test case generation

来源：评论

学校读者我要写书评

暂无评论

A Gong-Si-Shaped Heterogeneous Circular-Polarization Array for 5G Application 5

A Gong-Si-Shaped Heterogeneous Circular-Polarization Array f...

引用

5th IEEE International Conference on Electronic Information and communication Technology, ICEICT 2022

作者： Zhou, Wei Qi, Junwei Li, Yingsong Huang, Zhixiang Yang, Lixia College of Information and Communication Engineering Harbin Engineering University 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 Hefei China

ISBN: (数字)9781665472111

ISBN: (纸本)9781665472111

In this work, a Gong-Si-shaped circularly polarized (CP) array with power driver for 5G is proposed. The radiator of the constructed CP array consists of two Chinese-like characters ' and '' with the similar size and pronunciation of 'gong' and 'si', Two L-shaped feeding probes of the same size are connected to the designed power driver printed on the bottom layer of ground plate, and the array can radiate circular polarization electromagnetic waves by changing the positions of the L-shaped probes and the angle of the horizontal parts of the L-shaped probes. From the simulating and optimizing, it is finally obtained that the -15 dB bandwidth of modeled Gong-Si-like CP antenna lies in 2.49 - 2.81 GHz and the presented Gong-Si-like CP antenna has a axial bandwidth covering 2.36 - 2.82 GHz, which meets the n41 5G band implementing at 2.515 - 2.675 GHz. © 2022 IEEE.

关键词： Circular polarization

来源：评论

学校读者我要写书评

暂无评论

The Library for Hadoop Deflate Compression Based on FPGA Accelerator with Load Balance 20

The Library for Hadoop Deflate Compression Based on FPGA Acc...

引用

20th International Conference on Parallel and Distributed computing, Applications and Technologies, PDCAT 2019

作者： Du, Haixin Zhang, Jiankui Sha, Shihao Ye, Cai Luo, Qiuming College of Computer Science and Software Engineering Shenzhen University NHPCC/Guangdong Key Laboratory of Popular HPC Guangdong Province Engineering Center of China-made High Performance Data Computing System Shenzhen China

ISBN: (纸本)9781728126166

Hadoop application will produce lots of intermediate results in the map/reduce process that requires disk I/O and network transmission. By compressing the large-scale data of intermediate result, it will greatly improve disk access efficiently and reduce program run time. Hardware-accelerated solutions have become more desirable. This paper design a multi-FPGA compression accelerator on the Hadoop platform, and the system performance analysis compared with a software-only solution that mainly uses CPU to processing. The testing programs are zpipe, TestDFSIO and Terasort. In contrast with the software-only solution. The max speedup of zpipe is 6.55X (single FPGA) and 10.24X (dual FPGA), the max speedup of TestDFSIO is 6.28X (single FPGA) and 6.28X (dual FPGA), and the max speedup of Terasort application is up to 3.25X(single FPGA) and 3.35X(dual FPGA). © 2019 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Multi-swarm particle swarm optimization with multiple learning strategies 14

Multi-swarm particle swarm optimization with multiple learni...

引用

16th Genetic and Evolutionary Computation Conference Companion, GECCO 2014 Companion

作者： Peng, Meng-Qi Gong, Yue-Jiao Li, Jing-Jing Lin, Ying-Biao Department of Computer Science Sun Yat-sen University China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China Key Laboratory of Software Technology Education Department of Guangdong Province China School of Computer Science South China Normal University China

ISBN: (纸本)9781450328814

Inspired by the division of labor and migration behavior in nature, this paper proposes a novel particle swarm optimization algorithm with multiple learning strategies (PSO-MLS). In the algorithm, particles are divided into three sub-swarms randomly while three learning strategies with different motivations are applied to each sub-swarm respectively. The Traditional Learning Strategy (TLS) inherits the basic operations of PSO to guarantee the stability. Then a Periodically Stochastic Learning Strategy (PSLS) employs a random learning vector to increase the diversity so as to enhance the global search ability. A Random Mutation Learning Strategy (RMLS) adopts mutation to enable particles to jump out of local optima when trapped. Besides, information migration is applied within the intercommunication of sub-swarms. After a certain number of generations, sub-swarms would aggregate to continue search, aiming at global convergence. Through these learning strategies and swarm aggregation, PSO-MLS possesses both good exploration and exploitation abilities. PSO-MLS was tested on a set of benchmarks and the result shows its superiority to gain higher accuracy for unimodal functions and better solution quality for multimodal functions when compared to some PSO variants.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

PN-HASH: An Immune-Inspired Scheme for Data Integrity Check

PN-HASH: An Immune-Inspired Scheme for Data Integrity Check

引用

International Workshop on Advanced Computational Intelligence (IWACI)

作者： Junteng Wang Wenjian Luo Yamin Hu Hao Jiang 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 China

ISBN: (数字)9781728142487

ISBN: (纸本)9781728142494

Cryptographic hash functions play significant roles in information security applications, including data integrity. Facing hash collision attacks, several prevalent cryptographic hash functions have been proved not safe enough. In this paper, we propose a simple scheme for data integrity check called PN-HASH (Positive hash and Negative hash). PN-HASH is inspired by the negative representation of information, which is a research branch in the field of immune computation. This scheme computes two hash values of the input message and its negative representation. The resulting hashes are called the positive hash and the negative hash, respectively. The proposed scheme is simple but can improve the resistance to hash collision attacks. Furthermore, for more flexibility and higher security, we propose three extensions of PN-HASH. Security and complexity analyses show that PN-HASH could improve the security of underlying cryptographic hash functions, with approximately twice cost of them. To give exact examples, we present PN-MD5, an implementation of PN-HASH based on MD5.

关键词： Cryptography Data integrity Databases Resistance Complexity theory Face

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：