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

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

来源：评论

学校读者我要写书评

暂无评论

General measure of knowledge granularity in incomplete information system

General measure of knowledge granularity in incomplete infor...

引用

GCIS, WRI Global Congress on Intelligent systems

作者： Zhao, Lei Zhao, Mingqing Shandong University of Science and Technology Qingdao China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9780769543048

This essay introduces the concepts of knowledge granularity and information system. On this basis, we propose two new more general knowledge granularities: the combination granularity and polynomial granularity, which include the current common knowledge granularity. And discuss the use of their combination. The results for the establishment of granular computing in the incomplete information system have some theoretical significance and practical values. © 2010 IEEE.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

Utilizing adaptive techniques to supress noise in high frequency ground wave radar

Utilizing adaptive techniques to supress noise in high frequ...

引用

4th Microwave and Radar Week MRW-2010 - 11th International Radar Symposium, IRS 2010

作者： Gui, Renzhou Key Laboratory of Embedded System and Service Computing Ministry of Education College of Electronics and Information Engineering Tongji University Shanghai 200092 China State Key Laboratory of Millimeter Waves China

ISBN: (纸本)9789955690184

Reducing noise disturbances in the frequency segment of high frequency (HF) ground wave radar and restraining the sidelobes of strong targets that interfere with the detection of weak targets are the interesting Topic. A new method based on an adaptive techniques that solves these problems is proposed. By changing the working time of the frequency spectrum monitor (FSM), we have shown not only that radar can run in the frequency segments with lower noise disturbances, but also that the noise data produced by FSM can be exploited effectively. There is no correlation between the noise and the useful echo signal, though the correlation between noises over very short time periods is strong,. Exploiting the phenomena, we can adjust system parameters in real-time by adaptive methods to solve the two problems,namely sidelobe disturbance of strong targets and noise distrubance in the frequency segment.

关键词： Bandpass filters

来源：评论

学校读者我要写书评

暂无评论

Incremental sensor node deployment for low cost and highly available WSNs

Incremental sensor node deployment for low cost and highly a...

引用

International Conference on Mobile Ad-hoc and Sensor Networks

作者： Al-Omari, Safwan Shi, Weisong Jordan University of Science and Technology Jordan Key Laboratory of Embedded System and Service Computing Tongji University China Wayne State University United States

ISBN: (纸本)9780769543154

We attack the sensor network deployment problem. We define the deployment problem as the problem of deciding how many sensor nodes should be deployed in the sensor field over how many phases during its lifetime. We target the optimal deployment strategy that meets user-defined availability requirement with minimum total cost taking into consideration node failures and changing field trip to sensor node cost ratio. We model WSN availability and total cost as functions of the deployment plan, then, we formalize the deployment problem as a 2D optimization problem. Our modeling enables us to explore cost-benefit tradeoffs, we believe, this is a solid step toward bringing cost as an explicit dimension in the design space of WSN protocols. We compare the performance of the optimized solution (denoted as pro-active) to more ad-hoc solutions: on-demand) and at-front. The former strategy schedules future deployments only on demand. The latter strategy deploys all nodes at front with no later field trips. Using extensive simulations, we show that proactive outperforms at-front and on-demand in terms of total cost per availability unit in all application scenarios. For example, using pro-active costs $7 compared to $40 and $280 per total uptime in case of on-demand and at-front, respectively. © 2010 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

An Effective Principal Curves Extraction Algorithm for Complex Distribution Dataset 1

引用

5th International Conference on Rough Set and Knowledge Technology (RSKT)

作者： Zhang, Hongyun Miao, Duoqian Sun, Lijun Ye, Ying The Key Laboratory of Embedded System and Service Computing Ministry of Education China Tongji University Shanghai 201804 China School of Electronic and Information Engineering Tongji University Shanghai 201804 China

ISBN: (数字)9783642162480

ISBN: (纸本)9783642162473

This paper proposes a new method for finding principal curves from complex distribution dataset. Motivated by solving the problem, which is that existing methods did not perform well on finding principal curve in complex distribution dataset with high curvature, high dispersion and self-intersecting, such as spiral-shaped curves, Firstly, rudimentary principal graph of data set is created based on the thinning algorithm, and then the contiguous vertices are merged. Finally the fitting-and-smoothing step introduced by Kegl is improved to optimize the principal graph, and Kegl's restructuring step is used to rectify imperfections of principal graph. Experimental results indicate the effectiveness of the proposed method on finding principal curves in complex distribution dataset.

关键词： Principal curves Complex distribution dataset Thinning algorithm Fitting-smoothing step Image skeletonization

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of communication module in passive ultrasonic sensor networks

Design and implementation of communication module in passive...

引用

2010 International Conference on Computer, Mechatronics, Control and Electronic Engineering, CMCE 2010

