Asymptotic stability and disturbance attenuation properties for a class of networked control systems

In this paper, stability and disturbance attenuation issues for a class of Networked Control Systems (NCSs) under uncertain access delay and packet dropout effects are considered. Our aim is to find conditions on the delay and packet dropout rate, under which the system stability and H∞ disturbance attenuation properties are preserved to a desired level. The basic idea in this paper is to formulate such Networked Control System as a discrete-time switched system. Then the NCSs’ stability and performance problems can be reduced to the corresponding problems for switched systems, which have been studied for decades and for which a number of results are available in the literature. The techniques in this paper are based on recent progress in the discrete-time switched systems and piecewise Lyapunov functions.     

Asymptotic stability and disturbance attenuation properties for a class of networked control systems

In this paper, stability and disturbance attenuation issues for a class of Networked Control Systems (NCSs) under uncertain access delay and packet dropout effects are considered. Our aim is to find conditions on the delay and packet dropout rate, under which the system stability and H∞ disturbance attenuation properties are preserved to a desired level. The basic idea in this paper is to formulate such Networked Control System as a discrete-time switched system. Then the NCSs’ stability and performance problems can be reduced to the corresponding problems for switched systems, which have been studied for decades and for which a number of results are available in the literature. The techniques in this paper are based on recent progress in the discrete-time switched systems and piecewise Lyapunov functions.     

A distributed algorithm for multi-region problem in BEM

The situation of multi-region problem may oftem appear when boundary element method(BEM)is applied in practical problems especially in VLSI-CAD.It is difficult to deal with this problem if traditional methods are used.Particularly. when the problem to be solved contains a lot of materials,the advantages of using BEM such as simplicity,convenience and rapidity will be weakened due to the complexity of solving complex boundary element equation.In this paper a distributed algorithm for multi-region problem in BEM is presented.This algorithm has been implemented in a distributed system consisting of 3 workstations to extract VLSI layout parameters.The results show that the calculation time of this distributed algorithm is less than that of the traditional methods.The results also demonstrate that this algorithm can speed up the computation and has the features of parallelism and high efficiency.     

A metamodeling approach for pattern specification and management

The formal specification of design patterns is central to pattern research and is the foundation of solving various pattern-related problems.In this paper,we propose a metamodeling approach for pattern specification,in which a pattern is modeled as a meta-level class and its participants are meta-level references.Instead of defining a new metamodel,we reuse the Unified Modeling Language(UML)metamodel and incorporate the concepts of Variable and Set into our approach,which are unavailable in the UML but essential for pattern specification.Our approach provides straightforward solutions for pattern-related problems,such as pattern instantiation,evolution,and implementation.By integrating the solutions into a single framework,we can construct a pattern management system,in which patterns can be instantiated,evolved,and implemented in a correct and manageable way.     

New Meta-Heuristic for Combinatorial Optimization Problems: Intersection Based Scaling

Combinatorial optimization problems are found in many application fields such as computer science,engineering and economy. In this paper, a new efficient meta-heuristic, Intersection-Based Scaling (IBS for abbreviation), is proposed and it can be applied to the combinatorial optimization problems. The main idea of IBS is to scale the size of the instance based on the intersection of some local optima, and to simplify the search space by extracting the intersection from the instance, which makes the search more efficient. The combination of IBS with some local search heuristics of different combinatorial optimization problems such as Traveling Salesman Problem (TSP) and Graph Partitioning Problem (GPP) is studied, and comparisons are made with some of the best heuristic algorithms and meta-heuristic algorithms. It is found that it has significantly improved the performance of existing local search heuristics and significantly outperforms the known best algorithms.     

Surface Reconstruction for Cross Sectional Data

In this paper,a new solution to the problem of reconstructing the surface of 3D objects over a set of cross-sectional contours is proposed.An algorithm for single branch contours connection,which is based on the closest local polar angle method,is first presented.Then the branching problems(including non-singular branchin and singular branching)are completely solved by decomposing them into several single-branching problems.Finally,these methods are applied to the reconstruction of the external surface of a complexly shaped object such as the cellular region of human brain.The results show that the presented methods are practical and satisfactory.     

Reliable H-infinity filtering for linear systems with sensor saturation

