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

作者： 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

来源：评论

学校读者我要写书评

暂无评论

26th Annual Computational Neuroscience Meeting (CNS*2017): Part 3 Antwerp, Belgium. 15-20 July 2017 Abstracts

引用

BMC NEUROSCIENCE 2017年第SUPPL 1期18卷 95-176页

作者： [Anonymous] Department of Neuroscience Yale University New Haven CT 06520 USA Department Physiology & Pharmacology SUNY Downstate Brooklyn NY 11203 USA NYU School of Engineering 6 MetroTech Center Brooklyn NY 11201 USA Departament de Matemàtica Aplicada Universitat Politècnica de Catalunya Barcelona 08028 Spain Institut de Neurobiologie de la Méditerrannée (INMED) INSERM UMR901 Aix-Marseille Univ Marseille France Center of Neural Science New York University New York NY USA Aix-Marseille Univ INSERM INS Inst Neurosci Syst Marseille France Laboratoire de Physique Théorique et Modélisation CNRS UMR 8089 Université de Cergy-Pontoise 95300 Cergy-Pontoise Cedex France Department of Mathematics and Computer Science ENSAT Abdelmalek Essaadi’s University Tangier Morocco Laboratory of Natural Computation Department of Information and Electrical Engineering and Applied Mathematics University of Salerno 84084 Fisciano SA Italy Department of Medicine University of Salerno 84083 Lancusi SA Italy Dipartimento di Fisica Università degli Studi Aldo Moro Bari and INFN Sezione Di Bari Italy Data Analysis Department Ghent University Ghent Belgium Coma Science Group University of Liège Liège Belgium Cruces Hospital and Ikerbasque Research Center Bilbao Spain BIOtech Department of Industrial Engineering University of Trento and IRCS-PAT FBK 38010 Trento Italy Department of Data Analysis Ghent University Ghent 9000 Belgium The Wellcome Trust Centre for Neuroimaging University College London London WC1N 3BG UK Department of Electronic Engineering NED University of Engineering and Technology Karachi Pakistan Blue Brain Project École Polytechnique Fédérale de Lausanne Lausanne Switzerland Departement of Mathematics Swansea University Swansea Wales UK Laboratory for Topology and Neuroscience at the Brain Mind Institute École polytechnique fédérale de Lausanne Lausanne Switzerland Institute of Mathematics University of Aberdeen Aberdeen Scotland UK Department of Integrativ

来源：评论

学校读者我要写书评

暂无评论

Enhanced LCCG: A novel test clock generation scheme for faster-than-at-speed delay testing

Enhanced LCCG: A novel test clock generation scheme for fast...

引用

Asia and South Pacific Design Automation Conference

作者： Songwei Pei Ye Geng Huawei Li Jun Liu Song Jin Beijing University of Chemical Technology Beijing 100029 China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing CN School of Computer and Information University of Technology Hefei China School of Electrical and Electronic Engineering North China Electric Power University Baoding China

ISBN: (纸本)9781479977932

On-chip faster-than-at-speed delay testing provides a promising way for small delay defect detection. However, the frequency of on-chip generated test clock would be impacted by process variations. Hence, it requires determining the actual frequency of generated test clock to ensure the effectiveness of faster-than-at-speed delay testing. In this paper, we present a novel test clock generation scheme, namely Enhanced LCCG, for faster-than-at-speed delay testing. In the proposed scheme, faster-than-at-speed test clock is firstly generated by configuring the corresponding control information specified in the test pattern into Enhanced LCCG. Then, by constructing oscillation paths and counting the corresponding oscillation iteration numbers, the actual frequency of test clock can be measured and calculated with high resolution. Experimental results are presented to validate the proposed method.

关键词： Delays Clocks Oscillators Testing Frequency measurement Logic gates

来源：评论

学校读者我要写书评

暂无评论

New reachability trees for unbounded Petri nets

New reachability trees for unbounded Petri nets

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： ShouGuang Wang MengChu Zhou MengDi Gan Dan You Yue Li School of Information & Electronic Engineering Zhejiang Gongshang University Hangzhou China State Key Laboratory for Manufacturing Systems Engineering Xi'an Jiaotong University Xi'an China MoE Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

ISBN: (纸本)9781479969241

Reachability is an important dynamic property of Petri nets. Its determination given an unbounded net and initial marking has remained an open problem since 1960s. Due to its extreme difficulty, a great deal of research has been focused on some subclasses of unbounded nets. For arbitrary ones, this work intends to propose a new reachability tree (NRT), which consists of only but all reachable markings from its initial marking. Furthermore, an NRT-based method to decide deadlocks of unbounded nets is presented. An example is provided to show the new results.

关键词： system recovery Petri nets Manufacturing systems Solids Gallium nitride Embedded systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

25th Annual Computational Neuroscience Meeting CNS-2016, Seogwipo City, South Korea, July 2-7, 2016 Abstracts

引用

BMC NEUROSCIENCE 2016年第1期17卷 1-112页

