A size-insensitive integrity-based fuzzy c-means method for data clustering

Fuzzy c-means (FCM) is one of the most popular techniques for data clustering. Since FCM tends to balance the number of data points in each cluster, centers of smaller clusters are forced to drift to larger adjacent clusters. For datasets with unbalanced clusters, the partition results of FCM are usually unsatisfactory. Cluster size insensitive FCM (csiFCM) dealt with “cluster-size sensitivity” problem by dynamically adjusting the condition value for the membership of each data point based on cluster size after the defuzzification step in each iterative cycle. However, the performance of csiFCM is sensitive to both the initial positions of cluster centers and the “distance” between adjacent clusters. In this paper, we present a cluster size insensitive integrity-based FCM method called siibFCM to improve the deficiency of csiFCM. The siibFCM method can determine the membership contribution of every data point to each individual cluster by considering cluster's integrity, which is a combination of compactness and purity. “Compactness” represents the distribution of data points within a cluster while “purity” represents how far a cluster is away from its adjacent cluster. We tested our siibFCM method and compared with the traditional FCM and csiFCM methods extensively by using artificially generated datasets with different shapes and data distributions, synthetic images, real images, and Escherichia coli dataset. Experimental results showed that the performance of siibFCM is superior to both traditional FCM and csiFCM in terms of the tolerance for “distance” between adjacent clusters and the flexibility of selecting initial cluster centers when dealing with datasets with unbalanced clusters.     

Output-feedback stabilization of an unstable wave equation

We consider the problem of stabilization of a one-dimensional wave equation that contains instability at its free end and control on the opposite end. In contrast to classical collocated “boundary damper” feedbacks for the neutrally stable wave equations with one end satisfying a homogeneous boundary condition, the controllers and the associated observers designed in the paper are more complex due to the open-loop instability of the plant. The controller and observer gains are designed using the method of “backstepping,” which results in explicit formulae for the gain functions. We prove exponential stability and the existence and uniqueness of classical solutions for the closed-loop system. We also derive the explicit compensators in frequency domain. The results are illustrated with simulations.     

Spatially eigen-weighted Hausdorff distances for human face recognition

Hausdorff distance is an efficient measure of the similarity of two point sets. In this paper, we propose a new spatially weighted Hausdorff distance measure for human face recognition. The weighting function used in the Hausdorff distance measure is based on an eigenface, which has a large value at locations of importance facial features and can reflect the face structure more effectively. Two modified Hausdorff distances, namely, “spatially eigen-weighted Hausdorff distance” (SEWHD) and “spatially eigen-weighted ‘doubly’ Hausdorff distance” (SEW2HD) are proposed, which incorporate the information about the location of important facial features such as eyes, mouth, and face contour so that distances at those regions will be emphasized. Experimental results based on a combination of the ORL, MIT, and Yale face databases show that SEW2HD can achieve recognition rates of 83%, 90% and 92% for the first one, the first three and the first five likely matched faces, respectively, while the corresponding recognition rates of SEWHD are 80%, 83% and 88%, respectively.     

A framework for 3D model reconstruction in reverse engineering

We present a framework for 3D model reconstruction, which has potential applications to a spectrum of engineering problems with impacts on rapid design and prototyping, shape analysis, and virtual reality. The framework, composed of four main components, provides a systematic solution to reconstruct geometric model from the surface mesh of an existing object. First, the input mesh is pre-processed to filter out noise. Second, the mesh is partitioned into segments to obtain individual geometric feature patches. Then, two integrated solutions, namely solid feature based strategy and surface feature based strategy, are exploited to reconstruct primitive features from the segmented feature patches. Finally, the modeling operations, such as solid boolean and surface trimming operations, are performed to “assemble” the primitive features into the final model. The concepts of “feature”, “constraint” and “modeling history” are introduced into the entire reconstruction process so that the design intents are retrieved and exhibited in the final model with geometrical accuracy, topological consistency and flexible editability. A variety of industrial parts have been tested to illustrate the effectiveness and robustness of our framework.     

Complexity reduction in MPC for stochastic max-plus-linear discrete event systems by variability expansion

