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

Self-adaptive method dealing with the end issue of EMD

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2007年第10期35卷 1944-1948页

作者： Shao, Chen-Xi Wang, Jian Fan, Jin-Feng Yang, Ming Wang, Zi-Cai MOE-Microsoft Key Laboratory of Multimedia Computing and Communication University of Science and Technology of China Hefei 230026 China Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 China Control and Simulation Center Harbin Institute of Technology Harbin 150001 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230027 China

The empirical mode decomposition (EMD) developed by Huang etc. of NASA is an advanced method for signal analysis. But there is an involved end issue in the course of getting two envelops of the data using spline interpolation. A self-adaptive method to dealing with the end issue is proposed. Generally, it extends the externa sequence near the ends of the data by the most suited sequence in the inner data. For the chosen inner sequence has the most similarity of tendency with the ends, the data extension is reasonable. After the extension, the spline does not swing at both ends of the data. The result of experiment proved that the method can be used to solve the end issue effectively.

关键词： Signal analysis

来源：评论

学校读者我要写书评

暂无评论

Topological hole detection in sensor networks with cooperative neighbors

Topological hole detection in sensor networks with cooperati...

引用

2nd International Conference on Systems and Networks communications, ICSNC 2006

作者： Kun, Bi Kun, Tu Naijie, Gu Wanli, Dong Xiaohu, Liu Department of Computer Science and Technology University of Science and Technology of China Hefei Anhui 230027 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui 230027 China

ISBN: (纸本)0769526993

In a wireless sensor network, the regions in which a large percentage of sensor nodes are not available may form holes in the network. In holes, sensor nodes may be depleted or not dense enough to communicate with others. So those holes may degrade some applications' performances in sensor networks. In this paper, we study the problem of detecting topological holes in sensor networks with no localization information in any node. We present a distributed cooperative scheme which is only based on the communication topology graph. To identify holes, each node only needs to exchange information with its 1-hop and 2-hop neighbors. With the cooperation of its 2-hop neighbors, each node could independently decide whether it is on the boundary of a hole. Experimental results demonstrate that our algorithm could indeed capture the characteristics of those boundary nodes and describe those holes in sensor networks of moderate node densities. © IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Mac address assignment in wireless sensor networks: A mixed strategy game approach

Mac address assignment in wireless sensor networks: A mixed ...

引用

2nd International Conference on Systems and Networks communications, ICSNC 2006

作者： Kun, Tu Kun, Bi Naijie, Gu Wanli, Dong Xiaohu, Liu Department of Computer Science and Technology University of Science and Technology of China Hefei Anhui 230027 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui 230027 China

ISBN: (纸本)0769526993

In this paper, we address the problem of MAC address assignment in wireless sensor networks. A novel scheme for MAC address assignment is proposed to reduce the overhead. We model the problem from the game theoretical view, prove there exists a mixed strategy Nash equilibrium in the model, and propose a distributed address assign algorithm to achieve the equilibrium, which takes the advantage of the exploitation of spatial address reuse to save energy. Simulation results demonstrate that our algorithm is efficient even for very large-scale networks, which makes it a potential candidate for practical applications. © IEEE.

关键词： Medium access control

来源：评论

学校读者我要写书评

暂无评论

Coverage and Exposure Paths in Wireless Sensor Networks

引用

Journal of computer Science & Technology 2006年第4期21卷 490-495页

作者：黄刘生徐宏力汪炀吴俊敏李虹 Department of Computer Science and Technology University of Science & Technology of China Hefei 230027 P.R. China Anhui Province-Most Co-Key Laboratory of High Performance Computing and Its Application Hefei 230027 P.R. China

Wireless sensor networks have posed a number of challenging problems such as localization, deployment and tracking, etc. One of the interesting problems is the calculation of the coverage and exposure paths for the sensor networks. This paper presents a fully localized algorithm to solve the worst coverage problem first introduced by Meguerdichian et al. The nodes of the sensor network cooperate to construct the worst coverage path only by the one-hop neighbor＇s information, thus avoiding the massive communication and conserving the energy. The correctness of the proposed algorithm is proved formally under the sensing diminishing model. Moreover, this algorithm can be easily extended to solve the minimal exposure problem with local information as well.

关键词： coverage wireless sensor networks localized algorithm exposure

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Study on Parallel Computing

引用

Journal of computer Science & Technology 2006年第5期21卷 665-673页

作者：陈国良孙广中张云泉莫则尧 Anhui Province-MOST Key Co-Lab of High Performance Computing and Its Applications Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 P.R. China Laboratory of Parallel Computing Institute of Software Chinese Academy of Sciences Beijing 100080 P.R. China Laboratory of Computational Physics Institute of Applied Physics and Computational Mathematics Beijing 100088 P.R. China

In this paper, we present a general survey on parallel computing. The main contents include parallel computer system which is the hardware platform of parallel computing, parallel algorithm which is the theoretical base of parallel computing, parallel programming which is the software support of parallel computing. After that, we also introduce some parallel applications and enabling technologies. We argue that parallel computing research should form an integrated methodology of ＂architecture algorithm programming application＂. Only in this way, parallel computing research becomes continuous development and more realistic.

关键词： parallel computing parallel architecture parallel programming parallel algorithm parallel application

来源：评论

学校读者我要写书评

暂无评论

An Evolutionary Support Vector Machines Classifier for Pedestrian Detection

An Evolutionary Support Vector Machines Classifier for Pedes...

引用

