Multimode and multistate ladder oscillator and frequency recognition device

A ladder oscillator composed of capacitive and inductive impedances connected together to form a ladder network which has a chosen number N oscillation modes at N different frequencies. Each oscillation mode is characterized by a unique standing wave voltage pattern along the nodes of the ladder oscillator, with the mode in which the ladder oscillator is oscillating being determinable from the amplitudes or phase of the oscillations at the nodes. A logic circuit may be connected to the nodes of the oscillator to compare the phases of selected nodes and thereby determine which mode the oscillator is oscillating in. A ladder oscillator composed of passive capacitive and inductive impedances can be utilized as a frequency recognition device, since the passive ladder oscillator will display the characteristic standing wave patterns if an input signal impressed upon the ladder oscillator is close to one of the mode frequencies of the oscillator. A CL ladder oscillator having series capacitive impedances and shunt inductive impedances can exhibit sustained and autonomous oscillations if active nonlinear devices are connected in parallel with the shunt inductive impedances. The active CL ladder oscillator can be synchronized to input frequencies impressed upon the oscillator, and will continue to oscillate after the input signal has been removed at a mode frequency which is, in general, nearest to the input signal frequency. Autonomous oscillations may also be obtained as desired from the active CL ladder oscillator at the mode frequencies

One-dimensional multimode and multistate oscillator: A concept

Device's voltage amplitude distribution is similar to that of standing waves on transmission line. It can be used for fast, efficient information encoding, decoding, and memory. Device operates in response to brief tone burst setting up standing-wave mode of oscillation which is unique for each possible burst frequency

Algorithmic Bayesian Persuasion

Persuasion, defined as the act of exploiting an informational advantage in order to effect the decisions of others, is ubiquitous. Indeed, persuasive communication has been estimated to account for almost a third of all economic activity in the US. This paper examines persuasion through a computational lens, focusing on what is perhaps the most basic and fundamental model in this space: the celebrated Bayesian persuasion model of Kamenica and Gentzkow. Here there are two players, a sender and a receiver. The receiver must take one of a number of actions with a-priori unknown payoff, and the sender has access to additional information regarding the payoffs. The sender can commit to revealing a noisy signal regarding the realization of the payoffs of various actions, and would like to do so as to maximize her own payoff assuming a perfectly rational receiver. We examine the sender's optimization task in three of the most natural input models for this problem, and essentially pin down its computational complexity in each. When the payoff distributions of the different actions are i.i.d. and given explicitly, we exhibit a polynomial-time (exact) algorithm, and a "simple" $(1-1/e)$-approximation algorithm. Our optimal scheme for the i.i.d. setting involves an analogy to auction theory, and makes use of Border's characterization of the space of reduced-forms for single-item auctions. When action payoffs are independent but non-identical with marginal distributions given explicitly, we show that it is #P-hard to compute the optimal expected sender utility. Finally, we consider a general (possibly correlated) joint distribution of action payoffs presented by a black box sampling oracle, and exhibit a fully polynomial-time approximation scheme (FPTAS) with a bi-criteria guarantee. We show that this result is the best possible in the black-box model for information-theoretic reasons

When Can Limited Randomness Be Used in Repeated Games?

The central result of classical game theory states that every finite normal form game has a Nash equilibrium, provided that players are allowed to use randomized (mixed) strategies. However, in practice, humans are known to be bad at generating random-like sequences, and true random bits may be unavailable. Even if the players have access to enough random bits for a single instance of the game their randomness might be insufficient if the game is played many times. In this work, we ask whether randomness is necessary for equilibria to exist in finitely repeated games. We show that for a large class of games containing arbitrary two-player zero-sum games, approximate Nash equilibria of the $n$-stage repeated version of the game exist if and only if both players have $\Omega(n)$ random bits. In contrast, we show that there exists a class of games for which no equilibrium exists in pure strategies, yet the $n$-stage repeated version of the game has an exact Nash equilibrium in which each player uses only a constant number of random bits. When the players are assumed to be computationally bounded, if cryptographic pseudorandom generators (or, equivalently, one-way functions) exist, then the players can base their strategies on "random-like" sequences derived from only a small number of truly random bits. We show that, in contrast, in repeated two-player zero-sum games, if pseudorandom generators \emph{do not} exist, then $\Omega(n)$ random bits remain necessary for equilibria to exist

Creation of ventricular septal defects on the beating heart in a new pig model

