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

15th Genetic and Evolutionary Computation Conference (GECCO)

作者： Yu, Wei-jie Zhang, Jun Chen, Wei-neng Sun Yat Sen Univ Dept Comp Sci Key Lab Machine Intelligence & Sensor NetworksMi Key Lab Software TechnolEduc Dept Guangdong Prov Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781450319638

In this paper, we propose a novel greedy position update strategy for the ABC algorithm. The greedy position update strategy is implemented mainly in two steps. In the first step, good solutions randomly chosen from the top t solutions in the current population are used to guide the search process of onlooker bees. In the second step, the new parameter t is adaptively adjusted in each iteration of the algorithm. The adjustment is simply based on determining whether the globally best solution is obtained by the employed bees or the onlooker bees. The effect of the proposed greedy position update strategy is evaluated on a set of benchmark functions. Experimental results show that the proposed strategy can significantly improve the performance of the classic ABC algorithm. In addition, ABC using the proposed strategy exhibits very competitive performance when compared with some existing ABC variants.

关键词： Adaptive parameter control artificial bee colony (ABC) global optimization swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

Small-World Particle Swarm Optimization with Topology Adaptation 13

Small-World Particle Swarm Optimization with Topology Adapta...

引用

15th Genetic and Evolutionary Computation Conference (GECCO)

作者： Gong, Yue-jiao Zhang, Jun Sun Yat Sen Univ Key Lab Machine Intelligence & Sensor Networks Key Lab Software Technol Educ Dept Guangdong ProvDept Comp SciMinist Edu Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781450319638

Traditional particle swarm optimization (PSO) algorithms adopt completely regular network as topologies, which may encounter the problems of premature convergence and insufficient efficiency. In order to improve the performance of PSO, this paper proposes a novel topology based on small-world network. Each particle in the swarm interacts with its cohesive neighbors and by chance to communicate with some distant particles via small-world randomization. In order to improve search diversity, each dimension of the swarm is assigned with a specific network, and the particle is allowed to follow the historical information of different neighbors on different dimensions. Moreover, in the proposed small-world topology, the neighborhood size and the randomization probability are adaptively adjusted based on the convergence state of the swarm. By applying the topology adaptation mechanism, the particle swarm is able to balance its exploitation and exploration abilities during the search process. Experiments were conducted on a set of classical benchmark functions. The results verify the effectiveness and high efficiency of the proposed PSO algorithm with adaptive small-world topology when compared with some other PSO variants.

关键词： Global optimization particle swarm optimization small-world network topology adaptation

来源：评论

学校读者我要写书评

暂无评论

Efficient Information Dissemination in Dynamic networks

Efficient Information Dissemination in Dynamic Networks

引用

42nd Annual International Conference on Parallel Processing (ICPP)

作者： Yang, Zhiwei Wu, Weigang Chen, Yishun Zhang, Jun Dept. of Computer Science Sun Yat-sen University Guangzhou 510006 China College of Computational Science Zhongkai University of Agriculture and Engineering Guangzhou 510006 China Ministry of Education Key Laboratory of Machine Intelligence and Sensor Networks Guangzhou 510006 China

ISBN: (纸本)9780769551173

Dynamic network is the abstraction of networks with frequent topology changes arising from node mobility or other reasons. With the model of dynamic network, distributed computation problems can be formally studied with rigorous correctness. Information dissemination is one of such problems and it has received much attention recently. However, existing works focus on the time cost of dissemination, i.e. how fast the information can be disseminated to all nodes, and communication cost has been largely ignored. Our work focuses on high communication efficiency in information dissemination with correctness property guaranteed. We achieve this by making use of cluster-based hierarchy. Clustering has been widely studied and used in wireless networks to reduce communication cost. However, to the best of our knowledge, it has never been considered in the study of dynamic networks. In this paper, we firstly propose a dynamic network model, named (T, L)-HiNet, to extend existing dynamic network model with clusters. (T, L)-HiNet includes several properties defining the dynamics of cluster hierarchy in a dynamic network. Base on (T, L)-HiNet, we design hierarchical information dissemination algorithms for different scenarios of dynamics. The correctness of our algorithms is proved and the performance is analyzed. Compared with the algorithm recently proposed by Kuhn, Lynch and Oshman [7], our design can significantly reduce communication and our objective is fully achieved.

关键词： Information dissemination dynamic network cluster distributed algorithm system model

来源：评论

学校读者我要写书评

暂无评论

Improved Decoding Algorithm of Serial Belief Propagation With a Stop Updating Criterion for LDPC Codes and Applications in Patterned Media Storage

引用

IEEE TRANSACTIONS ON MAGNETICS 2013年第2期49卷 829-836页

作者： Liu, Xingcheng Cai, Jinlong Wu, Longbo Sun Yat Sen Univ Sch Informat Sci & Technol Guangzhou 510006 Guangdong Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China Sun Yat Sen Univ Minist Educ Key Lab Machine Intelligence & Sensor Networks Guangzhou 510006 Guangdong Peoples R China

