Femtocells are recognized effective for improving network coverage and capacity, and reducing power consumption due to the reduced range of wireless transmissions. Although highly appealing, a plethora of challenging problems need to be addressed for fully harvesting its potential. In this paper, we investigate the problem of cell association and service scheduling in femtocell networks. In add...

The sequential correction of a fire spread model parameters is performed via the assimilation of airborne-like fire front observations in order to improve the simulation and forecast of the fire propagation. An Ensemble Kalman Filter (EnKF) is applied to reduce uncertainties in the atmospheric and vegetation parameters for the Rate Of Spread (ROS) model. The non-linear relation between the para...

We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then solve through a well-known method employing linear programming relaxation and randomized rounding. The key contribution of this approach is that it yields the first polynomial time approximation algorithm for this problem...

Tracking multiple visual targets involving occlusion and varying number problems is a challenging problem in computer vision. This paper presents a summary of recent works on multiple targets tracking (MTT) in video done by a research group of Institute of Artificial Intelligence and Robotics, XJTU. The summary is given in two parts. The first part presents their work on modelling interactions ...

A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...

The Karhunen-Loeve (KL) transform is an optimal method for approximating a set of vectors or images, which was used in image processing and computer vision for several tasks such as face and object recognition. Its computational demands and its batch calculation nature have limited its application. Here we present a new, sequential algorithm for calculating the KL basis, which is faster in typi...

We study combinatorial optimization problems in which a set of distributed agents must achieve a global objective using only local information. Papadimitriou and Yannakakis [Proceedings of the 25th ACM Symposium on Theory of Computing, 1993, pp. 121–129] initiated the study of such problems in a framework where distributed decision-makers must generate feasible solutions to positive linear prog...

we present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with lr fuzzy variables. as solutions, notions of exact and approximate solutions are considered. we transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. if the corresponding crisp system is incompatible, then the fuzzy ...

Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up existing algorithms, largely due to the use of pointbased methods. Performing point-based backup is a fundamental operation in state-of-the-art algorithms. We show that even a single backup step in the multi-agent setti...