具有完整性的状态反馈控制

本文基于矩阵方程解，提出了一种开环稳定系统反馈的设计方法，所设计的系统对任意传感器失效具有完整性。     

Florida DOT Project-Level Bridge Management Models

The Florida Department of Transportation (FDOT) is in the process of implementing Pontis, a Bridge Management System, to provide decision support to engineers in the headquarters and district offices as they make routine policy, programming, and budgeting decisions regarding the preservation and improvement of the state’s bridges. As part of this effort, an ongoing research program is underway to adapt the system to FDOT needs as well as to advance the state of the art in several areas important to the Department. Most of the research results are organized around a new project-level decision support framework that complements and builds on Pontis’ existing network-level analysis. Specific new models include accident risk and user cost due to roadway width and alignment deficiencies; user cost of load capacity and vertical clearance restrictions, and moveable bridge openings; project-level prediction models for bridge element condition and costs; and prediction of economics of scale and scoping possibilities. The new models are built into a highly graphical spreadsheet model for decision support use.     

DESIGN AND IMPLEMENTATION OF STATE OBSERVERS IN REACTIVE DISTILLATION

This study demonstrates that state observers can be developed and applied to infer the composition profiles of reactive distillation columns from noise-contaminated temperature measurements. The design and implementation of a Kalman filter (KF) and a Luenberger observer (LO) are carried out, and their performances are quantitatively assessed. The reliability, accuracy, and robustness of the two designs method are examined and compared quantitatively. The design and implementation of a Luenberger observer are simpler and easier to carry out than those of a Kalman filter. On the other hand, a Kalman filter is found to be more robust to a noisy measurements, erroneous initial estimates, and model uncertainties. A Luenberger observer could be used for composition estimation of reactive distillation when an ideal model of the system can reasonably approximate the real system; otherwise, a Kalman filter is recommended to be applied in more practical situations.     

Analysis of the Datagram Congestion Control Protocol’s connection management procedures using the sweep-line method

State space explosion is a key problem in the analysis of finite state systems. The sweep-line method is a state exploration method which uses a notion of progress to allow states to be deleted from memory when they are no longer required. This reduces the peak number of states that need to be stored, while still exploring the full state space. The technique shows promise but has never achieved reductions greater than about a factor of 10 in the number of states stored in memory for industrially relevant examples. This paper discusses sweep-line analysis of the connection management procedures of a new Internet standard, the Datagram Congestion Control Protocol (DCCP). As the intuitive approaches to sweep-line analysis are not effective, we introduce new variables to track progress. This creates further state explosion. However, when used with the sweep-line, the peak number of states is reduced by over two orders of magnitude compared with the original. Importantly, this allows DCCP to be analysed for larger parameter values. Somsak Vanit-Anunchai was partially supported by an Australian Research Council Discovery Grant (DP0559927) and Suranaree University of Technology. Guy Edward Gallasch was supported by an Australian Research Council Discovery Grant (DP0559927).     

部分预应力砼构件按两类极限状态的直接设计

本文提出了部分预应力砼构件基于两类极限状态直接控制的设计方法,并给出了具体的设计公式和设计步骤。同时,还对预应力砼超静定结构中的部分预应力砼构件的设计方法进行了说明。本文方法基本属一次性设计且具有较为经济的特点。     

Unified equation of state based on the lattice fluid theory for phase equilibria of complex mixtures part I. Molecular thermodynamic framework

Consistent calculation of fugacities of fluid mixtures remains as one of the most important subjects in contemporary molecular thermodynamics. In practice, equations of state (EOSs) and g^E-models have been used. However, most EOSs are erroneous for condensed phases at high densities and g^E-models are inapplicable for pressuresensitive systems. Recently to remedy the shortcomings in both approaches, there has been a surge of new g^E-EOS mixing rules. By equating any set of EOS and g^E-models, the limitations in both approaches could be resolved significantly. However, the self-consistency in the underlying concept of those mixing rules remains controversial. During the last several years, the present authors proposed a new lattice-fluid EOS and its simplification relevant to phase equilibrium calculations. Without employing any g^E-EOS mixing rule and with only two parameters for a pure component and one adjustable interaction energy parameter for a binary mixture, results obtained to date demonstrated that the EOSs are quantitatively applicable to a great variety of phase equilibrium properties of mixtures, especially, for complex and/or macromolecular systems. In the present article we summarize the EOSs and extended the applications to liquid-liquid Equilibria. In part I, we discussed briefly the molecular thermodynamic aspects of general derivation of the EOS and a brief discussion of applying the EOSs to pure fluids while the illustrative application to various real mixture systems is discussed in part II.     

300MW机组高压加热器结构特点

简要介绍了哈锅300MW机组高压加热器发展概况及给水入口管端、过热蒸气冷却段出口部、疏水冷却段入口部、上级疏水入口等部件的结构特点。     

POWER OPTIMIZATION OF FINITE STATE MACHINE BASED ON GENETIC ALGORITHM

Using state assignment to minimize power dissipation and area for finite state machines is computationally hard.Most of published results show that the reduction of switching activity often trades with area penalty.In this paper,a new approach is proposed.Experimental results show a significant reduction of switching activity without area penalty compared with previous publications.     

Obtaining shorter regular expressions from finite-state automata

We consider the use of state elimination to construct shorter regular expressions from finite-state automata (FAs). Although state elimination is an intuitive method for computing regular expressions from FAs, the resulting regular expressions are often very long and complicated. We examine the minimization of FAs to obtain shorter expressions first. Then, we introduce vertical chopping based on bridge states and horizontal chopping based on the structural properties of given FAs. We prove that we should not eliminate bridge states until we eliminate all non-bridge states to obtain shorter regular expressions. In addition, we suggest heuristics for state elimination that leads to shorter regular expressions based on vertical chopping and horizontal chopping.