Imkeller, Peter; Richter, Anja
2009-01-01
In this paper we consider a class of BSDE with drivers of quadratic growth, on a stochastic basis generated by continuous local martingales. We first derive the Markov property of a forward-backward system (FBSDE) if the generating martingale is a strong Markov process. Then we establish the differentiability of a FBSDE with respect to the initial value of its forward component. This enables us to obtain the main result of this article which from the perspective of a utility optimization interpretation of the underlying control problem on a financial market takes the following form. The control process of the BSDE steers the system into a random liability depending on a market external uncertainty and this way describes the optimal derivative hedge of the liability by investment in a capital market the dynamics of which is described by the forward component. This delta hedge is described in a key formula in terms of a derivative functional of the solution process and the correlation structure of the internal ...
SOLUTION TO BSDE WITH NONHOMOGENEOUS JUMPS UNDER LOCALLY LIPSCHITZIAN CONDITION
Institute of Scientific and Technical Information of China (English)
无
2008-01-01
In this paper, we investigate the existence and uniqueness of the solution to a quasilinear backward stochastic differential equation with Poisson jumps. By introducing a series of approximate equations, we can show that BSDE has a unique adapted solution.
Frequency comb generation in quadratic nonlinear media
Ricciardi, Iolanda; Parisi, Maria; Maddaloni, Pasquale; Santamaria, Luigi; De Natale, Paolo; De Rosa, Maurizio
2014-01-01
Optical frequency combs are nowadays routinely used tools in a wide range of scientific and technological applications. Different techniques have been developed for generating optical frequency combs, like mode-locking in lasers and third-order interactions in microresonators, or to extend their spectral capabilities, using frequency conversion processes in nonlinear materials. Here, we experimentally demonstrate and theoretically explain the onset of optical frequency combs in a simple cavity-enhanced second-harmonic-generation system, exploiting second-order nonlinear interactions. We develop an elemental model which provides a deep physical insight into the observed dynamics. Moreover, despite the different underlying physical mechanism, the proposed model is remarkably similar to the description of third-order effects in microresonators, revealing a potential variety of new effects to be explored. Finally, exploiting a nonlinearity intrinsically stronger than the third-order one, our work lays the groundw...
Quadratic controller syntheses for the steam generator water level
Energy Technology Data Exchange (ETDEWEB)
Arzelier, D.; Daafouz, J.; Bernussou, J.; Garcia, G
1998-06-01
The steam generator water level, (SGWL), control problem in the pressurized water reactor of a nuclear power plant is considered from robust control techniques point of view. The plant is a time-varying system with a non minimum phase behavior and an unstable open-loop response. The time-varying nature of the plant due to change in operating power is taken into account by including slowly time-varying uncertainty in the model. A linear Time-Invariant, (LTI) guaranteed cost quadratic stabilizing controller is designed in order to address some of the particular issues arising for such a control problem. (author) 17 refs.
A Synchronous Stream Cipher Generator Based on Quadratic Fields (SSCQF
Directory of Open Access Journals (Sweden)
Younes ASIMI
2015-12-01
Full Text Available In this paper, we propose a new synchronous stream cipher called SSCQF whose secret-key is Ks=(z1,...zn where zi is a positive integer. Let d1, d2,..., dN be N positive integers in {0,1,...2m -1} such that di=zi mod2m with m and m>=8. Our purpose is to combine a linear feedback shift registers LFSRs, the arithmetic of quadratic fields: more precisely the unit group of quadratic fields, and Boolean functions [14]. Encryption and decryption are done by XRO`ing the output pseudorandom number generator with the plaintext and ciphertext respectively. The basic ingredients of this proposal stream generator SSCQF rely on the three following processes: In process I , we constructed the initial vectors IV={X1,...,Xn} from the secret-key Ks=(z1,...zn by using the fundamental unit of Q( Nvdi if di is a square free integer otherwise by splitting di, and in process II, we regenerate, from the vectors Xi, the vectors Yi having the same length L, that is divisible by 8 (equations (2 and (3 . In process III , for each Yi , we assign L/8 linear feedback shift registers, each of length eight. We then obtain N x L/8 linear feedback shift registers that are initialized by the binary sequence regenerated by process II , filtered by primitive polynomials, and the combine the binary sequence output with L/8 Boolean functions. The keystream generator, denoted K , is a concatenation of the output binary sequences of all Boolean functions.
Trajectory generation for manipulators using linear quadratic optimal tracking
Directory of Open Access Journals (Sweden)
Olav Egeland
1989-04-01
Full Text Available The reference trajectory is normally known in advance in manipulator control which makes it possible to apply linear quadratic optimal tracking. This gives a control system which rounds corners and generates optimal feedforward. The method may be used for references consisting of straight-line segments as an alternative to the two-step method of using splines to smooth the reference and then applying feedforward. In addition, the method can be used for more complex trajectories. The actual dynamics of the manipulator are taken into account, and this results in smooth and accurate tracking. The method has been applied in combination with the computed torque technique and excellent performance was demonstrated in a simulation study. The method has also been applied experimentally to an industrial spray-painting robot where a saw-tooth reference was tracked. The corner was rounded extremely well, and the steady-state tracking error was eliminated by the optimal feedforward.
Exact solutions to quadratic gravity generated by a conformal method
Pravda, Vojtech; Podolsky, Jiri; Svarc, Robert
2016-01-01
We study the role of conformal transformations in constructing vacuum solutions to quadratic gravity. We find that such solutions can be obtained by solving one non-linear partial differential equation for the conformal factor on any Einstein spacetime or, more generally, on any background with vanishing Bach tensor. We show that all spacetimes conformal to Kundt are either Kundt or Robinson--Trautmann, and we provide explicit Kundt and Robinson--Trautman solutions to quadratic gravity by solving the above mentioned equation on certain Kundt backgrounds.
A novel four-wing chaotic attractor generated from a three-dimensional quadratic autonomous system
Institute of Scientific and Technical Information of China (English)
Dong En-Zeng; Chen Zai-Ping; Chen Zeng-Qiang; Yuan Zhu-Zhi
2009-01-01
This paper presents a new 3D quadratic autonomous chaotic system which contains five system parameters and three quadratic cross-product terms, and the system can generate a single four-wing chaotic attractor with wide parameter ranges. Through theoretical analysis, the Hopf bifurcation processes are proved to arise at certain equilibrium points. Numerical bifurcation analysis shows that the system has many interesting complex dynamical behaviours; the system trajectory can evolve to a chaotic attractor from a periodic orbit or a fixed point as the proper parameter varies.Finally, an analog electronic circuit is designed to physically realize the chaotic system; the existence of four-wing chaotic attractor is verified by the analog circuit realization.
Efficient supercontinuum generation in quadratic nonlinear waveguides without quasi-phase matching
Guo, Hairun; Steinert, Michael; Setzpfandt, Frank; Pertsch, Thomas; Chung, Hung-ping; Chen, Yen-Hung; Bache, Morten
2014-01-01
Efficient supercontinuum generation (SCG) requires excitation of solitons at the pump laser wavelength. Quadratic nonlinear waveguides may support an effective self-defocusing nonlinearity so solitons can directly be generated at common ultrafast laser wavelengths without any waveguide dispersion engineering. We here experimentally demonstrate efficient SCG in a standard lithium niobate (LN) waveguide without using quasi-phase matching (QPM). By using femtosecond pumps with wavelengths in the $1.25-1.5 \\mu\\rm m$ range, where LN has normal dispersion and thus supports self-defocusing solitons, octave-spanning SCG is observed. An optimized mid-IR waveguide design is expected to support even broader spectra. The QPM-free design reduces production complexity, allows longer waveguides, limits undesired spectral resonances and effectively allows using nonlinear crystals where QPM is inefficient or impossible. This result is important for mid-IR SCG, where QPM-free self-defocusing waveguides in common mid-IR nonline...
Multiple-octave spanning mid-IR supercontinuum generation in bulk quadratic nonlinear crystals
Zhou, Binbin
2016-01-01
Bright and broadband coherent mid-IR radiation is important for exciting and probing molecular vibrations. Using cascaded nonlinearities in conventional quadratic nonlinear crystal like lithium niobate, self-defocusing near-IR solitons have been demonstrated that led to very broadband supercontinuum generation in the visible, near-IR and short-wavelength mid-IR. Here we conduct an experiment where a mid-IR crystal pumped in the mid-IR gives multiple-octave spanning supercontinua. The crystal is cut for noncritical interaction, so the three-wave mixing of a single mid-IR femtosecond pump source leads to highly phase-mismatched second-harmonic generation. This self-acting cascaded process leads to the formation of a self-defocusing soliton at the mid-IR pump wavelength and after the self-compression point multiple octave-spanning supercontinua are observed (covering 1.6-$7.0~\\mu$m). The results were recorded in a commercially available crystal LiInS$_2$ pumped in the 3-$4~\\mu$m range, but other mid-IR crystals ...
Few-cycle nonlinear mid-IR pulse generated with cascaded quadratic nonlinearities
DEFF Research Database (Denmark)
Bache, Morten; Liu, Xing; Zhou, Binbin
change Δn = ncascI, where ncase ∝ −d2eff/Δk, and deff is the effective quadratic nonlinearity. Due to competing material nonlinearities nKerr the total nonlinear refractive is ncubic = ncasc + nKerr. Interestingly ncubic can become negative (self-defocusing), elegantly avoiding self-focusing problems...
Multiple-μJ mid-IR supercontinuum generation in quadratic nonlinear crystals
DEFF Research Database (Denmark)
Bache, Morten; Zhou, Binbin; Ashihara, S.
2016-01-01
Pumping a quadratic nonlinear crystal in the mid-IR we observe octave-spanning mid-IR supercontinua. A self-acting cascaded process leads to the formation of a self-defocusing nonlinearity, allowing formation of filament-free octave-spanning supercontinua in the 2.0–7.0 μm range with 10s of μ...
DEFF Research Database (Denmark)
Knudsen, Jesper Viese; Bendtsen, Jan Dimon; Andersen, Palle;
2016-01-01
In this paper, a self-tuning linear quadratic supervisory regulator using a large-signal state estimator for a diesel driven generator set is proposed. The regulator improves operational efficiency, in comparison to current implementations, by (i) automating the initial tuning process and (ii......) enabling automated retuning capabilities. Utilizing a first principles-based nonlinear model detailed in [1], the procedure is demonstrated through simulations after real system measurements have been used for parameter identification. The regulator is able to suppress load-induced variations successfully...... throughout the operating range of the diesel generator....
Šuminas, R; Tamošauskas, G; Valiulis, G; Dubietis, A
2016-05-01
We experimentally study filamentation and supercontinuum generation in a birefringent medium [beta-barium borate (β-BBO) crystal] pumped by intense 90 fs, 1.8 μm laser pulses whose carrier wavelength falls in the range of anomalous group velocity dispersion of the crystal. We demonstrate that the competition between the intrinsic cubic and cascaded-quadratic nonlinearities may serve as a useful tool for controlling the self-action effects via phase matching condition. In particular, we found that spectral superbroadening of the ordinary polarization is linked to three-dimensional self-focusing and formation of self-compressed spatiotemporal light bullets that could be accessed within a certain range of either positive or negative phase mismatch. In the extraordinary polarization, we detect giant spectral shifts of the second harmonic radiation, which are attributed to a light bullet-induced self-phase matching.
Leblond, Hervé; Mihalache, Dumitru; 10.1103/PHYSREVA.80.053812
2011-01-01
By using a powerful reductive perturbation technique, or a multiscale analysis, a generic Kadomtsev-Petviashvili evolution equation governing the propagation of femtosecond spatiotemporal optical solitons in quadratic nonlinear media beyond the slowly varying envelope approximation is put forward. Direct numerical simulations show the formation, from adequately chosen few-cycle input pulses, of both stable line solitons (in the case of a quadratic medium with normal dispersion) and of stable lumps (for a quadratic medium with anomalous dispersion). Besides, a typical example of the decay of the perturbed unstable line soliton into stable lumps for a quadratic nonlinear medium with anomalous dispersion is also given.
Multistage quadratic stochastic programming
Lau, Karen K.; Womersley, Robert S.
2001-04-01
Quadratic stochastic programming (QSP) in which each subproblem is a convex piecewise quadratic program with stochastic data, is a natural extension of stochastic linear programming. This allows the use of quadratic or piecewise quadratic objective functions which are essential for controlling risk in financial and project planning. Two-stage QSP is a special case of extended linear-quadratic programming (ELQP). The recourse functions in QSP are piecewise quadratic convex and Lipschitz continuous. Moreover, they have Lipschitz gradients if each QP subproblem is strictly convex and differentiable. Using these properties, a generalized Newton algorithm exhibiting global and superlinear convergence has been proposed recently for the two stage case. We extend the generalized Newton algorithm to multistage QSP and show that it is globally and finitely convergent under suitable conditions. We present numerical results on randomly generated data and modified publicly available stochastic linear programming test sets. Efficiency schemes on different scenario tree structures are discussed. The large-scale deterministic equivalent of the multistage QSP is also generated and their accuracy compared.
Zhou, Binbin; Bache, Morten
2016-08-01
Bright and broadband coherent mid-IR radiation is important for exciting and probing molecular vibrations. Using cascaded nonlinearities in conventional quadratic nonlinear crystals like lithium niobate, self-defocusing near-IR solitons have been demonstrated that led to very broadband supercontinuum generation in the visible, near-IR, and short-wavelength mid-IR. Here we conduct an experiment where a mid-IR crystal is pumped in the mid-IR. The crystal is cut for noncritical interaction, so the three-wave mixing of a single mid-IR femtosecond pump source leads to highly phase-mismatched second-harmonic generation. This self-acting cascaded process leads to the formation of a self-defocusing soliton at the mid-IR pump wavelength and after the self-compression point multiple octave-spanning supercontinua are observed. The results were recorded in a commercially available crystal LiInS2 pumped in the 3-4 μm range with 85 fs 50 μJ pulse energy, with the broadest supercontinuum covering 1.6-7.0 μm. We measured up 30 μJ energy in the supercontinuum, and the energy promises to scale favorably with an increased pump energy. Other mid-IR crystals can readily be used as well to cover other pump wavelengths and target other supercontinuum wavelength ranges.
Ryckelynck, Philippe
2011-01-01
This paper addresses the classical and discrete Euler-Lagrange equations for systems of $n$ particles interacting quadratically in $\\mathbb{R}^d$. By highlighting the role played by the center of mass of the particles, we solve the previous systems via the classical quadratic eigenvalue problem (QEP) and its discrete transcendental generalization. The roots of classical and discrete QEP being given, we state some conditional convergence results. Next, we focus especially on periodic and choreographic solutions and we provide some numerical experiments which confirm the convergence.
The Stability of the Constrained Utility Maximization Problem - A BSDE Approach
Mocha, Markus
2011-01-01
This article studies the sensitivity of the power utility maximization problem with respect to the investor's relative risk aversion, the statistical probability measure, the investment constraints and the market price of risk. We extend previous descriptions of the dual domain then exploit the link between the constrained utility maximization problem and continuous semimartingale quadratic BSDEs to reduce questions on sensitivity to results on stability for such equations. This then allows us to prove appropriate convergence of the primal and dual optimizers in the semimartingale topology.
Optimal investment under multiple defaults risk: a BSDE-decomposition approach
Jiao, Ying; Pham, Huyên
2011-01-01
We study an optimal investment problem under contagion risk in a financial model subject to multiple jumps and defaults. The global market information is formulated as progressive enlargement of a default-free Brownian filtration, and the dependence of default times is modelled by a conditional density hypothesis. In this It\\^o-jump process model, we give a decomposition of the corresponding stochastic control problem into stochastic control problems in the default-free filtration, which are determined in a backward induction. The dynamic programming method leads to a backward recursive system of quadratic Backward Stochastic Differential Equations (BSDEs) in Brownian filtration, and our main result is to prove under fairly general conditions the existence and uniqueness of a solution to this system, which characterizes explicitly the value function and optimal strategies to the optimal investment problem. We illustrate our solutions approach with some numerical tests emphasizing the impact of default intensi...
Luo, X. W.; Xu, P.; Sun, C. W.; Jin, H.; Hou, R. J.; Leng, H. Y.; Zhu, S. N.
2017-06-01
Concurrent spontaneous parametric down-conversion (SPDC) processes have proved to be an appealing approach for engineering the path-entangled photonic state with designable and tunable spatial modes. In this work, we propose a general scheme to construct high-dimensional path entanglement and demonstrate the basic properties of concurrent SPDC processes from domain-engineered quadratic nonlinear photonic crystals, including the spatial modes and the photon flux, as well as the anisotropy of spatial correlation under noncollinear quasi-phase-matching geometry. The overall understanding about the performance of concurrent SPDC processes will give valuable references to the construction of compact path entanglement and the development of new types of photonic quantum technologies.
Quantum quadratic operators and processes
Mukhamedov, Farrukh
2015-01-01
Covering both classical and quantum approaches, this unique and self-contained book presents the most recent developments in the theory of quadratic stochastic operators and their Markov and related processes. The asymptotic behavior of dynamical systems generated by classical and quantum quadratic operators is investigated and various properties of quantum quadratic operators are studied, providing an insight into the construction of quantum channels. This book is suitable as a textbook for an advanced undergraduate/graduate level course or summer school in quantum dynamical systems. It can also be used as a reference book by researchers looking for interesting problems to work on, or useful techniques and discussions of particular problems. Since it includes the latest developments in the fields of quadratic dynamical systems, Markov processes and quantum stochastic processes, researchers at all levels are likely to find the book inspiring and useful.
Solvable quadratic Lie algebras
Institute of Scientific and Technical Information of China (English)
ZHU; Linsheng
2006-01-01
A Lie algebra endowed with a nondegenerate, symmetric, invariant bilinear form is called a quadratic Lie algebra. In this paper, the author investigates the structure of solvable quadratic Lie algebras, in particular, the solvable quadratic Lie algebras whose Cartan subalgebras consist of semi-simple elements, the author presents a procedure to construct a class of quadratic Lie algebras from the point of view of cohomology and shows that all solvable quadratic Lie algebras can be obtained in this way.
Lefkoff, L.J.; Gorelick, S.M.
1987-01-01
A FORTRAN-77 computer program code that helps solve a variety of aquifer management problems involving the control of groundwater hydraulics. It is intended for use with any standard mathematical programming package that uses Mathematical Programming System input format. The computer program creates the input files to be used by the optimization program. These files contain all the hydrologic information and management objectives needed to solve the management problem. Used in conjunction with a mathematical programming code, the computer program identifies the pumping or recharge strategy that achieves a user 's management objective while maintaining groundwater hydraulic conditions within desired limits. The objective may be linear or quadratic, and may involve the minimization of pumping and recharge rates or of variable pumping costs. The problem may contain constraints on groundwater heads, gradients, and velocities for a complex, transient hydrologic system. Linear superposition of solutions to the transient, two-dimensional groundwater flow equation is used by the computer program in conjunction with the response matrix optimization method. A unit stress is applied at each decision well and transient responses at all control locations are computed using a modified version of the U.S. Geological Survey two dimensional aquifer simulation model. The program also computes discounted cost coefficients for the objective function and accounts for transient aquifer conditions. (Author 's abstract)
DEFF Research Database (Denmark)
Zhou, Binbin; Guo, Hairun; Bache, Morten
2015-01-01
and without critical phase-matching requirements. Pumping a bulk quadratic nonlinear crystal (unpoled LiNbO3 cut for noncritical phase-mismatched interaction) with sub-mJ near-IR 50-fs pulses, tunable and broadband (∼ 1,000 cm−1) mid-IR pulses around 3.0 μm are generated with excellent spatio-temporal pulse...... quality, having up to 10.5 μJ energy (6.3% conversion). The mid-IR pulses are dispersive waves phase-matched to near-IR self-defocusing solitons created by the induced self-defocusing cascaded nonlinearity. This process is filament-free and the input pulse energy can therefore be scaled arbitrarily...
DEFF Research Database (Denmark)
Zhou, Binbin; Guo, Hairun; Bache, Morten
2015-01-01
and without critical phase-matching requirements. Pumping a bulk quadratic nonlinear crystal (unpoled LiNbO3 cut for noncritical phase-mismatched interaction) with sub-mJ near-IR 50-fs pulses, tunable and broadband (∼ 1,000 cm−1) mid-IR pulses around 3.0 μm are generated with excellent spatio-temporal pulse...... quality, having up to 10.5 μJ energy (6.3% conversion). The mid-IR pulses are dispersive waves phase-matched to near-IR self-defocusing solitons created by the induced self-defocusing cascaded nonlinearity. This process is filament-free and the input pulse energy can therefore be scaled arbitrarily...... by using large-aperture crystals. The technique can readily be implemented with other crystals and laser wavelengths, and can therefore potentially replace current ultrafast frequency-conversion processes to the mid-IR....
Frediani, Luca; Ågren, Hans; Ferrighi, Lara; Ruud, Kenneth
2005-10-01
We present the first implementation of the quadratic response function for multiconfigurational self-consistent-field wave functions of solvated molecules described by a polarizable continuum model employing a molecule-shaped cavity. We apply the methodology to the first hyperpolarizability β and, in particular, the second-harmonic generation process for a series of conjugated push-pull oligomers, as well as for para-nitroaniline. The effect of solvation on the dispersion of the hyperpolarizability and the change in the hyperpolarizability for increasing chain length of the oligomers in vacuum and in solution is considered. The effect of a correlated description is analyzed by comparing the Hartree-Fock hyperpolarizabilities to the multiconfigurational self-consistent-field hyperpolarizabilities. The effect of geometry relaxation in the solvent on the properties of the solvated molecules are also investigated.
Frediani, Luca; Agren, Hans; Ferrighi, Lara; Ruud, Kenneth
2005-10-08
We present the first implementation of the quadratic response function for multiconfigurational self-consistent-field wave functions of solvated molecules described by a polarizable continuum model employing a molecule-shaped cavity. We apply the methodology to the first hyperpolarizability beta and, in particular, the second-harmonic generation process for a series of conjugated push-pull oligomers, as well as for para-nitroaniline. The effect of solvation on the dispersion of the hyperpolarizability and the change in the hyperpolarizability for increasing chain length of the oligomers in vacuum and in solution is considered. The effect of a correlated description is analyzed by comparing the Hartree-Fock hyperpolarizabilities to the multiconfigurational self-consistent-field hyperpolarizabilities. The effect of geometry relaxation in the solvent on the properties of the solvated molecules are also investigated.
DEFF Research Database (Denmark)
Zhou, Binbin; Bache, Morten
2016-01-01
supercontinuum generation in the visible, near-IR, and short-wavelength mid-IR. Here we conduct an experiment where a mid-IR crystal is pumped in the mid-IR. The crystal is cut for noncritical interaction, so the three-wave mixing of a single mid-IR femtosecond pump source leads to highly phase-mismatched second......-harmonic generation. This self-acting cascaded process leads to the formation of a self-defocusing soliton at the mid-IR pump wavelength and after the self-compression point multiple octave-spanning supercontinua are observed. The results were recorded in a commercially available crystal LiInS2 pumped in the 3-4 µm...
Successive quadratic programming multiuser detector
Institute of Scientific and Technical Information of China (English)
Mu Xuewen; Zhang Yaling; Liu Sanyang
2007-01-01
Based on the semidefinite programming relaxation of the CDMA maximum likelihood multiuser detection problem,a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the randomized cut generation scheme, the suboptimal solution of the multiuser detection problem in obtained. Compared to the interior point methods previously reported based on semidefinite programming, simulations demonstrate that the successive quadratic programming algorithm often yields the similar BER performances of the multiuser detection problem. But the average CPU time of this approach is significantly reduced.
Zhou, B B; Bache, M
2014-01-01
Generating energetic femtosecond mid-IR pulses is crucial for ultrafast spectroscopy, and currently relies on parametric processes that, while efficient, are also complex. Here we experimentally show a simple alternative that uses a single pump wavelength without any pump synchronization and without critical phase-matching requirements. Pumping a bulk quadratic nonlinear crystal (unpoled LiNbO$_3$ cut for noncritical phase-mismatched interaction) with sub-mJ near-IR 50-fs pulses, tunable and broadband ($\\sim 1,000$ cm$^{-1}$) mid-IR pulses around $3.0~\\mu\\rm m$ are generated with excellent spatio-temporal pulse quality, having up to 10.5 $\\mu$J energy (6.3% conversion). The mid-IR pulses are dispersive waves phase-matched to near-IR self-defocusing solitons created by the induced self-defocusing cascaded nonlinearity. This process is filament-free and the input pulse energy can therefore be scaled arbitrarily by using large-aperture crystals. The technique can readily be implemented with other crystals and la...
Cherchi, Matteo; Busacca, Alessandro C; Oliveri, Roberto L; Bivona, Saverio; Cino, Alfonso C; Stivala, Salvatore; Sanseverino, Stefano Riva; Leone, Claudio
2009-01-01
We present a detailed analysis and comparison of dielectric waveguides made of CdTe, GaP, GaAs and InP for modal phase matched optical difference frequency generation (DFG) in the terahertz domain. From the form of the DFG equations, we derived the definition of a very general figure of merit (FOM). In turn, this FOM enabled us to compare different configurations, by taking into account linear and nonlinear susceptibility dispersion, terahertz absorption, and a rigorous evaluation of the waveguide modes properties. The most efficient waveguides found with this procedure are predicted to approach the quantum efficiency limit with input optical power in the order of kWs.
Directory of Open Access Journals (Sweden)
Snigdha Dagar
2016-08-01
Full Text Available Stroke is the leading cause of severe chronic disability and the second cause of death worldwide with 15 million new cases and 50 million stroke survivors. The post stroke chronic disability may be ameliorated with early neuro rehabilitation where non-invasive brain stimulation (NIBS techniques can be used as an adjuvant treatment to hasten the effects. However, the heterogeneity in the lesioned brain will require individualized NIBS intervention where innovative neuroimaging technologies of portable electroencephalography (EEG and functional-near-infrared spectroscopy (fNIRS can be leveraged for Brain State Dependent Electrotherapy (BSDE. In this hypothesis and theory article, we propose a computational approach based on excitation-inhibition (E-I balance hypothesis to objectively quantify the post stroke individual brain state using online fNIRS-EEG joint imaging. One of the key events that occurs following Stroke is the imbalance in local excitation-inhibition (that is the ratio of Glutamate/GABA which may be targeted with NIBS using a computational pipeline that includes individual forward models to predict current flow patterns through the lesioned brain or brain target region. The current flow will polarize the neurons which can be captured with excitation-inhibition based brain models. Furthermore, E-I balance hypothesis can be used to find the consequences of cellular polarization on neuronal information processing which can then be implicated in changes in function. We first review evidence that shows how this local imbalance between excitation-inhibition leading to functional dysfunction can be restored in targeted sites with NIBS (Motor Cortex, Somatosensory Cortex resulting in large scale plastic reorganization over the cortex, and probably facilitating recovery of functions. Secondly, we show evidence how BSDE based on inhibition–excitation balance hypothesis may target a specific brain site or network as an adjuvant treatment
The Pure Virtual Braid Group Is Quadratic
Lee, Peter
2011-01-01
If an augmented algebra K over Q is filtered by powers of its augmentation ideal I, the associated graded algebra gr_I K need not in general be quadratic: although it is generated in degree 1, its relations may not be generated by homogeneous relations of degree 2. In this paper we give a criterion which is equivalent to gr_I K being quadratic. We apply this criterion to the group algebra of the pure virtual braid group (also known as the quasi-triangular group), and show that the corresponding associated graded algebra is quadratic.
Compression limits in cascaded quadratic soliton compression
DEFF Research Database (Denmark)
Bache, Morten; Bang, Ole; Krolikowski, Wieslaw;
2008-01-01
Cascaded quadratic soliton compressors generate under optimal conditions few-cycle pulses. Using theory and numerical simulations in a nonlinear crystal suitable for high-energy pulse compression, we address the limits to the compression quality and efficiency.......Cascaded quadratic soliton compressors generate under optimal conditions few-cycle pulses. Using theory and numerical simulations in a nonlinear crystal suitable for high-energy pulse compression, we address the limits to the compression quality and efficiency....
Accardi, Luigi
2009-01-01
We construct the quadratic analogue of the boson Fock functor. While in the first order case all contractions on the 1--particle space can be second quantized, the semigroup of contractions that admit a quadratic second quantization is much smaller due to the nonlinearity. Within this semigroup we characterize the unitary and the isometric elements.
Quadratic eigenvalue problems.
Energy Technology Data Exchange (ETDEWEB)
Walsh, Timothy Francis; Day, David Minot
2007-04-01
In this report we will describe some nonlinear eigenvalue problems that arise in the areas of solid mechanics, acoustics, and coupled structural acoustics. We will focus mostly on quadratic eigenvalue problems, which are a special case of nonlinear eigenvalue problems. Algorithms for solving the quadratic eigenvalue problem will be presented, along with some example calculations.
The explicit dependence of quadrat variance on the ratio of clump size to quadrat size.
Ferrandino, Francis J
2005-05-01
ABSTRACT In the past decade, it has become common practice to pool mapped binary epidemic data into quadrats. The resultant "quadrat counts" can then be analyzed by fitting them to a probability distribution (i.e., betabinomial). Often a binary form of Taylor's power law is used to relate the quadrat variance to the quadrat mean. The fact that there is an intrinsic dependence of such analyses on quadrat size and shape is well known. However, a clear-cut exposition of the direct connection between the spatial properties of the two-dimensional pattern of infected plants in terms of the geometry of the quadrat and the results of quadrat-based analyses is lacking. This problem was examined both empirically and analytically. The empirical approach is based on a set of stochastically generated "mock epidemics" using a Neyman-Scott cluster process. The resultant spatial point-patterns of infected plants have a fixed number of disease foci characterized by a known length scale (monodisperse) and saturated to a known disease level. When quadrat samples of these epidemics are fit to a beta-binomial distribution, the resulting measures of aggregation are totally independent of disease incidence and most strongly dependent on the ratio of the length scale of the quadrat to the length scale of spatial aggregation and to a lesser degree on disease saturation within individual foci. For the analytical approach, the mathematical form for the variation in the sum of random variates is coupled to the geometry of a quadrat through an assumed exponential autocorrelation function. The net result is an explicit equation expressing the intraquadrat correlation, quadrat variance, and the index of dispersion in terms of the ratio of the quadrat length scale to the correlative length scale.
Semidefinite programming for quadratically constrained quadratic programs
Olkin, Julia A.; Titterton, Paul J., Jr.
1995-06-01
We consider the linear least squares problem subject to multiple quadratic constraints, which is motivated by a practical application in controller design. We use the techniques of convex optimization, in particluar, interior-point methods for semi-definite programming. We reduce a quasi-convex potential function. Each iteration requires calculating a primal and dual search direction and minimizing along the plane defined by these search directions. The primal search direction requires solving a least squares problem whose matrix is composed of a block- Toeplitz portion plus other structured matrices. We make use of Kronecker products and FFTs to greatly reduce the calculation. In addition, the matrix updates and matrix inverses in the plane search are actually low-rank updates to structured matrices so we are able to further reduce the flops required. Consequently, we can design controllers for problems of considerable size.
On Convex Quadratic Approximation
den Hertog, D.; de Klerk, E.; Roos, J.
2000-01-01
In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of
On Convex Quadratic Approximation
den Hertog, D.; de Klerk, E.; Roos, J.
2000-01-01
In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of
On Quadratic Differential Forms
Willems, J.C.; Trentelman, H.L.
1998-01-01
This paper develops a theory around the notion of quadratic differential forms in the context of linear differential systems. In many applications, we need to not only understand the behavior of the system variables but also the behavior of certain functionals of these variables. The obvious cases w
Alvarez-Gaume, Luis; Kounnas, Costas; Lust, Dieter; Riotto, Antonio
2016-01-01
We discuss quadratic gravity where terms quadratic in the curvature tensor are included in the action. After reviewing the corresponding field equations, we analyze in detail the physical propagating modes in some specific backgrounds. First we confirm that the pure $R^2$ theory is indeed ghost free. Then we point out that for flat backgrounds the pure $R^2$ theory propagates only a scalar massless mode and no spin-two tensor mode. However, the latter emerges either by expanding the theory around curved backgrounds like de Sitter or anti-de Sitter, or by changing the long-distance dynamics by introducing the standard Einstein term. In both cases, the theory is modified in the infrared and a propagating graviton is recovered. Hence we recognize a subtle interplay between the UV and IR properties of higher order gravity. We also calculate the corresponding Newton's law for general quadratic curvature theories. Finally, we discuss how quadratic actions may be obtained from a fundamental theory like string- or M-...
Hidden conic quadratic representation of some nonconvex quadratic optimization problems
Ben-Tal, A.; den Hertog, D.
2014-01-01
The problem of minimizing a quadratic objective function subject to one or two quadratic constraints is known to have a hidden convexity property, even when the quadratic forms are indefinite. The equivalent convex problem is a semidefinite one, and the equivalence is based on the celebrated S-lemma
Extended gcd of quadratic integers
Miled, Abdelwaheb
2010-01-01
Computation of the extended gcd of two quadratic integers. The ring of integers considered is principal but could be euclidean or not euclidean ring. This method rely on principal ideal ring and reduction of binary quadratic forms.
On Characterization of Quadratic Splines
DEFF Research Database (Denmark)
Chen, B. T.; Madsen, Kaj; Zhang, Shuzhong
2005-01-01
A quadratic spline is a differentiable piecewise quadratic function. Many problems in numerical analysis and optimization literature can be reformulated as unconstrained minimizations of quadratic splines. However, only special cases of quadratic splines are studied in the existing literature...... between the convexity of a quadratic spline function and the monotonicity of the corresponding LCP problem. It is shown that, although both conditions lead to easy solvability of the problem, they are different in general......., and algorithms are developed on a case by case basis. There lacks an analytical representation of a general or even a convex quadratic spline. The current paper fills this gap by providing an analytical representation of a general quadratic spline. Furthermore, for convex quadratic spline, it is shown...
Quadratic reactivity fuel cycle model
Energy Technology Data Exchange (ETDEWEB)
Lewins, J.D.
1985-11-01
For educational purposes it is highly desirable to provide simple yet realistic models for fuel cycle and fuel economy. In particular, a lumped model without recourse to detailed spatial calculations would be very helpful in providing the student with a proper understanding of the purposes of fuel cycle calculations. A teaching model for fuel cycle studies based on a lumped model assuming the summability of partial reactivities with a linear dependence of reactivity usefully illustrates fuel utilization concepts. The linear burnup model does not satisfactorily represent natural enrichment reactors. A better model, showing the trend of initial plutonium production before subsequent fuel burnup and fission product generation, is a quadratic fit. The study of M-batch cycles, reloading 1/Mth of the core at end of cycle, is now complicated by nonlinear equations. A complete account of the asymptotic cycle for any order of M-batch refueling can be given and compared with the linear model. A complete account of the transient cycle can be obtained readily in the two-batch model and this exact solution would be useful in verifying numerical marching models. It is convenient to treat the parabolic fit rho = 1 - tau/sup 2/ as a special case of the general quadratic fit rho = 1 - C/sub tau/ - (1 - C)tau/sup 2/ in suitably normalized reactivity and cycle time units. The parabolic results are given in this paper.
On orthogonality preserving quadratic stochastic operators
Energy Technology Data Exchange (ETDEWEB)
Mukhamedov, Farrukh; Taha, Muhammad Hafizuddin Mohd [Department of Computational and Theoretical Sciences, Faculty of Science International Islamic University Malaysia, P.O. Box 141, 25710 Kuantan, Pahang Malaysia (Malaysia)
2015-05-15
A quadratic stochastic operator (in short QSO) is usually used to present the time evolution of differing species in biology. Some quadratic stochastic operators have been studied by Lotka and Volterra. In the present paper, we first give a simple characterization of Volterra QSO in terms of absolutely continuity of discrete measures. Further, we introduce a notion of orthogonal preserving QSO, and describe such kind of operators defined on two dimensional simplex. It turns out that orthogonal preserving QSOs are permutations of Volterra QSO. The associativity of genetic algebras generated by orthogonal preserving QSO is studied too.
DEFF Research Database (Denmark)
Bache, Morten; Zhou, Binbin; Chong, A.
2010-01-01
We show that ultra-short few-cycle pulses can be generated through soliton compression of energetic femtosecond pulses from a Ti:Sapphire regenerative amplifier. The compression relies on cascaded type 0 second-harmonic generation in mm-length lithium niobate crystals.......We show that ultra-short few-cycle pulses can be generated through soliton compression of energetic femtosecond pulses from a Ti:Sapphire regenerative amplifier. The compression relies on cascaded type 0 second-harmonic generation in mm-length lithium niobate crystals....
DEFF Research Database (Denmark)
Bache, Morten; Zhou, Binbin; Chong, A.
2010-01-01
We show that ultra-short few-cycle pulses can be generated through soliton compression of energetic femtosecond pulses from a Ti:Sapphire regenerative amplifier. The compression relies on cascaded type 0 second-harmonic generation in mm-length lithium niobate crystals.......We show that ultra-short few-cycle pulses can be generated through soliton compression of energetic femtosecond pulses from a Ti:Sapphire regenerative amplifier. The compression relies on cascaded type 0 second-harmonic generation in mm-length lithium niobate crystals....
A CLASS OF QUADRATIC HAMILTONIAN SYSTEMS UNDER QUADRATIC PERTURBATION
Institute of Scientific and Technical Information of China (English)
丰建文; 陈士华
2001-01-01
This paper deals with a class of quadratic Hamiltonian systems with quadratic perturbation. The authors prove that if the first order Melnikov function M1(h) = 0 and the second order Melnikov function M2(h) ≡ 0, then the origin of the Hamiltonian system with small perturbation is a center.
Finite dimensional semigroup quadratic algebras with minimal number of relations
Iyudu, Natalia
2011-01-01
A quadratic semigroup algebra is an algebra over a field given by the generators $x_1,...,x_n$ and a finite set of quadratic relations each of which either has the shape $x_jx_k=0$ or the shape $x_jx_k=x_lx_m$. We prove that a quadratic semigroup algebra given by $n$ generators and $d\\leq \\frac{n^2+n}{4}$ relations is always infinite dimensional. This strengthens the Golod--Shafarevich estimate for the above class of algebras. Our main result however is that for every $n$, there is a finite dimensional quadratic semigroup algebra with $n$ generators and $\\delta_n$ generators, where $\\delta_n$ is the first integer greater than $\\frac{n^2+n}{4}$. This shows that the above Golod-Shafarevich type estimate for semigroup algebras is sharp.
Quadratic solitons as nonlocal solitons
DEFF Research Database (Denmark)
Nikolov, Nikola Ivanov; Neshev, D.; Bang, Ole
2003-01-01
We show that quadratic solitons are equivalent to solitons of a nonlocal Kerr medium. This provides new physical insight into the properties of quadratic solitons, often believed to be equivalent to solitons of an effective saturable Kerr medium. The nonlocal analogy also allows for analytical...
On Characterization of Quadratic Splines
DEFF Research Database (Denmark)
Chen, B. T.; Madsen, Kaj; Zhang, Shuzhong
2005-01-01
that the representation can be refined in a neighborhood of a non-degenerate point and a set of non-degenerate minimizers. Based on these characterizations, many existing algorithms for specific convex quadratic splines are also finite convergent for a general convex quadratic spline. Finally, we study the relationship...
DEFF Research Database (Denmark)
Bache, Morten; Guo, Hairun; Zhou, Binbin
2013-01-01
of the promising crystals: in one case soliton pulse compression from 50 fs to 15 fs (1.5 cycles) at 3.0 μm is achieved, and at the same time a 3-cycle dispersive wave at 5.0 μm is formed that can be isolated using a long-pass filter. In another example we show that extremely broadband supercontinua can form......We discuss a novel method for generating octave-spanning supercontinua and few-cycle pulses in the important mid-IR wavelength range. The technique relies on strongly phase-mismatched cascaded second-harmonic generation (SHG) in mid-IR nonlinear frequency conversion crystals. Importantly we here...
A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
DEFF Research Database (Denmark)
Madsen, Kaj; Nielsen, Hans Bruun; Pinar, Mustafa C.
1999-01-01
The dual of the strictly convex quadratic programming problem with unit bounds is posed as a linear $\\ell_1$ minimization problem with quadratic terms. A smooth approximation to the linear $\\ell_1$ function is used to obtain a parametric family of piecewise-quadratic approximation problems. The u....... The unique path generated by the minimizers of these problems yields the solution to the original problem for finite values of the approximation parameter. Thus, a finite continuation algorithm is designed. Results of extensive computational experiments are reported....
SMOOTHING BY CONVEX QUADRATIC PROGRAMMING
Institute of Scientific and Technical Information of China (English)
Bing-sheng He; Yu-mei Wang
2005-01-01
In this paper, we study the relaxed smoothing problems with general closed convex constraints. It is pointed out that such problems can be converted to a convex quadratic minimization problem for which there are good programs in software libraries.
Quadratic Tangles in Planar Algebras
Jones, Vaughan F R
2010-01-01
In planar algebras, we show how to project certain simple "quadratic" tangles onto the linear space spanned by "linear" and "constant" tangles. We obtain some corollaries about the principal graphs and annular structure of subfactors.
Higgsed Stueckelberg vector and Higgs quadratic divergence
Directory of Open Access Journals (Sweden)
Durmuş Ali Demir
2015-01-01
Full Text Available Here we show that, a hidden vector field whose gauge invariance is ensured by a Stueckelberg scalar and whose mass is spontaneously generated by the Standard Model Higgs field contributes to quadratic divergences in the Higgs boson mass squared, and even leads to its cancellation at one-loop when Higgs coupling to gauge field is fine-tuned. In contrast to mechanisms based on hidden scalars where a complete cancellation cannot be achieved, stabilization here is complete in that the hidden vector and the accompanying Stueckelberg scalar are both free from quadratic divergences at one-loop. This stability, deriving from hidden exact gauge invariance, can have important implications for modeling dark phenomena like dark matter, dark energy, dark photon and neutrino masses. The hidden fields can be produced at the LHC.
Students' understanding of quadratic equations
López, Jonathan; Robles, Izraim; Martínez-Planell, Rafael
2016-05-01
Action-Process-Object-Schema theory (APOS) was applied to study student understanding of quadratic equations in one variable. This required proposing a detailed conjecture (called a genetic decomposition) of mental constructions students may do to understand quadratic equations. The genetic decomposition which was proposed can contribute to help students achieve an understanding of quadratic equations with improved interrelation of ideas and more flexible application of solution methods. Semi-structured interviews with eight beginning undergraduate students explored which of the mental constructions conjectured in the genetic decomposition students could do, and which they had difficulty doing. Two of the mental constructions that form part of the genetic decomposition are highlighted and corresponding further data were obtained from the written work of 121 undergraduate science and engineering students taking a multivariable calculus course. The results suggest the importance of explicitly considering these two highlighted mental constructions.
Finite dimensional quadratic Lie superalgebras
Jarvis, Peter; Yates, Luke
2010-01-01
We consider a special class of Z_2-graded, polynomial algebras of degree 2, which we call quadratic Lie superalgebras. Starting from the formal definition, we discuss the generalised Jacobi relations in the context of the Koszul property, and give a proof of the PBW basis theorem. We give several concrete examples of quadratic Lie superalgebras for low dimensional cases, and discuss aspects of their structure constants for the `type I' class. Based on the factorisation of the enveloping algebra, we derive the Kac module construction for typical and atypical modules, and a related direct construction of irreducible modules due to Gould. We investigate the method for one specific case, the quadratic generalisation gl_2(n/1) of the Lie superalgebra sl(n/1). We formulate the general atypicality conditions at level 1, and present an analysis of zero-and one-step atypical modules for a certain family of Kac modules.
Integer Quadratic Quasi-polyhedra
Letchford, Adam N.
This paper introduces two fundamental families of 'quasi-polyhedra' - polyhedra with a countably infinite number of facets - that arise in the context of integer quadratic programming. It is shown that any integer quadratic program can be reduced to the minimisation of a linear function over a quasi-polyhedron in the first family. Some fundamental properties of the quasi-polyhedra are derived, along with connections to some other well-studied convex sets. Several classes of facet-inducing inequalities are also derived. Finally, extensions to the mixed-integer case are briefly examined.
Impurity solitons with quadratic nonlinearities
DEFF Research Database (Denmark)
Clausen, Carl A. Balslev; Torres, Juan P-; Torner, Lluis
1998-01-01
We fmd families of solitary waves mediated by parametric mixing in quadratic nonlinear media that are localized at point-defect impurities. Solitons localized at attractive impurities are found to be dynamically stable. It is shown that localization at the impurity modifies strongly the soliton p...
Unramified extensions of quadratic fields
Institute of Scientific and Technical Information of China (English)
Wei Li; Dong Yang; Xianke Zhang
2008-01-01
Let K be a global quadratic field, then every unramified abelian extension of K is proved to be absolutely Galois when K is a number field or under some natural conditions when K is a function field. The absolute Galois group is also determined explicitly.
Quadratic prediction of factor scores
Wansbeek, T
1999-01-01
Factor scores are naturally predicted by means of their conditional expectation given the indicators y. Under normality this expectation is linear in y but in general it is an unknown function of y. II is discussed that under nonnormality factor scores can be more precisely predicted by a quadratic
Quadratic Variation by Markov Chains
DEFF Research Database (Denmark)
Hansen, Peter Reinhard; Horel, Guillaume
We introduce a novel estimator of the quadratic variation that is based on the the- ory of Markov chains. The estimator is motivated by some general results concerning filtering contaminated semimartingales. Specifically, we show that filtering can in prin- ciple remove the effects of market...
A SPLITTING METHOD FOR QUADRATIC PROGRAMMING PROBLEM
Institute of Scientific and Technical Information of China (English)
魏紫銮
2001-01-01
A matrix splitting method is presented for minimizing a quadratic programming (QP)problem, and a general algorithm is designed to solve the QP problem and generates a sequence of iterative points. We prove that the sequence generated by the algorithm converges to the optimal solution and has an R-linear rate of convergence if the QP problem is strictly convex and nondegenerate, and that every accumulation point of the sequence generated by the general algorithm is a KKT point of the original problem under the hypothesis that the value of the objective function is bounded below on the constrained region, and that the sequence converges to a KKT point if the problem is nondegenerate and the constrained region is bounded.
The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions
Lee, Jon; Romanchuk, Lyubov; Weismantel, Robert
2010-01-01
We consider the nonlinear integer programming problem of minimizing a quadratic function over the integer points in variable dimension satisfying a system of linear inequalities. We show that when the Graver basis of the matrix defining the system is given, and the quadratic function lies in a suitable {\\em dual Graver cone}, the problem can be solved in polynomial time. We discuss the relation between this cone and the cone of positive semidefinite matrices, and show that none contains the other. So we can minimize in polynomial time some non-convex and some (including all separable) convex quadrics. We conclude by extending our results to efficient integer minimization of multivariate polynomial functions of arbitrary degree lying in suitable cones.
Consensus-ADMM for General Quadratically Constrained Quadratic Programming
Huang, Kejun; Sidiropoulos, Nicholas D.
2016-10-01
Non-convex quadratically constrained quadratic programming (QCQP) problems have numerous applications in signal processing, machine learning, and wireless communications, albeit the general QCQP is NP-hard, and several interesting special cases are NP-hard as well. This paper proposes a new algorithm for general QCQP. The problem is first reformulated in consensus optimization form, to which the alternating direction method of multipliers (ADMM) can be applied. The reformulation is done in such a way that each of the sub-problems is a QCQP with only one constraint (QCQP-1), which is efficiently solvable irrespective of (non-)convexity. The core components are carefully designed to make the overall algorithm more scalable, including efficient methods for solving QCQP-1, memory efficient implementation, parallel/distributed implementation, and smart initialization. The proposed algorithm is then tested in two applications: multicast beamforming and phase retrieval. The results indicate superior performance over prior state-of-the-art methods.
Quadratic and 2-Crossed Modules of Algebras
Institute of Scientific and Technical Information of China (English)
Z. Arvasi; E. Ulualan
2007-01-01
In this work, we define the quadratic modules for commutative algebras and give relations among 2-crossed modules, crossed squares, quadratic modules and simplicial commutative algebras with Moore complex of length 2.
Team Decision Problems with Convex Quadratic Constraints
Gattami, Ather
2015-01-01
In this paper, we consider linear quadratic team problems with an arbitrary number of quadratic constraints in both stochastic and deterministic settings. The team consists of players with different measurements about the state of nature. The objective of the team is to minimize a quadratic cost subject to additional finite number of quadratic constraints. We first consider the problem of countably infinite number of players in the team for a bounded state of nature with a Gaussian distributi...
A polyhedral approach to quadratic assignment problem
Köksaldı, Ahmet Sertaç Murat
1994-01-01
Ankara : Department of Industrial Engineering and the Institute of Engineering and Sciences of Bilkent University, 1994. Thesis (Master's) -- Bilkent University, 1994. Includes bibliographical references. In this thesis, Quadratic Assignment Problem is considered. Since Quadratic Assignment Problem is JVP-bard, no polynomial time exact solution method exists. Proving optimality of solutions to Quadratic Assignment Problems has been limited to instances of small dimension. In...
Orthogonality preserving infinite dimensional quadratic stochastic operators
Energy Technology Data Exchange (ETDEWEB)
Akın, Hasan [Department of Mathematics, Faculty of Education, Zirve University, Gaziantep, 27260 (Turkey); Mukhamedov, Farrukh [Department of Computational & Theoretical Sciences Faculty of Science, International Islamic University Malaysia P.O. Box, 141, 25710, Kuantan Pahang (Malaysia)
2015-09-18
In the present paper, we consider a notion of orthogonal preserving nonlinear operators. We introduce π-Volterra quadratic operators finite and infinite dimensional settings. It is proved that any orthogonal preserving quadratic operator on finite dimensional simplex is π-Volterra quadratic operator. In infinite dimensional setting, we describe all π-Volterra operators in terms orthogonal preserving operators.
Extending the Scope of Robust Quadratic Optimization
Marandi, Ahmadreza; Ben-Tal, A.; den Hertog, Dick; Melenberg, Bertrand
2017-01-01
In this paper, we derive tractable reformulations of the robust counterparts of convex quadratic and conic quadratic constraints with concave uncertainties for a broad range of uncertainty sets. For quadratic constraints with convex uncertainty, it is well-known that the robust counterpart is, in ge
Quantum bouncer with quadratic dissipation
Energy Technology Data Exchange (ETDEWEB)
Gonzalez, G. [NanoScience Technology Center, University of Central Florida, Orlando, FL 32826 (United States)]. e-mail: ggonzalez@physics.ucf.edu
2008-07-01
The energy loss due to a quadratic velocity-dependent force on a quantum particle bouncing off a perfectly reflecting surface is obtained for a full cycle of motion. We approach this problem by means of a new, effective, phenomenological Hamiltonian which corresponds to the actual energy of the system and obtain the correction to the eigenvalues of the energy in first-order quantum perturbation theory for the case of weak dissipation. (Author)
Quantum bouncer with quadratic dissipation
González, G.
2008-02-01
The energy loss due to a quadratic velocity dependent force on a quantum particle bouncing on a perfectly reflecting surface is obtained for a full cycle of motion. We approach this problem by means of a new effective phenomenological Hamiltonian which corresponds to the actual energy of the system and obtained the correction to the eigenvalues of the energy in first order quantum perturbation theory for the case of weak dissipation.
Global Optimization of a Class of Nonconvex Quadratically Constrained Quadratic Programming Problems
Institute of Scientific and Technical Information of China (English)
Yong XIA
2011-01-01
In this paper we study a class of nonconvex quadratically constrained quadratic programming problems generalized from relaxations of quadratic assignment problems.We show that each problem is polynomially solved.Strong duality holds if a redundant constraint is introduced.As an application,a new lower bound is proposed for the quadratic assignment problem.
Effects of quadratic and cubic nonlinearities on a perfectly tuned parametric amplifier
Neumeyer, S.; Sorokin, V. S.; Thomsen, J. J.
2017-01-01
We consider the performance of a parametric amplifier with perfect tuning (two-to-one ratio between the parametric and direct excitation frequencies) and quadratic and cubic nonlinearities. A forced Duffing-Mathieu equation with appended quadratic nonlinearity is considered as the model system, and approximate analytical steady-state solutions and corresponding stabilities are obtained by the method of varying amplitudes. Some general effects of pure quadratic, and mixed quadratic and cubic nonlinearities on parametric amplification are shown. In particular, the effects of mixed quadratic and cubic nonlinearities may generate additional amplitude-frequency solutions. In this case an increased response and a more phase sensitive amplitude (phase between excitation frequencies) is obtained, as compared to the case with either pure quadratic or cubic nonlinearity. Furthermore, jumps and bi-stability in the amplitude-phase characteristics are predicted, supporting previously reported experimental observations.
Second Order Backward Stochastic Differential Equations with Quadratic Growth
Dylan, Possamai
2012-01-01
We prove the existence and uniqueness of a solution for one-dimensionnal second order backward stochastic differential equations introduced by Soner, Touzi and Zhang (2010), with a bounded terminal condition and a generator which is continuous with quadratic growth in z. We also prove a Feyman-Kac formula and a probabilistic representation for fully nonlinear PDEs in this setting.
Amalgamated Products of Ore and Quadratic Extensions of Rings
Johnson, Garrett
2012-01-01
We study the ideal theory of amalgamated products of Ore and quadratic extensions over a base ring R. We prove an analogue of the Hilbert Basis theorem for an amalgamated product Q of quadratic extensions and determine conditions for when the one-sided ideals of Q are principal or doubly-generated. We also determine conditions that make Q a principal ideal ring. Finally, we show that the double affine Hecke algebra $H_{q,t}$ associated to the general linear group GL_2(k) (here, k is a field with characteristic not 2) is an amalgamated product of quadratic extensions over a three-dimensional quantum torus and give an explicit isomorphism. In this case, it follows that $H_{q,t}$ is a noetherian ring.
Asymptotic Normality of Quadratic Estimators.
Robins, James; Li, Lingling; Tchetgen, Eric; van der Vaart, Aad
2016-12-01
We prove conditional asymptotic normality of a class of quadratic U-statistics that are dominated by their degenerate second order part and have kernels that change with the number of observations. These statistics arise in the construction of estimators in high-dimensional semi- and non-parametric models, and in the construction of nonparametric confidence sets. This is illustrated by estimation of the integral of a square of a density or regression function, and estimation of the mean response with missing data. We show that estimators are asymptotically normal even in the case that the rate is slower than the square root of the observations.
quadratic spline finite element method
Directory of Open Access Journals (Sweden)
A. R. Bahadir
2002-01-01
Full Text Available The problem of heat transfer in a Positive Temperature Coefficient (PTC thermistor, which may form one element of an electric circuit, is solved numerically by a finite element method. The approach used is based on Galerkin finite element using quadratic splines as shape functions. The resulting system of ordinary differential equations is solved by the finite difference method. Comparison is made with numerical and analytical solutions and the accuracy of the computed solutions indicates that the method is well suited for the solution of the PTC thermistor problem.
Optimal control linear quadratic methods
Anderson, Brian D O
2007-01-01
This augmented edition of a respected text teaches the reader how to use linear quadratic Gaussian methods effectively for the design of control systems. It explores linear optimal control theory from an engineering viewpoint, with step-by-step explanations that show clearly how to make practical use of the material.The three-part treatment begins with the basic theory of the linear regulator/tracker for time-invariant and time-varying systems. The Hamilton-Jacobi equation is introduced using the Principle of Optimality, and the infinite-time problem is considered. The second part outlines the
Factorization method of quadratic template
Kotyrba, Martin
2017-07-01
Multiplication of two numbers is a one-way function in mathematics. Any attempt to distribute the outcome to its roots is called factorization. There are many methods such as Fermat's factorization, Dixońs method or quadratic sieve and GNFS, which use sophisticated techniques fast factorization. All the above methods use the same basic formula differing only in its use. This article discusses a newly designed factorization method. Effective implementation of this method in programs is not important, it only represents and clearly defines its properties.
Directed animals, quadratic and rewriting systems
Marckert, Jean-François
2011-01-01
A directed animal is a percolation cluster in the directed site percolation model. The aim of this paper is to exhibit a strong relation between in one hand, the problem of computing the generating function $\\G$ of directed animals on the square lattice, counted according to the area and the perimeter, and on the other hand, the problem to find a solution to a system of quadratic equations involving unknown matrices. The matrices solution of this problem can be finite or infinite. We were unable to find finite solutions. We present some solid clues that some infinite explicit matrices, fix points of a rewriting like system are the natural solutions of this system of equations: some strong evidences are given that the problem of finding $\\G$ reduces then to the problem of finding an eigenvector to an explicit infinite matrix. Similar properties are shown for other combinatorial questions concerning directed animals, and for different lattices.
Tang, Chun-Ming; Jian, Jin-Bao
2008-10-01
Based on an augmented Lagrangian line search function, a sequential quadratically constrained quadratic programming method is proposed for solving nonlinearly constrained optimization problems. Compared to quadratic programming solved in the traditional SQP methods, a convex quadratically constrained quadratic programming is solved here to obtain a search direction, and the Maratos effect does not occur without any other corrections. The "active set" strategy used in this subproblem can avoid recalculating the unnecessary gradients and (approximate) Hessian matrices of the constraints. Under certain assumptions, the proposed method is proved to be globally, superlinearly, and quadratically convergent. As an extension, general problems with inequality and equality constraints as well as nonmonotone line search are also considered.
On Algebraic Approach in Quadratic Systems
Directory of Open Access Journals (Sweden)
Matej Mencinger
2011-01-01
Full Text Available When considering friction or resistance, many physical processes are mathematically simulated by quadratic systems of ODEs or discrete quadratic dynamical systems. Probably the most important problem when such systems are applied in engineering is the stability of critical points and (nonchaotic dynamics. In this paper we consider homogeneous quadratic systems via the so-called Markus approach. We use the one-to-one correspondence between homogeneous quadratic dynamical systems and algebra which was originally introduced by Markus in (1960. We resume some connections between the dynamics of the quadratic systems and (algebraic properties of the corresponding algebras. We consider some general connections and the influence of power-associativity in the corresponding quadratic system.
An Algorithm for Solving Quadratic Programming Problems
Directory of Open Access Journals (Sweden)
V. Moraru
1997-08-01
Full Text Available Herein is investigated the method of solution of quadratic programming problems. The algorithm is based on the effective selection of constraints. Quadratic programming with constraints-equalities are solved with the help of an algorithm, so that matrix inversion is avoided, because of the more convenient organization of the Calculus. Optimal solution is determined in a finite number of iterations. It is discussed the extension of the algorithm over solving quadratic non-convex programming problems.
The Random Quadratic Assignment Problem
Paul, Gerald; Shao, Jia; Stanley, H. Eugene
2011-11-01
The quadratic assignment problem, QAP, is one of the most difficult of all combinatorial optimization problems. Here, we use an abbreviated application of the statistical mechanics replica method to study the asymptotic behavior of instances in which the entries of at least one of the two matrices that specify the problem are chosen from a random distribution P. Surprisingly, the QAP has not been studied before using the replica method despite the fact that the QAP was first proposed over 50 years ago and the replica method was developed over 30 years ago. We find simple forms for C min and C max , the costs of the minimal and maximum solutions respectively. Notable features of our results are the symmetry of the results for C min and C max and their dependence on P only through its mean and standard deviation, independent of the details of P.
Large-scale sequential quadratic programming algorithms
Energy Technology Data Exchange (ETDEWEB)
Eldersveld, S.K.
1992-09-01
The problem addressed is the general nonlinear programming problem: finding a local minimizer for a nonlinear function subject to a mixture of nonlinear equality and inequality constraints. The methods studied are in the class of sequential quadratic programming (SQP) algorithms, which have previously proved successful for problems of moderate size. Our goal is to devise an SQP algorithm that is applicable to large-scale optimization problems, using sparse data structures and storing less curvature information but maintaining the property of superlinear convergence. The main features are: 1. The use of a quasi-Newton approximation to the reduced Hessian of the Lagrangian function. Only an estimate of the reduced Hessian matrix is required by our algorithm. The impact of not having available the full Hessian approximation is studied and alternative estimates are constructed. 2. The use of a transformation matrix Q. This allows the QP gradient to be computed easily when only the reduced Hessian approximation is maintained. 3. The use of a reduced-gradient form of the basis for the null space of the working set. This choice of basis is more practical than an orthogonal null-space basis for large-scale problems. The continuity condition for this choice is proven. 4. The use of incomplete solutions of quadratic programming subproblems. Certain iterates generated by an active-set method for the QP subproblem are used in place of the QP minimizer to define the search direction for the nonlinear problem. An implementation of the new algorithm has been obtained by modifying the code MINOS. Results and comparisons with MINOS and NPSOL are given for the new algorithm on a set of 92 test problems.
Binary Quadratic Forms: A Historical View
Khosravani, Azar N.; Beintema, Mark B.
2006-01-01
We present an expository account of the development of the theory of binary quadratic forms. Beginning with the formulation and proof of the Two-Square Theorem, we show how the study of forms of the type x[squared] + ny[squared] led to the discovery of the Quadratic Reciprocity Law, and how this theorem, along with the concept of reduction relates…
Quadratic Boost A-Source Impedance Network
DEFF Research Database (Denmark)
Siwakoti, Yam Prasad; Blaabjerg, Frede; Chub, Andrii
2016-01-01
A novel quadratic boost type A-source impedance network is proposed in this paper for realizing converters that demand a very high voltage gain. To achieve that, the proposed network uses an auto-transformer, whose obtained gain is quadratically dependent on the duty ratio and is presently not ma...
Quadratic Boost A-Source Impedance Network
DEFF Research Database (Denmark)
Siwakoti, Yam Prasad; Blaabjerg, Frede; Chub, Andrii
2016-01-01
A novel quadratic boost A-source impedance network is proposed to realize converters that demand very high voltage gain. To satisfy the requirement, the network uses an autotransformer where the obtained gain is quadratically dependent on the duty ratio and is unmatched by any existing impedance ...
Factorising a Quadratic Expression with Geometric Insights
Joarder, Anwar H.
2015-01-01
An algorithm is presented for factorising a quadratic expression to facilitate instruction and learning. It appeals to elementary geometry which may provide better insights to some students or teachers. There have been many methods for factorising a quadratic expression described in school text books. However, students often seem to struggle with…
An example in linear quadratic optimal control
Weiss, George; Zwart, Heiko J.
1998-01-01
We construct a simple example of a quadratic optimal control problem for an infinite-dimensional linear system based on a shift semigroup. This system has an unbounded control operator. The cost is quadratic in the input and the state, and the weighting operators are bounded. Despite its extreme
An example in linear quadratic optimal control
Weiss, George; Zwart, Heiko J.
1998-01-01
We construct a simple example of a quadratic optimal control problem for an infinite-dimensional linear system based on a shift semigroup. This system has an unbounded control operator. The cost is quadratic in the input and the state, and the weighting operators are bounded. Despite its extreme sim
Radar Rainfall Estimation using a Quadratic Z-R equation
Hall, Will; Rico-Ramirez, Miguel Angel; Kramer, Stefan
2016-04-01
The aim of this work is to test a method that enables the input of event based drop size distributions to alter a quadratic reflectivity (Z) to rainfall (R) equation that is limited by fixed upper and lower points. Results will be compared to the Marshall-Palmer Z-R relation outputs and validated by a network of gauges and a single polarisation weather radar located close to Essen, Germany. The time window over which the drop size distribution measurements will be collected is varied to note any effect on the generated quadratic Z-R relation. The new quadratic algorithm shows some distinct improvement over the Marshall-Palmer relationship through multiple events. The inclusion of a minimum number of Z-R points helped to decrease the associated error by defaulting back to the Marshall-Palmer equation if the limit was not reached. More research will be done to discover why the quadratic performs poorly in some events as there appears to be little correlation between number of drops or mean rainfall amount and the associated error. In some cases it seems the spatial distribution of the disdrometers has a significant effect as a large percentage of the rain bands pass to the north of two of the three disdrometers, frequently in a slightly north-easterly direction. However during widespread precipitation events the new algorithm works very well with reductions compared to the Marshall-Palmer relation.
A Riccati approach for constrained linear quadratic optimal control
Sideris, Athanasios; Rodriguez, Luis A.
2011-02-01
An active-set method is proposed for solving linear quadratic optimal control problems subject to general linear inequality path constraints including mixed state-control and state-only constraints. A Riccati-based approach is developed for efficiently solving the equality constrained optimal control subproblems generated during the procedure. The solution of each subproblem requires computations that scale linearly with the horizon length. The algorithm is illustrated with numerical examples.
Quadratic Hedging of Basis Risk
Directory of Open Access Journals (Sweden)
Hardy Hulley
2015-02-01
Full Text Available This paper examines a simple basis risk model based on correlated geometric Brownian motions. We apply quadratic criteria to minimize basis risk and hedge in an optimal manner. Initially, we derive the Föllmer–Schweizer decomposition for a European claim. This allows pricing and hedging under the minimal martingale measure, corresponding to the local risk-minimizing strategy. Furthermore, since the mean-variance tradeoff process is deterministic in our setup, the minimal martingale- and variance-optimal martingale measures coincide. Consequently, the mean-variance optimal strategy is easily constructed. Simple pricing and hedging formulae for put and call options are derived in terms of the Black–Scholes formula. Due to market incompleteness, these formulae depend on the drift parameters of the processes. By making a further equilibrium assumption, we derive an approximate hedging formula, which does not require knowledge of these parameters. The hedging strategies are tested using Monte Carlo experiments, and are compared with results achieved using a utility maximization approach.
On Quadratic Variation of Martingales
Indian Academy of Sciences (India)
Rajeeva L Karandikar; B V Rao
2014-08-01
We give a construction of an explicit mapping $$\\Psi: D([0,∞),\\mathbb{R})→ D([0,∞),\\mathbb{R}),$$ where $D([0,∞), \\mathbb{R})$ denotes the class of real valued r.c.l.l. functions on $[0,∞)$ such that for a locally square integrable martingale $(M_t)$ with r.c.l.l. paths, $$\\Psi(M.())=A.()$$ gives the quadratic variation process (written usually as $[M,M]_t$) of $(M_t)$. We also show that this process $(A_t)$ is the unique increasing process $(B_t)$ such that $M_t^2-B_t$ is a local martingale, $B_0=0$ and $$\\mathbb{P}(( B)_t=[( M)_t]^2, 0 < ∞)=1.$$ Apart from elementary properties of martingales, the only result used is the Doob’s maximal inequality. This result can be the starting point of the development of the stochastic integral with respect to r.c.l.l. martingales.
Specialization of Quadratic and Symmetric Bilinear Forms
Knebusch, Manfred
2010-01-01
The specialization theory of quadratic and symmetric bilinear forms over fields and the subsequent generic splitting theory of quadratic forms were invented by the author in the mid-1970's. They came to fruition in the ensuing decades and have become an integral part of the geometric methods in quadratic form theory. This book comprehensively covers the specialization and generic splitting theories. These theories, originally developed for fields of characteristic different from 2, are explored here without this restriction. In addition to chapters on specialization theory, generic splitting t
Quadratic stabilization of switched nonlinear systems
Institute of Scientific and Technical Information of China (English)
DONG YaLi; FAN JiaoJiao; MEI ShengWei
2009-01-01
In this paper, the problem of quadratic stabilization of multi-input multi-output switched nonlinear systems under an arbitrary switching law is investigated. When switched nonlinear systems have uniform normal form and the zero dynamics of uniform normal form is asymptotically stable under an arbitrary switching law, state feedbacks are designed and a common quadratic Lyapunov function of all the closed-loop subsystems is constructed to realize quadratic stabilizability of the class of switched nonlinear systems under an arbitrary switching law. The results of this paper are also applied to switched linear systems.
Structure of Solvable Quadratic Lie Algebras
Institute of Scientific and Technical Information of China (English)
ZHU Lin-sheng
2005-01-01
@@ Killing form plays a key role in the theory of semisimple Lie algebras. It is natural to extend the study to Lie algebras with a nondegenerate symmetric invariant bilinear form. Such a Lie algebra is generally called a quadratic Lie algebra which occur naturally in physics[10,12,13]. Besides semisimple Lie algebras, interesting quadratic Lie algebras include the Kac-Moody algebras and the Extended Affine Lie algebras.
Radiotherapy treatment planning linear-quadratic radiobiology
Chapman, J Donald
2015-01-01
Understand Quantitative Radiobiology from a Radiation Biophysics PerspectiveIn the field of radiobiology, the linear-quadratic (LQ) equation has become the standard for defining radiation-induced cell killing. Radiotherapy Treatment Planning: Linear-Quadratic Radiobiology describes tumor cell inactivation from a radiation physics perspective and offers appropriate LQ parameters for modeling tumor and normal tissue responses.Explore the Latest Cell Killing Numbers for Defining Iso-Effective Cancer TreatmentsThe book compil
Quadratic stabilization for uncertain stochastic systems
Institute of Scientific and Technical Information of China (English)
Jun'e FENG; Weihai ZHANG
2005-01-01
This paper discusses the robust quadratic stabilization control problem for stochastic uncertain systems,where the uncertain matrix is norm bounded,and the external disturbance is a stochastic process.Two kinds of controllers are designed,which include state feedback case and output feedback case.The conditions for the robust quadratic stabilization of stochastic uncertain systems are given via linear matrix inequalities.The detailed design methods are presented.Numerical examples show the effectiveness of our results.
Cascaded quadratic soliton compression at 800 nm
DEFF Research Database (Denmark)
Bache, Morten; Bang, Ole; Moses, Jeffrey;
2007-01-01
We study soliton compression in quadratic nonlinear materials at 800 nm, where group-velocity mismatch dominates. We develop a nonlocal theory showing that efficient compression depends strongly on characteristic nonlocal time scales related to pulse dispersion.......We study soliton compression in quadratic nonlinear materials at 800 nm, where group-velocity mismatch dominates. We develop a nonlocal theory showing that efficient compression depends strongly on characteristic nonlocal time scales related to pulse dispersion....
A NEW INEXACT SEQUENTIAL QUADRATIC PROGRAMMING ALGORITHM
Institute of Scientific and Technical Information of China (English)
倪勤
2002-01-01
This paper represents an inexact sequential quadratic programming (SQP ) algorithm which can solve nonlinear programming (NLP ) problems. An inexact solution of the quadratic programming subproblem is determined by a projection and contraction method such that only matrix-vector product is required. Some truncated criteria are chosen such that the algorithm is suitable to large scale NLP problem. The global convergence of the algorithm is proved.
Evolution of Dark Spatial Soliton in Quasi-phase-matched Quadratic Media
Institute of Scientific and Technical Information of China (English)
WANG Fei-Yu; CHEN Xian-Feng; CHEN Yu-Ping; YANG Yi; XIA Yu-Xing
2005-01-01
We theoretically investigate the evolvement of dark spatial soliton with cascading quadratic nonlinearity in quasi-phase-matched second harmonic generation. It is shown that the dark solitary wave can propagate stably when background intensity is large enough, in which diffraction of beam can be balanced by the cascading quadratic nonlinearity. We also analyze the influence of phase-mismatch on the stability of dark soliton propagation.
Asymmetric Simple Exclusion Process with Open Boundaries and Quadratic Harnesses
Bryc, Włodek; Wesołowski, Jacek
2017-04-01
We show that the joint probability generating function of the stationary measure of a finite state asymmetric exclusion process with open boundaries can be expressed in terms of joint moments of Markov processes called quadratic harnesses. We use our representation to prove the large deviations principle for the total number of particles in the system. We use the generator of the Markov process to show how explicit formulas for the average occupancy of a site arise for special choices of parameters. We also give similar representations for limits of stationary measures as the number of sites tends to infinity.
DEFF Research Database (Denmark)
Mak, Vicky; Thomadsen, Tommy
2006-01-01
This paper considers the cardinality constrained quadratic knapsack problem (QKP) and the quadratic selective travelling salesman problem (QSTSP). The QKP is a generalization of the knapsack problem and the QSTSP is a generalization of the travelling salesman problem. Thus, both problems are NP...
Linear-quadratic control and quadratic differential forms for multidimensional behaviors
Napp, D.; Trentelman, H.L.
2011-01-01
This paper deals with systems described by constant coefficient linear partial differential equations (nD-systems) from a behavioral point of view. In this context we treat the linear-quadratic control problem where the performance functional is the integral of a quadratic differential form. We look
Xia, Yong; Han, Ying-Wei
2014-01-01
In this paper, we propose a mixed-binary convex quadratic programming reformulation for the box-constrained nonconvex quadratic integer program and then implement IBM ILOG CPLEX 12.6 to solve the new model. Computational results demonstrate that our approach clearly outperform the very recent state-of-the-art solvers.
Indian Academy of Sciences (India)
DEEPAK KUMAR; A G RAMAKRISHNAN
2016-03-01
Particle swarm optimization (PSO) is used in several combinatorial optimization problems. In this work, particle swarms are used to solve quadratic programming problems with quadratic constraints. The central idea is to use PSO to move in the direction towards optimal solution rather than searching the entire feasibleregion. Binary classification is posed as a quadratically constrained quadratic problem and solved using the proposed method. Each class in the binary classification problem is modeled as a multidimensional ellipsoid to forma quadratic constraint in the problem. Particle swarms help in determining the optimal hyperplane or classification boundary for a data set. Our results on the Iris, Pima, Wine, Thyroid, Balance, Bupa, Haberman, and TAE datasets show that the proposed method works better than a neural network and the performance is close to that of a support vector machine
Fast approximate quadratic programming for graph matching.
Directory of Open Access Journals (Sweden)
Joshua T Vogelstein
Full Text Available Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valued data is becoming more prominent. With the aim of efficiently and accurately matching the large graphs common in big data, we present our graph matching algorithm, the Fast Approximate Quadratic assignment algorithm. We empirically demonstrate that our algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Applying our algorithm to our motivating example, matching C. elegans connectomes (brain-graphs, we find that it efficiently achieves performance.
Fast approximate quadratic programming for graph matching.
Vogelstein, Joshua T; Conroy, John M; Lyzinski, Vince; Podrazik, Louis J; Kratzer, Steven G; Harley, Eric T; Fishkind, Donniell E; Vogelstein, R Jacob; Priebe, Carey E
2015-01-01
Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valued data is becoming more prominent. With the aim of efficiently and accurately matching the large graphs common in big data, we present our graph matching algorithm, the Fast Approximate Quadratic assignment algorithm. We empirically demonstrate that our algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Applying our algorithm to our motivating example, matching C. elegans connectomes (brain-graphs), we find that it efficiently achieves performance.
Quadratic Interpolation Algorithm for Minimizing Tabulated Function
Directory of Open Access Journals (Sweden)
E. A. Youness
2008-01-01
Full Text Available Problem statement: The problem of finding the minimum value of objective function, when we know only some values of it, is needed in more practical fields. Quadratic interpolation algorithms are the famous tools deal with this kind of these problems. These algorithms interested with the polynomial space in which the objective function is approximated. Approach: In this study we approximated the objective function by a one dimensional quadratic polynomial. This approach saved the time and the effort to get the best point at which the objective is minimized. Results: The quadratic polynomial in each one of the steps of the proposed algorithm, accelerate the convergent to the best value of the objective function without taking into account all points of the interpolation set. Conclusion: Any n-dimensional problem of finding a minimal value of a function, given by some values, can be converted to one dimensional problem easier in deal.
Quadratic gravity: from weak to strong
Holdom, Bob
2016-01-01
More than three decades ago quadratic gravity was found to present a perturbative, renormalizable and asymptotically free theory of quantum gravity. Unfortunately the theory appeared to have problems with a spin-2 ghost. In this essay we revisit quadratic gravity in a different light by considering the case that the asymptotically free interaction flows to a strongly interacting regime. This occurs when the coefficient of the Einstein-Hilbert term is smaller than the scale $\\Lambda_{\\mathrm{QG}}$ where the quadratic couplings grow strong. Here QCD provides some useful insights. By pushing the analogy with QCD, we conjecture that the nonperturbative effects can remove the naive spin-2 ghost and lead to the emergence of general relativity in the IR.
The Wiener maximum quadratic assignment problem
Cela, Eranda; Woeginger, Gerhard J
2011-01-01
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional point set. We show that this special case, which we call the Wiener maximum quadratic assignment problem, is NP-hard in the ordinary sense and solvable in pseudo-polynomial time. Our approach also yields a polynomial time solution for the following problem from chemical graph theory: Find a tree that maximizes the Wiener index among all trees with a prescribed degree sequence. This settles an open problem from the literature.
A CART extention using Quadratic Decision Borders
DEFF Research Database (Denmark)
Hartelius, Karsten
1999-01-01
In this article we put forward an extention to the hierarchical CART classification method which uses quadratic decision borders. The original CART applies univariate splits on individual variables as well as splits on combinations of variables to recursively partition the feature......-space into subsets which are successively more class-homogeneous. Guided by the fact that class-distributions in feature-space are very often hyper-elliptical shaped, we give an extension to the original CART which also uses quadratic shaped decision borders which can be modelled by a mean-vector and a dispersion...
A CART extension using Quadratic Decision Borders
DEFF Research Database (Denmark)
Hartelius, Karsten
1999-01-01
In this article we put forward an extention to the hierarchical CART classification method which uses quadratic decision borders. The original CART applies univariate splits on individual variables as well as splits on combinations of variables to recursively partition the feature......-space into subsets which are successively more class-homogeneous. Guided by the fact that class-distributions in feature-space are very often hyper-elliptical shaped, we give an extension to the original CART which also uses quadratic shaped decision borders which can be modelled by a mean-vector and a dispersion...
PSQP: Puzzle Solving by Quadratic Programming.
Andalo, Fernanda A; Taubin, Gabriel; Goldenstein, Siome
2017-02-01
In this article we present the first effective method based on global optimization for the reconstruction of image puzzles comprising rectangle pieces-Puzzle Solving by Quadratic Programming (PSQP). The proposed novel mathematical formulation reduces the problem to the maximization of a constrained quadratic function, which is solved via a gradient ascent approach. The proposed method is deterministic and can deal with arbitrary identical rectangular pieces. We provide experimental results showing its effectiveness when compared to state-of-the-art approaches. Although the method was developed to solve image puzzles, we also show how to apply it to the reconstruction of simulated strip-shredded documents, broadening its applicability.
Quintessence with quadratic coupling to dark matter
Boehmer, Christian G; Chan, Nyein; Lazkoz, Ruth; Maartens, Roy
2009-01-01
We introduce a new form of coupling between dark energy and dark matter that is quadratic in their energy densities. Then we investigate the background dynamics when dark energy is in the form of exponential quintessence. The three types of quadratic coupling all admit late-time accelerating critical points, but these are not scaling solutions. We also show that two types of coupling allow for a suitable matter era at early times and acceleration at late times, while the third type of coupling does not admit a suitable matter era.
Guises and disguises of quadratic divergences
Energy Technology Data Exchange (ETDEWEB)
Cherchiglia, A.L., E-mail: adriano@fisica.ufmg.br [Departamento de Física, ICEx, Universidade Federal de Minas Gerais, P.O. BOX 702, 30.161-970, Belo Horizonte, MG (Brazil); Vieira, A.R., E-mail: arvieira@fisica.ufmg.br [Departamento de Física, ICEx, Universidade Federal de Minas Gerais, P.O. BOX 702, 30.161-970, Belo Horizonte, MG (Brazil); Hiller, Brigitte, E-mail: brigitte@teor.fis.uc.pt [Departamento de Física, Faculdade de Ciências e Tecnologia, Universidade de Coimbra, 3004-516 Coimbra (Portugal); Baêta Scarpelli, A.P., E-mail: scarpelli.apbs@dpf.gov.br [Setor Técnico-Científico, Departamento de Polícia Federal, Rua Hugo D’Antola, 95 - Lapa, São Paulo (Brazil); Sampaio, Marcos, E-mail: marcos.sampaio@durham.ac.uk [Departamento de Física, ICEx, Universidade Federal de Minas Gerais, P.O. BOX 702, 30.161-970, Belo Horizonte, MG (Brazil); Centre for Particle Theory, Department of Mathematical Sciences, Durham University, South Road Durham DH1 3LE (United Kingdom)
2014-12-15
In this contribution, we present a new perspective on the control of quadratic divergences in quantum field theory, in general, and in the Higgs naturalness problem, in particular. Our discussion is essentially based on an approach where UV divergences are parameterized, after being reduced to basic divergent integrals (BDI) in one internal momentum, as functions of a cutoff and a renormalization group scale λ. We illustrate our proposal with well-known examples, such as the gluon vacuum self energy of QCD and the Higgs decay in two photons within this approach. We also discuss frameworks in effective low-energy QCD models, where quadratic divergences are indeed fundamental.
Indirect quantum tomography of quadratic Hamiltonians
Energy Technology Data Exchange (ETDEWEB)
Burgarth, Daniel [Institute for Mathematical Sciences, Imperial College London, London SW7 2PG (United Kingdom); Maruyama, Koji; Nori, Franco, E-mail: daniel@burgarth.de, E-mail: kmaruyama@riken.jp [Advanced Science Institute, RIKEN, Wako-shi, Saitama 351-0198 (Japan)
2011-01-15
A number of many-body problems can be formulated using Hamiltonians that are quadratic in the creation and annihilation operators. Here, we show how such quadratic Hamiltonians can be efficiently estimated indirectly, employing very few resources. We found that almost all the properties of the Hamiltonian are determined by its surface and that these properties can be measured even if the system can only be initialized to a mixed state. Therefore, our method can be applied to various physical models, with important examples including coupled nano-mechanical oscillators, hopping fermions in optical lattices and transverse Ising chains.
Lambda-Lifting in Quadratic Time
DEFF Research Database (Denmark)
Danvy, Olivier; Schultz, Ulrik Pagh
2004-01-01
Lambda-lifting is a program transformation that is used in compilers, partial evaluators, and program transformers. In this article, we show how to reduce its complexity from cubic time to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda...... on the simple observation that all functions in each component need the same extra parameters and thus a transitive closure is not needed. We therefore simplify the search for extra parameters by treating each strongly connected component instead of each function as a unit, thereby reducing the time complexity...
Lambda-lifting in Quadratic Time
DEFF Research Database (Denmark)
Danvy, O.; Schultz, U.P.
2004-01-01
Lambda-lifting is a program transformation that is used in compilers, partial evaluators, and program transformers. In this article, we show how to reduce its complexity from cubic time to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda...... on the simple observation that all functions in each component need the same extra parameters and thus a transitive closure is not needed. We therefore simplify the search for extra parameters by treating each strongly connected component instead of each function as a unit, thereby reducing the time complexity...
Discrete fractional Radon transforms and quadratic forms
Pierce, Lillian B
2010-01-01
We consider discrete analogues of fractional Radon transforms involving integration over paraboloids defined by positive definite quadratic forms. We prove sharp results for this class of discrete operators in all dimensions, providing necessary and sufficient conditions for them to extend to bounded operators from $\\ell^p$ to $\\ell^q$. The method involves an intricate spectral decomposition according to major and minor arcs, motivated by ideas from the circle method of Hardy and Littlewood. Techniques from harmonic analysis, in particular Fourier transform methods and oscillatory integrals, as well as the number theoretic structure of quadratic forms, exponential sums, and theta functions, play key roles in the proof.
Analysis of electroperforated materials using the quadrat counts method
Energy Technology Data Exchange (ETDEWEB)
Miranda, E; Garzon, C; Garcia-Garcia, J [Departament d' Enginyeria Electronica, Universitat Autonoma de Barcelona, 08193 Bellaterra, Barcelona (Spain); MartInez-Cisneros, C; Alonso, J, E-mail: enrique.miranda@uab.cat [Departament de Quimica AnalItica, Universitat Autonoma de Barcelona, 08193 Bellaterra, Barcelona (Spain)
2011-06-23
The electroperforation distribution in thin porous materials is investigated using the quadrat counts method (QCM), a classical statistical technique aimed to evaluate the deviation from complete spatial randomness (CSR). Perforations are created by means of electrical discharges generated by needle-like tungsten electrodes. The objective of perforating a thin porous material is to enhance its air permeability, a critical issue in many industrial applications involving paper, plastics, textiles, etc. Using image analysis techniques and specialized statistical software it is shown that the perforation locations follow, beyond a certain length scale, a homogeneous 2D Poisson distribution.
Test-assignment: a quadratic coloring problem
Duives, Jelle; Lodi, Andrea; Malaguti, Enrico
2013-01-01
We consider the problem of assigning the test variants of a written exam to the desks of a classroom in such a way that desks that are close-by receive different variants. The problem is a generalization of the Vertex Coloring and we model it as a binary quadratic problem. Exact solution methods bas
Experimental results on quadratic assignment problem
Directory of Open Access Journals (Sweden)
N.P. Nikolov
1999-08-01
Full Text Available The paper presents experimental results on quadratic assignment problem. The "scanning area" method formulated for radioelectronic equipment design is applied. For all more complex tests ours results are better or coincident with the ones known in literature. Conclusion concerning the effectiveness of method are given.
Institute of Scientific and Technical Information of China (English)
谭亚茹
2016-01-01
The quadratic Higher Algebra is an important part of this paper, the definition of quadratic forms, introduces the second type of representation, and then describes how to use the allocation method, elementary transformation, orthogonal transformation method, etc. II second type into the standard form, and the second type of normal form, finally introduced posi-tive definite quadratic form and method for determining positive definite quadratic form.%二次型是高等代数的重要组成部分，本文从二次型的定义出发，介绍了二次型的表示方法，然后介绍了如何用配方法、初等变换法、正交变换法等将二次型化为标准形，以及二次型的规范形，最后介绍了正定二次型和判定正定二次型的方法。
On Quadratic Programming with a Ratio Objective
Bhaskara, Aditya; Manokaran, Rajsekar; Vijayaraghavan, Aravindan
2011-01-01
Quadratic Programming (QP) is the well-studied problem of maximizing over {-1,1} values the quadratic form \\sum_ij a_ij x_i x_j. QP captures many known combinatorial optimization problems and SDP techniques have given optimal approximation algorithms for many of these problems. We extend this body of work by initiating the study of Quadratic Programming problems where the variables take values in the domain {-1,0,1}. The specific problem we study is: QP-Ratio: max_{-1,0,1}^n (x^T A x) / (x^T x). This objective function is a natural relative of several well studied problems. Yet, it is a good testbed for both algorithms and complexity because the techniques used for quadratic problems for the {-1,1} and {0,1} domains do not seem to carry over to the {-1,0,1} domain. We give approximation algorithms and evidence for the hardness of approximating the QP-Ratio problem. We consider an SDP relaxation obtained by adding constraints to the natural SDP relaxation for this problem and obtain an O(n^{2/7}) algorithm for...
Distortion control of conjugacies between quadratic polynomials
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
We use a new type of distortion control of univalent functions to give an alternative proof of Douady-Hubbard’s ray-landing theorem for quadratic Misiurewicz polynomials. The univalent maps arise from Thurston’s iterated algorithm on perturbation of such polynomials.
Target manifold formation using a quadratic SDF
Hester, Charles F.; Risko, Kelly K. D.
2013-05-01
Synthetic Discriminant Function (SDF) formulation of correlation filters provides constraints for forming target subspaces for a target set. In this paper we extend the SDF formulation to include quadratic constraints and use this solution to form nonlinear manifolds in the target space. The theory for forming these manifolds will be developed and demonstrated with data.
The GCD property and irreduciable quadratic polynomials
Directory of Open Access Journals (Sweden)
Saroj Malik
1986-01-01
Full Text Available The proof of the following theorem is presented: If D is, respectively, a Krull domain, a Dedekind domain, or a Prüfer domain, then D is correspondingly a UFD, a PID, or a Bezout domain if and only if every irreducible quadratic polynomial in D[X] is a prime element.
Modulational instability in periodic quadratic nonlinear materials
DEFF Research Database (Denmark)
Corney, Joel Frederick; Bang, Ole
2001-01-01
We investigate the modulational instability of plane waves in quadratic nonlinear materials with linear and nonlinear quasi-phase-matching gratings. Exact Floquet calculations, confirmed by numerical simulations, show that the periodicity can drastically alter the gain spectrum but never complete...
Integration of the Quadratic Function and Generalization
Mitsuma, Kunio
2011-01-01
We will first recall useful formulas in integration that simplify the calculation of certain definite integrals with the quadratic function. A main formula relies only on the coefficients of the function. We will then explore a geometric proof of one of these formulas. Finally, we will extend the formulas to more general cases. (Contains 3…
Solitons in quadratic nonlinear photonic crystals
DEFF Research Database (Denmark)
Corney, Joel Frederick; Bang, Ole
2001-01-01
We study solitons in one-dimensional quadratic nonlinear photonic crystals with modulation of both the linear and nonlinear susceptibilities. We derive averaged equations that include induced cubic nonlinearities, which can be defocusing, and we numerically find previously unknown soliton families...
Range-based estimation of quadratic variation
DEFF Research Database (Denmark)
Christensen, Kim; Podolskij, Mark
In this paper, we propose using realized range-based estimation to draw inference about the quadratic variation of jump-diffusion processes. We also construct a new test of the hypothesis that an asset price has a continuous sample path. Simulated data shows that our approach is efficient, the test...
Range-based estimation of quadratic variation
DEFF Research Database (Denmark)
Christensen, Kim; Podolskij, Mark
This paper proposes using realized range-based estimators to draw inference about the quadratic variation of jump-diffusion processes. We also construct a range-based test of the hypothesis that an asset price has a continuous sample path. Simulated data shows that our approach is efficient...
Quadratically constrained quadratic programs on acyclic graphs with application to power flow
Bose, Subhonmesh; Low, Steven H; Chandy, K Mani
2012-01-01
This paper proves that non-convex quadratically constrained quadratic programs have an exact semidefinite relaxation when their underlying graph is acyclic, provided the constraint set satisfies a certain technical condition. When the condition is not satisfied, we propose a heuristic to obtain a feasible point starting from a solution of the relaxed problem. These methods are then demonstrated to provide exact solutions to a richer class of optimal power flow problems than previously solved.
Geometric Approaches to Quadratic Equations from Other Times and Places.
Allaire, Patricia R.; Bradley, Robert E.
2001-01-01
Focuses on geometric solutions of quadratic problems. Presents a collection of geometric techniques from ancient Babylonia, classical Greece, medieval Arabia, and early modern Europe to enhance the quadratic equation portion of an algebra course. (KHR)
On quadratic residue codes and hyperelliptic curves
Directory of Open Access Journals (Sweden)
David Joyner
2008-01-01
Full Text Available For an odd prime p and each non-empty subset S⊂GF(p, consider the hyperelliptic curve X S defined by y 2 =f S (x, where f S (x = ∏ a∈S (x-a. Using a connection between binary quadratic residue codes and hyperelliptic curves over GF(p, this paper investigates how coding theory bounds give rise to bounds such as the following example: for all sufficiently large primes p there exists a subset S⊂GF(p for which the bound |X S (GF(p| > 1.39p holds. We also use the quasi-quadratic residue codes defined below to construct an example of a formally self-dual optimal code whose zeta function does not satisfy the ``Riemann hypothesis.''
Linear quadratic output tracking and disturbance rejection
Karimi-Ghartemani, Masoud; Khajehoddin, S. Ali; Jain, Praveen; Bakhshai, Alireza
2011-08-01
This article introduces the problem of linear quadratic tracking (LQT) where the objective is to design a closed-loop control scheme such that the output signal of the system optimally tracks a given reference signal and rejects a given disturbance. Different performance indices that have been used to address the tracking problem are discussed and an appropriate new form is introduced. It is shown that a solution to the proposed optimality index exists under very mild conditions of stabilisability and detectability of the plant state-space equations. The solution is formulated based on converting the LQT problem to a standard linear quadratic regulation problem. The method is applied to two examples, a first-order plant and a third-order plant, and their simulation results are presented and discussed.
Estimating quadratic variation using realized variance
DEFF Research Database (Denmark)
Barndorff-Nielsen, Ole Eiler; Shephard, N.
2002-01-01
This paper looks at some recent work on estimating quadratic variation using realized variance (RV) - that is, sums of M squared returns. This econometrics has been motivated by the advent of the common availability of high-frequency financial return data. When the underlying process is a semimar......This paper looks at some recent work on estimating quadratic variation using realized variance (RV) - that is, sums of M squared returns. This econometrics has been motivated by the advent of the common availability of high-frequency financial return data. When the underlying process...... have to impose some weak regularity assumptions. We illustrate the use of the limit theory on some exchange rate data and some stock data. We show that even with large values of M the RV is sometimes a quite noisy estimator of integrated variance. Copyright © 2002 John Wiley & Sons, Ltd....
Lambda-Lifting in Quadratic Time
DEFF Research Database (Denmark)
Danvy, Olivier; Schultz, Ulrik Pagh
2002-01-01
Lambda-lifting is a program transformation that is used in compilers, partial evaluators, and program transformers. In this article, we show how to reduce its complexity from cubic time to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda-lifting...... that yields the cubic factor in the traditional formulation of lambda-lifting, which is due to Johnsson. This search is carried out by computing a transitive closure. To reduce the complexity of lambda-lifting, we partition the call graph of the source program into strongly connected components, based...... of lambda-lifting from O(n^3) to O(n^2) . where n is the size of the program. Since a lambda-lifter can output programs of size O(n^2), our algorithm is asympotically optimal....
Lambda-Lifting in Quadratic Time
DEFF Research Database (Denmark)
Danvy, Olivier; Schultz, Ulrik Pagh
2004-01-01
Lambda-lifting is a program transformation that is used in compilers, partial evaluators, and program transformers. In this article, we show how to reduce its complexity from cubic time to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda-lifting...... that yields the cubic factor in the traditional formulation of lambda-lifting, which is due to Johnsson. This search is carried out by computing a transitive closure. To reduce the complexity of lambda-lifting, we partition the call graph of the source program into strongly connected components, based...... of lambda-lifting from O(n^3) to O(n^2) . where n is the size of the program. Since a lambda-lifter can output programs of size O(n^2), our algorithm is asympotically optimal....
Lambda-Lifting in Quadratic Time
DEFF Research Database (Denmark)
Danvy, Olivier; Schultz, Ulrik Pagh
2003-01-01
Lambda-lifting is a program transformation that is used in compilers, partial evaluators, and program transformers. In this article, we show how to reduce its complexity from cubic time to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda-lifting...... that yields the cubic factor in the traditional formulation of lambda-lifting, which is due to Johnsson. This search is carried out by computing a transitive closure. To reduce the complexity of lambda-lifting, we partition the call graph of the source program into strongly connected components, based...... of lambda-lifting from O(n^3) to O(n^2) . where n is the size of the program. Since a lambda-lifter can output programs of size O(n^2), our algorithm is asympotically optimal....
Lambda-lifting in Quadratic Time
DEFF Research Database (Denmark)
Danvy, O.; Schultz, U.P.
2004-01-01
Lambda-lifting is a program transformation that is used in compilers, partial evaluators, and program transformers. In this article, we show how to reduce its complexity from cubic time to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda-lifting...... that yields the cubic factor in the traditional formulation of lambda-lifting, which is due to Johnsson. This search is carried out by computing a transitive closure. To reduce the complexity of lambda-lifting, we partition the call graph of the source program into strongly connected components, based...... of lambda-lifting from O(n^3) to O(n^2) . where n is the size of the program. Since a lambda-lifter can output programs of size O(n^2), our algorithm is asympotically optimal....
Quaternion orders, quadratic forms, and Shimura curves
Alsina, Montserrat
2004-01-01
Shimura curves are a far-reaching generalization of the classical modular curves. They lie at the crossroads of many areas, including complex analysis, hyperbolic geometry, algebraic geometry, algebra, and arithmetic. The text provides an introduction to the subject from a theoretic and algorithmic perspective. The main topics covered in it are Shimura curves defined over the rational number field, the construction of their fundamental domains, and the determination of their complex multiplication points. The study of complex multiplication points in Shimura curves leads to the study of families of binary quadratic forms with algebraic coefficients and to their classification by arithmetic Fuchsian groups. In this regard, the authors develop a theory full of new possibilities which parallels Gauss' theory on the classification of binary quadratic forms with integral coefficients by the action of the modular group. Each topic covered in the book begins with a theoretical discussion followed by carefully worked...
A Finite Continuation Algorithm for Bound Constrained Quadratic Programming
DEFF Research Database (Denmark)
Madsen, Kaj; Nielsen, Hans Bruun; Pinar, Mustafa C.
1999-01-01
The dual of the strictly convex quadratic programming problem with unit bounds is posed as a linear $\\ell_1$ minimization problem with quadratic terms. A smooth approximation to the linear $\\ell_1$ function is used to obtain a parametric family of piecewise-quadratic approximation problems...
Elementary Components of the Quadratic Assignment Problem
Chicano, Francisco; Alba, Enrique
2011-01-01
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP can be written as the sum of three elementary landscapes when the swap neighborhood is used. We present a closed formula for each of the three elementary components and we compute bounds for the autocorrelation coefficient.
Cubic Lienard Equations with Quadratic Damping (Ⅱ)
Institute of Scientific and Technical Information of China (English)
Yu-quan Wang; Zhu-jun Jing
2002-01-01
Applying Hopf bifurcation theory and qualitative theory, we show that the general cubic Lienard equations with quadratic damping have at most three limit cycles. This implies that the guess in which the system has at most two limit cycles is false. We give the sufficient conditions for the system has at most three limit cycles or two limit cycles. We present two examples with three limit cycles or two limit cycles by using numerical simulation.
Characterization of a Quadratic Function in Rn
Xu, Conway
2010-01-01
It is proved that a scalar-valued function "f"(x) defined in "n"-dimensional space must be quadratic, if the intersection of tangent planes at x[subscript 1] and x[subscript 2] always contains the midpoint of the line joining x[subscript 1] and x[subscript 2]. This is the converse of a result of Stenlund proved in this JOURNAL in 2001.
Quadratic forms representing all odd positive integers
Rouse, Jeremy
2011-01-01
We consider the problem of classifying all positive-definite integer-valued quadratic forms that represent all positive odd integers. Kaplansky considered this problem for ternary forms, giving a list of 23 candidates, and proving that 19 of those represent all positive odds. (Jagy later dealt with a 20th candidate.) Assuming that the remaining three forms represent all positive odds, we prove that an arbitrary, positive-definite quadratic form represents all positive odds if and only if it represents the odd numbers from 1 up to 451. This result is analogous to Bhargava and Hanke's celebrated 290-theorem. In addition, we prove that these three remaining ternaries represent all positive odd integers, assuming the generalized Riemann hypothesis. This result is made possible by a new analytic method for bounding the cusp constants of integer-valued quaternary quadratic forms $Q$ with fundamental discriminant. This method is based on the analytic properties of Rankin-Selberg $L$-functions, and we use it to prove...
Optimal Approximation of Quadratic Interval Functions
Koshelev, Misha; Taillibert, Patrick
1997-01-01
Measurements are never absolutely accurate, as a result, after each measurement, we do not get the exact value of the measured quantity; at best, we get an interval of its possible values, For dynamically changing quantities x, the additional problem is that we cannot measure them continuously; we can only measure them at certain discrete moments of time t(sub 1), t(sub 2), ... If we know that the value x(t(sub j)) at a moment t(sub j) of the last measurement was in the interval [x-(t(sub j)), x + (t(sub j))], and if we know the upper bound D on the rate with which x changes, then, for any given moment of time t, we can conclude that x(t) belongs to the interval [x-(t(sub j)) - D (t - t(sub j)), x + (t(sub j)) + D (t - t(sub j))]. This interval changes linearly with time, an is, therefore, called a linear interval function. When we process these intervals, we get an expression that is quadratic and higher order w.r.t. time t, Such "quadratic" intervals are difficult to process and therefore, it is necessary to approximate them by linear ones. In this paper, we describe an algorithm that gives the optimal approximation of quadratic interval functions by linear ones.
Wind turbine power tracking using an improved multimodel quadratic approach.
Khezami, Nadhira; Benhadj Braiek, Naceur; Guillaud, Xavier
2010-07-01
In this paper, an improved multimodel optimal quadratic control structure for variable speed, pitch regulated wind turbines (operating at high wind speeds) is proposed in order to integrate high levels of wind power to actively provide a primary reserve for frequency control. On the basis of the nonlinear model of the studied plant, and taking into account the wind speed fluctuations, and the electrical power variation, a multimodel linear description is derived for the wind turbine, and is used for the synthesis of an optimal control law involving a state feedback, an integral action and an output reference model. This new control structure allows a rapid transition of the wind turbine generated power between different desired set values. This electrical power tracking is ensured with a high-performance behavior for all other state variables: turbine and generator rotational speeds and mechanical shaft torque; and smooth and adequate evolution of the control variables. 2010 ISA. Published by Elsevier Ltd. All rights reserved.
Electroweak vacuum stability and finite quadratic radiative corrections
Energy Technology Data Exchange (ETDEWEB)
Masina, Isabella [Ferrara Univ. (Italy). Dipt. di Fisica e Scienze della Terra; INFN, Sezione di Ferrara (Italy); Southern Denmark Univ., Odense (Denmark). CP3-Origins; Southern Denmark Univ., Odense (Denmark). DIAS; Nardini, Germano [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Quiros, Mariano [Institucio Catalana de Recerca i Estudis Avancats (ICREA), Barcelona (Spain); IFAE-IAB, Barcelona (Spain)
2015-07-15
If the Standard Model (SM) is an effective theory, as currently believed, it is valid up to some energy scale Λ to which the Higgs vacuum expectation value is sensitive throughout radiative quadratic terms. The latter ones destabilize the electroweak vacuum and generate the SM hierarchy problem. For a given perturbative Ultraviolet (UV) completion, the SM cutoff can be computed in terms of fundamental parameters. If the UV mass spectrum involves several scales the cutoff is not unique and each SM sector has its own UV cutoff Λ{sub i}. We have performed this calculation assuming the Minimal Supersymmetric Standard Model (MSSM) is the SM UV completion. As a result, from the SM point of view, the quadratic corrections to the Higgs mass are equivalent to finite threshold contributions. For the measured values of the top quark and Higgs masses, and depending on the values of the different cutoffs Λ{sub i}, these contributions can cancel even at renormalization scales as low as multi-TeV, unlike the case of a single cutoff where the cancellation only occurs at Planckian energies, a result originally obtained by Veltman. From the MSSM point of view, the requirement of stability of the electroweak minimum under radiative corrections is incorporated into the matching conditions and provides an extra constraint on the Focus Point solution to the little hierarchy problem in the MSSM. These matching conditions can be employed for precise calculations of the Higgs sector in scenarios with heavy supersymmetric fields.
Local Points on Quadratic Twists of X_0(N)
Ozman, Ekin
2009-01-01
Let X^d(N) be the quadratic twist of the modular curve X_0(N) through the Atkin-Lehner involution w_N and a quadratic extension Q(\\sqrt{d})/Q. The points of X^d(N)(Q) are precisely the Q(\\sqrt{d})-rational points of X_0(N) that are fixed by \\sigma composition w_N, where \\sigma is the generator of Gal(Q(\\sqrt{d})/Q).Ellenberg asked the following question: For which d and N does X^d(N) have rational points over every completion of Q? Given (N,d,p) we give necessary and sufficient conditions for the existence of a Q_p-rational point on X^d(N), whenever p is not simultaneously ramified in Q(\\sqrt{d}) and Q(\\sqrt{-N}), answering Ellenberg's question for all odd primes p when (N,d)=1. The main theorem yields a population of curves which have local points everywhere but no points over Q; in several cases we show that this obstruction to the Hasse Principle is explained by the Brauer-Manin obstruction.
Electroweak vacuum stability and finite quadratic radiative corrections
Masina, Isabella; Nardini, Germano; Quiros, Mariano
2015-08-01
If the Standard Model (SM) is an effective theory, as currently believed, it is valid up to some energy scale Λ to which the Higgs vacuum expectation value is sensitive throughout radiative quadratic terms. The latter ones destabilize the electroweak vacuum and generate the SM hierarchy problem. For a given perturbative ultraviolet (UV) completion, the SM cutoff can be computed in terms of fundamental parameters. If the UV mass spectrum involves several scales, the cutoff is not unique and each SM sector has its own UV cutoff Λi. We have performed this calculation assuming the minimal supersymmetric standard model (MSSM) is the SM UV completion. As a result, from the SM point of view, the quadratic corrections to the Higgs mass are equivalent to finite threshold contributions. For the measured values of the top quark and Higgs masses, and depending on the values of the different cutoffs Λi, these contributions can cancel even at renormalization scales as low as multi-TeV, unlike the case of a single cutoff where the cancellation only occurs at Planckian energies, a result originally obtained by Veltman. From the MSSM point of view, the requirement of stability of the electroweak minimum under radiative corrections is incorporated into the matching conditions and provides an extra constraint on the focus point solution to the little hierarchy problem in the MSSM. These matching conditions can be employed for precise calculations of the Higgs sector in scenarios with heavy supersymmetric fields.
Evidence for Quadratic Tidal Tensor Bias from the Halo Bispectrum
Baldauf, Tobias; Desjacques, Vincent; McDonald, Patrick
2012-01-01
The relation between the clustering properties of luminous matter in the form of galaxies and the underlying dark matter distribution is of fundamental importance for the interpretation of ongoing and upcoming galaxy surveys. The so called local bias model, where galaxy density is a function of local matter density, is frequently discussed as a means to infer the matter power spectrum or correlation function from the measured galaxy correlation. However, gravitational evolution generates a term quadratic in the tidal tensor and thus non-local in the density field, even if this term is absent in the initial conditions (Lagrangian space). Because the term is quadratic, it contributes as a loop correction to the power spectrum, so the standard linear bias picture still applies on large scales, however, it contributes at leading order to the bispectrum for which it is significant on all scales. Such a term could also be present in Lagrangian space if halo formation were influenced by the tidal field. We measure t...
Quadratic vs cubic spline-wavelets for image representations and compression
Marais, P.C.; Blake, E.H.; Kuijk, A.A.M.
1997-01-01
The Wavelet Transform generates a sparse multi-scale signal representation which may be readily compressed. To implement such a scheme in hardware, one must have a computationally cheap method of computing the necessary transform data. The use of semi-orthogonal quadratic spline wavelets allows one
Quadratic vs cubic spline-wavelets for image representation and compression
Marais, P.C.; Blake, E.H.; Kuijk, A.A.M.
1994-01-01
The Wavelet Transform generates a sparse multi-scale signal representation which may be readily compressed. To implement such a scheme in hardware, one must have a computationally cheap method of computing the necessary ransform data. The use of semi-orthogonal quadratic spline wavelets allows one t
DEFF Research Database (Denmark)
Bache, Morten
2009-01-01
The dispersion of index-guiding microstructured polymer optical fibers is calculated for second-harmonic generation. The quadratic nonlinearity is assumed to come from poling of the polymer, which in this study is chosen to be the cyclic olefin copolymer Topas. We found a very large phase mismatch...
Management of the orbital angular momentum of vortex beams in a quadratic nonlinear interaction
Bovino, Fabio A; Bertolotti, Mario; Sibilia, Concita
2011-01-01
Light intensity control of the orbital angular momentum of the fundamental beam in a quadratic nonlinear process is theoretically and numerically presented. In particular we analyzed a seeded second harmonic generation process in presence of orbital angular momentum of the interacting beams due both to on axis and off axis optical vortices. Examples are proposed and discussed.
Resurrecting Quadratic Inflation in No-Scale Supergravity in Light of BICEP2
Ellis, John; Nanopoulos, Dimitri V; Olive, Keith A
2014-01-01
The magnitude of primordial tensor perturbations reported by the BICEP2 experiment is consistent with simple models of chaotic inflation driven by a single scalar field with a power-law potential \\propto \\phi^n: n \\simeq 2, in contrast to the WMAP and Planck results, which favored models resembling the Starobinsky R + R^2 model if running of the scalar spectral index could be neglected. While models of inflation with a quadratic potential may be constructed in simple N=1 supergravity, these constructions are more challenging in no-scale supergravity. We discuss here how quadratic inflation can be accommodated within supergravity, focussing primarily on the no-scale case. We also argue that the quadratic inflaton may be identified with the supersymmetric partner of a singlet (right-handed) neutrino, whose subsequent decay could have generated the baryon asymmetry via leptogenesis.
Resurrecting quadratic inflation in no-scale supergravity in light of BICEP2
Energy Technology Data Exchange (ETDEWEB)
Ellis, John [Theoretical Particle Physics and Cosmology Group, Department of Physics, King' s College London, London, WC2R 2LS (United Kingdom); García, Marcos A.G.; Olive, Keith A. [William I. Fine Theoretical Physics Institute, School of Physics and Astronomy, University of Minnesota, 116 Church Street SE, Minneapolis, MN, 55455 (United States); Nanopoulos, Dimitri V., E-mail: john.ellis@cern.ch, E-mail: garciagarcia@physics.umn.edu, E-mail: dimitri@physics.tamu.edu, E-mail: olive@physics.umn.edu [George P. and Cynthia W. Mitchell Institute for Fundamental Physics and Astronomy, Texas A and M University, College Station, Texas, 77843 (United States)
2014-05-01
The magnitude of primordial tensor perturbations reported by the BICEP2 experiment is consistent with simple models of chaotic inflation driven by a single scalar field with a power-law potential ∝ φ{sup n} : n ≅ 2, in contrast to the WMAP and Planck results, which favored models resembling the Starobinsky R+R{sup 2} model if running of the scalar spectral index could be neglected. While models of inflation with a quadratic potential may be constructed in simple N = 1 supergravity, these constructions are more challenging in no-scale supergravity. We discuss here how quadratic inflation can be accommodated within supergravity, focusing primarily on the no-scale case. We also argue that the quadratic inflaton may be identified with the supersymmetric partner of a singlet (right-handed) neutrino, whose subsequent decay could have generated the baryon asymmetry via leptogenesis.
Constrained neural approaches to quadratic assignment problems.
Ishii, S; Sato, M
1998-08-01
In this paper, we discuss analog neural approaches to the quadratic assignment problem (QAP). These approaches employ a hard constraints scheme to restrict the domain space, and are able to obtain much improved solutions over conventional neural approaches. Since only a few strong heuristics for QAP have been known to date, our approaches are good alternatives, capable of obtaining fairly good solutions in a short period of time. Some of them can also be applied to large-scale problems, say of size N>/=300.
Automatic differentiation for reduced sequential quadratic programming
Institute of Scientific and Technical Information of China (English)
Liao Liangcai; Li Jin; Tan Yuejin
2007-01-01
In order to slove the large-scale nonlinear programming (NLP) problems efficiently, an efficient optimization algorithm based on reduced sequential quadratic programming (rSQP) and automatic differentiation (AD) is presented in this paper. With the characteristics of sparseness, relatively low degrees of freedom and equality constraints utilized, the nonlinear programming problem is solved by improved rSQP solver. In the solving process, AD technology is used to obtain accurate gradient information. The numerical results show that the combined algorithm, which is suitable for large-scale process optimization problems, can calculate more efficiently than rSQP itself.
Bianchi I solutions of effective quadratic gravity
Müller, Daniel
2012-01-01
It is believed that soon after the Planck time, Einstein's general relativity theory should be corrected to an effective quadratic theory. Numerical solutions for the anisotropic generalization of the Friedmann "flat" model $E^3$ for this effective gravity are given. It must be emphasized that although numeric, these solutions are exact in the sense that they depend only on the precision of the machine. The solutions are identified asymptotically in a certain sense. It is found solutions which asymptote de Sitter space, Minkowski space and a singularity. This work is a generalization for non diagonal spatial metrics of a previous result obtained by one of us and a collaborator for Bianchi $I$ spaces.
Linear Stability Analysis of Dynamical Quadratic Gravity
Ayzenberg, Dimitry; Yunes, Nicolas
2013-01-01
We perform a linear stability analysis of dynamical, quadratic gravity in the high-frequency, geometric optics approximation. This analysis is based on a study of gravitational and scalar modes propagating on spherically-symmetric and axially-symmetric, vacuum solutions of the theory. We find dispersion relations that do no lead to exponential growth of the propagating modes, suggesting the theory is linearly stable on these backgrounds. The modes are found to propagate at subluminal and superluminal speeds, depending on the propagating modes' direction relative to the background geometry, just as in dynamical Chern-Simons gravity.
Range-based estimation of quadratic variation
DEFF Research Database (Denmark)
Christensen, Kim; Podolskij, Mark
In this paper, we propose using realized range-based estimation to draw inference about the quadratic variation of jump-diffusion processes. We also construct a new test of the hypothesis that an asset price has a continuous sample path. Simulated data shows that our approach is efficient, the te...... is well-sized and more powerful than a return-based t-statistic for sampling frequencies normally used in empirical work. Applied to equity data, we find that the intensity of the jump process is not as high as previously reported....
Range-based estimation of quadratic variation
DEFF Research Database (Denmark)
Christensen, Kim; Podolskij, Mark
This paper proposes using realized range-based estimators to draw inference about the quadratic variation of jump-diffusion processes. We also construct a range-based test of the hypothesis that an asset price has a continuous sample path. Simulated data shows that our approach is efficient, the ......, the test is well-sized and more powerful than a return-based t-statistic for sampling frequencies normally used in empirical work. Applied to equity data, we show that the intensity of the jump process is not as high as previously reported....
Quadratic time dependent Hamiltonians and separation of variables
Anzaldo-Meneses, A.
2017-06-01
Time dependent quantum problems defined by quadratic Hamiltonians are solved using canonical transformations. The Green's function is obtained and a comparison with the classical Hamilton-Jacobi method leads to important geometrical insights like exterior differential systems, Monge cones and time dependent Gaussian metrics. The Wei-Norman approach is applied using unitary transformations defined in terms of generators of the associated Lie groups, here the semi-direct product of the Heisenberg group and the symplectic group. A new explicit relation for the unitary transformations is given in terms of a finite product of elementary transformations. The sequential application of adequate sets of unitary transformations leads naturally to a new separation of variables method for time dependent Hamiltonians, which is shown to be related to the Inönü-Wigner contraction of Lie groups. The new method allows also a better understanding of interacting particles or coupled modes and opens an alternative way to analyze topological phases in driven systems.
Threshold Signature Scheme Based on Discrete Logarithm and Quadratic Residue
Institute of Scientific and Technical Information of China (English)
FEI Ru-chun; WANG Li-na
2004-01-01
Digital signature scheme is a very important research field in computer security and modern cryptography.A(k,n) threshold digital signature scheme is proposed by integrating digital signature scheme with Shamir secret sharing scheme.It can realize group-oriented digital signature, and its security is based on the difficulty in computing discrete logarithm and quadratic residue on some special conditions.In this scheme, effective digital signature can not be generated by any k-1 or fewer legal users, or only by signature executive.In addition, this scheme can identify any legal user who presents incorrect partial digital signature to disrupt correct signature, or any illegal user who forges digital signature.A method of extending this scheme to an Abelian group such as elliptical curve group is also discussed.The extended scheme can provide rapider computing speed and stronger security in the case of using shorter key.
Quadratic forms for Feynman-Kac semigroups
Energy Technology Data Exchange (ETDEWEB)
Hibey, Joseph L. [Department of Electrical Engineering, University of Colorado at Denver, Campus Box 110, Denver, CO 80217 (United States)]. E-mail: joseph.hibey@cudenver.edu; Charalambous, Charalambos D. [Electrical and Computer Engineering Department, University of Cyprus, 75 Kallipoleos Avenue, Nicosia (Cyprus)]. E-mail: chadcha@ucy.ac.cy
2006-05-15
Some problems in a stochastic setting often involve the need to evaluate the Feynman-Kac formula that follows from models described in terms of stochastic differential equations. Equivalent representations in terms of partial differential equations are also of interest, and these establish the well-known connection between probabilistic and deterministic formulations of these problems. In this Letter, this connection is studied in terms of the quadratic form associated with the Feynman-Kac semigroup. The probability measures that naturally arise in this approach, and thus define how Brownian motion is killed at a specified rate while exiting a set, are interpreted as a random time change of the original stochastic differential equation. Furthermore, since random time changes alter the diffusion coefficients in stochastic differential equations while Girsanov-type measure transformations alter their drift coefficients, their simultaneous use should lead to more tractable solutions for some classes of problems. For example, the minimization of some quadratic forms leads to solutions that satisfy certain partial differential equations and, therefore, the techniques discussed provide a variational approach for finding these solutions.
DEFF Research Database (Denmark)
Mak, Vicky; Thomadsen, Tommy
2004-01-01
A well-known extension of the Travelling Salesman Problem (TSP) is the Selective (or Prize-collecting) TSP: In addition to the edge-costs, each node has an associated reward (denoted the node-reward) and instead of visiting all nodes, only profitable nodes are visited. The Quadratic Selective TSP...
On a general class of quadratic hopping sequences
Institute of Scientific and Technical Information of China (English)
JIA HuaDing; YUAN Ding; PENG DaiYuan; GUO Ling
2008-01-01
Based upon quadratic polynomials over the finite field, a new class of frequency hopping sequences with large family size suitable for applications in time/frequency hopping CDMA systems, multi-user radar and sonar systems is proposed and investigated. It is shown that the new time/frequency hopping sequences have at most one hit in their autocorrelation functions and at most two hits in their crosscorrelation functions except for a special case, and their family size is much larger than the conventional quadratic hopping sequences. The percentage of full collisions for the new quadratic hopping sequences is discussed. In addition, the average number of hits for the new quadratic hopping sequences, quadratic congruence sequences, extended quadratic congruence sequences and the general linear hopping sequences are also derived.
Quadratic residues and non-residues selected topics
Wright, Steve
2016-01-01
This book offers an account of the classical theory of quadratic residues and non-residues with the goal of using that theory as a lens through which to view the development of some of the fundamental methods employed in modern elementary, algebraic, and analytic number theory. The first three chapters present some basic facts and the history of quadratic residues and non-residues and discuss various proofs of the Law of Quadratic Reciprosity in depth, with an emphasis on the six proofs that Gauss published. The remaining seven chapters explore some interesting applications of the Law of Quadratic Reciprocity, prove some results concerning the distribution and arithmetic structure of quadratic residues and non-residues, provide a detailed proof of Dirichlet’s Class-Number Formula, and discuss the question of whether quadratic residues are randomly distributed. The text is a valuable resource for graduate and advanced undergraduate students as well as for mathematicians interested in number theory.
On Quadratic BSDEs with Final Condition in L2
Yang, Hanlin
2015-01-01
This thesis consists of three parts. In the first part, we study $\\mathbb{L}^p$ solutions of a large class of BSDEs. Existence, comparison theorem, uniqueness and a stability result are proved. In the second part, we establish the solvability of quadratic semimartingale BSDEs. In contrast to current literature, we use Lipschitz-quadratic regularization and obtain the existence and uniqueness results with minimal assumptions. The third part is a brief summary of quadratic semimartingales and t...
Quadratic forms and Clifford algebras on derived stacks
Vezzosi, Gabriele
2013-01-01
In this paper we present an approach to quadratic structures in derived algebraic geometry. We define derived n-shifted quadratic complexes, over derived affine stacks and over general derived stacks, and give several examples of those. We define the associated notion of derived Clifford algebra, in all these contexts, and compare it with its classical version, when they both apply. Finally, we prove three main existence results for derived shifted quadratic forms over derived stacks, define ...
Robust Solutions of Uncertain Complex-valued Quadratically Constrained Programs
Institute of Scientific and Technical Information of China (English)
Da Chuan XU; Zheng Hai HUANG
2008-01-01
In this paper,we discuss complex convex quadratically constrained optimization with uncertain data.Using S-Lemma,we show that the robust counterpart of complex convex quadratically constrained optimization with ellipsoidal or intersection-of-two-ellipsoids uncertainty set leads to a complex semidefinite program.By exploring the approximate S-Lemma,we give a complex semidefinite program which approximates the NP-hard robust counterpart of complex convex quadratic optimization with intersection-of-ellipsoids uncertainty set.
Some Aspects of Quadratic Generalized White Noise Functionals
Si, Si; Hida, Takeyuki
2009-02-01
We shall discuss some particular roles of quadratic generalized white noise functionals. First observation is made from the viewpoint of the so-called "la passage du fini à l'infini". We then come to a dual pairing of spaces formed by quadratic generalized white noise functionals. In this line, we can further discuss quadratic forms of differential operators acting on the space of white noise functionals.
Quadratic dynamical decoupling with nonuniform error suppression
Energy Technology Data Exchange (ETDEWEB)
Quiroz, Gregory; Lidar, Daniel A. [Department of Physics and Center for Quantum Information Science and Technology, University of Southern California, Los Angeles, California 90089 (United States); Departments of Electrical Engineering, Chemistry, and Physics, and Center for Quantum Information Science and Technology, University of Southern California, Los Angeles, California 90089 (United States)
2011-10-15
We analyze numerically the performance of the near-optimal quadratic dynamical decoupling (QDD) single-qubit decoherence errors suppression method [J. West et al., Phys. Rev. Lett. 104, 130501 (2010)]. The QDD sequence is formed by nesting two optimal Uhrig dynamical decoupling sequences for two orthogonal axes, comprising N{sub 1} and N{sub 2} pulses, respectively. Varying these numbers, we study the decoherence suppression properties of QDD directly by isolating the errors associated with each system basis operator present in the system-bath interaction Hamiltonian. Each individual error scales with the lowest order of the Dyson series, therefore immediately yielding the order of decoherence suppression. We show that the error suppression properties of QDD are dependent upon the parities of N{sub 1} and N{sub 2}, and near-optimal performance is achieved for general single-qubit interactions when N{sub 1}=N{sub 2}.
The Quadratic Selective Travelling Salesman Problem
DEFF Research Database (Denmark)
Thomadsen, Tommy; Stidsen, Thomas K.
2003-01-01
complication that each pair of nodes have an associated profit which can be gained only if both nodes are visited. The QSTSP is a subproblem when constructing hierarchical ring networks. We describe an integer linear programming model for the QSTSP. The QSTSP is solved by two construction heuristics...... solutions at a cost of much higher running time. All problems with up to 50 nodes are solved within one hour.......A well-known extension of the Travelling Salesman Problem (TSP) is the Selective TSP (STSP): Each node has an associated profit and instead of visiting all nodes, the most profitable set of nodes, taking into account the tour cost, is visited. The Quadratic STSP (QSTSP) adds the additional...
Compact stars with quadratic equation of state
Ngubelanga, Sifiso A; Ray, Subharthi
2015-01-01
We provide new exact solutions to the Einstein-Maxwell system of equations for matter configurations with anisotropy and charge. The spacetime is static and spherically symmetric. A quadratic equation of state is utilised for the matter distribution. By specifying a particular form for one of the gravitational potentials and the electric field intensity we obtain new exact solutions in isotropic coordinates. In our general class of models, an earlier model with a linear equation of state is regained. For particular choices of parameters we regain the masses of the stars PSR J1614-2230, 4U 1608-52, PSR J1903+0327, EXO 1745-248 and SAX J1808.4-3658. A comprehensive physical analysis for the star PSR J1903+0327 reveals that our model is reasonable.
Low-rank quadratic semidefinite programming
Yuan, Ganzhao
2013-04-01
Low rank matrix approximation is an attractive model in large scale machine learning problems, because it can not only reduce the memory and runtime complexity, but also provide a natural way to regularize parameters while preserving learning accuracy. In this paper, we address a special class of nonconvex quadratic matrix optimization problems, which require a low rank positive semidefinite solution. Despite their non-convexity, we exploit the structure of these problems to derive an efficient solver that converges to their local optima. Furthermore, we show that the proposed solution is capable of dramatically enhancing the efficiency and scalability of a variety of concrete problems, which are of significant interest to the machine learning community. These problems include the Top-k Eigenvalue problem, Distance learning and Kernel learning. Extensive experiments on UCI benchmarks have shown the effectiveness and efficiency of our proposed method. © 2012.
Lambda-Lifting in Quadratic Time
DEFF Research Database (Denmark)
Danvy, Olivier; Schultz, Ulrik Pagh
2002-01-01
Lambda-lifting is a program transformation used in compilers and in partial evaluators and that operates in cubic time. In this article, we show how to reduce this complexity to quadratic time. Lambda-lifting transforms a block-structured program into a set of recursive equations, one for each...... local function in the source program. Each equation carries extra parameters to account for the free variables of the corresponding local function and of all its callees. It is the search for these extra parameters that yields the cubic factor in the traditional formulation of lambda-lifting, which...... is not needed. We therefore simplify the search for extra parameters by treating each strongly connected component instead of each function as a unit, thereby reducing the time complexity of lambda-lifting from O(n 3 log n)toO(n2 log n), where n is the size of the program. Since a lambda-lifter can output...
Linear ultrasonic motor using quadrate plate transducer
Institute of Scientific and Technical Information of China (English)
Jiamei JIN; Chunsheng ZHAO
2009-01-01
A linear ultrasonic motor using a quadrate plate transducer was developed for precision positioning. This motor consists of two pairs of Pb(Zr, Ti)O3 piezo-electric ceramic elements, which are piezoelectrically excited into the second-bending mode of the motor stator's neutral surface in two orthogonal directions, on which the tops of four projections move along an elliptical trajectory, which in turn drives a contacted slider into linear motion via frictional forces. The coincident frequency of the stator is easily obtained for its coincident characteristic dimen-sion in two orthogonal directions. The performance characteristics achieved by the motor are: 1) a maximum linear speed of more than 60 mm/s; 2) a stroke of more than 150 mm; 3) a driving force of more than 5.0 N; and 4) a response time of about 2 ms.
Ergodesk-desktop Ergonomics Using the New Quadratic Search Algorithm
Directory of Open Access Journals (Sweden)
A. Baskar
2014-10-01
Full Text Available Ergonomics is nothing but the rules governing the workplace. ErgoDesk is the ultimate drug-free way to look after your spine and health. This research provides an interesting and realistic solution towards achieving the goal maintaining good health. Physical stress at the work environment can reduce efficiency of the individuals at work. Ergonomics is described as the rules to be adapted by one, at work environment. The main focus of ergonomics is to reduce the physical stress caused by factors like improper body mechanics, repetitive motor movements, static positions, vibrations, lighting and impact or contact with objects. Henceforth, through this paper, we present a distinct tool called the “ERGODESK”, which could be useful for monitoring a computer user’s posture and activities. In this study, we present a real time feedback system for detecting people and their postures and generating summaries of postures and activities over a specified period of time. The system runs reliably on different people and under any lighting. The fundamental challenge, to detect the change in user’s posture most accurately in the least time, has been analysed and a solution in form of new Quadratic Search Algorithm has been proposed. The system captures an image of the user at regular intervals of time, carries out certain pre-processing steps and then checks for a change in user’s posture by comparing it with a reference image acquired previously in series of steps as per the New Quadratic Search algorithm. Then the user is notified about the change of his ergonomic posture.
New Heuristic Rounding Approaches to the Quadratic Assignment Problem
Gharibi, Wajeb
2011-01-01
Quadratic assignment problem is one of the great challenges in combinatorial optimization. It has many applications in Operations research and Computer Science. In this paper, the author extends the most-used rounding approach to a one-parametric optimization model for the quadratic assignment problems. A near-optimum parameter is also predestinated. The numerical experiments confirm the efficiency.
Quadratic elongation: A quantitative measure of distortion in coordination polyhedra
Robinson, Kelly F.; Gibbs, G.V.; Ribbe, P.H.
1971-01-01
Quadratic elongation and the variance of bond angles are linearly correlated for distorted octahedral and tetrahedral coordination complexes, both of which show variations in bond length and bond angle. The quadratic elonga tion is dimensionless, giving a quantitative measure of polyhedral distortion which is independent of the effective size of the polyhedron.
Binary GCD like Algorithms for Some Complex Quadratic Rings
DEFF Research Database (Denmark)
Agarwal, Saurabh; Frandsen, Gudmund Skovbjerg
2004-01-01
binary gcd like algorithms for the ring of integers in and , one now has binary gcd like algorithms for all complex quadratic Euclidean domains. The running time of our algorithms is O(n 2) in each ring. While there exists an O(n 2) algorithm for computing the gcd in quadratic number rings by Erich...
Geometric quadratic stochastic operator on countable infinite set
Energy Technology Data Exchange (ETDEWEB)
Ganikhodjaev, Nasir; Hamzah, Nur Zatul Akmar [Department of Computational and Theoretical Sciences, Kulliyyah of Science, International Islamic University, Jalan Sultan Ahmad Shah, Bandar InderaMahkota, 25200 Kuantan, Pahang (Malaysia)
2015-02-03
In this paper we construct the family of Geometric quadratic stochastic operators defined on the countable sample space of nonnegative integers and investigate their trajectory behavior. Such operators can be reinterpreted in terms of of evolutionary operator of free population. We show that Geometric quadratic stochastic operators are regular transformations.
Quadratic Twists of Rigid Calabi–Yau Threefolds Over
DEFF Research Database (Denmark)
Gouvêa, Fernando Q.; Kiming, Ian; Yui, Noriko
2013-01-01
We consider rigid Calabi–Yau threefolds defined over Q and the question of whether they admit quadratic twists. We give a precise geometric definition of the notion of a quadratic twists in this setting. Every rigid Calabi–Yau threefold over Q is modular so there is attached to it a certain newfo...
Immunizing Conic Quadratic Optimization Problems Against Implementation Errors
Ben-Tal, A.; den Hertog, D.
2011-01-01
We show that the robust counterpart of a convex quadratic constraint with ellipsoidal implementation error is equivalent to a system of conic quadratic constraints. To prove this result we first derive a sharper result for the S-lemma in case the two matrices involved can be simultaneously diagonali
A Constructive Transition from Linear to Quadratic Functions.
Movshovitz-Hadar, Nitsa
1993-01-01
Presents an approach to quadratic functions that draws upon knowledge of linear functions by looking at the product of two linear functions. Then considers the quadratic function as the sum of three monomials. Potential advantages of each approach are discussed. (Contains 17 references.) (MDH)
Approximate *-derivations and approximate quadratic *-derivations on C*-algebras
Directory of Open Access Journals (Sweden)
Park Choonkil
2011-01-01
Full Text Available Abstract In this paper, we prove the stability of *-derivations and of quadratic *-derivations on Banach *-algebras. We moreover prove the superstability of *-derivations and of quadratic *-derivations on C*-algebras. 2000 Mathematics Subject Classification: 39B52; 47B47; 46L05; 39B72.
AdS Waves as Exact Solutions to Quadratic Gravity
Gullu, Ibrahim; Sisman, Tahsin Cagri; Tekin, Bayram
2011-01-01
We give an exact solution of the quadratic gravity in D dimensions. The solution is a plane fronted wave metric with a cosmological constant. This metric solves not only the full quadratic gravity field equations but also the linearized ones which include the linearized equations of the recently found critical gravity.
Variational viewpoint of the quadratic Markov measure field models: theory and algorithms.
Rivera, Mariano; Dalmau, Oscar
2012-03-01
We present a framework for image segmentation based on quadratic programming, i.e., by minimization of a quadratic regularized energy linearly constrained. In particular, we present a new variational derivation of the quadratic Markov measure field (QMMF) models, which can be understood as a procedure for regularizing model preferences (memberships or likelihoods). We also present efficient optimization algorithms. In the QMMFs, the uncertainty in the computed regularized probability measure field is controlled by penalizing Gini's coefficient, and hence, it affects the convexity of the quadratic programming problem. The convex case is reduced to the solution of a positive definite linear system, and for that case, an efficient Gauss-Seidel (GS) scheme is presented. On the other hand, we present an efficient projected GS with subspace minimization for optimizing the nonconvex case. We demonstrate the proposal capabilities by experiments and numerical comparisons with interactive two-class segmentation, as well as the simultaneous estimation of segmentation and (parametric and nonparametric) generative models. We present extensions to the original formulation for including color and texture clues, as well as imprecise user scribbles in an interactive framework.
Tuning quadratic nonlinear photonic crystal fibers for zero group-velocity mismatch
DEFF Research Database (Denmark)
Bache, Morten; Nielsen, Hanne; Lægsgaard, Jesper;
2006-01-01
We consider an index-guiding silica photonic crystal fiber with a triangular hole pattern and a periodically poled quadratic nonlinearity. By tuning the pitch and the relative hole size, second-harmonic generation with zero group-velocity mismatch is found for any fundamental wavelength above 780...... nm. The nonlinear strength is optimized when the fundamental has maximum confinement in the core. The conversion bandwidth allows for femtosecond-pulse conversion, and 4%-180% W-1 cm-2 relative efficiencies were found. © 2006 Optical Society of America......We consider an index-guiding silica photonic crystal fiber with a triangular hole pattern and a periodically poled quadratic nonlinearity. By tuning the pitch and the relative hole size, second-harmonic generation with zero group-velocity mismatch is found for any fundamental wavelength above 780...
Fitting timeseries by continuous-time Markov chains: A quadratic programming approach
Crommelin, D. T.; Vanden-Eijnden, E.
2006-09-01
Construction of stochastic models that describe the effective dynamics of observables of interest is an useful instrument in various fields of application, such as physics, climate science, and finance. We present a new technique for the construction of such models. From the timeseries of an observable, we construct a discrete-in-time Markov chain and calculate the eigenspectrum of its transition probability (or stochastic) matrix. As a next step we aim to find the generator of a continuous-time Markov chain whose eigenspectrum resembles the observed eigenspectrum as closely as possible, using an appropriate norm. The generator is found by solving a minimization problem: the norm is chosen such that the object function is quadratic and convex, so that the minimization problem can be solved using quadratic programming techniques. The technique is illustrated on various toy problems as well as on datasets stemming from simulations of molecular dynamics and of atmospheric flows.
QUADRATIC ADMISSIBLE ESTIMATE OF COVARIANCE IN PSEUDO-ELLIPTICAL CONTOURED DISTRIBUTION
Institute of Scientific and Technical Information of China (English)
Hengjian CUI; Xiuhong GAO
2006-01-01
This article mainly discusses the admissibility of quadratic estimate of covariance in pseudoelliptical distribution. Under the quadratic loss function, the necessary and sufficient conditions that a quadratic estimator is an admissible estimator of covariance in the class of quadratic estimators are obtained. A complete class of the quadratic estimator class is also given.
Directory of Open Access Journals (Sweden)
Rocío Meza-Moreno
2015-01-01
Full Text Available Let p=4k+1 be a prime number and Fp the finite field with p elements. For x∈1,n, Nx will denote the set of quadratic nonresidues less than or equal to x. In this work we calculate the number of quadratic nonresidues in the shifted set N(p-1/2+a.
Approximate Graph Edit Distance in Quadratic Time.
Riesen, Kaspar; Ferrer, Miquel; Bunke, Horst
2015-09-14
Graph edit distance is one of the most flexible and general graph matching models available. The major drawback of graph edit distance, however, is its computational complexity that restricts its applicability to graphs of rather small size. Recently the authors of the present paper introduced a general approximation framework for the graph edit distance problem. The basic idea of this specific algorithm is to first compute an optimal assignment of independent local graph structures (including substitutions, deletions, and insertions of nodes and edges). This optimal assignment is complete and consistent with respect to the involved nodes of both graphs and can thus be used to instantly derive an admissible (yet suboptimal) solution for the original graph edit distance problem in O(n3) time. For large scale graphs or graph sets, however, the cubic time complexity may still be too high. Therefore, we propose to use suboptimal algorithms with quadratic rather than cubic time for solving the basic assignment problem. In particular, the present paper introduces five different greedy assignment algorithms in the context of graph edit distance approximation. In an experimental evaluation we show that these methods have great potential for further speeding up the computation of graph edit distance while the approximated distances remain sufficiently accurate for graph based pattern classification.
A Quadratic Closure for Compressible Turbulence
Energy Technology Data Exchange (ETDEWEB)
Futterman, J A
2008-09-16
We have investigated a one-point closure model for compressible turbulence based on third- and higher order cumulant discard for systems undergoing rapid deformation, such as might occur downstream of a shock or other discontinuity. In so doing, we find the lowest order contributions of turbulence to the mean flow, which lead to criteria for Adaptive Mesh Refinement. Rapid distortion theory (RDT) as originally applied by Herring closes the turbulence hierarchy of moment equations by discarding third order and higher cumulants. This is similar to the fourth-order cumulant discard hypothesis of Millionshchikov, except that the Millionshchikov hypothesis was taken to apply to incompressible homogeneous isotropic turbulence generally, whereas RDT is applied only to fluids undergoing a distortion that is 'rapid' in the sense that the interaction of the mean flow with the turbulence overwhelms the interaction of the turbulence with itself. It is also similar to Gaussian closure, in which both second and fourth-order cumulants are retained. Motivated by RDT, we develop a quadratic one-point closure for rapidly distorting compressible turbulence, without regard to homogeneity or isotropy, and make contact with two equation turbulence models, especially the K-{var_epsilon} and K-L models, and with linear instability growth. In the end, we arrive at criteria for Adaptive Mesh Refinement in Finite Volume simulations.
Optimal power flow using sequential quadratic programming
Nejdawi, Imad M.
1999-11-01
Optimal power flow (OPF) is an operational as well as a planning tool used by electric utilities to help them operate their network in the most economic and secure mode of operation. Various algorithms to solve the OPF problem evolved over the past three decades; linear programming (LP) techniques were among the major mathematical programming methods utilized. The linear models of the objective function and the linearization of the constraints are the main features of these techniques. The main advantages of the LP approach are simplicity and speed. Nonlinear programming techniques have been applied to OPF solution. The major drawback is the expensive solution of large sparse systems of equations. This research is concerned with the development of a new OPF solution algorithm using sequential quadratic programming (SQP). In this formulation, a small dense system the size of which is equal to the number of control variables is solved in an inner loop. The Jacobian and Hessian terms are calculated in an outer loop. The total number of outer loop iterations is comparable to those in an ordinary load flow in contrast to 20--30 iterations in other nonlinear methods. In addition, the total number of floating point operations is less than that encountered in direct methods by two orders of magnitude. We also model dispatch over a twenty four-hour time horizon in a transmission constrained power network that includes price-responsive loads where large energy customers can operate their loads in time intervals with lowest spot prices.
Designing Camera Networks by Convex Quadratic Programming
Ghanem, Bernard
2015-05-04
In this paper, we study the problem of automatic camera placement for computer graphics and computer vision applications. We extend the problem formulations of previous work by proposing a novel way to incorporate visibility constraints and camera-to-camera relationships. For example, the placement solution can be encouraged to have cameras that image the same important locations from different viewing directions, which can enable reconstruction and surveillance tasks to perform better. We show that the general camera placement problem can be formulated mathematically as a convex binary quadratic program (BQP) under linear constraints. Moreover, we propose an optimization strategy with a favorable trade-off between speed and solution quality. Our solution is almost as fast as a greedy treatment of the problem, but the quality is significantly higher, so much so that it is comparable to exact solutions that take orders of magnitude more computation time. Because it is computationally attractive, our method also allows users to explore the space of solutions for variations in input parameters. To evaluate its effectiveness, we show a range of 3D results on real-world floorplans (garage, hotel, mall, and airport).
Linear quadratic regulator for laser beam shaping
Escárate, Pedro; Agüero, Juan C.; Zúñiga, Sebastián; Castro, Mario; Garcés, Javier
2017-07-01
The performance of an adaptive optics system depends on multiple factors, including the quality of the laser beam before being projected to the mesosphere. In general, cumbersome procedures are required to optimize the laser beam in terms of amplitude and phase. However, aberrations produced by the optics of the laser beam system are still detected during the operations due to, for example, uncertainty in the utilized models. In this paper we propose the use of feedback to overcome the presence of model uncertainty and disturbances. In particular we use a Linear Quadratic Regulator (LQR) for closed loop laser beam shaping using a setup of two deformable mirrors. The proposed method is studied and simulated to provide an automatic optimization of the Amplitude of the laser beam. The performance of the LQR control algorithm is evaluated via numerical simulations using the root mean square error (RMSE). The results show an effective amplitude correction of the laser system aberrations after 20 iterations of the algorithm, a RMSE less than 0.7 was obtained, with about 140 actuators per mirror and a separation of z=3 [m] among the mirrors.
Decentralized linear quadratic power system stabilizers for multi-machine power systems
Indian Academy of Sciences (India)
A Venkateswara Reddy; M Vijay Kumar; Indraneel Sen; Gurunath Gurrala
2012-08-01
Linear quadratic stabilizers are well-known for their superior control capabilities when compared to the conventional lead–lag power system stabilizers. However, they have not seen much of practical importance as the state variables are generally not measurable; especially the generator rotor angle measurement is not available in most of the power plants. Full state feedback controllers require feedback of other machine states in a multi-machine power system and necessitate block diagonal structure constraints for decentralized implementation. This paper investigates the design of Linear Quadratic Power System Stabilizers using a recently proposed modiﬁed Heffron–Phillip’s model. This model is derived by taking the secondary bus voltage of the step-up transformer as reference instead of the inﬁnite bus. The state variables of this model can be obtained by local measurements. This model allows a coordinated linear quadratic control design in multi machine systems. The performance of the proposed controller has been evaluated on two widely used multimachine power systems, 4 generator 10 bus and 10 generator 39 bus systems. It has been observed that the performance of the proposed controller is superior to that of the conventional Power System Stabilizers (PSS) over a wide range of operating and system conditions.
On nondecomposable positive definite Hermitian forms over imaginary quadratic fields
Institute of Scientific and Technical Information of China (English)
ZHU; Fuzu
2001-01-01
［1］Mordell, L. J., The representation of a definite quadratic form as a sum of two others, Ann. of Math., 937, 38: 75.［2］Erds, P., Ko Chao, On definite quadratic forms, which are not the sum of two definite or semidefinite forms, Acta Arith., 939, 3: 02.［3］Erds, P., Ko Chao, Some results on definite quadratic forms, J. London Math. Soc., 938, 3: 27.［4］Zhu Fu-zu, Construction of nondecomposable positive definite quadratic forms, Sci. Sinica, Ser. A, 987, 30(): 9.［5］Zhu Fuzu, On nondecomposability and indecomposability of quadratic forms, Sci. Sinica, Ser. A, 988, 3(3): 265.［6］Pleskin, W., Additively indecomposable positive integral quadratic forms, J. Number Theory, 994, 47: 273.［7］Zhu Fuzu, An existence theorem on positive definite unimodular even Hermitian forms, Chinese Ann. of Math., Ser. A, 984, 5: 33.［8］Zhu Fu-Zu, On the construction of positive definite indecomposable unimodular even Hermitian forms, J. Number Theory, 995, 30: 38.［9］O'Meara, O. T., Introduction to Quadratic Forms, Berlin, New York: Springer-Verlag, 973.［10］Zhu Fuzu, Construction of indecomposable definite Hermitian forms, Chinese Ann. of Math., Ser. B, 994, 5: 349.［11］Zhu Fuzu, On nondecomposable Hermitian forms over Gaussian domain, Acta Math. Sinica, New Ser., 998, 4: 447.
The Cyclicity of the Period Annulus Around the Quadratic Isochronous Center
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
The number of the limit cycles bifurcating in small quadratic perturbations of quadratic systems with an isochronous center is studied, it turns out that the cyclicity of the period annulus around one kind of quadratic isochronous center is two.
Linear versus quadratic portfolio optimization model with transaction cost
Razak, Norhidayah Bt Ab; Kamil, Karmila Hanim; Elias, Siti Masitah
2014-06-01
Optimization model is introduced to become one of the decision making tools in investment. Hence, it is always a big challenge for investors to select the best model that could fulfill their goal in investment with respect to risk and return. In this paper we aims to discuss and compare the portfolio allocation and performance generated by quadratic and linear portfolio optimization models namely of Markowitz and Maximin model respectively. The application of these models has been proven to be significant and popular among others. However transaction cost has been debated as one of the important aspects that should be considered for portfolio reallocation as portfolio return could be significantly reduced when transaction cost is taken into consideration. Therefore, recognizing the importance to consider transaction cost value when calculating portfolio' return, we formulate this paper by using data from Shariah compliant securities listed in Bursa Malaysia. It is expected that, results from this paper will effectively justify the advantage of one model to another and shed some lights in quest to find the best decision making tools in investment for individual investors.
Cascaded Quadratic Soliton Compression in Waveguide Structures
DEFF Research Database (Denmark)
Guo, Hairun
The generation of few-cycle, high-intensity laser pulses is of great interests in a variety of research and application fields such as time-resolved spectroscopy, bio-chemical imaging with two-photon absorptions, medical treatment, material characterization, coherent supercontinuum generation...... and tera-hertz wave generation. Commercial pulsed lasers including the solid state system and the pulsed fiber laser have promised the generation of energetic femto-second pulses with the temporal duration around much more than tens of femto-seconds. Therefore, pulse compression technologies could be used...
Chambers, David W
2005-01-01
Groups naturally promote their strengths and prefer values and rules that give them an identity and an advantage. This shows up as generational tensions across cohorts who share common experiences, including common elders. Dramatic cultural events in America since 1925 can help create an understanding of the differing value structures of the Silents, the Boomers, Gen Xers, and the Millennials. Differences in how these generations see motivation and values, fundamental reality, relations with others, and work are presented, as are some applications of these differences to the dental profession.
Combinatorics on Words in Symbolic Dynamics: The Quadratic Map
Institute of Scientific and Technical Information of China (English)
Wan Ji DAI; Kebo L(U); Jun WANG
2008-01-01
This paper is contributed to the combinatorial properties of the MSS sequences, which are the periodic kneading words of quadratic maps denned on a interval. An explicit expression of adjacency relations on MSS sequences of given lengths is established.
Modulational stability and dark solitons in periodic quadratic nonlinear media
DEFF Research Database (Denmark)
Corney, Joel Frederick; Bang, Ole
2000-01-01
We show that stable dark solitons exist in quadratic nonlinear media with periodic linear and nonlinear susceptibilities. We investigate the modulational stability of plane waves in such systems, a necessary condition for stable dark solitons....
Reconsideration on Homogeneous Quadratic Riemann Boundary Value Problem
Institute of Scientific and Technical Information of China (English)
Lu Jian-ke
2004-01-01
The homogeneous quadratic Riemann boundary value problem (1) with Hǒlder continuous coefficients for the normal case was considered by the author in 1997. But the solutions obtained there are incomplete. Here its general method of solution is obtained.
A Trust-region-based Sequential Quadratic Programming Algorithm
DEFF Research Database (Denmark)
Henriksen, Lars Christian; Poulsen, Niels Kjølstad
This technical note documents the trust-region-based sequential quadratic programming algorithm used in other works by the authors. The algorithm seeks to minimize a convex nonlinear cost function subject to linear inequalty constraints and nonlinear equality constraints....
Geometric structure of pseudo-plane quadratic flows
Sun, Che
2017-03-01
Quadratic flows have the unique property of uniform strain and are commonly used in turbulence modeling and hydrodynamic analysis. While previous applications focused on two-dimensional homogeneous fluid, this study examines the geometric structure of three-dimensional quadratic flows in stratified fluid by solving a steady-state pseudo-plane flow model. The complete set of exact solutions reveals that steady quadratic flows have an invariant conic type in the non-rotating frame and a non-rotatory vertical structure in the rotating frame. Three baroclinic solutions with vertically non-aligned formulation disprove an earlier conjecture. All elliptic and hyperbolic solutions, except for the inertial ones, exhibit vertical concentricity. The rich geometry of quadratic flows stands in contrast to the depleted geometry of high-degree polynomial flows. A paradox in the steady solutions of shallow-water reduced-gravity models is also explained.
A Simple Chaotic Image Cryptography Algorithm Based on New Quadratic Chaotic Map
Directory of Open Access Journals (Sweden)
Saad Muhi Falih
2017-07-01
Full Text Available The chaos based cryptographic methods have been suggested some new and efficient algorithms to develop image encryption techniques because of its exceptionally desirable properties of sensitivity to initial condition and parameters of chaotic map. However, this paper proposes a new symmetric image encryption system (SIES that based on a new class of quadratic chaotic map. In this proposed scheme, the image is converted to a stream of serial bits which modulo-2 added with the stream of binary chaotic sequence generated using a new class of quadratic chaotic map. Finally, the proposed system is tested under Matlab environment and results show that the proposed technique is efficient and has high security features.
A hybrid Tabu search-simulated annealing method to solve quadratic assignment problem
Directory of Open Access Journals (Sweden)
Mohamad Amin Kaviani
2014-06-01
Full Text Available Quadratic assignment problem (QAP has been considered as one of the most complicated problems. The problem is NP-Hard and the optimal solutions are not available for large-scale problems. This paper presents a hybrid method using tabu search and simulated annealing technique to solve QAP called TABUSA. Using some well-known problems from QAPLIB generated by Burkard et al. (1997 [Burkard, R. E., Karisch, S. E., & Rendl, F. (1997. QAPLIB–a quadratic assignment problem library. Journal of Global Optimization, 10(4, 391-403.], two methods of TABUSA and TS are both coded on MATLAB and they are compared in terms of relative percentage deviation (RPD for all instances. The performance of the proposed method is examined against Tabu search and the preliminary results indicate that the hybrid method is capable of solving real-world problems, efficiently.
Fuzzy Programming With Quadratic Membership Functions For Multi-objective Transportation Problem
Directory of Open Access Journals (Sweden)
Satyanarayana Murthy Akkapeddi
2015-08-01
Full Text Available In the present paper, a fuzzy programming model with quadratic membership functions has been developed for the solution of a Multi-Objective Transportation problem. In literature, several fuzzy programming approaches exist with various types of membership functions such as linear, exponential, hyperbolic etc. These membership functions are defined, by taking the lower and upper values of the objective functions into account. In some cases, these methods fail to obtain an integer compromise optimal solution. In the present method, two coefficients of the quadratic membership functions are determined by the lower and upper values of the objective functions. The other coefficient is taken as a variable in the fuzzy programming approach. This means that the membership curve is fixed at the two end points and set free in between. Application of the method on numerical examples proved that the approach could generate integer compromise optimal solutions.
Vladimirov, Igor G
2012-01-01
The paper is concerned with open quantum systems whose Heisenberg dynamics are described by quantum stochastic differential equations driven by external boson fields. The system-field coupling operators are assumed to be quadratic polynomials of the system observables, with the latter satisfying canonical commutation relations. In combination with a cubic system Hamiltonian, this leads to a class of quasilinear quantum stochastic systems which retain algebraic closedness in the evolution of mixed moments of the observables. Although such a system is nonlinear and its quantum state is no longer Gaussian, the dynamics of the moments of any order are amenable to exact analysis, including the computation of their steady-state values. In particular, a generalized criterion is developed for quadratic stability of the quasilinear systems. The results of the paper are applicable to the generation of non-Gaussian quantum states with manageable moments and an optimal design of linear quantum controllers for quasilinear...
Quadratic measurement and conditional state preparation in an optomechanical system
DEFF Research Database (Denmark)
A. Brawley, George; Vanner, Michael A.; Bowen, Warwick P.;
2014-01-01
We experimentally demonstrate, for the first time, quadratic measurement of mechanical motion in an optomechanical system. We use this nonlinear easurement to conditionally prepare classical non-Gaussian states of motion of a micro-mechanical oscillator.......We experimentally demonstrate, for the first time, quadratic measurement of mechanical motion in an optomechanical system. We use this nonlinear easurement to conditionally prepare classical non-Gaussian states of motion of a micro-mechanical oscillator....
An Interval Maximum Entropy Method for Quadratic Programming Problem
Institute of Scientific and Technical Information of China (English)
RUI Wen-juan; CAO De-xin; SONG Xie-wu
2005-01-01
With the idea of maximum entropy function and penalty function methods, we transform the quadratic programming problem into an unconstrained differentiable optimization problem, discuss the interval extension of the maximum entropy function, provide the region deletion test rules and design an interval maximum entropy algorithm for quadratic programming problem. The convergence of the method is proved and numerical results are presented. Both theoretical and numerical results show that the method is reliable and efficient.
On wave-packet dynamics in a decaying quadratic potential
DEFF Research Database (Denmark)
Møller, Klaus Braagaard; Henriksen, Niels Engholm
1997-01-01
We consider the time-dependent Schrodinger equation for a quadratic potential with an exponentially decaying force constant. General analytical solutions are presented and we highlight in particular, the signatures of classical mechanics in the wave packet dynamics.......We consider the time-dependent Schrodinger equation for a quadratic potential with an exponentially decaying force constant. General analytical solutions are presented and we highlight in particular, the signatures of classical mechanics in the wave packet dynamics....
DERIVATIVES OF EIGENPAIRS OF SYMMETRIC QUADRATIC EIGENVALUE PROBLEM
Institute of Scientific and Technical Information of China (English)
无
2005-01-01
Derivatives of eigenvalues and eigenvectors with respect to parameters in symmetric quadratic eigenvalue problem are studied. The first and second order derivatives of eigenpairs are given. The derivatives are calculated in terms of the eigenvalues and eigenvectors of the quadratic eigenvalue problem, and the use of state space representation is avoided, hence the cost of computation is greatly reduced. The efficiency of the presented method is demonstrated by considering a spring-mass-damper system.
Scale-Invariant Rotating Black Holes in Quadratic Gravity
Directory of Open Access Journals (Sweden)
Guido Cognola
2015-07-01
Full Text Available Black hole solutions in pure quadratic theories of gravity are interesting since they allow the formulation of a set of scale-invariant thermodynamics laws. Recently, we have proven that static scale-invariant black holes have a well-defined entropy, which characterizes equivalent classes of solutions. In this paper, we generalize these results and explore the thermodynamics of rotating black holes in pure quadratic gravity.
Ideal Class Groups and Subgroups of Real Quadratic Function Fields
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
In this paper, we study the real quadratic function fields K=k(D), given a necessary and sufficient condition for the ideal class group H(K) of any real quadratic function field K to have a cyclic subgroup of order n, and obtained eight series of such fields. The ideal class numbers h(OK) of K in the series all have a factor n.
Burgers' turbulence problem with linear or quadratic external potential
DEFF Research Database (Denmark)
Barndorff-Nielsen, Ole Eiler; Leonenko, N.N.
2005-01-01
We consider solutions of Burgers' equation with linear or quadratic external potential and stationary random initial conditions of Ornstein-Uhlenbeck type. We study a class of limit laws that correspond to a scale renormalization of the solutions.......We consider solutions of Burgers' equation with linear or quadratic external potential and stationary random initial conditions of Ornstein-Uhlenbeck type. We study a class of limit laws that correspond to a scale renormalization of the solutions....
On Integers, Primes and UniqueFactorization in Quadratic Fields
Hedenlund, Alice
2013-01-01
Abstract. This thesis will deal with quadratic elds. The prob- lem is to study such elds and their properties including, but not limited to, determining integers, nding primes and deciding which quadratic elds have unique factorization. The goal is to get famil- iar with these concepts and to provide a starting point for students with an interest in algebra to explore eld extensions and inte- gral closures in relation to elementary number theory. The reader will be assumed to have a basic kn...
Stability of a Generalized Quadratic Functional Equation in Schwartz Distributions
Institute of Scientific and Technical Information of China (English)
Jae-Young CHUNG
2009-01-01
We consider the Hyers-Ulam stability problem of the generalized quadratic functional equation u(o)A+v(o)B-2w(o)P1-2k(o)P2=0, which is a distributional version of the classical generalized quadratic functional equation f(x + y) + g(x - y) - 2h(x) - 2k(y) = 0.
Quadratic function approaching method for magnetotelluric soundingdata inversion
Energy Technology Data Exchange (ETDEWEB)
Liangjun, Yan; Wenbao, Hu; Zhang, Keni
2004-04-05
The quadratic function approaching method (QFAM) is introduced for magnetotelluric sounding (MT) data inversion. The method takes the advantage of that quadratic function has single extreme value, which avoids leading to an inversion solution for local minimum and ensures the solution for global minimization of an objective function. The method does not need calculation of sensitivity matrix and not require a strict initial earth model. Examples for synthetic data and field measurement data indicate that the proposed inversion method is effective.
On the use of simplex methods in constructing quadratic models
Institute of Scientific and Technical Information of China (English)
Qing-hua ZHOU
2007-01-01
In this paper, we investigate the quadratic approximation methods. After studying the basic idea of simplex methods, we construct several new search directions by combining the local information progressively obtained during the iterates of the algorithm to form new subspaces. And the quadratic model is solved in the new subspaces. The motivation is to use the information disclosed by the former steps to construct more promising directions. For most tested problems, the number of function evaluations have been reduced obviously through our algorithms.
Li, Xiangrong; Zhao, Xupei; Duan, Xiabin; Wang, Xiaoliang
2015-01-01
It is generally acknowledged that the conjugate gradient (CG) method achieves global convergence--with at most a linear convergence rate--because CG formulas are generated by linear approximations of the objective functions. The quadratically convergent results are very limited. We introduce a new PRP method in which the restart strategy is also used. Moreover, the method we developed includes not only n-step quadratic convergence but also both the function value information and gradient value information. In this paper, we will show that the new PRP method (with either the Armijo line search or the Wolfe line search) is both linearly and quadratically convergent. The numerical experiments demonstrate that the new PRP algorithm is competitive with the normal CG method.
Institute of Scientific and Technical Information of China (English)
Zi-Luan Wei
2002-01-01
A regular splitting and potential reduction method is presented for solving a quadratic programming problem with box constraints (QPB) in this paper. A general algorithm is designed to solve the QPB problem and generate a sequence of iterative points. We show that the number of iterations to generate an e-minimum solution or an e-KKT solution by the algorithm is bounded by O O(n2/∈log1/∈+nlong(1+√2n) and the total running time is bounded by O(n2(n + logn +log1/∈ )(n/∈log1/∈ + logn) ) arithmetic operations.
Application of BSDE in Standard Inventory Financing Loan
Directory of Open Access Journals (Sweden)
Hui Zhang
2017-01-01
Full Text Available This paper examines the issue of loans obtained by the small and medium-sized enterprises (SMEs from banks through the mortgage inventory of goods. And the loan-to-value (LTV ratio which affects the loan business is a very critical factor. In this paper, we provide a general framework to determine a bank’s optimal loan-to-value (LTV ratio when we consider the collateral value in the financial market with Knightian uncertainty. We assume that the short-term prices of the collateral follow a geometric Brownian motion. We use a set of equivalent martingale measures to build the models about a bank’s maximum and minimum levels of risk tolerance in an environment with Knightian uncertainty. The models about the LTV ratios are established with the bank’s maximum and minimum risk preferences. Applying backward stochastic differential equations (BSDEs, we get the explicit solutions of the models. Applying the explicit solutions, we can obtain an interval solution for the optimal LTV ratio. Our numerical analysis shows that the LTV ratio in the Knightian uncertainty-neutral environment belongs to the interval solutions derived from the models.
A transient, quadratic nodal method for triangular-Z geometry
Energy Technology Data Exchange (ETDEWEB)
DeLorey, T.F.
1993-06-01
Many systematically-derived nodal methods have been developed for Cartesian geometry due to the extensive interest in Light Water Reactors. These methods typically model the transverse-integrated flux as either an analytic or low order polynomial function of position within the node. Recently, quadratic nodal methods have been developed for R-Z and hexagonal geometry. A static and transient quadratic nodal method is developed for triangular-Z geometry. This development is particularly challenging because the quadratic expansion in each node must be performed between the node faces and the triangular points. As a consequence, in the 2-D plane, the flux and current at the points of the triangles must be treated. Quadratic nodal equations are solved using a non-linear iteration scheme, which utilizes the corrected, mesh-centered finite difference equations, and forces these equations to match the quadratic equations by computing discontinuity factors during the solution. Transient nodal equations are solved using the improved quasi-static method, which has been shown to be a very efficient solution method for transient problems. Several static problems are used to compare the quadratic nodal method to the Coarse Mesh Finite Difference (CMFD) method. The quadratic method is shown to give more accurate node-averaged fluxes. However, it appears that the method has difficulty predicting node leakages near reactor boundaries and severe material interfaces. The consequence is that the eigenvalue may be poorly predicted for certain reactor configurations. The transient methods are tested using a simple analytic test problem, a heterogeneous heavy water reactor benchmark problem, and three thermal hydraulic test problems. Results indicate that the transient methods have been implemented correctly.
Quadratic 0-1 programming: Geometric methods and duality analysis
Liu, Chunli
The unconstraint quadratic binary problem (UBQP), as a classical combinatorial problem, finds wide applications in broad field and human activities including engineering, science, finance, etc. The NP-hardness of the combinatorial problems makes a great challenge to solve the ( UBQP). The main purpose of this research is to develop high performance solution method for solving (UBQP) via the geometric properties of the objective ellipse contour and the optimal solution. This research makes several contributions to advance the state-of-the-art of geometric approach of (UBQP). These contributions include both theoretical and numerical aspects as stated below. In part I of this dissertation, certain rich geometric properties hidden behind quadratic 0-1 programming are investigated. Especially, we derive new lower bounding methods and variable fixation techniques for quadratic 0-1 optimization problems by investigating geometric features of the ellipse contour of a (perturbed) convex quadratic function. These findings further lead to some new optimality conditions for quadratic 0-1 programming. Integrating these novel solution schemes into a proposed solution algorithm of a branch-and-bound type, we obtain promising preliminary computational results. In part II of this dissertation, we present new results of the duality gap between the binary quadratic optimization problem and its Lagrangian dual. We first derive a necessary and sufficient condition for the zero duality gap and discuss its relationship with the polynomial solvability of the problem. We then characterize the zeroness of duality gap by the distance, delta, between the binary set and certain affine space C. Finally, we discuss a computational procedure of the distance delta. These results provide new insights into the duality gap and polynomial solvability of binary quadratic optimization problems.
Interval-parameter robust quadratic programming for water quality management under uncertainty
Li, Y. P.; Huang, G. H.; Nie, S. L.; Mo, D. W.
2008-07-01
Effective planning of water quality management is important for facilitating sustainable socio-economic development in watershed systems. An interval-parameter robust quadratic programming (IRQP) method is developed by incorporating techniques of robust programming and interval quadratic programming within a general optimization framework. The IRQP improves upon existing quadratic programming methods, and can tackle uncertainties presented as interval numbers and fuzzy sets as well as their combinations. Moreover, it can deal with nonlinearities in the objective function such that economies-of-scale effects can be reflected. The developed method is applied to a case study of a water quality management under uncertainty. A number of decision alternatives are generated based on the interval solutions as well as the projected applicable conditions. They represent multiple decision options with various environmental and economic considerations. Willingness to accept a low economic revenue will guarantee satisfying the water quality requirements. A strong desire to acquire a high benefit will run the risk of violating environmental criteria.
Quadratic adaptive algorithm for solving cardiac action potential models.
Chen, Min-Hung; Chen, Po-Yuan; Luo, Ching-Hsing
2016-10-01
An adaptive integration method is proposed for computing cardiac action potential models accurately and efficiently. Time steps are adaptively chosen by solving a quadratic formula involving the first and second derivatives of the membrane action potential. To improve the numerical accuracy, we devise an extremum-locator (el) function to predict the local extremum when approaching the peak amplitude of the action potential. In addition, the time step restriction (tsr) technique is designed to limit the increase in time steps, and thus prevent the membrane potential from changing abruptly. The performance of the proposed method is tested using the Luo-Rudy phase 1 (LR1), dynamic (LR2), and human O'Hara-Rudy dynamic (ORd) ventricular action potential models, and the Courtemanche atrial model incorporating a Markov sodium channel model. Numerical experiments demonstrate that the action potential generated using the proposed method is more accurate than that using the traditional Hybrid method, especially near the peak region. The traditional Hybrid method may choose large time steps near to the peak region, and sometimes causes the action potential to become distorted. In contrast, the proposed new method chooses very fine time steps in the peak region, but large time steps in the smooth region, and the profiles are smoother and closer to the reference solution. In the test on the stiff Markov ionic channel model, the Hybrid blows up if the allowable time step is set to be greater than 0.1ms. In contrast, our method can adjust the time step size automatically, and is stable. Overall, the proposed method is more accurate than and as efficient as the traditional Hybrid method, especially for the human ORd model. The proposed method shows improvement for action potentials with a non-smooth morphology, and it needs further investigation to determine whether the method is helpful during propagation of the action potential. Copyright © 2016 Elsevier Ltd. All rights
The generalized quadratic knapsack problem. A neuronal network approach.
Talaván, Pedro M; Yáñez, Javier
2006-05-01
The solution of an optimization problem through the continuous Hopfield network (CHN) is based on some energy or Lyapunov function, which decreases as the system evolves until a local minimum value is attained. A new energy function is proposed in this paper so that any 0-1 linear constrains programming with quadratic objective function can be solved. This problem, denoted as the generalized quadratic knapsack problem (GQKP), includes as particular cases well-known problems such as the traveling salesman problem (TSP) and the quadratic assignment problem (QAP). This new energy function generalizes those proposed by other authors. Through this energy function, any GQKP can be solved with an appropriate parameter setting procedure, which is detailed in this paper. As a particular case, and in order to test this generalized energy function, some computational experiments solving the traveling salesman problem are also included.
Symmetric quadratic Hamiltonians with pseudo-Hermitian matrix representation
Energy Technology Data Exchange (ETDEWEB)
Fernández, Francisco M., E-mail: fernande@quimica.unlp.edu.ar
2016-06-15
We prove that any symmetric Hamiltonian that is a quadratic function of the coordinates and momenta has a pseudo-Hermitian adjoint or regular matrix representation. The eigenvalues of the latter matrix are the natural frequencies of the Hamiltonian operator. When all the eigenvalues of the matrix are real, then the spectrum of the symmetric Hamiltonian is real and the operator is Hermitian. As illustrative examples we choose the quadratic Hamiltonians that model a pair of coupled resonators with balanced gain and loss, the electromagnetic self-force on an oscillating charged particle and an active LRC circuit. -- Highlights: •Symmetric quadratic operators are useful models for many physical applications. •Any such operator exhibits a pseudo-Hermitian matrix representation. •Its eigenvalues are the natural frequencies of the Hamiltonian operator. •The eigenvalues may be real or complex and describe a phase transition.
The quadratic reciprocity law a collection of classical proofs
Baumgart, Oswald
2015-01-01
This book is the English translation of Baumgart’s thesis on the early proofs of the quadratic reciprocity law (“Über das quadratische Reciprocitätsgesetz. Eine vergleichende Darstellung der Beweise”), first published in 1885. It is divided into two parts. The first part presents a very brief history of the development of number theory up to Legendre, as well as detailed descriptions of several early proofs of the quadratic reciprocity law. The second part highlights Baumgart’s comparisons of the principles behind these proofs. A current list of all known proofs of the quadratic reciprocity law, with complete references, is provided in the appendix. This book will appeal to all readers interested in elementary number theory and the history of number theory.
Parametric localized modes in quadratic nonlinear photonic structures
DEFF Research Database (Denmark)
Sukhorukov, Andrey A.; Kivshar, Yuri S.; Bang, Ole;
2001-01-01
We analyze two-color spatially localized nonlinear modes formed by parametrically coupled fundamental and second-harmonic fields excited at quadratic (or chi2) nonlinear interfaces embedded in a linear layered structure-a quadratic nonlinear photonic crystal. For a periodic lattice of nonlinear...... interfaces, we derive an effective discrete model for the amplitudes of the fundamental and second-harmonic waves at the interfaces (the so-called discrete chi2 equations) and find, numerically and analytically, the spatially localized solutions-discrete gap solitons. For a single nonlinear interface...... in a linear superlattice, we study the properties of two-color localized modes, and describe both similarities to and differences from quadratic solitons in homogeneous media....
On Volterra quadratic stochastic operators with continual state space
Energy Technology Data Exchange (ETDEWEB)
Ganikhodjaev, Nasir; Hamzah, Nur Zatul Akmar [Department of Computational and Theoretical Sciences, Faculty of Science, International Islamic University, Jalan Sultan Ahmad Shah, Bandar Indera Mahkota, 25200 Kuantan, Pahang (Malaysia)
2015-05-15
Let (X,F) be a measurable space, and S(X,F) be the set of all probability measures on (X,F) where X is a state space and F is σ - algebraon X. We consider a nonlinear transformation (quadratic stochastic operator) defined by (Vλ)(A) = ∫{sub X}∫{sub X}P(x,y,A)dλ(x)dλ(y), where P(x, y, A) is regarded as a function of two variables x and y with fixed A ∈ F . A quadratic stochastic operator V is called a regular, if for any initial measure the strong limit lim{sub n→∞} V{sup n }(λ) is exists. In this paper, we construct a family of quadratic stochastic operators defined on the segment X = [0,1] with Borel σ - algebra F on X , prove their regularity and show that the limit measure is a Dirac measure.
A Projection Neural Network for Constrained Quadratic Minimax Optimization.
Liu, Qingshan; Wang, Jun
2015-11-01
This paper presents a projection neural network described by a dynamic system for solving constrained quadratic minimax programming problems. Sufficient conditions based on a linear matrix inequality are provided for global convergence of the proposed neural network. Compared with some of the existing neural networks for quadratic minimax optimization, the proposed neural network in this paper is capable of solving more general constrained quadratic minimax optimization problems, and the designed neural network does not include any parameter. Moreover, the neural network has lower model complexities, the number of state variables of which is equal to that of the dimension of the optimization problems. The simulation results on numerical examples are discussed to demonstrate the effectiveness and characteristics of the proposed neural network.
DEFF Research Database (Denmark)
Bang, Ole; Graversen, T. W.; Clausen, Carl A. Balslev
2000-01-01
Quasi-phase-matching gratings induces Kerr effects in quadratic nonlinear materials. We show analytically and confirm numerically how modulating the grating changes the effective quadratic and cubic nonlinearities and allows for multi-wavelength second-harmonic generation....
Convergence properties of the softassign quadratic assignment algorithm.
Rangarajan, A; Vuille, A; Mjolsness, E
1999-08-15
The softassign quadratic assignment algorithm is a discrete-time, continuous-state, synchronous updating optimizing neural network. While its effectiveness has been shown in the traveling salesman problem, graph matching, and graph partitioning in thousands of simulations, its convergence properties have not been studied. Here, we construct discrete-time Lyapunov functions for the cases of exact and approximate doubly stochastic constraint satisfaction, which show convergence to a fixed point. The combination of good convergence properties and experimental success makes the softassign algorithm an excellent choice for neural quadratic assignment optimization.
Robust quadratic assignment problem with budgeted uncertain flows
Directory of Open Access Journals (Sweden)
Mohammad Javad Feizollahi
2015-12-01
Full Text Available We consider a generalization of the classical quadratic assignment problem, where material flows between facilities are uncertain, and belong to a budgeted uncertainty set. The objective is to find a robust solution under all possible scenarios in the given uncertainty set. We present an exact quadratic formulation as a robust counterpart and develop an equivalent mixed integer programming model for it. To solve the proposed model for large-scale instances, we also develop two different heuristics based on 2-Opt local search and tabu search algorithms. We discuss performance of these methods and the quality of robust solutions through extensive computational experiments.
Selectable linear or quadratic coupling in an optomechanical system
Xuereb, André
2012-01-01
There has been much interest recently in the analysis of optomechanical systems incorporating dielectric nano- or microspheres inside a cavity field. We analyse here the situation when one of the mirrors of the cavity itself is also allowed to move. We reveal that the interplay between the two oscillators yields a cross-coupling that results in, e.g., appreciable cooling and squeezing of the motion of the sphere, despite its nominal quadratic coupling. We also discuss a simple modification that would allow this cross-coupling to be removed at will, thereby yielding a purely quadratic coupling for the sphere.
The size of quadratic $p$-adic linearization disks
Lindahl, Karl-Olof
2013-01-01
We find the exact radius of linearization disks at indifferent fixed points of quadratic maps in $\\mathbb{C}_p$. We also show that the radius is invariant under power series perturbations. Localizing all periodic orbits of these quadratic-like maps we then show that periodic points are not the only obstruction for linearization. In so doing, we provide the first known examples in the dynamics of polynomials over $\\mathbb{C}_p$ where the boundary of the linearization disk does not contain any ...
On the use of simplex methods in constructing quadratic models
Institute of Scientific and Technical Information of China (English)
2007-01-01
In this paper,we investigate the quadratic approximation methods.After studying the basic idea of simplex methods,we construct several new search directions by combining the local information progressively obtained during the iterates of the algorithm to form new subspaces.And the quadratic model is solved in the new subspaces.The motivation is to use the information disclosed by the former steps to construct more promising directions.For most tested problems,the number of function evaluations have been reduced obviously through our algorithms.
New robust chaotic system with exponential quadratic term
Institute of Scientific and Technical Information of China (English)
Bao Bo-Cheng; Li Chun-Biao; Xu Jian-Peing; Liu Zhong
2008-01-01
This paper proposes a new robust chaotic system of three-dimensional quadratic autonomous ordinary differential equations by introducing an exponential quadratic term.This system can display a double-scroll chaotic attractor with only two equilibria,and can be found to be robust chaotic in a very wide parameter domain with positive maximum Lyapunov exponent.Some basic dynamical properties and chaotic behaviour of novel attractor are studied.By numerical simulation,this paper verifies that the three-dimensional system can also evolve into periodic and chaotic behaviottrs by a constant controller.
Approximation algorithms for indefinite complex quadratic maximization problems
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
In this paper,we consider the following indefinite complex quadratic maximization problem: maximize zHQz,subject to zk ∈ C and zkm = 1,k = 1,...,n,where Q is a Hermitian matrix with trQ = 0,z ∈ Cn is the decision vector,and m 3.An (1/log n) approximation algorithm is presented for such problem.Furthermore,we consider the above problem where the objective matrix Q is in bilinear form,in which case a 0.7118 cos mπ 2approximation algorithm can be constructed.In the context of quadratic optimization,various extensions and connections of the model are discussed.
Simultaneous quadratic performance stabilization for linear time-delay systems
Institute of Scientific and Technical Information of China (English)
Chen Yuepeng; Zhou Zude; Liu Huanbin; Zhang Qingling
2006-01-01
A newly designed approach of simultaneous stabilization is given for linear discrete time-delay systems. The problem of stabilization for a collection of systems is discussed initially. Adequate condition are obtained in terms of linear matrix inequalities (LMIs) which are independent of time delays such that the resultant collection of discrete time-delay systems are stable with an upper bound of the quadratic performance index. Subsequently, controllers are designed such that the resultant closed-loop discrete time-delay systems are simultaneously stabilized with the upper bound of the quadratic performance index. Finally,a numerical example is given to illustrate the design method.
PORTAL SUPPLY TO CAUDATE LOBE AND QUADRATE LOBE OF LIVER
Directory of Open Access Journals (Sweden)
Maheswari
2015-09-01
Full Text Available The precise knowledge of intra hepatic branching pattern of portal vein to caudate lobe and quadrate lobe is important for Gastroenterologist during hepatic segmental and subsegmental resection. The study was done in 47 adult human liver specimens. In this study methods like Manual dissection and Contrast study were used. During this study the portal branches to caudate l obe, Quadrate lobe and accessory branches to segment IV in addition to its branches were observed. The results were compared with previous studies
Sparse Signal Recovery from Quadratic Measurements via Convex Programming
Li, Xiaodong; Voroninski, Vladislav
2012-01-01
In this paper we consider a system of quadratic equations ||^2 = b_j, j = 1, ..., m, where x in R^n is unknown while normal random vectors z_j in R_n and quadratic measurements b_j in R are known. The system is assumed to be underdetermined, i.e., m < n. We prove that if there exists a sparse solution x, i.e., at most k components of x are non-zero, then by solving a convex optimization program, we can solve for x up to a multiplicative constant with high probability, provided that k
Projection of curves on B-spline surfaces using quadratic reparameterization
Yang, Yijun
2010-09-01
Curves on surfaces play an important role in computer aided geometric design. In this paper, we present a hyperbola approximation method based on the quadratic reparameterization of Bézier surfaces, which generates reasonable low degree curves lying completely on the surfaces by using iso-parameter curves of the reparameterized surfaces. The Hausdorff distance between the projected curve and the original curve is controlled under the user-specified distance tolerance. The projected curve is T-G 1 continuous, where T is the user-specified angle tolerance. Examples are given to show the performance of our algorithm. © 2010 Elsevier Inc. All rights reserved.
General complex envelope solutions of coupled-mode optics with quadratic or cubic nonlinearity
Hesketh, Graham D
2015-01-01
The analytic general solutions for the complex field envelopes are derived using Weierstrass elliptic functions for two and three mode systems of differential equations coupled via quadratic $\\chi_2$ type nonlinearity as well as two mode systems coupled via cubic $\\chi_3$ type nonlinearity. For the first time, a compact form of the solutions is given involving simple ratios of Weierstrass sigma functions (or equivalently Jacobi theta functions). A Fourier series is also given. All possible launch states are considered. The models describe sum and difference frequency generation, polarization dynamics, parity-time dynamics and optical processing applications.
Debergh, N M; Samsonov, B F; Van den Bossche, B
2002-01-01
A matricial Darboux operator intertwining two one-dimensional stationary Dirac Hamiltonians is constructed. This operator is such that the potential of the second Dirac Hamiltonian as well as the corresponding eigenfunctions are determined through the knowledge of only two eigenfunctions of the first Dirac Hamiltonian. Moreover this operator together with its adjoint and the two Hamiltonians generate a quadratic deformation of the superalgebra subtending the usual supersymmetric quantum mechanics. Our developments are illustrated on the free particle case and the generalized Coulomb interaction. In the latter case, a relativistic counterpart of shape-invariance is observed.
Ulvila, Ville; Halonen, Lauri; Vainio, Markku
2015-01-01
We present an experimental study of optical frequency comb generation based on cascaded quadratic nonlinearities inside a continuous-wave-pumped optical parametric oscillator. We demonstrate comb states which produce narrow-linewidth intermode beat note signals, and we verify the mode spacing uniformity of the comb at the Hz level. We also show that spectral quality of the comb can be improved by modulating the parametric gain at a frequency that corresponds to the comb mode spacing. We have reached a high average output power of over 4 W in the near-infrared region, at ~2 {\\mu}m.
Clustered Self Organising Migrating Algorithm for the Quadratic Assignment Problem
Davendra, Donald; Zelinka, Ivan; Senkerik, Roman
2009-08-01
An approach of population dynamics and clustering for permutative problems is presented in this paper. Diversity indicators are created from solution ordering and its mapping is shown as an advantage for population control in metaheuristics. Self Organising Migrating Algorithm (SOMA) is modified using this approach and vetted with the Quadratic Assignment Problem (QAP). Extensive experimentation is conducted on benchmark problems in this area.
Analyzing Quadratic Unconstrained Binary Optimization Problems Via Multicommodity Flows.
Wang, Di; Kleinberg, Robert D
2009-11-28
Quadratic Unconstrained Binary Optimization (QUBO) problems concern the minimization of quadratic polynomials in n {0, 1}-valued variables. These problems are NP-complete, but prior work has identified a sequence of polynomial-time computable lower bounds on the minimum value, denoted by C(2), C(3), C(4),…. It is known that C(2) can be computed by solving a maximum-flow problem, whereas the only previously known algorithms for computing C(k) (k > 2) require solving a linear program. In this paper we prove that C(3) can be computed by solving a maximum multicommodity flow problem in a graph constructed from the quadratic function. In addition to providing a lower bound on the minimum value of the quadratic function on {0, 1}(n), this multicommodity flow problem also provides some information about the coordinates of the point where this minimum is achieved. By looking at the edges that are never saturated in any maximum multicommodity flow, we can identify relational persistencies: pairs of variables that must have the same or different values in any minimizing assignment. We furthermore show that all of these persistencies can be detected by solving single-commodity flow problems in the same network.
A new heuristic for the quadratic assignment problem
Zvi Drezner
2002-01-01
We propose a new heuristic for the solution of the quadratic assignment problem. The heuristic combines ideas from tabu search and genetic algorithms. Run times are very short compared with other heuristic procedures. The heuristic performed very well on a set of test problems.
HOMOCLINIC CYCLES OF A QUADRATIC SYSTEM DESCRIBED BY QUARTIC CURVES
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
This paper is devoted to discussing the topological classification of the quartic invariant algebraic curves for a quadratic system. We obtain sufficient and necessary conditions which ensure that the homoclinic cycle of the system is defined by the quartic invariant algebraic curve. Finally, the corresponding global phase diagrams are drawn.
Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations
DEFF Research Database (Denmark)
Nam, Phan Thanh; Napiorkowski, Marcin; Solovej, Jan Philip
2016-01-01
We provide general conditions for which bosonic quadratic Hamiltonians on Fock spaces can be diagonalized by Bogoliubov transformations. Our results cover the case when quantum systems have infinite degrees of freedom and the associated one-body kinetic and paring operators are unbounded. Our...
Positivity and storage functions for quadratic differential forms
Trentelman, Hendrikus; Willems, Jan C.
1996-01-01
Differential equations and one-variable polynomial matrices play an essential role in describing dynamics of systems. When studying functions of the dynamical variables or specifying performance criteria in optimal control, we invariably encounter quadratic expressions in the variables and their der
Canonical realization of Bondi-Metzner-Sachs symmetry: Quadratic Casimir
Gomis, Joaquim; Longhi, Giorgio
2016-01-01
We study the canonical realization of Bondi-Metzner-Sacks symmetry for a massive scalar field introduced by Longhi and Materassi [J. Math. Phys. 40, 480 (1999)]. We construct an invariant scalar product for the generalized momenta. As a consequence we introduce a quadratic Casimir with the supertranslations.
A Unified Approach to Teaching Quadratic and Cubic Equations.
Ward, A. J. B.
2003-01-01
Presents a simple method for teaching the algebraic solution of cubic equations via completion of the cube. Shows that this method is readily accepted by students already familiar with completion of the square as a method for quadratic equations. (Author/KHR)
Quantum electroweak symmetry breaking through loop quadratic contributions
Directory of Open Access Journals (Sweden)
Dong Bai
2015-06-01
Full Text Available Based on two postulations that (i the Higgs boson has a large bare mass mH≫mh≃125 GeV at the characteristic energy scale Mc which defines the Standard Model (SM in the ultraviolet region, and (ii quadratic contributions of Feynman loop diagrams in quantum field theories are physically meaningful, we show that the SM electroweak symmetry breaking is induced by the quadratic contributions from loop effects. As the quadratic running of Higgs mass parameter leads to an additive renormalization, which distinguishes from the logarithmic running with a multiplicative renormalization, the symmetry breaking occurs once the sliding energy scale μ moves from Mc down to a transition scale μ=ΛEW at which the additive renormalized Higgs mass parameter mH2(Mc/μ gets to change the sign. With the input of current experimental data, this symmetry breaking energy scale is found to be ΛEW≃760 GeV, which provides another basic energy scale for the SM besides Mc. Studying such a symmetry breaking mechanism could play an important role in understanding both the hierarchy problem and naturalness problem. It also provides a possible way to explore the experimental implications of the quadratic contributions as ΛEW lies within the probing reach of the LHC and the future Great Collider.
Bandit-Inspired Memetic Algorithms for Solving Quadratic Assignment Problems
Puglierin, Francesco; Drugan, Madalina M.; Wiering, Marco
2013-01-01
In this paper we propose a novel algorithm called the Bandit-Inspired Memetic Algorithm (BIMA) and we have applied it to solve different large instances of the Quadratic Assignment Problem (QAP). Like other memetic algorithms, BIMA makes use of local search and a population of solutions. The novelty
The Quadratic Assignment Problem is Easy for Robinsonian Matrices
Laurent, M.; Seminaroti, M.
2014-01-01
We present a new polynomially solvable case of the Quadratic Assignment Problem in Koopmans-Beckman form QAP(A;B), by showing that the identity permutation is optimal when A and B are respectively a Robinson similarity and dissimilarity matrix and one of A or B is a Toeplitz matrix. A Robinson (dis)
A bilinear programming solution to the quadratic assignment problem
J.F. Kaashoek (Johan); J.H.P. Paelinck (Jean)
1999-01-01
textabstractThe quadratic assignment problem (QAP) or maximum acyclical graph problem is well documented (see e.g. Pardalos and Wolkowicz, 1994). One of the authors has published some material, in which it was tried, by structuring the problem additionally, to bring it as closely as possible in the
The quadratic assignment problem is easy for robinsonian matrices
Laurent, M.; Seminaroti, M.
2015-01-01
We present a new polynomially solvable case of the Quadratic Assignment Problem in Koopmans–Beckman form QAP(A,B), by showing that the identity permutation is optimal when AA and BB are respectively a Robinson similarity and dissimilarity matrix and one of AA or BB is a Toeplitz matrix. A Robinson (
Solving quadratic programming problems by delayed projection neural network.
Yang, Yongqing; Cao, Jinde
2006-11-01
In this letter, the delayed projection neural network for solving convex quadratic programming problems is proposed. The neural network is proved to be globally exponentially stable and can converge to an optimal solution of the optimization problem. Three examples show the effectiveness of the proposed network.
A Result on Output Feedback Linear Quadratic Control
Engwerda, J.C.; Weeren, A.J.T.M.
2006-01-01
In this note we consider the static output feedback linear quadratic control problem.We present both necessary and sufficient conditions under which this problem has a solution in case the involved cost depend only on the output and control variables.This result is used to present both necessary and
Nonlocal description of X waves in quadratic nonlinear materials
DEFF Research Database (Denmark)
Larsen, Peter Ulrik Vingaard; Sørensen, Mads Peter; Bang, Ole
2006-01-01
We study localized light bullets and X-waves in quadratic media and show how the notion of nonlocality can provide an alternative simple physical picture of both types of multi-dimensional nonlinear waves. For X-waves we show that a local cascading limit in terms of a nonlinear Schrodinger equation...
ON WEIGHTED GENERALIZED FUNCTIONS ASSOCIATED WITH QUADRATIC FORMS
Directory of Open Access Journals (Sweden)
E. L. Shishkina
2016-12-01
Full Text Available In this article we consider certain types of weighted generalized functions associated with nondegenerate quadratic forms. Such functions and their derivatives are used for constructing fundamental solutions of iterated ultra-hyperbolic equations with the Bessel operator and for constructing negative real powers of ultra-hyperbolic operators with the Bessel operator.
Quadratic Lyapunov Function and Exponential Dichotomy on Time Scales
Institute of Scientific and Technical Information of China (English)
ZHANG JI; LIU ZHEN-XIN
2011-01-01
In this paper, we study the relationship between exponential dichotomy and quadratic Lyapunov function for the linear equation x△ ＝ A(t)x on time scales.Moreover, for the nonlinear perturbed equation x△ ＝ A(t)x + f(t,x) we give the instability of the zero solution when f is sufficiently small.
ANOTHER LOOK AT LINEAR-QUADRATIC OPTIMIZATION PROBLEMS OVER TIME
NIEUWENHUIS, JW
1995-01-01
We will study deterministic quadratic optimization problems over time with linear constraints by means of the behavioral approach of linear systems as developed by Willems (1986, 1989). We will start with a simple example from economics and embed this in a general framework. Then we will develop the
Entanglement entropy of fermionic quadratic band touching model
Chen, Xiao; Cho, Gil Young; Fradkin, Eduardo
2014-03-01
The entanglement entropy has been proven to be a useful tool to diagnose and characterize strongly correlated systems such as topologically ordered phases and some critical points. Motivated by the successes, we study the entanglement entropy (EE) of a fermionic quadratic band touching model in (2 + 1) dimension. This is a fermionic ``spinor'' model with a finite DOS at k=0 and infinitesimal instabilities. The calculation on two-point correlation functions shows that a Dirac fermion model and the quadratic band touching model both have the asymptotically identical behavior in the long distance limit. This implies that EE for the quadratic band touching model also has an area law as the Dirac fermion. This is in contradiction with the expectation that dense fermi systems with a finite DOS should exhibit LlogL violations to the area law of entanglement entropy (L is the length of the boundary of the sub-region) by analogy with the Fermi surface. We performed numerical calculations of entanglement entropies on a torus of the lattice models for the quadratic band touching point and the Dirac fermion to confirm this. The numerical calculation shows that EE for both cases satisfy the area law. We further verify this result by the analytic calculation on the torus geometry. This work was supported in part by the NSF grant DMR-1064319.
Finding the Best Quadratic Approximation of a Function
Yang, Yajun; Gordon, Sheldon P.
2011-01-01
This article examines the question of finding the best quadratic function to approximate a given function on an interval. The prototypical function considered is f(x) = e[superscript x]. Two approaches are considered, one based on Taylor polynomial approximations at various points in the interval under consideration, the other based on the fact…
Kronecker limit formula for real quadratic number fields(III)
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
For a kind of L-function of the real quadratic number fields, we prove a Kronecker limit formula which generalized a result of Hecke. And taking an example we give an interesting identity on a fundamental unit of such a field.
A realised volatility measurement using quadratic variation and ...
African Journals Online (AJOL)
the instantaneous volatility does not change too much as a result of a weighted average ... method is also based on quadratic variation theory, but the underlying return model is ..... [3] Barndorff-Nielsen OE & Shepard N, 2001, Non-Gaussian ...
The strong law of large numbers for random quadratic forms
Mikosch, T
1996-01-01
The paper establishes strong laws of large numbers for the quadratic forms [GRAPHICS] and the bilinear forms [GRAPHICS] where X = (X(n)) is a sequence of independent random variables and Y = (Y-n) is an independent copy of it. In the case of independent identically distributed symmetric p-stable ran
Confidence set interference with a prior quadratic bound. [in geophysics
Backus, George E.
1989-01-01
Neyman's (1937) theory of confidence sets is developed as a replacement for Bayesian interference (BI) and stochastic inversion (SI) when the prior information is a hard quadratic bound. It is recommended that BI and SI be replaced by confidence set interference (CSI) only in certain circumstances. The geomagnetic problem is used to illustrate the general theory of CSI.
Optimization with quadratic support functions in nonconvex smooth optimization
Khamisov, O. V.
2016-10-01
Problem of global minimization of twice continuously differentiable function with Lipschitz second derivatives over a polytope is considered. We suggest a branch and bound method with polytopes as partition elements. Due to the Lipschitz property of the objective function we can construct a quadratic support minorant at each point of the feasible set. Global minimum of of this minorant provides a lower bound of the objective over given partition subset. The main advantage of the suggested method consists in the following. First quadratic minorants usually are nonconvex and we have to solve auxiliary global optimization problem. This problem is reduced to a mixed 0-1 linear programming problem and can be solved by an advanced 0-1 solver. Then we show that the quadratic minorants are getting convex as soon as partition elements are getting smaller in diameter. Hence, at the final steps of the branch and bound method we solve convex auxiliary quadratic problems. Therefore, the method accelerates when we are close to the global minimum of the initial problem.
Stochastic level-value approximation for quadratic integer convex programming
Institute of Scientific and Technical Information of China (English)
PENG Zheng; WU Dong-hua
2008-01-01
We propose a stochastic level value approximation method for a quadratic integer convex minimizing problem in this paper. This method applies an importance sampling technique, and make use of the cross-entropy method to update the sample density functions. We also prove the asymptotic convergence of this algorithm, and re-port some numerical results to illuminate its effectiveness.
Semismooth Newton method for quadratic programs with bound constraints
Daryina, A. N.; Izmailov, A. F.
2009-10-01
Convex quadratic programs with bound constraints are proposed to be solved by applying a semismooth Newton method to the corresponding variational inequality. Computational experiments demonstrate that, for strongly convex problems, this approach can be considerably more efficient than more traditional approaches.
Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations
DEFF Research Database (Denmark)
Nam, Phan Thanh; Napiorkowski, Marcin; Solovej, Jan Philip
2016-01-01
We provide general conditions for which bosonic quadratic Hamiltonians on Fock spaces can be diagonalized by Bogoliubov transformations. Our results cover the case when quantum systems have infinite degrees of freedom and the associated one-body kinetic and paring operators are unbounded. Our...
Sub-quadratic decoding of one-point hermitian codes
DEFF Research Database (Denmark)
Nielsen, Johan Sebastian Rosenkilde; Beelen, Peter
2015-01-01
We present the first two sub-quadratic complexity decoding algorithms for one-point Hermitian codes. The first is based on a fast realization of the Guruswami-Sudan algorithm using state-of-the-art algorithms from computer algebra for polynomial-ring matrix minimization. The second is a power...
Cosmological Vorticity in a Gravity with Quadratic Order Curvature Couplings
Hwang, J
1998-01-01
We analyse the evolution of the rotational type cosmological perturbation in a gravity with general quadratic order gravitational coupling terms. The result is expressed independently of the generalized nature of the gravity theory, and is simply interpreted as a conservation of the angular momentum.
The strong law of large numbers for random quadratic forms
Mikosch, T
1996-01-01
The paper establishes strong laws of large numbers for the quadratic forms [GRAPHICS] and the bilinear forms [GRAPHICS] where X = (X(n)) is a sequence of independent random variables and Y = (Y-n) is an independent copy of it. In the case of independent identically distributed symmetric p-stable
DEFF Research Database (Denmark)
Pagola, Maria Alberdi; Madsen, Søren; Jensen, Rasmus Lund
2017-01-01
and shaft resistances; ii) the maximum upward/downward displacements. A one-year time span is considered under operational and extreme thermal boundary conditions. The results show that a typical geothermal utilization of the energy foundation does not generate significant structural implications...... and, therefore, there is a need to develop guidelines to design them properly. This paper contributes by studying the thermo-mechanical behavior of the precast piles which are 15-meter long and have a quadratic cross section and a W-shape pipe heat exchanger. This article aims to numerically assess...... on the geotechnical capacity of a single energy pile. However, ground thermal loads need to be considered in the design phase to account for potential extreme temperature changes, which could generate thermal stresses that equalize the mechanically generated ones....
Hansson, T; Erkintalo, M; Anthony, J; Coen, S; Ricciardi, I; De Rosa, M; Wabnitz, S
2016-01-01
We numerically study, by means of the single envelope equation, the generation of optical frequency combs ranging from the visible to the mid-infrared spectral regions in resonators with quadratic and cubic nonlinearities. Phase-matched quadratic wave-mixing processes among the comb lines can be activated by low-power continuous wave pumping in the near infrared of a radially poled lithium niobate whispering gallery resonator (WGR). We examine both separate and co-existing intra-cavity doubly resonant second-harmonic generation and parametric oscillation processes, and find that modulation instabilities may lead to the formation of coupled comb arrays extending over multiple octaves. In the temporal domain, the frequency combs may correspond to pulse trains, or isolated pulses.
DEFF Research Database (Denmark)
Esbensen, B.K.; Bache, Morten; Krolikowski, W.;
2012-01-01
We employ the formal analogy between quadratic and nonlocal solitons to investigate analytically the properties of solitons and soliton bound states in second-harmonic generation in the regime of negative diffraction or dispersion of the second harmonic. We show that in the nonlocal description t...... this regime corresponds to a periodic nonlocal response function. We then use the strongly nonlocal approximation to find analytical solutions of the families of single bright solitons and their bound states in terms of Mathieu functions....
MODIFIED BERNOULLI ITERATION METHODS FOR QUADRATIC MATRIX EQUATION
Institute of Scientific and Technical Information of China (English)
Zhong-Zhi Bai; Yong-Hua Gao
2007-01-01
We construct a modified Bernoulli iteration method for solving the quadratic matrix equation AX2+BX+C=0,where A,B and C are square matrices.This method is motivated from the Gauss-Seidel iteration for solving linear systems and the ShermanMorrison-Woodbury formula for updating matrices.Under suitable conditions, we prove the local linear convergence of the Dew method.An algorithm is presented to find the solution of the quadratic matrix equation and some numerical results are given to show the feasibility and the effectiveness of the algorithm.In addition,we also describe and analyze the block version of the modified Bernoulli iteration method.
Gravitomagnetic effects in quadratic gravity with a scalar field
Finch, Andrew
2016-01-01
The two gravitomagnetic effects which influence bodies orbiting around a gravitational source are the geodetic effect and the Lense-Thirring effect. The former describes the precession angle of the axis of a spinning gyroscope while in orbit around a nonrotating gravitational source whereas the latter provides a correction for this angle in the case of a spinning source. In this paper we derive the relevant equations in quadratic gravity and relate them to their equivalents in general relativity. Starting with an investigation into Kepler's third law in quadratic gravity with a scalar field, the effects of an axisymmetric and rotating gravitational source on an orbiting body in a circular, equatorial orbit are introduced.
Induced motion of domain walls in multiferroics with quadratic interaction
Energy Technology Data Exchange (ETDEWEB)
Gerasimchuk, Victor S., E-mail: viktor.gera@gmail.com [National Technical University of Ukraine “Kyiv Polytechnic Institute”, Peremohy Avenue 37, 03056 Kiev (Ukraine); Shitov, Anatoliy A., E-mail: shitov@mail.ru [Donbass National Academy of Civil Engineering, Derzhavina Street 2, 86123 Makeevka, Donetsk Region (Ukraine)
2013-10-15
We theoretically study the dynamics of 180-degree domain wall of the ab-type in magnetic materials with quadratic magnetoelectric interaction in external alternating magnetic and electric fields. The features of the oscillatory and translational motions of the domain walls and stripe structures depending on the parameters of external fields and characteristics of the multiferroics are discussed. The possibility of the domain walls drift in a purely electric field is established. - Highlights: • We study DW and stripe DS in multiferroics with quadratic magnetoelectric interaction. • We build up the theory of oscillatory and translational (drift) DW and DS motion. • DW motion can be caused by crossed alternating electric and magnetic fields. • DW motion can be caused by alternating “pure” electric field. • DW drift velocity is formed by the AFM and Dzyaloshinskii interaction terms.
Quadratic Serendipity Finite Elements on Polygons Using Generalized Barycentric Coordinates
Rand, Alexander; Bajaj, Chandrajit
2011-01-01
We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n-gon satisfying simple geometric criteria, our construction produces 2n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, by transforming and combining a set of n(n+1)/2 basis functions known to obtain quadratic convergence. The technique broadens the scope of the so-called `serendipity' elements, previously studied only for quadrilateral and regular hexahedral meshes, by employing the theory of generalized barycentric coordinates. Numerical evidence is provided on a trapezoidal quadrilateral mesh, previously not amenable to serendipity constructions, and applications to adaptive meshing are discussed.
QUADRATIC SERENDIPITY FINITE ELEMENTS ON POLYGONS USING GENERALIZED BARYCENTRIC COORDINATES.
Rand, Alexander; Gillette, Andrew; Bajaj, Chandrajit
2014-01-01
We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n-gon, our construction produces 2n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, by transforming and combining a set of n(n + 1)/2 basis functions known to obtain quadratic convergence. The technique broadens the scope of the so-called 'serendipity' elements, previously studied only for quadrilateral and regular hexahedral meshes, by employing the theory of generalized barycentric coordinates. Uniform a priori error estimates are established over the class of convex quadrilaterals with bounded aspect ratio as well as over the class of convex planar polygons satisfying additional shape regularity conditions to exclude large interior angles and short edges. Numerical evidence is provided on a trapezoidal quadrilateral mesh, previously not amenable to serendipity constructions, and applications to adaptive meshing are discussed.
Quadratic differentials in low genus: exceptional and non-varying
Chen, Dawei
2012-01-01
We give an algebraic way of distinguishing the components of the exceptional strata of quadratic differentials in genus three and four. The complete list of these strata is (9, -1), (6,3,-1), (3,3,3, -1) in genus three and (12), (9,3), (6,6), (6,3,3) and (3,3,3,3) in genus four. This result is part of a more general investigation of disjointness of Teichmueller curves with divisors of Brill-Noether type on the moduli space of curves. As a result we show that for many strata of quadratic differentials in low genus the sum of Lyapunov exponents for the Teichmueller geodesic flow is the same for all Teichmueller curves in that stratum.
QUADRATIC INVARIANTS AND SYMPLECTIC STRUCTURE OF GENERAL LINEAR METHODS
Institute of Scientific and Technical Information of China (English)
Ai-guo Xiao; Shou-fu Li; Min Yang
2001-01-01
In this paper, we present some invariants and conservation laws of general linear methods applied to differential equation systems. We show that the quadratic invariants and symplecticity of the systems can be extended to general linear methods by a tensor product, and show that general linear methods with the matrix M=0 inherit in an extended sense the quadratic invariants possessed by the differential equation systems being integrated and preserve in an extended sense the symplectic structure of the phase space in the integration of Hamiltonian systems. These unify and extend existing relevant results on Runge-Kutta methods, linear multistep methods and one-leg methods. Finally, as special cases of general linear methods, we examine multistep Runge-Kutta methods, one-leg methods and linear two-step methods in detail.
Large Deviation Principle for Benedicks-Carleson Quadratic Maps
Chung, Yong Moo; Takahasi, Hiroki
2012-11-01
Since the pioneering works of Jakobson and Benedicks & Carleson and others, it has been known that a positive measure set of quadratic maps admit invariant probability measures absolutely continuous with respect to Lebesgue. These measures allow one to statistically predict the asymptotic fate of Lebesgue almost every initial condition. Estimating fluctuations of empirical distributions before they settle to equilibrium requires a fairly good control over large parts of the phase space. We use the sub-exponential slow recurrence condition of Benedicks & Carleson to build induced Markov maps of arbitrarily small scale and associated towers, to which the absolutely continuous measures can be lifted. These various lifts together enable us to obtain a control of recurrence that is sufficient to establish a level 2 large deviation principle, for the absolutely continuous measures. This result encompasses dynamics far from equilibrium, and thus significantly extends presently known local large deviations results for quadratic maps.
On Jannsen's conjecture for Hecke characters of imaginary quadratic fields
Bars, Francesc
2007-01-01
We present a collection of results on a conjecture of Jannsen about the $p$-adic realizations associated to Hecke characters over an imaginary quadratic field $K$ of class number 1. The conjecture is easy to check for Galois groups purely of local type. We prove the conjecture under a geometric regularity condition for the imaginary quadratic field $K$ at $p$, which is related to the property that a global Galois group is purely of local type. Without this regularity assumption at $p$, we present a review of the known situations in the critical case and in the non-critical case for the realizations associated to Hecke characters over $K$. We relate the conjecture to the non-vanishing of some concrete non-critical values of the associated $p$-adic $L$-function of the Hecke character. Finally, we prove that the conjecture follows from a general conjecture on Iwasawa theory for almost all Tate twists.
Identity-based signature scheme based on quadratic residues
Institute of Scientific and Technical Information of China (English)
CHAI ZhenChuan; CAO ZhenFu; DONG XiaoLei
2007-01-01
Identity-based (ID-based) cryptography has drawn great concerns in recent years, and most of ID-based schemes are constructed from bilinear parings. Therefore, ID-based scheme without pairing is of great interest in the field of cryptography. Up to now,there still remains a challenge to construct ID-based signature scheme from quadratic residues. Thus, we aim to meet this challenge by proposing a concrete scheme. In this paper, we first introduce the technique of how to calculate a 2lth root of a quadratic residue, and then give a concrete ID-based signature scheme using such technique.We also prove that our scheme is chosen message and ID secure in the random oracle model, assuming the hardness of factoring.
Time-Inconsistent Stochastic Linear--Quadratic Control
Hu, Ying; Zhou, Xun Yu
2011-01-01
In this paper, we formulate a general time-inconsistent stochastic linear--quadratic (LQ) control problem. The time-inconsistency arises from the presence of a quadratic term of the expected state as well as a state-dependent term in the objective functional. We define an equilibrium, instead of optimal, solution within the class of open-loop controls, and derive a sufficient condition for equilibrium controls via a flow of forward--backward stochastic differential equations. When the state is one dimensional and the coefficients in the problem are all deterministic, we find an explicit equilibrium control. As an application, we then consider a mean-variance portfolio selection model in a complete financial market where the risk-free rate is a deterministic function of time but all the other market parameters are possibly stochastic processes. Applying the general sufficient condition, we obtain explicit equilibrium strategies when the risk premium is both deterministic and stochastic.
A Special Role of Boolean Quadratic Polytopes among Other Combinatorial Polytopes
Directory of Open Access Journals (Sweden)
A. N. Maksimenko
2016-01-01
Full Text Available We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set, 3-assignment. For comparing two families of polytopes we use the following method. We say that a family
de Klerk, E.; Sotirov, R.; Truetsch, U.
2015-01-01
Recent progress in solving quadratic assignment problems (QAPs) from the QAPLIB (Quadratic Assignment Problem Library) test set has come from mixed-integer linear or quadratic programming models that are solved in a branch-and-bound framework. Semidefinite programming (SDP) bounds for QAPs have also
UNIFORM SUPERAPPROXIMATION OF THE DERIVATIVE OF TETRAHEDRAL QUADRATIC FINITE ELEMENT APPROXIMATION
Institute of Scientific and Technical Information of China (English)
Jing-hong Liu; Qi-ding Zhu
2005-01-01
In this paper,we will prove the derivative of tetrahedral quadratic finite element approximation is superapproximate to the derivative of the quadratic Lagrange interpolant of the exact solution in the L∞-norm, which can be used to enhance the accuracy of the derivative of tetrahedral quadratic finite element approximation to the derivative of the exact solution.
A Hamiltonian-based solution to the linear quadratic consensus control problem
Weiss, M.
2012-01-01
The Linear Quadratic Consensus Control (LQCC) problem is a relaxation of the classical Linear Quadratic Regulation (LQR) problem, that consists of asymptotically driving the state of the system to a "consensus" point in which all coordinates are equal, in such a way that a quadratic cost function on
Quadratic and Cubic Nonlinear Oscillators with Damping and Their Applications
Li, Jibin; Feng, Zhaosheng
We apply the qualitative theory of dynamical systems to study exact solutions and the dynamics of quadratic and cubic nonlinear oscillators with damping. Under certain parametric conditions, we also consider the van der Waals normal form, Chaffee-Infante equation, compound Burgers-KdV equation and Burgers-KdV equation for explicit representations of kink-profile wave solutions and unbounded traveling wave solutions.
Solving the Quadratic Assignment Problem by a Hybrid Algorithm
Directory of Open Access Journals (Sweden)
Aldy Gunawan
2011-01-01
Full Text Available This paper presents a hybrid algorithm to solve the Quadratic Assignment Problem (QAP. The proposed algorithm involves using the Greedy Randomized Adaptive Search Procedure (GRASP to obtain an initial solution, and then using a combined Simulated Annealing (SA and Tabu Search (TS algorithm to improve the solution. Experimental results indicate that the hybrid algorithm is able to obtain good quality solutions for QAPLIB test problems within reasonable computation time.
Developing A Combined Strategy For Solving Quadratic Assignment Problem
Directory of Open Access Journals (Sweden)
Faiz Ahyaningsih
2015-08-01
Full Text Available Abstract The quadratic assigment problem QAP is one of the most interesting and most challenging combinatorial optimization problems in existence. In this paper we propose a random point strategy to get a starting point and then we use a combination methods to get optimal solution. As a computational experience weve solved QAP 30 x 30 adopted from Nugent and backboard wiring problem 42 amp61620 42 adopted from Skorin-Kapov.
A new genetic representation for quadratic assignment problem
Directory of Open Access Journals (Sweden)
Kratica Jozef
2011-01-01
Full Text Available In this paper, we propose a new genetic encoding for well known Quadratic Assignment Problem (QAP. The new encoding schemes are implemented with appropriate objective function and modified genetic operators. The numerical experiments were carried out on the standard QAPLIB data sets known from the literature. The presented results show that in all cases proposed genetic algorithm reached known optimal solutions in reasonable time.
Observers for Systems with Nonlinearities Satisfying an Incremental Quadratic Inequality
Acikmese, Ahmet Behcet; Corless, Martin
2004-01-01
We consider the problem of state estimation for nonlinear time-varying systems whose nonlinearities satisfy an incremental quadratic inequality. These observer results unifies earlier results in the literature; and extend it to some additional classes of nonlinearities. Observers are presented which guarantee that the state estimation error exponentially converges to zero. Observer design involves solving linear matrix inequalities for the observer gain matrices. Results are illustrated by application to a simple model of an underwater.
Linear Quadratic Controller with Fault Detection in Compact Disk Players
DEFF Research Database (Denmark)
Vidal, Enrique Sanchez; Hansen, K.G.; Andersen, R.S.
2001-01-01
The design of the positioning controllers in Optical Disk Drives are today subjected to a trade off between an acceptable suppression of external disturbances and an acceptable immunity against surfaces defects. In this paper an algorithm is suggested to detect defects of the disk surface combined...... with an observer and a Linear Quadratic Regulator. As a result, the mentioned trade off is minimized and the playability of the tested compact disk player is considerably enhanced....
On a linear-quadratic problem with Caputo derivative
Directory of Open Access Journals (Sweden)
Dariusz Idczak
2016-01-01
Full Text Available In this paper, we study a linear-quadratic optimal control problem with a fractional control system containing a Caputo derivative of unknown function. First, we derive the formulas for the differential and gradient of the cost functional under given constraints. Next, we prove an existence result and derive a maximum principle. Finally, we describe the gradient and projection of the gradient methods for the problem under consideration.
Information sets as permutation cycles for quadratic residue codes
Directory of Open Access Journals (Sweden)
Richard A. Jenson
1982-01-01
Full Text Available The two cases p=7 and p=23 are the only known cases where the automorphism group of the [p+1, (p+1/2] extended binary quadratic residue code, O(p, properly contains PSL(2,p. These codes have some of their information sets represented as permutation cycles from Aut(Q(p. Analysis proves that all information sets of Q(7 are so represented but those of Q(23 are not.
A quadratic rate of asymptotic regularity for CAT(0)-spaces
Leustean, Laurentiu
2005-01-01
In this paper we obtain a quadratic bound on the rate of asymptotic regularity for the Krasnoselski-Mann iterations of nonexpansive mappings in CAT(0)-spaces, whereas previous results guarantee only exponential bounds. The method we use is to extend to the more general setting of uniformly convex hyperbolic spaces a quantitative version of a strengthening of Groetsch's theorem obtained by Kohlenbach using methods from mathematical logic (so-called ``proof mining'').
Adomian solution of a nonlinear quadratic integral equation
Directory of Open Access Journals (Sweden)
E.A.A. Ziada
2013-04-01
Full Text Available We are concerned here with a nonlinear quadratic integral equation (QIE. The existence of a unique solution will be proved. Convergence analysis of Adomian decomposition method (ADM applied to these type of equations is discussed. Convergence analysis is reliable enough to estimate the maximum absolute truncated error of Adomian’s series solution. Two methods are used to solve these type of equations; ADM and repeated trapezoidal method. The obtained results are compared.
New sequential quadratic programming algorithm with consistent subproblems
Institute of Scientific and Technical Information of China (English)
贺国平; 高自友; 赖炎连
1997-01-01
One of the most interesting topics related to sequential quadratic programming algorithms is how to guarantee the consistence of all quadratic programming subproblems. In this decade, much work trying to change the form of constraints to obtain the consistence of the subproblems has been done The method proposed by De O. Panto-ja J F A and coworkers solves the consistent problem of SQP method, and is the best to the authors’ knowledge. However, the scale and complexity of the subproblems in De O. Pantoja’s work will be increased greatly since all equality constraints have to be changed into absolute form A new sequential quadratic programming type algorithm is presented by means of a special ε-active set scheme and a special penalty function. Subproblems of the new algorithm are all consistent, and the form of constraints of the subproblems is as simple as one of the general SQP type algorithms. It can be proved that the new method keeps global convergence and local superhnear convergence.
Measurement of quadratic electrogyration effect in castor oil
Izdebski, Marek; Ledzion, Rafał; Górski, Piotr
2015-07-01
This work presents a detailed analysis of electrogyration measurement in liquids with the usage of an optical polarimetric technique. Theoretical analysis of the optical response to an applied electric field is illustrated by experimental data for castor oil which exhibits natural optical activity, quadratic electro-optic effect and quadratic electrogyration effect. Moreover, the experimental data show that interaction of the oil with a pair of flat electrodes induces a significant dichroism and natural linear birefringence. The combination of these effects occurring at the same time complicates the procedure of measurements. It has been found that a single measurement is insufficient to separate the contribution of the electrogyration effect, but it is possible on the basis of several measurements performed with various orientations of the polarizer and the analyser. The obtained average values of the quadratic electrogyration coefficient β13 in castor oil at room temperature are from - 0.92 ×10-22 to - 1.44 ×10-22m2V-2 depending on the origin of the oil. Although this study is focused on measurements in castor oil, the presented analysis is much more general.
Parameter Optimization of Linear Quadratic Controller Based on Genetic Algorithm
Institute of Scientific and Technical Information of China (English)
LI Jimin; SHANG Chaoxuan; ZOU Minghu
2007-01-01
The selection of weighting matrix in design of the linear quadratic optimal controller is an important topic in the control theory. In this paper, an approach based on genetic algorithm is presented for selecting the weighting matrix for the optimal controller. Genetic algorithm is adaptive heuristic search algorithm premised on the evolutionary ideas of natural selection and genetic. In this algorithm, the fitness function is used to evaluate individuals and reproductive success varies with fitness. In the design of the linear quadratic optimal controller, the fitness function has relation to the anticipated step response of the system. Not only can the controller designed by this approach meet the demand of the performance indexes of linear quadratic controller, but also satisfy the anticipated step response of close-loop system. The method possesses a higher calculating efficiency and provides technical support for the optimal controller in engineering application. The simulation of a three-order single-input single-output (SISO) system has demonstrated the feasibility and validity of the approach.
Elementary quadratic chaotic flows with a single non-hyperbolic equilibrium
Energy Technology Data Exchange (ETDEWEB)
Wei, Zhouchao, E-mail: weizhouchao@163.com [School of Mathematics and Physics, China University of Geosciences, Wuhan, 430074 (China); College of Mechanical Engineering, Beijing University of Technology, Beijing, 100124 (China); Mathematical Institute, University of Oxford, Oxford (United Kingdom); Sprott, J.C., E-mail: sprott@physics.wisc.edu [Department of Physics, University of Wisconsin, Madison, WI 53706 (United States); Chen, Huai [Faculty of Earth Sciences, China University of Geosciences, Wuhan, 430074 (China)
2015-10-02
Highlights: • A kind of jerk equations are proposed. • Chaos can occur with all types of a non-hyperbolic equilibrium. • The mechanism of generating chaos is discussed. • Feigenbaum's constant explains the identified chaotic flows. - Abstract: This paper describes a class of third-order explicit autonomous differential equations, called jerk equations, with quadratic nonlinearities that can generate a catalog of nine elementary dissipative chaotic flows with the unusual feature of having a single non-hyperbolic equilibrium. They represent an interesting sub-class of dynamical systems that can exhibit many major features of regular and chaotic motion. The proposed systems are investigated through numerical simulations and theoretical analysis. For these jerk dynamical systems, a certain amount of nonlinearity is sufficient to produce chaos through a sequence of period-doubling bifurcations.
An Improved Weise’s Rule for Efficient Estimation of Stand Quadratic Mean Diameter
Directory of Open Access Journals (Sweden)
Róbert Sedmák
2015-07-01
Full Text Available The main objective of this study was to explore the accuracy of Weise’s rule of thumb applied to an estimation of the quadratic mean diameter of a forest stand. Virtual stands of European beech (Fagus sylvatica L. across a range of structure types were stochastically generated and random sampling was simulated. We compared the bias and accuracy of stand quadratic mean diameter estimates, employing different ranks of measured stems from a set of the 10 trees nearest to the sampling point. We proposed several modifications of the original Weise’s rule based on the measurement and averaging of two different ranks centered to a target rank. In accordance with the original formulation of the empirical rule, we recommend the application of the measurement of the 6th stem in rank corresponding to the 55% sample percentile of diameter distribution, irrespective of mean diameter size and degree of diameter dispersion. The study also revealed that the application of appropriate two-measurement modifications of Weise’s method, the 4th and 8th ranks or 3rd and 9th ranks averaged to the 6th central rank, should be preferred over the classic one-measurement estimation. The modified versions are characterised by an improved accuracy (about 25% without statistically significant bias and measurement costs comparable to the classic Weise method.
Indian Academy of Sciences (India)
Debashish Goswami
2015-02-01
Let be one of the classical compact, simple, centre-less, connected Lie groups of rank with a maximal torus , the Lie algebra $\\mathcal{G}$ and let $\\{E_{i},F_{i},H_{i},i=1,\\ldots,n\\}$ be tha standard set of generators corresponding to a basis of the root system. Consider the adjoint-orbit space $M=\\{\\text{Ad}_{g}(H_{1}), g\\in G\\}$, identified with the homogeneous space / where $L=\\{g\\in G : \\text{Ad}_{g}(H_{1})=H_{1}\\}$. We prove that the coordinate functions $f_{i}(g):=_{i}(\\text{Ad}_{g}(H_{1}))$, $i=1,\\ldots,n$, where $\\{_{1},\\ldots,_{n}\\}$ is basis of $\\mathcal{G}'$ are `quadratically independent' in the sense that they do not satisfy any nontrivial homogeneous quadratic relations among them. Using this, it is proved that there is no genuine compact quantum group which can act faithfully on $C(M)$ such that the action leaves invariant the linear span of the above coordinate functions. As a corollary, it is also shown that any compact quantum group having a faithful action on the noncommutative manifold obtained by Rieffel deformation of satisfying a similar `linearity' condition must be a Rieffel-Wang type deformation of some compact group.
Frost, Susan A.; Bodson, Marc; Acosta, Diana M.
2009-01-01
The Next Generation (NextGen) transport aircraft configurations being investigated as part of the NASA Aeronautics Subsonic Fixed Wing Project have more control surfaces, or control effectors, than existing transport aircraft configurations. Conventional flight control is achieved through two symmetric elevators, two antisymmetric ailerons, and a rudder. The five effectors, reduced to three command variables, produce moments along the three main axes of the aircraft and enable the pilot to control the attitude and flight path of the aircraft. The NextGen aircraft will have additional redundant control effectors to control the three moments, creating a situation where the aircraft is over-actuated and where a simple relationship does not exist anymore between the required effector deflections and the desired moments. NextGen flight controllers will incorporate control allocation algorithms to determine the optimal effector commands and attain the desired moments, taking into account the effector limits. Approaches to solving the problem using linear programming and quadratic programming algorithms have been proposed and tested. It is of great interest to understand their relative advantages and disadvantages and how design parameters may affect their properties. In this paper, we investigate the sensitivity of the effector commands with respect to the desired moments and show on some examples that the solutions provided using the l2 norm of quadratic programming are less sensitive than those using the l1 norm of linear programming.
Institute of Scientific and Technical Information of China (English)
SongYan
2005-01-01
In this paper, we discuss the Poincaré bifurcation for a class of quadratic systems having a region consisting of periodic cycles bounded by a hyperbola and an arc of equator. We prove that the system can at most generate two limit cycles after a small perturbation.
Energy Technology Data Exchange (ETDEWEB)
Chao, R.M.; Ko, S.H.; Lin, I.H. [Department of Systems and Naval Mechatronics Engineering, National Cheng Kung University, Tainan, Taiwan 701 (China); Pai, F.S. [Department of Electronic Engineering, National University of Tainan (China); Chang, C.C. [Department of Environment and Energy, National University of Tainan (China)
2009-12-15
The historically high cost of crude oil price is stimulating research into solar (green) energy as an alternative energy source. In general, applications with large solar energy output require a maximum power point tracking (MPPT) algorithm to optimize the power generated by the photovoltaic effect. This work aims to provide a stand-alone solution for solar energy applications by integrating a DC/DC buck converter to a newly developed quadratic MPPT algorithm along with its appropriate software and hardware. The quadratic MPPT method utilizes three previously used duty cycles with their corresponding power outputs. It approaches the maximum value by using a second order polynomial formula, which converges faster than the existing MPPT algorithm. The hardware implementation takes advantage of the real-time controller system from National Instruments, USA. Experimental results have shown that the proposed solar mechatronics system can correctly and effectively track the maximum power point without any difficulties. (author)
A kind of signature scheme based on class groups of quadratic fields
Institute of Scientific and Technical Information of China (English)
董晓蕾; 曹珍富
2004-01-01
Quadratic-field cryptosystem is a cryptosystem built from discrete logarithm problem in ideal class groups of quadratic fields(CL-DLP). The problem on digital signature scheme based on ideal class groups of quadratic fields remained open, because of the difficulty of computing class numbers of quadratic fields. In this paper, according to our researches on quadratic fields, we construct the first digital signature scheme in ideal class groups of quadratic fields, using q as modulus, which denotes the prime divisors of ideal class numbers of quadratic fields. Security of the new signature scheme is based fully on CL-DLP. This paper also investigates realization of the scheme, and proposes the concrete technique. In addition, the technique introduced in the paper can be utilized to realize signature schemes of other kinds.
关于二次规划问题的一个新算法%A NEW ALGORITHM FOR QUADRATIC PROGRAMMING PROBLEM
Institute of Scientific and Technical Information of China (English)
邵先喜
2001-01-01
用线性的方法研究一个二次规划的算法问题。对于一般的二次规划的算法常导致极端Kuhn-Tucker点被改变成一些有限点问题后，严格的凸二次规划总是就有限收敛了。%A quadratic programming algorithm was presented with Armijo's line search.For general quadratic programming,the algorithm either converges to a Kuhn-Tucker point of problem in finite steps,or generates infinite point sequence such that any finite cluster point is the Kuhn-Tucker point of problem.For strictly convex quadratic programming,the algorithm has finite convergence.
DEFF Research Database (Denmark)
Liu, Xing; Zhou, Binbin; Guo, Hairun;
2015-01-01
in a quadratic nonlinear crystal (beta-barium borate) in the normal dispersion regime due to cascaded (phase-mismatched) second-harmonic generation, and the mid-IR converted wave is formed in the anomalous dispersion regime between. lambda = 2.2-2.4 mu m as a resonant dispersive wave. This process relies...... on nondegenerate four-wave mixing mediated by an effective negative cross-phase modulation term caused by cascaded soliton-probe sum-frequency generation. (C) 2015 Optical Society of America...
Exact solution of the classical mechanical quadratic Zeeman effect
Indian Academy of Sciences (India)
Sambhu N Datta; Anshu Pandey
2007-06-01
We address the curious problem of quadratic Zeeman effect at the classical mechanical level. The problem has been very well understood for decades, but an analytical solution of the equations of motion is still to be found. This state of affairs persists because the simultaneous presence of the Coulombic and quadratic terms lowers the dynamical symmetry. Energy and orbital angular momentum are still constants of motion. We find the exact solutions by introducing the concept of an image ellipse. The quadratic effect leads to a dilation of space–time, and a one-to-one correspondence is observed for pairs of physical quantities like energy and angular momentum, and the maximum and minimum distances from the Coulomb center for the Zeeman orbit and the corresponding pairs for the image ellipse. Thus, instead of finding additional conserved quantities, we find constants of motion for an additional dynamics, namely, the image problem. The trajectory is open, in agreement with Bertrand's theorem, but necessarily bound. A stable unbound trajectory does not exist for real values of energy and angular momentum. The radial distance, the angle covered in the plane of the orbit, and the time are uniquely determined by introducing further the concept of an image circle. While the radial distance is defined in a closed form as a transcendental function of the image-circular angle, the corresponding orbit angle and time variables are found in the form of two convergent series expansions. The latter two variables are especially contracted, thereby leading to a precession of the open cycles around the Coulomb center. It is expected that the space–time dilation effect observed here would somehow influence the solution of the quantum mechanical problem at the non-relativistic level.
Vacuum solutions of Bianchi cosmologies in quadratic gravity
Energy Technology Data Exchange (ETDEWEB)
Deus, Juliano Alves de; Muller, Daniel [Universidade de Brasilia (UnB), DF (Brazil)
2011-07-01
Full text: In this work we solve numerically the vacuum solutions of field equations of Bianchi homogeneous universes in the context of Semiclassical theory. Our interest is to study the quadratic theory of gravity with regard in the cosmological description of our universe in periods of intense fields. Bianchi cosmologies are anisotropic homogeneous cosmological models, but can include the isotropic models as particular cases (Bianchi I, VII and IX include homogeneous and isotropic Friedmann models plane, hyperbolic and spherical, respectively). Homogeneous models are good cosmological representations of our universe. With focus in solutions for intense fields, like the early universe, where isotropy is not necessarily required, the adopted scenario is the vacuum solutions, where the geometry is dominant in determining the gravitation. Still following in this way, the Semiclassical theory, which considers quantum matter fields propagating in classical geometrical background, is addressed to give the field equations. This formalism leads to fourth-order ordinary differential equations, in contrast to second-order equations from General Relativity. The Lagrangian of the theory is quadratic in the Ricci scalar and in the Ricci tensor. The equations system is highly non-linear and can be only numerically solved, except perhaps for few particular cases. We obtained numerical solutions for Bianchi V II{sub A} evolving to Minkowski and to de Sitter solutions, and also to singularities. The both first and second solutions were obtained choosing initial conditions near from respective exact vacuum solutions from Einstein theory, which are also exact solutions of the quadratic theory. Other Bianchi types are still under study. (author)
Creepers: Real quadratic orders with large class number
Patterson, Roger
2007-03-01
Shanks's sequence of quadratic fields Q(sqrt{S_{n}}) where S_{n}=(2^n+1)^2 + 2^{n+2} instances a class of quadratic fields for which the class number is large and, therefore, the continued fraction period is relatively short. Indeed, that period length increases linearly with n, that is: in arithmetic progression. The fields have regulator O(n^2). In the late nineties, these matters intrigued Irving Kaplansky, and led him to compute period length of the square root of sequences a^2x^{2n}+bx^{n}+c for integers a, b, c, and x. In brief, Kap found unsurprisingly that, generically, triples (a,b,c) are `leapers': they yield sequences with period length increasing at exponential rate. But there are triples yielding sequences with constant period length, Kap's `sleepers'. Finally, there are triples, as exemplified by the Shanks's sequence, for which the period lengths increase in arithmetic progression. Felicitously, Kaplansky called these `creepers'. It seems that the sleepers and creepers are precisely those for which one is able to detail the explicit continued fraction expansion for all n. Inter alia, this thesis noticeably extends the known classes of creepers and finds that not all are `kreepers' (of the shape identified by Kaplansky) and therefore not of the shape of examples studied by earlier authors looking for families of quadratic number fields with explicitly computable unit and of relatively large regulator. The work of this thesis includes the discovery of old and new families of hyperelliptic curves of increasing genus g and torsion divisor of order O(g^2). It follows that the apparent trichotomy leaper/sleeper/creeper coincides with the folk belief that the just-mentioned torsion is maximum possible.
Solving the quadratic assignment problem with clues from nature.
Nissen, V
1994-01-01
This paper describes a new evolutionary approach to solving quadratic assignment problems. The proposed technique is based loosely on a class of search and optimization algorithms known as evolution strategies (ES). These methods are inspired by the mechanics of biological evolution and have been applied successfully to a variety of difficult problems, particularly in continuous optimization. The combinatorial variant of ES presented here performs very well on the given test problems as compared with the standard 2-Opt heuristic and results with simulated annealing and tabu search. Extensions for practical applications in factory layout are described.
Two Reformulations for the Dynamic Quadratic Assignment Problem
Directory of Open Access Journals (Sweden)
Sirirat Muenvanichakul
2010-01-01
Full Text Available Problem statement: The Dynamic Quadratic Assignment Problem (DQAP, an NP-hard problem, is outlined and reformulated in two alternative models: Linearized model and logic-based model. Approach: The solution methods for both models based on combinatorial methods (Benders Decomposition and Approximate Dynamic Programming and constraint logic programming, respectively, are proposed. Results: Proofs of model equivalence and solution methodology are presented. Conclusion: Both proposed models are more simplified leading to possible hybrid adaptations of existing techniques for more practical approaches.
STOCHASTIC LINEAR QUADRATIC OPTIMAL CONTROL PROBLEMS WITH RANDOM COEFFICIENTS
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
This paper studies a stochastic linear quadratic optimal control problem (LQ problem, for short), for which the coefficients are allowed to be random and the cost functional is allowed to have a negative weight on the square of the control variable. The authors introduce the stochastic Riccati equation for the LQ problem. This is a backward SDE with a complicated nonlinearity and a singularity. The local solvability of such a backward SDE is established, which by no means is obvious. For the case of deterministic coefficients, some further discussions on the Riccati equations have been carried out. Finally, an illustrative example is presented.
Restart-Based Genetic Algorithm for the Quadratic Assignment Problem
Misevicius, Alfonsas
The power of genetic algorithms (GAs) has been demonstrated for various domains of the computer science, including combinatorial optimization. In this paper, we propose a new conceptual modification of the genetic algorithm entitled a "restart-based genetic algorithm" (RGA). An effective implementation of RGA for a well-known combinatorial optimization problem, the quadratic assignment problem (QAP), is discussed. The results obtained from the computational experiments on the QAP instances from the publicly available library QAPLIB show excellent performance of RGA. This is especially true for the real-life like QAPs.
Gilmore-Lawler bound of quadratic assignment problem
Institute of Scientific and Technical Information of China (English)
Yong XIA
2008-01-01
The Gilmore-Lawler bound (GLB) is one of the well-known lower bound of quadratic assignment problem (QAP). Checking whether GLB is tight is an NP-complete problem. In this article, based on Xia and Yuan linearization technique, we provide an upper bound of the complexity of this problem, which makes it pseudo-polynomial solvable. We also pseudo-polynomially solve a class of QAP whose GLB is equal to the optimal objec-tive function value, which was shown to remain NP-hard.
A Solution Proposal To Indefinite Quadratic Interval Transportation Problem
Directory of Open Access Journals (Sweden)
Hasan Dalman
2013-12-01
Full Text Available The data of real world applications generally cannot be expressed strictly. An efficient way of handling this situation is expressing the data as intervals. Thus, this paper focus on the Indefinite Quadratic Interval Transportation Problem (IQITP in which all the parameters i.e. cost and risk coefficients of the objective function, supply and demand quantities are expressed as intervals. A Taylor series approach is presented for the solution of IQITP by means of the expression of intervals with its left and right limits. Also a numerical example is executed to illustrate the procedure.
Neural network for solving convex quadratic bilevel programming problems.
He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie
2014-03-01
In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network.
Rigorous Performance Bounds for Quadratic and Nested Dynamical Decoupling
Xia, Yuhou; Lidar, Daniel A
2011-01-01
We present rigorous performance bounds for the quadratic dynamical decoupling (QDD) pulse sequence which protects a qubit from general decoherence, and for its nested generalization to an arbitrary number of qubits. Our bounds apply under the assumption of instantaneous pulses and of bounded perturbing environment and qubit-environment Hamiltonians such as those realized by baths of nuclear spins in quantum dots. We prove that if the total sequence time is fixed then the trace-norm distance between the unperturbed and protected system states can be made arbitrarily small by increasing the number of applied pulses.
Bianchi $VII_A$ solutions of quadratic gravity
de Deus, Juliano A
2011-01-01
It is believed that soon after the Planck time, Einstein's general relativity theory should be corrected to an effective quadratic theory. Numerical solutions for the anisotropic generalization of the Friedmann "open" model $H^ 3$ for this effective gravity are given. It must be emphasized that although numeric, these solutions are exact in the sense that they depend only on the precision of the machine. The solutions are identified asymptotically in a certain sense. It is found solutions which asymptote de Sitter space, Minkowski space and a singularity.
SPEECH EMOTION RECOGNITION USING MODIFIED QUADRATIC DISCRIMINATION FUNCTION
Institute of Scientific and Technical Information of China (English)
无
2008-01-01
Quadratic Discrimination Function(QDF)is commonly used in speech emotion recognition,which proceeds on the premise that the input data is normal distribution.In this Paper,we propose a transformation to normalize the emotional features,then derivate a Modified QDF(MQDF) to speech emotion recognition.Features based on prosody and voice quality are extracted and Principal Component Analysis Neural Network (PCANN) is used to reduce dimension of the feature vectors.The results show that voice quality features are effective supplement for recognition.and the method in this paper could improve the recognition ratio effectively.
FaSa: A Fast and Stable Quadratic Placement Algorithm
Institute of Scientific and Technical Information of China (English)
HOU WenTing(侯文婷); HONG XianLong(洪先龙); WU WeiMin(吴为民); CAI YiCi(蔡懿慈)
2003-01-01
Placement is a critical step in VLSI design because it dominates overall speed andquality of design flow. In this paper, a new fast and stable placement algorithm called FaSa is pro-posed. It uses quadratic programming model and Lagrange multiplier method to solve placementproblems. And an incremental LU factorization method is used to solve equations for speeding up.The experimental results show that FaSa is very stable, much faster than previous algorithms andits total wire length is comparable with other algorithms.
Quadratic growth and stability in convex programming problems
Bonnans, J. Frederic; Ioffe, Alexander D.
1994-01-01
Projet PROMATH; Given a convex program with $C^2$ functions and a convex set $S$ of solutions to the problem, we give a second order condition which guarantees that the problem does not have solutions outside of $S$. This condition is interpreted as a characterization for the quadratic growth of the cost function. The crucial role in the proofs is played by a theorem describing a certain uniform regularity property of critical cones in smooth convex programs. We apply these results to the dis...
Linear and quadratic in temperature resistivity from holography
Ge, Xian-Hui; Wu, Shang-Yu; Wu, Shao-Feng
2016-01-01
We present a new black hole solution in the Lifshitz spacetime with a hyperscaling violating factor. We analytically compute all of the DC thermoelectric conductivities in this theory. We find that both the linear-T and quadratic-T contributions to the resistivity can be realized, indicating that a more detailed comparison with experimental phenomenology can be performed in this scenario. At zero temperature, the Lorenz ratios are a constant, obeying the Wiedemann-Franz law, indications of a Fermi-liquid ground state.
Directory of Open Access Journals (Sweden)
Weihua Jin
2013-01-01
Full Text Available This paper proposes a genetic-algorithms-based approach as an all-purpose problem-solving method for operation programming problems under uncertainty. The proposed method was applied for management of a municipal solid waste treatment system. Compared to the traditional interactive binary analysis, this approach has fewer limitations and is able to reduce the complexity in solving the inexact linear programming problems and inexact quadratic programming problems. The implementation of this approach was performed using the Genetic Algorithm Solver of MATLAB (trademark of MathWorks. The paper explains the genetic-algorithms-based method and presents details on the computation procedures for each type of inexact operation programming problems. A comparison of the results generated by the proposed method based on genetic algorithms with those produced by the traditional interactive binary analysis method is also presented.
Yajima, Kohji
2015-01-01
We address the question of how one can modify the inflationary tensor spectrum without changing at all the successful predictions on the curvature perturbation. We show that this is indeed possible, and determine the two quadratic curvature corrections that are free from instabilities and affect only the tensor sector at the level of linear cosmological perturbations. Both of the two corrections can reduce the tensor amplitude, though one of them generates large non-Gaussianity of the curvature perturbation. It turns out that the other one corresponds to so-called Lorentz-violating Weyl gravity. In this latter case one can obtain as small as 65% of the standard tensor amplitude. Utilizing this effect we demonstrate that even power-law inflation can be within the 2$\\sigma$ contour of the Planck results.
Lattice topology and spontaneous parametric down-conversion in quadratic nonlinear waveguide arrays
Leykam, Daniel; Sukhorukov, Andrey A; Desyatnikov, Anton S
2015-01-01
We analyze spontaneous parametric down-conversion in various experimentally feasible 1D quadratic nonlinear waveguide arrays, with emphasis on the relationship between the lattice's topological invariants and the biphoton correlations. Nontrivial topology results in a nontrivial "winding" of the array's Bloch waves, which introduces additional selection rules for the generation of biphotons. These selection rules are in addition to, and independent of existing control using the pump beam's spatial profile and phase matching conditions. In finite lattices, nontrivial topology produces single photon edge modes, resulting in "hybrid" biphoton edge modes, with one photon localized at the edge and the other propagating into the bulk. When the single photon band gap is sufficiently large, these hybrid biphoton modes reside in a band gap of the bulk biphoton Bloch wave spectrum. Numerical simulations support our analytical results.
Lattice topology and spontaneous parametric down-conversion in quadratic nonlinear waveguide arrays
Leykam, Daniel; Solntsev, Alexander S.; Sukhorukov, Andrey A.; Desyatnikov, Anton S.
2015-09-01
We analyze spontaneous parametric down-conversion in various experimentally feasible one-dimensional quadratic nonlinear waveguide arrays, with emphasis on the relationship between the lattice's topological invariants and the biphoton correlations. Nontrivial topology results in a nontrivial "winding" of the array's Bloch waves, which introduces additional selection rules for the generation of biphotons, independent of existing control using the pump beam's spatial profile and phase-matching conditions. In finite lattices, nontrivial topology produces single-photon edge modes, resulting in "hybrid" biphoton edge modes, with one photon localized at the edge and the other propagating into the bulk. When the single-photon band gap is sufficiently large, these hybrid biphoton modes reside in a band gap of the bulk biphoton Bloch wave spectrum. Numerical simulations support our analytical results.
Automated detection of the choroid boundary within OCT image data using quadratic measure filters
Wagner, Marcus; Scheibe, Patrick; Francke, Mike; Zimmerling, Beatrice; Frey, Katharina; Vogel, Mandy; Luckhaus, Stephan; Wiedemann, Peter; Kiess, Wieland; Rauscher, Franziska G.
2017-02-01
A novel method for the automated detection of the outer choroid boundary within spectral-domain optical coherence tomography image data, based on an image model within the space of functions of bounded variation and the application of quadratic measure filters, is presented. The same method is used for the segmentation of retinal layer boundaries and proves to be suitable even for data generated without special imaging modes and moderate line averaging. Based on the segmentations, an automated determination of the central fovea region and choroidal thickness measurements for this and two adjacent 1-mm regions are provided. The quality of the method is assessed by comparison with manual delineations performed by five trained graders. The study is based on data from 50 children of the ages 8 to 13 that were obtained in the framework of the LIFE Child study at Leipzig University.
A Numerical Approximation Framework for the Stochastic Linear Quadratic Regulator on Hilbert Spaces
Energy Technology Data Exchange (ETDEWEB)
Levajković, Tijana, E-mail: tijana.levajkovic@uibk.ac.at, E-mail: t.levajkovic@sf.bg.ac.rs; Mena, Hermann, E-mail: hermann.mena@uibk.ac.at [University of Innsbruck, Department of Mathematics (Austria); Tuffaha, Amjad, E-mail: atufaha@aus.edu [American University of Sharjah, Department of Mathematics (United Arab Emirates)
2017-06-15
We present an approximation framework for computing the solution of the stochastic linear quadratic control problem on Hilbert spaces. We focus on the finite horizon case and the related differential Riccati equations (DREs). Our approximation framework is concerned with the so-called “singular estimate control systems” (Lasiecka in Optimal control problems and Riccati equations for systems with unbounded controls and partially analytic generators: applications to boundary and point control problems, 2004) which model certain coupled systems of parabolic/hyperbolic mixed partial differential equations with boundary or point control. We prove that the solutions of the approximate finite-dimensional DREs converge to the solution of the infinite-dimensional DRE. In addition, we prove that the optimal state and control of the approximate finite-dimensional problem converge to the optimal state and control of the corresponding infinite-dimensional problem.
Benders' Decomposition Based Heuristics for Large-Scale Dynamic Quadratic Assignment Problems
Directory of Open Access Journals (Sweden)
Sirirat Muenvanichakul
2009-01-01
Full Text Available Problem statement: Dynamic Quadratic Assignment Problem (DQAP is NP hard problem. Benders decomposition based heuristics method is applied to the equivalent mixed-integer linear programming problem of the original DQAP. Approach: Approximate Benders Decomposition (ABD generates the ensemble of a subset of feasible layout for Approximate Dynamic Programming (ADP to determine the sub-optimal optimal solution. A Trust-Region Constraint (TRC for the master problem in ABD and a Successive Adaptation Procedure (SAP were implemented to accelerate the convergence rate of the method. Results: The sub-optimal solutions of large-scales DQAPs from the method and its variants were compared well with other metaheuristic methods. Conclusion: Overall performance of the method is comparable to other metaheuristic methods for large-scale DQAPs.
The linear-quadratic model is inappropriate to model high dose per fraction effects in radiosurgery.
Kirkpatrick, John P; Meyer, Jeffrey J; Marks, Lawrence B
2008-10-01
The linear-quadratic (LQ) model is widely used to model the effect of total dose and dose per fraction in conventionally fractionated radiotherapy. Much of the data used to generate the model are obtained in vitro at doses well below those used in radiosurgery. Clinically, the LQ model often underestimates tumor control observed at radiosurgical doses. The underlying mechanisms implied by the LQ model do not reflect the vascular and stromal damage produced at the high doses per fraction encountered in radiosurgery and ignore the impact of radioresistant subpopulations of cells. The appropriate modeling of both tumor control and normal tissue toxicity in radiosurgery requires the application of emerging understanding of molecular-, cellular-, and tissue-level effects of high-dose/fraction-ionizing radiation and the role of cancer stem cells.
On the Content Bound for Real Quadratic Field Extensions
Directory of Open Access Journals (Sweden)
Robert G. Underwood
2012-12-01
Full Text Available Let K be a finite extension of Q and let S = {ν} denote the collection of K normalized absolute values on K. Let V+K denote the additive group of adeles over K and let K ≥0 c : V + → R denote the content map defined as c({aν } = Q K ν ∈S ν (aν for {aν } ∈ V+K A classical result of J. W. S. Cassels states that there is a constant c > 0 depending only on the field K with the following property: if {aν } ∈ V+K with c({aν } > c, then there exists a non-zero element b ∈ K for which ν (b ≤ ν (aν , ∀ν ∈ S. Let cK be the greatest lower bound of the set of all c that satisfy this property. In the case that K is a real quadratic extension there is a known upper bound for cK due to S. Lang. The purpose of this paper is to construct a new upper bound for cK in the case that K has class number one. We compare our new bound with Lang’s bound for various real quadratic extensions and find that our new bound is better than Lang’s in many instances.
Creepers: Real quadratic orders with large class number
Patterson, R
2007-01-01
Shanks's sequence of quadratic fields $\\Q(\\sqrt{S_{n}})$ where $S_{n}=(2^n+1)^2 + 2^{n+2}$ instances a class of quadratic fields for which the class number is large and, therefore, the continued fraction period is relatively short. Indeed, that period length increases linearly with $n$, that is: in arithmetic progression. The fields have regulator $O(n^2)$. In the late nineties, these matters intrigued Irving Kaplansky, and led him to compute period length of the square root of sequences $a^2x^{2n}+bx^{n}+c$ for integers $a$, $b$, $c$, and $x$. In brief, Kap found unsurprisingly that, generically, triples $(a,b,c)$ are `leapers': they yield sequences with period length increasing at exponential rate. But there are triples yielding sequences with constant period length, Kap's `sleepers'. Finally, there are triples, as exemplified by the Shanks's sequence, for which the period lengths increase in arithmetic progression. Felicitously, Kaplansky called these `creepers'. It seems that the sleepers and creepers are...
Analytical Solution of Projectile Motion with Quadratic Resistance and Generalisations
Ray, Shouryya
2013-01-01
The paper considers the motion of a body under the influence of gravity and drag of the surrounding fluid. Depending on the fluid mechanical regime, the drag force can exhibit a linear, quadratic or even more general dependence on the velocity of the body relative to the fluid. The case of quadratic drag is substantially more complex than the linear case, as it nonlinearly couples both components of the momentum equation, and no explicit analytic solution is known for a general trajectory. After a detailed account of the literature, the paper provides such a solution in form of a series expansion. This result is discussed in detail and related to other approaches previously proposed. In particular, it is shown to yield certain approximate solutions proposed in the literature as limiting cases. The solution technique employs a strategy to reduce systems of ordinary differential equations with a triangular dependence of the right-hand side on the vector of unknowns to a single equation in an auxiliary variable....
Integer roots of quadratic and cubic polynomials with integer coefficients
Zelator, Konstantine
2011-01-01
The subject matter of this work is quadratic and cubic polynomial functions with integer coefficients;and all of whose roots are integers. The material of this work is directed primarily at educators,students,and teachers of mathematics,grades K12 to K20.The results of this work are expressed in Theorems3,4,and5. Of these theorems, Theorem3, is the one that most likely, the general reader of this article will have some familiarity with.In Theorem3, precise coefficient conditions are given;in order that a quadratic trinomial(with integer) have two integer roots or zeros.On the other hand, Theorems4 and5 are largely unfamiliar territory. In Theorem4, precise coefficient conditions are stated; for a monic cubic polynomial to have a double(i.e.of multiplicity 2) integer root, and a single integer root(i.e.of multiplicity 1).The entire family of such cubics can be described in terms of four groups or subfamilies; each such group being a two-integer parameter subfamily. In Theorem5, a one-integer parameter family o...
Hausdorff dimension of biaccessible angles for quadratic polynomials
Bruin, Henk
2012-01-01
A point $z$ in the Julia set of a polynomial $p$ is called biaccessible if two dynamic rays land at $z$; a point $z$ in the Mandelbrot set is called biaccessible if two parameter rays land at $z$. In both cases, we say that the external angles of these two rays are biaccessible as well. In this paper we give upper and lower bounds for the Hausdorff dimension of biaccessible external angles of quadratic polynomials, both in the dynamical and parameter space. We explicitly describe those quadratic polynomials where this dimension equals 1 (if and only if the Julia set is an interval), and when it equals 0, namely, at finite direct bifurcations from the polynomial $z^2$, as well as limit points thereof. We also show that the Hausdorff dimension of biaccessible dynamical angles depends in a H\\"older sense on the parameter angle, and that this dimension, up to a factor $\\log 2$, equals the {\\em core entropy}, i.e. the topological entropy of the dynamics of the Hubbard tree.
A Public Key Block Cipher Based on Multivariate Quadratic Quasigroups
Gligoroski, Danilo; Knapskog, Svein Johan
2008-01-01
We have designed a new class of public key algorithms based on quasigroup string transformations using a specific class of quasigroups called multivariate quadratic quasigroups (MQQ). Our public key algorithm is a bijective mapping, it does not perform message expansions and can be used both for encryption and signatures. The public key consist of n quadratic polynomials with n variables where n=140, 160, ... . A particular characteristic of our public key algorithm is that it is very fast and highly parallelizable. More concretely, it has the speed of a typical modern symmetric block cipher - the reason for the phrase "A Public Key Block Cipher" in the title of this paper. Namely the reference C code for the 160-bit variant of the algorithm performs decryption in less than 11,000 cycles (on Intel Core 2 Duo -- using only one processor core), and around 6,000 cycles using two CPU cores and OpenMP 2.0 library. However, implemented in Xilinx Virtex-5 FPGA that is running on 249.4 MHz it achieves decryption thro...
STRUCTURE OPTIMIZATION OF RESERVATION BY PRECISE QUADRATIC REGULARIZATION
Directory of Open Access Journals (Sweden)
KOSOLAP A. I.
2015-11-01
Full Text Available The problem of optimization of the structure of systems redundancy elements. Such problems arise in the design of complex systems. To improve the reliability of operation of such systems of its elements are duplicated. This increases system cost and improves its reliability. When optimizing these systems is maximized probability of failure of the entire system while limiting its cost or the cost is minimized for a given probability of failure-free operation. A mathematical model of the problem is a discrete backup multiextremal. To search for the global extremum of currently used methods of Lagrange multipliers, coordinate descent, dynamic programming, random search. These methods guarantee a just and local solutions are used in the backup tasks of small dimension. In the work for solving redundancy uses a new method for accurate quadratic regularization. This method allows you to convert the original discrete problem to the maximization of multi vector norm on a convex set. This means that the diversity of the tasks given to the problem of redundancy maximize vector norm on a convex set. To solve the problem, a reformed straightdual interior point methods. Currently, it is the best method for local optimization of nonlinear problems. Transformed the task includes a new auxiliary variable, which is determined by dichotomy. There have been numerous comparative numerical experiments in problems with the number of redundant subsystems to one hundred. These experiments confirm the effectiveness of the method of precise quadratic regularization for solving problems of redundancy.
No Bel-Robinson Tensor for Quadratic Curvature Theories
Deser, S
2011-01-01
We attempt to generalize the familiar covariantly conserved Bel-Robinson tensor B ~ RR of GR and its recent topologically massive counterpart B ~ RDR, to quadratic curvature actions. Two very different models of current interest are examined: fourth order D=3 "new massive", and second order D>4 Gauss-Bonnet-Lovelock (GBL), gravity. On dimensional grounds, the candidates here become B ~ DRDR+RRR. For the D=3 model, there indeed exist conserved B ~ dR dR in the linearized limit. However, unlike for GR and TMG, and despite a plethora of available cubic terms, B cannot be extended to the full theory. The D>4 models are not even linearizable about flat space, since their field equations are quadratic in curvature; they also have no viable B, a fact that persists even if one includes cosmological or Einstein terms to allow linearization about the resulting dS vacua. These results are an unexpected, if hardly unique, example of non-linearization instability.
Linear-Quadratic-Gaussian Regulator Developed for a Magnetic Bearing
Choi, Benjamin B.
2002-01-01
Linear-Quadratic-Gaussian (LQG) control is a modern state-space technique for designing optimal dynamic regulators. It enables us to trade off regulation performance and control effort, and to take into account process and measurement noise. The Structural Mechanics and Dynamics Branch at the NASA Glenn Research Center has developed an LQG control for a fault-tolerant magnetic bearing suspension rig to optimize system performance and to reduce the sensor and processing noise. The LQG regulator consists of an optimal state-feedback gain and a Kalman state estimator. The first design step is to seek a state-feedback law that minimizes the cost function of regulation performance, which is measured by a quadratic performance criterion with user-specified weighting matrices, and to define the tradeoff between regulation performance and control effort. The next design step is to derive a state estimator using a Kalman filter because the optimal state feedback cannot be implemented without full state measurement. Since the Kalman filter is an optimal estimator when dealing with Gaussian white noise, it minimizes the asymptotic covariance of the estimation error.
The Nonlinear Analytical Envelope Equation in quadratic nonlinear crystals
Bache, Morten
2016-01-01
We here derive the so-called Nonlinear Analytical Envelope Equation (NAEE) inspired by the work of Conforti et al. [M. Conforti, A. Marini, T. X. Tran, D. Faccio, and F. Biancalana, "Interaction between optical fields and their conjugates in nonlinear media," Opt. Express 21, 31239-31252 (2013)], whose notation we follow. We present a complete model that includes $\\chi^{(2)}$ terms [M. Conforti, F. Baronio, and C. De Angelis, "Nonlinear envelope equation for broadband optical pulses in quadratic media," Phys. Rev. A 81, 053841 (2010)], $\\chi^{(3)}$ terms, and then extend the model to delayed Raman effects in the $\\chi^{(3)}$ term. We therefore get a complete model for ultrafast pulse propagation in quadratic nonlinear crystals similar to the Nonlinear Wave Equation in Frequency domain [H. Guo, X. Zeng, B. Zhou, and M. Bache, "Nonlinear wave equation in frequency domain: accurate modeling of ultrafast interaction in anisotropic nonlinear media," J. Opt. Soc. Am. B 30, 494-504 (2013)], but where the envelope is...
QUADRATIC REPRESENTATION FOR ROADWAY PROFILE THAT MINIMIZES EARTHWORK COST
Institute of Scientific and Technical Information of China (English)
Ahmad A.MOREB; Mohammad S.ALJOHANI
2004-01-01
Roadway design usually involves choices regarding grade selection and earthwork (transportation) that can be solved using linear programming. Previous work considered the road profile as series of interconnected linear segments. In these models, constraints are included in the linear programming formulation to insure continuity of the road, which cause sharp connectivity points at the intersection of the linear segments. This sharp connectivity needs to be smoothed out after the linear programming solution is found and the earth in the smoothed portion of the roadway has to be moved to the landfill.In previous research, the smoothing issue is dealt with after an optimal solution is found. This increases the work required by the design engineer and consequently increases the construction cost;furthermore, the optimal solution is violated by this smoothing operation. In this paper, the issue of sharp connectivity points is resolved by representing the road profile by a quadratic function. The continuity constraints are dropped (unneeded) and global optimality is guaranteed. Moreover, no violation is incurred to implement the optimum results. Although a quadratic function is used to represent the road profile, the mathematical model is purely linear in nature.
A discrete-time Lagrangian network for solving constrained quadratic programs.
Tang, W S; Wang, J
2000-08-01
A discrete-time recurrent neural network which is called the discrete-time Lagrangian network is proposed in this letter for solving convex quadratic programs. It is developed based on the classical Lagrange optimization method and solves quadratic programs without using any penalty parameter. The condition for the neural network to globally converge to the optimal solution of the quadratic program is given. Simulation results are presented to illustrate its performance.
2013-06-01
STABILITY BY COMPUTING A SINGLE QUADRATIC LYAPUNOV FUNCTION Mehrdad Pakmehr∗ PhD Candidate Decision and Control Laboratory (DCL) School of Aerospace...linearization and linear matrix inequality (LMI) techniques. Using convex optimization tools, a single quadratic Lyapunov function is computed for multiple...Scheduling Control of Gas Turbine Engines: Stability by Computing a Single Quadratic Lyapunov Function 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c
Integrability of Quadratic Non-autonomous Quantum Linear Systems
Lopez, Raquel
The Quantum Harmonic Oscillator is one of the most important models in Quantum Mechanics. Analogous to the classical mass vibrating back and forth on a spring, the quantum oscillator system has attracted substantial attention over the years because of its importance in many advanced and difficult quantum problems. This dissertation deals with solving generalized models of the time-dependent Schrodinger equation which are called generalized quantum harmonic oscillators, and these are characterized by an arbitrary quadratic Hamiltonian of linear momentum and position operators. The primary challenge in this work is that most quantum models with timedependence are not solvable explicitly, yet this challenge became the driving motivation for this work. In this dissertation, the methods used to solve the time-dependent Schrodinger equation are the fundamental singularity (or Green's function) and the Fourier (eigenfunction expansion) methods. Certain Riccati- and Ermakov-type systems arise, and these systems are highlighted and investigated. The overall aims of this dissertation are to show that quadratic Hamiltonian systems are completely integrable systems, and to provide explicit approaches to solving the time-dependent Schr¨odinger equation governed by an arbitrary quadratic Hamiltonian operator. The methods and results established in the dissertation are not yet well recognized in the literature, yet hold for high promise for further future research. Finally, the most recent results in the dissertation correspond to the harmonic oscillator group and its symmetries. A simple derivation of the maximum kinematical invariance groups of the free particle and quantum harmonic oscillator is constructed from the view point of the Riccati- and Ermakov-type systems, which shows an alternative to the traditional Lie Algebra approach. To conclude, a missing class of solutions of the time-dependent Schrodinger equation for the simple harmonic oscillator in one dimension is
LINEAR QUADRATIC OPTIMAL CONTROL UNDER STOCHASTIC UNIFORM OBSERVABILITY AND DETECTABILITY CONDITIONS
Directory of Open Access Journals (Sweden)
V.M. Ungureanu
2011-07-01
Full Text Available In this paper we apply the results in [1] - [3] to solve some linear quadratic control problems undereither stochastic uniform observability conditions or detectability conditions.
Nonconvex Quadratic Programming Method for κ-Coloring Problem: Algorithm and Computation
Institute of Scientific and Technical Information of China (English)
Cao Jiaming
1994-01-01
In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above quadratic 0-1 programming and its relaxed rpoblem, k-coloring problem is converted into a class of (continuous) nonconvex quadratic programs, and several theoretic results are also introduced. Thirdly, linear programming approximate algorithm is quoted and verified for this class of nonconvex quadratic programs. Finally,examining problems which are used to test the algorithm are constructed and sufficient computation experiments are reported.
The Model and Quadratic Stability Problem of Buck Converter in DCM
Directory of Open Access Journals (Sweden)
Li Xiaojing
2016-01-01
Full Text Available Quadratic stability is an important performance for control systems. At first, the model of Buck Converter in DCM is built based on the theories of hybrid systems and switched linear systems primarily. Then quadratic stability of SLS and hybrid feedback switching rule are introduced. The problem of Buck Converter’s quadratic stability is researched afterwards. In the end, the simulation analysis and verification are provided. Both experimental verification and theoretical analysis results indicate that the output of Buck Converter in DCM has an excellent performance via quadratic stability control and switching rules.
A quadratic-shaped-finger comb parametric resonator
Guo, Congzhong; Fedder, Gary K.
2013-09-01
A large-stroke (8 µm) parametric resonator excited by an in-plane ‘shaped-finger’ electrostatic comb drive is fabricated using a 15 µm thick silicon-on-insulator microelectromechanical systems (SOI-MEMS) process. A quadratic capacitance-engagement response is synthesized by engineering a custom-shaped comb finger profile. A folded-flexure suspension allows lateral motion while constraining rotational modes. The excitation of the nonlinear parametric resonance is realized by selecting an appropriate combination of the linear and cubic electrostatic stiffness coefficients through a specific varying-gap comb-finger design. The large-amplitude parametric resonance promotes high signal-to-noise ratio for potential use in sensitive chemical gravimetric sensors, strain gauges, and mode-matched gyroscope applications.
Consultant-Guided Search Algorithms for the Quadratic Assignment Problem
Iordache, Serban
Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based on advice received from consultants. Until now, CGS has been successfully applied to the Traveling Salesman Problem. Because a good metaheuristic should be able to tackle efficiently a large variety of problems, it is important to see how CGS behaves when applied to other classes of problems. In this paper, we propose an algorithm for the Quadratic Assignment Problem (QAP), which hybridizes CGS with a local search procedure. Our experimental results show that CGS is able to compete in terms of solution quality with one of the best Ant Colony Optimization algorithms, the MAX-MIN Ant System.
Local Optima Networks of the Quadratic Assignment Problem
Daolio, Fabio; Ochoa, Gabriela; Tomassini, Marco
2011-01-01
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Problem (QAP). This network model is a reduction of the landscape in which the nodes correspond to the local optima, and the edges account for the notion of adjacency between their basins of attraction. The model was inspired by the notion of 'inherent network' of potential energy surfaces proposed in physical-chemistry. The local optima networks extracted from the so called uniform and real-like QAP instances, show features clearly distinguishing these two types of instances. Apart from a clear confirmation that the search difficulty increases with the problem dimension, the analysis provides new confirming evidence explaining why the real-like instances are easier to solve exactly using heuristic search, while the uniform instances are easier to solve approximately. Although the local optima network model is still under development, w...
Solving Large Quadratic|Assignment Problems in Parallel
DEFF Research Database (Denmark)
Clausen, Jens; Perregaard, Michael
1997-01-01
Quadratic Assignment problems are in practice among the most difficult to solve in the class of NP-complete problems. The only successful approach hitherto has been Branch-and-Bound-based algorithms, but such algorithms are crucially dependent on good bound functions to limit the size of the space...... searched. Much work has been done to identify such functions for the QAP, but with limited success.Parallel processing has also been used in order to increase the size of problems solvable to optimality. The systems used have, however, often been systems with relatively few, but very powerful vector...... processors, and have hence not been ideally suited for computations essentially involving non-vectorizable computations on integers.In this paper we investigate the combination of one of the best bound functions for a Branch-and-Bound algorithm (the Gilmore-Lawler bound) and various testing, variable binding...
Cosmology for quadratic gravity in generalized Weyl geometry
Beltrán Jiménez, Jose; Heisenberg, Lavinia; Koivisto, Tomi S.
2016-04-01
A class of vector-tensor theories arises naturally in the framework of quadratic gravity in spacetimes with linear vector distortion. Requiring the absence of ghosts for the vector field imposes an interesting condition on the allowed connections with vector distortion: the resulting one-parameter family of connections generalises the usual Weyl geometry with polar torsion. The cosmology of this class of theories is studied, focusing on isotropic solutions wherein the vector field is dominated by the temporal component. De Sitter attractors are found and inhomogeneous perturbations around such backgrounds are analysed. In particular, further constraints on the models are imposed by excluding pathologies in the scalar, vector and tensor fluctuations. Various exact background solutions are presented, describing a constant and an evolving dark energy, a bounce and a self-tuning de Sitter phase. However, the latter two scenarios are not viable under a closer scrutiny.
Thermodynamics of charged Lifshitz black holes with quadratic corrections
Bravo-Gaete, Moises
2015-01-01
In arbitrary dimension, we consider the Einstein-Maxwell Lagrangian supplemented by the more general quadratic-curvature corrections. For this model, we derive four classes of charged Lifshitz black hole solutions for which the metric function is shown to depend on a unique integration constant. The masses of these solutions are computed using the quasilocal formalism based on the relation established between the off-shell ADT and Noether potentials. Among these four solutions, three of them are interpreted as extremal in the sense that their mass vanishes identically. For the last family of solutions, the quasilocal mass and the electric charge both are shown to depend on the integration constant. Finally, we verify that the first law of thermodynamics holds for each solution and a Smarr formula is also established for the four solutions.
Absence of the Gribov ambiguity in a quadratic gauge
Energy Technology Data Exchange (ETDEWEB)
Raval, Haresh [Indian Institute of Technology, Bombay, Department of Physics, Mumbai (India)
2016-05-15
The Gribov ambiguity exists in various gauges. Algebraic gauges are likely to be ambiguity free. However, algebraic gauges are not Lorentz invariant, which is their fundamental flaw. In addition, they are not generally compatible with the boundary conditions on the gauge fields, which are needed to compactify the space i.e., the ambiguity continues to exist on a compact manifold. Here we discuss a quadratic gauge fixing, which is Lorentz invariant. We consider an example of a spherically symmetric gauge field configuration in which we prove that this Lorentz invariant gauge removes the ambiguity on a compact manifold S{sup 3}, when a proper boundary condition on the gauge configuration is taken into account. Thus, we provide one example where the ambiguity is absent on a compact manifold in the algebraic gauge. We also show that the BRST invariance is preserved in this gauge. (orig.)
Absence of the Gribov ambiguity in a quadratic gauge
Raval, Haresh
2016-01-01
The Gribov ambiguity exists in various gauges except algebraic gauges. However, algebraic gauges are not Lorentz invariant, which is their fundamental flaw. In addition, they are not generally compatible with the boundary conditions on the gauge fields, which are needed to compactify the space i.e., the ambiguity continues to exist on a compact manifold. Here we discuss a quadratic gauge fixing, which is Lorentz invariant. We consider an example of a spherically symmetric gauge field configuration in which we prove that this Lorentz invariant gauge removes the ambiguity on a compact manifold $\\mathbb{S}^3$, when a proper boundary condition on the gauge configuration is taken into account. Thus, providing one example where the ambiguity is absent on a compact manifold in the algebraic gauge. We also show that the \\tmem{BRST} invariance is preserved in this gauge.
Absence of the Gribov ambiguity in a quadratic gauge
Raval, Haresh
2016-05-01
The Gribov ambiguity exists in various gauges. Algebraic gauges are likely to be ambiguity free. However, algebraic gauges are not Lorentz invariant, which is their fundamental flaw. In addition, they are not generally compatible with the boundary conditions on the gauge fields, which are needed to compactify the space i.e., the ambiguity continues to exist on a compact manifold. Here we discuss a quadratic gauge fixing, which is Lorentz invariant. We consider an example of a spherically symmetric gauge field configuration in which we prove that this Lorentz invariant gauge removes the ambiguity on a compact manifold {S}^3, when a proper boundary condition on the gauge configuration is taken into account. Thus, we provide one example where the ambiguity is absent on a compact manifold in the algebraic gauge. We also show that the BRST invariance is preserved in this gauge.
A combined strategy for solving quadratic assignment problem
Ahyaningsih, Faiz
2017-08-01
The quadratic assignment problem is a combinatorial problem of deciding the placement of facilities in specified locations in such a way as to minimize a nonconvex objective function expressed in terms of flow between facilities, and distance between location. Due to the non-convexity nature of the problem, therefore to get a `good' starting point is necessary in order to obtain a better optimal solution. In this paper we propose a combined strategy (random point strategy to get initial starting point and then use forward exchange strategy and backward exchange strategy to get `optimal' solution). As a computational experience we've solved the problem of Esc 16b, Esc 16c and Esc 16h from QAPLIB. Finally, we present a comparative study between Combined Strategy and Data -Guided Lexisearch Algorithm. The computational study shows the effectiveness of our proposed combined strategy.
Qualitative analysis of certain generalized classes of quadratic oscillator systems
Energy Technology Data Exchange (ETDEWEB)
Bagchi, Bijan, E-mail: bbagchi123@gmail.com; Ghosh, Samiran, E-mail: sran-g@yahoo.com; Pal, Barnali, E-mail: barrna.roo@gmail.com; Poria, Swarup, E-mail: swarupporia@gmail.com [Department of Applied Mathematics, University of Calcutta, 92 Acharya Prafulla Chandra Road, Kolkata 700009 (India)
2016-02-15
We carry out a systematic qualitative analysis of the two quadratic schemes of generalized oscillators recently proposed by Quesne [J. Math. Phys. 56, 012903 (2015)]. By performing a local analysis of the governing potentials, we demonstrate that while the first potential admits a pair of equilibrium points one of which is typically a center for both signs of the coupling strength λ, the other points to a centre for λ < 0 but a saddle λ > 0. On the other hand, the second potential reveals only a center for both the signs of λ from a linear stability analysis. We carry out our study by extending Quesne’s scheme to include the effects of a linear dissipative term. An important outcome is that we run into a remarkable transition to chaos in the presence of a periodic force term fcosωt.
DEALING WITH INCONSISTENT QUADRATIC PROGRAMS IN A SQP BASED ALGORITHM
Directory of Open Access Journals (Sweden)
M.T. de Gouvêa
1997-03-01
Full Text Available In this paper we present a new sequential quadratic programming SQP algorithm that does not need any preprocessing phase. Its main features consist of not enforcing the Hessian to be positive definite and of dealing with infeasible QP problems in a novel way. The linearized constraints are analyzed and all those that do not belong to the minimal representation of the feasible region are eliminated. In the approach used the convergence rate of the algorithm may be adjusted by the user by properly selecting some tuning parameters that are also used to improve the robustness of the algorithm. The SQP code presented here is also able to deal with bound constraints that may be linearly dependent on the linearized equality or original constraints. The algorithm is shown to be robust and to perform well for small to medium-sized problems
Cosmology for quadratic gravity in generalized Weyl geometry
Jimenez, Jose Beltran; Koivisto, Tomi S
2016-01-01
A class of vector-tensor theories arises naturally in the framework of quadratic gravity in spacetimes with linear vector distortion. Requiring the absence of ghosts for the vector field imposes an interesting condition on the allowed connections with vector distortion: the resulting one-parameter family of connections generalises the usual Weyl geometry with polar torsion. The cosmology of this class of theories is studied, focusing on isotropic solutions wherein the vector field is dominated by the temporal component. De Sitter attractors are found and inhomogeneous perturbations around such backgrounds are analysed. In particular, further constraints on the models are imposed by excluding pathologies in the scalar, vector and tensor fluctuations. Various exact background solutions are presented, describing a constant and an evolving dark energy, a bounce and a self-tuning de Sitter phase. However, the latter two scenarios are not viable under a closer scrutiny.
Regularized quadratic cost function for oriented fringe-pattern filtering.
Villa, Jesús; Quiroga, Juan Antonio; De la Rosa, Ismael
2009-06-01
We use the regularization theory in a Bayesian framework to derive a quadratic cost function for denoising fringe patterns. As prior constraints for the regularization problem, we propose a Markov random field model that includes information about the fringe orientation. In our cost function the regularization term imposes constraints to the solution (i.e., the filtered image) to be smooth only along the fringe's tangent direction. In this way as the fringe information and noise are conveniently separated in the frequency space, our technique avoids blurring the fringes. The attractiveness of the proposed filtering method is that the minimization of the cost function can be easily implemented using iterative methods. To show the performance of the proposed technique we present some results obtained by processing simulated and real fringe patterns.
Kaluza-Klein Reduction of a Quadratic Curvature Model
Baskal, S
2010-01-01
Palatini variational principle is implemented on a five dimensional quadratic curvature gravity model, rendering two sets of equations which can be interpreted as the field equations and the stress-energy tensor. Unification of gravity with electromagnetism and the scalar dilaton field is achieved through the Kaluza-Klein dimensional reduction mechanism. The reduced curvature invariant, field equations and the stress-energy tensor in four dimensional spacetime are obtained. The structure of the interactions among the constituent fields is exhibited in detail. It is shown that the Lorentz force naturally emerges from the reduced field equations and the equations of the standard Kaluza-Klein theory is demonstrated to be intrinsically contained in this model.
Frequency weighted system identification and linear quadratic controller design
Horta, Lucas G.; Phan, Minh; Juang, Jer-Nan; Longman, Richard W.; Sulla, Jeffrey L.
1991-01-01
Application of filters for frequency weighting of Markov parameters (pulse response functions) is described in relation to system/observer identification. The time domain identification approach recovers a model which has a pulse response weighted according to frequency. The identified model is composed of the original system and filters. The augmented system is in a form which can be used directly for frequency weighted linear quadratic controller design. Data from either single or multiple experiments can be used to recover the Markov parameters. Measured acceleration signals from a truss structure are used for system identification and the model obtained is used for frequency weighted controller design. The procedure makes the identification and controler design complementary problems.
Linear Quadratic Integral Control for the Active Suspension of Vehicle
Institute of Scientific and Technical Information of China (English)
无
2005-01-01
The quarter model of an active suspension is established in the form of controllable autoregressive moving average (CARMA) model. An accelerometer can be mounted on the wheel hub for measuring road disturbance; this signal is used to identify the CARMA model parameters by recursive forgetting factors least square method. The linear quadratic integral (LQI) control method for the active suspension is presented. The LQI control algorithm is fit for vehicle suspension control, for the control performance index can comprise multi controlled variables. The simulation results show that the vertical acceleration and suspension travel both are decreased with the LQI control in the low frequency band, and the suspension travel is increased with the LQI control in the middle or high frequency band. The suspension travel is very small in the middle or high frequency band, the suspension bottoming stop will not happen, so the vehicle ride quality can be improved apparently by the LQI control.
Repopulation Kinetics and the Linear-Quadratic Model
O'Rourke, S. F. C.; McAneney, H.; Starrett, C.; O'Sullivan, J. M.
2009-08-01
The standard Linear-Quadratic (LQ) survival model for radiotherapy is used to investigate different schedules of radiation treatment planning for advanced head and neck cancer. We explore how these treament protocols may be affected by different tumour repopulation kinetics between treatments. The laws for tumour cell repopulation include the logistic and Gompertz models and this extends the work of Wheldon et al. [1], which was concerned with the case of exponential repopulation between treatments. Treatment schedules investigated include standarized and accelerated fractionation. Calculations based on the present work show, that even with growth laws scaled to ensure that the repopulation kinetics for advanced head and neck cancer are comparable, considerable variation in the survival fraction to orders of magnitude emerged. Calculations show that application of the Gompertz model results in a significantly poorer prognosis for tumour eradication. Gaps in treatment also highlight the differences in the LQ model with the effect of repopulation kinetics included.
Dissipative quadratic solitons supported by a localized gain
Lobanov, Valery E; Malomed, Boris A
2014-01-01
We propose two models for the creation of stable dissipative solitons in optical media with the $\\chi^{(2)}$ (quadratic) nonlinearity. To compensate spatially uniform loss in both the fundamental-frequency (FF) and second-harmonic (SH) components of the system, a strongly localized "hot spot", carrying the linear gain, is added, acting either on the FF component, or on the SH one. In both systems, we use numerical methods to find families of dissipative $\\chi^{(2)}$ solitons pinned to the "hot spot". The shape of the existence and stability domains may be rather complex. An existence boundary for the solitons, which corresponds to the guided mode in the linearized version of the systems, is obtained in an analytical form. The solitons demonstrate noteworthy features, such as spontaneous symmetry breaking (of spatially symmetric solitons) and bistability.
Recognition of Graphs with Convex Quadratic Stability Number
Pacheco, Maria F.; Cardoso, Domingos M.
2009-09-01
A stable set of a graph is a set of mutually non-adjacent vertices. The determination of a maximum size stable set, which is called maximum stable set, and the determination of its size, which is called stability number, are central combinatorial optimization problems. However, given a nonnegative integer k, to determine if a graph G has a stable set of size k is NP-complete. In this paper we deal with graphs for which the stability number can be determined by solving a convex quadratic programming problem. Such graphs were introduced in [13] and are called graphs with convex-QP stability number. A few algorithmic techniques for the recognition of this type of graphs in particular families are presented.
Schwarz and multilevel methods for quadratic spline collocation
Energy Technology Data Exchange (ETDEWEB)
Christara, C.C. [Univ. of Toronto, Ontario (Canada); Smith, B. [Univ. of California, Los Angeles, CA (United States)
1994-12-31
Smooth spline collocation methods offer an alternative to Galerkin finite element methods, as well as to Hermite spline collocation methods, for the solution of linear elliptic Partial Differential Equations (PDEs). Recently, optimal order of convergence spline collocation methods have been developed for certain degree splines. Convergence proofs for smooth spline collocation methods are generally more difficult than for Galerkin finite elements or Hermite spline collocation, and they require stronger assumptions and more restrictions. However, numerical tests indicate that spline collocation methods are applicable to a wider class of problems, than the analysis requires, and are very competitive to finite element methods, with respect to efficiency. The authors will discuss Schwarz and multilevel methods for the solution of elliptic PDEs using quadratic spline collocation, and compare these with domain decomposition methods using substructuring. Numerical tests on a variety of parallel machines will also be presented. In addition, preliminary convergence analysis using Schwarz and/or maximum principle techniques will be presented.
Optimal Piecewise-Linear Approximation of the Quadratic Chaotic Dynamics
Directory of Open Access Journals (Sweden)
J. Petrzela
2012-04-01
Full Text Available This paper shows the influence of piecewise-linear approximation on the global dynamics associated with autonomous third-order dynamical systems with the quadratic vector fields. The novel method for optimal nonlinear function approximation preserving the system behavior is proposed and experimentally verified. This approach is based on the calculation of the state attractor metric dimension inside a stochastic optimization routine. The approximated systems are compared to the original by means of the numerical integration. Real electronic circuits representing individual dynamical systems are derived using classical as well as integrator-based synthesis and verified by time-domain analysis in Orcad Pspice simulator. The universality of the proposed method is briefly discussed, especially from the viewpoint of the higher-order dynamical systems. Future topics and perspectives are also provided
Identity-based ring signature scheme based on quadratic residues
Institute of Scientific and Technical Information of China (English)
Xiong Hu; Qin Zhiguang; Li Fagen
2009-01-01
Identity-based (ID-based) ring signature has drawn great concerns in recent years and many ID-based ring signature schemes have been proposed until now. Unfortunately, all of these ID-based ring signatures are constructed from bilinear pairings, a powerful but computationally expensive primitive. Hence, ID-based ring signature without pairing is of great interest in the field of cryptography. In this paper, the authors firstly propose an ID-based ring signature scheme based on quadratic residues. The proposed scheme is proved to be existentially unforgeable against adaptive chosen message-and-identity attack under the random oracle model, assuming the hardness of factoring. The proposed scheme is more efficient than those which are constructed from bilinear pairings.
Cosmology for quadratic gravity in generalized Weyl geometry
Energy Technology Data Exchange (ETDEWEB)
Jiménez, Jose Beltrán [CPT, Aix Marseille Université, UMR 7332,13288 Marseille (France); Heisenberg, Lavinia [Institute for Theoretical Studies, ETH Zurich,Clausiusstrasse 47, 8092 Zurich (Switzerland); Koivisto, Tomi S. [Nordita, KTH Royal Institute of Technology and Stockholm University,Roslagstullsbacken 23, 10691 Stockholm (Sweden)
2016-04-26
A class of vector-tensor theories arises naturally in the framework of quadratic gravity in spacetimes with linear vector distortion. Requiring the absence of ghosts for the vector field imposes an interesting condition on the allowed connections with vector distortion: the resulting one-parameter family of connections generalises the usual Weyl geometry with polar torsion. The cosmology of this class of theories is studied, focusing on isotropic solutions wherein the vector field is dominated by the temporal component. De Sitter attractors are found and inhomogeneous perturbations around such backgrounds are analysed. In particular, further constraints on the models are imposed by excluding pathologies in the scalar, vector and tensor fluctuations. Various exact background solutions are presented, describing a constant and an evolving dark energy, a bounce and a self-tuning de Sitter phase. However, the latter two scenarios are not viable under a closer scrutiny.
Rinkevicius, Zilvinas; Li, Xin; Sandberg, Jaime A R; Ågren, Hans
2014-05-21
We generalize a density functional theory/molecular mechanics approach for heterogeneous environments with an implementation of quadratic response theory. The updated methodology allows us to address a variety of non-linear optical, magnetic and mixed properties of molecular species in complex environments, such as combined metallic, solvent and confined organic environments. Illustrating calculations of para-nitroaniline on gold surfaces and in solution reveals a number of aspects that come into play when analyzing second harmonic generation of such systems--such as surface charge flow, coupled surface-solvent dynamics and induced geometric and electronic structure effects of the adsorbate. Some ramifications of the methodology for applied studies are discussed.
Indian Academy of Sciences (India)
Nahid Ashrafi
2009-06-01
The unit sum number, $u(R)$, of a ring is the least such that every element is the sum of units; if there is no such then $u(R)$ is or ∞ depending on whether the units generate additively or not. Here we introduce a finer classification for the unit sum number of a ring and in this new classification we completely determine the unit sum number of the ring of integers of a quadratic field. Further we obtain some results on cubic complex fields which one can decide whether the unit sum number is or ∞. Then we present some examples showing that all possibilities can occur.
Combinatorial instruments in the design of a heuristic for the quadratic assignment problem
Directory of Open Access Journals (Sweden)
Paulo Oswaldo Boaventura-Netto
2003-12-01
Full Text Available This work discusses the use of a neighbouring structure in the design of specific heuristics for the Quadratic Assignment Problem (QAP. This structure is formed by the 4- and 6-cycles adjacent to a vertex in the Hasse diagram of the permutation lattice and it can be adequately partitioned in subsets of linear and quadratic cardinalities, a characteristics which frequently allows an economy in the processing time. We propose also a restart strategy and a mechanism for generating initial solutions which constitute, together with the neighbouring structure, a possible QAP-specific heuristic proposal. For the construction of these instruments we used the relaxed ordered set of QAP solutions.Este trabalho discute o uso de uma estrutura de vizinhança em heurísticas específicas para o Problema Quadrático de Alocação (PQA. Esta estrutura envolve os ciclos de comprimento 4 e 6 adjacentes a um vértice do diagrama de Hasse do reticulado das permutações e pode ser particionada em subconjuntos de cardinalidade linear e quadrática em relação à ordem da instância, o que permite frequentemente uma economia de tempo de processamento. Propõem-se ainda uma estratégia de repartida e um mecanismo de geração de soluções iniciais, que constituem, ao lado da estrutura de vizinhança, uma proposta de heurística específica para o PQA. Na construção desses instrumentos foi utilizada a noção de conjunto relaxado ordenado das soluções do PQA.
Quadratic nonlinear optical parameters of 7% MgO-doped LiNbO3 crystal
Kulyk, B.; Kapustianyk, V.; Figà, V.; Sahraoui, B.
2016-06-01
Pure and 7% MgO-doped lithium niobate (LiNbO3) single crystals were grown by the Czochralski technique. The shift of optical absorption edge in 7% MgO-doped crystal in direction of shorter wavelength compared to undoped crystal was observed. The second harmonic generation measurements of 7% MgO-doped LiNbO3 crystal were performed at room temperature by means of the rotational Maker fringe technique using Nd:YAG laser generating at 1064 nm in picoseconds regime. Experimentally obtained value of nonlinear optical coefficient d33 for 7% MgO-doped LiNbO3 was found to be less than for undoped crystal but higher than for 5% MgO-doped. I-type phase-matched second harmonic generation was achieved and the value of phase-matched angle was calculated. High quadratic nonlinearity together with tolerance to intensive laser irradiation makes 7% MgO-doped LiNbO3 crystal interesting for application in optoelectronics.
de Klerk, E.; Sotirov, R.
2007-01-01
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E. Burkard,
SOLVING CONVEX QUADRATIC PROGRAMMING BY POTENTIAL-REDUCTION INTERIOR-POINT ALGORITHM
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
The solution of quadratic programming problems is an importantissue in the field of mathematical programming and industrial applications. In this paper, we solve convex quadratic programming by a potential-reduction interior-point algorithm. It is proved that the potential-reduction interior-point algorithm is globally convergent. Some numerical experiments were made.
On the 16-rank of class groups of quadratic number fields
Milovic, D.
2016-01-01
We prove two new density results about 16-ranks of class groups of quadratic number fields. They can be stated informally as follows. Let C(D) denote the class groups of the quadratic number field of discriminant D. Theorem A. The class group C(-4p) has an element of order 16 for one-fourth of pri
Man, Yiu-Kwong
2012-01-01
In this note, a new method for computing the partial fraction decomposition of rational functions with irreducible quadratic factors in the denominators is presented. This method involves polynomial divisions and substitutions only, without having to solve for the complex roots of the irreducible quadratic polynomial or to solve a system of linear…
Robust Stabilization for Uncertain Control Systems Using Piecewise Quadratic Lyapunov Functions
Institute of Scientific and Technical Information of China (English)
无
2002-01-01
The sufficient condition based on piecewise quadratic simultaneous Lyapunov functions for robust stabilizationof uncertain control systems via a constant linear state feedback control law is obtained. The objective is to use a robuststability criterion that is less conservative than the usual quadratic stability criterion. Numerical example is given, show-ing the advanteges of the proposed method.
The Regular Free-Endpoint Linear Quadratic Problem with Indefinite Cost
Trentelman, Hendrikus
1989-01-01
This paper studies an open problem in the context of linear quadratic optimal control, the free-endpoint regular linear quadratic problem with indefinite cost functional. It is shown that the optimal cost for this problem is given by a particular solution of the algebraic Riccati equation. This
On the 16-rank of class groups of quadratic number fields
Milovic, D.
2016-01-01
We prove two new density results about 16-ranks of class groups of quadratic number fields. They can be stated informally as follows. Let C(D) denote the class groups of the quadratic number field of discriminant D. Theorem A. The class group C(-4p) has an element of order 16 for one-fourth of
Subgroups of ideal class groups of real quadratic algebraic function fields
Institute of Scientific and Technical Information of China (English)
WANG; Kunpeng(王鲲鹏); ZHANG; Xianke(张贤科)
2003-01-01
Necessary and sufficient condition on real quadratic algebraic function fields K is given for theirideal class groups H(K) to contain cyclic subgroups of order n. And eight series of such real quadratic functionfields K are obtained whose ideal class groups contain cyclic subgroups of order n. In particular, the ideal classnumbers of these function fields are divisible by n.
A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF MAX-BISECTION
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
A successive quadratic programming algorithm for solving SDP relaxation of MaxBisection is provided and its convergence result is given. The step-size in the algorithm is obtained by solving n easy quadratic equations without using the linear search technique. The numerical experiments show that this algorithm is rather faster than the interior-point method.
Entire functions whose Julia sets include any finitely many copies of quadratic Julia sets
Katagata, Koh
2017-06-01
We prove that for any finite collection of quadratic Julia sets, a polynomial and a transcendental entire function exist whose Julia sets include copies of the given quadratic Julia sets. In order to prove the result, we construct quasiregular maps with required dynamics and employ the quasiconformal surgery to obtain the desired functions.
Ozaltun Celik, Aytug; Bukova Guzel, Esra
2017-01-01
The quadratic function is an important concept for calculus but the students at high school have many difficulties related to this concept. It is important that the teaching of the quadratic function is realized considering the students' thinking. In this context, the aim of this study conducted through a qualitative case study is to reveal the…
Man, Yiu-Kwong
2012-01-01
In this note, a new method for computing the partial fraction decomposition of rational functions with irreducible quadratic factors in the denominators is presented. This method involves polynomial divisions and substitutions only, without having to solve for the complex roots of the irreducible quadratic polynomial or to solve a system of linear…
Ellis, Amy B.; Grinstead, Paul
2008-01-01
This article presents secondary students' generalizations about the connections between algebraic and graphical representations of quadratic functions, focusing specifically on the roles of the parameters a, b, and c in the general form of a quadratic function, y = ax[superscript 2] + bx + c. Students' generalizations about these connections led…
de Klerk, E.; Sotirov, R.
2007-01-01
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E. Burkard, S.
Directory of Open Access Journals (Sweden)
Xuewen Mu
2015-01-01
quadratic programming over second-order cones and a bounded set. At each iteration, we only need to compute the metric projection onto the second-order cones and the projection onto the bound set. The result of convergence is given. Numerical results demonstrate that our method is efficient for the convex quadratic second-order cone programming problems with bounded constraints.
Effects of quadratic and cubic nonlinearities on a perfectly tuned parametric amplifier
DEFF Research Database (Denmark)
Neumeyer, Stefan; Sorokin, Vladislav; Thomsen, Jon Juel
2016-01-01
We consider the performance of a parametric amplifier with perfect tuning (two-to-one ratio between the parametric and direct excitation frequencies) and quadratic and cubic nonlinearities. A forced Duffing–Mathieu equation with appended quadratic nonlinearity is considered as the model system, a...
A Genetic Algorithm with the Improved 2-opt Method for Quadratic Assignment Problem
Matayoshi, Mitsukuni; Nakamura, Morikazu; Miyagi, Hayao
We propose a new 2-opt base method as a local search approach used with Genetic Algorithms (GAs) in Memetic Algorithm. We got a hint from the fast 2-opt method and devised the new 2-opt method. The main different point is such that our method exchanges genes by using histories of contributions to fitness value improvement. The contribution level is represented by the value `Priority’. In computer experiment, Quadratic Assignment Problem (QAP) instances are solved by GA with the 2-opt method(First Admissible Move Strategy, the Best Admissible Move Strategy), the fast 2-opt, and our proposed method for comparative evaluation. The results showed that our improved method obtained better solutions at ealier generation of the GA and our method required less computation time than the others at some upper bound value of appropriate `Priority’ setting values. Specially, at the average elapsed time of the fast 2-opt method’s 1000th generation, the exact solution findings of ours is more than the others. In further experiment, we observe that the searching capability depends on the number of levels of `Priority’. The ratio between two different Priority level sets becomes 1.59 in computation time in solving problem instance “char25a". This characteristic is shown to be statistically significant in ten instances among eleven.
Graph Modeling for Quadratic Assignment Problems Associated with the Hypercube
Mittelmann, Hans; Peng, Jiming; Wu, Xiaolin
2009-07-01
In the paper we consider the quadratic assignment problem arising from channel coding in communications where one coefficient matrix is the adjacency matrix of a hypercube in a finite dimensional space. By using the geometric structure of the hypercube, we first show that there exist at least n different optimal solutions to the underlying QAPs. Moreover, the inherent symmetries in the associated hypercube allow us to obtain partial information regarding the optimal solutions and thus shrink the search space and improve all the existing QAP solvers for the underlying QAPs. Secondly, we use graph modeling technique to derive a new integer linear program (ILP) models for the underlying QAPs. The new ILP model has n(n-1) binary variables and O(n3 log(n)) linear constraints. This yields the smallest known number of binary variables for the ILP reformulation of QAPs. Various relaxations of the new ILP model are obtained based on the graphical characterization of the hypercube, and the lower bounds provided by the LP relaxations of the new model are analyzed and compared with what provided by several classical LP relaxations of QAPs in the literature.
Junction conditions in quadratic gravity: thin shells and double layers
Reina, Borja; Vera, Raül
2015-01-01
The junction conditions for the most general gravitational theory with a Lagrangian containing terms quadratic in the curvature are derived. We include the cases with a possible concentration of matter on the joining hypersurface -termed as thin shells, domain walls or braneworlds in the literature- as well as the proper matching conditions where only finite jumps of the energy-momentum tensor are allowed. In the latter case we prove that the matching conditions are more demanding than in General Relativity. In the former case, we show that generically the shells/domain walls are of a new kind because they possess, in addition to the standard energy-momentum tensor, a double layer energy-momentum contribution which actually induces an external energy flux vector and an external scalar pressure/tension on the shell. We prove that all these contributions are necessary to make the entire energy-momentum tensor divergence-free, and we present the field equations satisfied by these energy-momentum quantities. The ...
Linearly and Quadratically Separable Classifiers Using Adaptive Approach
Institute of Scientific and Technical Information of China (English)
Mohamed Abdel-Kawy Mohamed Ali Soliman; Rasha M. Abo-Bakr
2011-01-01
This paper presents a fast adaptive iterative algorithm to solve linearly separable classification problems in Rn.In each iteration,a subset of the sampling data (n-points,where n is the number of features) is adaptively chosen and a hyperplane is constructed such that it separates the chosen n-points at a margin e and best classifies the remaining points.The classification problem is formulated and the details of the algorithm are presented.Further,the algorithm is extended to solving quadratically separable classification problems.The basic idea is based on mapping the physical space to another larger one where the problem becomes linearly separable.Numerical illustrations show that few iteration steps are sufficient for convergence when classes are linearly separable.For nonlinearly separable data,given a specified maximum number of iteration steps,the algorithm returns the best hyperplane that minimizes the number of misclassified points occurring through these steps.Comparisons with other machine learning algorithms on practical and benchmark datasets are also presented,showing the performance of the proposed algorithm.
On the Complexity of Solving Quadratic Boolean Systems
Bardet, Magali; Salvy, Bruno; Spaenlehauer, Pierre-Jean
2011-01-01
A fundamental problem in computer science is to find all the common zeroes of $m$ quadratic polynomials in $n$ unknowns over $\\mathbb{F}_2$. The cryptanalysis of several modern ciphers reduces to this problem. Up to now, the best complexity bound was reached by an exhaustive search in $4\\log_2 n\\,2^n$ operations. We give an algorithm that reduces the problem to a combination of exhaustive search and sparse linear algebra. This algorithm has several variants depending on the method used for the linear algebra step. Under precise algebraic assumptions, we show that the deterministic variant of our algorithm has complexity bounded by $O(2^{0.841n})$ when $m=n$, while a probabilistic variant of the Las Vegas type has expected complexity $O(2^{0.792n})$. Experiments on random systems show that the algebraic assumptions are satisfied with probability very close to~1. We also give a rough estimate for the actual threshold between our method and exhaustive search, which is as low as~200, and thus very relevant for cr...
Methods of using the quadratic assignment problem solution
Directory of Open Access Journals (Sweden)
Izabela Kudelska
2012-09-01
Full Text Available Background: Quadratic assignment problem (QAP is one of the most interesting of combinatorial optimization. Was presented by Koopman and Beckamanna in 1957, as a mathematical model of the location of indivisible tasks. This problem belongs to the class NP-hard issues. This forces the application to the solution already approximate methods for tasks with a small size (over 30. Even though it is much harder than other combinatorial optimization problems, it enjoys wide interest because it models the important class of decision problems. Material and methods: The discussion was an artificial intelligence tool that allowed to solve the problem QAP, among others are: genetic algorithms, Tabu Search, Branch and Bound. Results and conclusions: QAP did not arise directly as a model for certain actions, but he found its application in many areas. Examples of applications of the problem is: arrangement of buildings on the campus of the university, layout design of electronic components in systems with large scale integration (VLSI, design a hospital, arrangement of keys on the keyboard.
Two simple approximations to the distributions of quadratic forms.
Yuan, Ke-Hai; Bentler, Peter M
2010-05-01
Many test statistics are asymptotically equivalent to quadratic forms of normal variables, which are further equivalent to T = sigma(d)(i=1) lambda(i)z(i)(2) with z(i) being independent and following N(0,1). Two approximations to the distribution of T have been implemented in popular software and are widely used in evaluating various models. It is important to know how accurate these approximations are when compared to each other and to the exact distribution of T. The paper systematically studies the quality of the two approximations and examines the effect of the lambda(i) and the degrees of freedom d by analysis and Monte Carlo. The results imply that the adjusted distribution for T can be as good as knowing its exact distribution. When the coefficient of variation of the lambda(i) is small, the rescaled statistic T(R) = dT/(sigma(d)(i=1) lambda(i)) is also adequate for practical model inference. But comparing T(R) against chi2(d) will inflate type I errors when substantial differences exist among the lambda(i), especially, when d is also large.
A Neurodynamic Optimization Approach to Bilevel Quadratic Programming.
Qin, Sitian; Le, Xinyi; Wang, Jun
2016-08-19
This paper presents a neurodynamic optimization approach to bilevel quadratic programming (BQP). Based on the Karush-Kuhn-Tucker (KKT) theorem, the BQP problem is reduced to a one-level mathematical program subject to complementarity constraints (MPCC). It is proved that the global solution of the MPCC is the minimal one of the optimal solutions to multiple convex optimization subproblems. A recurrent neural network is developed for solving these convex optimization subproblems. From any initial state, the state of the proposed neural network is convergent to an equilibrium point of the neural network, which is just the optimal solution of the convex optimization subproblem. Compared with existing recurrent neural networks for BQP, the proposed neural network is guaranteed for delivering the exact optimal solutions to any convex BQP problems. Moreover, it is proved that the proposed neural network for bilevel linear programming is convergent to an equilibrium point in finite time. Finally, three numerical examples are elaborated to substantiate the efficacy of the proposed approach.
Asymptotic behavior for a quadratic nonlinear Schrodinger equation
Directory of Open Access Journals (Sweden)
Pavel I. Naumkin
2008-02-01
Full Text Available We study the initial-value problem for the quadratic nonlinear Schrodinger equation $$displaylines{ iu_{t}+frac{1}{2}u_{xx}=partial _{x}overline{u}^{2},quad xin mathbb{R},; t>1, cr u(1,x=u_{1}(x,quad xin mathbb{R}. }$$ For small initial data $u_{1}in mathbf{H}^{2,2}$ we prove that there exists a unique global solution $uin mathbf{C}([1,infty ;mathbf{H}^{2,2}$ of this Cauchy problem. Moreover we show that the large time asymptotic behavior of the solution is defined in the region $|x|leq Csqrt{t}$ by the self-similar solution $frac{1}{sqrt{t}}MS(frac{x}{sqrt{t}}$ such that the total mass $$ frac{1}{sqrt{t}}int_{mathbb{R}}MS(frac{x}{sqrt{t}} dx=int_{mathbb{R}}u_{1}(xdx, $$ and in the far region $|x|>sqrt{t}$ the asymptotic behavior of solutions has rapidly oscillating structure similar to that of the cubic nonlinear Schrodinger equations.
Quadratic MOKE on Co-based Heusler compounds
Energy Technology Data Exchange (ETDEWEB)
Wolf, Georg; Leven, Britta; Hillebrands, Burkard [FB Physik, Landesforschungszentrum OPTIMAS, TU Kaiserslautern, 67663 Kaiserslautern (Germany); Hamrle, Jaroslav [Institute of Physics, VSB, Technical University, Ostrava (Czech Republic); Ebke, Daniel; Thomas, Andy; Reiss, Guenter [Thin Films and Physics of Nanostructures, Physics Department, Bielefeld University (Germany)
2011-07-01
The intensive research on Co-based Heusler compounds revealed that some of these materials show a large quadratic magneto-optical Kerr effect (QMOKE). The presence of QMOKE strongly depends on the electronic band structure. In the case of Heusler compounds the electronic bands can be modified by changing the composition or improving the crystalline structure. This work presents a systematic study on several Heusler compounds (Co{sub 2}FeSi, Co{sub 2}Fe{sub 0.5}Mn{sub 0.5}Si, Co{sub 2}MnSi and Co{sub 2}FeAl{sub 0.5}Si{sub 0.5}). The amplitude of the QMOKE is investigated as a function of the post deposition annealing temperature, which is known to improve the crystal ordering. We find that the QMOKE is increasing with the annealing temperature. From this we conclude that there is a strong correlation between the presence of QMOKE and the high crystalline ordering in Heusler compounds.
QUADRATIC OPTIMIZATION METHOD AND ITS APPLICATION ON OPTIMIZING MECHANISM PARAMETER
Institute of Scientific and Technical Information of China (English)
ZHAO Yun; CHEN Jianneng; YU Yaxin; YU Gaohong; ZHU Jianping
2006-01-01
In order that the mechanism designed meets the requirements of kinematics with optimal dynamics behaviors, a quadratic optimization method is proposed based on the different characteristics of kinematic and dynamic optimization. This method includes two steps of optimization, that is, kinematic and dynamic optimization. Meanwhile, it uses the results of the kinematic optimization as the constraint equations of dynamic optimization. This method is used in the parameters optimization of transplanting mechanism with elliptic planetary gears of high-speed rice seedling transplanter with remarkable significance. The parameters spectrum, which meets to the kinematic requirements, is obtained through visualized human-computer interactions in the kinematics optimization, and the optimal parameters are obtained based on improved genetic algorithm in dynamic optimization. In the dynamic optimization, the objective function is chosen as the optimal dynamic behavior and the constraint equations are from the results of the kinematic optimization. This method is suitable for multi-objective optimization when both the kinematic and dynamic performances act as objective functions.
Personal Pornography Viewing and Sexual Satisfaction: A Quadratic Analysis.
Wright, Paul J; Bridges, Ana J; Sun, Chyng; Ezzell, Matthew; Johnson, Jennifer A
2017-09-08
Personal pornography viewing has been associated with lower sexual satisfaction in both experimental and observational research. The language used to hypothesize this relationship typically suggests that it is frequent viewing, rather than infrequent or only occasional viewing, that is responsible for any adverse effects. When the nature of the relationship between a predictor and a criterion depends on the levels of the predictor, a curvilinear relationship is indicated. Nevertheless, studies have assumed linearity in their analytical approach. Curvilinear relationships will go undetected unless they are specifically tested. This article presents results from a survey of approximately 1,500 U.S. adults. Quadratic analyses indicated a curvilinear relationship between personal pornography viewing and sexual satisfaction in the form of a predominately negative, concave downward curve. The nature of the curvilinearity did not differ as a function of participants' gender, relationship status, or religiosity. But the negative acceleration was slightly more pronounced for men than for women, for people not in a relationship than for people in a relationship, and for religious people than for nonreligious people. For all groups, negative simple slopes were present when viewing reached once a month or more. These results are correlational only. However, if an effects perspective were adopted, they would suggest that consuming pornography less than once a month has little or no impact on satisfaction, that reductions in satisfaction tend to initiate once viewing reaches once a month, and that additional increases in the frequency of viewing lead to disproportionately larger decrements in satisfaction.
Backbone analysis and algorithm design for the quadratic assignment problem
Institute of Scientific and Technical Information of China (English)
JIANG He; ZHANG XianChao; CHEN GuoLiang; LI MingChu
2008-01-01
As the hot line in NP-hard problems research in recent years, backbone analysis is crucial for phase transition, hardness, and algorithm design. Whereas theoretical analysis of backbone and its applications in algorithm design are still at a begin-ning state yet, this paper took the quadratic assignment problem (QAP) as a case study and proved by theoretical analysis that it is NP-hard to find the backbone, l.e., no algorithm exists to obtain the backbone of a QAP in polynomial time. Results of this paper showed that it is reasonable to acquire approximate backbone by inter-section of local optimal solutions. Furthermore, with the method of constructing biased instances, this paper proposed a new meta-heuristic - biased instance based approximate backbone (BI-AB), whose basic idea is as follows: firstly, con-struct a new biased instance for every QAP instance (the optimal solution of the new instance is also optimal for the original one); secondly, the approximate backbone is obtained by intersection of multiple local optimal solutions computed by some existing algorithm; finally, search for the optimal solutions in the reduced space by fixing the approximate backbone. Work of the paper enhanced the re-search area of theoretical analysis of backbone. The meta-heuristic proposed in this paper provided a new way for general algorithm design of NP-hard problems as well.
Gravity Waves From Non-Minimal Quadratic Inflation
Pallis, Constantinos
2015-01-01
We discuss non-minimal quadratic inflation in supersymmetric (SUSY) and non-SUSY models which entails a linear coupling of the inflaton to gravity. Imposing a lower bound on the parameter cR, involved in the coupling between the inflaton and the Ricci scalar curvature, inflation can be attained even for subplanckian values of the inflaton while the corresponding effective theory respects the perturbative unitarity up to the Planck scale. Working in the non-SUSY context we also consider radiative corrections to the inflationary potential due to a possible coupling of the inflaton to bosons or fermions. We find ranges of the parameters, depending mildly on the renormalization scale, with adjustable values of the spectral index ns, tensor-to-scalar ratio r=(2-4)x10^-3, and an inflaton mass close to 3x10^13 GeV. In the SUSY framework we employ two gauge singlet chiral superfields, a logarithmic Kahler potential including all the allowed terms up to fourth order in powers of the various fields, and determine uniqu...
Lichnerowicz modes and black hole families in Ricci quadratic gravity
Lü, Hong; Perkins, A.; Pope, C. N.; Stelle, K. S.
2017-08-01
A new branch of black hole solutions occurs along with the standard Schwarzschild branch in n -dimensional extensions of general relativity including terms quadratic in the Ricci tensor. The standard and new branches cross at a point determined by a static negative-eigenvalue eigenfunction of the Lichnerowicz operator, analogous to the Gross-Perry-Yaffe eigenfunction for the Schwarzschild solution in standard n =4 dimensional general relativity. This static eigenfunction has two roles: both as a perturbation away from Schwarzschild along the new black-hole branch and also as a threshold unstable mode lying at the edge of a domain of Gregory-Laflamme-type instability of the Schwarzschild solution for small-radius black holes. A thermodynamic analogy with the Gubser and Mitra conjecture on the relation between quantum thermodynamic and classical dynamical instabilities leads to a suggestion that there may be a switch of stability properties between the old and new black-hole branches for small black holes with radii below the branch crossing point.
Junction conditions in quadratic gravity: thin shells and double layers
Reina, Borja; Senovilla, José M. M.; Vera, Raül
2016-05-01
The junction conditions for the most general gravitational theory with a Lagrangian containing terms quadratic in the curvature are derived. We include the cases with a possible concentration of matter on the joining hypersurface—termed as thin shells, domain walls or braneworlds in the literature—as well as the proper matching conditions where only finite jumps of the energy-momentum tensor are allowed. In the latter case we prove that the matching conditions are more demanding than in general relativity. In the former case, we show that generically the shells/domain walls are of a new kind because they possess, in addition to the standard energy-momentum tensor, a double layer energy-momentum contribution which actually induces an external energy flux vector and an external scalar pressure/tension on the shell. We prove that all these contributions are necessary to make the entire energy-momentum tensor divergence-free, and we present the field equations satisfied by these energy-momentum quantities. The consequences of all these results are briefly analyzed.
Supercontinuum generation in quadratic nonlinear waveguides without quasi-phase matching
DEFF Research Database (Denmark)
Guo, Hairun; Zhou, Binbin; Steinert, Michael
2015-01-01
bandwidths (even octave spanning), together with other experimental data, indicate that negative nonlinearity solitons are indeed excited, which is backed up by numerical simulations. The QPM-free design reduces production complexity, extends the maximum waveguide length, and limits undesired spectral...... resonances. Finally, nonlinear crystals can be used where QPM is inefficient or impossible, which is important for mid-IR SCG. QPM-free waveguides in mid-IR nonlinear crystals can support negative nonlinearity solitons, as these waveguides have a normal dispersion at the emission wavelengths of mid...
NAGAYAMA,Shinobu; Sasao, Tsutomu; BUTLER,Jon T.
2006-01-01
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E89-A, No.12, Dec. 2006, pp.3510-3518,Special Section on VLSI Design and CAD Algorithms. This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted. This paper presents an architecture and a synthesis method for compac...
Mott-insulator phases of spin-3/2 fermions in the presence of quadratic Zeeman coupling
Rodriguez, K.; Argueelles, A.; Colome-Tatche, M.; Vekua, T.; Santos, L.
2010-01-01
We study the influence of the quadratic Zeeman effect on the Mott-insulator phases of hard-core 1D spin-3/2 fermions. We show that, contrary to spinor bosons, the quadratic Zeeman coupling preserves an SU(2) circle times SU(2) symmetry, leading for large-enough quadratic Zeeman coupling to an isotro
Random Supply, Costant Lead Times and Quadratic Backorder Costs. For Inventory Model (M, T)
Dr. Martin Omorodion
2014-01-01
This paper considers the inventory costs for the (M.T) model in which the backorder costs is quadratic, supply is continuous and lead time is constant. Use is made of series 1: Inventory Model (M.T) with quadratic costs and continuous lead times. The inventory cost for fixed M (maximum re-order level) and constant lead times is averaged over the states of M. Supply is assumed to follow a gamma distribution. The inventory costs for the model, random supply, constants lead time and quadratic co...
Continued Fractions ofFunctions Connected With Real Quadratic Function Fields
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
@@The theory of continued fractions is very useful in studying real quadratic number fields (see ［2-5］).E. Artin in ［1］ introduced continued fractions of functions to study quadratic function fields, using formal Laurent expansions, which isessentially the theory of completion of the function fields at the infinite valuation. Here we first re-developthe theory of continued fractions of functions in a more elementary and manipulable manner mainly using long division of polynomials; and then study properties of the continued fractions, which will have important applications in studying quadratic function fields obtaining remarkable results on unit groups, class groups, and class numbers.
Linear and quadratic static response functions and structure functions in Yukawa liquids.
Magyar, Péter; Donkó, Zoltán; Kalman, Gabor J; Golden, Kenneth I
2014-08-01
We compute linear and quadratic static density response functions of three-dimensional Yukawa liquids by applying an external perturbation potential in molecular dynamics simulations. The response functions are also obtained from the equilibrium fluctuations (static structure factors) in the system via the fluctuation-dissipation theorems. The good agreement of the quadratic response functions, obtained in the two different ways, confirms the quadratic fluctuation-dissipation theorem. We also find that the three-point structure function may be factorizable into two-point structure functions, leading to a cluster representation of the equilibrium triplet correlation function.
On ξ(s-Quadratic Stochastic Operators on Two-Dimensional Simplex and Their Behavior
Directory of Open Access Journals (Sweden)
Farrukh Mukhamedov
2013-01-01
Full Text Available A quadratic stochastic operator (in short QSO is usually used to present the time evolution of differing species in biology. Some quadratic stochastic operators have been studied by Lotka and Volterra. The general problem in the nonlinear operator theory is to study the behavior of operators. This problem was not fully finished even for quadratic stochastic operators which are the simplest nonlinear operators. To study this problem, several classes of QSO were investigated. We study ξ(s-QSO defined on 2D simplex. We first classify ξ(s-QSO into 20 nonconjugate classes. Further, we investigate the dynamics of three classes of such operators.
Zhang, Yunong; Wang, Jun
2002-06-01
A recurrent neural network called the dual neural network is proposed in this Letter for solving the strictly convex quadratic programming problems. Compared to other recurrent neural networks, the proposed dual network with fewer neurons can solve quadratic programming problems subject to equality, inequality, and bound constraints. The dual neural network is shown to be globally exponentially convergent to optimal solutions of quadratic programming problems. In addition, compared to neural networks containing high-order nonlinear terms, the dynamic equation of the proposed dual neural network is piecewise linear, and the network architecture is thus much simpler. The global convergence behavior of the dual neural network is demonstrated by an illustrative numerical example.
Quadratic relativistic invariant and metric form in quantum mechanics
Energy Technology Data Exchange (ETDEWEB)
Pissondes, Jean-Claude [DAEC, Observatoire de Paris-Meudon, Meudon (France)
1999-04-16
The Klein-Gordon equation is recovered in the framework of the theory of scale-relativity, first in the absence, then in the presence of an electromagnetic field. In this framework, spacetime at quantum scales is characterized by non-differentiability and continuity, which involves the introduction of explicit resolution-dependent fractal coordinates. Such a description leads to the notion of scale-covariance and its corresponding tool, a scale-covariant; derivative operator {theta}/ds. Due to it, the Klein-Gordon equation is written as an equation of free motion and interpreted as a geodesic equation in fractal spacetime. However, we obtain a new form for the corresponding relativistic invariant, which differs from that of special and general relativity. Characterizing quantum mechanics in the present approach, it is not simply quadratic in terms of velocities, but contains an extra term of divergence, which is intrinsically present in its expression. Moreover, in spite of the scale-covariance statements of the present theory, we find an extra term of current in addition to the Lorentz force, within the equations of motion with electromagnetic field written in this framework. Finally, we introduce another tool - a 'symmetric product' - from the requirement of recovering the usual form of the Leibniz rule written with the operator {theta}/ds. This tool allows us to write most equations in this framework in their usual classical form; in particular the simple rules of differentiation, the equations of motion with field and also our new relativistic invariant. (author)
Global topological classification of Lotka-Volterra quadratic differential systems
Directory of Open Access Journals (Sweden)
Dana Schlomiuk
2012-04-01
Full Text Available The Lotka-Volterra planar quadratic differential systems have numerous applications but the global study of this class proved to be a challenge difficult to handle. Indeed, the four attempts to classify them (Reyn (1987, W"orz-Buserkros (1993, Georgescu (2007 and Cao and Jiang (2008 produced results which are not in agreement. The lack of adequate global classification tools for the large number of phase portraits encountered, explains this situation. All Lotka-Volterra systems possess invariant straight lines, each with its own multiplicity. In this article we use as a global classification tool for Lotka-Volterra systems the concept of configuration of invariant lines (including the line at infinity. The class splits according to the types of configurations in smaller subclasses which makes it easier to have a good control over the phase portraits in each subclass. At the same time the classification becomes more transparent and easier to grasp. We obtain a total of 112 topologically distinct phase portraits: 60 of them with exactly three invariant lines, all simple; 27 portraits with invariant lines with total multiplicity at least four; 5 with the line at infinity filled up with singularities; 20 phase portraits of degenerate systems. We also make a thorough analysis of the results in the paper of Cao and Jiang [13]. In contrast to the results on the classification in [13], done in terms of inequalities on the coefficients of normal forms, we construct invariant criteria for distinguishing these portraits in the whole parameter space $mathbb{R}^{12}$ of coefficients.
Liu, Xing; Guo, Hairun; Bache, Morten
2015-01-01
We show numerically that ultrashort self-defocusing temporal solitons colliding with a weak pulsed probe in the near-IR can convert the probe to the mid-IR. A near-perfect conversion efficiency is possible for a high effective soliton order. The near-IR self-defocusing soliton can form in a quadratic nonlinear crystal (beta-barium borate) in the normal dispersion regime due to cascaded (phase-mismatched) second-harmonic generation, and the mid-IR converted wave is formed in the anomalous dispersion regime between $\\lambda=2.2-2.4~\\mu\\rm m$ as a resonant dispersive wave. This process relies on non-degenerate four-wave mixing mediated by an effective negative cross-phase modulation term caused by cascaded soliton-probe sum-frequency generation.
Global optimization of quadratic programming problem with quadratic constraints%带有二次约束二次规划问题的全局最优化
Institute of Scientific and Technical Information of China (English)
马小华; 魏飞; 高岳林
2013-01-01
According to the special structure of quadratic programming model with quadratic constraints and using the convex envelope and concave envelope of the product,the relaxation linear programming problem of quadratic programming with quadratic constraints was proposed so as to determine the lower bound of the global optimum.Using the hyper-rectangular reduction technique,the convergence speed of the branch-and-bound algorithm was accelerated.Thus,a global optimization algorithm was presented for solving quadratic programming problem with quadratic constraints and the convergence of the algorithm was proved.The new algorithm was actually an organically combined one of branch-and-bound with outer approximation.Numerical example showed that the proposed algorithm was feasible.%根据带有二次约束二次规划模型的特殊结构,利用乘积的凸包络和凹包络,给出带有二次约束二次规划问题的松弛线性规划问题,以确定全局最优值的下界,使用超矩形缩减技术以加快分支定界算法的收敛速度,从而提出一个求解带有二次约束二次规划问题的全局最优化算法,证明该算法的收敛性,这个新算法实际上是把分支定界方法与外逼近方法有机地结合起来.数值算例表明所提出的算法是可行的.
Unified dark energy and dust dark matter dual to quadratic purely kinetic K-essence
Guendelman, Eduardo; Nissimov, Emil; Pacheva, Svetlana
2016-02-01
We consider a modified gravity plus single scalar-field model, where the scalar Lagrangian couples symmetrically both to the standard Riemannian volume-form (spacetime integration measure density) given by the square root of the determinant of the Riemannian metric, as well as to another non-Riemannian volume-form in terms of an auxiliary maximal-rank antisymmetric tensor gauge field. As shown in a previous paper, the pertinent scalar-field dynamics provides an exact unified description of both dark energy via dynamical generation of a cosmological constant, and dark matter as a "dust" fluid with geodesic flow as a result of a hidden Noether symmetry. Here we extend the discussion by considering a non-trivial modification of the purely gravitational action in the form of f(R) = R - α R^2 generalized gravity. Upon deriving the corresponding "Einstein-frame" effective action of the latter modified gravity-scalar-field theory we find explicit duality (in the sense of weak versus strong coupling) between the original model of unified dynamical dark energy and dust fluid dark matter, on one hand, and a specific quadratic purely kinetic "k-essence" gravity-matter model with special dependence of its coupling constants on only two independent parameters, on the other hand. The canonical Hamiltonian treatment and Wheeler-DeWitt quantization of the dual purely kinetic "k-essence" gravity-matter model is also briefly discussed.
Bian, Lin
2004-12-01
Distortion product otoacoustic emissions (DPOAEs) are generated from the nonlinear transduction n cochlear outer hair cells. The transducer function demonstrating a compressive nonlinearity can be estimated from low-frequency modulation of DPOAEs. Experimental results from the gerbils showed that the magnitude of quadratic difference tone (QDT, f2-f1) was either enhanced or suppressed depending on the phase of the low-frequency bias tone. Within one period of the bias tone, QDT magnitudes exhibited two similar modulation patterns, each resembling the absolute value of the second derivative of the transducer function. In the time domain, the center notches of the modulation patterns occurred around the zero crossings of the bias pressure, whereas peaks corresponded to the increase or decrease in bias pressure. Evaluated with respect to the bias pressure, modulated QDT magnitude displayed a double-modulation pattern marked by a separation of the center notches. Loading/unloading of the cochlear transducer or rise/fall in bias pressure shifted the center notch to positive or negative sound pressures, indicating a mechanical hysteresis. These results suggest that QDT arises from the compression that coexists with the active hysteresis in cochlear transduction. Modulation of QDT magnitude reflects the dynamic regulation of cochlear transducer gain and compression.
Linear Quadratic Differential Game Strategies with Two-pursuit Versus Single-evader
Institute of Scientific and Technical Information of China (English)
LIU Yanfang; QI Naiming; TANG Zhiwei
2012-01-01
In order to intercept the future targets that are characterized by high maneuverability,multiple interceptors may be launched and aimed at single target.The scenario of two missiles P and Q intercepting a single target is modeled as a two-pursuit single-evader non-zero-sum linear quadratic differential game.The intercept space is decomposed into three subspaces which are mutually disjoint and their union covers the entire intercept space.The effect of adding the second interceptor arises in the intercept space of both P and Q (PQ-intercept space).A guidance law is derived from the Nash equilibrium strategy set (NESS) of the game.Simulation studies are focused on the PQ-intercept space.It is indicated that 1) increasing the target's maneuverability will enlarge PQ-intercept space; 2) the handover conditions will be released if the initial zero-effort-miss (ZEM) of both interceptors has opposite sign; 3) overvaluation of the target's maneuverability by choosing a small weight coefficient will generate robust performance with respect to the target maneuvering command switch time and decrease the fuel requirement; and 4) cooperation between interceptors increases the interception probability.
Longitudinal data analysis for rare variants detection with penalized quadratic inference function.
Cao, Hongyan; Li, Zhi; Yang, Haitao; Cui, Yuehua; Zhang, Yanbo
2017-04-05
Longitudinal genetic data provide more information regarding genetic effects over time compared with cross-sectional data. Coupled with next-generation sequencing technologies, it becomes reality to identify important genes containing both rare and common variants in a longitudinal design. In this work, we adopted a weighted sum statistic (WSS) to collapse multiple variants in a gene region to form a gene score. When multiple genes in a pathway were considered together, a penalized longitudinal model under the quadratic inference function (QIF) framework was applied for efficient gene selection. We evaluated the estimation accuracy and model selection performance under different model settings, then applied the method to a real dataset from the Genetic Analysis Workshop 18 (GAW18). Compared with the unpenalized QIF method, the penalized QIF (pQIF) method achieved better estimation accuracy and higher selection efficiency. The pQIF remained optimal even when the working correlation structure was mis-specified. The real data analysis identified one important gene, angiotensin II receptor type 1 (AGTR1), in the Ca2+/AT-IIR/α-AR signaling pathway. The estimated effect implied that AGTR1 may have a protective effect for hypertension. Our pQIF method provides a general tool for longitudinal sequencing studies involving large numbers of genetic variants.
Stego Encrypted Message in Any Language for Network Communication Using Quadratic Method
Directory of Open Access Journals (Sweden)
Ahmed c. Shakir
2010-01-01
Full Text Available Problem statement: Extensive use of digital media like text, images, audio and video on the internet generated a requirement for providing traffic security. For carrying out confidential communications over public networks, it was found that simply concealing the contents of a message using cryptography was not adequate. Concealing the very fact that a communication has taken place could provide an additional layer of security. In this study several methods are used to fulfill this goal. This study produced new procedures in steganography for hiding ciphered information inside a digital color bitmap image. Approach: In this project we were using quadratic method depending on the locations concluded by the binary image, beside of public key cryptography. Results: Very immune information from hacking and breaking. Conclusion: In this study, we had concluded that the conjunction between cryptography and steganography produce immune information. The Unicode made any language to be used. The conversion to binary image is for selecting the locations of the message to be saved and it gives somewhere randomly locations for the pixels to be used for hiding.
Domínguez, Luis F.
2012-06-25
An algorithm for the solution of convex multiparametric mixed-integer nonlinear programming problems arising in process engineering problems under uncertainty is introduced. The proposed algorithm iterates between a multiparametric nonlinear programming subproblem and a mixed-integer nonlinear programming subproblem to provide a series of parametric upper and lower bounds. The primal subproblem is formulated by fixing the integer variables and solved through a series of multiparametric quadratic programming (mp-QP) problems based on quadratic approximations of the objective function, while the deterministic master subproblem is formulated so as to provide feasible integer solutions for the next primal subproblem. To reduce the computational effort when infeasibilities are encountered at the vertices of the critical regions (CRs) generated by the primal subproblem, a simplicial approximation approach is used to obtain CRs that are feasible at each of their vertices. The algorithm terminates when there does not exist an integer solution that is better than the one previously used by the primal problem. Through a series of examples, the proposed algorithm is compared with a multiparametric mixed-integer outer approximation (mp-MIOA) algorithm to demonstrate its computational advantages. © 2012 American Institute of Chemical Engineers (AIChE).
Stability of the equilibrium positions of an engine with nonlinear quadratic springs
Stănescu, Nicolae-Doru; Popa, Dinel
2014-06-01
Our paper realizes a study of the equilibrium positions for an engine supported by four identical nonlinear springs of quadratic characteristic. The systems with quadratic characteristic are generally avoided because they lead to mathematical complications. Our goal is to realize such a study for an engine supported on quadratic springs. For the model purposed, we established the equations of motion and we discussed the possibilities for the equilibrium positions. Because of the quadratic characteristic of the springs and of the approximations made for the small rotations, the equations obtained for the equilibrium lead us to a paradox, which consists in the existence of an open neighborhood in which there exists an infinity of positions of indifferent equilibrium, or a curve where the equilibrium positions are situated. Moreover, the study of the stability shows that the stability is assured for the position at which the springs are not compressed. Finally, a numerical example is presented and completely solved.
Endicott, Julia S; Izmaylov, Artur F
2014-01-01
We consider a fully quadratic vibronic model Hamiltonian for studying photoinduced electronic transitions through conical intersections. Using a second order perturbative approximation for diabatic couplings we derive an analytical expression for the time evolution of electronic populations at a given temperature. This formalism extends upon a previously developed perturbative technique for a linear vibronic coupling Hamiltonian. The advantage of the quadratic model Hamiltonian is that it allows one to use separate quadratic representations for potential energy surfaces of different electronic states and a more flexible representation of interstate couplings. We explore features introduced by the quadratic Hamiltonian in a series of 2D models, and then apply our formalism to the 2,6-bis(methylene) adamantyl cation, and its dimethyl derivative. The Hamiltonian parameters for the molecular systems have been obtained from electronic structure calculations followed by a diabatization procedure. The evolution of e...
Propagator for a Time-Dependent Damped Harmonic Oscillator with a Force Quadratic in Velocity
Institute of Scientific and Technical Information of China (English)
HUANG Bo-Wen; GU Zhi-Yu; QIAN Shang-Wu
2003-01-01
The propagator for a time-dependent damped harmonic oscillator with a force quadratic in velocity isobtained by making a specific coordinate transformation and by using the method of time-dependent invariant.
Von Neumann Regularity and Quadratic Conorms in JB*-triples and C*-algebras
Institute of Scientific and Technical Information of China (English)
Mar(I)a BURGOS; El Amin KAIDI; Antonio Morales CAMPOY; Antonio M. PERALTA; Maribel RAM(I)REZ
2008-01-01
We revise the notion of von Neumann regularity in JB*-triples by finding a new character-isationin terms of the range of the quadratic operator Q(a). We introduce the quadratic conorm of anelement a in a JB*-triple as the minimum reduced modulus of the mapping Q(a). It is shown that thequadratic conorm of a coincides with the infimum of the squares of the points in the triple spectrumof a. It is established that a contractive bijection between JBW*-triples is a triple isomorphism if, andonly if, it preserves quadratic conorms. The continuity of the quadratic conorm and the generalizedinverse are discussed. Some applications to C*-algebras and von Neumann algebras are also studied.
Fusion arrest and collapse phenomena due to Kerr-nonlinearity in quadratic media
DEFF Research Database (Denmark)
Johansen, Steffen Kjær; Bang, Ole; Sørensen, Mads Peter
2000-01-01
Emphasizing collapse phenomena it is investigated to what extend the always present cubic nonlinearity affects the properties of soliton interaction in quadratic bulk media. An effective particle approach is applied and verified by numerical simulations....
The Existence of Periodic Orbits and Invariant Tori for Some 3-Dimensional Quadratic Systems
Directory of Open Access Journals (Sweden)
Yanan Jiang
2014-01-01
Full Text Available We use the normal form theory, averaging method, and integral manifold theorem to study the existence of limit cycles in Lotka-Volterra systems and the existence of invariant tori in quadratic systems in ℝ3.
The existence of periodic orbits and invariant tori for some 3-dimensional quadratic systems.
Jiang, Yanan; Han, Maoan; Xiao, Dongmei
2014-01-01
We use the normal form theory, averaging method, and integral manifold theorem to study the existence of limit cycles in Lotka-Volterra systems and the existence of invariant tori in quadratic systems in ℝ(3).
Observers for a class of systems with nonlinearities satisfying an incremental quadratic inequality
Acikmese, Ahmet Behcet; Martin, Corless
2004-01-01
We consider the problem of state estimation from nonlinear time-varying system whose nonlinearities satisfy an incremental quadratic inequality. Observers are presented which guarantee that the state estimation error exponentially converges to zero.
An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate
DEFF Research Database (Denmark)
Damgård, Ivan Bjerre; Frandsen, Gudmund Skovbjerg
2006-01-01
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to an extends the Miller-Rabin test and the Quadratic Frobenius test (QFT) by Grantham. EQFT takes time about equivalent to 2 Miller-Rabin tests, but has much smaller error probability, namely 256/331776t for t ite......-Rabin tests, while only taking time equivalent to about 2 such tests. We also give bounds for the error in case a prime is sought by incremental search from a random starting point.......We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to an extends the Miller-Rabin test and the Quadratic Frobenius test (QFT) by Grantham. EQFT takes time about equivalent to 2 Miller-Rabin tests, but has much smaller error probability, namely 256/331776t for t...
An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates
DEFF Research Database (Denmark)
Damgård, Ivan Bjerre; Frandsen, Gudmund Skovbjerg
2003-01-01
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to an extends the Miller-Rabin test and the Quadratic Frobenius test (QFT) by Grantham. EQFT takes time about equivalent to 2 Miller-Rabin tests, but has much smaller error probability, namely 256/331776t for t ite......-Rabin tests, while only taking time equivalent to about 2 such tests. We also give bounds for the error in case a prime is sought by incremental search from a random starting point.......We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to an extends the Miller-Rabin test and the Quadratic Frobenius test (QFT) by Grantham. EQFT takes time about equivalent to 2 Miller-Rabin tests, but has much smaller error probability, namely 256/331776t for t...
An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates
DEFF Research Database (Denmark)
Damgård, Ivan Bjerre; Frandsen, Gudmund Skovbjerg
2001-01-01
We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to an extends the Miller-Rabin test and the Quadratic Frobenius test (QFT) by Grantham. EQFT takes time about equivalent to 2 Miller-Rabin tests, but has much smaller error probability, namely 256/331776t for t ite......-Rabin tests, while only taking time equivalent to about 2 such tests. We also give bounds for the error in case a prime is sought by incremental search from a random starting point.......We present an Extended Quadratic Frobenius Primality Test (EQFT), which is related to an extends the Miller-Rabin test and the Quadratic Frobenius test (QFT) by Grantham. EQFT takes time about equivalent to 2 Miller-Rabin tests, but has much smaller error probability, namely 256/331776t for t...
Detection of spatial variations in temporal trends with a quadratic function.
Moraga, Paula; Kulldorff, Martin
2016-08-01
Methods for the assessment of spatial variations in temporal trends (SVTT) are important tools for disease surveillance, which can help governments to formulate programs to prevent diseases, and measure the progress, impact, and efficacy of preventive efforts already in operation. The linear SVTT method is designed to detect areas with unusual different disease linear trends. In some situations, however, its estimation trend procedure can lead to wrong conclusions. In this article, the quadratic SVTT method is proposed as alternative of the linear SVTT method. The quadratic method provides better estimates of the real trends, and increases the power of detection in situations where the linear SVTT method fails. A performance comparison between the linear and quadratic methods is provided to help illustrate their respective properties. The quadratic method is applied to detect unusual different cervical cancer trends in white women in the United States, over the period 1969 to 1995. © The Author(s) 2013.
EXACT SOLUTIONS FOR NONLINEAR TRANSIENT FLOW MODEL INCLUDING A QUADRATIC GRADIENT TERM
Institute of Scientific and Technical Information of China (English)
曹绪龙; 同登科; 王瑞和
2004-01-01
The models of the nonlinear radial flow for the infinite and finite reservoirs including a quadratic gradient term were presented. The exact solution was given in real space for flow equation including quadratic gradiet term for both constant-rate and constant pressure production cases in an infinite system by using generalized Weber transform. Analytical solutions for flow equation including quadratic gradient term were also obtained by using the Hankel transform for a finite circular reservoir case. Both closed and constant pressure outer boundary conditions are considered. Moreover, both constant rate and constant pressure inner boundary conditions are considered. The difference between the nonlinear pressure solution and linear pressure solution is analyzed. The difference may be reached about 8% in the long time. The effect of the quadratic gradient term in the large time well test is considered.
The Existence of Periodic Orbits and Invariant Tori for Some 3-Dimensional Quadratic Systems
Jiang, Yanan; Han, Maoan; Xiao, Dongmei
2014-01-01
We use the normal form theory, averaging method, and integral manifold theorem to study the existence of limit cycles in Lotka-Volterra systems and the existence of invariant tori in quadratic systems in ℝ3. PMID:24982980
The second moment of quadratic twists of modular $L$-functions
Young, Matthew P
2009-01-01
We study the second moment of the central values of quadratic twists of a modular $L$-function. Unconditionally, we obtain a lower bound which matches the conjectured asymptotic formula, while on GRH we prove the asymptotic formula itself.
Guam Community Coral Reef Monitoring Program, Benthic Quadrat Surveys at Guam in 2013
National Oceanic and Atmospheric Administration, Department of Commerce — Guam community members gathered benthic cover data using a 0.25m2 quadrat with 6 intersecting points at each meter along a 25-meter transect. Members identified...
Mohd Fauzi, Norizyan Izzati; Sulaiman, Jumat
2013-04-01
The aim of this paper is to describe the application of Quarter-Sweep Gauss-Seidel (QSGS) iterative method using quadratic spline scheme for solving fourth order two-point linear boundary value problems. In the line to derive approximation equations, firstly the fourth order problems need to be reduced onto a system of second-order two-point boundary value problems. Then two linear systems have been constructed via discretization process by using the corresponding quarter-sweep quadratic spline approximation equations. The generated linear systems have been solved using the proposed QSGS iterative method to show the superiority over Full-Sweep Gauss-Seidel (FSGS) and Half-Sweep Gauss-Seidel (HSGS) methods. Computational results are provided to illustrate that the effectiveness of the proposed QSGS method is more superior in terms of computational time and number of iterations as compared to other tested methods.
Flight Control System Design by Quadratic Stabilization with Partial Pole Placement
Satoh, Atsushi; Sugimoto, Kenji
The most fundamental requirements for flight control system are ensuring robust stability and improving flying quality. Quadratic stabilization is a powerful technique ensuring robust stability against parameter change of aircraft due to flight condition. Furthermore, flying quality requirements are regarded as eigenstructure assignment specifications. This paper proposes a new design method of feedback gain which simultaneously achieves quadratic stabilization and partial pole placement. This design method is reduced to a numerical optimization problem including linear matrix inequality (LMI) constraints.
Twistless Version of Thirring's Approach to the KAM Theorem for Quadratic Hamiltonians
Chandre, C
1998-01-01
We give a proof of the KAM theorem on the existence of invariant tori for weakly perturbed Hamiltonian systems, based on Thirring's approach for Hamiltonians that are quadratic in the action variables. The main point of this approach is that the iteration of canonical transformations on which the proof is based stays within the space of quadratic Hamiltonians. We show that Thirring's proof for nondegenerate Hamiltonians can be adapted to twistless Hamiltonians. This twistless assumption, in fact, drastically simplifies Thirring's proof.
DYNAMICAL ANALYSIS OF A 3-D CHAOTIC SYSTEM WITH ONLY TWO QUADRATIC NONLINEARITIES
Institute of Scientific and Technical Information of China (English)
Zeraoulia ELHADJ
2008-01-01
The paper reports the dynamical study of a three-dimensional quadratic autonomous chaotic system with only two quadratic nonlinearities, which is a special case of the so-called conjugate Lü system. Basic properties of this system are analyzed by means of Lyapunov exponent spectrum and bifurcation diagram. The analysis shows that the system has complex dynamics with some interesting characteristics in which there are several periodic regions, but each of them has quite different periodic orbits.
Roh, Kum-Hwan; Kim, Ji Yeoun; Shin, Yong Hyun
2017-01-01
In this paper, we investigate the optimal consumption and portfolio selection problem with negative wealth constraints for an economic agent who has a quadratic utility function of consumption and receives a constant labor income. Due to the property of the quadratic utility function, we separate our problem into two cases and derive the closed-form solutions for each case. We also illustrate some numerical implications of the optimal consumption and portfolio.
Institute of Scientific and Technical Information of China (English)
XU Xiu-Wei; REN Ting-Qi; LIU Shu-Yan; MA Qiu-Ming; LIU Sheng-Dian
2007-01-01
Making use of the transformation relation among usual, normal, and antinormal ordering for the multimode boson exponential quadratic polynomial operators (BEQPO's), we present the analytic expression of arbitrary matrix elements for BEQPO's. As a preliminary application, we obtain the exact expressions of partition function about the boson quadratic polynomial system, matrix elements in particle-number, coordinate, and momentum representation, and P representation for the BEQPO's.
2-Sylow Subgroups of K2OF for Real Quadratic Fields F
Institute of Scientific and Technical Information of China (English)
秦厚荣
1994-01-01
A method which can be used to determine the structures of 2-Sylow subgroups of K2OF for real quadratic fields F is given.By this method,the structures of the 2-Sylow subgroups of K2OF for some real quadratic fields are determined.The method here is suitable for the non-elementary Abelian case as well as the elementary Abelian case.
Decomposition of integrable holomorphic quadratic differential on Riemann surface of infinite type
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
In this paper,decomposition of the integrable holomorphic quadratic differential on Riemann surface of infinite type is studied.Hubbard,Schleicher and Shishikura gave a thick-thin decomposition on Riemann surface of finite type with an integrable holomorphic quadratic differential and they thought their result might be generalized to arbitrary hyperbolic Riemann surface of infinite type.We confirm what they thought is right and give a proposition(Proposition 2.2) of its own interest.
Analysis of a quadratic system obtained from a scalar third order differential equation
Directory of Open Access Journals (Sweden)
Fabio Scalco Dias
2010-11-01
Full Text Available In this article, we study the nonlinear dynamics of a quadratic system in the three dimensional space which can be obtained from a scalar third order differential equation. More precisely, we study the stability and bifurcations which occur in a parameter dependent quadratic system in the three dimensional space. We present an analytical study of codimension one, two and three Hopf bifurcations, generic Bogdanov-Takens and fold-Hopf bifurcations.
Kubo's Line Shape Function for a Linear-Quadratic Chromophore-Solvent Coupling.
Matyushov, Dmitry V
2015-07-23
An exact, closed-form solution is obtained for the line shape function of an optical transition with the transition frequency depending linearly plus quadratically on a Gaussian coordinate of the thermal bath. The dynamical modulation of the line shape involves two parameters corresponding to the linear and quadratic components of the transition frequency. The increase of the second component results in a non-Gaussian line shape that splits into two Lorenzian lines in the limit of fast modulation.
Global stability and quadratic Hamiltonian structure in Lotka-Volterra and quasi-polynomial systems
Energy Technology Data Exchange (ETDEWEB)
Szederkenyi, Gabor; Hangos, Katalin M
2004-04-26
We show that the global stability of quasi-polynomial (QP) and Lotka-Volterra (LV) systems with the well-known logarithmic Lyapunov function is equivalent to the existence of a local generalized dissipative Hamiltonian description of the LV system with a diagonal quadratic form as a Hamiltonian function. The Hamiltonian function can be calculated and the quadratic dissipativity neighborhood of the origin can be estimated by solving linear matrix inequalities.
Maximum matching by convex quadratic programming based o an adverse graph conjecture
Pacheco, Maria F.; Cardoso, Domingos Moreira; Luz, Carlos J.
2012-01-01
In this talk, we describe a procedure for determining a maximum stable set in a graph with convex-$QP$ stability number (which is a graph whose stability number can be determined by solving a convex quadratic programming problem) unless there is a subgraph for which neither the optimal value of the convex quadratic program nor the least adjacency eigenvalue changes when the neighborhood of any vertex is deleted. Such a graph is called adverse. Assuming the trueness of the adver...
DEFF Research Database (Denmark)
Atamtürk, Alper; Muller, Laurent Flindt; Pisinger, David
2013-01-01
Motivated by addressing probabilistic 0-1 programs we study the conic quadratic knapsack polytope with generalized upper bound (GUB) constraints. In particular, we investigate separating and extending GUB cover inequalities. We show that, unlike in the linear case, determining whether a cover can....... These experiments show that a judicious application of the extended GUB cover cuts can reduce the solution time of conic quadratic 0-1 programs with GUB constraints substantially. © 2013 INFORMS....
Convex quadratic programming applied to the stability number of a graph
Pacheco, Maria F.; Cardoso, Domingos Moreira; Luz, Carlos J.
2012-01-01
We deal with graphs whose stability number can be determined by a convex quadratic program and describe algorithmic techniques for the determination of maximum stabe sets in such graphs (except there is an induced subgraph with least adjacency eigenvalue and optimal value of the convex quadratic program not changing if the neighbourhood of any vertex is deleted). Such a graph is called adverse. Assuming that every adverse graph has convex-QP stability number, an algorithm for the recognition ...
A Tight Linearization Strategy for Zero-One Quadratic Programming Problems
gharibi, Wajeb
2012-01-01
In this paper, we present a new approach to linearizing zero-one quadratic minimization problem which has many applications in computer science and communications. Our algorithm is based on the observation that the quadratic term of zero-one variables has two equivalent piece-wise formulations, convex and concave cases. The convex piece-wise objective function and/or constraints play a great role in deducing small linearization. Further tight strategies are also discussed.
The H2 Control Problem for Quadratically Invariant Systems with Delays
Lamperski, Andrew; Doyle, John C.
2013-01-01
This paper gives a new solution to the output feedback H2 problem for quadratically invariant communication delay patterns. A characterization of all stabilizing controllers satisfying the delay constraints is given and the decentralized H2 problem is cast as a convex model matching problem. The main result shows that the model matching problem can be reduced to a finite-dimensional quadratic program. A recursive state-space method for computing the optimal controller based on vectorization i...
Xuewen Mu; Yaling Zhang
2015-01-01
An alternating direction method is proposed for convex quadratic second-order cone programming problems with bounded constraints. In the algorithm, the primal problem is equivalent to a separate structure convex quadratic programming over second-order cones and a bounded set. At each iteration, we only need to compute the metric projection onto the second-order cones and the projection onto the bound set. The result of convergence is given. Numerical results demonstrate that our method is ...
The Triangular Theorem of the Primes: Binary Quadratic Forms and Primitive Pythagorean Triples
Perez, J A
2011-01-01
This article reports the occurrence of binary quadratic forms in primitive Pythagorean triangles and their geometric interpretation. In addition to the well-known fact that the hypotenuse, z, of a right triangle, with sides of integral (relatively prime) length, can be expressed as the sum of two squares, z=a^2+b^2, where a and b are positive integers of opposite parity such that a>b>0 and gcd(a,b)=1, it is shown that the sum of the two sides, x and y, can also be expressed as a binary quadratic form, x+y=(a+b)^2-2b^2. Similarly, when the radius of the inscribed circle is taken into account, r=b(a-b), a third binary quadratic form is found, namely (x+y)=4r=z-2r=(a-b)^2+2b^2. The three quadratic representations accommodate positive integers whose factorizations can only include primes p represented by the same type of binary quadratic forms, i.e. p=1,5(mod8), p=1,7(mod8), and p=1,3(mod8), respectively. For all three types of binary quadratic forms, when the positive integers represented are prime, such represe...
Lee, Kwang Jo; Liu, Sheng; Gallo, Katia; Petropoulos, Periklis; Richardson, David J
2011-04-25
We report a systematic and comparative study of the acceptance bandwidths of two cascaded quadratic nonlinear processes in periodically poled lithium niobate waveguides, namely cascaded second-harmonic generation and difference-frequency generation (cSHG/DFG) and cascaded sum-frequency generation and difference-frequency generation (cSFG/DFG). We first theoretically and experimentally study the acceptance bandwidths of both the individual second-harmonic generation (SHG) and sum-frequency generation (SFG) processes in the continuous wave (CW) and pulsed-pump regimes. Our results show that the SHG bandwidth is approximately half that of the SFG process in the CW regime, whereas the SHG acceptance bandwidth can approach the CW SFG bandwidth limit when pulsed-pump is used. As a consequence we conclude that the tuning bandwidths of both cascaded processes should be similar in the pulsed pump regime once the pump pulse bandwidths approach that of SFG (i.e. the cSHG/DFG bandwidth is not limited by the CW SHG bandwidth). We confirm that this is the case experimentally.
Vestibular integrator neurons have quadratic functions due to voltage dependent conductances.
Magnani, Christophe; Eugène, Daniel; Idoux, Erwin; Moore, Lee E
2013-12-01
The nonlinear properties of the dendrites of the prepositus hypoglossi nucleus (PHN) neurons are essential for the operation of the vestibular neural integrator that converts a head velocity signal to one that controls eye position. A novel system of frequency probing, namely quadratic sinusoidal analysis (QSA), was used to decode the intrinsic nonlinear behavior of these neurons under voltage clamp conditions. Voltage clamp currents were measured at harmonic and interactive frequencies using specific nonoverlapping stimulation frequencies. Eigenanalysis of the QSA matrix reduces it to a remarkably compact processing unit, composed of just one or two dominant components (eigenvalues). The QSA matrix of rat PHN neurons provides signatures of the voltage dependent conductances for their particular dendritic and somatic distributions. An important part of the nonlinear response is due to the persistent sodium conductance (gNaP), which is likely to be essential for sustained effects needed for a neural integrator. It was found that responses in the range of 10 mV peak to peak could be well described by quadratic nonlinearities suggesting that effects of higher degree nonlinearities would add only marginal improvement. Therefore, the quadratic response is likely to sufficiently capture most of the nonlinear behavior of neuronal systems except for extremely large synaptic inputs. Thus, neurons have two distinct linear and quadratic functions, which shows that piecewise linear + quadratic analysis is much more complete than just piecewise linear analysis; in addition quadratic analysis can be done at a single holding potential. Furthermore, the nonlinear neuronal responses contain more frequencies over a wider frequency band than the input signal. As a consequence, they convert limited amplitude and bandwidth input signals to wider bandwidth and more complex output responses. Finally, simulations at subthreshold membrane potentials with realistic PHN neuron models
Kong, X. M.; Huang, G. H.; Fan, Y. R.; Li, Y. P.
2016-04-01
In this study, a duality theorem-based algorithm (DTA) for inexact quadratic programming (IQP) is developed for municipal solid waste (MSW) management under uncertainty. It improves upon the existing numerical solution method for IQP problems. The comparison between DTA and derivative algorithm (DAM) shows that the DTA method provides better solutions than DAM with lower computational complexity. It is not necessary to identify the uncertain relationship between the objective function and decision variables, which is required for the solution process of DAM. The developed method is applied to a case study of MSW management and planning. The results indicate that reasonable solutions have been generated for supporting long-term MSW management and planning. They could provide more information as well as enable managers to make better decisions to identify desired MSW management policies in association with minimized cost under uncertainty.
On bent and semi-bent quadratic Boolean functions
DEFF Research Database (Denmark)
Charpin, P.; Pasalic, Enes; Tavernier, C.
2005-01-01
The maximum-length sequences, also called m-sequences, have received a lot of attention since the late 1960s. In terms of linear-feedback shift register (LFSR) synthesis they are usually generated by certain power polynomials over a finite field and in addition are characterized by a low cross co...
Institute of Scientific and Technical Information of China (English)
周雪刚
2015-01-01
In this paper, suﬃcient global optimality conditions are presented for nonconvex quadratic programming problems with quadratic constraints as well as hyperrectangle constr-aints. The new conditions are obtained by making use of quadratic underestimators of quadratic function. We first introduce how to construct quadratic underestimators of quadratic function. Then, by using convex quadratic underestimators of the Lagrangian function at the Karush-Kuhn-Tucker point, we establish suﬃcient global optimality conditions for nonconvex quadratic programming problems. And we propose suﬃcient global optimality conditions by utilizing the minimum eigenvalue and quadratic underestimators. Finally, by using quadratic underestima-tors, we establish the suﬃcient condition for nonconvex quadratic programming problems with quadratic constraints.%本文讨论具有二次约束与超矩形约束的非凸二次规划问题的新型全局最优性充分条件，这些新的全局最优性充分条件是利用二次函数的二次下估计函数获得的。我们首先介绍如何构造二次函数的下估计函数。然后利用在KKT点处的拉格朗日函数的凸二次下估计函数建立非凸二次规划问题的全局最优性充分条件，再利用最小特征根与二次下估计函数获得它的全局最优性充分条件。最后利用二次下估计函数建立具有二次约束的非凸二次规划问题的全局最优性充分条件。
BUILDING STUDENTS’ UNDERSTANDING OF QUADRATIC EQUATION CONCEPT USING NAÏVE GEOMETRY
Directory of Open Access Journals (Sweden)
Achmad Dhany Fachrudin
2014-07-01
Full Text Available The purpose of this research is to know how Naïve Geometry method can support students’ understanding about the concept of solving quadratic equations. In this article we will discuss one activities of the four activities we developed. This activity focused on how students linking the Naïve Geometry method with the solving of the quadratic equation especially on how student bring geometric solution into algebraic form. This research was conducted in SMP Negeri 1 Palembang. Design research was chosen as method used in this research that have three main phases. The results of this research showed that manipulating and reshaping the rectangle into square could stimulate students to acquire the idea of solving quadratic equations using completing perfect square method. In the end of the meeting, students are also guided to reinvent the general formula to solve quadratic equations.Keywords: Quadratic Equations, Design Research, Naïve Geometry, PMRI DOI: http://dx.doi.org/10.22342/jme.5.2.1502.191-202
Gorban, A N; Mirkes, E M; Zinovyev, A
2016-12-01
Most of machine learning approaches have stemmed from the application of minimizing the mean squared distance principle, based on the computationally efficient quadratic optimization methods. However, when faced with high-dimensional and noisy data, the quadratic error functionals demonstrated many weaknesses including high sensitivity to contaminating factors and dimensionality curse. Therefore, a lot of recent applications in machine learning exploited properties of non-quadratic error functionals based on L1 norm or even sub-linear potentials corresponding to quasinorms Lp (0basic universal data approximation algorithms (k-means, principal components, principal manifolds and graphs, regularized and sparse regression), based on piece-wise quadratic error potentials of subquadratic growth (PQSQ potentials). We develop a new and universal framework to minimize arbitrary sub-quadratic error potentials using an algorithm with guaranteed fast convergence to the local or global error minimum. The theory of PQSQ potentials is based on the notion of the cone of minorant functions, and represents a natural approximation formalism based on the application of min-plus algebra. The approach can be applied in most of existing machine learning methods, including methods of data approximation and regularized and sparse regression, leading to the improvement in the computational cost/accuracy trade-off. We demonstrate that on synthetic and real-life datasets PQSQ-based machine learning methods achieve orders of magnitude faster computational performance than the corresponding state-of-the-art methods, having similar or better approximation accuracy. Copyright © 2016 Elsevier Ltd. All rights reserved.
Directory of Open Access Journals (Sweden)
Yong Li
2014-01-01
Full Text Available The translational axis is one of the most important subsystems in modern machine tools, as its degradation may result in the loss of the product qualification and lower the control precision. Condition-based maintenance (CBM has been considered as one of the advanced maintenance schemes to achieve effective, reliable and cost-effective operation of machine systems, however, current vibration-based maintenance schemes cannot be employed directly in the translational axis system, due to its complex structure and the inefficiency of commonly used condition monitoring features. In this paper, a wavelet bicoherence-based quadratic nonlinearity feature is proposed for translational axis condition monitoring by using the torque signature of the drive servomotor. Firstly, the quadratic nonlinearity of the servomotor torque signature is discussed, and then, a biphase randomization wavelet bicoherence is introduced for its quadratic nonlinear detection. On this basis, a quadratic nonlinearity feature is proposed for condition monitoring of the translational axis. The properties of the proposed quadratic nonlinearity feature are investigated by simulations. Subsequently, this feature is applied to the real-world servomotor torque data collected from the X-axis on a high precision vertical machining centre. All the results show that the performance of the proposed feature is much better than that of original condition monitoring features.
Li, Yong; Wang, Xiufeng; Lin, Jing; Shi, Shengyu
2014-01-27
The translational axis is one of the most important subsystems in modern machine tools, as its degradation may result in the loss of the product qualification and lower the control precision. Condition-based maintenance (CBM) has been considered as one of the advanced maintenance schemes to achieve effective, reliable and cost-effective operation of machine systems, however, current vibration-based maintenance schemes cannot be employed directly in the translational axis system, due to its complex structure and the inefficiency of commonly used condition monitoring features. In this paper, a wavelet bicoherence-based quadratic nonlinearity feature is proposed for translational axis condition monitoring by using the torque signature of the drive servomotor. Firstly, the quadratic nonlinearity of the servomotor torque signature is discussed, and then, a biphase randomization wavelet bicoherence is introduced for its quadratic nonlinear detection. On this basis, a quadratic nonlinearity feature is proposed for condition monitoring of the translational axis. The properties of the proposed quadratic nonlinearity feature are investigated by simulations. Subsequently, this feature is applied to the real-world servomotor torque data collected from the X-axis on a high precision vertical machining centre. All the results show that the performance of the proposed feature is much better than that of original condition monitoring features.
Unified dark energy and dust dark matter dual to quadratic purely kinetic K-essence
Energy Technology Data Exchange (ETDEWEB)
Guendelman, Eduardo [Ben-Gurion University of the Negev, Department of Physics, Beersheba (Israel); Nissimov, Emil; Pacheva, Svetlana [Institute for Nuclear Research and Nuclear Energy, Sofia (Bulgaria)
2016-02-15
We consider a modified gravity plus single scalar-field model, where the scalar Lagrangian couples symmetrically both to the standard Riemannian volume-form (spacetime integration measure density) given by the square root of the determinant of the Riemannian metric, as well as to another non-Riemannian volume-form in terms of an auxiliary maximal-rank antisymmetric tensor gauge field. As shown in a previous paper, the pertinent scalar-field dynamics provides an exact unified description of both dark energy via dynamical generation of a cosmological constant, and dark matter as a ''dust'' fluid with geodesic flow as a result of a hidden Noether symmetry. Here we extend the discussion by considering a non-trivial modification of the purely gravitational action in the form of f(R) = R -αR{sup 2} generalized gravity. Upon deriving the corresponding ''Einstein-frame'' effective action of the latter modified gravity-scalar-field theory we find explicit duality (in the sense of weak versus strong coupling) between the original model of unified dynamical dark energy and dust fluid dark matter, on one hand, and a specific quadratic purely kinetic ''k-essence'' gravity-matter model with special dependence of its coupling constants on only two independent parameters, on the other hand. The canonical Hamiltonian treatment and Wheeler-DeWitt quantization of the dual purely kinetic ''k-essence'' gravity-matter model is also briefly discussed. (orig.)
Femtosecond nonlinear polarization evolution based on cascade quadratic nonlinearities.
Liu, X; Ilday, F O; Beckwitt, K; Wise, F W
2000-09-15
We experimentally demonstrate that one can exploit nonlinear phase shifts produced in type I phase-mismatched second-harmonic generation to produce intensity-dependent polarization evolution with 100-fs pulses. An amplitude modulator based on nonlinear polarization rotation provides passive amplitude-modulation depth of up to ~50%. Applications of the amplitude and phase modulations to mode locking of femtosecond bulk and fiber lasers are promising and are discussed.
Vectorial spatial solitons in bulk periodic quadratically nonlinear media
Energy Technology Data Exchange (ETDEWEB)
Panoiu, N-C [Department of Applied Physics and Applied Mathematics, Columbia University, New York, NY 10027 (United States); Mihalache, D [Department of Theoretical Physics, Institute of Atomic Physics, PO Box MG-6, Bucharest (Romania); Mazilu, D [Department of Theoretical Physics, Institute of Atomic Physics, PO Box MG-6, Bucharest (Romania); Lederer, F [Institute of Solid State Theory and Theoretical Optics, Friedrich Schiller University Jena, Max-Wien-Platz 1, Jena, D-07743 (Germany); Osgood, R M Jr [Department of Applied Physics and Applied Mathematics, Columbia University, New York, NY 10027 (United States)
2004-05-01
We present a comprehensive analysis of the generation, propagation and characteristic properties of two-dimensional spatial solitons formed in quasi-phase-matched gratings through type-II vectorial interaction. By employing an averaging approach based on asymptotic expansion theory, we show that the dynamics of soliton propagation in the grating and their stability properties are strongly influenced by induced Kerr-like nonlinearities. Finally, through extensive numerical simulations, we verify the validity of our theoretical predictions.