In this paper we define a variant of the Ising model in which spins are replaced with permutations. The energy between two is function relative disorder one spin, permutation, to other. This motivated by complexity measure for declarative systems. For such systems state permutation and sorting measures average sequential neighbouring states. To use symmetrized version descent statistic that has...

We introduce a normalized version of the LCS metric as a new local similarity measure for comparing two RNAs. An O(n2m lgm) time algorithm is presented for computing the maximum normalized score of two RNA sequences, where n and m are the lengths of the sequences and n ≤ m. This algorithm has the same time complexity as the currently best known global LCS algorithm.

The paper presents a morphological spatio-temporal segmentation method, which is based on a new similarity measure. This similarity measure considers jointly spatial and temporal information and consists therefore of two terms. The rst term minimizes the displaced frame di erence, considering the a ne motion model. By the second term the spatial homogenity of the luminance values of every regio...

Optimal fictitious completions of an incomplete financial market are shown to be associated with exponential martingales (not just local martingales) and, therefore, to "an optimal equivalent martingale measure'. Results of independent interest, in the theory of continuous-time martingales, are derived as well. iirshurgb, PA 15213-3890

We address a central (and classical) issue in the theory of infinite games: the reduction of the memory size that is needed to implement winning strategies in regular infinite games (i.e., controllers that ensure correct behavior against actions of the environment, when the specification is a regular ωlanguage). We propose an approach which attacks this problem before the construction of a stra...

The communication complexity of a function f(x, y) measures the number of bits that two players, one who knows x and the other who knows y, must exchange to determine the value f(x, y). Communication complexity is a fundamental measure of complexity of functions. Lower bounds on this measure lead to lower bounds on many other measures of computational complexity. This monograph survey lower bou...

In an incomplete financial market in which the dynamics of the asset prices is driven by a d-dimensional continuous semimartingale X, we consider the problem of pricing European contingent claims embedded in a power utility framework. This problem reduces to identifying the p-optimal martingale measure, which can be given in terms of the solution to a semimartingale backward equation. We use th...

We survey lower bounds in communication complexity. Our focus is on lower bounds that work by first representing the communication complexity measure in Euclidean space. That is to say, the first step in these lower bound techniques is to find a geometric complexity measure such as rank, or the trace norm that serves as a lower bound to the underlying communication complexity measure. Lower bou...

Manufacturing complexity is not easily defined. The ability to measure manufacturing complexity will permit benchmarking of systems, and allow assessment of system design changes on complexity. This paper will classify existing complexity measures, identify the essential elements of a good measure, and propose a measure of manufacturing complexity.

this paper assumes the cell formation problem as a distributed decision network. it proposes an approach based on application and extension of information theory concepts, in order to analyze informational complexity in an agent- based system, due to interdependence between agents. based on this approach, new quantitative concepts and definitions are proposed in order to measure the amount of t...