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

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

来源：评论

学校读者我要写书评

暂无评论

Estimating the direction of motion based on active RFID

Estimating the direction of motion based on active RFID

引用

5th International Conference on New Trends in Information Science and service Science, NISS 2011

作者： Yujian Yangwei Zhang, Yaing School of Electronics and Information Tongji University Shanghai China School of Economics and Management Shanghai Ocean University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9788988678626

RFID is one of the crucial technology of the IOT (Internet of things), and it has been applying to the fields of manufacturing, logistics management, public security, etc. Active RFID, as one important component of RFID, has striking features of low power consumption, stable signals, long-range read and strong anti-jamming ability. Active RFID is thus widely used in the areas of long-range identification of people and vehicles and Real Time Location system. In the various applications of active RFID, estimating the direction of motion is a vital technical issue. This paper puts forward a new method to estimate. In other words, using several directional antennae, it forms several reading zones, extracts events of tag-entering or tag-leaving and then realizes the estimation by the order of events. In this way, it is feasible to estimate not only the direction of motion of tags accurately, but also other complicated logic, e.g. tag return midway. © 2011 AICIT.

关键词： Radio frequency identification (RFID)

来源：评论

学校读者我要写书评

暂无评论

The preference relation and its application in the information system

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

引用

IEEE International Conference on Computer Science and Automation Engineering (CSAE)

作者： Zhao Mingqing Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China

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.

关键词： Information systems Knowledge acquisition Economics Clustering methods Transforms Information science Approximation methods

来源：评论

学校读者我要写书评

暂无评论

Reader activation scheduling in multi-reader RFID systems: A study of general case

Reader activation scheduling in multi-reader RFID systems: A...

引用

25th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011

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

ISBN: (纸本)9780769543857

Radio frequency identification (RFID) is a technology where a reader device can "sense" the presence of a close by object by reading a tag device attached to the object. To guarantee the coverage quality, multiple RFID readers can be deployed in the given region. In this paper, we consider the problem of activation schedule for readers in a multi-reader environment. In particular, we try to design a schedule for readers to maximize the number of served tags per time-slot while avoiding various interferences. We first develop a centralized algorithm under the assumption that different readers may have different interference and interrogation radius. Next, we propose a novel algorithm which does not need any location information of the readers. Finally, we extend the previous algorithm in distributed manner in order to suit the case where no central entity exists. We conduct extensive simulations to study the performances of our proposed algorithm. And our evaluation results corroborate our theoretical analysis. © 2011 IEEE.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Moving object detection through efficient detection and clustering of reliable singular points

Advances in Intelligent and Soft Computing

引用

Advances in Intelligent and Soft computing 2011年 104卷 381-385页

作者： Cui, Jianzhu Wang, Ping Li, Zhipeng Li, Jing Li, Yan Key Laboratory of Embedded System and Service Computing Supported by Ministry of Education Tongji University Cao'an Highway Shanghai 4800 China

ISBN: (纸本)9783642237768

This paper presents a method to detect vehicles from a moving camera. The detection component involves a cascade of modules. First, motion estimation of singular points in video sequences is used to detect moving vehicle. Finding the image points is the selection of singular points. We impose restrictions about the gradient magnitude and the cornerness. A sparse motion vector field outlines the image motion. We obtain excellent results in real sequences in China. At last, vehicles are detected by clustering of singular points. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Motion estimation

来源：评论

学校读者我要写书评

暂无评论

A Remote Debugging system for OpenMP Parallel Program

A Remote Debugging System for OpenMP Parallel Program

引用

International Conference on Transportation, Mechanical, and Electrical Engineering

作者： Hua Chai Qinqin Shi The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

ISBN: (纸本)9781457717000

A remote debugging system for OpenMP parallel program is presented in this paper. The system consists of two parts, namely, an integrated debugging environment running on the clent-side and a background daemon running on the server-side. Information exchange between the two sides is accomplished through the socket-based network communication technology. The remote debugging function is realized by the automatic instrumentation technology at code level based on syntax tree. Instance tests show that the system can provide remote users with correctness checking, performance analysis and other debugging functions for OpenMP parallel programs. The user interface is simple and very easy to use.

