21 resultados para Overt Argument


Relevância:

10.00% 10.00%

Publicador:

Resumo:

The Girsanov linearization method (GLM), proposed earlier in Saha, N., and Roy, D., 2007, ``The Girsanov Linearisation Method for Stochastically Driven Nonlinear Oscillators,'' J. Appl. Mech., 74, pp. 885-897, is reformulated to arrive at a nearly exact, semianalytical, weak and explicit scheme for nonlinear mechanical oscillators under additive stochastic excitations. At the heart of the reformulated linearization is a temporally localized rejection sampling strategy that, combined with a resampling scheme, enables selecting from and appropriately modifying an ensemble of locally linearized trajectories while weakly applying the Girsanov correction (the Radon-Nikodym derivative) for the linearization errors. The semianalyticity is due to an explicit linearization of the nonlinear drift terms and it plays a crucial role in keeping the Radon-Nikodym derivative ``nearly bounded'' above by the inverse of the linearization time step (which means that only a subset of linearized trajectories with low, yet finite, probability exceeds this bound). Drift linearization is conveniently accomplished via the first few (lower order) terms in the associated stochastic (Ito) Taylor expansion to exclude (multiple) stochastic integrals from the numerical treatment. Similarly, the Radon-Nikodym derivative, which is a strictly positive, exponential (super-) martingale, is converted to a canonical form and evaluated over each time step without directly computing the stochastic integrals appearing in its argument. Through their numeric implementations for a few low-dimensional nonlinear oscillators, the proposed variants of the scheme, presently referred to as the Girsanov corrected linearization method (GCLM), are shown to exhibit remarkably higher numerical accuracy over a much larger range of the time step size than is possible with the local drift-linearization schemes on their own.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this paper, we revisit the combinatorial error model of Mazumdar et al. that models errors in high-density magnetic recording caused by lack of knowledge of grain boundaries in the recording medium. We present new upper bounds on the cardinality/rate of binary block codes that correct errors within this model. All our bounds, except for one, are obtained using combinatorial arguments based on hypergraph fractional coverings. The exception is a bound derived via an information-theoretic argument. Our bounds significantly improve upon existing bounds from the prior literature.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We prove that a proper holomorphic map between two nonplanar bounded symmetric domains of the same dimension, one of them being irreducible, is a biholomorphism. Our methods allow us to give a single, all-encompassing argument that unifies the various special cases in which this result is known. We discuss an application of these methods to domains having noncompact automorphism groups that are not assumed to act transitively.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We show that the upper bound for the central magnetic field of a super-Chandrasekhar white dwarf calculated by Nityananda and Konar Phys. Rev. D 89, 103017 (2014)] and in the concerned comment, by the same authors, against our work U. Das and B. Mukhopadhyay, Phys. Rev. D 86, 042001 (2012)] is erroneous. This in turn strengthens the argument in favor of the stability of the recently proposed magnetized super-Chandrasekhar white dwarfs. We also point out several other numerical errors in their work. Overall we conclude that the arguments put forth by Nityananda and Konar are misleading.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We evaluate the contribution of chiral fermions in d = 2, 4, 6, chiral bosons, a chiral gravitino like theory in d = 2 and chiral gravitinos in d = 6 to all the leading parity odd transport coefficients at one loop. This is done by using finite temperature field theory to evaluate the relevant Kubo formulae. For chiral fermions and chiral bosons the relation between the parity odd transport coefficient and the microscopic anomalies including gravitational anomalies agree with that found by using the general methods of hydrodynamics and the argument involving the consistency of the Euclidean vacuum. For the gravitino like theory in d = 2 and chiral gravitinos in d = 6, we show that relation between the pure gravitational anomaly and parity odd transport breaks down. From the perturbative calculation we clearly identify the terms that contribute to the anomaly polynomial, but not to the transport coefficient for gravitinos. We also develop a simple method for evaluating the angular integrals in the one loop diagrams involved in the Kubo formulae. Finally we show that charge diffusion mode of an ideal 2 dimensional Weyl gas in the presence of a finite chemical potential acquires a speed, which is equal to half the speed of light.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Boldyreva, Palacio and Warinschi introduced a multiple forking game as an extension of general forking. The notion of (multiple) forking is a useful abstraction from the actual simulation of cryptographic scheme to the adversary in a security reduction, and is achieved through the intermediary of a so-called wrapper algorithm. Multiple forking has turned out to be a useful tool in the security argument of several cryptographic protocols. However, a reduction employing multiple forking incurs a significant degradation of , where denotes the upper bound on the underlying random oracle calls and , the number of forkings. In this work we take a closer look at the reasons for the degradation with a tighter security bound in mind. We nail down the exact set of conditions for success in the multiple forking game. A careful analysis of the cryptographic schemes and corresponding security reduction employing multiple forking leads to the formulation of `dependence' and `independence' conditions pertaining to the output of the wrapper in different rounds. Based on the (in)dependence conditions we propose a general framework of multiple forking and a General Multiple Forking Lemma. Leveraging (in)dependence to the full allows us to improve the degradation factor in the multiple forking game by a factor of . By implication, the cost of a single forking involving two random oracles (augmented forking) matches that involving a single random oracle (elementary forking). Finally, we study the effect of these observations on the concrete security of existing schemes employing multiple forking. We conclude that by careful design of the protocol (and the wrapper in the security reduction) it is possible to harness our observations to the full extent.