Decentralized control design for nonlinear plants: a v-metric approach

In this paper, a new v-metric based approach is proposed to design decentralized controllers for multi-unit nonlinear plants that admit a set of plant decompositions in an operating space. Similar to the gap metric approach in literature, it is shown that the operating space can also be divided into several subregions based on a v-metric indicator, and each of the subregions admits the same controller structure. A comparative case study is presented to display the advantages of proposed approach over the gap metric approach. (C) 2000 Elsevier Science Ltd. All rights reserved.

Heat flow for the Yang-Mills-Higgs field and the Hermitian Yang-Mills-Higgs metric

For a parameter lambda > 0, we study a type of vortex equations, which generalize the well-known Hermitian-Einstein equation, for a connection A and a section phi of a holomorphic vector bundle E over a Kahler manifold X. We establish a global existence of smooth solutions to heat flow for a self-dual Yang-Mills-Higgs field on E. Assuming the lambda -stability of (E, phi), we prove the existence of the Hermitian Yang-Mills-Higgs metric on the holomorphic bundle E by studying the limiting behaviour of the gauge flow.

Fixed point theorems of upper semicontinuous multivalued mappings with applications in hyperconvex metric spaces

In the present paper, we establish two fixed point theorems for upper semicontinuous multivalued mappings in hyperconvex metric spaces and apply these to study coincidence point problems and minimax problems. (C) 2002 Elsevier Science (USA). All rights reserved.

A cognitive complexity metric applied to cognitive development

Two experiments tested predictions from a theory in which processing load depends on relational complexity (RC), the number of variables related in a single decision. Tasks from six domains (transitivity, hierarchical classification, class inclusion, cardinality, relative-clause sentence comprehension, and hypothesis testing) were administered to children aged 3-8 years. Complexity analyses indicated that the domains entailed ternary relations (three variables). Simpler binary-relation (two variables) items were included for each domain. Thus RC was manipulated with other factors tightly controlled. Results indicated that (i) ternary-relation items were more difficult than comparable binary-relation items, (ii) the RC manipulation was sensitive to age-related changes, (iii) ternary relations were processed at a median age of 5 years, (iv) cross-task correlations were positive, with all tasks loading on a single factor (RC), (v) RC factor scores accounted for 80% (88%) of age-related variance in fluid intelligence (compositionality of sets), (vi) binary- and ternary-relation items formed separate complexity classes, and (vii) the RC approach to defining cognitive complexity is applicable to different content domains. (C) 2002 Elsevier Science (USA). All rights reserved.

On continuous selection problems for multivalued mappings with the local intersection property in hyperconvex metric spaces

In the paper we present two continuous selection theorems in hyperconvex metric spaces and apply these to study xed point and coincidence point problems as well as variational inequality problems in hyperconvex metric spaces.

BM+-tree: A hyperplane-based index method for high-dimensional metric spaces

In this paper, we propose a novel high-dimensional index method, the BM+-tree, to support efficient processing of similarity search queries in high-dimensional spaces. The main idea of the proposed index is to improve data partitioning efficiency in a high-dimensional space by using a rotary binary hyperplane, which further partitions a subspace and can also take advantage of the twin node concept used in the M+-tree. Compared with the key dimension concept in the M+-tree, the binary hyperplane is more effective in data filtering. High space utilization is achieved by dynamically performing data reallocation between twin nodes. In addition, a post processing step is used after index building to ensure effective filtration. Experimental results using two types of real data sets illustrate a significantly improved filtering efficiency.