914 resultados para Perfect codes


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The exhibition investigates the unrepresentable and considers the distinct ways invisible forces can be given visual manifestation through painted images.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In cooperative communication networks, owing to the nodes' arbitrary geographical locations and individual oscillators, the system is fundamentally asynchronous. Such a timing mismatch may cause rank deficiency of the conventional space-time codes and, thus, performance degradation. One efficient way to overcome such an issue is the delay-tolerant space-time codes (DT-STCs). The existing DT-STCs are designed assuming that the transmitter has no knowledge about the channels. In this paper, we show how the performance of DT-STCs can be improved by utilizing some feedback information. A general framework for designing DT-STC with limited feedback is first proposed, allowing for flexible system parameters such as the number of transmit/receive antennas, modulated symbols, and the length of codewords. Then, a new design method is proposed by combining Lloyd's algorithm and the stochastic gradient-descent algorithm to obtain optimal codebook of STCs, particularly for systems with linear minimum-mean-square-error receiver. Finally, simulation results confirm the performance of the newly designed DT-STCs with limited feedback.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This chapter examines the role of translation in the work of the Indian Mail Censorship Department in France in the First World War, considering the position of the translator as an intermediary figure, and the implications for the military tasks of censorship and intelligence analysis of operating in this way from a foreign language.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Initialising the ocean internal variability for decadal predictability studies is a new area of research and a variety of ad hoc methods are currently proposed. In this study, we explore how nudging with sea surface temperature (SST) and salinity (SSS) can reconstruct the three-dimensional variability of the ocean in a perfect model framework. This approach builds on the hypothesis that oceanic processes themselves will transport the surface information into the ocean interior as seen in ocean-only simulations. Five nudged simulations are designed to reconstruct a 150 years “target” simulation, defined as a portion of a long control simulation. The nudged simulations differ by the variables restored to, SST or SST + SSS, and by the area where the nudging is applied. The strength of the heat flux feedback is diagnosed from observations and the restoring coefficients for SSS use the same time-scale. We observed that this choice prevents spurious convection at high latitudes and near sea-ice border when nudging both SST and SSS. In the tropics, nudging the SST is enough to reconstruct the tropical atmosphere circulation and the associated dynamical and thermodynamical impacts on the underlying ocean. In the tropical Pacific Ocean, the profiles for temperature show a significant correlation from the surface down to 2,000 m, due to dynamical adjustment of the isopycnals. At mid-to-high latitudes, SSS nudging is required to reconstruct both the temperature and the salinity below the seasonal thermocline. This is particularly true in the North Atlantic where adding SSS nudging enables to reconstruct the deep convection regions of the target. By initiating a previously documented 20-year cycle of the model, the SST + SSS nudging is also able to reproduce most of the AMOC variations, a key source of decadal predictability. Reconstruction at depth does not significantly improve with amount of time spent nudging and the efficiency of the surface nudging rather depends on the period/events considered. The joint SST + SSS nudging applied everywhere is the most efficient approach. It ensures that the right water masses are formed at the right surface density, the subsequent circulation, subduction and deep convection further transporting them at depth. The results of this study underline the potential key role of SSS for decadal predictability and further make the case for sustained large-scale observations of this field.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present a technique to build, within a dissipative bosonic network, decoherence-free channels (DFCs): a group of normal-mode oscillators with null effective damping rates. We verify that the states protected within the DFC define the well-known decoherence-free subspaces (DFSs) when mapped back into the natural network oscillators. Therefore, our technique to build protected normal-mode channels turns out to be an alternative way to build DFSs, which offers advantages over the conventional method. It enables the computation of all the network-protected states at once, as well as leading naturally to the concept of the decoherence quasi-free subspace (DQFS), inside which a superposition state is quasi-completely protected against decoherence. The concept of the DQFS, weaker than that of the DFS, may provide a more manageable mechanism to control decoherence. Finally, as an application of the DQFSs, we show how to build them for quasi-perfect state transfer in networks of coupled quantum dissipative oscillators.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Structured meaning-signal mappings, i.e., mappings that preserve neighborhood relationships by associating similar signals with similar meanings, are advantageous in an environment where signals are corrupted by noise and sub-optimal meaning inferences are rewarded as well. The evolution of these mappings, however, cannot be explained within a traditional language evolutionary game scenario in which individuals meet randomly because the evolutionary dynamics is trapped in local maxima that do not reflect the structure of the meaning and signal spaces. Here we use a simple game theoretical model to show analytically that when individuals adopting the same communication code meet more frequently than individuals using different codes-a result of the spatial organization of the population-then advantageous linguistic innovations can spread and take over the population. In addition, we report results of simulations in which an individual can communicate only with its K nearest neighbors and show that the probability that the lineage of a mutant that uses a more efficient communication code becomes fixed decreases exponentially with increasing K. These findings support the mother tongue hypothesis that human language evolved as a communication system used among kin, especially between mothers and offspring.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we propose a scheme for quasi-perfect state transfer in a network of dissipative harmonic oscillators. We consider ideal sender and receiver oscillators connected by a chain of nonideal transmitter oscillators coupled by nearest-neighbour resonances. From the algebraic properties of the dynamical quantities describing the evolution of the network state, we derive a criterion, fixing the coupling strengths between all the oscillators, apart from their natural frequencies, enabling perfect state transfer in the particular case of ideal transmitter oscillators. Our criterion provides an easily manipulated formula enabling perfect state transfer in the special case where the network nonidealities are disregarded. We also extend such a criterion to dissipative networks where the fidelity of the transferred state decreases due to the loss mechanisms. To circumvent almost completely the adverse effect of decoherence, we propose a protocol to achieve quasi-perfect state transfer in nonideal networks. By adjusting the common frequency of the sender and the receiver oscillators to be out of resonance with that of the transmitters, we demonstrate that the sender`s state tunnels to the receiver oscillator by virtually exciting the nonideal transmitter chain. This virtual process makes negligible the decay rate associated with the transmitter line at the expense of delaying the time interval for the state transfer process. Apart from our analytical results, numerical computations are presented to illustrate our protocol.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We explicitly construct a stationary coupling attaining Ornstein`s (d) over bar -distance between ordered pairs of binary chains of infinite order. Our main tool is a representation of the transition probabilities of the coupled bivariate chain of infinite order as a countable mixture of Markov transition probabilities of increasing order. Under suitable conditions on the loss of memory of the chains, this representation implies that the coupled chain can be represented as a concatenation of i.i.d. sequences of bivariate finite random strings of symbols. The perfect simulation algorithm is based on the fact that we can identify the first regeneration point to the left of the origin almost surely.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Prosodic /template Morphology, that "draws heavily on the theoretical apparatus and formalisms of the generative phonology model known as autosegmental phonology" (Katamba, F. 1993: 154), is the best analysis that can handle Arabic morphology. Verbs in Arabic are represented on three independent tiers: root tier, the skeletal tier and the vocalic melody tier (Katamba, F. 1993). Vowel morphemes, which are represented by diacritics, are inserted within the consonant morphemes, which are represented by primary symbols, to form words. The morpheme tier hypothesis paves the way to understand the nonconcatenative Arabic morphology. This paper analyzes gender in perfect active and passive 3rd person singular verbs on the basis of PM. The focus of the analysis shall be drawn heavily on the most common Arabic verbs; triconsonantal verbs, with brief introduction of the less common verbs; quadriconsonantal perfect active and passive masculine and feminine 3rd person singular verbs. I shall, too, cast the light on some vowel changes that some verbs undergo when voice changes.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Woodworking industries still consists of wood dust problems. Young workers are especially vulnerable to safety risks. To reduce risks, it is important to change attitudes and increase knowledge about safety. Safety training have shown to establish positive attitudes towards safety among employees. The aim of current study is to analyze the effect of QR codes that link to Picture Mix EXposure (PIMEX) videos by analyzing attitudes to this safety training method and safety in student responses. Safety training videos were used in upper secondary school handicraft programs to demonstrate wood dust risks and methods to decrease exposure to wood dust. A preliminary study was conducted to investigate improvement of safety training in two schools in preparation for the main study that investigated a safety training method in three schools. In the preliminary study the PIMEX method was first used in which students were filmed while wood dust exposure was measured and subsequently displayed on a computer screen in real time. Before and after the filming, teachers, students, and researchers together analyzed wood dust risks and effective measures to reduce exposure to them. For the main study, QR codes linked to PIMEX videos were attached at wood processing machines. Subsequent interviews showed that this safety training method enables students in an early stage of their life to learn about risks and safety measures to control wood dust exposure. The new combination of methods can create awareness, change attitudes and motivation among students to work more frequently to reduce wood dust. 

