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

On multicast throughput scaling of hybrid wireless networks with general node density

computer Networks 2011年第15期55卷 3548-3561页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Yunhao Liu Department of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education China Department of Computer Science Illinois Institute of Technology Chicago IL 60616 United States TNLIST School of Software Tsinghua University China

In this paper, we consider hybrid wireless networks with a general node density λ ∈ [1, n ], where n ad hoc nodes are uniformly distributed and m base stations (BSs) are regularly placed in a square region A ( n , A ) = 1 , A × 1 , A with A ∈ [1, n ]. We focus on multicast sessions in which each ad hoc node as a user chooses randomly d ad hoc nodes as its destinations. Specifically, when d = 1 (or d = n − 1), a multicast session is essentially a unicast (or broadcast) session. We study the asymptotic multicast throughput for such a hybrid wireless network according to different cases in terms of m ∈ [1, n ] and d ∈ [1, n ], as n → ∞. To be specific, we design two types of multicast schemes, called hybrid scheme and BS - based scheme , respectively. For the hybrid scheme, there are two alternative routing backbones : sparse backbones and dense backbones . Particularly, according to different regimes of the node density λ = n A , we derive the thresholds in terms of m and d . Depending on these thresholds, we determine which scheme is preferred for the better performance of network throughput.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PSO based memetic algorithm for face recognition Gabor filters selection

PSO based memetic algorithm for face recognition Gabor filte...

引用

IEEE Workshop on Memetic Computing (MC)

作者： Jiarui Zhou Zhen Ji Linlin Shen Zexuan Zhu Siping Chen Shenzhen City Key Laboratory of Embedded System Design College of Computer Science and Software Engineering Shenzhen University Shenzhen China College of Biomedical Engineering and Instrument Science University of Zhejiang Hangzhou China

A Gabor filters based face recognition algorithm named POMA-Gabor is proposed in this paper. The algorithm uses particular Gabor wavelets in the feature extraction on specific areas of the face image and a particle swarm optimization (PSO) based memetic algorithm (POMA), which combines comprehensive learning particle swarm optimizer (CLPSO) global search and self-adaptive intelligent single particle optimizer (AdpISPO) local search, is introduced to select the Gabor filter parameters. The experimental results demonstrate that POMA obtains better performance than other comparative PSO algorithms. Employing POMA for Gabor filter design, POMA-Gabor is capable of obtaining more representative information and higher recognition rate with less computational time.

关键词： Algorithm design and analysis Face recognition Feature extraction Optimization Face Equations Databases

来源：评论

学校读者我要写书评

暂无评论

SelectCast: Scalable data aggregation scheme in wireless sensor networks

SelectCast: Scalable data aggregation scheme in wireless sen...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Cheng Wang Shaojie Tang Xiang-Yang Li Changjun Jiang Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science University of Tongji Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL USA TNLIST School of Software Tsinghua University China

In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gathering efficiency. The gathering efficiency refers to the ratio of the number of the sensors whose data have been gathered to the total number of sensors. Specifically, we design two efficient aggregation schemes, called single-hop-length (SLH) scheme and multiple-hop-length (MLH) scheme. By novelly integrating these two schemes, we theoretically prove that our protocol achieves the optimal tradeoffs, and derive the optimal aggregation throughput depending on a given threshold value (lower bound) on gathering efficiency. Particularly, we show that under the MLH scheme, for a practically important set of symmetric functions called perfectly compressible functions, including the mean, max, or various kinds of indicator functions, etc., the data from Θ(n) sensors can be aggregated to the sink at the throughput of a constant order Θ(1), implying that our MLH scheme is indeed scalable.

关键词： TV Wireless sensor networks Power capacitors Blogs Lattices

来源：评论

学校读者我要写书评

暂无评论

Preface

IFIP Advances in Information and Communication Technology

引用

IFIP Advances in Information and Communication Technology 2012年 373卷

