Search results for "Parameterized complexity"
showing 7 items of 27 documents
Bifurcations of phase portraits of a Singular Nonlinear Equation of the Second Class
2014
Abstract The soliton dynamics is studied using the Frenkel Kontorova (FK) model with non-convex interparticle interactions immersed in a parameterized on-site substrate potential. The case of a deformable substrate potential allows theoretical adaptation of the model to various physical situations. Non-convex interactions in lattice systems lead to a number of interesting phenomena that cannot be produced with linear coupling alone. In the continuum limit for such a model, the particles are governed by a Singular Nonlinear Equation of the Second Class. The dynamical behavior of traveling wave solutions is studied by using the theory of bifurcations of dynamical systems. Under different para…
Low-energy constants from resonance chiral theory
2008
I discuss the recent attempts to build an effective chiral Lagrangian incorporating massive resonance states. A useful approximation scheme to organize the resonance Lagrangian is provided by the large-Nc limit of QCD. Integrating out the resonance fields, one recovers the usual chiral perturbation theory Lagrangian with explicit values for the low-energy constants, parameterized in terms of resonance masses and couplings. The resonance chiral theory generates Green functions that interpolate between QCD and chiral perturbation theory. Analyzing these Green functions, both for large and small momenta, one gets QCD constraints on the resonance couplings and, therefore, information on the low…
Recent Type II Radio Supernovae
2007
We present the results of radio observations, taken primarily with the Very Large Array, of Supernovae 1993J, 2001gd, 2001em, 2002hh, 2004dj, and 2004et. We have fit a parameterized model to the multi-frequency observations of each supernova. We compare the observed and derived radio properties of these supernovae by optical classification and discuss the implications.
Partitionability, coverability and colorability in graphs
2014
Our research are about graph coloring with distance constraints (packing coloring) or neighborhood constraints (Grundy coloring). Let S={si| i in N*} be a non decreasing sequence of integers. An S-packing coloring is a proper coloring such that every set of color i is an si-packing (a set of vertices at pairwise distance greater than si). A graph G is (s1,... ,sk)-colorable if there exists a packing coloring of G with colors 1,... ,k. A Grundy coloring is a proper vertex coloring such that for every vertex of color i, u is adjacent to a vertex of color j, for each ji. These results allow us to determine S-packing coloring of these lattices for several sequences of integers. We examine a cla…
Block-Based Inversion of the Heat Equations
2014
This chapter presents robust methods, which refine the algorithms, in Sect. 7.2, for inversion of the heat equations. The idea behind the algorithms is to solve the inversion problem separately in different frequency bands. This is achieved by using spline wavelet packets. The solutions that minimize some parameterized quadratic functionals, are derived as linear combinations of the wavelet packets. Choice of parameters, which is performed automatically, determines the trade-off between the solution regularity and the initial data approximation. The Spline Harmonic Analysis (SHA) technique provides a unified computational scheme for the fast implementation of the algorithm and an explicit r…
Neural Network Based Finite-Time Stabilization for Discrete-Time Markov Jump Nonlinear Systems with Time Delays
2013
Published version of an article in the journal: Abstract and Applied Analysis. Also available from the publisher at: http://dx.doi.org/10.1155/2013/359265 Open Access This paper deals with the finite-time stabilization problem for discrete-time Markov jump nonlinear systems with time delays and norm-bounded exogenous disturbance. The nonlinearities in different jump modes are parameterized by neural networks. Subsequently, a linear difference inclusion state space representation for a class of neural networks is established. Based on this, sufficient conditions are derived in terms of linear matrix inequalities to guarantee stochastic finite-time boundedness and stochastic finite-time stabi…
Optimal Hedging of Option Portfolios with Transaction Costs
2006
One of the most successful approaches to option hedging with transaction costs is the utility based approach pioneered by Hodges and Neuberger (1989). However, this approach has one major drawback that prevents the broad application of this approach in practice: the lack of a closed-form solution. The direct numerical computations of the utility based hedging strategy are cumbersome in a practical implementation. Despite some recent advances in finding an explicit description of the utility based hedging strategy by using either asymptotic, approximation, or other methods, so far they were concerned primarily with hedging a single plain-vanilla option. However, in practice one often faces t…