Analysis of exclusively kinetic two-link underactuated mechanical systems

Analysis of exclusively kinetic two-link underactuated mechanical systems is undertaken in this paper. It is first shown that such systems are not full-state feedback linearizable around any equilibrium point. Also, the equilibrium points for which the system is small-time locally controllable (STLC) is at most a one-dimensional submanifold. A concept less restrictive than STLC, termed the small-time local output controllability (STLOC) is introduced, the satisfaction of which guarantees that a chosen configuration output can be controlled at its desired value. It is shown that the class of systems considered is STLOC, if the inertial coupling between the input and output is nonzero. Also, in such a case, the system is nonminimum phase. An example section illustrates all the results presented.     

Wiener models of direction-dependent dynamic systems

Analysis of systems with direction-dependent dynamics is currently limited to cases in which the dynamics in the two directions of the output are first order; results for such systems have been published for both pseudo-random maximum-length binary (MLB) and inverse-repeat maximum-length binary (IR-MLB) inputs. These relatively limited analytical results make it useful to examine alternative ways of modelling such systems and in this paper, Wiener models are considered for this purpose. Methods for optimising the Wiener model parameters by matching the system and model cross-correlation functions, outputs, and discrete Fourier transforms of the outputs are considered, and the results are compared. These methods are also applied to a first-order direction-dependent system with a maximum-length ternary (MLT) input, for which no analytical results are currently available, and to a second-order system with an IR-MLB input.     

Vote counting measures for ensemble classifiers

Various measures, such as Margin and Bias/Variance, have been proposed with the aim of gaining a better understanding of why Multiple Classifier Systems (MCS) perform as well as they do. While these measures provide different perspectives for MCS analysis, it is not clear how to use them for MCS design. In this paper a different measure based on a spectral representation is proposed for two-class problems. It incorporates terms representing positive and negative correlation of pairs of training patterns with respect to class labels. Experiments employing MLP base classifiers, in which parameters are fixed but systematically varied, demonstrate the sensitivity of the proposed measure to base classifier complexity.     

Complex variable formulations for usual and hypersingular integral equations for potential problems — with applications to corners and cracks

This paper first presents an unified discussion of real and complex boundary integral equations (BIEs) for two-dimensional potential problems. Relationships between real and complex formulations, for both usual and hypersingular BIEs, are discussed. Potential problems in bounded as well as in unbounded domains are of concern in this work. Quantities of particular interest are derivatives of the primary field that exhibit discontinuities across corners, as well as stress intensity factors at the tips of mode III cracks. The latter problem in an application of a recent generalization of the well-known Plemelj-Sokhotsky formulae. Numerical implementations and results for interior problems in bounded domains, as well as for crack problems in unbounded domains, are presented and discussed.C. Y. Hui is supported by the Material Science Center at Cornell University, which is funded by the National Science Foundation (DMR-MRL program). S Mukherjee acknowledges partial support from NSF grant number ECS-9321508 to Cornell University.     

Safety,liveness and fairness in temporal logic

In this paper we present syntactic characterization of temporal formulas that express various properties of interest in the verification of concurrent programs. Such a characterization helps us in choosing the right techniques for proving correctness with respect to these properties. The properties that we consider include safety properties, liveness properties and fairness properties. We also present algorithms for checking if a given temporal formula expresses any of these properties.This work is partly supported by NSF grant CCR-9212183. A preliminary version of this paper appeared in the Fourth ACM Symposium on Principles of Distributed Computing.