作者： Ayala, José L. Alonso, David Atienza Reis, Ricardo Complutense University of Madrid Computer Science Faculty Madrid28040 Spain Institute of EE Embedded Systems Laboratory ELG 131 Station 11 Lausanne1015 Switzerland Universidade Federal do Rio Grande do Sul Instituto de Informática Av. Bento Gonçalves 9500 Campus do Vale Bloco IV CP 15064 Porto Alegre91501-970 Brazil

来源：评论

学校读者我要写书评

暂无评论

Polynomial-time hierarchy of computable reals

引用

Journal of Computational Information Systems 2011年第4期7卷 1108-1115页

作者： Chen, Qingliang Su, Kaile Wu, Lijun Department of Computer Science Jinan University Guangzhou 510632 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Key Laboratory of High Confidence Software Technologies Ministry of Education Peking University Beijing China Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia School of Computer Science and Engineering University of Electronic Science and Technology Chengdu 610054 China

In mathematics, various representations of real numbers have been investigated and all these representations are proved to be mathematically equivalent. Furthermore, it is known that all effective versions of these representations lead to the same class of "computable real numbers". However, when subrecursive (such as primitive recursive) is taken into account, these representations can lead to different notions of "computable real numbers". This paper will look into the polynomial-time version of the problem for computable real numbers under different representations. We will summarize the known results to exhibit the comprehensive hierarchy they form. Our goal is to clarify systematically how the polynomial-time computability depends on the representations of the real numbers. Copyright © 2011 Binary Information Press.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

General capacity scaling of wireless networks

General capacity scaling of wireless networks

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Shaojie Tang Panlong Yang Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science University of Tongji Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL USA TNLIST School of Software Tsinghua University China People''s Liberation Army University of Science and Technology China

We study the general scaling laws of the capacity for random wireless networks under the generalized physical model. The generality of this work is embodied in three dimensions denoted by (λ ∈ [1, n], n d ∈ [1, n], n s ∈ (1, n]). It means that: (1) We study the random network of a general node density λ ∈ [1, n], rather than only study either random dense network (RDN, λ = n) or random extended network (REN, λ = 1) as in the literature. (2) We focus on the multicast capacity to unify unicast and broadcast capacities by setting the number of destinations for each session as a general value n d ∈ [1, n]. (3)We allow the number of sessions changing in the range n s ∈ (1, n], rather than assume that n s = Θ(n) as in the *** derive the general lower bounds on the capacity for the arbitrary case of (λ, n d , n s ). Particularly, we show that for the special cases (λ = 1, n d ∈ [1, n], n s = n) and (λ = n, n d ∈ [1, n], n s = n), our schemes achieve the highest multicast throughputs proposed in the existing works.

关键词： Roads Routing Throughput Lattices Schedules Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Aggregation capacity of wireless sensor networks: Extended network case

Aggregation capacity of wireless sensor networks: Extended n...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Cheng Wang Changjun Jiang Yunhao Liu Xiang-Yang Li Shaojie Tang Huadong Ma Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science University of Tongji Shanghai China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong China TNLIST School of Software Tsinghua University China Department of Computer Science Illinois Institute of Technology Chicago IL USA Department of Computer Science Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781424499199

A critical function of wireless sensor networks (WSNs) is data gathering. While, one is often only interested in collecting a relevant function of the sensor measurements at a sink node, rather than downloading all the data from all the sensors. This paper studies the capacity of computing and transporting the specific functions of sensor measurements to the sink node, called aggregation capacity, for WSNs. It focuses on random WSNs that can be classified into two types: random extended WSN and random dense WSN. All existing results about aggregation capacity are studied for dense WSNs, including random cases and arbitrary cases, under the protocol model (ProM) or physical model (PhyM). In this paper, we propose the first aggregation capacity scaling laws for random extended WSNs. We point out that unlike random dense WSNs, for random extended WSNs, the assumption made in ProM and PhyM that each successful transmission can sustain a constant rate is over-optimistic and unpractical due to transmit power *** derive the first result on aggregation capacity for random extended WSNs under the generalized physical model. Particularly, we prove that, for the type-sensitive perfectly compressible functions and type-threshold perfectly compressible functions, the aggregation capacities for random extended WSNs with n nodes are of order Θ ((log n) -β/2-1 ) and Θ (((log n) -β/2 )/(log log n)), respectively, where β >; 2 denotes the power attenuation exponent in the generalized physical model.

