Performance modeling,real-time dispatching and simulation of wafer fabrication systems using timed extended object-oriented Petri nets

Semiconductor wafer fabrication system (SWFS) is the most complex and capital-intensive phase in the entire semiconductor manufacturing cycle. With characteristics of re-entrant processing routes, equipment uncertainty, product diversity and improving technologies, great challenges are presented in SWFS’s modeling, scheduling and simulation. To implement efficient production control, this paper provides a timed extended object-oriented Petri nets (TEOPNs) approach to performance modeling, real-timed dispatching and simulation of SWFSs. The TEOPNs models are constructed in a hierarchy to accord with the real-world SWFS’s organization, and a new type of signal place is added into the TEOPNs to respond the dynamic states of all processing facilities. A novel autonomy and coordination-based real-time dispatching mechanism (A&C-RDM) is developed in this paper, which executes under the support of the TEOPNs-based hybrid real-time dispatching control system (HRDCS). Owning to the ability of gathering dynamic real-time information of all production facilities and WIP products, the HRDCS can make adaptive dispatching decisions according to the local and global real-time processing status. Two sets of key elements of real-time dispatching, i.e. the state thresholds and dispatching rules, are defined in the HRDCS so that the A&C-RDM can integrate different types of dispatching rules. A set of simulation experiments prove the efficiency of the proposed modeling and dispatching algorithm. In summary, the proposed TEOPNs, HRDCS and A&C-RDM form the cornerstones of a real-time dispatching simulation prototype of SWFS, and the work described in this paper carries out an advanced integrated “modeling–dispatching–simulation” methodology.     

基于VQ和LBG的移动AdHoc网络中分簇算法

应用信息论与数据压缩中的矢量量化理论和LBG算法,在簇和Voronoi胞腔、簇首和码矢、节点和矢量之间建立起——对应的关系,把分簇的过程转换成二维矢量量化中胞腔的分裂过程。设计一个以簇结构稳定性高和负载均衡度好为目标的移动自组网分簇算法,仿真结果显示,分簇算法能够迅速地进行分簇,并且簇的结构具有较高的稳定性。     

混合式P2P系统中基于缓存的多项查询方法研究

首先从混合式P2P网络拓扑结构出发,结合DHT思想,提出了基于DHT的层次化P2P网络模型.其次根据在文档集巨大的情况下,用户提交的查询不可能"面面俱到",实际用来回答查询的文档仅仅是文档集中很小的一部分这一思想,在层次化P2P模型的超级节点中建立了分布式缓存,运用分布式索引与缓存技术,提出一种新的方法来解决多项查询问题.即由多项查询中的某个关键字key,根据hash函数定位到负责该key的超级节点,查询该节点上的分布式索引得到缓存具体存储位置,最终将结果返回给用户,如若缓存中没有所要查询的内容,则广播该查询,同时根据系统中的历史广播查询信息来计算某个待选缓存项的利益值,利益最大的待选项加入缓存.一般针对多项查询的泛洪算法往往会造成巨大的网络信息量,提出的方法牺牲了超级节点上一小部分的存储力,缓解了多项查询造成的网络拥挤现象.同时,基于DHT的层次化P2P模型也具有很好的稳定性,不会因为大量节点的动态加入或者退出而无法进行多项查询.     

Finite-time weighted average consensus with respect to a monotonic function and its application

The consensus state is an important and fundamental quantity for consensus problems of multi-agent systems, which indicates where all the dynamical agents reach. In this paper, weighted average consensus with respect to a monotonic function, which means that the trajectories of the monotonic function along the state of each agent reach the weighted average of their initial values, is studied for a group of kinematic agents with time-varying topology. By constructing a continuous nonlinear distributed protocol, such a consensus problem can be solved in finite time even though the time-varying topology involves unconnected graphs. Then the distributed protocol is employed to compute the maximum-likelihood estimation of unknown parameters over sensor networks. Compared with the existing results, the estimate scheme proposed here may reduce the costs of data communication, storage memory, book-keeping and computational overheads.     

Sweeping Points

Given a set of points in the plane, and a sweep-line as a tool, what is best way to move the points to a target point using a sequence of sweeps? In a sweep, the sweep-line is placed at a start position somewhere in the plane, then moved orthogonally and continuously to another parallel end position, and then lifted from the plane. The cost of a sequence of sweeps is the total length of the sweeps. Another parameter of interest is the number of sweeps. Four variants are discussed, depending on whether the target is a hole or a pile, and whether the target is specified or freely selected by the algorithm. Here we present a ratio 4/π≈1.27 approximation algorithm in the length measure, which performs at most four sweeps. We also prove that, for the two constrained variants, there are sets of n points for which any sequence of minimum cost requires 3n/2?O(1) sweeps.     

OMT在企业物流分析中的应用

文章介绍了面向对象的模型化技术（ＯＭＴ）的基本概念,分析了它的实现过程,即对象模型、动态模型、和过程模型的建立,并以一个具体的实例说明其在企业物流分析中的应用。     

一种简化的人体步行神经网络模型

本文针对复杂的人体步行的神经 -肌肉 -骨胳系统模型 ,分析了步行中的主要关系 ,对神经网络模型作了较大的简化和修改 ,提出了一个简单的神经网络模型 .该模型在步行状态、神经耦合、感觉信号反馈等方面都作了简化 .计算机仿真表明 ,该模型能产生稳定的步行运动     

人尿中活性物质的开发

本文叙述了近年来人尿中活性物质的开发状况,列举了从人尿中提取的11种生物药品及其应用,并提出今后发展的方向。