Plant zero structure and further order reduction of a singular H∞ controller

A new class of reduced‐order controllers is obtained for the H_∞ problem. The reduced‐order controller does not compromise the performance attained by the full‐order controller. Algorithms for deriving reduced‐order H_∞ controllers are presented in both continuous and discrete time. The reduction in order is related to unstable transmission zeros of the subsystem from disturbance inputs to measurement outputs. In the case where the subsystem has no infinite zeros, the resulting order of the H_∞ controller is lower than that of the existing reduced‐order H_∞ controller designs which are based on reduced‐order observer design. Furthermore, the mechanism of the controller order reduction is analysed on the basis of the two‐Riccati equation approach. The structure of the reduced‐order H_∞ controller is investigated. Copyright © 2002 John Wiley & Sons, Ltd.     

Design of a memory‐based prefilter supplementing a robust PID control system

For systems with uncertainties, lots of PID parameter tuning methods have been proposed from the view point of the robust stability theory. However, the control performance becomes conservative using robust PID controllers. In this paper, a new two‐degree‐of‐freedom (2DOF) controller, which can improve the tracking properties, is proposed for nonlinear systems. According to the proposed method, the prefilter is designed as the PD compensator whose control parameters are tuned by the idea of a memory‐based modeling (MBM) method. Since the MBM method is a type of local modeling methods for nonlinear systems, PD parameters can be tuned adequately in an online manner corresponding to nonlinear properties. Finally, the effectiveness of the newly proposed control scheme is numerically evaluated on a simulation example. Copyright © 2008 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

3D block-based medial axis transform and chessboard distance transform based on dominance

Traditionally, the block-based medial axis transform (BB-MAT) and the chessboard distance transform (CDT) were usually viewed as two completely different image computation problems, especially for three dimensional (3D) space. In fact, there exist some equivalent properties between them. The relationship between both of them is first derived and proved in this paper. One of the significant properties is that CDT for 3D binary image V is equal to BB-MAT for image V' where it denotes the inverse image of V. In a parallel algorithm, a cost is defined as the product of the time complexity and the number of processors used. The main contribution of this work is to reduce the costs of 3D BB-MAT and 3D CDT problems proposed by Wang [65]. Based on the reverse-dominance technique which is redefined from dominance concept, we achieve the computation of the 3D CDT problem by implementing the 3D BB-MAT algorithm first. For a 3D binary image of size N³, our parallel algorithm can be run in O(logN) time using N³ processors on the concurrent read exclusive write (CREW) parallel random access machine (PRAM) model to solve both 3D BB-MAT and 3D CDT problems, respectively. The presented results for the cost are reduced in comparison with those of Wang's. To the best of our knowledge, this work is the lowest costs for the 3D BB-MAT and 3D CDT algorithms known. In parallel algorithms, the running time can be divided into computation time and communication time. The experimental results of the running, communication and computation times for the different problem sizes are implemented in an HP Superdome with SMP/CC-NUMA (symmetric multiprocessor/cache coherent non-uniform memory access) architecture. We conclude that the parallel computer (i.e., SMP/CC-NUMA architecture or cluster system) is more suitable for solving problems with a large amount of input size.     

A statistical evaluation of the free energy of Fe-base ternary ordering alloys

The free energy of the Fe-base ternary ordering alloys whereB2 andD0₃ ordered structures are formed is evaluated. The statistical theory is employed using a pairwise interaction approximation taking into account not only the atomic interaction but also the magnetic interaction, based upon the Bragg-Williams-Gorsky model. The application of this model on Fe-Si-Co ordering alloys are demonstrated. The propriety of the calculation results are performed by comparing the experimental results. The influences of the magnetic energy to the stability of ordered structures are also demonstrated.     

Probabilistic enhancement of approximate indexing in metric spaces

