复杂工业过程运行的混合智能优化控制方法

工业过程运行的优化控制的目标是将反应产品在加工过程中的质量、效率、消耗的工艺指标控制在目标值范围内. 由于复杂工业过程的工艺指标难于在线测量且与控制回路输出之间的动态特性具有强非线性、强耦合、难以用精确模型描述、随生产边界条件变化而变化的综合复杂性,因此, 难以采用已有优化控制方法, 运行控制只能采用人工设定的控制方式. 由于人工控制不能及时准确地随运行工况调整设定值, 难以将工艺指标控制在目标值范围内, 甚至造成故障工况.本文提出了根据运行工况实时调整控制回路设定值, 通过控制系统跟踪调整后的设定值, 将工艺指标控制在目标值范围内的过程优化运行的混合智能控制方法. 该方法由控制回路预设定模型、前馈补偿与反馈补偿器、工艺指标预报模型、故障工况诊断和容错控制器组成. 在某选矿厂22台竖炉组成的焙烧过程的应用案例, 证明了所提出方法的有效性.     

A supply network-modelling system for a small- to medium-sized manufacturing company

During the late 1990s and early 2000s, the profile of global manufacturing has experienced many changes. There is anecdotal evidence that many western manufacturing companies have chosen to expand their manufacturing base across geographical boundaries. The common reasons sited for these ventures are to exploit less expensive labour markets, to establish a presence in expanding markets and in response to the threat of new competition. Whilst a global manufacturing base can prove to have many cost and sales benefits, there are also many disadvantages. Logistics operations can often increase in complexity leading to higher reliance on planning and effective interpretation of demand data. In response, systems modelling has remerged as a fertile research area after many years. Many modelling and simulation techniques have been developed, but these have had very limited practical success. The authors have identified that majority of these simulation techniques rely upon a detailed market structure being known, when this is rarely the case. This paper describes the outcome of a research project to develop of a pragmatic set of tools to gather, assess and verify supply chain structure data. A hybrid collection of technologies are utilised to assist these operations and to build a dynamic supply network model.     

Specification of communicating processes: temporal logic versus refusals-based refinement

In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can check whether a program in a process algebra, such as Communicating Sequential Processes (CSP), satisfies a temporal logic specification using a refinement-based model checker, such as FDR. We consider what atomic formulae are appropriate in a temporal logic for specifying communicating processes, in particular where one wants to talk about the availability of events. We then show that, perhaps surprisingly, the standard stable failures model is not adequate for capturing specifications in such a logic: instead the refusal traces model must be used. We formalise the logic by giving it a semantics in this model. We show that the temporal operators eventually and until, and negation, cannot, in general, be tested for via simple refinement checks. For the remaining fragment of the logic, we present a translation into simple refinement checks. Finally, we show that refusal traces equivalence is characterised by a slightly augmented version of that fragment. M. J. Butler     

A test for stability robustness of linear time‐varying systems utilizing the linear time‐invariant ν‐gap metric

A stability robustness test is developed for internally stable, nominal, linear time‐invariant (LTI) feedback systems subject to structured, linear time‐varying uncertainty. There exists (in the literature) a necessary and sufficient structured small gain condition that determines robust stability in such cases. In this paper, the structured small gain theorem is utilized to formulate a (sufficient) stability robustness condition in a scaled LTI ν‐gap metric framework. The scaled LTI ν‐gap metric stability condition is shown to be computable via linear matrix inequality techniques, similar to the structured small gain condition. Apart from a comparison with a generalized robust stability margin as the final part of the stability test, however, the solution algorithm implemented to test the scaled LTI ν‐gap metric stability robustness condition is shown to be independent of knowledge about the controller transfer function (as opposed to the LMI feasibility problem associated with the scaled small gain condition which is dependent on knowledge about the controller). Thus, given a nominal plant and a structured uncertainty set, the stability robustness condition presented in this paper provides a single constraint on a controller (in terms of a large enough generalized robust stability margin) that (sufficiently) guarantees to stabilize all plants in the uncertainty set. Copyright © 2008 John Wiley & Sons, Ltd.     

Low-cycle fatigue of polycrystalline α-iron modified by mutually immiscible silver-ion implantation