作者： [Anonymous] Computational Neurobiology Laboratory The Salk Institute for Biological Studies San Diego USA UNIC CNRS Gif sur Yvette France The European Institute for Theoretical Neuroscience (EITN) Paris France ATR Computational Neuroscience Laboratories Kyoto Japan Krembil Research Institute University Health Network Toronto Canada Department of Physiology University of Toronto Toronto Canada Department of Medicine (Neurology) University of Toronto Toronto Canada Department of Physics University of New Hampshire Durham USA Department of Neurophysiology Nencki Institute of Experimental Biology Warsaw Poland Department of Theory Wigner Research Centre for Physics of the Hungarian Academy of Sciences Budapest Hungary Department of Mathematical Sciences KAIST Daejoen Republic of Korea Department of Mathematics University of Houston Houston USA Department of Biochemistry & Cell Biology and Institute of Biosciences and Bioengineering Rice University Houston USA Department of Biology and Biochemistry University of Houston Houston USA Grupo de Neurocomputación Biológica Dpto. de Ingeniería Informática Escuela Politécnica Superior Universidad Autónoma de Madrid Madrid Spain Department of Biological Sciences University of Southern California Los Angeles USA Center for Neuroscience Korea Institute of Science and Technology Seoul South Korea Department of Neurology Albert Einstein College of Medicine Bronx USA Center for Neuroscience KIST Seoul South Korea Department of Neuroscience University of Science and Technology Daejon South Korea Systems Neuroscience Group QIMR Berghofer Medical Research Institute Herston Australia Department of Psychology Yonsei University Seoul South Korea Department of Psychiatry Kyung Hee University Hospital at Gangdong Seoul South Korea Department of Psychiatry Veterans Administration Boston Healthcare System and Harvard Medical School Brockton USA Department of Electrical and Electronic Engineering The University of Melbourne Parkvil

A1 Functional advantages of cell-type heterogeneity in neural circuits Tatyana O. Sharpee A2 Mesoscopic modeling of propagating waves in visual cortex Alain Destexhe A3 Dynamics and biomarkers of mental disorders Mitsuo Kawato F1 Precise recruitment of spiking output at theta frequencies requires dendritic h-channels in multi-compartment models of oriens-lacunosum/moleculare hippocampal interneurons Vladislav Sekulić, Frances K. Skinner F2 Kernel methods in reconstruction of current sources from extracellular potentials for single cells and the whole brains Daniel K. Wójcik, Chaitanya Chintaluri, Dorottya Cserpán, Zoltán Somogyvári F3 The synchronized periods depend on intracellular transcriptional repression mechanisms in circadian clocks. Jae Kyoung Kim, Zachary P. Kilpatrick, Matthew R. Bennett, Kresimir Josić O1 Assessing irregularity and coordination of spiking-bursting rhythms in central pattern generators Irene Elices, David Arroyo, Rafael Levi, Francisco B. Rodriguez, Pablo Varona O2 Regulation of top-down processing by cortically-projecting parvalbumin positive neurons in basal forebrain Eunjin Hwang, Bowon Kim, Hio-Been Han, Tae Kim, James T. McKenna, Ritchie E. Brown, Robert W. McCarley, Jee Hyun Choi O3 Modeling auditory stream segregation, build-up and bistability James Rankin, Pamela Osborn Popp, John Rinzel O4 Strong competition between tonotopic neural ensembles explains pitch-related dynamics of auditory cortex evoked fields Alejandro Tabas, André Rupp, Emili Balaguer-Ballester O5 A simple model of retinal response to multi-electrode stimulation Matias I. Maturana, David B. Grayden, Shaun L. Cloherty, Tatiana Kameneva, Michael R. Ibbotson, Hamish Meffin O6 Noise correlations in V4 area correlate with behavioral performance in visual discrimination task Veronika Koren, Timm Lochmann, Valentin Dragoi, Klaus Obermayer O7 Input-location dependent gain modulation in cerebellar nucleus neurons Maria Psarrou, Maria Schilstra, Neil Davey, Benjamin Torben-Ni

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Test and repair flow for shared BISR in asynchronous multi-processors

Test and repair flow for shared BISR in asynchronous multi-p...

引用

20th IEEE International Symposium on Asynchronous Circuits and systems, ASYNC 2014

作者： Wang, Gang Wang, Xu Chen, Xinke Xue, Shuangbai Key Laboratory of Computer System and Architecture Chinese Academy of Sciences Beijing 100190 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Loongson Technology Corporation Limited Beijing 100190 China Shandong Eway Information and Technology Co. Ltd China

ISBN: (纸本)9781479937899

We present a hierarchical test and repair flow for shared BISR (Built-In Self-Repair) in asynchronous multi-processors. The flow partitions the memories local to a processor in groups and treats the groups as a whole when doing the repair. The flow runs automatically with few interventions except at the beginning stage. It can be used effectively for practical industrial test and repair. Its test time is as good as equivalent to that of parallel BISR, while its test power is substantially lower, about 40% that of parallel repair. It also has a superior repair rate, about 11-12% better compared to sequential and parallel BISR. © 2014 IEEE.

关键词： Repair

来源：评论

学校读者我要写书评

暂无评论

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.

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：