Model predictive control (MPC) is a popular controller design technique in the process industry. Recently, MPC has been extended to a class of discrete event systems that can be described by a model that is “linear” in the max-plus algebra. In this context both the perturbations-free case and for the case with noise and/or modeling errors in a bounded or stochastic setting have been considered. In each of these cases an optimization problem has to be solved on-line at each event step in order to determine the MPC input. This paper considers a method to reduce the computational complexity of this optimization problem, based on variability expansion. In particular, it is shown that the computational load is reduced if one decreases the level of “randomness” in the system.     

Stabilization of max-plus-linear systems using model predictive control: The unconstrained case

Max-plus-linear (MPL) systems are a class of event-driven nonlinear dynamic systems that can be described by models that are “linear” in the max-plus algebra. In this paper we derive a solution to a finite-horizon model predictive control (MPC) problem for MPL systems where the cost is designed to provide a trade-off between minimizing the due date error and a just-in-time production. In general, MPC can deal with complex input and states constraints. However, in this paper we assume that these are not present and it is only required that the input should be a nondecreasing sequence, i.e. we consider the “unconstrained” case. Despite the fact that the controlled system is nonlinear, by employing recent results in max-plus theory we are able to provide sufficient conditions such that the MPC controller is determined analytically and moreover the stability in terms of Lyapunov and in terms of boundedness of the closed-loop system is guaranteed a priori.     

How to predict very large and complex crystal structures

Evolutionary crystal structure prediction proved to be a powerful approach in discovering new materials. Certain limitations are encountered for systems with a large number of degrees of freedom (“large systems”) and complex energy landscapes (“complex systems”). We explore the nature of these limitations and address them with a number of newly developed tools.For large systems a major problem is the lack of diversity: any randomly produced population consists predominantly of high-energy disordered structures, offering virtually no routes toward the ordered ground state. We offer two solutions: first, modified variation operators that favor atoms with higher local order (a function we introduce here), and, second, construction of the first generation non-randomly, using pseudo-subcells with, in general, fractional atomic occupancies. This enhances order and diversity and improves energies of the structures. We introduce an additional variation operator, coordinate mutation, which applies preferentially to low-order (“badly placed”) atoms. Biasing other variation operators by local order is also found to produce improved results. One promising version of coordinate mutation, explored here, displaces atoms along the eigenvector of the lowest-frequency vibrational mode. For complex energy landscapes, the key problem is the possible existence of several energy funnels - in this situation it is possible to get trapped in one funnel (not necessarily containing the ground state). To address this problem, we develop an algorithm incorporating the ideas of abstract “distance” between structures. These new ingredients improve the performance of the evolutionary algorithm USPEX, in terms of efficiency and reliability, for large and complex systems.     

Uncertainty of transfer function modelling using prior estimated noise models

Assuming “small” model errors (unmodelled dynamics and/or nonlinear distortions) and “large” signal-to-noise ratios we derive in this paper explicit expressions for the covariance matrix of a frequency domain estimator using prior estimated noise models. These analytic expressions (i) give a clear insight in the behaviour of the covariance matrix as a function of the signal-to-noise ratio, the unmodelled dynamics and the nonlinear distortions, and (ii) allow to predict accurately the order of magnitude of the actual uncertainty of the estimates. The link with the classical prediction error approach is also established.     

MPC: Current practice and challenges

Linear Model Predictive Control (MPC) continues to be the technology of choice for constrained, multivariable control applications in the process industry. Successful deployment of MPC requires “getting right” multiple aspects of the control problem. This includes the design of the underlying regulatory controls, design of the MPC(s), test design for model identification, model development, and dealing with nonlinearities. Approaches and techniques that are successfully applied in practice are described, including the challenges involved in ensuring a successful MPC application. Academic contributions are highlighted and suggestions provided for improving MPC.     

Identification of actors drawn in Ukiyoe pictures

