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

IEEE International Conference on Networking, Sensing and Control

作者： Wenqi Guo William M. Healy Meng Chu Zhou Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA National Institute for Standards and Technology Gaithersburg MD USA Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China ECE Department New Jersey Institute of Technology Newark NJ USA

Sensor nodes in wireless networks often use batteries as their source of energy, but replacing or recharging exhausted batteries in a deployed network can be difficult and costly. Therefore, prolonging battery life becomes a principal objective in the design of wireless sensor networks (WSNs). There is little published data that quantitatively analyze a sensor node's lifetime under different operating conditions. This paper presents several experiments to quantify the impact of key wireless sensor network design and environmental parameters on battery performance. Our testbed consists of MicaZ motes, commercial alkaline batteries, and a suite of techniques for measuring battery performance. We evaluate known parameters, such as communication distance, working channel and operating power that play key roles in battery performance. Through extensive real battery discharge measurements, we expect our results to serve as a quantitative basis for future research in designing and implementing battery-efficient sensing applications and protocols.

关键词： Batteries Wireless sensor networks Discharges (electric) Sensor phenomena and characterization Battery charge measurement Voltage measurement

来源：评论

学校读者我要写书评

暂无评论

Adaptively selecting working frequency to reduce disturbances in high frequency radar

Adaptively selecting working frequency to reduce disturbance...

引用

作者： Gui, R.Z. Key Laboratory of Embedded System and Service Computing Tongji University Ministry of Education Shanghai 200092 China

In high frequency radar, we should avoid noise disturbances in the radar's working-frequency segment. Moreover, the sidelobes of strong targets interfere with the detection of weak targets. A new method based on an adaptive selecting working-frequency is proposed. Frequency spectrum monitor is designed for selecting quiet frequency segment for the radar. Frequency spectrum monitor and the receiver of the radar are arranged to work according to special time periods respectively. So the radar can work in the frequency segments with lower noise disturbances. Moreover, there is no correlation between the noise and the useful echo signal, though the correlation between noises over very short time periods is strong, the noise data produced by frequency spectrum monitor can be exploited effectively Adjusting system parameters in real-time by adaptive methods can be utilized to reduce noise disturbances. Algorithm based on the properties of crosscorrelation between noise and target is exploited for suppressing sidelobe disturbances of strong targets. Lastly, the feasibility of the methods is verified by processing actual radar data.

关键词： Data handling

来源：评论

学校读者我要写书评

暂无评论

Asymptotic throughput for large-scale wireless networks with general node density

引用

Wireless Networks 2012年第5期19卷 559-575页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Yunhao Liu Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China The Tsinghua National Laboratory for Information Science and Technology (TNLIST) Department of Computer Science and Engineering Tongji University Shanghai China The Department of Computer Science Illinois Institute of Technology Chicago USA The TNLIST and School of Software Tsinghua University Beijing China CSE The Hong Kong University of Science and Technology Kowloon Hong Kong

We study the asymptotic throughput for a large-scale wireless ad hoc network consisting of n nodes under the generalized physical model. We directly compute the throughput of multicast sessions to unify the unicast and broadcast throughputs. We design two multicast schemes based on the so-called ordinary arterial road system and parallel arterial road system, respectively. Correspondingly, we derive the achievable multicast throughput by taking account of all possible cases of n s = ω(1) and 1 ≤ n d ≤ n − 1, rather than only the cases of $$n_s=\Uptheta(n)$$ as in most related works, where n s and n d denote the number of sessions and the number of destinations of each session, respectively. Furthermore, we consider the network with a general node density $$\lambda \in [1,n]$$ , while the models in most related works are either random dense network (RDN) or random extended network (REN) where the density is λ = n and λ = 1, respectively, which further enhances the generality of this work. Particularly, for the special case of our results by letting λ = 1 and $$n_s=\Uptheta(n)$$ , we show that for some regimes of n d , the multicast throughputs achieved by our schemes are better than those derived by the well-known percolation-based schemes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Model checking cooperative multi-agent systems in BDI logic

引用

Journal of Information and Computational Science 2012年第5期9卷 1185-1194页

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

