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

2011 7th International Conference on Natural Computation, ICNC 2011

作者： Li, Dao-Lun Zha, Wen-Shu Lu, De-Tang Department of Modern Mechanics University of Science and Technology of China China Key Laboratory of Software in Computing and Communication of Anhui Province University of Science and Technology of China Hefei 230027 China

ISBN: (纸本)9781424499533

Time vector series abound in many fields, which are different from time series. Based on mapping and implicit function interpolation, the method of implicit interpolation over time vector series is developed and studied. Time vector series are mapped into a sequence of closed curves or surfaces, which are seen as the interpolation data set. Based on the interpolation data set, the implicit interpolation function is constructed and from which an isoline is drawn. The inverse mapping of the isoline is the prediction of vector series at the new time. Based on the well logging data an application is given to predict the unknown isotope logging data of year 2004 with the known data of year 2003 and 2005 which shows the performance of the method. © 2011 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Games on Weighted Newman-Watts Small-World Networks

引用

Chinese Physics Letters 2009年第5期26卷 255-258页

作者：杜文博曹先彬赵琳周宏 Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology of China Hefei 230026 School of Life Sciences University of Science and Technology of China Hefei 230026

We investigate the evolutionary prisoner＇s dilemma game （PDG） on weighted Newman-Watts （NW） networks. In weighted NW networks, the link weight ωij is assigned to the link between the nodes i and j as： ωij = （ki · kj）^β, where ki（kj） is the degree of node i（j） and β represents the strength of the correlations. Obviously, the link weight can be tuned by only one parameter β. We focus on the cooperative behavior and wealth distribution in the system. Simulation results show that the cooperator frequency is promoted by a large range of β and there is a minimal cooperation frequency around β = -1. Moreover, we also employ the Gini coefficient to study the wealth distribution in the population. Numerical results show that the Gini coefficient reaches its minimum when β≈ -1. Our work may be helpful in understanding the emergence of cooperation and unequal wealth distribution in society.

关键词： PRISONER'S dilemma game COOPERATIVENESS INCOME distribution SIMULATION methods & models GINI coefficient NUMERICAL analysis

来源：评论

学校读者我要写书评

暂无评论

The g-dominance Relation for Preference-Based Evolutionary Multi-Objective Optimization

The g-dominance Relation for Preference-Based Evolutionary M...

引用

2019 IEEE Congress on Evolutionary Computation, CEC 2019

作者： Luo, Wenjian Shi, Luming Lin, Xin Coello Coello, Carlos A. Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei230027 China Departmento de Sistemas UAM-Azcapotzalco Mexico City Mexico

ISBN: (纸本)9781728121536

In evolutionary multi-objective optimization, the results generated by an evolutionary algorithm usually contain an approximation, as good as possible, of the entire Pareto-optimal front. However, sometimes the number of Pareto-optimal solutions may be so large that the decision maker (DM) is incapable of manipulating or understanding them. Methods for considering only the Pareto-optimal solutions that the DM prefers indeed constitute a hot research topic in the evolutionary computation field. In this paper, we introduce a new dominance relation called hat g-dominance, which is an improved version of the g-dominance relation and can be easily implemented in traditional multi-objective evolutionary algorithms. In this work, the proposed hat g-dominance is implemented in NSGA-II. Our experimental results show the effectiveness of hat g-NSGA-II with respect to the original g-NSGA-II. © 2019 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Hybrid of the prefix algorithm and the q-hidden algorithm for generating single negative databases

A Hybrid of the prefix algorithm and the q-hidden algorithm ...

引用

IEEE Symposium on Computational Intelligence in Cyber Security

作者： Liu, Ran Luo, Wenjian Wang, Xufa School of Computer Science and Technology University of Science and Technology of China Hefei 230027 Anhui China Anhui Key Laboratory of Software Engineering in Computing and Communication Hefei 230027 Anhui China

ISBN: (纸本)9781424499069

The negative database (NDB) is a complement of the corresponding database. The NDB could protect the privacy of the data, but it should be complete and hard-to-reverse. However, existent techniques cannot generate the complete and hard-to-reverse negative database. In this paper, a hybrid method is proposed to generate single negative databases. The proposed hybrid method includes two phases. Firstly, a complete negative database with a small size is generated by the transformation of the prefix algorithm. Secondly, a hard-to-reverse negative database, which is generated with the q-hidden method, is added into the small complete negative database. Therefore, the hybrid negative database is both complete and hard-to-reverse. Experiment results show that the NDB generated by the hybrid method is better than the NDB generated by the typical q-hidden method. Especially, the NDB generated by the q-hidden method can be reversed on average when the string length is 300. However, the NDB generated by the hybrid method cannot be reversed on average when the string length is 150. © 2011 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Nonlinear characteristics and qualitative analysis of sleep EEG

Nonlinear characteristics and qualitative analysis of sleep ...

引用

2007 1st International Conference on Bioinformatics and Biomedical Engineering, ICBBE