Background/ Aims: So far, surgical and interventional therapies for muscular ventricular septal defects ( mVSDs) beyond the moderator band have had their limitations. Thus, alternative therapeutic strategies should be developed. We present a new animal model for the evaluation of such strategies. Methods: In a pig model ( n = 9), anterolateral thoracotomy was performed for exposure of the left ventricle. mVSDs were created under two- and three- dimensional echocardiography with a 7.5- mm sharp punch instrument, which was forwarded via a left ventricular puncture without extracorporeal circulation. Results: Creation of mVSDs was successful in all animals ( n = 9) confirmed by echocardiography, hemodynamic measurements and autopsy. The defects were located in the midmuscular ( n = 4), apical ( n = 1), inlet ( n = 2) and anterior part ( n = 2) of the muscular septum. All animals were hemodynamically stable for further procedures. The diameter and shunt volume of the mVSDs were 4.8 - 7.3 mm ( mean: 5.9 mm) and 12.9 - 41.3% ( mean: 22.1%), respectively. Autopsy confirmed in all animals the creation of a substantial defect. Conclusion: The described new technique for creation of an mVSD on the beating heart in a pig model is suitable for the evaluation of new therapeutic strategies for mVSD closure. Copyright (C) 2008 S. Karger AG, Basel

A parameterized halting problem, the linear time hierarchy, and the MRDP theorem

The complexity of the parameterized halting problem for nondeterministic Turing machines p-Halt is known to be related to the question of whether there are logics capturing various complexity classes [10]. Among others, if p-Halt is in para-AC0, the parameterized version of the circuit complexity class AC0, then AC0, or equivalently, (+, x)-invariant FO, has a logic. Although it is widely believed that p-Halt ∉. para-AC0, we show that the problem is hard to settle by establishing a connection to the question in classical complexity of whether NE ⊈ LINH. Here, LINH denotes the linear time hierarchy. On the other hand, we suggest an approach toward proving NE ⊈ LINH using bounded arithmetic. More specifically, we demonstrate that if the much celebrated MRDP (for Matiyasevich-Robinson-Davis-Putnam) theorem can be proved in a certain fragment of arithmetic, then NE ⊈ LINH. Interestingly, central to this result is a para-AC0 lower bound for the parameterized model-checking problem for FO on arithmetical structures.Peer ReviewedPostprint (author's final draft

Acculturation Timing among Newcomer and more Experienced Immigrant Youth: The Role of Language Use in Ethnic Friendship Homophily

The usage of the new language is a crucial aspect in immigrant youth adaptation. However, despite substantial inter- and intraindividual variability and dynamic changes, language usage has been studied primarily with a focus on static interindividual differences. This study utilized a recently introduced Temporal Model of Acculturative Change to test associations between language acquisition and friendship homophily. More specifically, three concepts were tested: pace (individual rate of change), relative timing (the deviation from peers with similar length of residence), and transition timing (preparedness for the relocation). Data comprised a three-wave-longitudinal sample of 820 ethnic German adolescents from Eastern European States who immigrated to Germany (Mage = 16.1, 57% girls). Results revealed, particularly among recent immigrant adolescents, that transition timing predicted earlier relative acculturation timing in language usage and that early relative timing in language usage predicted levels and change rates in friendship homophily (over and above acculturation pace and the actual level of language usage). Findings highlight the need to better understand the dynamics in acculturation processes of immigrant youth

Anharmonicities of giant dipole excitations

The role of anharmonic effects on the excitation of the double giant dipole resonance is investigated in a simple macroscopic model.Perturbation theory is used to find energies and wave functions of the anharmonic ascillator.The cross sections for the electromagnetic excitation of the one- and two-phonon giant dipole resonances in energetic heavy-ion collisions are then evaluated through a semiclassical coupled-channel calculation.It is argued that the variations of the strength of the anharmonic potential should be combined with appropriate changes in the oscillator frequency,in order to keep the giant dipole resonance energy consistent with the experimental value.When this is taken into account,the effects of anharmonicities on the double giant dipole resonance excitation probabilities are small and cannot account for the well-known discrepancy between theory and experiment

Shared Information -- New Insights and Problems in Decomposing Information in Complex Systems

How can the information that a set ${X_{1},...,X_{n}}$ of random variables contains about another random variable $S$ be decomposed? To what extent do different subgroups provide the same, i.e. shared or redundant, information, carry unique information or interact for the emergence of synergistic information? Recently Williams and Beer proposed such a decomposition based on natural properties for shared information. While these properties fix the structure of the decomposition, they do not uniquely specify the values of the different terms. Therefore, we investigate additional properties such as strong symmetry and left monotonicity. We find that strong symmetry is incompatible with the properties proposed by Williams and Beer. Although left monotonicity is a very natural property for an information measure it is not fulfilled by any of the proposed measures. We also study a geometric framework for information decompositions and ask whether it is possible to represent shared information by a family of posterior distributions. Finally, we draw connections to the notions of shared knowledge and common knowledge in game theory. While many people believe that independent variables cannot share information, we show that in game theory independent agents can have shared knowledge, but not common knowledge. We conclude that intuition and heuristic arguments do not suffice when arguing about information.Comment: 20 page