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

2011 IEEE International Conference on Robotics and Automation(2011年IEEE世界机器人与自动化大会 ICRA 2011)

作者： NaiQi Wu Feng Chu Chengbin Chu MengChu Zhou Department of Industrial Engineering School of Mechatronics EngineeringGuangdong University of Tech Laboratoire d'IBISC FRE CNRS 3190 Université d'Evry Val d'EssonneCE 1455 Courcouronnes 91020 Evry C Laboratoire G(e)nie Industriel Ecole Centrale ParisGrande voie des Vignes92295 CH(A)TENAY-MALABRY The MoE Key Laboratory of Embedded System and Service Computing Tongji UniversityShanghai 200092Ch

There are wafer fabrication processes in cluster tools that require revisiting. It is shown that swapping is efficient in operating a dual-arm cluster tool. For dual-arm cluster tools with wafer revisiting, if a swap strategy is applied, it forms a three wafer periodical process with three wafers completed in each period. Such a period contains three cycles in a revisiting process and another three cycles in non-revisiting process. Hence, analysis and scheduling of dual-arm cluster tools with wafer revisiting become very complicated. In this work, a Petri net model is developed to describe the operations of such tools. Based on it, it is found that if a swap strategy is applied to a dual-arm cluster tool with wafer revisiting, it is always in a transient state. A systematic method is presented to analyze its performance.

关键词： Robots Semiconductor device modeling Firing Color Fires Load modeling Transient analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：