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

An algorithm for generating home states of Petri nets

Journal of Computational Information systems 2011年第12期7卷 4225-4232页

作者： Wang, Pengwei Ding, Zhijun Chai, Hua Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai 200092 China Department of Computer Science and Technology Tongji University Shanghai 201804 China

Home states are ground markings which can be reached from any other reachable markings of a Petri net. The existence of home states is a strong property, and it is not only of important theoretical research meaning, but also of great practical value. This paper presents an algorithm for generating home states. For any bounded Petri net, the algorithm can judge whether it contains home states or not, and obtain the set of all its home states. The correctness of the algorithm is proved, and its complexity is analyzed, the result shows that it is a polynomial-time algorithm, so it is effective. Meanwhile, we implemented the algorithm in the popular Petri net tool PIPE2, which can be used for experimental purposes. Then a number of conclusions about the relationships between home state and deadlock are given, which bring great convenience to judge deadlock and exert control pointedly. Copyright © 2011 Binary Information Press.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Capacity and delay in mobile cognitive networks with random way-point mobility model

引用

AEU - International Journal of Electronics and Communications 2011年第4期65卷 288-295页

作者： Xingzhen Bai Shu Li Changjun Jiang Juan Xu Cheng Wang Lina Han The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China College of Information & Electrical Engineering Shandong University of Science & Technology Qingdao 266510China

We study the throughput and delay scaling laws of the mobile cognitive network. There are n primary users and m secondary users in the primary network and the secondary network, respectively. They are distributed uniformly and independently on the surface of a unit torus, moving according to the random way-point mobility model (RWMM). The primary users have priority to access the spectrum, and do not alter their protocol in the presence of the secondary network. The secondary users opportunistically use the licensed spectrum when it remains unused. Under the improved 2-hop relay policy, we derive the constant throughput of Θ ( 1 ) per primary source–destination (S–D) pair when the radius of the preservation region r p = Θ ( 1 / m ) . The expected delay scales as Θ ( n / v ( n ) ) , where v ( n ) is the average speed of the primary nodes. Moreover, if the secondary network is denser than the primary network, i.e., m = n γ with γ > 1 , the constant throughput of Θ ( 1 ) per secondary S–D pair and the expected delay of Θ ( m / v ( m ) ) can be derived surprisingly when the radius of the avoidance region r s = Θ ( 1 / n ) and r p = Θ ( 1 / m ) , where v ( m ) is the average speed of the secondary nodes.

关键词： Throughput Delay Scaling law Cognitive networks Mobility

来源：评论

学校读者我要写书评

暂无评论

A novel discrete particle swarm optimization algorithm for meta-task assignment in heterogeneous computing systems

引用

Microprocessors and Microsystems 2011年第1期35卷 10-17页

作者： Qinma Kang Hong He The Key Laboratory of “Embedded System and Service Computing” Ministry of Education Tongji University Shanghai 201804 PR China School of Information Engineering Shandong University at Weihai Weihai 264209 PR China

Optimal assignment of a meta-task in heterogeneous computing systems is NP-complete in the general case. Therefore, heuristic approaches must be employed to find good solutions within a reasonable time. We propose a novel discrete particle swarm optimization (DPSO) algorithm for this problem. Firstly, to make particle swarm optimization algorithm more suitable for solving task assignment problems, particles are represented as integer vectors and a new position update method is developed based on discrete domain. Secondly, an effective variable neighborhood descent algorithm is applied to emphasize exploitation. In addition, migration mechanism is introduced with the hope to escape from possible local optimum and to balance the exploration and exploitation. Computational simulations and comparisons based on a set of benchmark instances indicate that the proposed DPSO algorithm is a viable approach for the task assignment problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Detecting vehicle target in SAR image with high moment

Detecting vehicle target in SAR image with high moment

引用

International Radar Symposium (IRS)

作者： Renzhou Gui Zhi Wang State Key Laboratory of Satellite Ocean Environment Dynamics The Key Laboratory of Embedded System and Service Computing Ministry of Eduction College of Electronics & Information Engineering Tongji University Shanghai China

Vehicle detection in SAR image is attractive field. High moments included numerous information is proposed to exploit in the field. It not only restrains Gaussian noise automatically, but also suppresses non-gaussian noise. Man-made targets in are different from the background clutter. Moreover, the influence of the shadow about man-made targets is reduced in the algorithm of high moments. We utilize high moments to avoid to analyst the complex scatter theory. By analyzing the relevent theory and practical calculated method of high order moments, we compare the difference of probability of detection between the target chip and clutter chip to achieve the goal of detection. Through processing lots of actual SAR data which is added different kinds of noise, we compare the performance between high order moments and low-order moments method.

关键词： Noise Vehicles Clutter Probability density function Object detection Graphics Moment methods

来源：评论

学校读者我要写书评

暂无评论

A three-stage method to find refining schedules of crude oil operations in refinery

A three-stage method to find refining schedules of crude oil...

引用

IEEE International Conference on service Operations and Logistics, and Informatics, SOLI

作者： Naiqi Wu LiPing Bai MengChu Zhou School of Mechatronics Engineering Guangdong University of Technology Guangzhou China MoE Key Laboratory of Embedded System and Service Computing University of Tongji Shanghai China ECE New Jersey Institute of Technology Newark NJ USA

A short-term scheduling problem for crude oil operations is highly challenging. There lack efficient techniques and software tools for its solution. Our prior research shows that it may be solved in a hierarchical way. At the upper level, we find a realizable refining schedule to optimize concerned objectives. At the lower level, a detailed schedule is obtained to realize it. This work attempts to present a three-stage method to solve the the upper level problem from a control perspective. The first stage solves a linear programming problem to determine the maximal production rate. The second one solves a transportation problem to optimally assign crude oil types and volume to the distillers. The last one adjusts and sequences oil parcels. Consequently, the proposed method is computationally efficient. An industrial case study is presented to show the result.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Modeling and analysis of dual-arm cluster tools for wafer fabrication with revisiting

