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

IEEE International Conference on Automation Science and Engineering (CASE)

作者： YiFan Hou Ding Liu MengChu Zhou School of Electro-Mechanical Engineering Xidian University Xian China Key Laboratory of Embedded System and Service Computer Ministry of Education Tongji University Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

This work presents an iterative liveness-enforcing method for a class of generalized Petri nets, which can model flexible manufacturing systems. The proposed method checks the liveness of net models using mixed integer programming and controls the token allocations of resource places instead of siphons using a liveness and resource usage ratio-enforcing supervisor. The enumeration of a kind of special structures, which is required in the previous work, is avoided and the number of iterations is bounded by the number of shared resource places in the net model. All strict minimal siphons in the controlled systems are minimally controlled. Several explanatory examples are used to illustrate this method.

关键词： Monitoring Petri nets Iterative methods system recovery Educational institutions Resource management Vectors

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Planar surface area calculation using camera and orientation sensor

Planar surface area calculation using camera and orientation...

引用

IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent systems

作者： Surangrak Sutiworwan Miti Ruchanurucks Pongthorn Apiroop Supakorn Siddhichai Thitiporn Chanwimaluang Makoto Sato ICT for Embedded System Faculty of Engineering Kasetsart University Thailand Huawei Technologies Company Limited Thailand Image Processing Laboratory National Electronics and Computer Technology Center Pathum Thani Thailand Precision and Intelligence Laboratory Department of Information Processing Tokyo Institute of Technology Tokyo Japan

This research proposes a scheme of area calculation system, focusing on image warping to top view. The sensor attached to camera is used to compensate the camera's orientation in real time. One constraint is that the calculated area is planar surface. In practice, the alignment of sensor and camera is imperfect. This error makes the calculated area size inaccurate. Therefore, calibration between camera and sensor is required by using Iterative Least Square method. Then, the extrinsic parameters derived from calibrated sensor and pre-computed intrinsic parameter will be used to generate a homography matrix. In top view image, we can directly count the number of target pixel. Finally, we will also find the relationship between rotation angle and size of each pixel in real-world unit with calculating percentage accuracy of this method. The experimental results show top view target area size generated from the tilted camera using information from the orientation sensor in real time.

关键词： Cameras Calibration Accuracy Real-time systems Conferences Agriculture Equations

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Maximally permissive control of flexible manufacturing systems with fewest disjunctive constraints

Maximally permissive control of flexible manufacturing syste...

引用

2012 International Conference onAdvanced Mechatronic systems, ICAMechS 2012

作者： Chen, YuFeng Zhou, MengChu Li, XiaoOu School of Electro-Mechanical Engineering Xidian University Xi'an 710071 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 United States Departamento de Computación CINVESTAV-IPN Av. IPN 2508 Col. Zacatenco México DF C.P. 07360 Mexico

ISBN: (纸本)9780955529382

For Petri net models whose legal reachability spaces are non-convex, one cannot optimally control them by the conjunctions of linear constraints. This work proposes a method to find a set of linear constraints such that each constraint can forbid all first-met bad markings and every legal marking satisfies at least one constraint. Then, the disjunctions of the obtained constraints can make all legal markings reachable and forbid all first-met bad markings, i.e., the controlled net is live and maximally permissive. The work also develops an integer linear programming model to minimize the number of the constraints. Finally, an example is provided to illustrate the proposed method. © 2012 Intl Jrnal Advanced Mech.

关键词： Flexible manufacturing systems

来源：评论

学校读者我要写书评

暂无评论

A Relational Taxonomy of Services for Large Scale Service Repositories

A Relational Taxonomy of Services for Large Scale Service Re...

引用

IEEE International Conference on Web Services (ICWS)

作者： Yan Wu Chungang Yan Zhijun Ding Pengwei Wang Changjun Jiang Mengchu Zhou Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China School of Electronics and Information Engineering Tongji University Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

With the rapid development of service-oriented computing (SOC) and service-oriented architecture (SOA), the number of services is rapidly increasing. How to organize and manage services effectively in repositories to improve the efficiency of service discovery and composition is important. This paper proposes three categorization rules to classify services for a large scale repository to form a relational taxonomy. The service retrieve scope can be drastically narrowed by this taxonomy. Therefore, the efficiency of service discovery and service composition can be greatly improved. We evaluate and compare the performance of the proposed method and other related ones via a publicly available test set, ICEBE05. The experimental results validate the effectiveness and high efficiency of the proposed one.