作者： Han, Lina Zhao, Rui Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Third Research Institute of The Ministry of Public Security Shanghai China

ISBN: (纸本)9781424479566

Passive sensor networks can achieve accurate detection of target under complex environment. In order to adapt to different communication demands of sensor networks in different environments, this paper designed and implemented a wireless and wired mixed communication module, that is, a communication system combined short-distance wireless communication based on radio frequency technology with broadband cable communication. Simulation results show that our system can achieve the desired requirements in different circumstances. © 2010 IEEE.

关键词： Ultrasonic applications

来源：评论

学校读者我要写书评

暂无评论

Gene selection and cancer classification: A rough sets based approach

Gene selection and cancer classification: A rough sets based...

引用

Rough Set and Knowledge Technology Conference, RSKT 2008

作者： Sun, Lijun Miao, Duoqian Zhang, Hongyun Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China Department of Computer Science and Technology Tongji University Shanghai 201804 China

ISBN: (纸本)3642144667

Indentification of informative gene subsets responsible for discerning between available samples of gene expression data is an important task in bioinformatics. Reducts, from rough sets theory, corresponding to a minimal set of essential genes for discerning samples, is an efficient tool for gene selection. Due to the compuational complexty of the existing reduct algoritms, feature ranking is usually used to narrow down gene space as the first step and top ranked genes are selected . In this paper,we define a novel certierion based on the expression level difference btween classes and contribution to classification of the gene for scoring genes and present a algorithm for generating all possible reduct from informative *** algorithm takes the whole attribute sets into account and find short reduct with a significant reduction in computational complexity. An exploration of this approach on benchmark gene expression data sets demonstrates that this approach is successful for selecting high discriminative genes and the classification accuracy is impressive. © 2010 Springer-Verlag.

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

Progressive ranking and composition of web services with interaction relationship

Journal of Software

引用

Journal of Software 2010年第8期5卷 842-850页

作者： Yuan, Jianjun Jiang, Changjun Jiang, Zuowen The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

service-oriented computing is a new software development paradigm that allows application developers to select available services from the Internet and to form new web services. A main problem is how to efficiently determine the most appropriate web services that will be combined into an application based on their functionalities, licensing costs, and reliability. Bryce et al. make use of the group testing results, and then progressively select the best component WS to construct the composite service by using interaction testing. However, they consider only pair-wise (2-way) interaction among any two component WS. In really composite service, there are not always interactions among any component WS, and some component WS may need Nway (N >2) testing since there is a closer relationship among them. We extend the model of interaction testing for WS with interaction relationship and propose a greedy algorithm for constructing variable covering arrays with bias. Experimental results show that our approach can cover more important interactions among web services earlier. © 2010 ACADEMY PUBLISHER.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Task allocation for maximizing reliability of distributed computing systems using honeybee mating optimization

引用

Journal of systems and Software 2010年第11期83卷 2165-2174页

作者： Kang, Qin-Ma He, Hong Song, Hui-Min Deng, Rong Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China School of Information Engineering Shandong University at Weihai 180 Wenhua Xilu Weihai 264209 China School of Mathematics and Statistics Shandong University at Weihai Weihai 264209 China

This paper deals with the problem of task allocation (i.e,;to which processor should each task of an application be assigned) in heterogeneous distributed computing systems with the goal of maximizing the system reliability. The problem of finding an optimal task allocation is known to be NP-hard in the strong sense. We propose a new swarm intelligence technique based on the honeybee mating optimization (HBMO) algorithm for this problem. The HBMO based approach combines the power of simulated annealing, genetic algorithms with a fast problem specific local search heuristic to find the best possible solution within a reasonable computation time. We study the performance of the algorithm over a wide range of parameters such as the number of tasks, the number of processors, the ratio of average communication time to average computation time, and task interaction density of applications. The effectiveness and efficiency of our algorithm are demonstrated by comparing it with recently proposed task allocation algorithms for maximizing system reliability available in the literature. © 2010 Elsevier Inc. All rights reserved.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

Local-directed network coding in vehicular ad-hoc networks

Local-directed network coding in vehicular ad-hoc networks

引用

IEEE International Symposium on Intelligent Signal Processing and Communication systems (ISPACS)

作者： Haojie Luo Dongdong Zhang Chen Ye The Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

In this paper, we proposed a novel network coding method called local-directed network coding to improve the throughput of the vehicular ad-hoc network. Different from other vehicular network coding methods, we consider the direction of packet transmission. In detail, the intermediate node selects one main packet and some sub-packets from forwards and backwards sending queues, and then encodes these packets into one packet to broadcast. Simulation results show that our approach can efficiently improve the throughput of application layer in vehicular networks.

关键词： Encoding Buffer storage Accidents Vehicles Streaming media Artificial neural networks Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：