Modeling and analysis of dual-arm cluster tools for wafer fa...

引用

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

作者： Qiao, Yan Wu, NaiQi Zhou, MengChu Department of Industrial Engineering School of Mechatronics Engineering Guangdong University of Technology Guangzhou 510006 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-1982 United States

ISBN: (纸本)9781457717307

Some wafer fabrication processes are repeated processes, e.g. atomic layer deposition (ALD) process. For such processes, the wafers need to visit some processing modules for a number of times, which complicates the cycle time analysis. This paper studies the cycle time analysis problem for such processes. With a Petri net model, it is found that such processes contain local cycles involving only the revisiting PMs and global cycles involving both revisiting and non-revisiting PMs. The process switches between these two types of cycles such that the process never reaches a steady state. Based on this finding, the mechanism underlying such processes is revealed and analytical expressions are given for the calculation of their cycle time. Illustrative examples are presented to show the application of the proposed approach. © 2011 IEEE.

关键词： Atomic layer deposition

来源：评论

学校读者我要写书评

暂无评论

Closed-form solution for cycle time of revisiting processes in single-arm cluster tool scheduling with atomic layer deposition

Closed-form solution for cycle time of revisiting processes ...

引用

IEEE International Conference on Networking, Sensing and Control

作者： YuXi Sun NaiQi Wu MengChu Zhou School of Mechatronics Engineering Guangdong University of Technology Guangzhou China Key Laboratory of MoE for Embedded System and Service Computing University of Tongji Shanghai China ECE Department New Jersey Institute of Technology Newark NJ USA

Atomic layer deposition (ALD) is a typical process with wafer revisiting that should be performed by cluster tools. This paper discusses the scheduling problem of single-arm cluster tools for the ALD process. In scheduling such system, the most difficult part is to schedule the revisiting process and obtain its optimal cycle time. This paper studies the revisiting process of ALD with revisiting times k = 3, 4, and 5. Analytical expressions are obtained to calculate the cycle time for the k possible schedules with k = 3, 4, and 5, respectively, so as to obtain the optimal one. In this way, the scheduling problem of such a revisiting process becomes simple and this is a significant improvement in scheduling cluster tools with wafer revisiting.

关键词： Schedules Semiconductor device modeling Robots Load modeling system recovery Color Integrated circuit modeling

来源：评论

学校读者我要写书评

暂无评论

Fast adaptive interpolation filter algorithm for bi-predicted frame in video coding

Fast adaptive interpolation filter algorithm for bi-predicte...

引用

International Conference on Multimedia Technology

作者： Huichao Gao Feng Cen Weisheng Xu Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China College of Electronics and Information Engineering University of Tongji Shanghai China

ISBN: (纸本)9781612847719

This paper proposes a novel adaptive interpolation filter (AIF) to reduce computational complexity and bit-rate of video coding. In the proposed AIF, the filter coefficients of B frames, which are predicted from those of adjacent P frames with a novel parabolic model, are unnecessary to transmit. Experimental results show that the coding complexity is reduced by 40.22% with no penalty on coding efficiency and 1.59% bit rate reduction is achieved at low bit-rate against conventional AIF.

关键词： Interpolation Wiener filter Adaptive filters Encoding Information filters Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Asymptotic bounds on lifetime of large scale clustering UWB sensor network

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2011年第10期39卷 2263-2268+2281页

作者： Xu, Juan Fang, Yu Xu, Hua-Jie School of Electronics and Information Engineering Tongji University Shanghai 200092 China Key Laboratory of Embedded System and Service Computing of the Ministry of Education Tongji University Shanghai 200092 China School of Computer and Electronic Information Guangxi University Nanning Guangxi 530004 China

Considering time hopping impulse radio ultra wide band (TH-IR UWB) sensor networks composed n sensor nodes which are placed according to a Poisson point process on a square and a Sink. The results demonstrate that the bounds on the lifetime of dense network increase with the increase of the number of nodes n, and that of extended network decrease with the increase of the number of nodes n. The results also indicate the bounds on the lifetime of clustering sensor networks is far more than that of non-clustering network, thus clustering can evidently improve network lifetime. Furthermore, the bounds on the lifetime of clustering TH-IR UWB sensor network which the nodes are distributed according to a Poisson point process are different from that of clustering network which the nodes are placed according to uniform distribution, thus the behavior of nodes deploying can remarkably affect the lifetime bound.

关键词： Energy dissipation

来源：评论

学校读者我要写书评

暂无评论

Adaptive social network construction using Gaussian mixture model

引用

Information Technology Journal 2011年第12期10卷 2252-2259页

作者： Guo, Xin Xiang, Yang Chen, Qian Wei, Wei Department of Computer Science and Technology School of Electronic and Information Engineering Tongji University Shanghai 201804 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China

A Social network graph shows social interactions and relationships between individuals in a specific social environment, which is very helpful for analyzing social relationships, activities, structures, etc. The author quantized the strengths of social objects' relationships in social environment using an improved vector space model. Gaussian mixture model was employed to set the threshold for identifying social relationships adaptively and divide social subgroups automatically. According to the threshold, social network graph would be constructed based on performance measures. It is concluded that hidden social relationships can be discovered effectively by using this approach which is very flexible and adaptive for dynamic information feedback mechanism. © 2011 Asian Network for Scientific Information.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：