In high density patterned media storage system, the "multiple islands per read head" model is taken into account for inter-track interference (ITI) in bit-patterned media (BPM). It has been proposed that low-density parity-check (LDPC) codes could improve the symbol error rate (SER) performance significantly when only considering AWGN noise alone over the storage channel. LDPC decoding algorithm could be applied in LDPC joint decoder of patterned media storage system. In this paper, we proposed a decoding algorithm of serial belief propagation (SBP) with a stop updating criterion for LDPC decoder. Simulation results show that the proposed decoding algorithm could reduce the times of generating and propagating the message in decoding with negligible error rate performance loss over AWGN channels when appropriately choosing the parameter that determines which variable node has been converged. By taking advantage of extrinsic information transfer (EXIT) charts, it is demonstrated that the proposed decoding algorithm could maintain superior SER performance and convergence rate compared with the traditional SBP decoding algorithm. To further explore the performance of the proposed decoding algorithm in "multiple islands per read head" model, we performed a large number of simulations over this channel model with different distribution percentages between the AWGN and the island position jitter noise. Simulation results show that the LDPC codes could improve the SER performance when considering jitter noise while the proposed decoding algorithm behaves excellently over the patterned media storage channel and over the AWGN channel.

关键词： Extrinsic information transfer (EXIT) charts low-density parity-check (LDPC) codes patterned media stopping criterion transition-jitter noise (TJN)

来源：评论

学校读者我要写书评

暂无评论

Robust and dynamic data aggregation in wireless sensor networks: A cross-layer approach

引用

COMPUTER networks 2013年第18期57卷 3929-3940页

作者： Wu, Weigang Cao, Jiannong Wu, Hejun Li, Jingjing Sun Yat Sen Univ Dept Comp Sci Guangzhou 510275 Guangdong Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China Minist Educ Key Lab Machine Intelligence & Sensor Networks Beijing Peoples R China S China Normal Univ Sch Comp Guangzhou Guangdong Peoples R China

In-network data aggregation is an effective technique to reduce communication cost in wireless sensor networks. Recent studies have focused on two issues respectively: dynamic aggregation to handle event triggered irregular traffic and robust aggregation to handle packet losses. However, how to achieve both the objectives simultaneously, i.e. dynamic and robust aggregation is still not considered. In this paper, by making use of direct support from MAC layer, we propose a cross-layer approach to realize robust and dynamic data aggregation. A new MAC protocol, DA-MAC is delicately designed to serve such purpose. With channel contention information obtained from DA-MAC, a node can dynamically determine where and when to do aggregation. To cope with packet losses, a virtual overlay, Rings is adopted to forward one packet to multiple nodes. We have conducted numerical analysis to optimize the key parameters and implemented our design in TinyOS based sensor networks. Performance evaluation though simulations and experiments shows that our approach can handle both traffic dynamics and packet losses, with less cost than similar solutions. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Data aggregation Event detection Cross-layer MAC WSN

来源：评论

学校读者我要写书评

暂无评论

Design and Performance Evaluation of Overhearing-Aided Data Caching in Wireless Ad Hoc networks

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2013年第3期24卷 450-463页

作者： Wu, Weigang Cao, Jiannong Fan, Xiaopeng Sun Yat Sen Univ Dept Comp Sci Sch Informat Sci & Technol Guangzhou 510006 Guangdong Peoples R China Minist Educ Key Lab Machine Intelligence & Sensor Networks Guangzhou 510006 Guangdong Peoples R China Hong Kong Polytech Univ Dept Comp Kowloon Hong Kong Peoples R China Chinese Acad Sci Inst Adv Comp & Digital Engn SIAT Shenzhen 518055 Peoples R China

Wireless ad hoc network is a promising networking technology to provide users with Internet access anywhere anytime. To cope with resource constraints of wireless ad hoc networks, data caching is widely used to efficiently reduce data access cost. In this paper, we propose an efficient data caching algorithm which makes use of the overhearing property of wireless communication to improve caching performance. Due to the broadcast nature of wireless links, a packet can be overheard by a node within the transmission range of the transmitter, even if the node is not the intended target. Our proposed algorithm explores the overheard information, including data request and data reply, to optimize cache placement and cache discovery. To the best of our knowledge, this is the first work that considers the overhearing property of wireless communications in data caching. The simulation results show that, compared with one representative algorithm and a naive overhearing algorithm, our proposed algorithm can significantly reduce both message cost and access delay.

关键词： Ad hoc network cooperative caching mobile computing wireless communication

来源：评论

学校读者我要写书评

暂无评论

Video Based Children's Social Behavior Classification in Peer-Play Scenarios

Video Based Children's Social Behavior Classification in Pee...

引用

Asian Conference on Pattern Recognition (ACPR)

作者： Lu Tian Dingrui Duan Jinshi Cui Li Wang Hongbin Zha Hamid Aghajan Key Laboratory of Machine Perception Peking University China Department of Psychology Peking University China Wireless Sensor Networks Lab Stanford University USA

