Results 1  10
of
833
1HYPERSTABILITY
"... This paper describes a closed form demographic model with changing vital rates. The hyperstable model replaces the strict stable population assumption of constant rates of fertility and mortality with weaker assumptions on the pattern of net maternity. Those alternative assumptions are a fixed prop ..."
Abstract
 Add to MetaCart
This paper describes a closed form demographic model with changing vital rates. The hyperstable model replaces the strict stable population assumption of constant rates of fertility and mortality with weaker assumptions on the pattern of net maternity. Those alternative assumptions are a fixed
Serial Concatenation of Interleaved Codes: Performance Analysis, Design, and Iterative Decoding
 IEEE Trans. Inform. Theory
, 1996
"... A serially concatenated code with an interleaver consists of the cascade of an outer code... ..."
Abstract

Cited by 366 (32 self)
 Add to MetaCart
A serially concatenated code with an interleaver consists of the cascade of an outer code...
Hyperstable Polyphase Adaptive IIR Filters
 Proc. 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing
, 1999
"... This work considers the implementation of recursive identification algorithms based on hyperstability concepts with polyphase structures. It is shown that the SPR condition required for convergence of these schemes can always be met by using a sufficiently high polyphase expansion factor M.Foragive ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This work considers the implementation of recursive identification algorithms based on hyperstability concepts with polyphase structures. It is shown that the SPR condition required for convergence of these schemes can always be met by using a sufficiently high polyphase expansion factor M
Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes
, 1995
"... A parallel concatenated coding scheme consists of two simple constituent systematic encoders linked by an interleaver. The input bits to the first encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits to ..."
Abstract

Cited by 315 (6 self)
 Add to MetaCart
A parallel concatenated coding scheme consists of two simple constituent systematic encoders linked by an interleaver. The input bits to the first encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits to the first encoder followed by the parity check bits of both encoders. This construction can be generalized to any number of constituent codes. Parallel concatenated schemes employing two convolutional codes as constituent codes, in connection with an iterative decoding algorithm of complexity comparable to that of the constituent codes, have been recently shown to yield remarkable coding gains close to theoretical limits. They have been named, and are known as, "turbo codes". We propose a method to evaluate an upper bound to the bit error probability of a parallel concatenated coding scheme averaged over all interleavers of a given length. The analytical bounding technique is then used to s...
Generating Finite State Machines from Abstract State Machines
 in Proceedings of International Symposium on Software Testing and Analysis (ISSTA
, 2002
"... We give an algorithm that derives a finite state machine (FSM) from a given abstract state machine (ASM) specification. This allows us to integrate ASM specs with the existing tools for test case generation from FSMs. ASM specs are executable but have typically too many, often infinitely many states ..."
Abstract

Cited by 83 (22 self)
 Add to MetaCart
states. We group ASM states into finitely many hyperstates which are the nodes of the FSM. The links of the FSM are induced by the ASM state transitions.
Efficiency of simulation in monotone hyperstable queueing networks, in "Queueing Systems
, 2013
"... We consider Jackson queueing networks with finite buffer constraints (JQN) and analyze the efficiency of sampling from their stationary distribution. In the context of exact sampling, the monotonicity structure of JQNs ensures that such efficiency is of the order of the coupling time (or meeting tim ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
time) of two extremal sample paths. In the context of approximate sampling, it is given by the mixing time. Under a condition on the drift of the stochastic process underlying a JQN, which we call hyperstability, in our main result we show that the coupling time is polynomial in both the number
(will be inserted by the editor) HyperStable Social Welfare Functions
"... The date of receipt and acceptance will be inserted by the editor Abstract We introduce a new consistency condition for neutral social welfare functions, called hyper stability. A social welfare function α selects a complete weak order from a profile P of linear orders over any finite set of alterna ..."
Abstract
 Add to MetaCart
The date of receipt and acceptance will be inserted by the editor Abstract We introduce a new consistency condition for neutral social welfare functions, called hyper stability. A social welfare function α selects a complete weak order from a profile P of linear orders over any finite set of alternatives. Each linear order p in P generates a linear order over orders of alternatives,called hyperpreference, by means of a preference extension. Hence each profile P generates an hyperprofile P ̇. We assume that all preference extensions are separable: the hyperpreference of some order p ranks order q above order q ′ if the set of alternative pairs p and q agree on contains the one p and q ′ agree on. A special subclass of separable extensions contains all Kemeny extensions, which build hyperpreferences by using the Kemeny distance criterion. A social welfare function α is hyper stable (resp. Kemeny stable) if at any profile P, at least one linearization of α(P) is ranked first by α(P ̇), where P ̇ is any separable (resp. Kemeny) hyperprofile induced from P. We show that no scoring rule is hyper stable, and that no unanimous scoring rule is Kemeny stable, while there exists an hyper stable Condorcet social welfare function. Key words Hyperpreferences – Kemeny distance – Social Welfare Functions – Stability 1
Results 1  10
of
833