Cyclic deformations of annealed pure polycrystalline -iron with and without further mutually immiscible silver-ion implantation (90 keV, 6×10¹⁶ ions cm^–2) were studied in a plastic strain-controlled tension-compression fatigue test (triangular loading waveform, frequency 0.02–0.3 Hz, and plastic strain range 3×10^–3–1.2×10^–2). The obtained plastic strain-life (_p-N _f) curves showed that the iron specimens could survive for a greater number of cycles before failure when implanted. Comparison of the cyclic stress-strain curves suggested that the implanted specimens had maintained a relatively more stable microstructural change than those unimplanted ones which had undergone a violent cyclic hardening during cyclic deformation. This is proposed to be a strong indication that the fatigue ductility has been improved and the cross slip of screw dislocations, which leads to the evolution of the persistent slip bands for fatigue damage, was hindered to some extent after ion implantation.     

Verification and falsification of programs with loops using predicate abstraction

Predicate abstraction is a major abstraction technique for the verification of software. Data is abstracted by means of Boolean variables, which keep track of predicates over the data. In many cases, predicate abstraction suffers from the need for at least one predicate for each iteration of a loop construct in the program. We propose to extract looping counterexamples from the abstract model, and to parametrise the simulation instance in the number of loop iterations. We present a novel technique that speeds up the detection of long counterexamples as well as the verification of programs with loops.     

Facets of the Fully Mixed Nash Equilibrium Conjecture

In this work, we continue the study of the many facets of the Fully Mixed Nash Equilibrium Conjecture, henceforth abbreviated as the FMNE\mathsf{FMNE} Conjecture, in selfish routing for the special case of n identical users over two (identical) parallel links. We introduce a new measure of Social Cost, defined as the expectation of the square of the maximum congestion on a link; we call it Quadratic Maximum Social Cost. A Nash equilibrium is a stable state where no user can improve her (expected) latency by switching her mixed strategy; a worst-case Nash equilibrium is one that maximizes Quadratic Maximum Social Cost. In the fully mixed Nash equilibrium, all mixed strategies achieve full support.     

Linking denotational semantics with operational semantics for web services

Web Services have become more and more important in these years, and BPEL4WS (BPEL) is a de facto standard for the web service composition and orchestration. It contains several distinct features, including the scope-based compensation and fault handling mechanism. The denotational semantics and operational semantics have been explored for BPEL. The two semantic models should be consistent. This paper considers the linking of these two semantics. Our approach is to derive the denotational semantics from operational semantics for BPEL, which aims for the consistency of the two models. Moreover, the derivation can be applied in exploring the program equivalence easily, especially for parallel programs.     

Mining Web navigation patterns with a path traversal graph

Understanding the navigational behaviour of website visitors is a significant factor of success in the emerging business models of electronic commerce and even mobile commerce. However, Web traversal patterns obtained by traditional Web usage mining approaches are ineffective for the content management of websites. They do not provide the big picture of the intentions of the visitors. The Web navigation patterns, termed throughout-surfing patterns (TSPs) as defined in this paper, are a superset of Web traversal patterns that effectively display the trends toward the next visited Web pages in a browsing session. TSPs are more expressive for understanding the purposes of website visitors. In this paper, we first introduce the concept of throughout-surfing patterns and then present an efficient method for mining the patterns. We propose a compact graph structure, termed a path traversal graph, to record information about the navigation paths of website visitors. The graph contains the frequent surfing paths that are required for mining TSPs. In addition, we devised a graph traverse algorithm based on the proposed graph structure to discover the TSPs. The experimental results show the proposed mining method is highly efficient to discover TSPs.     

Knowledge representation and inference techniques to improve the management of gas and oil facilities

This paper describes an experimental work carried out in the framework of an important European project to create and make use of a wide-ranging knowledge base in the gas/oil domain. In the context of this work, “knowledge base” means a collection of formal statement relating, with a negligible loss of information, the inner content (the ‘meaning’) of “complex events” included in two different “storyboards”. These events – originally presented under the form of unstructured natural language information – concern some general activities proper to the management of gas/oil facilities, like recognizing and monitoring gas leakage alarms in a gas processing plant or triggering the different steps needed to activate a gas turbine. To express this sort of information and to set up the knowledge base, the NKRL (Narrative Knowledge Representation Language) formalism has been used. NKRL is a conceptual meta-model and Computer Science environment expressly created to deal, in an ‘intelligent’ and complete way, with complex and content-rich ‘narrative’ data sources. The final knowledge base has been firstly tested in depth using the standard NKRL querying and information retrieval tools. High-level inference procedures have then been used, both “transformation rules” – unsuccessful queries are ‘transformed’ to produce results that are ‘semantically similar’ to those searched for initially – and “hypothesis rules” – information in the knowledge base is automatically aggregated to supply a sort of ‘causal’ explanation of some retrieved events.