Labeling children's play behavior is an important process in children's social behavior analysis which is traditionally done by experienced coders. With the growing volume of data, automatic methods for labeling are increasingly required. This paper presents a novel method to label children's social behavior automatically in peer-play scenarios based on visual attention and mutual interaction computation. In this method, the discrete distribution of children's visual attention is computed based on face pose estimation. Then, the mutual interaction among children is calculated by "Attention Processes", which are continuous periods of time during which a certain child pays attention to the same target. After that, "Solitary Feature" and "Group Feature" are extracted by the mutual interaction of children and children's play behaviors will be classified into 3 types ("Solitary Play", "Parallel Play" and "Group Play") by these two kinds of features. Finally, this method is evaluated by a dataset of children's peer-play scenarios and the results show this method has a good performance in our dataset.

关键词： Visualization Face Observers Feature extraction Psychology Computer vision

来源：评论

学校读者我要写书评

暂无评论

Gaze Estimation in Children's Peer-Play Scenarios

Gaze Estimation in Children's Peer-Play Scenarios

引用

Asian Conference on Pattern Recognition (ACPR)

作者： Dingrui Duan Lu Tian Jinshi Cui Li Wang Hongbin Zha Hamid Aghajan Key Laboratory of Machine Perception Peking University China Department of Psychology Peking University China Wireless Sensor Networks Lab Stanford University USA

Gaze is a powerful cue for children's social behavior analysis. In this paper, a novel method is proposed to estimate children's gaze orientation in the experimental data of developmental psychology based on head pose estimation. In consideration of the possible errors of head pose estimation results, temporal information and potential targets are both introduced to improve the results of gaze estimation. At last, this method is evaluated by a dataset of children's peer-play scenarios and the results show that this method has a good performance. According to the experimental valuation and analysis, in a certain peer-play scenario, potential targets are powerful spatial cues for children's gaze estimation and temporal information also provides some cues to improve the estimation results.

关键词： Head Magnetic heads Feature extraction Visualization Observers Psychology

来源：评论

学校读者我要写书评

暂无评论

A Set-Based Discrete Differential Evolution Algorithm

A Set-Based Discrete Differential Evolution Algorithm

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Yu Liu Wei-Neng Chen Zhi-Hui Zhan Ying Lin Yue-Jiao Gong Jun Zhang Department of Computer Science Sun Yat-sen University Key Laboratory of Machine Intelligence and Sensor Network Ministry of Education Key Laboratory of Software Technology Education Department of Guangdong Province P.R. China

ISBN: (纸本)9781479906505

The TSP problem is considered as classical discrete optimization grouping problem, which is widely used in practice, but it is real a difficult NP problem. Simultaneously differential evolution (DE) algorithm has been proven to be a powerful optimization algorithm. Since the mutation process of DE contains a series of arithmetic operators operating on continuous space, few algorithms based on DE solve this problem nicely and the advantages of DE in continuous space cannot be used to solve TSP. To take full advantages of the strengths of DE, this paper proposes a set-based DE (S-DE) which completely follows the procedure of the original DE. We present a representation scheme to characterize the discrete problem space and by redefining its basic concept and all related operators in mutation, DE can operate directly on the original set space of the discrete optimization problems instead of performing a space transformation. In that way, the searching features of DE in continuous space is kept. In experiment, we test the performance of our proposed S-DE and the results show it is very promising.

关键词： component Discrete Differential algorithm Sebased COP TSP MT CARD16 gene discrete element Optimization algorithms Total suspended particles evolutionary algorithm arithmetic operator NP problem CONTINUOUS SPACE differential evolution algorithms

来源：评论

学校读者我要写书评

暂无评论

DMooseFS: Design and Implementation of Distributed Files System with Distributed Metadata Server

DMooseFS: Design and Implementation of Distributed Files Sys...

引用

IEEE Asia Pacific Cloud Computing Congress

作者： Yu, Jiongyu Wu, Weigang Li, Huaguan Sun Yat Sen Univ Dept Comp Sci Key Lab Machine Intelligence & Sensor Networks Minist Educ Guangzhou 510006 Guangdong Peoples R China

ISBN: (纸本)9781467329040;9781467329033

Distributed file system is one of the key blocks of data centers. With the fast increase of user scale, metadata management in distributed file system should also be distributed to multiple nodes so as to achieve high scalability and reliability. However, existing works usually focus on the design of distributed metadata management approach, and very few efforts have been put on real implementation. In this paper, we present the design and implementation of DMooseFS, a system with simple and efficient distributed metadata management. Our work is based on the well-known distributed file system MooseFS. We extend it by introducing multiple metadata servers (MDS). The metadata is divided into non-overlapping parts using static subtree partitioning, and each MDS is assigned with one of the parts according to a hash algorithm. Such a hybrid design is efficient because it can avoid the drawbacks of static subtree partitioning and/or hash-based approaches. We implement DMooseFS by modifying existing implementation of MooseFS and test it in real deployment. Technical issues in implementation are also found and addressed. Experiment results from real world deployment show that our system is effective and efficient, compared with the original version of MooseFS.

关键词： Metadata management distributed file sytem cloud computing reliability scalability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：