2006 IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： D. Chen X.b. Cao Y.w. Xu H. Qiao Department of Computer Science and Technology University of Science and Technology Hefei China Anhui Province Key Laboratory Software Computing and Communication Hefei China Institute of Automation Chinese Academy and Sciences Beijing China

In a pedestrian detection system, a classifier is usually designed to recognize whether a candidate is a pedestrian. Support vector machines (SVM) has become a primary technique to train a classifier for pedestrian detection. However, it is hard to give the best training model which has a tremendous effect to the performance of a SVM classifier. In this paper, we design special code/decode scheme and evaluation function for a training model firstly; and then use genetic algorithm to optimize key parameters which represent the SVM training model. Therefore a most suitable SVM classifier can be obtained for pedestrian detection. Experiments have been carried out in a single camera based pedestrian detection system. The results show that the evolutionary SVM classifier has a better detection rate; moreover, RBF kernel is more suitable than polynomial kernel when chosen in an evolutionary SVM classifier for pedestrian detection

关键词： Support vector machines Support vector machine classification Kernel Genetic algorithms Decoding Design optimization Cameras Intelligent robots computer science Laboratories

来源：评论

学校读者我要写书评

暂无评论

Structural Pattern Analysis for Texture Synthesis

Structural Pattern Analysis for Texture Synthesis

引用

International Multi-Symposiums on computer and Computational Sciences (IMSCCS)

作者： Yizhe Li Guoliang Chen Qilong Zheng Department of Computer Science and Technology Anhui Province-MOST Co-Key Laboratory of High Performance Computing and Its Application University of Science and Technology Anhui China

Sample based texture synthesis allows the generation of arbitrarily sized textures based on a small sample image. One main drawback of the technique is that a new pixel or patch is selected only considering local information in the generated texture. Thus structural error can't assure to be avoided for structural textures. To accelerate texture synthesis process and to avoid structural mismatch in the output picture, we present in this paper a structural pattern analysis (SPA) algorithm and a texture synthesis method using the algorithm. The pattern analysis tool also quantizes the texture randomness in macro scope view. It can be used in other applications such as automatic texture classification and quality evaluation of synthesized texture. We illustrate our result with some examples

关键词： Pattern analysis Application software Pattern recognition Acceleration Image processing computer graphics Image analysis Large-scale systems computer science Laboratories

来源：评论

学校读者我要写书评

暂无评论

Electronic voting scheme

引用

Ruan Jian Xue Bao/Journal of software 2005年第10期16卷 1805-1810页

作者： Li, Yan-Jiang Ma, Chuan-Gui Huang, Liu-Sheng Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Department of Applied Mathematics PLA Information Engineering University Zhengzhou 450002 China Anhui Province-MOST Co-Key Laboratory of High Performance Computing and Application Hefei 230027 China

A dynamic multi-secrets sharing threshold scheme is presented to apply to a large scale electronic voting system with many talliers (tallying authorities). Even if there exists adaptive adversaries, this scheme can guard the ballot's producing, encrypting, transmitting, decrypting and final tallying in spite of the adversaries's attack, so the scheme guarantees robustness. In this paper, the verifiability of the voters' qualification and talliers' identification will be solved by a dynamic multi-secret sharing scheme without invoking more zero knowledge proof to maintain privacy, universal verifiability, and anonymity of ballots. It holds more communication efficiency and more security than the proposed schemes in early time.

关键词： Electronic communities

来源：评论

学校读者我要写书评

暂无评论

Multi-Agent Reinforcement Learning based Edge Content Caching for Connected Autonomous Vehicles in IoV

引用

ACM Transactions on Autonomous and Adaptive Systems 1000年

作者： Xiaolong Xu Linjie Gu Muhammad Bilal Maqbool Khan Yiping Wen Guoqiang Liu Yuan Yuan School of Software Jiangsu Province Engineering Research Center of Advanced Computing and Intelligent Services Nanjing University of Information Science and Technology China Changwang School of Honors Nanjing University of Information Science and Technology China Department of Computer and Electronics Systems Engineering Hankuk University of Foreign Studies Korea Department of IT and Computer Science Pak-Austria Fachhochschule-Institute of Applied Sciences and Technology Pakistan School of Computer Science and Engineering Hunan University of Science and Technology China School of Software Nanjing University of Information Science and Technology China School of Computer Science and Engineering Beihang University State Key Laboratory of Software Development Environment Zhongguancun Laboratory China

Connected Autonomous Vehicle (CAV) Driving, as a data-driven intelligent driving technology within the Internet of Vehicles (IoV), presents significant challenges to the efficiency and security of real-time data management. The combination of Web3.0 and edge content caching holds promise in providing low-latency data access for CAVs’ real-time applications. Web3.0 enables the reliable pre-migration of frequently requested content from content providers to edge nodes. However, identifying optimal edge node peers for joint content caching and replacement remains challenging due to the dynamic nature of traffic flow in IoV. Addressing these challenges, this article introduces GAMA-Cache, an innovative edge content caching methodology leveraging Graph Attention Networks (GAT) and Multi-Agent Reinforcement Learning (MARL). GAMA-Cache conceptualizes the cooperative edge content caching issue as a constrained Markov decision process. It employs a MARL technique predicated on cooperation effectiveness to discern optimal caching decisions, with GAT augmenting information extracted from adjacent nodes. A distinct collaborator selection mechanism is also developed to streamline communication between agents, filtering out those with minimal correlations in the vector input to the policy network. Experimental results demonstrate that, in terms of service latency and delivery failure, the GAMA-Cache outperforms other state-of-the-art MARL solutions for edge content caching in IoV.

关键词： Content Caching Reinforcement Learning Connected Autonomous Driving

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：