This paper presents the development of line image keywords for the identification of actors drawn in Japanese traditional painting pictures known as Ukiyoe pictures. The system is based on visual features of the face from the image database files and is organized as a set of classifiers whose outputs are integrated after a normalization step. Line profile from the picture has been extracted in this investigation and has been approximated by Bézier curves. A learning algorithm has been developed to obtain the control points at high accuracy. A new curve matching method has been developed based on the feature points, rather than the corresponding points. This method can automatically fit a set of data points with piecewise geometrically continuous third order Bézier curves. Last of all, a new approach for distance calculation, namely “apple-node distance” has been introduced here for similarity calculation in image retrieval systems. The computation of similarity between curves has been established on the basis of this “apple-node” distance. The effectiveness of our method has been confirmed through computer simulation. The method developed here can be expanded to one of three dimensional shape-analyzing tools.     

Monte Carlo simulations of the 2d-Ising model in the geometry of a long stripe

The two-dimensional Ising model in the geometry of a long stripe can be regarded as a model system for the study of nanopores. As a quasi-one-dimensional system, it also exhibits a rather interesting “phase behavior”: At low temperatures the stripe is either filled with “liquid” or “gas” and “densities” are similar to those in the bulk. When we approach a “pseudo-critical point” (below the critical point of the bulk) at which the correlation length becomes comparable to the length of the stripe, several interfaces emerge and the systems contains multiple “liquid” and “gas” domains. The transition depends on the size of the stripe and occurs at lower temperatures for larger stripes. Our results are corroborated by simulations of the three-dimensional Asakura–Oosawa model in cylindrical geometry, which displays qualitatively similar behavior. Thus our simulations explain the physical basis for the occurrence of “hysteresis critical points” in corresponding experiments.     

Decomposition principle in model predictive control for linear systems with bounded disturbances

Considering a constrained linear system with bounded disturbances, this paper proposes a novel approach which aims at enlarging the domain of attraction by combining a set-based MPC approach with a decomposition principle. The idea of the paper is to extend the “pre-stabilizing” MPC, where the MPC control sequence is parameterized as perturbations to a given pre-stabilizing feedback gain, to the case where the pre-stabilizing feedback law is given as the linear combination of a set of feedback gains. This procedure leads to a relatively large terminal set and consequently a large domain of attraction even when using short prediction horizons. As time evolves, by minimizing the nominal performance index, the resulting controller reaches the desired optimal controller with a good asymptotic performance. Compared to the standard “pre-stabilizing” MPC, it combines the advantages of having a flexible choice of feedback gains, a large domain of attraction and a good asymptotic behavior.     

Fixed-parameter algorithms for Kemeny rankings

The computation of Kemeny rankings is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “consensus permutation” that is “closest” to the given set of permutations. Unfortunately, the problem is NP-hard. We provide a broad study of the parameterized complexity for computing optimal Kemeny rankings. Besides the three obvious parameters “number of votes”, “number of candidates”, and solution size (called Kemeny score), we consider further structural parameterizations. More specifically, we show that the Kemeny score (and a corresponding Kemeny ranking) of an election can be computed efficiently whenever the average pairwise distance between two input votes is not too large. In other words, Kemeny Score is fixed-parameter tractable with respect to the parameter “average pairwise Kendall–Tau distance _da$d_a$”. We describe a fixed-parameter algorithm with running time 16^⌈_da⌉⋅poly$16^{\lceil d_a\rceil }\cdot poly$. Moreover, we extend our studies to the parameters “maximum range” and “average range” of positions a candidate takes in the input votes. Whereas Kemeny Score remains fixed-parameter tractable with respect to the parameter “maximum range”, it becomes NP-complete in the case of an average range of two. This excludes fixed-parameter tractability with respect to the parameter “average range” unless P=NP. Finally, we extend some of our results to votes with ties and incomplete votes, where in both cases one no longer has permutations as input.     

A mathematical model on EPQ for stochastic demand in an imperfect production system