关键词： Wireless sensor networks Signal to noise ratio Interference Throughput Lattices Routing PROM

来源：评论

学校读者我要写书评

暂无评论

Memetic figure selection for cluster expansion in binary alloy systems

Memetic figure selection for cluster expansion in binary all...

引用

IEEE Workshop on Memetic Computing (MC)

作者： Zexuan Zhu Zhen Ji Xiaofeng Fan Jer-Lai Kuo Shenzhen City Key Laboratory of Embedded System Design College of Computer Science and Software Engineering Shenzhen University Shenzhen China School of Physical and Mathematical Sciences Nanyang Technological University Singapore Institute of Atomic and Molecular Sciences Academia Sinica Taipei Taiwan

Cluster expansion provides a powerful tool in materials modeling. It has enabled an efficient prediction of the atomic properties of materials with the combination of the modern quantum calculation theory. To construct an accurate cluster expansion model, a few important cluster figures should be identified. This paper proposes a novel figure selection method based on memetic algorithm (MA), which is a synergy of genetic algorithm (GA) and orthogonal matching pursuit (OMP) based memetic operation. The memetic operation is designed to fine-tunes the solutions of GA and accelerate the convergence of the search. The performance of the proposed method is evaluated on two binary alloy datasets. Comparative study to other state-of-the-art figure selection methods demonstrates that the proposed method is capable of obtaining better or competitive prediction accuracy and searching the figure space efficiently.

关键词： Memetics Genetic algorithms Gallium Biological cells Matching pursuit algorithms

来源：评论

学校读者我要写书评

暂无评论

Memetic ant colony optimization for band selection of hyperspectral imagery classification

Memetic ant colony optimization for band selection of hypers...

引用

Chinese Conference on Pattern Recognition

作者： Zhu, Zexuan Ji, Zhen Jia, Sen Shenzhen City Key Laboratory of Embedded System Design College of Computer Science and Software Engineering Shenzhen University Shenzhen 518060 China

ISBN: (纸本)9781424472109

This paper proposes a novel memetic ant colony optimization (MACO) algorithm for band selection on hyperspectral imagery classification. The method incorporates filter method based local search and ant colony optimization (ACO) based global search to take advantage of both. Particularly, the local search fine-tunes the paths explored by the ants by adding the relevant bands and eliminating irrelevant/redundant ones. A comparison study to the filters methods (including Gain Ratio, ReliefF, AP based method, and FCBF) and the counterpart wrapper ACO feature selection on four hyperspectral imagery datasets demonstrates that MACO is capable of attaining competitive or better classification accuracy with fewer selected bands. The empirical results suggest that MACO is effective and efficient in identifying relevant bands while eliminating irrelevant/redundant ones. ©2010 IEEE.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Hand-based biometrics fusing palmprint and finger-knuckle-print

Hand-based biometrics fusing palmprint and finger-knuckle-pr...

引用

1st International Workshop on Emerging Techniques and Challenges for Hand-Based Biometrics, ETCHB 2010

作者： Shen, Linlin Bai, Li Ji, Zhen Shenzhen Key Laboratory of Embedded System Design School of Computer Science and Software Engineering Shenzhen University Shenzhen China School of Computer Science University of Nottingham Nottingham United Kingdom

ISBN: (纸本)9781424470655

Although biometrics technology has progressed substantially, its performance is still to be improved for real applications. This paper aims to improve the accuracy of personal identification, when only single sample is registered as template, by integrating multiple hand-based biometrics, i.e. palmprint and finger-knuckle-print. To make fusion much easier, the same feature, so called fusion code, and decision level fusion strategy are used. Experimental results show that much better performance than single modal biometrics has been achieved. © 2010 IEEE.

关键词： Biometrics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：