Traditional temporal logics such as LTL (Linear Temporal Logic) and CTL (Computation Tree Logic) have shown tremendous success in specifying and verifying hardware and software systems. However, this kind of logic can only model the dynamic behaviors for a single system, and fall short in capturing the joint and concurrent aspects in the composition of systems, such as the interactions and coordinations of agents in Multi-agent systems. Although ATL (Alternating-time Temporal Logic) can solve the problem to a certain extent, by preceding the temporal operators with a selective path quantifier, to specify that the interactions between entities inside the system can make sure that there is a strategy to reach a certain state, it can not formalize the rational mental attitudes of the agents such as the Belief, Desire and Intention (BDI) which plays an essential role in decision making during cooperation with other agents. This paper will investigate this problem by proposing a logic of ATLBDI (Alternating-time Temporal Logic of Belief Desire and Intention) and discuss the algorithmic issues such as model checking algorithms and the computational complexity, along with examples to show its effectiveness. We conclude that model checking for ATLBDI is completely tractable and is in PTIME-Complete, which is quite an optimistic and promising result for further applications. © 2012 by Binary Information Press.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Dynamic Walking of AIBO with Hopf Oscillators

引用

Chinese Journal of Mechanical Engineering 2011年第4期24卷 612-617页

作者： ZHANG Jiaqi TOMIZUKA Masayoshi CHEN Qijun LIU Chengju College of Electronic Information and Engineering Tongji University Shanghai 201804 China College of Electronic Information andEngineering Tongji University Shanghai 201804 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China

More and more biological evidences have been found that neural networks in the spinal cord, referred to as ＂central pattern generators＂（CPGs）, govern locomotion. CPGs are capable of producing rhythmic movements, such as swimming, flying, and walking, even when isolated from the brain and sensory inputs. If we could build up any models that have similar functions as CPGs, it will be much easier to design better locomotion for robots. In this paper, a self-training environment is designed and through genetic algorithm （GA）, walking trajectories for every foot of AIBO are generated at first. With this acquired walking pattern, AIBO gets its fastest locomotion speed. Then, this walking pattern is taken as a reference to build CPGs with Hopf oscillators. By changing corresponding parameters, the frequencies and the amplitudes of CPGs＇ outputs can be adjusted online. The limit cycle behavior of Hopf oscillators ensures the online adjustment and the walking stability against perturbation as well. This property suggests a strong adaptive capacity to real environments for robots. At last, simulations are carried on in Webots and verify the proposed method.

关键词： central pattern generators（CPGs） Hopf Oscillators walking control AIBO Webots

来源：评论

学校读者我要写书评

暂无评论

Automatic Web services composition algorithm based on optimal matching

引用

Journal of Central South University 2011年第4期18卷 1169-1177页

作者：王俊丽丁志军侯玉兵 Engineering Research Center for Enterprise Digital Technology Ministry of EducationTongji University Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University Shanghai Branch China Information Technology Designing and Consulting Institute

A novel layered method was proposed to solve the problem of Web services *** this method,services composition problem was formally transformed into the optimal matching problem of every layer,then optimal matching problem was modeled based on the hypergraph theory,and solved by computing the minimal transversals of the ***,two optimization algorithms were designed to discard some useless states at the intermediary steps of the composition *** effectiveness of the composition method was tested by a set of experiments,in addition,an example regarding the travel services composition was also *** experimental results show that this method not only can automatically generate composition tree whose leaf nodes correspond to services composition solutions,but also has better performance on execution time and solution quality by adopting two proposed optimization algorithms.

关键词： Web services services composition optimal matching hypergraph theory

来源：评论

学校读者我要写书评

暂无评论

Improved condition for controllability of strongly dependent strict minimal siphons in Petri nets

Improved condition for controllability of strongly dependent...

引用

International Conference on Networking, Sensing and Control

作者： Liu, Guanjun Jiang, Changjun Zhou, Mengchu Key Laboratory of the MoE for Embedded System and Service Computing Tongji University Shanghai 201804 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 United States

ISBN: (纸本)9781424495702

Li and Zhou propose an important concept for Petri nets: elementary siphons. They partition siphons into elementary and dependent ones. The controllability of the latter can be ensured by the former's proper control. They give a sufficient condition to decide whether a dependent siphon is controlled by its elementary ones in S3PR. However, this condition is so loose that in many cases the controllability of a dependent SMS cannot be determined although it is actually controlled. In this paper, we propose an improved condition to decide the controllability of strongly dependent SMS. © 2011 IEEE.

