The skyline, or Pareto, operator selects those tuples that are not dominated by any others. Extending relational systems with the skyline operator would offer a basis for handling preference queries. Good algorithms are needed for skyline, however, to make this efficient in a relational setting. We propose a skyline algorithm, SFS, based on presorting that is general, for use with any skyline q...

in a detection network, the final decision is made by fusing the decisions from local detectors. the objective of that decision is to minimize the final error probability. to implement and optimal fusion rule, the performance of each detector, i.e. its probability of false alarm and its probability of missed detection as well as the a priori probabilities of the hypotheses, must be known. howev...

The dynamic facility layout problem (DFLP) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. In this paper a new optimization algorithm inspired from colonizing weeds, Invasi...

A market-based algorithm is presented which autonomously apportions complex tasks to multiple cooperating agents giving each agent the motivation of improving performance of the whole system. A speciic model, called \The Hayek Machine" is proposed and tested on a simulated Blocks World (BW) planning problem. Hayek learns to solve more complex BW problems than any previous learning algorithm. Gi...

Determining whether there is an integer point in an n-dimensional simplex is an NPcomplete problem. In this paper, a new arbitrary starting variable dimension algorithm is developed for computing an integer point of an n-dimensional simplex. The algorithm is derived from an introduction of an integer labeling rule and an application of a triangulation of the space and is composed of two phases,...

This paper provides a short and transparent solution for the covering cost of white–grey trees which play a crucial role in the algorithm of Bergeron et al. to compute the rearrangement distance between two multichromosomal genomes in linear time (Theor. Comput. Sci., 410:5300– 5316, 2009). In the process it introduces a new center notion for trees, which seems to be interesting on its own.

The Time-Domain Vector Fitting (TD-VF) algorithm for macromodeling of linear multiport systems is presented. A rational approximation for the system matrix transfer function is easily derived from transient input/output port responses. Several validations illustrate the high accuracy of the method.

In this paper we show a polynomial-time algorithm to find the best rational approximation of a given rational number within a given interval. As a special case, we show how to find the best rational number that after evaluating and rounding exactly matches the input number. In both results, “best” means “having the smallest possible denominator”.

{ In this paper we describe a method for recovering Euclidean structure of an unknown scene with an uncalibrated camera mounted onto a robot arm. More precisely the method achieves the following tasks: the projective structure of the scene obtained with a projective reconstruction algorithm is converted into an Euclidean structure and the intrinsic camera parameters are estimated as well as the...

Coxeter groups have presentations 〈S : (st)st∀s, t ∈ S〉 where for all s, t ∈ S, mst ∈ {1, 2, . . . ,∞}, mst = mts and mst = 1 if and only if s = t. A fundamental question in the theory of Coxeter groups is: Given two such “Coxeter” presentations, do they present the same group? There are two known ways to change a Coxeter presentation, generally referred to as twisting and simplex exchange. We ...