from that of Gaussian. It may be noted that this characteristic of pseudo-error detectors was predicted by G ~ o d i n g (~) and may now be regarded as being confirmed.' Scrutiny of Figures 8, 9 and 10 indicates that the achieved stability of the multiplication factor is sufficient to estimate BER from the pseudo-error rate with an accuracy of about a factor of 10 in BER. In addition, the estim...

This paper explores the approximation of addition mod 2n by addition mod 2w, where 1 ≤ w ≤ n, in ARX functions that use large words (e.g., 32-bit words or 64-bit words). Three main areas are explored. First, pseudo-linear approximations aim to approximate the bits of a w-bit window of the state after some rounds. Second, the methods used in these approximations are also used to construct trunca...

Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including distributed task scheduling with limited resource availability. A dedicated framework called Resource Constrained DCOP (RCDCOP) has recently been proposed. RCDCOP models objective functions and resource constraints separa...

Within this paper we study the Minkowski sum of prisms (" Cephoids ") in a finite dimensional vector space. For a vector a ∈ R n with positive components we write ¯ a = (1 ¯ a 1 1 ¯ an) and denote by = ¯ a = {x ∈ R n || ¯ a, x 1 , x 0} the associated prism. We provide a representation of a finite sum of prisms in terms of inequalities.

Let SH denote the homothety class generated by a convex set S ⊂ R: SH = {a + λS | a ∈ R, λ > 0}. We determine conditions for the Minkowski sum BH + CH or the Minkowski difference BH ∼ CH of homothety classes BH and CH generated by closed convex sets B,C ⊂ R to lie in a homothety class generated by a closed convex set (more generally, in the union of countably many homothety classes generated by...

Fakhruddin has proved that for two lattice polygons P and Q any lattice point in their Minkowski sum can be written as a sum of a lattice point in P and one in Q, provided P is smooth and the normal fan of P is a subdivision of the normal fan of Q. We give a shorter combinatorial proof of this fact that does not need the smoothness assumption on P .

Os autores fazem o relato de três casos clínicos: Papilomatose florida, Epitelioma cuniculatum e Condiloma gigante Buschke Lowenstein, considerados como representativos entidades que compõem grupo das Papilomatoses pseudo-carcinomatosas. São favoráveis à conceituação pseudo-carcinomatosas apoiando-se na semelhança clínica, histopatológica, evolutiva da terapêutica a ser instituída. Discutem, ai...

In this paper, we study the theory of pseudo knots, which are knots with some missing crossing information, and introduce tied links knotoids. particular, first present a braiding algorithm for then L-moves in that setting, use formulate sharpened version analogue Markov theorem braids. Then, links, generalize notion exploit relation between singular links. We an L-move braid equivalence monoid...