Some approximate indexing schemes have been recently proposed in metric spaces which sort the objects in the database according to pseudo-scores. It is known that (1) some of them provide a very good trade-off between response time and accuracy, and (2) probability-based pseudo-scores can provide an optimal trade-off in range queries if the probabilities are correctly estimated. Based on these facts, we propose a probabilistic enhancement scheme which can be applied to any pseudo-score based scheme. Our scheme computes probability-based pseudo-scores using pseudo-scores obtained from a pseudo-score based scheme. In order to estimate the probability-based pseudo-scores, we use the object-specific parameters in logistic regression and learn the parameters using MAP (Maximum a Posteriori) estimation and the empirical Bayes method. We also propose a technique which speeds up learning the parameters using pseudo-scores. We applied our scheme to the two state-of-the-art schemes: the standard pivot-based scheme and the permutation-based scheme, and evaluated them using various kinds of datasets from the Metric Space Library. The results showed that our scheme outperformed the conventional schemes, with regard to both the number of distance computations and the CPU time, in all the datasets.     

Bottom-up pyramid cellular acceptors with three-dimensional layers

In 1997, C.R. Dyer and A. Rosenfeld introduced an acceptor on a two-dimensional pattern (or tape), called the pyramid cellular acceptor, and demonstrated that many useful recognition tasks are executed by pyramid cellular acceptors in time proportional to the logarithm of the diameter of the input. They also introduced a bottom-up pyramid cellular acceptor which is a restricted version of the pyramid cellular acceptor, and proposed some interesting open problems of the bottom-up pyramid cellular acceptors. On the other hand, we think that the study of threedimensional automata has been meaningful as the computational model of three-dimensional information processing such as computer vision, robotics, and so forth. In this paper, we investigate about bottom-up pyramid cellular acceptors with three-dimensional layers, and show their some accepting powers. This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008     

Nanopillar array chip integrated with on-line stacking for fast DNA separation with high sensitivity and high resolution

Recent developments of nanofabrication techniques have created a trend switching from randomly ordered polymeric matrices, such as gel, to highly ordered sieving nanostructures in the separation of biomolecules. These nanostructures have enormous potential for fast separation of biomolecules, while nanostructure-based separation techniques suffer from critical scaling problems; they are efficient in handling less than nanoliter amounts of sample fluids, but most biomolecule samples are available in a liquid volume that is over several microliter, leading to a reduction in sensitivity and resolution. In this study, we developed a nanopillar array chip integrated with an easy and rapid on-line stacking method and achieved fast DNA separation with high sensitivity and high resolution. The developed on-line stacking method is based on the balance of two forces driven by electric fields: electroosmotic flow (EOF) and electrophoresis. The EOF mobility from the microchannel to the nanopillar-channel is drastically decreased, while, on the other hand, electrophoresis has constant mobilities in the whole length of the channels. The on-line stacking was realized at the well-balanced position of the two forces, and the on-line stacking using the nanopillar array chip can also be achieved within 10 s by just applying electric voltages without any other special reagents and materials. After applying on-line stacking using the nanopillar array chip, the relative fluorescence intensity increased 1,000-fold, and the resolution was twice as good as that without on-line stacking.     

Effects of 4He impurities on 3He nuclear spin-lattice relaxation in hcp solid 3He

Nuclear spin-lattice relaxation properties of hcp solid ³He with ⁴He impurities have been studied. At temperatures below the exchange plateau region, three kinds of relaxation time were observed. To analyze the data, a phenomenological four-bath model was developed, the four baths being the Zeeman bath, the phonon bath, an X-bath, and a Y-bath. The X-bath consists of the exchange bath and a part of the ⁴He-⁴He elastic interaction bath. The Y-bath is the main part of the elastic interaction bath. We measured the concentration dependence of the energy constants of all the baths, as well as the temperature and concentration dependences of the three kinds of relaxation time. The relaxation behavior corresponding to the process between the X-bath and the Y-bath could not be expressed by a single exponential function of time and the relaxation rate was strongly dependent on the concentration. This process may be related to the internal thermal equilibrium process within the elastic interaction bath. The impurity-dependent relaxation time between the X-bath and the phonon bath had a temperature dependence of T ^–n with n = 7.4±0.3.