A hybrid data-fusion system using modal data and probabilistic neural network for damage detection

This paper addresses a novel hybrid data-fusion system for damage detection by integrating the data fusion technique, probabilistic neural network (PNN) models and measured modal data. The hybrid system proposed consists of three models, i.e. a feature-level fusion model, a decision-level fusion model and a single PNN classifier model without data fusion. Underlying this system is the idea that we can choose any of these models for damage detection under different circumstances, i.e. the feature-level model is preferable to other models when enormous data are made available through multi-sensors, whereas the confidence level for each of multi-sensors must be determined (as a prerequisite) before the adoption of the decision-level model, and lastly, the single model is applicable only when data collected is somehow limited as in the cases when few sensors have been installed or are known to be functioning properly. The hybrid system is suitable for damage detection and identification of a complex structure, especially when a huge volume of measured data, often with uncertainties, are involved, such as the data available from a large-scale structural health monitoring system. The numerical simulations conducted by applying the proposed system to detect both single- and multi-damage patterns of a 7-storey steel frame show that the hybrid data-fusion system cannot only reliably identify damage with different noise levels, but also have excellent anti-noise capability and robustness.     

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.     

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.     

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

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

上海地铁列车控制总线系统的研究

对上海市地铁列车中的三种不同车型的微机控制系统的总线进行分析与研究,并针对近年总线通信中出现的问题,提出改进方法。     

用于高速列车移动网络的资源分配实时算法

误码率高、频繁中断的高速列车移动场景宜采用多宿主容迟网络。但其资源分配计算复杂,实时性较差。基于效用差分法设计初始化过程资源分配算法,以保证过程中每一步的效用单调不减,算法时间复杂度降至O(n)。     

A method for observing the three-dimensional morphologies of inclusions in steel

A method for observing the three-dimensional morphologies of inclusions by deeply eroding a steel sample with a kind of organic solution composed of bromine water,acetone,and HC1 (volume ratio,45∶45∶10...     

Robust partial pole assignment problem for high order control systems

In this paper, we consider the partial pole assignment problem (PPAP) for high order control systems. It is shown that solving the PPAP is essentially solving a pole assignment for a linear system of a much lower order, and the robust PPAP is then concerning the robust pole assignment problem for this linear system. Based on this theory, a rather simple algorithm for solving the robust PPAP is proposed, and numerical examples show that this algorithm does lead to comparable results with earlier algorithms, but at much lower computational cost.