Robust Kalman filtering for uncertain discrete-time systems with probabilistic parameters bounded within a polytope

We consider the problem of finite horizon discrete-time Kalman filtering for systems with parametric uncertainties. Specifically, we consider unknown but deterministic uncertainties where the uncertain parameters are assumed to lie in a convex polyhedron with uniform probability density. The condition and a procedure for the construction of a suboptimal filter that minimizes an expected error covariance over-bound are derived.     

An efficient algorithm for positive realizations

We observe that successive applications of known results from the theory of positive systems lead to an efficient general algorithm for positive realizations of transfer functions. We give two examples to illustrate the algorithm, one of which complements an earlier result of [L. Benvenuti, L. Farina, An example of how positivity may force realizations of ‘large’ dimensions, Systems Control Lett. 36 (1999) 261–266]. Finally, we improve a lower-bound of [B. Nagy, M. Matolcsi, A lower-bound on the dimension of positive realizations, IEEE Trans. Circuits Syst. I 50 (2003) 782–784] to indicate that the algorithm is indeed efficient in general.     

Stabilizability of two-dimensional linear systems via switched output feedback

The problem of stabilizing a second-order SISO LTI system of the form , y=Cx with feedback of the form u(x)=v(x)Cx is considered, where v(x) is real-valued and has domain which is all of . It is shown that, when stabilization is possible, v(x) can be chosen to take on no more than two values throughout the entire state-space (i.e., v(x){k₁,k₂} for all x and for some k₁,k₂), and an algorithm for finding a specific choice of v(x) is presented. It is also shown that the classical root locus of the corresponding transfer function C(sI-A)^-1B has a strong connection to this stabilization problem, and its utility is demonstrated through examples.     

control with limited communication and message losses

We propose an H^∞ approach to a remote control problem where the communication is constrained due to the use of a shared channel. The controller employs a periodic time sequencing scheme for message transmissions from multiple sensors and to multiple actuators of the system. It further takes into account the information on the random message losses that occur in the channel. An exact characterization for controller synthesis is obtained and is stated in terms of linear matrix inequalities. Furthermore, an analysis on the loss probabilities of the messages to accomplish stabilization is carried out. The results are illustrated through a numerical example.     

Controllability of second-order infinite-dimensional systems

In the paper, the approximate controllability of linear abstract second-order infinite-dimensional dynamical systems is considered. It is proved using the frequency-domain method, that approximate controllability of second-order system can be verified by the approximate controllability conditions for the corresponding simplified first-order system. General results are then applied for approximate controllability investigation of a vibratory dynamical system modeling flexible mechanical structure. Some special cases are also considered. Moreover, remarks and comments on the relationships between different concepts of controllability are given. The paper extends earlier results on approximate controllability of second-order abstract dynamical systems.     

Performance bounds in linear control of unstable MIMO systems with pole location constraint

This paper proposes a methodology to compute quadratic performance bounds when the closed loop poles of a discrete-time multivariable control loop are confined to a disk, centred at the origin, and with radius less than one. The underlying philosophy in this constraint is to avoid certain undesirable dynamic features which arise in quadratic optimal designs. An expression for the performance loss due to the pole location constraint is also provided. Using numerical examples, we show that the performance loss is compensated by an improved transient performance, specially visible in the control signals.     

Learning to learn: From smart machines to intelligent machines

Since its birth, more than five decades ago, one of the biggest challenges of artificial intelligence remained the building of intelligent machines. Despite amazing advancements, we are still far from having machines that reach human intelligence level. The current paper tries to offer a possible explanation of this situation. For this purpose, we make a review of different learning strategies and context types that are involved in the learning process. We also present the results of a study on cognitive development applied to the problem of face recognition for social robotics.     

Recommendation systems for decision support: An editorial introduction

This special section is focused on recommendation systems, computer-based information systems that provide suggestions based on previous usage behavior. The papers included in this section were selected from the Pacific Asia Conference on Information Systems (PACIS) and Workshop on Electronic Business (WEB). The application domains include website browsing aids, knowledge recommendation, document clustering, and team staff selection. They provide a snapshot of current development in using recommendation systems for decision support.     

A semantic-expansion approach to personalized knowledge recommendation

The rapid propagation of the Internet and information technologies has changed the nature of many industries. Fast response and personalized recommendations have become natural trends for all businesses. This is particularly important for content-related products and services, such as consulting, news, and knowledge management in an organization. The digital nature of their products allows for more customized delivery over the Internet. To provide personalized services, however, a complete understanding of user profile and accurate recommendation are essential.In this paper, an Internet recommendation system that allows customized content to be suggested based on the user's browsing profile is developed. The method adopts a semantic-expansion approach to build the user profile by analyzing documents previously read by the person. Once the customer profile is constructed, personalized contents can be provided by the system. An empirical study using master theses in the National Central library in Taiwan shows that the semantic-expansion approach outperforms the traditional keyword approach in catching user interests. The proper usage of this technology can increase customer satisfaction.     

On-Line Multi-Threaded Paging

Abstract. In this paper we introduce a generalization of Paging to the case where there are many threads of requests. This models situations in which the requests come from more than one independent source. Hence, apart from deciding how to serve a request, at each stage it is necessary to decide which request to serve among several possibilities. Four different on-line problems arise depending on whether we consider fairness restrictions or not, with finite or infinite input sequences. We study all of them, proving lower and upper bounds for the competitiveness of on-line algorithms. The main competitiveness results presented in this paper state that when no fairness restrictions are imposed it is possible to obtain competitive algorithms for finite and infinite inputs. On the other hand, for the fair case in general there exist no competitive algorithms. In addition, we consider three definitions of competitiveness for infinite inputs. One of them forces algorithms to behave efficiently at every finite stage, while the other two aim at comparing the algorithms' steady-state performances. A priori, the three definitions seem different. We study them and find, however, that they are essentially equivalent. This suggests that the competitiveness results that we obtain reflect the intrinsic difficulty of the problem and are not a consequence of a too strict definition of competitiveness.