Definition of (semi) metric. CS motivation. Finite metric spaces arise naturally in combinatorial objects, and algo-rithmic questions. For example, as the shortest path metrics on graphs. We will also see less obvious connections. Properties of finite metrics. The following properties have been investigated: Dimension , extendability of Lipschitz and Hölder functions, decomposability, Inequalit...

The aim of the present study was to investigate the modulations in amplitude of H reflexes elicited in a hand muscle, the flexor pollicis brevis, during the performance of a choice reaction time (RT) task in which this muscle was directly involved. Ten subjects were to choose between a left- or a right-thumb key-press according to the lateral location of a flash of light. The stimulus-response ...

It is known that many of the classes of simple Lie algebras of prime characteristic of nonclassical type have simple infinite-dimensional analogues of characteristic zero (see, for example, [4, p. 518]). We consider here analogues of those algebras which are defined by a modification of the definition of a group algebra. Thus we consider analogues of the Zassenhaus algebras as generalized by Al...

To make cross-layer design tradeoffs spanning from application layer to physical layer, the interdependency of the control parameters at different layers should be quantitatively measured. A theoretical framework employing a non-additive measure based approach is proposed, which doesn’t need modeling and any prior knowledge of probability distribution of the transmission condition. It captures ...

In 1940, Ulam 1 gave a talk before the Mathematics Club of the University of Wisconsin in which he discussed a number of unsolved problems, containing the stability problem of homomorphisms as follows Let G1 be a group and let G2 be a metric group with the metric d ·, · . Given ε > 0, does there exist a δ > 0 such that if a mapping h : G1 → G2 satisfies the inequality d h xy , h x h y < δ for a...

When working in changing environments, it is important for a solution approach to adapt to the change and follow the new optima. For genetic algorithms, using diploid representations is one of the methods for addressing performance and diversity issues in such environments. When using a diploid representation for individuals, the choice of a good genotype to phenotype mapping mechanism is a ver...

Let N be a near ring. An additive mapping f : N → N is said to be a right generalized (resp., left generalized) derivation with associated derivation d onN if f(xy) = f(x)y + xd(y) (resp., f(xy) = d(x)y + xf(y)) for all x, y ∈ N. A mapping f : N → N is said to be a generalized derivation with associated derivation d onN iff is both a right generalized and a left generalized derivation with asso...

Digital watermarks for images can be made relatively robust to luminance and chrominance changes. More challenging problems are geometric or combined intensity/geometric attacks. In this work we use an additive watermarking model, commonly used in spread spectrum, using a new spreading function. The spreading function is a 2D circular chirp that can simultaneously resist JPG compression and ima...

To efficiently determine critical condition of noiseinduced bifurcation in nonlinear dynamical systems, a stochastic sensitivity function (SSF) around a deterministic periodic attractor is approximated based on stroboscopic mapping. Then the confidence ellipses are constructed and used to judge if it collides with some invariant sets of system in order to obtain the critical noise intensity of ...

The electrophoresis chromatography, a popular analysis tool, is able to separate different kinds of protein pro£les. In this paper, we present a robust comparative algorithm Maximum Relation Spanning Tree (MRST) for matching large scale and large sets of two dimensional protein gel electrophoresis (2DGE) chromatography images without the need of a priori landmark. The algorithm not only can han...