A code ${\cal C}$ is $\Z_2\Z_4$-additive if the set of coordinates can be partitioned into two subsets $X$ and $Y$ such that the punctured code of ${\cal C}$ by deleting the coordinates outside $X$ (respectively, $Y$) is a binary linear code (respectively, a quaternary linear code). In this paper $\Z_2\Z_4$-additive codes are studied. Their corresponding binary images, via the Gray map, are $\Z...

Additive Cost Register Automata (ACRA) map strings to integers using a finite set of registers that are updated using assignments of the form “x := y + c” at every step. The corresponding class of additive regular functions has multiple equivalent characterizations, appealing closure properties, and decidable analysis questions. In this paper, we define the register complexity of an additive re...

This paper introduces a class of non-additive anonymous games where agents are assumed to be uncertain (in the sense of Knight) about opponents’ strategies and about the initial distribution over players’ characteristics in the game. We model uncertainty by non-additive measures or capacities and prove the Cournot-Nash equilibrium existence theorem for this class of games. Equilibrium distribut...

This paper investigates the syntax-semantics interface of the focus particle 還 hai 'HAI' in Mandarin Chinese. In particular, this paper argues that the various interpretations of hai observed in the previous studies can be explained by the syntactic positions where it occurs. Based on the word order of hai and adverbials that occupy fixed positions, I map out the typography of hai: Hai occurrin...

The Z2s-additive and Z2Z4-additive codes are subgroups of Z n 2 and Z α 2 × Z β 4 , respectively. Both families can be seen as generalizations of linear codes over Z2 and Z4. A Z2s-linear (resp. Z2Z4-linear) Hadamard code is a binary Hadamard code which is the Gray map image of a Z2s-additive (resp. Z2Z4-additive) code. It is known that there are exactly ⌊ t−1 2 ⌋ and ⌊ t 2⌋ nonequivalent Z2Z4-...

59 Abstract— Conventional noise reduction filtering schemes realize limited improvements of the peak signal-to-noise ratio (PSNR) in the low-level noisy images. The flatness degree and the edge information are effectively used to estimate the noise volume. We propose a noise estimator for reducing noise in the AWGN (additive white gaussian noise) corrupted images using three intermediate image ...

Convergence in distribution is investigated in a finitely additive setting. Let Xn be maps, from any set Ω into a metric space S, and P a finitely additive probability (f.a.p.) on the field F = S n σ(X1, . . . , Xn). Fix H ⊂ Ω and X : Ω → S. Conditions for Q(H) = 1 and Xn d → X under Q, for some f.a.p. Q extending P , are provided. In particular, one can let H = {ω ∈ Ω : Xn(ω) converges} and X ...

Let (X ,J ) denote a Markov-additive process with phase–type jumps (PH-MAP) and denote its supremum process by S. For some a > 0, let τ(a) denote the time when the reflected processY := S−X first surpasses the level a. Further, let τ−(a) denote the last time before τ(a) when X attains its current supremum. In this paper we shall derive the joint distribution of Sτ(a), τ−(a) and τ(a), where the ...

Benthic habitat maps, including maps of seabed sediments, have become critical spatial-decision support tools for marine ecological management and conservation. Despite the increasing recognition that environmental variables should be considered at multiple spatial scales, variables used in habitat mapping are often implemented at a single scale. The objective of this study was to evaluate the ...

In recent decades many articles have discussed the possibilities of chaos applied in communications. However, the vast majority consider in practical terms the ideal channel condition, which is clearly a restringing condition. Some papers show that when there is an additive noise, the synchronization error often disrupts communication. In this work, we present results of a comparison between sy...