An analytical study is presented for the performance of fast frequency-hopping (FFH) self-normalized orthogonal -ary frequency-shift-keyed (MFSK) noncoherent receivers in the presence of multitone jamming. The multiple equal-power jamming tones are assumed to correspond to some of the possible FFH/ -ary orthogonal signaling tones. It has been shown that a higher diversity order (the number of h...

We consider algorithms of the Waltz type for computing local consistency (also called arc-consistency) for constraints over numeric domains. Many commonly used propagation rules do not in fact enforce local consistency. We extend the propagation rule given by Falt-ings Faltings, 1994] to the case of ternary constraints. Since any general n-ary continuous constraint can be represented as a colle...

We prove that any IN-rational sequence s = (sn) n1 of non-negative integers satisfying the Kraft strict inequality P n1 snk ?n < 1 is the enumerative sequence of leaves by height of a rational k-ary tree. Particular cases of this result had been previously proven. We give some partial results in the equality case.

We consider a sequence of probability measures n obtained by conditioning a random and give several suucient conditions on the distribution of X for n to be stochastically increasing in n. The problem is motivated by an interacting particle system on the homogeneous tree in which each vertex has d + 1 neighbors. This system is a variant of the contact process, and was studied recently by A. Puh...

The parity based divide and conquer recursion trees are introduced where the sizes of the tree do not grow monotonically as n grows. These non-monotonic recursive functions called fogk(n) and f̃ogk(n) are strictly less than linear, o(n) but greater than logarithm, Ω(logn). Properties of fogk(n) such as non-monotonicity, upper and lower bounds, etc. are examined and proven. These functions are us...

In this paper we compute the number of reduced decompositions of certain permutations ∈ Sn as a product of transpositions (1; 2), (1; 3), : : :, (1; n). We present several combinatorial correspondences between these decompositions and combinatorial objects such as Catalan paths and k-ary trees. c © 1999 Elsevier Science B.V. All rights reserved

The aim of this paper is to propose a variational piecewise constant level set method for solving elliptic shape and topology optimization problems. The original model is approximated by a two-phase optimal shape design problem by the ersatz material approach. Under the piecewise constant level set framework, we first reformulate the two-phase design problem to be a new constrained optimization...

The paper analyses and compares alternative iterative and recursive implementations of N-ary search algorithms in hardware (in field programmable gate arrays, in particular). The improvements over the previous results have been achieved with the aid of the proposed novel methods for the fast implementation of hierarchical algorithms. The methods possess the following distinctive features: 1) pr...

fuzzy rough n-ary subhypergroups are introduced and characterized.