关键词： Taxonomy Web services Educational institutions system-on-a-chip Quality of service Conferences computers

来源：评论

学校读者我要写书评

暂无评论

Inertial estimator learning automata

引用

IEICE Transactions on Fundamentals of Electronics, Communications and computer Sciences 2012年第6期E95-A卷 1041-1048页

作者： Zhang, Junqi Ni, Lina Xie, Chen Gao, Shangce Tang, Zheng Department of Computer Science and Technology Key Laboratory of Embedded System and Service Computing Tongji University Shanghai 200092 China College of Information Science and Engineering Shandong University of Science and Technology Qingdao China Department of Intellectual Information Systems Engineering University of Toyama Toyama-shi 930-8555 Japan

This paper presents an inertial estimator learning automata scheme by which both the short-term and long-term perspectives of the environment can be incorporated in the stochastic estimator-the long term information crystallized in terms of the running reward-probability estimates, and the short term information used by considering whether the most recent response was a reward or a penalty. Thus, when the shortterm perspective is considered, the stochastic estimator becomes pertinent in the context of the estimator algorithms. The proposed automata employ an inertial weight estimator as the short-term perspective to achieve a rapid and accurate convergence when operating in stationary random environments. According to the proposed inertial estimator scheme, the estimates of the reward probabilities of actions are affected by the last response from environment. In this way, actions that have gotten the positive response from environment in the short time, have the opportunity to be estimated as "optimal", to increase their choice probability and consequently, to be selected. The estimates become more reliable and consequently, the automaton rapidly and accurately converges to the optimal action. The asymptotic behavior of the proposed scheme is analyzed and it is proved to be Ε-optimal in every stationary random environment. Extensive simulation results indicate that the proposed algorithm converges faster than the traditional stochastic-estimator-based SERI scheme, and the deterministicestimator- based DGPA and DPRI schemes when operating in stationary random environments. Copyright © 2012 The Institute of Electronics, Information and Communication Engineers.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

Design issues in ZigBee-based sensor network for healthcare applications

Design issues in ZigBee-based sensor network for healthcare ...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Jin Soo Choi Meng Chu Zhou Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 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

IEEE 802.15.4/ZigBee sensor networks support small power consumption and node expansion compared to other network standards for WSN. Body sensor networks (BSN) require a number of sensors for sensing medical information from human body, and low power consumption to monitor a patient's status for a long time. However, ZigBee has limited bandwidth and is thus hard to support real time data transmission because of the adoption of CSMA-CA as its medium access control (MAC) protocol. In this paper, we will analyze the reasonable number of nodes, size of payload and packet interval for best QoS for such network. It is found that an appropriate MAC parameters setting can improve the QoS compared to the default setting in IEEE 802.15.4 specification. The effective data rate, average end-to-end delay and packet delivery ratio are found via simulation for various network settings. The results are useful for the construction of ZigBee networks for patient monitoring and care.

关键词： Delay IEEE 802.15 Standards Zigbee Monitoring Payloads Medical services Data models

来源：评论

学校读者我要写书评

暂无评论

Petri net-based real-time scheduling of time-constrained single-arm cluster tools with activity time variation

Petri net-based real-time scheduling of time-constrained sin...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Yan Qiao NaiQi Wu MengChu Zhou Department of Industrial Engineering School of Mechatronics Engineering Guangdong University of Technology Guangzhou China The Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

It is challenging to schedule time-constrained cluster tools subject to activity time variation. With the help of their Petri net model, a real-time control policy is used to offset the activity time variation. Based on it, the schedulability conditions and scheduling algorithms are presented for single-arm cluster tools. The schedulability conditions can be analytically checked. Algorithms are developed based on analytical expressions such that it is also computationally efficient. The schedule obtained by the scheduling algorithms together with a real-time control policy forms the real-time schedule. It is optimal in terms of cycle time.

关键词： Robots Semiconductor device modeling Schedules Load modeling Real time systems Manganese Bismuth

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：