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

IEEE International Conference on Performance, computing and Communications (IPCCC)

作者： Cheng Wang Jieren Zhou Tianci Liu Lu Shao Huiya Yan Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science Tongji University Shanghai China School of Software Tsinghua University Beijing China Mathematics Department University of Wisconsin-La Crosse La Crosse WI

In this paper, we study capacity scaling laws of the deterministic dissemination (DD) in random wireless networks under the generalized physical model (GphyM). This is truly not a new topic. Our motivation to readdress this issue is two-fold: Firstly, we aim to propose a more general result to unify the network capacity for general homogeneous random models by investigating the impacts of different parameters of the system on the network capacity. Secondly, we target to close the open gaps between the upper and the lower bounds on the network capacity in the literature. We derive the general upper bounds on the capacity for the arbitrary case of (λ, nd, ns) by introducing the Poisson Boolean model of continuum percolation, where λ, nd, and ns are the general node density, the number of destinations for each session, and the number of sessions, respectively. We prove that the derived upper bounds are tight according to the existing general lower bounds constructed in the literature.

关键词： Roads Mathematics Unicast Signal to noise ratio Interference

来源：评论

学校读者我要写书评

暂无评论

Response Policies to Process Module Failure in Single-Arm Cluster Tools Subject to Wafer Residency Time Constraints

Response Policies to Process Module Failure in Single-Arm Cl...

引用

作者： Qiao, Yan Pan, Chun-Rong Wu, Nai-Qi Zhou, Mengchu Department of Industrial Engineering School of Electro-Mechanical Engineering Guangdong University of Technology Guangzhou510006 China School of Mechatronics and Electrical Engineering Jiangxi University of Science and Technology Ganzhou341000 China Institute of Systems Engineering Macau University of Science and Technology Taipa China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07102-1982 United States

In semiconductor manufacturing, wafer residency time constraints make the scheduling problem of cluster tools complicated. A process module (PM) in cluster tools is prone to failure. It is crucial to deal with any such failure in a proper and timely manner. If there are feasible periodic schedules in operating a cluster tool before and after a PM failure, it is desired to make it operate continuously when such a failure occurs. However, due to wafer residency time constraints, it is highly challenging to control a tool such that it can be correctly transferred from a feasible schedule before failure to another after it. To solve this problem, a Petri net model is developed to describe the dynamic behavior of a single-arm cluster tool and failure response policies are proposed. The proposed policies are formulated via simple control laws for their easy implementation. Examples are given to show them. © 2015 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Incorporation of Ordinal Optimization into Learning Automata for High Learning Efficiency

Incorporation of Ordinal Optimization into Learning Automata...

引用

IEEE International Conference on Automation Science and Engineering

作者： JunQi Zhang Cheng Wang Di Zang MengChu Zhou Department of Computer Science and Technology the Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Department of Electrical and Computer Engineering New Jersey Institute of Technology

ISBN: (纸本)9781467381840

Learning automata (LA) represent important leaning mechanisms with applications in automated system design, biological system modeling, computer vision, and transportation. They play the critical roles in modeling a process as well as generating the appropriate signal to control it. They update their action probabilities in accordance with the inputs received from the environment and can improve their own performance during operations. The action probability vector in LA takes charge of two functions: 1) The cost of convergence, i.e., the size of sampling budget;2) The allocation of sampling budget among actions to identify the optimal one. These two intertwined functions lead to a problem: The sampling budget mostly goes to the currently estimated optimal action due to its high action probability regardless whether it can help identify the real optimal action or not. This work proposes a new class of LA that separates the allocation of sampling budget from the action probability vector. It uses the action probability vector to determine the size of sampling budget and then uses Optimal computing Budget Allocation (OCBA) to accomplish the allocation of sampling budget in a way that maximizes the probability of identifying the true optimal action. Simulation results verify its significant speedup ranging from 10.93% to 65.94% over the best existing LA algorithms.

关键词： Convergence Optimization Resource management Learning automata Computational modeling Pursuit algorithms Accuracy

来源：评论

学校读者我要写书评

暂无评论

Using estimation of distribution algorithm to coordinate decentralized learning automata for meta-task scheduling

Using estimation of distribution algorithm to coordinate dec...

引用

Congress on Evolutionary Computation

作者： Jie Li Junqi Zhang Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai Shanghai CN

