Robust ℋ︁∞ PID control for multivariable networked control systems with disturbance/noise attenuation

In this paper, we study the design problem of PID controllers for networked control systems (NCSs) with polyhedral uncertainties. The load disturbance and measurement noise are both taken into account in the modeling to better reflect the practical scenario. By using a novel technique, the design problem of PID controllers is converted into a design problem of output feedback controllers. Our goal of this paper is two‐fold: (1) To design the robust PID tracking controllers for practical models; (2) To develop the robust ??_∞ PID control such that load and reference disturbances can be attenuated with a prescribed level. Sufficient conditions are derived by employing advanced techniques for achieving delay dependence. The proposed controller can be readily designed based on iterative suboptimal algorithms. Finally, four examples are presented to show the effectiveness of the proposed methods. Copyright © 2011 John Wiley & Sons, Ltd.     

基于多Agent的协同制造平台的研究与设计

随着企业间的集成与协作越来越紧密,知识也越来越高度密集,本文基于多Agent技术,提出一种支持以知识为基础的协同制造开发平台——基于多Agent的可伸缩的多智能协同制造平台。详细设计了多Agent协同开发平台的体系结构、协作框架,以及多agent系统基于本体的通信机制。该平台凭借包装服务和代理商提供的通信能力,通过有效地支持制造业知识的表示、获取、检索和重利用,不仅有利于多学科的个体和团队的组织和协作,而且提出的基于本体库的广义知识库能使设计人员有效地、不受限制地交换信息和知识。     

Fast full‐color reflective display via photoluminescent enhancement

Reflective displays are advantageous in applications requiring low power or daylight readability. However, there are no low‐cost reflective technologies capable of displaying bright colors. By employing photoluminescence to more efficiently use ambient light, we created a prototype display that provides bright, full color in a simple, low‐cost architecture. This prototype includes a novel electrokinetic shutter, a layer that incorporates patterned luminescent red, green, and blue sub‐pixel elements, and a novel optical out‐coupling scheme. The luminescent elements convert otherwise‐wasted portions of the incident spectrum to light in the desired color band, resulting in improved color saturation and lightness. This prototype provides a color gamut that is superior to competing reflective display technologies that utilize color filters in single‐layer side‐by‐side sub‐pixel architectures. The current prototype is capable of switching in <0.5 s; future displays based on an alternative electro‐optic shutter technology should achieve video rate operation. A transflective version of this technology has also been prototyped. The transflective version utilizes its backlight with a power efficiency that is at least three times that of a conventional liquid crystal display. These photoluminescence‐based technologies enable a host of applications ranging from low‐power mobile products and retail pricing signage to daylight readable signage for outdoor advertising segments.     

Morse set classification and hierarchical refinement using Conley index

Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is not unique, and its granularity directly impacts its computational cost. In this paper, we propose an automatic refinement scheme to construct the Morse Connection Graph (MCG) of a given vector field in a hierarchical fashion. Our framework allows a Morse set to be refined through a local update of the flow combinatorialization graph, as well as the connection regions between Morse sets. The computation is fast because the most expensive computation is concentrated on a small portion of the domain. Furthermore, the present work allows the generation of a topologically consistent hierarchy of MCGs, which cannot be obtained using a global method. The classification of the extracted Morse sets is a crucial step for the construction of the MCG, for which the Poincare′ index is inadequate. We make use of an upper bound for the Conley index, provided by the Betti numbers of an index pair for a translation along the flow, to classify the Morse sets. This upper bound is sufficiently accurate for Morse set classification and provides supportive information for the automatic refinement process. An improved visualization technique for MCG is developed to incorporate the Conley indices. Finally, we apply the proposed techniques to a number of synthetic and realworld simulation data to demonstrate their utility.     

A deformable surface model for real-time water drop animation