In this paper, a new reliable H-infinity filter design problem is proposed for a class of continuous-time systems with sensor saturation and failures. Attention is focused on the analysis and synthesis problems of a full order reliable H-infinity filter such that the filtering error dynamics is asymptotically stable with a guaranteed disturbance rejection attenuation level γ. It is shown that the filtering error dynamics obtained from the original system plus the filter can be modeled by a linear system with sector bounded nonlinearity. The design conditions are given in terms of solutions to a set of linear matrix inequalities (LMIs). These conditions are then considered in a convex optimization problem with LMIs constraints in order to design an optimal reliable H-infinity filter. A numerical example is given to illustrate the effectiveness of the proposed results.     

解决证据推理中一类“0绝对化”问题的方法

In fact, evidential reasoning is a kind of commonsensible reasoning, so the reasoning results must be consistent with the basic common senses of human beings. In this paper,regarding to a kind of “0 absolutization” problem in the evidential reasoning, two real examples are given, and the handling method is brought forward. Compared with traditional approaches, this method embodies much more man's decision-making common senses. The "0 absolutization” problems in two examples are solved reasonably, and the results are discussed finally.     

数值稳定的可展网格仿真方法

动态可展曲面是采用哈密尔顿原理的一类新型动态模型。详细论述了这类动态模型的数值计算引擎。大量实验结果表明:(1)光滑和褶皱的可展曲面都可用动态网格模拟;(2)传统的挑战性问题如纸张褶皱仿真和塑性服装建模等都可用动态网格以稳定、快速的方式进行计算。     

多目标遗传算法及其在化工领域的应用

多目标优化在工程优化领域占有较大比重，这些目标之间大多是相互冲突的，常用的方法是将这些目标通过不同的方式转化成单一目标进行求解，然而这样将使一些有用的信息丢失。多目标遗传算法可避免信息丢失，通过优化它给出一组非劣解供决策者根据不同需要进行选择。本文首先介绍了常用的多目标优化方法，然后详细介绍了目前研究较多的多目标遗传算法，着重讨论了多目标优化方法在化学工程领域中的应用，并对多目标遗传算法的发展进行了展望。     

Integrated well pad development scheduling with steam injection control in steam-assisted gravity drainage

In this paper, we study the problem of integrated well pad development scheduling with nonlinear model predictive control based steam injection in steam-assisted gravity drainage (SAGD). The scheduling problem has been modeled as a mixed-integer program to find optimal development sequence and timing of multiple well-pads. Model predictive control problems are solved to find optimal steam injection profile such that the reservoir is under control. The integrated problem is solved using open-loop and closed-loop methods: (1) scheduling problem is only solved at the beginning of project operation, (2) Scheduling problem is solved every year with shrinking horizon implementation, and (3) shrinking horizon implementation of scheduling with reservoir model update based on feedback from control level. Simulation results demonstrate the benefits of closed-loop integrated scheduling and control: the NPV increase is 19%.     

遗传算法在钟表机芯设计中的应用

在钟表机芯设计中，齿轮参数的优化设计是一个组合优化问题，很难用传统优化方法解决.遗传算法是一种基于生物进化原理的启发式搜索方法，近年来，它成功地解决了许多计算难题.使用该算法的难点是如何将具体问题映射成适于该算法的编码以及根据编码进行各种操作.该文对传动系统各齿轮参数序号进行编码，成功地解决了齿轮参数的优化设计问题，也为一般机械设计中传动系统参数的优化提供了经验.通过比较，利用遗传算法得出的参数比用专家系统得出的参数更优.     

Control of vector discrete-event systems. I. The base model

A vector discrete-event system (VDES) is a discrete-event system model in which the system state is represented by a vector with integer components, and state transitions by integer vector addition. The authors investigate such structures from the viewpoint of control theory. The objective is to specialize to VDES the general automation-based control theory of P.J. Ramadge and W.M. Wonham (1987) and W.M. Wonham and P.J. Ramadge (1988). It is shown that within the VDES framework a useful class of control systems can be compactly modeled, and some of the associated control problems of Ramadge and Wonham can be more efficiently solved     

Optimization of Dynamic Hardware Reconfigurations

Recent generations of Field Programmable Gate Arrays (FPGA) allow the dynamic reconfiguration of cells on the chip during run-time. For a given problem consisting of a set of tasks with computation requirements modeled by rectangles of cells, several optimization problems such as finding the array of minimal size to accomplish the tasks within a given time limit are considered. Existing approaches based on ILP formulations to solve these problems as multi-dimensional packing problems turn out not to be applicable for problem sizes of interest. Here, a breakthrough is achieved in solving these problems to optimality by using the new notion of packing classes. It allows a significant reduction of the search space such that problems of the above type may be solved exactly using a special branch-and-bound technique. We validate the usefulness of our method by providing computational results.