Output feedback controller for polytopic systems exploiting the direct searching of the design space

This paper deals with the problem of designing a robust static output feedback controller for polytopic systems. The current research that tackled this problem is mainly based on LMI method, which is conservative by nature. In this paper, a novel approach is proposed, which considers the design space of the controller parameters and iteratively partitions the space to small simplexes. Then, by assessing the stability in each simplex, the solution space for design parameters is directly determined. It has been theoretically proved that, if there exists a feasible solution in the design space, the algorithm can find it. To validate the result of the proposed approach, comparative simulation examples are given to illustrate the performance of the design methodology as compared to those of previous approaches.     

Recent progress of green sorbents-based technologies for low concentration CO2 capture

The increased concentration of CO₂ due to continuous breathing and no discharge of human beings in the manned closed space, like spacecraft and submarines, can be a threat to health and safety. Effective removal of low concentration CO₂ from the manned closed space is essential to meet the requirements of long-term space or deep-sea exploration, which is an international frontier and trend. Ionic liquids (ILs), as a widespread and green solvent, already showed its excellent performance on CO₂ capture and absorption, indicating its potential application in low concentration CO₂ capture. In this review, we first summarized the current methods and strategies for direct capture from low concentration CO₂ in both the atmosphere and manned closed spaces. Then, the multi-scale simulation methods of CO₂ capture by ionic liquids are described in detail, including screening ionic liquids by COSMO-RS methods, capture mechanism by density functional theory and molecular dynamics simulation, and absorption process by computational fluid dynamics simulation. Lastly, some typical IL-based green technologies for low concentration CO₂ capture, such as functionalized ILs, co-solvent systems with ILs, and supported materials based on ILs, are introduced, and analyzed the subtle possibility in manned closed spaces. Finally, we look forward to the technology and development of low concentration CO₂ capture, which can meet the needs of human survival in closed space and proposed that supported materials with ionic liquids have great advantages and infinite possibilities in the vital area.     

带参数的一阶脉冲微分方程边值问题

利用上下解和单调迭代法。讨论了带参数的一阶脉冲微分方程。获得了单边Lipschitz条件下这类方程边值问题的解的存在性。     

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd.     

Least-squares integration of one-dimensional codistributions with application to approximate feedback linearization

We study the problem of approximating one-dimensional nonintegrable codistributions by integrable ones and apply the resulting approximations to approximate feedback linearization of single-input systems. The approach derived in this paper allows a linearizable nonlinear system to be found that is close to the given system in a least-squares (L ₂) sense. A linearly controllable single-input affine nonlinear system is feedback linearizable if and only if its characteristic distribution is involutive (hence integrable) or, equivalently, any characteristic one-form (a one-form that annihilates the characteristic distribution) is integrable. We study the problem of finding (least-squares approximate) integrating factors that make a fixed characteristic one-form close to being exact in anL ₂ sense. A given one-form can be decomposed into exact and inexact parts using the Hodge decomposition. We derive an upper bound on the size of the inexact part of a scaled characteristic one-form and show that a least-squares integrating factor provides the minimum value for this upper bound. We also consider higher-order approximate integrating factors that scale a nonintegrable one-form in a way that the scaled form is closer to being integrable inL ₂ together with some derivatives and derive similar bounds for the inexact part. This allows a linearizable nonlinear system that is close to the given system in a least-squares (L ₂) sense together with some derivatives to be found. The Sobolev embedding techniques allow us to obtain an upper bound on the uniform (L _∞) distance between the nonlinear system and its linearizable approximation. This research was supported in part by NSF under Grant PYI ECS-9396296, by AFOSR under Grant AFOSR F49620-94-1-0183, and by a grant from the Hughes Aircraft Company.     

Daily impact of climate on the pattern of urban family life : Indigenous courtyard houses of Baghdad regions of the hot-dry climates Part I: Daily shifts or daily movements in summer

During the day, there are considerable variations in the climatic factors prevailing in these regions. This is especially so during the 24-hour daily cycle of the long, hot and dry summer (mid-May to midOctober). Such climatic conditions have had a considerable impact on the daily living pattern of family life in the same season, particularly in the urban areas. During the same 24-hour cycle, they have compelled the inhabitants to shift their living activities both vertically in section and horizontally in plan; they do this in pursuit of more acceptable, if not, desirable internal thermal environmental ambience.     

随机度量理论的最近进展及其应用

本文综述了随机度量理论在近十年来的重要进展及其具有代表性的某些应用。     

推广的Kantorovi多项式的L_p保持Lipschitz条件性

本文研究推广的Kantorovi多项式P_n~*(f, x)在L_p[0,1]空间中的保持Lipschitz条件性质。     

What the small Rubik’s cube taught me about data structures, information theory, and randomisation

This article discusses observations made when the state space of the 2 × 2 × 2 Rubik’s cube was constructed with various programs based on various data structures, gives theoretical explanations for the observations, and uses them to develop more memory-efficient data structures. The cube has 3,674,160 reachable states. The fastest program runs in 20 s and uses 11.1 million bytes of memory for the state set structure. It uses a 31-bit representation of the state and also stores the rotation through which each state was first found. Its memory consumption is remarkably small, considering that 3,674,160 × 31 bits is about 14.2 million bytes. Getting below this number was made possible by sharing common parts of states. Obviously, it is not possible to reduce memory consumption without limit. We derive an information-theoretic hard average lower bound of 6.07 million bytes that applies in this setting. We introduce a general-purpose variant of the data structure and end up with 8.9 million bytes and 48 s. We also discuss the performance of BDDs and perfect state packing in this application.