A water drop behaves differently from a large water body because of its strong viscosity and surface tension under the small scale. Surface tension causes the motion of a water drop to be largely determined by its boundary surface. Meanwhile, viscosity makes the interior of a water drop less relevant to its motion, as the smooth velocity field can be well approximated by an interpolation of the velocity on the boundary. Consequently, we propose a fast deformable surface model to realistically animate water drops and their flowing behaviors on solid surfaces. Our system efficiently simulates water drop motions in a Lagrangian fashion, by reducing 3D fluid dynamics over the whole liquid volume to a deformable surface model. In each time step, the model uses an implicit mean curvature flow operator to produce surface tension effects, a contact angle operator to change droplet shapes on solid surfaces, and a set of mesh connectivity updates to handle topological changes and improve mesh quality over time. Our numerical experiments demonstrate a variety of physically plausible water drop phenomena at a real-time rate, including capillary waves when water drops collide, pinch-off of water jets, and droplets flowing over solid materials. The whole system performs orders-of-magnitude faster than existing simulation approaches that generate comparable water drop effects.     

Simple culling methods for continuous collision detection of deforming triangles

We present a simple and efficient approach for continuous collision detection of deforming triangles based on conservative advancement. The efficiency of our approach is due to a sequence of simple collision-free conditions for deforming triangles. In our experiment, we show that our CCD algorithm achieves 2-30 times performance improvement over existing algorithms for triangle primitives.     

Integrating local action elements for action analysis

In this paper, we propose a framework for human action analysis from video footage. A video action sequence in our perspective is a dynamic structure of sparse local spatial–temporal patches termed action elements, so the problems of action analysis in video are carried out here based on the set of local characteristics as well as global shape of a prescribed action. We first detect a set of action elements that are the most compact entities of an action, then we extend the idea of Implicit Shape Model to space time, in order to properly integrate the spatial and temporal properties of these action elements. In particular, we consider two different recipes to construct action elements: one is to use a Sparse Bayesian Feature Classifier to choose action elements from all detected Spatial Temporal Interest Points, and is termed discriminative action elements. The other one detects affine invariant local features from the holistic Motion History Images, and picks up action elements according to their compactness scores, and is called generative action elements. Action elements detected from either way are then used to construct a voting space based on their local feature representations as well as their global configuration constraints. Our approach is evaluated in the two main contexts of current human action analysis challenges, action retrieval and action classification. Comprehensive experimental results show that our proposed framework marginally outperforms all existing state-of-the-arts techniques on a range of different datasets.     

Retraction of “Using ergonomic digital human modeling in evaluation of workplace design and prevention of workrelated musculoskeletal disorders onboard small fishing vessel”

The following article from Human Factors and Ergonomics in Manufacturing & Service Industries, “Using ergonomic digital human modeling in evaluation of workplace design and prevention of workrelated musculoskeletal disorders onboard small fishing vessel,” by Enrique Álvarez‐Casado, Bing Zhang, Sonia Tello Sandoval and Mondelo Pedro, published online on October 11, 2011 in Wiley Online Library ( www.onlinelibrary.wiley.com ), has been retracted by agreement between the authors, the journal Editors‐in‐Chief, Waldemar Karwowski and Gavriel Salvendy, and Publisher Wiley Periodicals, Inc. The retraction has been agreed as these articles were mistakenly published after being rejected.     

Extreme learning machine for regression and multiclass classification

Due to the simplicity of their implementations, least square support vector machine (LS-SVM) and proximal support vector machine (PSVM) have been widely used in binary classification applications. The conventional LS-SVM and PSVM cannot be used in regression and multiclass classification applications directly, although variants of LS-SVM and PSVM have been proposed to handle such cases. This paper shows that both LS-SVM and PSVM can be simplified further and a unified learning framework of LS-SVM, PSVM, and other regularization algorithms referred to extreme learning machine (ELM) can be built. ELM works for the "generalized" single-hidden-layer feedforward networks (SLFNs), but the hidden layer (or called feature mapping) in ELM need not be tuned. Such SLFNs include but are not limited to SVM, polynomial network, and the conventional feedforward neural networks. This paper shows the following: 1) ELM provides a unified learning platform with a widespread type of feature mappings and can be applied in regression and multiclass classification applications directly; 2) from the optimization method point of view, ELM has milder optimization constraints compared to LS-SVM and PSVM; 3) in theory, compared to ELM, LS-SVM and PSVM achieve suboptimal solutions and require higher computational complexity; and 4) in theory, ELM can approximate any target continuous function and classify any disjoint regions. As verified by the simulation results, ELM tends to have better scalability and achieve similar (for regression and binary class cases) or much better (for multiclass cases) generalization performance at much faster learning speed (up to thousands times) than traditional SVM and LS-SVM.