关键词： Parallel Program OpenMP Remote Debugging Syntax Tree Instrumentation Technology

来源：评论

学校读者我要写书评

暂无评论

Electroencephalogram evidence for mirror neuron activity during the observation of drawn hand motion

引用

Neural Regeneration Research 2011年第18期6卷 1398-1403页

作者： Huaping Zhu Yaoru Sun Wenya Duan Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China School of Computer and Information Engineering Jiangxi Normal University Nanchang 330022 Jiangxi Province China

The present study used electroencephalography to examine mu rhythm suppression （a putative index of human mirror neuron system activation） at frontal sites （F3, Fz and F4）, central sites （C3, Cz and C4）, parietal sites （P3, Pz and P4） and occipital sites （O1 and O2）, while subjects observed real hand motion （real hand motion condition） and illustrative depictions of hand motion （drawn hand motion condition）. Experimental data revealed that mu rhythm suppression was exhibited in the mirror neuron system when subjects observed both real and drawn hand motion. Moreover, the mu rhythm recorded at the F3, Fz, F4, and Pz poles was significantly suppressed while observing both stimulus types, but no obvious mu suppression occurred at the O1, 02 and 03 poles. These results suggest that the observation of drawings of human hand actions can activate the human mirror neuron system. This evidence supports the hypothesis that the mirror neuron system may be involved in intransitively abstract action understanding.

关键词： drawn hand motion human mirror neuron direct matching hypothesis mu rhythm event-related desynchronization

来源：评论

学校读者我要写书评

暂无评论

Research on Practical Implementation of Binary Arithmetic Coding with Forbidden Symbol for Error Resilience

Research on Practical Implementation of Binary Arithmetic Co...

引用

2011 International Conference on Frontiers in Computer education(ICFCE 2011)

作者： Wei Zhang Feng Cen Fanglai Zhu The Key Laboratory of Embedded System and Service Computing Ministry of Education Department of Control Science & Engineering Tongji University

Arithmetic coding is a widely applied compression tool with superior coding efficiency to other entropy coding methodsHowever, it suffers from the error resilience and complexityIn this paper, the integer implementation of binary arithmetic coding with forbidden symbol for error resilience is studiedCoding redundancies for employing different quantization coefficients in probability representation and cost effective backtracking distance in bits for maximum a posteriori(MAP) decoding are studied in depthWe observe that the optimal quantization coefficients are independent of forbidden symbol and the probabilities of source and the cost effective backtracking distance is related to the source entropy and the given forbidden symbol probabilitiesSuch observations are also demonstrated by extensive experiments.

关键词： Arithmetic coding Forbidden symbol Error resilience MAP

来源：评论

学校读者我要写书评

暂无评论

Retraction notice to ‘‘Specification and Verification of Dynamic Evolution of Software Architectures” [SYSARC 56 (10) (2010) 523–533]

引用

Journal of systems Architecture 2012年第8期58卷 338-338页

作者： Xu Hongzhen Zeng Guosun Department of Computer Science and Technology Tongji University Shanghai 201804 China Department of Computer Science and Technology East China Institute of Technology Fuzhou Jiangxi Province 344000 China Application of Nuclear Technology Engineering Center of Ministry of Education Nanchang Jiangxi Province 330013 China Embedded System and Service Computing Key Lab of Ministry of Education Shanghai 201804 China

来源：评论

学校读者我要写书评

暂无评论

Automatic Web service composition based on Horn clauses and Petri nets

引用

Expert systems with Applications 2011年第10期38卷 13024-13031页

作者： Tang, Xianfei Jiang, Changjun Zhou, Mengchu Department of Computer Science and Technology Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 United States

This paper introduces an automatic Web service composition method based on logical inference of Horn clauses and Petri nets. The Web service composition problem is transformed into the logical inference problem of Horn clauses by exploring the dependency relations among services. An algorithm is presented, to determine whether the composite service exists in time that is linear in the size of the knowledge base. It can also return the rule set necessary for the composition. Petri nets are chosen to model the rule set and its structural analysis techniques are used to obtain the composite service. © 2010 Elsevier Ltd. All rights reserved.

关键词： Automatic reasoning Knowledge base Petri nets service composition Web service

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：