Results 1  10
of
12,417
KodairaSpencer theory of gravity and exact results for quantum string amplitudes
 Commun. Math. Phys
, 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract

Cited by 540 (59 self)
 Add to MetaCart
We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a
EXACT EQUATIONS FOR VACUUM CORRELATORS IN FIELD THEORY
, 1995
"... Stochastic quantization is used to derive exact equations, connecting multilocal field correlators in the ϕ 3 theory and gluodynamics. Perturbative expansion of the obtained equations in the lowest orders is presented. 1 ..."
Abstract
 Add to MetaCart
Stochastic quantization is used to derive exact equations, connecting multilocal field correlators in the ϕ 3 theory and gluodynamics. Perturbative expansion of the obtained equations in the lowest orders is presented. 1
LINEAR ORBIT PARAMETERS FOR THE EXACT EQUATIONS OF MOTION⁄
"... This paper defines the beta function and other linear orbit parameters using the exact equations of motion. The fl, fi and ˆ functions are redefined using the exact equations. Expressions are found for the transfer matrix and the emittance. The differential equations for · D x=fl1=2 is found. New ..."
Abstract
 Add to MetaCart
This paper defines the beta function and other linear orbit parameters using the exact equations of motion. The fl, fi and ˆ functions are redefined using the exact equations. Expressions are found for the transfer matrix and the emittance. The differential equations for · D x=fl1=2 is found. New
Linear Orbit Parameters For The Exact Equations Of Motion
, 1994
"... This paper defines the beta function and other linear orbit parameters using the exact equations of motion. The #, # and # functions are redefined using the exact equations. Expressions are found for the transfer matrix and the emittance. The differential equations for # = x/# 1/2 is found. New ..."
Abstract
 Add to MetaCart
This paper defines the beta function and other linear orbit parameters using the exact equations of motion. The #, # and # functions are redefined using the exact equations. Expressions are found for the transfer matrix and the emittance. The differential equations for # = x/# 1/2 is found
Efficient exact stochastic simulation of chemical systems with many species and many channels
 J. Phys. Chem. A
, 2000
"... There are two fundamental ways to view coupled systems of chemical equations: as continuous, represented by differential equations whose variables are concentrations, or as discrete, represented by stochastic processes whose variables are numbers of molecules. Although the former is by far more comm ..."
Abstract

Cited by 427 (5 self)
 Add to MetaCart
simulation methods to simulate trajectories of discrete, stochastic systems, (methods that are rigorously equivalent to the Master Equation approach) but these do not scale well to systems with many reaction pathways. This paper presents the Next Reaction Method, an exact algorithm to simulate coupled
Approximate Riemann Solvers, Parameter Vectors, and Difference Schemes
 J. COMP. PHYS
, 1981
"... Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution ..."
Abstract

Cited by 1010 (2 self)
 Add to MetaCart
Several numerical schemes for the solution of hyperbolic conservation laws are based on exploiting the information obtained by considering a sequence of Riemann problems. It is argued that in existing schemes much of this information is degraded, and that only certain features of the exact solution
A comparative analysis of selection schemes used in genetic algorithms
 Foundations of Genetic Algorithms
, 1991
"... This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or «steady state") selection are compared on the basis of solutions to deterministic difference or d ..."
Abstract

Cited by 531 (31 self)
 Add to MetaCart
or differential equations, which are verified through computer simulations. The analysis provides convenient approximate or exact solutions as well as useful convergence time and growth ratio estimates. The paper recommends practical application of the analyses and suggests a number of paths for more detailed
The information bottleneck method
, 1999
"... We define the relevant information in a signal x ∈ X as being the information that this signal provides about another signal y ∈ Y. Examples include the information that face images provide about the names of the people portrayed, or the information that speech sounds provide about the words spoken. ..."
Abstract

Cited by 540 (35 self)
 Add to MetaCart
about Y through a ‘bottleneck ’ formed by a limited set of codewords ˜X. This constrained optimization problem can be seen as a generalization of rate distortion theory in which the distortion measure d(x, ˜x) emerges from the joint statistics of X and Y. This approach yields an exact set of self
Decoding by Linear Programming
, 2004
"... This paper considers the classical error correcting problem which is frequently discussed in coding theory. We wish to recover an input vector f ∈ Rn from corrupted measurements y = Af + e. Here, A is an m by n (coding) matrix and e is an arbitrary and unknown vector of errors. Is it possible to rec ..."
Abstract

Cited by 1399 (16 self)
 Add to MetaCart
to recover f exactly from the data y? We prove that under suitable conditions on the coding matrix A, the input f is the unique solution to the ℓ1minimization problem (‖x‖ℓ1:= i xi) min g∈R n ‖y − Ag‖ℓ1 provided that the support of the vector of errors is not too large, ‖e‖ℓ0: = {i: ei ̸= 0}  ≤ ρ · m
The theory of planned behavior
 Organizational Behavior and Human Decision Processes
, 1991
"... Research dealing with various aspects of * the theory of planned behavior (Ajzen, 1985, 1987) is reviewed, and some unresolved issues are discussed. In broad terms, the theory is found to be well supported by empirical evidence. Intentions to perform behaviors of different kinds can be predicted wit ..."
Abstract

Cited by 2754 (9 self)
 Add to MetaCart
to be related to appropriate sets of salient behavioral, normative, and control beliefs about the behavior, but the exact nature of these relations is still uncertain. Expectancy — value formulations are found to be only partly successful in dealing with these relations. Optimal rescaling of expectancy
Results 1  10
of
12,417