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

International Workshop on Intelligent systems and Applications

作者： Zhang, Nan Miao, Duoqian Gao, Can Department of Computer Science and Technology Tongji University Shanghai 201804 China Department of Computer Science University of Regina Regina SK S4S 0A2 Canada Key Lab. of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China Department of Electrical and Computer Engineering University of Alberta Edmonton AB T6R 2G4 Canada

ISBN: (纸本)9781424498574

Rough set theory, proposed by Pawlak, has been proved to be a mathematical tool to deal with vagueness and uncertainty in intelligent information processing. In this paper, we propose the concept of knowledge granulation in interval-valued information systems, and discuss some important properties. From these properties, it can be shown that the proposed knowledge granulation provides important approaches to measuring the discernibility of different knowledge. It may be helpful for rule evaluation and knowledge discovery in interval-valued information systems. © 2011 IEEE.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Optimal cooperative relay deployment strategy in heterogeneous cellular network

引用

Journal of Information and Computational Science 2011年第8期8卷 1457-1470页

作者： Gao, Zhiwei Wang, Ping Liu, Fuqiang Shan, Lianhai Key Laboratory of Embedded Systems and Service Computing Ministry of Education of China College of Electronics and Information Engineering Tongji University Shanghai 201804 China Shanghai Research Center for Wireless Communications 280 Linhong Rd Changning District Shanghai 200335 China Shanghai Key Laboratory of Digital Media Processing and Transmission 800 Dongchuan RD. Minhang District Shanghai 201100 China

For the purpose of reducing energy consumption and increasing spatial reuse, relay node deployment strategies have been studied widely in wireless network planning. In this paper, we propose a new deploy strategy when cooperative relay transmission protocol is adopted in the heterogeneous network environment. The existence of cooperative relay nodes introduces more interference in the cellular domain. First, we introduce the hetero-interference models which have great influence on heterogeneous access performance. Then, outage probability and symbol error rate models are derived for heterogeneous relay based network. On this basis, several relay deployment strategies are introduced to analyze cooperative network. Furthermore, the multi-objective solution is used to optimize cooperative relay deployment strategy. Numerical results show that such kind deployment strategy can improve the cellular outage probability and symbol error rate as compared with fixed deployment strategy and Nearest-Neighbor algorithm. © 2011 Binary Information Press.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Local-directed network coding in vehicular ad-hoc networks

Local-directed network coding in vehicular ad-hoc networks

引用

18th International Symposium on Intelligent Signal Processing and Communication systems, ISPACS 2010

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

ISBN: (纸本)9781424473717

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. © 2010 IEEE.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Reliable Web services selection using a heuristic algorithm

Reliable Web services selection using a heuristic algorithm

引用

International Conference on Grid and Cloud computing

作者： Shen, Hongjie Ding, Zhijun Chen, Hongzhong Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

ISBN: (纸本)9780769543130

Web services composition (WSC) is the key techniques in its application. Dynamically selecting reliable Web services (WSs) becomes crucial to users. In fact, most works regard a Web service (WS) as the basic unit and selection with end-to-end, and as more and more WSs become available, the WSs selection problem is a complex NP-hard optimization problem. So, in this paper, the WSs consist of the operations and the WSs selection problem is formalized as a finite state machine process and we proposed a backward algorithm to create the WSC tree (WSCT). Then, we proposed a heuristic algorithm to complete the selection of WSs based on the WSCT. The results of experiment show our proposed heuristic algorithm is effective. © 2010 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Constructing prioritized interaction test suite with interaction relationship

Constructing prioritized interaction test suite with interac...

引用

2nd International Workshop on education Technology and Computer Science, ETCS 2010

作者： Yuan, Jianjun Jiang, Zuowen Key Laboratory of Embedded System and Service Computing Ministry of Education of China Tongji University Shanghai China Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

ISBN: (纸本)9780769539874

Interaction testing has addressed some issues on how to select a small subset of test cases. In many systems where interaction testing is needed, the entire test suite is not executed because of time or budget constraints. It is important to prioritize the test cases in these situations. On the other hand, there are not always interactions among any factors in real systems. Moreover, some factors may need N-way (N>2) testing since there is a closer relationship among them. We present a model for prioritized interaction testing with interaction relationship and propose a greedy algorithm for generating variable strength covering arrays with bias. © 2010 IEEE.

关键词： Testing

来源：评论

学校读者我要写书评

暂无评论

An improved PSO algorithm with simulated annealing for constrained function optimization

引用

Zhongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Central South University (Science and Technology) 2011年第SUPPL. 1期42卷 175-179页

作者： Si, Cheng-Yong Yang, Dong-Sheng Tian, Hong-Jun Wang, Lei Wu, Qi-Di College of Electronics and Information Engineering Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China Shanghai Economic and Information Committee Shanghai 200040 China

To solve the problem of infeasible solutions in the constrained function optimization, a constraint-handling technique based on simulated annealing is proposed. The improved particle swarm optimization is also used to verify the effectiveness of this technique. The experimental results show that the proposed algorithm is suitable for solving such problems.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

A Biometric-Based User Authentication for Wireless Sensor Networks

引用

Wuhan University Journal of Natural Sciences 2010年第3期15卷 272-276页

作者： YUAN Jianjun JIANG Changjun JIANG Zuowen School of Electronics and Information Engineering Tongji University / Key Laboratory of Embedded System and Service Computing of Ministry of Education Shanghai 201804 China

This paper proposes a biometric-based user authentication protocol for wireless sensor networks （WSN） when a user wants to access data from sensor nodes, since WSN are often deployed in an unattended environment. The protocol employs biometric keys and resists the threats of stolen verifier, of which many are logged-in users with the same login identity, guessing, replay, and impersonation. The protocol uses only Hash function and saves the computational cost, the communication cost, and the energy cost. In addition, the user＇s password can be changed freely using the proposed protocol.

关键词： authentication biometrics security wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Upper Bounds on Lifetime of Three Dimensional Extended UWB Sensor Networks

引用

电子学报(英文版) 2010年第2期19卷 307-312页

作者： XU Juan JIANG Changjun GUO Aihuang HONG Yongfa LI Shu WANG Cheng School of Electronics and Information Engineering Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing of the Ministry of Education Tongji University Shanghai China College of Information Science and Engineering Shandong University of Science and Technology Qingdao China

The upper bounds on lifetime of three dimensional extended Time hopping impulse radio Ultrawide band (TH-IR UWB) sensor networks are derived using percolation theory arguments. The TH-IR UWB sensor network consists of n sensor nodes distributed in a cube of edge length n^1/3 according to a Poisson point process of unit intensity. It is shown that for such a static three dimensional extended TH-IR UWB sensor network, the upper bound on the lifetime is of order O(n^-1), while in the ideal case, the upper bound on the lifetime is longer than that of a static network by a factor of n ^2/3. Therefore sensor nodes moving randomly in the deployment area can improve the upper bound on network lifetime. The results also reveal that the upper bounds on network lifetime decrease with the number of nodes n, thus extended THIR UWB sensor networks aren't prone to be employed in large-scale network.

关键词：无线传感器网络三维扩展寿命延长超宽带上界静态网络生存时间移动节点

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：