Relevância:

20.00% 20.00%

Publicador:

Resumo:

If you’ve made it this far—and I’m sure many of you have—then you know what this article is about: QR codes, or Quick Response codes (also referred to, though less frequently, as mobile codes 2d barcodes, or 2d codes). QRs are not new by any stretch of the imagination. In fact, they’ve been around for about a decade and a half.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We define a subgame perfect Nash equilibrium under Knightian uncertainty for two players, by means of a recursive backward induction procedure. We prove an extension of the Zermelo-von Neumann-Kuhn Theorem for games of perfect information, i. e., that the recursive procedure generates a Nash equilibrium under uncertainty (Dow and Werlang(1994)) of the whole game. We apply the notion for two well known games: the chain store and the centipede. On the one hand, we show that subgame perfection under Knightian uncertainty explains the chain store paradox in a one shot version. On the other hand, we show that subgame perfection under uncertainty does not account for the leaving behavior observed in the centipede game. This is in contrast to Dow, Orioli and Werlang(1996) where we explain by means of Nash equilibria under uncertainty (but not subgame perfect) the experiments of McKelvey and Palfrey(1992). Finally, we show that there may be nontrivial subgame perfect equilibria under uncertainty in more complex extensive form games, as in the case of the finitely repeated prisoner's dilemma, which accounts for cooperation in early stages of the game.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We show that Judd (1982)’s method can be applied to any finite system, contrary to what he claimed in 1987. An example shows how to employ the technic to study monetary models in presence of capital accumulation.