Learning automaton (LA) is a reinforcement learning model that aims to determine the optimal action out of a set of actions. It is characterized by updating a selection probability vector through a sequence of repetitive feedback cycles interacting with an environment. Decentralized learning automata (DLAs) consists of many learning automata (LAs) that learn at the same time. Each LA independently selects an action based on its own selection probability vector. In order to provide an appropriate central coordination mechanism in DLAs, this paper proposes a novel decentralized coordination learning automaton (DCLA) using a new selection probability vector which is combined with the probability vectors derived from both LA and estimation of distribution algorithm (EDA). LA contributes to the own learning experience of each LA while EDA estimates the distribution of the whole swarm's promising individuals. Thus, decentralized LAs can be coordinated by EDA using the swarm's comprehensive knowledge. The proposed automaton is applied to solve the real problem of meta-task scheduling in heterogeneous computing system. Extensive experiments demonstrate a superiority of DCLA over other counterpart algorithms. The results show that the proposed DCLA provides an effective and efficient way to coordinate LAs for solving complicated problems.

关键词： Vectors Learning automata Sociology Statistics Processor scheduling Scheduling Estimation

来源：评论

学校读者我要写书评

暂无评论

Improvement of rotation matrix based differential limited feedback with DFT codebook and its application in CoMP environment

引用

Journal of Communications 2014年第6期9卷 498-505页

作者： Zhu, Yin Ji, Yusheng Wang, Ping Liu, Fuqiang Broadband Wireless Communications and Multimedia Laboratory Key Laboratory of Embedded System and Service Computing supported by Ministry of Education Tongji University Shanghai 201804 China National Institute of Informatics Tokyo Japan

Recently, exploiting the temporal correlation of slowly varied multiple input multiple output (MIMO) channels to further improve the system performance or the feedback efficient in MIMO wireless communication systems with limited feedback has been investigated in many papers. Among them, T. Kim et al. proposed a rotation matrix based differential feedback scheme which is shown to have good performance with regard to the system throughput for spatial multiplexing MIMO systems. Although the rotation matrix codebook and the precoding codebook in their scheme are optimally constructed, they are not fit for a practical system due to the structure constraints. In this paper, we propose to replace the optimal codebook in the rotation matrix based differential feedback scheme with discrete Fourier transform (DFT) structured codebook, and propose a search-based method to decrease the performance degradation induced by the un-optimality of the DFT codebook. In addition, the modified algorithm is also applied to a per-cell codebook based coordinated multi-point (CoMP) transmission system to verify its applicability to different MIMO scenarios. Simulation results show the effectiveness of our modified scheme. © 2014 Engineering and Technology Publishing.

关键词： Discrete Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

A framework of video coding for compressing near-duplicate videos

A framework of video coding for compressing near-duplicate v...

引用

20th Anniversary International Conference on MultiMedia Modeling, MMM 2014

作者： Wang, Hanli Ma, Ming Jiang, Yu-Gang Wei, Zhihua Department of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China School of Computer Science Fudan University Shanghai China

ISBN: (纸本)9783319041131

With the development of multimedia technique and social network, the amount of videos has grown rapidly, which brings about an increasingly substantial percentage of Near-Duplicate Videos (NDVs). It has been a hot research topic to retrieve NDVs for a number of applications such as copyright detection, Internet video ranking, etc. However, there exist a lot of redundancies in NDVs, and to the best of our knowledge it is an untouched research area on how to efficiently compress NDVs in a joint manner. In this work, a novel video coding framework is proposed to effectively compress NDVs by making full use of the relevance among them. Experimental results demonstrate that a significant storage saving can be achieved by the proposed NDV coding framework. © 2014 Springer International Publishing.

关键词： Video signal processing

来源：评论

学校读者我要写书评

暂无评论

Monitor-based Liveness-enforcing Petri Net Supervisors for Flexible Manufacturing systems 33

Monitor-based Liveness-enforcing Petri Net Supervisors for F...

引用

第三十三届中国控制会议

作者： YOU Dan WANG Shouguang ZHOU MengChu WU Wenhui School of Information & Electronic Engineering Zhejiang Gongshang University IEEE State Key Laboratory for Manufacturing Systems Engineering Xi’ an Jiaotong University The Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewarkNJ 07102USA

ISBN: (纸本)9781479947249