关键词： Controllability

来源：评论

学校读者我要写书评

暂无评论

Scaling Laws of Multicast Capacity for Power-Constrained Wireless Networks under Gaussian Channel Model

引用

IEEE Transactions on Computers 2012年第5期61卷 713-725页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Shaojie Tang Yuan He Xufei Mao Yunhao Liu Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science and Engineering Building of Electronics and Information Engineering University of Tongji Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL USA Tsinghua National Laboratory for Information Science and Technology (TNLIST) Tsinghua University Beijing China Department of Computer Science and Engineering University of Tongji China Department of Computer Science Hong Kong University of Science and Technology Kowloon Hong Kong China Tsinghua National Laboratory for Information Science and Technology (TNLIST) School of Software Tsinghua University Beijing China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing China

We study the asymptotic networking-theoretic multicast capacity bounds for random extended networks (REN) under Gaussian channel model, in which all wireless nodes are individually power-constrained. During the transmission, the power decays along path with attenuation exponent α >; 2. In REN, n nodes are randomly distributed in the square region of side length √n. There are n s randomly and independently chosen multicast sessions. Each multicast session has n d + 1 randomly chosen terminals, including one source and n d destinations. By effectively combining two types of routing and scheduling strategies, we analyze the asymptotic achievable throughput for all n s = ω(1) and nd. As a special case of our results, we show that for n s = Θ(n), the per-session multicast capacity for REN is of order Θ(1/√n d n) when nd = O(n/(log n) a+1 ) and is of order Θ(1/n d · (log n) -n/2 ) when n d = Ω(n/log n).

关键词： Lattices Throughput Upper bound Road transportation Receivers Interference Routing

来源：评论

学校读者我要写书评

暂无评论

An ultrasound system for tumor detection in soft tissues using low transient pulse

An ultrasound system for tumor detection in soft tissues usi...

引用

2011 7th IEEE International Conference on Automation Science and Engineering, CASE 2011

作者： Ratnakar, Ashish R. Zhou, MengChu Dept. of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102-1982 United States MoE Key Laboratory of Embedded System and Service Computing Tongji University Shanghai 200092 China

ISBN: (纸本)9781457717307

This work presents a method to detect the size and location of tumor in soft tissues using ultrasound. Quantitative ultrasound is utilized to allow an ultrasound signal to be sent from a transmitter to multiple receivers. This received signal is analyzed for echogenic and echolucent tumors to differentiate between the two along with non-tumor sample and also studied for the delay to determine the size/location of the tumor. The proposed system utilizes Low Transient Pulse (LTP) technique and is implemented using Field Programmable Gate Array (FPGA) and Digital Signal Processor (DSP) technologies. In this co-design architecture, DSP carries out the analysis of received demodulated signal at a lower speed while FPGA runs at a higher one to generate LTP signal and demodulate bandpass ultrasonic signal. This work elaborates the implementation of Quadrature Amplitude Modulation (QAM) receiver on FPGA for the received signal from an ultrasound detector. LTP is applied to the tumor samples through the transmitter and the received signal at an ultrasonic receiver is passed through QAM to obtain different maxima that are then further used to compute the location and the size of the tumor using DSP. This dual platform co-design demonstrates a good application of a FPGA/DSP platform for the LTP generation and received signal processing. © 2011 IEEE.

关键词： Tumors

来源：评论

学校读者我要写书评

暂无评论

The preference relation and its application in the information system

The preference relation and its application in the informati...

引用

2011 IEEE International Conference on Computer Science and Automation Engineering, CSAE 2011

作者： Mingqing, Zhao Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China College of Information Science and Engineering SUST Qingdao China

ISBN: (纸本)9781424487257

In order to strengthen the traditional information system's capacity of describing practical problems, preference relation is introduced into information system and the concepts of preference information system, preference decision table, and information utility function are offered in this paper. In addition, the existence theorem of information utility function and several applications of information utility function in knowledge acquisition are provided. © 2011 IEEE.

关键词： Knowledge acquisition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：