Results 1  10
of
14,656
The Cyclicity of Period Annulus of Degenerate Quadratic Hamiltonian System with Elliptic Segment
"... We study the cyclicity of period annuli (or annulus) for general degenerate quadratic Hamiltonian systems with an elliptic segment or a saddle loop, under quadratic perturbations. By using geometrical arguments and studying the respective Abelian integral based on the PicardFuchs equation, it is sh ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We study the cyclicity of period annuli (or annulus) for general degenerate quadratic Hamiltonian systems with an elliptic segment or a saddle loop, under quadratic perturbations. By using geometrical arguments and studying the respective Abelian integral based on the PicardFuchs equation
PATHINTEGRAL FOR QUADRATIC HAMILTONIAN SYSTEMS AND BOUNDARY CONDITIONS
, 1998
"... A pathintegral representation for the kernel of the evolution operator of general Hamiltonian systems is reviewed. We study the models with bosonic and fermionic degrees of freedom. A general scheme for introducing boundary conditions in the pathintegral is given. We calculate the pathintegral fo ..."
Abstract
 Add to MetaCart
integral for the systems with quadratic first class constraints and present an explicit formula for the heat kernel (HK) in this case. These results may be applied to many quantum systems which can be reduced to the Hamiltonian systems with quadratic constraints (confined quarks, Calogero type models, string and p
Secondorder analysis in polynomially perturbed reversible quadratic Hamiltonian systems
, 1999
"... Abstract. We study degree n polynomial perturbations of quadratic reversible Hamiltonian vector fields with one center and one saddle point. It was recently proved that if the first Poincaré–Pontryagin integral is not identically zero, then the exact upper bound for the number of limit cycles on th ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We study degree n polynomial perturbations of quadratic reversible Hamiltonian vector fields with one center and one saddle point. It was recently proved that if the first Poincaré–Pontryagin integral is not identically zero, then the exact upper bound for the number of limit cycles
The cyclicity of the period annulus of the quadratic Hamiltonian systems with nonMorsean point
 J. Differential Equations
"... ar ..."
The knowledge complexity of interactive proof systems

, 1989
"... Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/nonHamiltonian. In th ..."
Abstract

Cited by 1246 (39 self)
 Add to MetaCart
Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/nonHamiltonian
The Ant System: Optimization by a colony of cooperating agents
 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICSPART B
, 1996
"... An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call Ant System. We propose it as a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed computation ..."
Abstract

Cited by 1300 (46 self)
 Add to MetaCart
An analogy with the way ant colonies function has suggested the definition of a new computational paradigm, which we call Ant System. We propose it as a viable new approach to stochastic combinatorial optimization. The main characteristics of this model are positive feedback, distributed
Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems
 IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING
, 2007
"... Many problems in signal processing and statistical inference involve finding sparse solutions to underdetermined, or illconditioned, linear systems of equations. A standard approach consists in minimizing an objective function which includes a quadratic (squared ℓ2) error term combined with a spa ..."
Abstract

Cited by 539 (17 self)
 Add to MetaCart
Many problems in signal processing and statistical inference involve finding sparse solutions to underdetermined, or illconditioned, linear systems of equations. A standard approach consists in minimizing an objective function which includes a quadratic (squared ℓ2) error term combined with a
New results in linear filtering and prediction theory
 TRANS. ASME, SER. D, J. BASIC ENG
, 1961
"... A nonlinear differential equation of the Riccati type is derived for the covariance matrix of the optimal filtering error. The solution of this "variance equation " completely specifies the optimal filter for either finite or infinite smoothing intervals and stationary or nonstationary sta ..."
Abstract

Cited by 607 (0 self)
 Add to MetaCart
statistics. The variance equation is closely related to the Hamiltonian (canonical) differential equations of the calculus of variations. Analytic solutions are available in some cases. The significance of the variance equation is illustrated by examples which duplicate, simplify, or extend earlier results
Type IIB GreenSchwarz superstring in plane wave RamondRamond background
 Nucl. Phys. B
"... We construct the covariant κsymmetric superstring action for type IIB superstring on plane wave space supported by RamondRamond background. The action is defined as a 2d sigmamodel on the coset superspace. We fix the fermionic and bosonic lightcone gauges in the covariant GreenSchwarz superstri ..."
Abstract

Cited by 476 (0 self)
 Add to MetaCart
Schwarz superstring action and find the lightcone string Lagrangian and the Hamiltonian. The resulting lightcone gauge action is quadratic in both the bosonic and fermionic superstring 2d fields, and therefore, this model can be explicitly quantized. We also obtain a realization of the generators of the basic
Propagation of Trust and Distrust
, 2004
"... A network of people connected by directed ratings or trust scores, and a model for propagating those trust scores, is a fundamental building block in many of today's most successful ecommerce and recommendation systems. In eBay, such a model of trust has significant influence on the price an i ..."
Abstract

Cited by 439 (1 self)
 Add to MetaCart
, and evaluate the schemes on a large trust network consisting of 800K trust scores expressed among 130K people. We show that a small number of expressed trusts/distrust per individual allows us to predict reliably trust between any two people in the system with high accuracy: a quadratic increase in actionable
Results 1  10
of
14,656