In the paper, we develop an EPQ (economic production quantity) inventory model to determine the optimal buffer inventory for stochastic demand in the market during preventive maintenance or repair of a manufacturing facility with an EPQ (economic production quantity) model in an imperfect production system. Preventive maintenance, an essential element of the just-in-time structure, may cause shortage which is reduced by buffer inventory. The products are sold with the free minimal repair warranty (FRW) policy. The production system may undergo “out-of-control” state from “in-control” state, after a certain time that follows a probability density function. The defective (non-conforming) items in “in-control” or “out-of-control” state are reworked at a cost just after the regular production time. Finally, an expected cost function regarding the inventory cost, unit production cost, preventive maintenance cost and shortage cost is minimized analytically. We develop another case where the buffer inventory as well as the production rate are decision variables and the expected unit cost considering the above cost functions is optimized also. The numerical examples are provided to illustrate the behaviour and application of the model. Sensitivity analysis of the model with respect to key parameters of the system is carried out.     

Robust output-feedback model predictive control for systems with unstructured uncertainty

In this paper, we present novel results that parameterize a broad class of robust output-feedback model predictive control (MPC) policies for discrete-time systems with constraints and unstructured model uncertainty. The MPC policies we consider employ: (i) a linear state estimator, (ii) a pre-determined feedback gain (iii) a set of “tighter constraints” and (iv) a quadratic cost function in the degrees of freedom and the estimated state. Contained within the class, we find both well-known control policies and policies with novel features. The unifying aspect is that all MPC policies within the class satisfy a robust stability test. The robust stability test is suited to synthesis and incorporates a novel linear matrix inequality (LMI) condition which involves the parameters of the cost function. The LMI is shown to always be feasible under an appropriate small-gain condition on the pre-determined feedback gain and the state estimator. Moreover, we show, by means of both theoretical and numerical results, that choosing the cost function parameters subject to the proposed condition often leads to good nominal performance whilst at the same time guaranteeing robust stability.     

Heuristic on-line tuning for nonlinear model predictive controllers using fuzzy logic

In this paper a systematic mechanism for on-line tuning of the non-linear model predictive controllers is presented. The proposed method automatically adjusts the prediction horizon P, the diagonal elements of the input weight matrix Λ, and the diagonal elements of the output weight matrix Γ for the sake of good performance. The desired good performance is cast as a time-domain specification. The control horizon (M) is left constant because of the importance of its relative value with respect to P. The concepts from fuzzy logic are used in designing the tuning algorithm. In the mechanism considered here, predefined fuzzy rules represent available tuning guidelines and the performance violation measure in the form of fuzzy sets determine the new tuning parameter values Therefore, the tuning algorithm is formulated as a simple and straightforward mechanism, which makes it more appealing for on-line implementation. The effectiveness of the proposed tuning method is tested through simulated implementation on three non-linear process examples. Two of these examples possess open-loop unstable dynamics. The result of the simulations shows that this method is successful and promising.     

Automatic approximation of the marginal likelihood in non-Gaussian hierarchical models

Fitting of non-Gaussian hierarchical random effects models by approximate maximum likelihood can be made automatic to the same extent that Bayesian model fitting can be automated by the program BUGS. The word “automatic” means that the technical details of computation are made transparent to the user. This is achieved by combining a technique from computer science known as “automatic differentiation” with the Laplace approximation for calculating the marginal likelihood. Automatic differentiation, which should not be confused with symbolic differentiation, is mostly unknown to statisticians, and hence basic ideas and results are reviewed. The computational performance of the approach is compared to that of existing mixed-model software on a suite of datasets selected from the mixed-model literature.     

A minimal k-step delay controller for robust tracking of non-minimum phase systems

This paper considers the problem of look-ahead robust tracking for a non-minimum phase system under a sensitivity constraint. Because of non-minimum phase zeros, the exact tracking of arbitrary reference input is impossible. However, with an introduction of some delay, tracking is possible within any given “tolerance” ?₁ > 0. It is shown in the paper that the minimum delay required to satisfy the tracking performance is decoupled from a sensitivity/disturbance rejection constraint. Moreover, it is shown that calculation of the minimum delay reduces to a binary search problem.     

Two models of two-dimensional bandwidth problems

The two-dimensional bandwidth problem is to embed a graph G into an n×n grid in the plane such that the maximum distance between adjacent vertices is as small as possible. Here, the “distance” has two different meanings: the L₁-norm distance and L_∞-norm distance. So we have two models of two-dimensional bandwidth problem. This paper investigates the basic properties and relations of these two models. Some lower bounds, upper bounds, and exact results are presented.