Decentralized robust control of mechanical systems

For mechanical systems described by Euler-Lagrange equations and involving high-order interconnections, this paper proposes a decentralized control, which guarantees the uniform ultimate stability when the control objective is tracking a smooth desired trajectory. The controller design is based on some physical properties of such systems and Lyapunov design methodology. The application of the proposed controller to robot manipulators is presented, and experiment results are included to illustrate the performance of the proposed control algorithm     

Suboptimal exact model matching for multivariable systems withmeasurement noise

This paper describes a method for the design of discrete-time model matching control systems for a multivariable plant with measurement noise. This method uses a new parametrization for model matching controllers. Simulation results are presented which confirm the validity of the design method     

Orientation space filtering for multiple orientation linesegmentation

The goal of this paper is to present an appropriate method for the segmentation of lines at intersections (X-junctions) and branches (T-junctions), which can be regarded as local regions where lines occur at multiple orientations. A novel representation called “orientation space” is proposed, which is derived by adding the orientation axis to the abscissa and the ordinate of the image. The orientation space representation is constructed by treating the orientation parameter, to which Gabor filters can be tuned, as a continuous variable. The problem of segmenting lines at multiple orientations is dealt with by thresholding 3D images in the orientation space and then detecting the connected components therein. In this way, X-junctions and T-junctions can be separated effectively. Curve grouping can also be accomplished. The segmentation of mathematically modeled X-, T-, and L-junctions is demonstrated and analyzed. The sensitivity limits of the method are also discussed. Experimental results using both synthesized and real images show the method to be effective for junction segmentation and curve grouping     

Independent motion detection in 3D scenes

This paper presents an algorithmic approach to the problem of detecting independently moving objects in 3D scenes that are viewed under camera motion. There are two fundamental constraints that can be exploited for the problem: 1) two/multiview camera motion constraint (for instance, the epipolar/trilinear constraint) and 2) shape constancy constraint. Previous approaches to the problem either use only partial constraints, or rely on dense correspondences or flow. We employ both the fundamental constraints in an algorithm that does not demand a priori availability of correspondences or flow. Our approach uses the plane-plus-parallax decomposition to enforce the two constraints. It is also demonstrated that for a class of scenes, called sparse 3D scenes in which genuine parallax and independent motions may be confounded, how the plane-plus-parallax decomposition allows progressive introduction, and verification of the fundamental constraints. Results of the algorithm on some difficult sparse 3D scenes are promising.     

Barrier synchronization on wormhole-routed networks

In this paper, we propose an efficient barrier synchronization scheme on networks with arbitrary topologies. We first present a distributed method in building a barrier routing tree. The barrier messages can be delivered adaptively according to the hierarchy of the established barrier tree to void congestion and faulty nodes in the network. We then propose a new technique, called bandwidth-preempting technique, for a blocked barrier message to preempt a channel occupied by a data message so that the latency of a barrier message can be controlled without affecting much of the overall system performance. We also propose an analytical performance model and present simulation results for the performance evaluation of the proposed scheme. Performance evaluations show that the proposed scheme outperforms the existing algorithms for barrier synchronization     

Cost functions and model combination for VaR-based asset allocationusing neural networks

We introduce an asset-allocation framework based on the active control of the value-at-risk of the portfolio. Within this framework, we compare two paradigms for making the allocation using neural networks. The first one uses the network to make a forecast of asset behavior, in conjunction with a traditional mean-variance allocator for constructing the portfolio. The second paradigm uses the network to directly make the portfolio allocation decisions. We consider a method for performing soft input variable selection, and show its considerable utility. We use model combination (committee) methods to systematize the choice of hyperparameters during training. We show that committees using both paradigms are significantly outperforming the benchmark market performance.     

An Internet-based negotiation server for e-commerce

This paper describes the design and implementation of a replicable, Internet-based negotiation server for conducting bargaining-type negotiations between enterprises involved in e-commerce and e-business. Enterprises can be buyers and sellers of products/services or participants of a complex supply chain engaged in purchasing, planning, and scheduling. Multiple copies of our server can be installed to complement the services of Web servers. Each enterprise can install or select a trusted negotiation server to represent his/her interests. Web-based GUI tools are used during the build-time registration process to specify the requirements, constraints, and rules that represent negotiation policies and strategies, preference scoring of different data conditions, and aggregation methods for deriving a global cost-benefit score for the item(s) under negotiation. The registration information is used by the negotiation servers to automatically conduct bargaining type negotiations on behalf of their clients. In this paper, we present the architecture of our implementation as well as a framework for automated negotiations, and describe a number of communication primitives which are used in the underlying negotiation protocol. A constraint satisfaction processor (CSP) is used to evaluate a negotiation proposal or counterproposal against the registered requirements and constraints of a client company. In case of a constraint violation, an event is posted to trigger the execution of negotiation strategic rules, which either automatically relax the violated constraint, ask for human intervention, invoke an application, or perform other remedial operations. An Event-Trigger-Rule (ETR) server is used to manage events, triggers, and rules. Negotiation strategic rules can be added or modified at run-time. A cost-benefit analysis component is used to perform quantitative analysis of alternatives. The use of negotiation servers to conduct automated negotiation has been demonstrated in the context of an integrated supply chain scenario. Received: 30 October 2000 / Accepted: 12 January 2001 Published online: 2 August 2001     

Heat transfer in microchannel devices using DSMC

The heat transfer characteristics of supersonic flows in microchannels is studied using direct simulation Monte Carlo (DSMC) method. The velocity components and the spatial coordinates of the simulated particles are calculated and recorded by using a variable-hard-sphere (VHS) collision model. The effects of Knudsen number (Kn) on the heat transfer of the microchannel flows are examined. The results show that the magnitude of the temperature jump at the wall increases with increasing Kn. The heat transfer to the isothermal wall is found to increase significantly with Kn. The possible causes for the increase of wall heat transfer are discussed     

Dynamic Response Calculation of Spatial Elastic Multibody Systems with High-Frequency Excitation

The objective of this paper is to establish a computationalscheme for dynamic response calculations of a three-dimensionalmultibody mechanical system with impulsive forces, which give rise tohigh-frequency excitations. The finite-element method is employed torepresent the local deformations of three-dimensional beam-like elasticcomponents by either a finite set of nodal coordinates or a truncatedset of modal coordinates. A reduced-order model is obtained by invokinga modal transformation. Both planar and complex modal reduction schemesare established. The developed formulation is implemented into amultibody simulation program that assembles the equations of motion andproceeds with its solution. The computational scheme permits a change inthe basis of the modal space in order to regulate the admittance ofhigher frequencies and to accommodate any change in the kinematicconfiguration. Numerical examples are presented to demonstrate theapplicability of the developed computational scheme.     

A Special Session on Granular Computing and Interval Computations at the 19th International Conference of the North American Fuzzy Information Processing Society (NAFIPS) Atlanta,Georgia, July 13–15, 2000

Reliable Computing -