作者： Shao, Chenxi Fan, Jinfeng Li, Shaobin Department of Computer Science and Technology USTC Anhui Province Key Laboratory of Software in Computing and Communication Hefei Anhui 230027 China Department of Computer Science and Technology USTC Hefei Anhui 230027 China

ISBN: (纸本)1424411203

Correlation dimension (CD) and the largest Lyapunov exponent (LLE), which are two most important nonlinear invariant measures of nonlinear system, are adopted to characterize the complexity and stability of human brain during all sleep stages. In order to And an optimal embedding to reconstruct phase space, the C-C method and Cao's algorithm were thoroughly analyzed and implemented in efficient ways. Additionally, the G-P algorithm and Kantz's algorithm are also implemented for calculation of CD and LLE respectively. Eight normal sleep EEG records are acquired from MIT-BIH sleep-EDF database for this study. The values of CD and LLE for 30s epochs are calculated, and their mean and standard deviation values are evaluated as well. The results indicate that CD and LLE decrease from the waking stage to stages I, II and III-IV, and they have large values during rapid eye movement (REM) sleep stage. Then, a qualitative conclusion may be drawn that during waking stage and REM sleep stage, brain activity has higher complexity and lower stability than during other stages. © 2007 IEEE.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Scalable video multicast with joint layer resource allocation in broadband wireless networks

Scalable video multicast with joint layer resource allocatio...

引用

International Conference on Network Protocols

作者： Li, Peilong Zhang, Honghai Zhao, Baohua Rangarajan, Sampath Dept. of Computer Science and Technology University of Science and Technology of China China NEC Laboratories America United States State Key Laboratory of Networking and Switching Technology Beijing China Province Key Laboratory of Software in Computing and Communication Hefei Anhui 230027 China

ISBN: (纸本)9781424486458

Scalable video coding (SVC), together with adaptive modulation and coding (AMC), can improve wireless multicast streaming video by jointly performing radio resource allocation and modulation and coding scheme (MCS) selection. However, the existing schemes in the literature allocate radio resources for different video layers separately, which leads to a waste of radio resources. In this work, we introduce the notion of joint layer resource allocation which allows to jointly allocate resources to multiple video layers that are assigned the same MCS. We formulate this problem and prove it to be NP-hard. Then we develop a pseudo-polynomial algorithm that finds the optimal total system utility. Our algorithm assumes a very generic utility function and flexible video layer rates. To reduce the complexity of the algorithm, we also propose Fully Polynomial Time Approximation Schemes (FPTAS) for the same problem. Simulation results show that our optimal algorithm offers significant improvement on system utility over a previous optimal algorithm and a greedy algorithm both of which do not support joint layer resource allocation. The proposed approximation algorithm provides controllable tradeoff between performance and computational complexity and, with appropriately chosen parameters, it outperforms the greedy algorithm with 40% less running time. © 2010 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Airborne moving vehicle detection for urban traffic surveillance

Airborne moving vehicle detection for urban traffic surveill...

引用

11th International IEEE Conference on Intelligent Transportation Systems, ITSC 2008

作者： Lin, Renjun Cao, Xianbin Xu, Yanwu Wei, Chuangxian Qiao, Hong University of Science and Technology China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230026 China Institute of Automation Chinese Academy of Sciences Beijing 100080 China University of Manchester United Kingdom

ISBN: (纸本)9781424421121

At present, moving vehicle detection on airborne platform has been an important technology for urban traffic surveillance. In such a situation, most commonly used methods (e.g. image subtraction) could hardly work well because of some additional difficulties such as slow movement of vehicles and jam. This paper proposed a new moving vehicle detection method named MVD-RD for airborne urban traffic surveillance. First, the non-road regions are extracted using road detection technique. Secondly, the non-road regions with no vehicles are removed according to their size. As a result of this two-stage regions shrinkage, the detection area reduces a lot. Finally, to the reduced area, image subtraction is used to get all moving regions and then moving vehicles can be accurately filtered in a simple way. The experimental results show that, compared with traditional image subtraction methods used in airborne moving vehicle detection, the proposed MVD-RD method achieves much better performance in detection rate, false alarm rate, and detection speed. © 2008 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

A new clustering strategy in ambulatory electrocardiogram waveform

A new clustering strategy in ambulatory electrocardiogram wa...

引用

2009 International Conference on Information Engineering and Computer Science, ICIECS 2009

作者： Yu, Tian Zheng, Gang School of Computer and Communication Engineering Tianjin University of Technology China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology 300191 Tianjin China Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education 300191 Tianjin China

ISBN: (纸本)9781424449941

Ambulatory electrocardiogram is used to record about 24 hours electrocardiogram waveform. The purpose is to find out the conspicuous variation in the recording data. A new strategy used to cluster the electrocardiogram waveform is presented in this paper. The aim of that is to obtain more accurate clustering results. After the controlled trial on MIT/BIH data, it can be safely concluded that the clustering result achieved by improved strategy can got more accurate than that by the traditional clustering algorithm. An average accuracy ratio is about 94.6%, 1.6% higher than k-means algorithm averagely and 1.3% higher than Simulated Annealing algorithm averagely. ©2009 IEEE.

关键词： Electrocardiograms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：