Deadlocks are a rather undesirable phenomenon in flexible manufacturing systems(FMSs).This work,by adding monitors,develops a deadlock prevention policy for FMSs that can be modeled by a class of Petri nets called-S3 PR ***,an algorithm is given to reduce an S3 PR via *** on it,-resources in-S3 PRs are classified into A--resources and ***,for an-S3 PR with only B--resources,it is proved that a maximally permissive liveness-enforcing supervisor can be designed by M-controlling all the emptied strict minimal siphons(SMSs).For an-S3 PR containing A--resources,a liveness-enforcing supervisor can be designed by iteratively reducing the net via A--resources and adding the corresponding ***,a comprehensive deadlock prevention algorithm for-S3 PRs is *** FMS example is used to illustrate its application.

关键词： Flexible manufacturing system(FMS),Petri nets,deadlock prevention policy,supervisory control

来源：评论

学校读者我要写书评

暂无评论

Robust control reconfiguration of resource allocation systems with Petri nets and integer programming

Robust control reconfiguration of resource allocation system...

引用

作者： Li, Jun Zhou, Mengchu Guo, Tao Gan, Yahui Dai, Xianzhong Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of Education China School of Automation Southeast University Nanjing 210096 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

Supervisory control reconfiguration can handle the uncertainties including resource failures and task changes in discrete event systems. It was not addressed to exploit the robustness of closed-loop systems to accommodate some uncertainties in the prior studies. Such exploitation can cost-efficiently achieve reconfigurability and flexibility for real systems. This paper presents a robust reconfiguration method based on Petri nets (PNs) and integer programming for supervisory control of resource allocation systems (RASs) subject to varying resource allocation relationships. An allocation relationship is seen as a control specification while the execution processes requiring resources as an uncontrolled plant. First, a robust reconfiguration mechanism is proposed. It includes updating the P-invariant-based supervisor and evolving the state of the closed-loop system. The latter adapts to the control specification changes by the self-regulation of the closed-loop system's state. Next, two novel integer programming models for control reconfiguration are proposed, called a reconfiguration model with acceptability and reconfiguration one with specification correction. Since both models integrate the firability condition of transitions, no additional efforts are required for the state reachability analysis. Finally, a hospital emergency service system is used as an example to illustrate them. © 2014 Elsevier Ltd. All rights reserved.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

A Method to Check Liveness of WS3PR 33

A Method to Check Liveness of WS3PR

引用

第三十三届中国控制会议

作者： WANG ShouGuang LIU Miao ZHOU MengChu WU WenHui IEEE School of Information & Electronic Engineering Zhejiang Gongshang University State Key Laboratory for Manufacturing Systems Engineering Xi’an Jiaotong University School of Electro-Mechanical Engineering Xidian University The Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewarkNJ 07102USA

ISBN: (纸本)9781479947249

Petri nets are widely used to model flexible manufacturing systems(FMSs) because they can help analyze the properties and synthesize deadlock-free supervisory controllers of *** system of Simple Sequential Processes with Resources(WS3PR) is an important subclass of Petri nets that can well model many *** work first gives new algorithms to check liveness for a WS3 PR net via its subnet trees and *** the computation complexity for the proposed method is shown in this paper,to be polynomial under certain ***,sufficient conditions for deciding liveness of a WS3 PR are *** example is used to illustrate the results.

关键词： Liveness,flexible manufacturing system,deadlock,Petri net.

来源：评论

学校读者我要写书评

暂无评论

A Petri Nets Based Approach for Detecting the Data Races and Deadlocks in OpenMP Program

A Petri Nets Based Approach for Detecting the Data Races and...

引用

2012 Third International Conference on Theoretical and Mathematical Foundations of Computer Science(ICTMF 2012)

作者： Yulong Xian Zhijun Ding Department of Computer Science and Technology Tongji University The Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University

Because of OpenMP programs shielding the underlying parallel execution and scheduling details,data races and deadlocks are tend to occur during program ***,this paper puts forward the modeling method of OpenMP programs based on Petri *** flow of programs are modeled according to the semantics of program control statements and directives of OpenMP programs;Data flow of programs are modeled by abstracting read and write operations related to shared *** two detection algorithms of data race and deadlock for OpenMP program are given based on the coverability tree of Petri ***,corresponding software tool is designed and implemented,and an OpenMP program example of the dining philosophers problem is analyzed to indicate the effectiveness of this method and tools.

关键词： OpenMP, Data races, Deadlock, Static detection, Petri nets

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：