IS NSVS 5066754 A NEAR-CONTACT OR A MARGINAL CONTACT BINARY?

DOE Office of Scientific and Technical Information (OSTI.GOV)

Samec, Ronald G.; Nyaude, Ropafadzo; Caton, Daniel B.

BVR{sub cIc} light curves of NSVS 5066754 were taken on 2014 May at Dark Sky Observatory in North Carolina. This variable is a solar-type eclipsing binary ( T 1 ∼ 5750 K) with a period of only 0.3751689(1) days. It appeared to be one of the shortest periods in Shaw’s list of near-contact binaries. The Binary Maker fits and our Wilson–Devinney solutions show that the binary could have both semidetached and marginal contact binary configurations. Five new times of minimum light were calculated, along with two minima determined from archived All Sky Automated Survey observations. From these minima and the discovery epoch, amore » quadratic ephemeris was determined. Thus, a magnetic braking scenario is possible. Both semidetached and contact models were explored. A marginal contact solution had the best sum of square residuals. It gave a mass ratio of ∼0.5, and a component temperature difference of ∼360 K, albeit somewhat large for a contact binary. Two substantial cool spots were determined in this solution with 37° and 28° radii and t-factors or 0.94 and 0.78 respectively. The fill-out is very shallow, ∼106%. It may have recently achieved contact.« less

Development of C++ Application Program for Solving Quadratic Equation in Elementary School in Nigeria

ERIC Educational Resources Information Center

Bandele, Samuel Oye; Adekunle, Adeyemi Suraju

2015-01-01

The study was conducted to design, develop and test a c++ application program CAP-QUAD for solving quadratic equation in elementary school in Nigeria. The package was developed in c++ using object-oriented programming language, other computer program that were also utilized during the development process is DevC++ compiler, it was used for…

Observations and Analysis of the F-type Near-Contact Binary, NSVS 1054 1123

NASA Astrophysics Data System (ADS)

Caton, Daniel Bruce; Samec, Ronald G.; Faulkner, Danny R.

2018-01-01

NSVS 1054 1123 is a F2±2 type (T~ 6750K) eclipsing binary. It was observed in April and May, 2015 at the Appalachian State University’s Dark Sky Observatory in North Carolina with the 32-inch telescope. Six times of minimum light were determined from our present observations, which include two primary eclipses and four secondary eclipses:HJD Min I = 2457113.9330 ±0. 0.0002, 24 57147.8761 ±0.0001,HJD Min II = 2457117.80391 ±0.0006, 2457136.8600 ±0. 0007, 2457148.77040 ±0.0004, 2457151.7468 ±0.0002In addition, six observations at minima were introduced as low weighted times of minimum light taken from archived NSVS Data.The following quadratic ephemerides was determined from all available times of minimum light:JD Hel Min I=2457147.87646±0.00049d + 0 .5954966±0.0000065 X E -0.0000000017± 0.0000000007 X E2A period decrease may indicate that the binary is undergoing magnetic braking and is approaching its contact configuration. A BVRcIc simultaneous (preliminary) Wilson-Devinney Program (W-D) solution indicates that the system has a mass ratio of 0.5828±0.0004, and a component temperature difference of 2350 K. The large DT in the components verify that the binary is not in contact. A Binary Maker fitted hot spot altered slightly but was not eliminated in the WD Synthetic Light Curve Computations. It remains on the larger component at the equator on the correct (following) side for a stream spot directed from the secondary component (as dictated by the Coriolis effect). This could indicate that the components are near filling their respective Roche Lobes. The fill-out of our model is -0.036 for the primary component and -0.048 for the secondary component. The inclination is ~79 degrees, not enough for the system to undergo a total eclipse.Additional and more detailed information is given in this report.

Item Pool Construction Using Mixed Integer Quadratic Programming (MIQP). GMAC® Research Report RR-14-01

ERIC Educational Resources Information Center

Han, Kyung T.; Rudner, Lawrence M.

2014-01-01

This study uses mixed integer quadratic programming (MIQP) to construct multiple highly equivalent item pools simultaneously, and compares the results from mixed integer programming (MIP). Three different MIP/MIQP models were implemented and evaluated using real CAT item pool data with 23 different content areas and a goal of equal information…

Quadratic constrained mixed discrete optimization with an adiabatic quantum optimizer

NASA Astrophysics Data System (ADS)

Chandra, Rishabh; Jacobson, N. Tobias; Moussa, Jonathan E.; Frankel, Steven H.; Kais, Sabre

2014-07-01

We extend the family of problems that may be implemented on an adiabatic quantum optimizer (AQO). When a quadratic optimization problem has at least one set of discrete controls and the constraints are linear, we call this a quadratic constrained mixed discrete optimization (QCMDO) problem. QCMDO problems are NP-hard, and no efficient classical algorithm for their solution is known. Included in the class of QCMDO problems are combinatorial optimization problems constrained by a linear partial differential equation (PDE) or system of linear PDEs. An essential complication commonly encountered in solving this type of problem is that the linear constraint may introduce many intermediate continuous variables into the optimization while the computational cost grows exponentially with problem size. We resolve this difficulty by developing a constructive mapping from QCMDO to quadratic unconstrained binary optimization (QUBO) such that the size of the QUBO problem depends only on the number of discrete control variables. With a suitable embedding, taking into account the physical constraints of the realizable coupling graph, the resulting QUBO problem can be implemented on an existing AQO. The mapping itself is efficient, scaling cubically with the number of continuous variables in the general case and linearly in the PDE case if an efficient preconditioner is available.

Manpower Targets and Educational Investments

ERIC Educational Resources Information Center

Ritzen, Jo M.

1976-01-01

Discusses the use of quadratic programming to calculate the optimal distribution of educational investments required to closely approach manpower targets when financial resources are insufficient to meet manpower targets completely. Demonstrates use of the quadratic programming approach by applying it to the training of supervisory technicians in…

Library-based illumination synthesis for critical CMOS patterning.

PubMed

Yu, Jue-Chin; Yu, Peichen; Chao, Hsueh-Yung

2013-07-01

In optical microlithography, the illumination source for critical complementary metal-oxide-semiconductor layers needs to be determined in the early stage of a technology node with very limited design information, leading to simple binary shapes. Recently, the availability of freeform sources permits us to increase pattern fidelity and relax mask complexities with minimal insertion risks to the current manufacturing flow. However, source optimization across many patterns is often treated as a design-of-experiments problem, which may not fully exploit the benefits of a freeform source. In this paper, a rigorous source-optimization algorithm is presented via linear superposition of optimal sources for pre-selected patterns. We show that analytical solutions are made possible by using Hopkins formulation and quadratic programming. The algorithm allows synthesized illumination to be linked with assorted pattern libraries, which has a direct impact on design rule studies for early planning and design automation for full wafer optimization.

QSPIN: A High Level Java API for Quantum Computing Experimentation

NASA Technical Reports Server (NTRS)

Barth, Tim

2017-01-01

QSPIN is a high level Java language API for experimentation in QC models used in the calculation of Ising spin glass ground states and related quadratic unconstrained binary optimization (QUBO) problems. The Java API is intended to facilitate research in advanced QC algorithms such as hybrid quantum-classical solvers, automatic selection of constraint and optimization parameters, and techniques for the correction and mitigation of model and solution errors. QSPIN includes high level solver objects tailored to the D-Wave quantum annealing architecture that implement hybrid quantum-classical algorithms [Booth et al.] for solving large problems on small quantum devices, elimination of variables via roof duality, and classical computing optimization methods such as GPU accelerated simulated annealing and tabu search for comparison. A test suite of documented NP-complete applications ranging from graph coloring, covering, and partitioning to integer programming and scheduling are provided to demonstrate current capabilities.

The design of dual-mode complex signal processors based on quadratic modular number codes

NASA Astrophysics Data System (ADS)

Jenkins, W. K.; Krogmeier, J. V.

1987-04-01

It has been known for a long time that quadratic modular number codes admit an unusual representation of complex numbers which leads to complete decoupling of the real and imaginary channels, thereby simplifying complex multiplication and providing error isolation between the real and imaginary channels. This paper first presents a tutorial review of the theory behind the different types of complex modular rings (fields) that result from particular parameter selections, and then presents a theory for a 'dual-mode' complex signal processor based on the choice of augmented power-of-2 moduli. It is shown how a diminished-1 binary code, used by previous designers for the realization of Fermat number transforms, also leads to efficient realizations for dual-mode complex arithmetic for certain augmented power-of-2 moduli. Then a design is presented for a recursive complex filter based on a ROM/ACCUMULATOR architecture and realized in an augmented power-of-2 quadratic code, and a computer-generated example of a complex recursive filter is shown to illustrate the principles of the theory.

A case study in programming a quantum annealer for hard operational planning problems

NASA Astrophysics Data System (ADS)

Rieffel, Eleanor G.; Venturelli, Davide; O'Gorman, Bryan; Do, Minh B.; Prystay, Elicia M.; Smelyanskiy, Vadim N.

2015-01-01

We report on a case study in programming an early quantum annealer to attack optimization problems related to operational planning. While a number of studies have looked at the performance of quantum annealers on problems native to their architecture, and others have examined performance of select problems stemming from an application area, ours is one of the first studies of a quantum annealer's performance on parametrized families of hard problems from a practical domain. We explore two different general mappings of planning problems to quadratic unconstrained binary optimization (QUBO) problems, and apply them to two parametrized families of planning problems, navigation-type and scheduling-type. We also examine two more compact, but problem-type specific, mappings to QUBO, one for the navigation-type planning problems and one for the scheduling-type planning problems. We study embedding properties and parameter setting and examine their effect on the efficiency with which the quantum annealer solves these problems. From these results, we derive insights useful for the programming and design of future quantum annealers: problem choice, the mapping used, the properties of the embedding, and the annealing profile all matter, each significantly affecting the performance.

Determining the Optimal Solution for Quadratically Constrained Quadratic Programming (QCQP) on Energy-Saving Generation Dispatch Problem

NASA Astrophysics Data System (ADS)

Lesmana, E.; Chaerani, D.; Khansa, H. N.

2018-03-01

Energy-Saving Generation Dispatch (ESGD) is a scheme made by Chinese Government in attempt to minimize CO2 emission produced by power plant. This scheme is made related to global warming which is primarily caused by too much CO2 in earth’s atmosphere, and while the need of electricity is something absolute, the power plants producing it are mostly thermal-power plant which produced many CO2. Many approach to fulfill this scheme has been made, one of them came through Minimum Cost Flow in which resulted in a Quadratically Constrained Quadratic Programming (QCQP) form. In this paper, ESGD problem with Minimum Cost Flow in QCQP form will be solved using Lagrange’s Multiplier Method

Adiabatic Quantum Computing with Neutral Atoms

NASA Astrophysics Data System (ADS)

Hankin, Aaron; Biedermann, Grant; Burns, George; Jau, Yuan-Yu; Johnson, Cort; Kemme, Shanalyn; Landahl, Andrew; Mangan, Michael; Parazzoli, L. Paul; Schwindt, Peter; Armstrong, Darrell

2012-06-01

We are developing, both theoretically and experimentally, a neutral atom qubit approach to adiabatic quantum computation. Using our microfabricated diffractive optical elements, we plan to implement an array of optical traps for cesium atoms and use Rydberg-dressed ground states to provide a controlled atom-atom interaction. We will develop this experimental capability to generate a two-qubit adiabatic evolution aimed specifically toward demonstrating the two-qubit quadratic unconstrained binary optimization (QUBO) routine.

A non-linear programming approach to the computer-aided design of regulators using a linear-quadratic formulation

NASA Technical Reports Server (NTRS)

Fleming, P.

1985-01-01

A design technique is proposed for linear regulators in which a feedback controller of fixed structure is chosen to minimize an integral quadratic objective function subject to the satisfaction of integral quadratic constraint functions. Application of a non-linear programming algorithm to this mathematically tractable formulation results in an efficient and useful computer-aided design tool. Particular attention is paid to computational efficiency and various recommendations are made. Two design examples illustrate the flexibility of the approach and highlight the special insight afforded to the designer.

Long-term eclipse timing of white dwarf binaries: an observational hint of a magnetic mechanism at work

NASA Astrophysics Data System (ADS)

Bours, M. C. P.; Marsh, T. R.; Parsons, S. G.; Dhillon, V. S.; Ashley, R. P.; Bento, J. P.; Breedt, E.; Butterley, T.; Caceres, C.; Chote, P.; Copperwheat, C. M.; Hardy, L. K.; Hermes, J. J.; Irawati, P.; Kerry, P.; Kilkenny, D.; Littlefair, S. P.; McAllister, M. J.; Rattanasoon, S.; Sahman, D. I.; Vučković, M.; Wilson, R. W.

2016-08-01

We present a long-term programme for timing the eclipses of white dwarfs in close binaries to measure apparent and/or real variations in their orbital periods. Our programme includes 67 close binaries, both detached and semi-detached and with M-dwarfs, K-dwarfs, brown dwarfs or white dwarfs secondaries. In total, we have observed more than 650 white dwarf eclipses. We use this sample to search for orbital period variations and aim to identify the underlying cause of these variations. We find that the probability of observing orbital period variations increases significantly with the observational baseline. In particular, all binaries with baselines exceeding 10 yr, with secondaries of spectral type K2 - M5.5, show variations in the eclipse arrival times that in most cases amount to several minutes. In addition, among those with baselines shorter than 10 yr, binaries with late spectral type (>M6), brown dwarf or white dwarf secondaries appear to show no orbital period variations. This is in agreement with the so-called Applegate mechanism, which proposes that magnetic cycles in the secondary stars can drive variability in the binary orbits. We also present new eclipse times of NN Ser, which are still compatible with the previously published circumbinary planetary system model, although only with the addition of a quadratic term to the ephemeris. Finally, we conclude that we are limited by the relatively short observational baseline for many of the binaries in the eclipse timing programme, and therefore cannot yet draw robust conclusions about the cause of orbital period variations in evolved, white dwarf binaries.

PSQP: Puzzle Solving by Quadratic Programming.

PubMed

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.

An application of nonlinear programming to the design of regulators of a linear-quadratic formulation

NASA Technical Reports Server (NTRS)

Fleming, P.

1983-01-01

A design technique is proposed for linear regulators in which a feedback controller of fixed structure is chosen to minimize an integral quadratic objective function subject to the satisfaction of integral quadratic constraint functions. Application of a nonlinear programming algorithm to this mathematically tractable formulation results in an efficient and useful computer aided design tool. Particular attention is paid to computational efficiency and various recommendations are made. Two design examples illustrate the flexibility of the approach and highlight the special insight afforded to the designer. One concerns helicopter longitudinal dynamics and the other the flight dynamics of an aerodynamically unstable aircraft.

Adiabatic Quantum Computation with Neutral Atoms

NASA Astrophysics Data System (ADS)

Biedermann, Grant

2013-03-01

We are implementing a new platform for adiabatic quantum computation (AQC)[2] based on trapped neutral atoms whose coupling is mediated by the dipole-dipole interactions of Rydberg states. Ground state cesium atoms are dressed by laser fields in a manner conditional on the Rydberg blockade mechanism,[3,4] thereby providing the requisite entangling interactions. As a benchmark we study a Quadratic Unconstrained Binary Optimization (QUBO) problem whose solution is found in the ground state spin configuration of an Ising-like model. In collaboration with Lambert Parazzoli, Sandia National Laboratories; Aaron Hankin, Center for Quantum Information and Control (CQuIC), University of New Mexico; James Chin-Wen Chou, Yuan-Yu Jau, Peter Schwindt, Cort Johnson, and George Burns, Sandia National Laboratories; Tyler Keating, Krittika Goyal, and Ivan Deutsch, Center for Quantum Information and Control (CQuIC), University of New Mexico; and Andrew Landahl, Sandia National Laboratories. This work was supported by the Laboratory Directed Research and Development program at Sandia National Laboratories

A symbiotic approach to fluid equations and non-linear flux-driven simulations of plasma dynamics

NASA Astrophysics Data System (ADS)

Halpern, Federico

2017-10-01

The fluid framework is ubiquitous in studies of plasma transport and stability. Typical forms of the fluid equations are motivated by analytical work dating several decades ago, before computer simulations were indispensable, and can be, therefore, not optimal for numerical computation. We demonstrate a new first-principles approach to obtaining manifestly consistent, skew-symmetric fluid models, ensuring internal consistency and conservation properties even in discrete form. Mass, kinetic, and internal energy become quadratic (and always positive) invariants of the system. The model lends itself to a robust, straightforward discretization scheme with inherent non-linear stability. A simpler, drift-ordered form of the equations is obtained, and first results of their numerical implementation as a binary framework for bulk-fluid global plasma simulations are demonstrated. This material is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Fusion Energy Sciences, Theory Program, under Award No. DE-FG02-95ER54309.

Pseudorandom number generation using chaotic true orbits of the Bernoulli map

DOE Office of Scientific and Technical Information (OSTI.GOV)

Saito, Asaki, E-mail: saito@fun.ac.jp; Yamaguchi, Akihiro

We devise a pseudorandom number generator that exactly computes chaotic true orbits of the Bernoulli map on quadratic algebraic integers. Moreover, we describe a way to select the initial points (seeds) for generating multiple pseudorandom binary sequences. This selection method distributes the initial points almost uniformly (equidistantly) in the unit interval, and latter parts of the generated sequences are guaranteed not to coincide. We also demonstrate through statistical testing that the generated sequences possess good randomness properties.

Cooperative Solutions in Multi-Person Quadratic Decision Problems: Finite-Horizon and State-Feedback Cost-Cumulant Control Paradigm

DTIC Science & Technology

2007-01-01

CONTRACT NUMBER Problems: Finite -Horizon and State-Feedback Cost-Cumulant Control Paradigm (PREPRINT) 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER...cooperative cost-cumulant control regime for the class of multi-person single-objective decision problems characterized by quadratic random costs and... finite -horizon integral quadratic cost associated with a linear stochastic system . Since this problem formation is parameterized by the number of cost

Reduction of shock induced noise in imperfectly expanded supersonic jets using convex optimization

NASA Astrophysics Data System (ADS)

Adhikari, Sam

2007-11-01

Imperfectly expanded jets generate screech noise. The imbalance between the backpressure and the exit pressure of the imperfectly expanded jets produce shock cells and expansion or compression waves from the nozzle. The instability waves and the shock cells interact to generate the screech sound. The mathematical model consists of cylindrical coordinate based full Navier-Stokes equations and large-eddy-simulation turbulence modeling. Analytical and computational analysis of the three-dimensional helical effects provide a model that relates several parameters with shock cell patterns, screech frequency and distribution of shock generation locations. Convex optimization techniques minimize the shock cell patterns and the instability waves. The objective functions are (convex) quadratic and the constraint functions are affine. In the quadratic optimization programs, minimization of the quadratic functions over a set of polyhedrons provides the optimal result. Various industry standard methods like regression analysis, distance between polyhedra, bounding variance, Markowitz optimization, and second order cone programming is used for Quadratic Optimization.

Technical report. The application of probability-generating functions to linear-quadratic radiation survival curves.

PubMed

Kendal, W S

2000-04-01

To illustrate how probability-generating functions (PGFs) can be employed to derive a simple probabilistic model for clonogenic survival after exposure to ionizing irradiation. Both repairable and irreparable radiation damage to DNA were assumed to occur by independent (Poisson) processes, at intensities proportional to the irradiation dose. Also, repairable damage was assumed to be either repaired or further (lethally) injured according to a third (Bernoulli) process, with the probability of lethal conversion being directly proportional to dose. Using the algebra of PGFs, these three processes were combined to yield a composite PGF that described the distribution of lethal DNA lesions in irradiated cells. The composite PGF characterized a Poisson distribution with mean, chiD+betaD2, where D was dose and alpha and beta were radiobiological constants. This distribution yielded the conventional linear-quadratic survival equation. To test the composite model, the derived distribution was used to predict the frequencies of multiple chromosomal aberrations in irradiated human lymphocytes. The predictions agreed well with observation. This probabilistic model was consistent with single-hit mechanisms, but it was not consistent with binary misrepair mechanisms. A stochastic model for radiation survival has been constructed from elementary PGFs that exactly yields the linear-quadratic relationship. This approach can be used to investigate other simple probabilistic survival models.

Searches for millisecond pulsations in low-mass X-ray binaries, 2

NASA Technical Reports Server (NTRS)

Vaughan, B. A.; Van Der Klis, M.; Wood, K. S.; Norris, J. P.; Hertz, P.; Michelson, P. F.; Paradijs, J. Van; Lewin, W. H. G.; Mitsuda, K.; Penninx, W.

1994-01-01

Coherent millisecond X-ray pulsations are expected from low-mass X-ray binaries (LMXBs), but remain undetected. Using the single-parameter Quadratic Coherence Recovery Technique (QCRT) to correct for unknown binary orbit motion, we have performed Fourier transform searches for coherent oscillations in all long, continuous segments of data obtained at 1 ms time resolution during Ginga observations of LMXB. We have searched the six known Z sources (GX 5-1, Cyg X-2, Sco X-1, GX 17+2, GX 340+0, and GX 349+2), seven of the 14 known atoll sources (GX 3+1. GX 9+1, GX 9+9, 1728-33. 1820-30, 1636-53 and 1608-52), the 'peculiar' source Cir X-1, and the high-mass binary Cyg X-3. We find no evidence for coherent pulsations in any of these sources, with 99% confidence limits on the pulsed fraction between 0.3% and 5.0% at frequencies below the Nyquist frequency of 512 Hz. A key assumption made in determining upper limits in previous searches is shown to be incorrect. We provide a recipe for correctly setting upper limits and detection thresholds. Finally we discuss and apply two strategies to improve sensitivity by utilizing multiple, independent, continuous segments of data with comparable count rates.

Optimization by nonhierarchical asynchronous decomposition

NASA Technical Reports Server (NTRS)

Shankar, Jayashree; Ribbens, Calvin J.; Haftka, Raphael T.; Watson, Layne T.

1992-01-01

Large scale optimization problems are tractable only if they are somehow decomposed. Hierarchical decompositions are inappropriate for some types of problems and do not parallelize well. Sobieszczanski-Sobieski has proposed a nonhierarchical decomposition strategy for nonlinear constrained optimization that is naturally parallel. Despite some successes on engineering problems, the algorithm as originally proposed fails on simple two dimensional quadratic programs. The algorithm is carefully analyzed for quadratic programs, and a number of modifications are suggested to improve its robustness.

Improvements on ν-Twin Support Vector Machine.

PubMed

Khemchandani, Reshma; Saigal, Pooja; Chandra, Suresh

2016-07-01

In this paper, we propose two novel binary classifiers termed as "Improvements on ν-Twin Support Vector Machine: Iν-TWSVM and Iν-TWSVM (Fast)" that are motivated by ν-Twin Support Vector Machine (ν-TWSVM). Similar to ν-TWSVM, Iν-TWSVM determines two nonparallel hyperplanes such that they are closer to their respective classes and are at least ρ distance away from the other class. The significant advantage of Iν-TWSVM over ν-TWSVM is that Iν-TWSVM solves one smaller-sized Quadratic Programming Problem (QPP) and one Unconstrained Minimization Problem (UMP); as compared to solving two related QPPs in ν-TWSVM. Further, Iν-TWSVM (Fast) avoids solving a smaller sized QPP and transforms it as a unimodal function, which can be solved using line search methods and similar to Iν-TWSVM, the other problem is solved as a UMP. Due to their novel formulation, the proposed classifiers are faster than ν-TWSVM and have comparable generalization ability. Iν-TWSVM also implements structural risk minimization (SRM) principle by introducing a regularization term, along with minimizing the empirical risk. The other properties of Iν-TWSVM, related to support vectors (SVs), are similar to that of ν-TWSVM. To test the efficacy of the proposed method, experiments have been conducted on a wide range of UCI and a skewed variation of NDC datasets. We have also given the application of Iν-TWSVM as a binary classifier for pixel classification of color images. Copyright © 2016 Elsevier Ltd. All rights reserved.

Searches for millisecond pulsations in low-mass X-ray binaries

NASA Technical Reports Server (NTRS)

Wood, K. S.; Hertz, P.; Norris, J. P.; Vaughan, B. A.; Michelson, P. F.; Mitsuda, K.; Lewin, W. H. G.; Van Paradijs, J.; Penninx, W.; Van Der Klis, M.

1991-01-01

High-sensitivity search techniques for millisecond periods are presented and applied to data from the Japanese satellite Ginga and HEAO 1. The search is optimized for pulsed signals whose period, drift rate, and amplitude conform with what is expected for low-class X-ray binary (LMXB) sources. Consideration is given to how the current understanding of LMXBs guides the search strategy and sets these parameter limits. An optimized one-parameter coherence recovery technique (CRT) developed for recovery of phase coherence is presented. This technique provides a large increase in sensitivity over the method of incoherent summation of Fourier power spectra. The range of spin periods expected from LMXB phenomenology is discussed, the necessary constraints on the application of CRT are described in terms of integration time and orbital parameters, and the residual power unrecovered by the quadratic approximation for realistic cases is estimated.

Hyperspectral imaging for differentiation of foreign materials from pinto beans

NASA Astrophysics Data System (ADS)

Mehrubeoglu, Mehrube; Zemlan, Michael; Henry, Sam

2015-09-01

Food safety and quality in packaged products are paramount in the food processing industry. To ensure that packaged products are free of foreign materials, such as debris and pests, unwanted materials mixed with the targeted products must be detected before packaging. A portable hyperspectral imaging system in the visible-to-NIR range has been used to acquire hyperspectral data cubes from pinto beans that have been mixed with foreign matter. Bands and band ratios have been identified as effective features to develop a classification scheme for detection of foreign materials in pinto beans. A support vector machine has been implemented with a quadratic kernel to separate pinto beans and background (Class 1) from all other materials (Class 2) in each scene. After creating a binary classification map for the scene, further analysis of these binary images allows separation of false positives from true positives for proper removal action during packaging.

Adiabatic Quantum Computation with Neutral Cesium

NASA Astrophysics Data System (ADS)

Hankin, Aaron; Parazzoli, L.; Chou, Chin-Wen; Jau, Yuan-Yu; Burns, George; Young, Amber; Kemme, Shanalyn; Ferdinand, Andrew; Biedermann, Grant; Landahl, Andrew; Ivan H. Deutsch Collaboration; Mark Saffman Collaboration

2013-05-01

We are implementing a new platform for adiabatic quantum computation (AQC) based on trapped neutral atoms whose coupling is mediated by the dipole-dipole interactions of Rydberg states. Ground state cesium atoms are dressed by laser fields in a manner conditional on the Rydberg blockade mechanism, thereby providing the requisite entangling interactions. As a benchmark we study a Quadratic Unconstrained Binary Optimization (QUBO) problem whose solution is found in the ground state spin configuration of an Ising-like model. University of New Mexico: Ivan H. Deutsch, Tyler Keating, Krittika Goyal.

A spectrum synthesis program for binary stars

NASA Technical Reports Server (NTRS)

Linnell, Albert P.; Hubeny, Ivan

1994-01-01

A new program produces synthetic spectra of binary stars at arbitrary values of orbital longitude, including longitudes of partial or complete eclipse. The stellar components may be distorted, either tidally or rotationally, or both. Either or both components may be rotating nonsynchronously. We illustrate the program performance with two cases: EE Peg, an eclipsing binary with small distortion, and SX Aur, an eclipsing binary that is close to contact.

Mapping proteins in the presence of paralogs using units of coevolution

PubMed Central

2013-01-01

Background We study the problem of mapping proteins between two protein families in the presence of paralogs. This problem occurs as a difficult subproblem in coevolution-based computational approaches for protein-protein interaction prediction. Results Similar to prior approaches, our method is based on the idea that coevolution implies equal rates of sequence evolution among the interacting proteins, and we provide a first attempt to quantify this notion in a formal statistical manner. We call the units that are central to this quantification scheme the units of coevolution. A unit consists of two mapped protein pairs and its score quantifies the coevolution of the pairs. This quantification allows us to provide a maximum likelihood formulation of the paralog mapping problem and to cast it into a binary quadratic programming formulation. Conclusion CUPID, our software tool based on a Lagrangian relaxation of this formulation, makes it, for the first time, possible to compute state-of-the-art quality pairings in a few minutes of runtime. In summary, we suggest a novel alternative to the earlier available approaches, which is statistically sound and computationally feasible. PMID:24564758

Computer program documentation: CYBER to Univac binary conversion user's guide

NASA Technical Reports Server (NTRS)

Martin, E. W.

1980-01-01

A user's guide for a computer program which will convert SINDA temperature history data from CDC (Cyber) binary format to UNIVAC 1100 binary format is presented. The various options available, the required input, the optional output, file assignments, and the restrictions of the program are discussed.

BVRI Photometric Study of the High Mass Ratio, Detached, Pre-contact W UMa Binary GQ Cancri

NASA Astrophysics Data System (ADS)

Samec, R. G.; Olson, A.; Caton, D.; Faulkner, D. R.

2017-12-01

CCD BVRcIc light curves of GQ Cancri were observed in April 2013 using the SARA North 0.9-meter Telescope at Kitt Peak National Observatory in Arizona in remote mode. It is a high-amplitude (V 0.9 magnitude) K0±V type eclipsing binary (T1 5250 K) with a photometrically-determined mass ratio of M2 / M1 = 0.80. Its spectral color type classifies it as a pre-contact W UMa Binary (PCWB). The Wilson-Devinney Mode 2 solutions show that the system has a detached binary configuration with fill-outs of 94% and 98% for the primary and secondary component, respectively. As expected, the light curve is asymmetric due to spot activity. Three times of minimum light were calculated, for two primary eclipses and one secondary eclipse, from our present observations. In total, some 26 times of minimum light covering nearly 20 years of observation were used to determine linear and quadratic ephemerides. It is noted that the light curve solution remained in a detached state for every iteration of the computer runs. The components are very similar with a computed temperature difference of only 4 K, and the flux of the primary component accounts for 53±55% of the system's light in B, V, Rc, and Ic. A 12-degree radius high latitude white spot (faculae) was iterated on the primary component.

A Generalization of the Karush-Kuhn-Tucker Theorem for Approximate Solutions of Mathematical Programming Problems Based on Quadratic Approximation

NASA Astrophysics Data System (ADS)

Voloshinov, V. V.

2018-03-01

In computations related to mathematical programming problems, one often has to consider approximate, rather than exact, solutions satisfying the constraints of the problem and the optimality criterion with a certain error. For determining stopping rules for iterative procedures, in the stability analysis of solutions with respect to errors in the initial data, etc., a justified characteristic of such solutions that is independent of the numerical method used to obtain them is needed. A necessary δ-optimality condition in the smooth mathematical programming problem that generalizes the Karush-Kuhn-Tucker theorem for the case of approximate solutions is obtained. The Lagrange multipliers corresponding to the approximate solution are determined by solving an approximating quadratic programming problem.

SARA South Observations and Analysis of the Solar Type, Totally Eclipsing, Over Contact Binary, PY Aquarii

NASA Astrophysics Data System (ADS)

Chamberlain, Heather; Samec, Ronald G.; Caton, Daniel Bruce; Van Hamme, Walter

2018-01-01

PY Aqr (GSC 05191-00853) is a solar Type (T ~ 5750K) eclipsing binary. It was observed in July to October, 2017 at Cerro Tololo in remote mode with the 0.6-m SARA South reflector. Two times of minimum light were calculated from our present observations, a primary and a secondary eclipse:HJD Min I = 2457951.7762±0.0006 HJD Min II = 2458019.5295±00.0003. Both weighted as 1.0.In addition, four timings were determined from online data given in IBVS 5600 and five observations at minima were determined from archived All Sky Automated Survey Data:HJD Min I = 2452908.3165, 2452912.33612 HJD Min II = 2452877.5621, 2452913.34465. All weighted as 0.5.ASAS Observations at minima: 2452094.688, 2453478.882, 2453266.576, 2452093.685 and 54729.600. Each weighted as 0.10The following linear and quadratic ephemerides were determined from all available times of minimum light:JD Hel Min I=2452951.7443±0.0008d + 0.402093441±0.000000099 X E {1} JD Hel Min I=2452951.7439±0.0007d + 0.4020912±0.0000007 X E +0.00000000018 ± 0.00000000006 X E2 {2}A BVRI Bessell filtered simultaneous Wilson-Devinney Program (W-D) solution reveals that the system has a mass ratio of ~0.34 and a component temperature difference of only ~40 K. One low luminosity (Tfact ~ 0.94, ~66 degree radius) large cool region of spots was iterated on the primary component in the WD Synthetic Light Curve computations. It appears in the Southern Hemisphere (colatitude 155 degrees). The Roche Lobe fill-out of the binary is ~17%. The inclination is ~86 degrees. An eclipse duration of ~10 minutes was determined for the primary eclipse and the light curve solution. Additional and more detailed information is given in this report.

Lean and Efficient Software: Whole-Program Optimization of Executables

DTIC Science & Technology

2015-09-30

libraries. Many levels of library interfaces—where some libraries are dynamically linked and some are provided in binary form only—significantly limit...software at build time. The opportunity: Our objective in this project is to substantially improve the performance, size, and robustness of binary ...executables by using static and dynamic binary program analysis techniques to perform whole-program optimization directly on compiled programs

Improved Evolutionary Programming with Various Crossover Techniques for Optimal Power Flow Problem

NASA Astrophysics Data System (ADS)

Tangpatiphan, Kritsana; Yokoyama, Akihiko

This paper presents an Improved Evolutionary Programming (IEP) for solving the Optimal Power Flow (OPF) problem, which is considered as a non-linear, non-smooth, and multimodal optimization problem in power system operation. The total generator fuel cost is regarded as an objective function to be minimized. The proposed method is an Evolutionary Programming (EP)-based algorithm with making use of various crossover techniques, normally applied in Real Coded Genetic Algorithm (RCGA). The effectiveness of the proposed approach is investigated on the IEEE 30-bus system with three different types of fuel cost functions; namely the quadratic cost curve, the piecewise quadratic cost curve, and the quadratic cost curve superimposed by sine component. These three cost curves represent the generator fuel cost functions with a simplified model and more accurate models of a combined-cycle generating unit and a thermal unit with value-point loading effect respectively. The OPF solutions by the proposed method and Pure Evolutionary Programming (PEP) are observed and compared. The simulation results indicate that IEP requires less computing time than PEP with better solutions in some cases. Moreover, the influences of important IEP parameters on the OPF solution are described in details.

IFSM fractal image compression with entropy and sparsity constraints: A sequential quadratic programming approach

NASA Astrophysics Data System (ADS)

Kunze, Herb; La Torre, Davide; Lin, Jianyi

2017-01-01

We consider the inverse problem associated with IFSM: Given a target function f , find an IFSM, such that its fixed point f ¯ is sufficiently close to f in the Lp distance. Forte and Vrscay [1] showed how to reduce this problem to a quadratic optimization model. In this paper, we extend the collage-based method developed by Kunze, La Torre and Vrscay ([2][3][4]), by proposing the minimization of the 1-norm instead of the 0-norm. In fact, optimization problems involving the 0-norm are combinatorial in nature, and hence in general NP-hard. To overcome these difficulties, we introduce the 1-norm and propose a Sequential Quadratic Programming algorithm to solve the corresponding inverse problem. As in Kunze, La Torre and Vrscay [3] in our formulation, the minimization of collage error is treated as a multi-criteria problem that includes three different and conflicting criteria i.e., collage error, entropy and sparsity. This multi-criteria program is solved by means of a scalarization technique which reduces the model to a single-criterion program by combining all objective functions with different trade-off weights. The results of some numerical computations are presented.

An efficient inverse radiotherapy planning method for VMAT using quadratic programming optimization.

PubMed

Hoegele, W; Loeschel, R; Merkle, N; Zygmanski, P

2012-01-01

The purpose of this study is to investigate the feasibility of an inverse planning optimization approach for the Volumetric Modulated Arc Therapy (VMAT) based on quadratic programming and the projection method. The performance of this method is evaluated against a reference commercial planning system (eclipse(TM) for rapidarc(TM)) for clinically relevant cases. The inverse problem is posed in terms of a linear combination of basis functions representing arclet dose contributions and their respective linear coefficients as degrees of freedom. MLC motion is decomposed into basic motion patterns in an intuitive manner leading to a system of equations with a relatively small number of equations and unknowns. These equations are solved using quadratic programming under certain limiting physical conditions for the solution, such as the avoidance of negative dose during optimization and Monitor Unit reduction. The modeling by the projection method assures a unique treatment plan with beneficial properties, such as the explicit relation between organ weightings and the final dose distribution. Clinical cases studied include prostate and spine treatments. The optimized plans are evaluated by comparing isodose lines, DVH profiles for target and normal organs, and Monitor Units to those obtained by the clinical treatment planning system eclipse(TM). The resulting dose distributions for a prostate (with rectum and bladder as organs at risk), and for a spine case (with kidneys, liver, lung and heart as organs at risk) are presented. Overall, the results indicate that similar plan qualities for quadratic programming (QP) and rapidarc(TM) could be achieved at significantly more efficient computational and planning effort using QP. Additionally, results for the quasimodo phantom [Bohsung et al., "IMRT treatment planning: A comparative inter-system and inter-centre planning exercise of the estro quasimodo group," Radiother. Oncol. 76(3), 354-361 (2005)] are presented as an example for an extreme concave case. Quadratic programming is an alternative approach for inverse planning which generates clinically satisfying plans in comparison to the clinical system and constitutes an efficient optimization process characterized by uniqueness and reproducibility of the solution.

Minitrack tracking function description, volume 2

NASA Technical Reports Server (NTRS)

Englar, T. S.; Mango, S. A.; Roettcher, C. A.; Watters, D. L.

1973-01-01

The minitrack tracking function is described and specific operations are identified. The subjects discussed are: (1) preprocessor listing, (2) minitrack hardware, (3) system calibration, (4) quadratic listing, and (5) quadratic flow diagram. Detailed information is provided on the construction of the tracking system and its operation. The calibration procedures are supported by mathematical models to show the application of the computer programs.

A class of stochastic optimization problems with one quadratic & several linear objective functions and extended portfolio selection model

NASA Astrophysics Data System (ADS)

Xu, Jiuping; Li, Jun

2002-09-01

In this paper a class of stochastic multiple-objective programming problems with one quadratic, several linear objective functions and linear constraints has been introduced. The former model is transformed into a deterministic multiple-objective nonlinear programming model by means of the introduction of random variables' expectation. The reference direction approach is used to deal with linear objectives and results in a linear parametric optimization formula with a single linear objective function. This objective function is combined with the quadratic function using the weighted sums. The quadratic problem is transformed into a linear (parametric) complementary problem, the basic formula for the proposed approach. The sufficient and necessary conditions for (properly, weakly) efficient solutions and some construction characteristics of (weakly) efficient solution sets are obtained. An interactive algorithm is proposed based on reference direction and weighted sums. Varying the parameter vector on the right-hand side of the model, the DM can freely search the efficient frontier with the model. An extended portfolio selection model is formed when liquidity is considered as another objective to be optimized besides expectation and risk. The interactive approach is illustrated with a practical example.

Effect of stocking density on performance, diet selection, total-tract digestion, and nitrogen balance among heifers grazing cool-season annual forages.

PubMed

Brunsvig, B R; Smart, A J; Bailey, E A; Wright, C L; Grings, E E; Brake, D W

2017-08-01

Grazing annual cool-season forages after oat grain harvest in South Dakota may allow an opportunity to increase efficient use of tillable land. However, data are limited regarding effects of stocking density on diet selection, nutrient digestion, performance, and N retention by cattle grazing annual cool-season forage. Heifers were blocked by initial BW (261 ± 11.7 kg) and randomly assigned to 1 of 12 paddocks (1.1 ha) to graze a mixture of grass and brassica for 48 d. Each paddock contained 3, 4, or 5 heifers to achieve 4 replicates of each stocking density treatment. Ruminally cannulated heifers were used to measure diet and nutrient intake. Effects of stocking density on diet and nutrient selection were measured after 2, 24, and 46 d of grazing, and BW was measured at the beginning, middle, and end of the experiment as the average of d 1 and 2, d 22 and 23, and d 47 and 48 BW, respectively. Measures of DMI and DM, OM, NDF, and ADF digestion were collected from d 18 to 23. Increased stocking density increased intake of brassica relative to grass on d 24 (quadratic, = 0.02), but increased stocking density decreased (linear, ≤ 0.01) intake of brassica compared with grass on d 48 (stocking density × time, < 0.01). Increased stocking density increased DM (quadratic, < 0.01), OM (quadratic, = 0.01), and NDF (quadratic, = 0.05) digestion, and stocking density tended to increase DMI (quadratic, = 0.07). Additionally, increased stocking density quadratically increased ( = 0.05) N retention but did not affect overall BW gains. Increased stocking density did, however, contribute to linearly decreased ( = 0.05) BW gains from d 1 to 22 of grazing, but BW gains during the latter half of the experiment were greater than BW gains from d 1 to 22. Ruminal concentration of acetate:propionate was least on d 24 of grazing, and ruminal nitrate concentration tended to linearly decrease ( = 0.06) with greater amounts of time on pasture. Ruminal liquid and particulate fill and amounts of VFA were less (quadratic, ≤ 0.01) with greater amounts of time on pasture. Apparently, binary mixtures of brassica and grass planted after oat grain harvest can provide an opportunity to increase efficient use of land by providing forage resources. Increased stocking density may facilitate a more rapid adaptation to and intake of brassica among cattle grazing brassica-grass-based pastures.

Sensitivity Analysis of Linear Programming and Quadratic Programming Algorithms for Control Allocation

NASA Technical Reports Server (NTRS)

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.

Adaptable Binary Programs

DTIC Science & Technology

1994-04-01

a variation of Ziv - Lempel compression [ZL77]. We found that using a standard compression algorithm rather than semantic compression allowed simplified...mentation. In Proceedings of the Conference on Programming Language Design and Implementation, 1993. (ZL77] J. Ziv and A. Lempel . A universal algorithm ...required by adaptable binaries. Our ABS stores adaptable binary information using the conventional binary symbol table and compresses this data using

The generalized quadratic knapsack problem. A neuronal network approach.

PubMed

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.

Sequential Quadratic Programming Algorithms for Optimization

DTIC Science & Technology

1989-08-01

quadratic program- ma ng (SQ(2l ) aIiatain.seenis to be relgarded aIs tie( buest choice for the solution of smiall. dlense problema (see S tour L)toS...For the step along d, note that a < nOing + 3 szH + i3.ninA A a K f~Iz,;nd and from Id1 _< ,,, we must have that for some /3 , np , 11P11 < dn"p. 5.2...Nevertheless, many of these problems are considered hard to solve. Moreover, for some of these problems the assumptions made in Chapter 2 to establish the

The magnetic field and the evolution of element spots on the surface of the HgMn eclipsing binary ARAur

NASA Astrophysics Data System (ADS)

Hubrig, S.; Savanov, I.; Ilyin, I.; González, J. F.; Korhonen, H.; Lehmann, H.; Schöller, M.; Granzer, T.; Weber, M.; Strassmeier, K. G.; Hartmann, M.; Tkachenko, A.

2010-10-01

The system ARAur is a young late B-type double-lined eclipsing binary with a primary star of HgMn peculiarity. We applied the Doppler imaging method to reconstruct the distribution of Fe and Y over the surface of the primary using spectroscopic time series obtained in 2005 and from 2008 October to 2009 February. The results show a remarkable evolution of the element distribution and overabundances. Measurements of the magnetic field with the moment technique using several elements reveal the presence of a longitudinal magnetic field of the order of a few hundred gauss in both stellar components and a quadratic field of the order of 8kG on the surface of the primary star. Based on observations obtained at the 2.56-m Nordic Optical Telescope on La Palma, the Karl-Schwarzschild-Observatorium in Tautenburg and the STELLA robotic telescope on Tenerife. E-mail: shubrig@aip.de

The application of nonlinear programming and collocation to optimal aeroassisted orbital transfers

NASA Astrophysics Data System (ADS)

Shi, Y. Y.; Nelson, R. L.; Young, D. H.; Gill, P. E.; Murray, W.; Saunders, M. A.

1992-01-01

Sequential quadratic programming (SQP) and collocation of the differential equations of motion were applied to optimal aeroassisted orbital transfers. The Optimal Trajectory by Implicit Simulation (OTIS) computer program codes with updated nonlinear programming code (NZSOL) were used as a testbed for the SQP nonlinear programming (NLP) algorithms. The state-of-the-art sparse SQP method is considered to be effective for solving large problems with a sparse matrix. Sparse optimizers are characterized in terms of memory requirements and computational efficiency. For the OTIS problems, less than 10 percent of the Jacobian matrix elements are nonzero. The SQP method encompasses two phases: finding an initial feasible point by minimizing the sum of infeasibilities and minimizing the quadratic objective function within the feasible region. The orbital transfer problem under consideration involves the transfer from a high energy orbit to a low energy orbit.

Theoretical extension and experimental demonstration of spectral compression in second-harmonic generation by Fresnel-inspired binary phase shaping

NASA Astrophysics Data System (ADS)

Li, Baihong; Dong, Ruifang; Zhou, Conghua; Xiang, Xiao; Li, Yongfang; Zhang, Shougang

2018-05-01

Selective two-photon microscopy and high-precision nonlinear spectroscopy rely on efficient spectral compression at the desired frequency. Previously, a Fresnel-inspired binary phase shaping (FIBPS) method was theoretically proposed for spectral compression of two-photon absorption and second-harmonic generation (SHG) with a square-chirped pulse. Here, we theoretically show that the FIBPS can introduce a negative quadratic frequency phase (negative chirp) by analogy with the spatial-domain phase function of Fresnel zone plate. Thus, the previous theoretical model can be extended to the case where the pulse can be transformed limited and in any symmetrical spectral shape. As an example, we experimentally demonstrate spectral compression in SHG by FIBPS for a Gaussian transform-limited pulse and show good agreement with the theory. Given the fundamental pulse bandwidth, a narrower SHG bandwidth with relatively high intensity can be obtained by simply increasing the number of binary phases. The experimental results also verify that our method is superior to that proposed in [Phys. Rev. A 46, 2749 (1992), 10.1103/PhysRevA.46.2749]. This method will significantly facilitate the applications of selective two-photon microscopy and spectroscopy. Moreover, as it can introduce negative dispersion, hence it can also be generalized to other applications in the field of dispersion compensation.

Tuning of electronic band gaps and optoelectronic properties of binary strontium chalcogenides by means of doping of magnesium atom(s)- a first principles based theoretical initiative with mBJ, B3LYP and WC-GGA functionals

NASA Astrophysics Data System (ADS)

Debnath, Bimal; Sarkar, Utpal; Debbarma, Manish; Bhattacharjee, Rahul; Chattopadhyaya, Surya

2018-02-01

First principle based theoretical initiative is taken to tune the optoelectronic properties of binary strontium chalcogenide semiconductors by doping magnesium atom(s) into their rock-salt unit cells at specific concentrations x = 0.0, 0.25, 0.50, 0.75 and 1.0 and such tuning is established by studying structural, electronic and optical properties of designed binary compounds and ternary alloys employing WC-GGA, B3LYP and mBJ exchange-correlation functionals. Band structure of each compound is constructed and respective band gaps under all the potential schemes are measured. The band gap bowing and its microscopic origin are calculated using quadratic fit and Zunger's approach, respectively. The atomic and orbital origins of electronic states in the band structure of any compound are explored from its density of states. The nature of chemical bonds between the constituent atoms in each compound is explored from the valence electron density contour plots. Optical properties of any specimen are explored from the computed spectra of its dielectric function, refractive index, extinction coefficient, normal incidence reflectivity, optical conductivity optical absorption and energy loss function. Several calculated results are compared with available experimental and earlier theoretical data.

Developing an Understanding of Quadratics through the Use of Concrete Manipulatives: A Case Study Analysis of the Metacognitive Development of a High School Student with Learning Disabilities

ERIC Educational Resources Information Center

Strickland, Tricia K.

2014-01-01

This case study analyzed the impact of a concrete manipulative program on the understanding of quadratic expressions for a high school student with a learning disability. The manipulatives were utilized as part of the Concrete-Representational-Abstract Integration (CRA-I) intervention in which participants engaged in tasks requiring them to…

High-order Newton-penalty algorithms

NASA Astrophysics Data System (ADS)

Dussault, Jean-Pierre

2005-10-01

Recent efforts in differentiable non-linear programming have been focused on interior point methods, akin to penalty and barrier algorithms. In this paper, we address the classical equality constrained program solved using the simple quadratic loss penalty function/algorithm. The suggestion to use extrapolations to track the differentiable trajectory associated with penalized subproblems goes back to the classic monograph of Fiacco & McCormick. This idea was further developed by Gould who obtained a two-steps quadratically convergent algorithm using prediction steps and Newton correction. Dussault interpreted the prediction step as a combined extrapolation with respect to the penalty parameter and the residual of the first order optimality conditions. Extrapolation with respect to the residual coincides with a Newton step.We explore here higher-order extrapolations, thus higher-order Newton-like methods. We first consider high-order variants of the Newton-Raphson method applied to non-linear systems of equations. Next, we obtain improved asymptotic convergence results for the quadratic loss penalty algorithm by using high-order extrapolation steps.

CAD of control systems: Application of nonlinear programming to a linear quadratic formulation

NASA Technical Reports Server (NTRS)

Fleming, P.

1983-01-01

The familiar suboptimal regulator design approach is recast as a constrained optimization problem and incorporated in a Computer Aided Design (CAD) package where both design objective and constraints are quadratic cost functions. This formulation permits the separate consideration of, for example, model following errors, sensitivity measures and control energy as objectives to be minimized or limits to be observed. Efficient techniques for computing the interrelated cost functions and their gradients are utilized in conjunction with a nonlinear programming algorithm. The effectiveness of the approach and the degree of insight into the problem which it affords is illustrated in a helicopter regulation design example.

Path Following in the Exact Penalty Method of Convex Programming.

PubMed

Zhou, Hua; Lange, Kenneth

2015-07-01

Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. In practice, the kinks in the penalty and the unknown magnitude of the penalty constant prevent wide application of the exact penalty method in nonlinear programming. In this article, we examine a strategy of path following consistent with the exact penalty method. Instead of performing optimization at a single penalty constant, we trace the solution as a continuous function of the penalty constant. Thus, path following starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. For quadratic programming, the solution path is piecewise linear and takes large jumps from constraint to constraint. For a general convex program, the solution path is piecewise smooth, and path following operates by numerically solving an ordinary differential equation segment by segment. Our diverse applications to a) projection onto a convex set, b) nonnegative least squares, c) quadratically constrained quadratic programming, d) geometric programming, and e) semidefinite programming illustrate the mechanics and potential of path following. The final detour to image denoising demonstrates the relevance of path following to regularized estimation in inverse problems. In regularized estimation, one follows the solution path as the penalty constant decreases from a large value.

Path Following in the Exact Penalty Method of Convex Programming

PubMed Central

Zhou, Hua; Lange, Kenneth

2015-01-01

Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. In practice, the kinks in the penalty and the unknown magnitude of the penalty constant prevent wide application of the exact penalty method in nonlinear programming. In this article, we examine a strategy of path following consistent with the exact penalty method. Instead of performing optimization at a single penalty constant, we trace the solution as a continuous function of the penalty constant. Thus, path following starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. For quadratic programming, the solution path is piecewise linear and takes large jumps from constraint to constraint. For a general convex program, the solution path is piecewise smooth, and path following operates by numerically solving an ordinary differential equation segment by segment. Our diverse applications to a) projection onto a convex set, b) nonnegative least squares, c) quadratically constrained quadratic programming, d) geometric programming, and e) semidefinite programming illustrate the mechanics and potential of path following. The final detour to image denoising demonstrates the relevance of path following to regularized estimation in inverse problems. In regularized estimation, one follows the solution path as the penalty constant decreases from a large value. PMID:26366044

Application’s Method of Quadratic Programming for Optimization of Portfolio Selection

NASA Astrophysics Data System (ADS)

Kawamoto, Shigeru; Takamoto, Masanori; Kobayashi, Yasuhiro

Investors or fund-managers face with optimization of portfolio selection, which means that determine the kind and the quantity of investment among several brands. We have developed a method to obtain optimal stock’s portfolio more rapidly from twice to three times than conventional method with efficient universal optimization. The method is characterized by quadratic matrix of utility function and constrained matrices divided into several sub-matrices by focusing on structure of these matrices.

Constrained multiple indicator kriging using sequential quadratic programming

NASA Astrophysics Data System (ADS)

Soltani-Mohammadi, Saeed; Erhan Tercan, A.

2012-11-01

Multiple indicator kriging (MIK) is a nonparametric method used to estimate conditional cumulative distribution functions (CCDF). Indicator estimates produced by MIK may not satisfy the order relations of a valid CCDF which is ordered and bounded between 0 and 1. In this paper a new method has been presented that guarantees the order relations of the cumulative distribution functions estimated by multiple indicator kriging. The method is based on minimizing the sum of kriging variances for each cutoff under unbiasedness and order relations constraints and solving constrained indicator kriging system by sequential quadratic programming. A computer code is written in the Matlab environment to implement the developed algorithm and the method is applied to the thickness data.

Application of the sequential quadratic programming algorithm for reconstructing the distribution of optical parameters based on the time-domain radiative transfer equation.

PubMed

Qi, Hong; Qiao, Yao-Bin; Ren, Ya-Tao; Shi, Jing-Wen; Zhang, Ze-Yu; Ruan, Li-Ming

2016-10-17

Sequential quadratic programming (SQP) is used as an optimization algorithm to reconstruct the optical parameters based on the time-domain radiative transfer equation (TD-RTE). Numerous time-resolved measurement signals are obtained using the TD-RTE as forward model. For a high computational efficiency, the gradient of objective function is calculated using an adjoint equation technique. SQP algorithm is employed to solve the inverse problem and the regularization term based on the generalized Gaussian Markov random field (GGMRF) model is used to overcome the ill-posed problem. Simulated results show that the proposed reconstruction scheme performs efficiently and accurately.

Neural network for solving convex quadratic bilevel programming problems.

PubMed

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. Copyright © 2013 Elsevier Ltd. All rights reserved.

A sequential quadratic programming algorithm using an incomplete solution of the subproblem

DOE Office of Scientific and Technical Information (OSTI.GOV)

Murray, W.; Prieto, F.J.

1993-05-01

We analyze sequential quadratic programming (SQP) methods to solve nonlinear constrained optimization problems that are more flexible in their definition than standard SQP methods. The type of flexibility introduced is motivated by the necessity to deviate from the standard approach when solving large problems. Specifically we no longer require a minimizer of the QP subproblem to be determined or particular Lagrange multiplier estimates to be used. Our main focus is on an SQP algorithm that uses a particular augmented Lagrangian merit function. New results are derived for this algorithm under weaker conditions than previously assumed; in particular, it is notmore » assumed that the iterates lie on a compact set.« less

DE and NLP Based QPLS Algorithm

NASA Astrophysics Data System (ADS)

Yu, Xiaodong; Huang, Dexian; Wang, Xiong; Liu, Bo

As a novel evolutionary computing technique, Differential Evolution (DE) has been considered to be an effective optimization method for complex optimization problems, and achieved many successful applications in engineering. In this paper, a new algorithm of Quadratic Partial Least Squares (QPLS) based on Nonlinear Programming (NLP) is presented. And DE is used to solve the NLP so as to calculate the optimal input weights and the parameters of inner relationship. The simulation results based on the soft measurement of diesel oil solidifying point on a real crude distillation unit demonstrate that the superiority of the proposed algorithm to linear PLS and QPLS which is based on Sequential Quadratic Programming (SQP) in terms of fitting accuracy and computational costs.

Estimation bias from using nonlinear Fourier plane correlators for sub-pixel image shift measurement and implications for the binary joint transform correlator

NASA Astrophysics Data System (ADS)

Grycewicz, Thomas J.; Florio, Christopher J.; Franz, Geoffrey A.; Robinson, Ross E.

2007-09-01

When using Fourier plane digital algorithms or an optical correlator to measure the correlation between digital images, interpolation by center-of-mass or quadratic estimation techniques can be used to estimate image displacement to the sub-pixel level. However, this can lead to a bias in the correlation measurement. This bias shifts the sub-pixel output measurement to be closer to the nearest pixel center than the actual location. The paper investigates the bias in the outputs of both digital and optical correlators, and proposes methods to minimize this effect. We use digital studies and optical implementations of the joint transform correlator to demonstrate optical registration with accuracies better than 0.1 pixels. We use both simulations of image shift and movies of a moving target as inputs. We demonstrate bias error for both center-of-mass and quadratic interpolation, and discuss the reasons that this bias is present. Finally, we suggest measures to reduce or eliminate the bias effects. We show that when sub-pixel bias is present, it can be eliminated by modifying the interpolation method. By removing the bias error, we improve registration accuracy by thirty percent.

Patterns formation in ferrofluids and solid dissolutions using stochastic models with dissipative dynamics

NASA Astrophysics Data System (ADS)

Morales, Marco A.; Fernández-Cervantes, Irving; Agustín-Serrano, Ricardo; Anzo, Andrés; Sampedro, Mercedes P.

2016-08-01

A functional with interactions short-range and long-range low coarse-grained approximation is proposed. This functional satisfies models with dissipative dynamics A, B and the stochastic Swift-Hohenberg equation. Furthermore, terms associated with multiplicative noise source are added in these models. These models are solved numerically using the method known as fast Fourier transform. Results of the spatio-temporal dynamic show similarity with respect to patterns behaviour in ferrofluids phases subject to external fields (magnetic, electric and temperature), as well as with the nucleation and growth phenomena present in some solid dissolutions. As a result of the multiplicative noise effect over the dynamic, some microstructures formed by changing solid phase and composed by binary alloys of Pb-Sn, Fe-C and Cu-Ni, as well as a NiAl-Cr(Mo) eutectic composite material. The model A for active-particles with a non-potential term in form of quadratic gradient explain the formation of nanostructured particles of silver phosphate. With these models is shown that the underlying mechanisms in the patterns formation in all these systems depends of: (a) dissipative dynamics; (b) the short-range and long-range interactions and (c) the appropiate combination of quadratic and multiplicative noise terms.

Multi-period equilibrium/near-equilibrium in electricity markets based on locational marginal prices

NASA Astrophysics Data System (ADS)

Garcia Bertrand, Raquel

In this dissertation we propose an equilibrium procedure that coordinates the point of view of every market agent resulting in an equilibrium that simultaneously maximizes the independent objective of every market agent and satisfies network constraints. Therefore, the activities of the generating companies, consumers and an independent system operator are modeled: (1) The generating companies seek to maximize profits by specifying hourly step functions of productions and minimum selling prices, and bounds on productions. (2) The goals of the consumers are to maximize their economic utilities by specifying hourly step functions of demands and maximum buying prices, and bounds on demands. (3) The independent system operator then clears the market taking into account consistency conditions as well as capacity and line losses so as to achieve maximum social welfare. Then, we approach this equilibrium problem using complementarity theory in order to have the capability of imposing constraints on dual variables, i.e., on prices, such as minimum profit conditions for the generating units or maximum cost conditions for the consumers. In this way, given the form of the individual optimization problems, the Karush-Kuhn-Tucker conditions for the generating companies, the consumers and the independent system operator are both necessary and sufficient. The simultaneous solution to all these conditions constitutes a mixed linear complementarity problem. We include minimum profit constraints imposed by the units in the market equilibrium model. These constraints are added as additional constraints to the equivalent quadratic programming problem of the mixed linear complementarity problem previously described. For the sake of clarity, the proposed equilibrium or near-equilibrium is first developed for the particular case considering only one time period. Afterwards, we consider an equilibrium or near-equilibrium applied to a multi-period framework. This model embodies binary decisions, i.e., on/off status for the units, and therefore optimality conditions cannot be directly applied. To avoid limitations provoked by binary variables, while retaining the advantages of using optimality conditions, we define the multi-period market equilibrium using Benders decomposition, which allows computing binary variables through the master problem and continuous variables through the subproblem. Finally, we illustrate these market equilibrium concepts through several case studies.

Taylor O(h³) Discretization of ZNN Models for Dynamic Equality-Constrained Quadratic Programming With Application to Manipulators.

PubMed

Liao, Bolin; Zhang, Yunong; Jin, Long

2016-02-01

In this paper, a new Taylor-type numerical differentiation formula is first presented to discretize the continuous-time Zhang neural network (ZNN), and obtain higher computational accuracy. Based on the Taylor-type formula, two Taylor-type discrete-time ZNN models (termed Taylor-type discrete-time ZNNK and Taylor-type discrete-time ZNNU models) are then proposed and discussed to perform online dynamic equality-constrained quadratic programming. For comparison, Euler-type discrete-time ZNN models (called Euler-type discrete-time ZNNK and Euler-type discrete-time ZNNU models) and Newton iteration, with interesting links being found, are also presented. It is proved herein that the steady-state residual errors of the proposed Taylor-type discrete-time ZNN models, Euler-type discrete-time ZNN models, and Newton iteration have the patterns of O(h(3)), O(h(2)), and O(h), respectively, with h denoting the sampling gap. Numerical experiments, including the application examples, are carried out, of which the results further substantiate the theoretical findings and the efficacy of Taylor-type discrete-time ZNN models. Finally, the comparisons with Taylor-type discrete-time derivative model and other Lagrange-type discrete-time ZNN models for dynamic equality-constrained quadratic programming substantiate the superiority of the proposed Taylor-type discrete-time ZNN models once again.

Frequency dispersion of longitudinal ultrasonic velocity and attenuation in [001]c-poled 0.24Pb(In₁/₂Nb₁/₂O₃- 0.45Pb(Mg₁/₃Nb₂/₃)O₃-0.31PbTiO₃ single crystal.

PubMed

Sun, Enwei; Cao, Wenwu; Han, Pengdi

2011-08-01

The frequency dispersion of ultrasonic velocity and attenuation in [001](c)-poled 0.24Pb(in(1/2)Nb(1/2))O(3)-0.45Pb(Mg(1/3)Nb(2/3))o(3)-0.31PbTio(3) (PIN-0.45PMN-0.31PT) ternary single crystal were measured by ultrasonic spectroscopy from 25 to 100 MHz for the longitudinal wave. It was found that the velocity has a linear relationship with the frequency f, but the attenuation has a quadratic relation with f. The attenuation and frequency dispersion of the ternary system are lower than that of the (1-x)Pb(Mg(1/3)Nb(2/3))O(3)-xPbTiO(3) (PMN-PT) binary system and the coercive field also increased by a factor of 2.5, hence, the ternary single system is superior to the corresponding binary single-crystal system for high-frequency and high-power transducer applications.

X-ray binaries

NASA Technical Reports Server (NTRS)

1976-01-01

Satellite X-ray experiments and ground-based programs aimed at observation of X-ray binaries are discussed. Experiments aboard OAO-3, OSO-8, Ariel 5, Uhuru, and Skylab are included along with rocket and ground-based observations. Major topics covered are: Her X-1, Cyg X-3, Cen X-3, Cyg X-1, the transient source A0620-00, other possible X-ray binaries, and plans and prospects for future observational programs.

Secular dynamics of multiplanetary circumbinary systems: stationary solutions and binary-planet secular resonance

NASA Astrophysics Data System (ADS)

Andrade-Ines, Eduardo; Robutel, Philippe

2018-01-01

We present an analytical formalism to study the secular dynamics of a system consisting of N-2 planets orbiting a binary star in outer orbits. We introduce a canonical coordinate system and expand the disturbing function in terms of canonical elliptic elements, combining both Legendre polynomials and Laplace coefficients, to obtain a general formalism for the secular description of this type of configuration. With a quadratic approximation of the development, we present a simplified analytical solution for the planetary orbits for both the single planet and the two-planet cases. From the two-planet model, we show that the inner planet accelerates the precession rate of the binary pericenter, which, in turn, may enter in resonance with the secular frequency of the outer planet, characterizing a secular resonance. We calculate an analytical expression for the approximate location of this resonance and apply it to known circumbinary systems, where we show that it can occur at relatively close orbits, for example at 2.4 au for the Kepler-38 system. With a more refined model, we analyse the dynamics of this secular resonance and we show that a bifurcation of the corresponding fixed points can affect the long- term evolution and stability of planetary systems. By comparing our results with complete integrations of the exact equations of motion, we verified the accuracy of our analytical model.

Factorization method of quadratic template

NASA Astrophysics Data System (ADS)

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.

A MAP read-routine for IBM 7094 Fortran II binary tapes

Treesearch

Robert S. Helfman

1966-01-01

Two MAP (Macro Assembly Program) language routines are descrived. They permit Fortran IV programs to read binary tapes generated by Fortran II programs, on the IBM 7090 and 7094 computers. One routine is for use with 7040/44-IBSYS, the other for 7090/94-IBSYS.

An O(log sup 2 N) parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix

NASA Technical Reports Server (NTRS)

Swarztrauber, Paul N.

1989-01-01

An O(log sup 2 N) parallel algorithm is presented for computing the eigenvalues of a symmetric tridiagonal matrix using a parallel algorithm for computing the zeros of the characteristic polynomial. The method is based on a quadratic recurrence in which the characteristic polynomial is constructed on a binary tree from polynomials whose degree doubles at each level. Intervals that contain exactly one zero are determined by the zeros of polynomials at the previous level which ensures that different processors compute different zeros. The exact behavior of the polynomials at the interval endpoints is used to eliminate the usual problems induced by finite precision arithmetic.

Design and cost analysis of rapid aquifer restoration systems using flow simulation and quadratic programming.

USGS Publications Warehouse

Lefkoff, L.J.; Gorelick, S.M.

1986-01-01

Detailed two-dimensional flow simulation of a complex ground-water system is combined with quadratic and linear programming to evaluate design alternatives for rapid aquifer restoration. Results show how treatment and pumping costs depend dynamically on the type of treatment process, and capacity of pumping and injection wells, and the number of wells. The design for an inexpensive treatment process minimizes pumping costs, while an expensive process results in the minimization of treatment costs. Substantial reductions in pumping costs occur with increases in injection capacity or in the number of wells. Treatment costs are reduced by expansions in pumping capacity or injecion capacity. The analysis identifies maximum pumping and injection capacities.-from Authors

DOE Office of Scientific and Technical Information (OSTI.GOV)

Huang, Kuo -Ling; Mehrotra, Sanjay

We present a homogeneous algorithm equipped with a modified potential function for the monotone complementarity problem. We show that this potential function is reduced by at least a constant amount if a scaled Lipschitz condition (SLC) is satisfied. A practical algorithm based on this potential function is implemented in a software package named iOptimize. The implementation in iOptimize maintains global linear and polynomial time convergence properties, while achieving practical performance. It either successfully solves the problem, or concludes that the SLC is not satisfied. When compared with the mature software package MOSEK (barrier solver version 6.0.0.106), iOptimize solves convex quadraticmore » programming problems, convex quadratically constrained quadratic programming problems, and general convex programming problems in fewer iterations. Moreover, several problems for which MOSEK fails are solved to optimality. In addition, we also find that iOptimize detects infeasibility more reliably than the general nonlinear solvers Ipopt (version 3.9.2) and Knitro (version 8.0).« less

Replicator equations, maximal cliques, and graph isomorphism.

PubMed

Pelillo, M

1999-11-15

We present a new energy-minimization framework for the graph isomorphism problem that is based on an equivalent maximum clique formulation. The approach is centered around a fundamental result proved by Motzkin and Straus in the mid-1960s, and recently expanded in various ways, which allows us to formulate the maximum clique problem in terms of a standard quadratic program. The attractive feature of this formulation is that a clear one-to-one correspondence exists between the solutions of the quadratic program and those in the original, combinatorial problem. To solve the program we use the so-called replicator equations--a class of straightforward continuous- and discrete-time dynamical systems developed in various branches of theoretical biology. We show how, despite their inherent inability to escape from local solutions, they nevertheless provide experimental results that are competitive with those obtained using more elaborate mean-field annealing heuristics.

Sequential quadratic programming-based fast path planning algorithm subject to no-fly zone constraints

NASA Astrophysics Data System (ADS)

Liu, Wei; Ma, Shunjian; Sun, Mingwei; Yi, Haidong; Wang, Zenghui; Chen, Zengqiang

2016-08-01

Path planning plays an important role in aircraft guided systems. Multiple no-fly zones in the flight area make path planning a constrained nonlinear optimization problem. It is necessary to obtain a feasible optimal solution in real time. In this article, the flight path is specified to be composed of alternate line segments and circular arcs, in order to reformulate the problem into a static optimization one in terms of the waypoints. For the commonly used circular and polygonal no-fly zones, geometric conditions are established to determine whether or not the path intersects with them, and these can be readily programmed. Then, the original problem is transformed into a form that can be solved by the sequential quadratic programming method. The solution can be obtained quickly using the Sparse Nonlinear OPTimizer (SNOPT) package. Mathematical simulations are used to verify the effectiveness and rapidity of the proposed algorithm.

Annual Review of Research Under the Joint Service Electronics Program.

DTIC Science & Technology

1979-10-01

Contents: Quadratic Optimization Problems; Nonlinear Control; Nonlinear Fault Analysis; Qualitative Analysis of Large Scale Systems; Multidimensional System Theory ; Optical Noise; and Pattern Recognition.

Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method

DOE PAGES

Huang, Kuo -Ling; Mehrotra, Sanjay

2016-11-08

We present a homogeneous algorithm equipped with a modified potential function for the monotone complementarity problem. We show that this potential function is reduced by at least a constant amount if a scaled Lipschitz condition (SLC) is satisfied. A practical algorithm based on this potential function is implemented in a software package named iOptimize. The implementation in iOptimize maintains global linear and polynomial time convergence properties, while achieving practical performance. It either successfully solves the problem, or concludes that the SLC is not satisfied. When compared with the mature software package MOSEK (barrier solver version 6.0.0.106), iOptimize solves convex quadraticmore » programming problems, convex quadratically constrained quadratic programming problems, and general convex programming problems in fewer iterations. Moreover, several problems for which MOSEK fails are solved to optimality. In addition, we also find that iOptimize detects infeasibility more reliably than the general nonlinear solvers Ipopt (version 3.9.2) and Knitro (version 8.0).« less

Probabilistic dual heuristic programming-based adaptive critic

NASA Astrophysics Data System (ADS)

Herzallah, Randa

2010-02-01

Adaptive critic (AC) methods have common roots as generalisations of dynamic programming for neural reinforcement learning approaches. Since they approximate the dynamic programming solutions, they are potentially suitable for learning in noisy, non-linear and non-stationary environments. In this study, a novel probabilistic dual heuristic programming (DHP)-based AC controller is proposed. Distinct to current approaches, the proposed probabilistic (DHP) AC method takes uncertainties of forward model and inverse controller into consideration. Therefore, it is suitable for deterministic and stochastic control problems characterised by functional uncertainty. Theoretical development of the proposed method is validated by analytically evaluating the correct value of the cost function which satisfies the Bellman equation in a linear quadratic control problem. The target value of the probabilistic critic network is then calculated and shown to be equal to the analytically derived correct value. Full derivation of the Riccati solution for this non-standard stochastic linear quadratic control problem is also provided. Moreover, the performance of the proposed probabilistic controller is demonstrated on linear and non-linear control examples.

An iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach

NASA Astrophysics Data System (ADS)

Kassa, Semu Mitiku; Tsegay, Teklay Hailay

2017-08-01

Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of problems. In this paper, we investigate a tri-level programming problem with quadratic fractional objective functions at each of the three levels. A solution algorithm has been proposed by applying fuzzy goal programming approach and by reformulating the fractional constraints to equivalent but non-fractional non-linear constraints. Based on the transformed formulation, an iterative procedure is developed that can yield a satisfactory solution to the tri-level problem. The numerical results on various illustrative examples demonstrated that the proposed algorithm is very much promising and it can also be used to solve larger-sized as well as n-level problems of similar structure.

Higher-order fluctuation-dissipation relations in plasma physics: Binary Coulomb systems

NASA Astrophysics Data System (ADS)

Golden, Kenneth I.

2018-05-01

A recent approach that led to compact frequency domain formulations of the cubic and quartic fluctuation-dissipation theorems (FDTs) for the classical one-component plasma (OCP) [Golden and Heath, J. Stat. Phys. 162, 199 (2016), 10.1007/s10955-015-1395-6] is generalized to accommodate binary ionic mixtures. Paralleling the procedure followed for the OCP, the basic premise underlying the present approach is that a (k ,ω ) 4-vector rotational symmetry, known to be a pivotal feature in the frequency domain architectures of the linear and quadratic fluctuation-dissipation relations for a variety of Coulomb plasmas [Golden et al., J. Stat. Phys. 6, 87 (1972), 10.1007/BF01023681; J. Stat. Phys. 29, 281 (1982), 10.1007/BF01020787; Golden, Phys. Rev. E 59, 228 (1999), 10.1103/PhysRevE.59.228], is expected to be a pivotal feature of the frequency domain architectures of the higher-order members of the FDT hierarchy. On this premise, each member, in its most tractable form, connects a single (p +1 )-point dynamical structure function to a linear combination of (p +1 )-order p density response functions; by definition, such a combination must also remain invariant under rotation of their (k1,ω1) ,(k2,ω2) ,...,(kp,ωp) , (k1+k2+⋯+kp,ω1+ω2+⋯+ωp) 4-vector arguments. Assigned to each 4-vector is a species index that corotates in lock step. Consistency is assured by matching the static limits of the resulting frequency domain cubic and quartic FDTs to their exact static counterparts independently derived in the present work via a conventional time-independent perturbation expansion of the Liouville distribution function in its macrocanonical form. The proposed procedure entirely circumvents the daunting issues of entangled Liouville space paths and nested Poisson brackets that one would encounter if one attempted to use the conventional time-dependent perturbation-theoretic Kubo approach to establish the frequency domain FDTs beyond quadratic order.

BVRI Photometric Study of the Short Period, Solar Type, Semi-Detached Binary, NSVS 10083189

NASA Astrophysics Data System (ADS)

Samec, Ronald G.; Caton, Daniel B.; Olsen, Amber; Faulkner, Danny R.; Hill, Robert L.

2017-06-01

Precision BVRcIc light curves of NSVS 5066754 were taken on 11 nights in February through April 2015 at Dark Sky Observatory in North Carolina with the 0.81-m reflector of Appalachian State University and on 1 night on the SARA 1-m reflector at Kitt Peak National Observatory in remote mode. It is an ~ F8V eclipsing binary with a period of 0.4542238 (2) d.Seven times of minimum light were calculated, for 5 primary and 2 secondary eclipses from our present observations:HJD I = 2457067.75453±0.0003, 2457088.64907±0.0001, 2457089.55708±0.0001, 2457098.64163±0.0004, 24557113.63117±0.0002HJD II = 2457066.61874±0.0008, 2457067.52329±0.0017.In addition, seven observations at minima were introduced as low weighted times of minimum light taken from archived NSVS Data.The following decreasing quadratic ephemeris was determined from all available times of minimum light in this study covering some 15 years:JD Hel MinI = 2457089.55665±0.00054d + 0.4542179±0. 0000006 X E -0.00000000049±0.00000000005 × E2We note that this result has a strong level of confidence. This again gives evidence that the components are coming into contact possibly due to magnetic braking as indicated by dark spot activity on the binary.We initially modeled the B,V,R,I curves simultaneously with the Wilson-Devinney program in a shallow contact configuration (mode 3) as indicated by our Binary Maker 3 fits. This led to a near but non-contact configuration. Next, the general Mode 2 was used to give clues regarding the configuration. During this investigation, the primary component came into contact while the secondary star remained detached. Next, a solution was determined in a semidetached, mode 4 state (larger component filling its critical lobe and the secondary under filing. This may indicate that NSVS 10083189 is coming into contact for the first time. The mode and the period change corroborate.Our semi-detached, near contact solution, gave a mass ratio of 0.58, with component temperatures of 6250 and 4573 K. A 15° radius cool spot with a t-factor of 0.85 was determined on the primary star. The fill-out of the secondary star was 99%. Further details will be given in our poster paper.

Algorithm XXX : functions to support the IEEE standard for binary floating-point arithmetic.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cody, W. J.; Mathematics and Computer Science

1993-12-01

This paper describes C programs for the support functions copysign(x,y), logb(x), scalb(x,n), nextafter(x,y), finite(x), and isnan(x) recommended in the Appendix to the IEEE Standard for Binary Floating-Point Arithmetic. In the case of logb, the modified definition given in the later IEEE Standard for Radix-Independent Floating-Point Arithmetic is followed. These programs should run without modification on most systems conforming to the binary standard.

The design of a turboshaft speed governor using modern control techniques

NASA Technical Reports Server (NTRS)

Delosreyes, G.; Gouchoe, D. R.

1986-01-01

The objectives of this program were: to verify the model of off schedule compressor variable geometry in the T700 turboshaft engine nonlinear model; to evaluate the use of the pseudo-random binary noise (PRBN) technique for obtaining engine frequency response data; and to design a high performance power turbine speed governor using modern control methods. Reduction of T700 engine test data generated at NASA-Lewis indicated that the off schedule variable geometry effects were accurate as modeled. Analysis also showed that the PRBN technique combined with the maximum likelihood model identification method produced a Bode frequency response that was as accurate as the response obtained from standard sinewave testing methods. The frequency response verified the accuracy of linear models consisting of engine partial derivatives and used for design. A power turbine governor was designed using the Linear Quadratic Regulator (LQR) method of full state feedback control. A Kalman filter observer was used to estimate helicopter main rotor blade velocity. Compared to the baseline T700 power turbine speed governor, the LQR governor reduced droop up to 25 percent for a 490 shaft horsepower transient in 0.1 sec simulating a wind gust, and up to 85 percent for a 700 shaft horsepower transient in 0.5 sec simulating a large collective pitch angle transient.

A binary linear programming formulation of the graph edit distance.

PubMed

Justice, Derek; Hero, Alfred

2006-08-01

A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. A general formulation for editing graphs is used to derive a graph edit distance that is proven to be a metric, provided the cost function for individual edit operations is a metric. Then, a binary linear program is developed for computing this graph edit distance, and polynomial time methods for determining upper and lower bounds on the solution of the binary program are derived by applying solution methods for standard linear programming and the assignment problem. A recognition problem of comparing a sample input graph to a database of known prototype graphs in the context of a chemical information system is presented as an application of the new method. The costs associated with various edit operations are chosen by using a minimum normalized variance criterion applied to pairwise distances between nearest neighbors in the database of prototypes. The new metric is shown to perform quite well in comparison to existing metrics when applied to a database of chemical graphs.

Spatial and temporal analyses of citrus sudden death as a tool to generate hypotheses concerning its etiology.

PubMed

Bassanezi, Renato B; Bergamin Filho, Armando; Amorim, Lilian; Gimenes-Fernandes, Nelson; Gottwald, Tim R; Bové, Joseph M

2003-04-01

ABSTRACT Citrus sudden death (CSD), a new disease of unknown etiology that affects sweet orange grafted on Rangpur lime, was visually monitored for 14 months in 41 groves in Brazil. Ordinary runs analysis of CSD-symptomatic trees indicated a departure from randomness of symptomatic trees status among immediately adjacent trees mainly within rows. The binomial index of dispersion (D) and the intraclass correlation (k) for various quadrat sizes suggested aggregation of CSD-symptomatic trees for almost all plots within the quadrat sizes tested. Estimated parameters of the binary form of Taylor's power law provided an overall measure of aggregation of CSD-symptomatic trees for all quadrat sizes tested. Aggregation in each plot was dependent on disease incidence. Spatial autocorrelation analysis of proximity patterns suggested that aggregation often existed among quadrats of various sizes up to three lag distances; however, significant lag positions discontinuous from main proximity patterns were rare, indicating a lack of spatial association among discrete foci. Some asymmetry was also detected for some spatial autocorrelation proximity patterns, indicating that within-row versus across-row distributions are not necessarily equivalent. These results were interpreted to mean that the cause of the disease was most likely biotic and its dissemination was common within a local area of influence that extended to approximately six trees in all directions, including adjacent trees. Where asymmetry was indicated, this area of influence was somewhat elliptical. Longer-distance patterns were not detected within the confines of the plot sizes tested. Annual rates of CSD progress based on the Gompertz model ranged from 0.37 to 2.02. Numerous similarities were found between the spatial patterns of CSD and Citrus tristeza virus (CTV) described in the literature, both in the presence of the aphid vector, Toxoptera citricida. CSD differs from CTV in that symptoms occur in sweet orange grafted on Rangpur lime. Based on the symptoms of CSD and on its spatial and temporal patterns, our hypothesis is that CSD may be caused by a similar but undescribed pathogen such as a virus and probably vectored by insects such as aphids by similar spatial processes to those affecting CTV.

METALLURGICAL PROGRAMS: CALCULATION OF MASS FROM VOLUME, DENSITY OF MIXTURES, AND CONVERSION OF ATOMIC TO WEIGHT PERCENT

NASA Technical Reports Server (NTRS)

Degroh, H.

1994-01-01

The Metallurgical Programs include three simple programs which calculate solutions to problems common to metallurgical engineers and persons making metal castings. The first program calculates the mass of a binary ideal (alloy) given the weight fractions and densities of the pure components and the total volume. The second program calculates the densities of a binary ideal mixture. The third program converts the atomic percentages of a binary mixture to weight percentages. The programs use simple equations to assist the materials staff with routine calculations. The Metallurgical Programs are written in Microsoft QuickBASIC for interactive execution and have been implemented on an IBM PC-XT/AT operating MS-DOS 2.1 or higher with 256K bytes of memory. All instructions needed by the user appear as prompts as the software is used. Data is input using the keyboard only and output is via the monitor. The Metallurgical programs were written in 1987.

QUADrATiC: scalable gene expression connectivity mapping for repurposing FDA-approved therapeutics.

PubMed

O'Reilly, Paul G; Wen, Qing; Bankhead, Peter; Dunne, Philip D; McArt, Darragh G; McPherson, Suzanne; Hamilton, Peter W; Mills, Ken I; Zhang, Shu-Dong

2016-05-04

Gene expression connectivity mapping has proven to be a powerful and flexible tool for research. Its application has been shown in a broad range of research topics, most commonly as a means of identifying potential small molecule compounds, which may be further investigated as candidates for repurposing to treat diseases. The public release of voluminous data from the Library of Integrated Cellular Signatures (LINCS) programme further enhanced the utilities and potentials of gene expression connectivity mapping in biomedicine. We describe QUADrATiC ( http://go.qub.ac.uk/QUADrATiC ), a user-friendly tool for the exploration of gene expression connectivity on the subset of the LINCS data set corresponding to FDA-approved small molecule compounds. It enables the identification of compounds for repurposing therapeutic potentials. The software is designed to cope with the increased volume of data over existing tools, by taking advantage of multicore computing architectures to provide a scalable solution, which may be installed and operated on a range of computers, from laptops to servers. This scalability is provided by the use of the modern concurrent programming paradigm provided by the Akka framework. The QUADrATiC Graphical User Interface (GUI) has been developed using advanced Javascript frameworks, providing novel visualization capabilities for further analysis of connections. There is also a web services interface, allowing integration with other programs or scripts. QUADrATiC has been shown to provide an improvement over existing connectivity map software, in terms of scope (based on the LINCS data set), applicability (using FDA-approved compounds), usability and speed. It offers potential to biological researchers to analyze transcriptional data and generate potential therapeutics for focussed study in the lab. QUADrATiC represents a step change in the process of investigating gene expression connectivity and provides more biologically-relevant results than previous alternative solutions.

Adiabatic Quantum Computing via the Rydberg Blockade

NASA Astrophysics Data System (ADS)

Keating, Tyler; Goyal, Krittika; Deutsch, Ivan

2012-06-01

We study an architecture for implementing adiabatic quantum computation with trapped neutral atoms. Ground state atoms are dressed by laser fields in a manner conditional on the Rydberg blockade mechanism, thereby providing the requisite entangling interactions. As a benchmark we study the performance of a Quadratic Unconstrained Binary Optimization (QUBO) problem whose solution is found in the ground state spin configuration of an Ising-like model. We model a realistic architecture, including the effects of magnetic level structure, with qubits encoded into the clock states of ^133Cs, effective B-fields implemented through microwaves and light shifts, and atom-atom coupling achieved by excitation to a high-lying Rydberg level. Including the fundamental effects of photon scattering we find a high fidelity for the two-qubit implementation.

Differential geometric treewidth estimation in adiabatic quantum computation

NASA Astrophysics Data System (ADS)

Wang, Chi; Jonckheere, Edmond; Brun, Todd

2016-10-01

The D-Wave adiabatic quantum computing platform is designed to solve a particular class of problems—the Quadratic Unconstrained Binary Optimization (QUBO) problems. Due to the particular "Chimera" physical architecture of the D-Wave chip, the logical problem graph at hand needs an extra process called minor embedding in order to be solvable on the D-Wave architecture. The latter problem is itself NP-hard. In this paper, we propose a novel polynomial-time approximation to the closely related treewidth based on the differential geometric concept of Ollivier-Ricci curvature. The latter runs in polynomial time and thus could significantly reduce the overall complexity of determining whether a QUBO problem is minor embeddable, and thus solvable on the D-Wave architecture.

Statistical optimization of process parameters for the simultaneous adsorption of Cr(VI) and phenol onto Fe-treated tea waste biomass

NASA Astrophysics Data System (ADS)

Gupta, Ankur; Balomajumder, Chandrajit

2017-12-01

In this study, simultaneous removal of Cr(VI) and phenol from binary solution was carried out using Fe-treated tea waste biomass. The effect of process parameters such as adsorbent dose, pH, initial concentration of Cr(VI) (mg/L), and initial concentration of phenol (mg/L) was optimized. The analysis of variance of the quadratic model demonstrates that the experimental results are in good agreement with the predicted values. Based on experimental design at an initial concentration of 55 mg/L of Cr(VI), 27.50 mg/L of phenol, pH 2.0, 15 g/L adsorbent dose, 99.99% removal of Cr(VI), and phenol was achieved.

AESOP: An interactive computer program for the design of linear quadratic regulators and Kalman filters

NASA Technical Reports Server (NTRS)

Lehtinen, B.; Geyser, L. C.

1984-01-01

AESOP is a computer program for use in designing feedback controls and state estimators for linear multivariable systems. AESOP is meant to be used in an interactive manner. Each design task that the program performs is assigned a "function" number. The user accesses these functions either (1) by inputting a list of desired function numbers or (2) by inputting a single function number. In the latter case the choice of the function will in general depend on the results obtained by the previously executed function. The most important of the AESOP functions are those that design,linear quadratic regulators and Kalman filters. The user interacts with the program when using these design functions by inputting design weighting parameters and by viewing graphic displays of designed system responses. Supporting functions are provided that obtain system transient and frequency responses, transfer functions, and covariance matrices. The program can also compute open-loop system information such as stability (eigenvalues), eigenvectors, controllability, and observability. The program is written in ANSI-66 FORTRAN for use on an IBM 3033 using TSS 370. Descriptions of all subroutines and results of two test cases are included in the appendixes.

FIRST PRECISION LIGHT CURVE ANALYSIS OF THE NEGLECTED EXTREME MASS RATIO SOLAR-TYPE BINARY HR BOOTIS

DOE Office of Scientific and Technical Information (OSTI.GOV)

Samec, Ronald G.; Benkendorf, Barry; Dignan, James B.

2015-04-15

HR Bootis is a neglected binary that is found to be a solar-type (G2V) extreme mass ratio binary (EMRB). It was discovered by Hanley and Shapley in 1940. Surprisingly, little has been published in the intervening years. In 1999 it was characterized by a 0.31587 day orbital period. Since that time it has been observed by various observers who have determined ∼20 timings of minimum light over the past ∼15,000 orbits. Our observations in 2012 represent the first precision curves in the BVR{sub c}I{sub c} Johnson–Cousins wavelength bands. The light curves have rather low amplitudes, averaging some 0.5 magnitudes, yetmore » they exhibit total eclipses, which is typical of the rare group of solar-type EMRBs. An improved linear ephemeris was computed along with a quadratic ephemeris showing a decaying orbit, which indicates magnetic breaking may be occurring. The light curve solution reveals that HR Boo is a contact system with a somewhat low 21% Roche-lobe fill-out but a mass ratio of q = 4.09 (0.2444), which defines it as an EMRB. Two spots, both hot, were allowed to iterate to fit the light curve asymmetries. Their radii are 32° and 16°. Both are high-latitude polar spots indicative of strong magnetic activity. The shallow contact yet nearly equal component temperatures makes it an unusual addition to this group.« less

Constraining Accreting Binary Populations in Normal Galaxies

NASA Astrophysics Data System (ADS)

Lehmer, Bret; Hornschemeier, A.; Basu-Zych, A.; Fragos, T.; Jenkins, L.; Kalogera, V.; Ptak, A.; Tzanavaris, P.; Zezas, A.

2011-01-01

X-ray emission from accreting binary systems (X-ray binaries) uniquely probe the binary phase of stellar evolution and the formation of compact objects such as neutron stars and black holes. A detailed understanding of X-ray binary systems is needed to provide physical insight into the formation and evolution of the stars involved, as well as the demographics of interesting binary remnants, such as millisecond pulsars and gravitational wave sources. Our program makes wide use of Chandra observations and complementary multiwavelength data sets (through, e.g., the Spitzer Infrared Nearby Galaxies Survey [SINGS] and the Great Observatories Origins Deep Survey [GOODS]), as well as super-computing facilities, to provide: (1) improved calibrations for correlations between X-ray binary emission and physical properties (e.g., star-formation rate and stellar mass) for galaxies in the local Universe; (2) new physical constraints on accreting binary processes (e.g., common-envelope phase and mass transfer) through the fitting of X-ray binary synthesis models to observed local galaxy X-ray binary luminosity functions; (3) observational and model constraints on the X-ray evolution of normal galaxies over the last 90% of cosmic history (since z 4) from the Chandra Deep Field surveys and accreting binary synthesis models; and (4) predictions for deeper observations from forthcoming generations of X-ray telesopes (e.g., IXO, WFXT, and Gen-X) to provide a science driver for these missions. In this talk, we highlight the details of our program and discuss recent results.

Photometric investigation of a very short period W UMa-type binary - Does CE Leonis have a large superluminous area?

NASA Technical Reports Server (NTRS)

Samec, Ronald G.; Su, Wen; Terrell, Dirk; Hube, Douglas P.

1993-01-01

A complete photometric analysis of BVRI Johnson-Cousins photometry of the high northern latitude galactic variable, CE Leo is presented. These observations were taken at Kitt Peak National Observatory on May 31, 1989-June 7, 1989. Three new precise epochs of minimum light were determined and a linear and a quadratic ephemeris were computed from these and previous data covering 28 years of observation. The light curves reveal that the system undergoes a brief 20 min totality in the primary eclipse, indicating that CE Leo is a W UMa W-type binary. A systemic velocity of about -40 km/s was determined. Standard magnitudes were found and a simultaneous solution of the B, V, R, I light curves was computed using the new Wilson-Devinney synthetic light curve code which has the capability of automatically adjusting star spots. The solution indicates that the system consists of two early K-type dwarfs in marginal contact with a fill-out factor less than 3 percent. Evidence for the presence of a large (45 deg radius) superluminous area on the cooler component is given.

Spectroscopic binaries in the Solar Twin Planet Search program: from substellar-mass to M dwarf companions

NASA Astrophysics Data System (ADS)

dos Santos, Leonardo A.; Meléndez, Jorge; Bedell, Megan; Bean, Jacob L.; Spina, Lorenzo; Alves-Brito, Alan; Dreizler, Stefan; Ramírez, Iván; Asplund, Martin

2017-12-01

Previous studies on the rotation of Sun-like stars revealed that the rotational rates of young stars converge towards a well-defined evolution that follows a power-law decay. It seems, however, that some binary stars do not obey this relation, often by displaying enhanced rotational rates and activity. In the Solar Twin Planet Search program, we observed several solar twin binaries, and found a multiplicity fraction of 42 per cent ± 6 per cent in the whole sample; moreover, at least three of these binaries (HIP 19911, HIP 67620 and HIP 103983) clearly exhibit the aforementioned anomalies. We investigated the configuration of the binaries in the program, and discovered new companions for HIP 6407, HIP 54582, HIP 62039 and HIP 30037, of which the latter is orbited by a 0.06 M⊙ brown dwarf in a 1 m long orbit. We report the orbital parameters of the systems with well-sampled orbits and, in addition, the lower limits of parameters for the companions that only display a curvature in their radial velocities. For the linear trend binaries, we report an estimate of the masses of their companions when their observed separation is available, and a minimum mass otherwise. We conclude that solar twin binaries with low-mass stellar companions at moderate orbital periods do not display signs of a distinct rotational evolution when compared to single stars. We confirm that the three peculiar stars are double-lined binaries, and that their companions are polluting their spectra, which explains the observed anomalies.

AQMAN; linear and quadratic programming matrix generator using two-dimensional ground-water flow simulation for aquifer management modeling

USGS Publications Warehouse

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)

Support Vector Machine algorithm for regression and classification

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yu, Chenggang; Zavaljevski, Nela

2001-08-01

The software is an implementation of the Support Vector Machine (SVM) algorithm that was invented and developed by Vladimir Vapnik and his co-workers at AT&T Bell Laboratories. The specific implementation reported here is an Active Set method for solving a quadratic optimization problem that forms the major part of any SVM program. The implementation is tuned to specific constraints generated in the SVM learning. Thus, it is more efficient than general-purpose quadratic optimization programs. A decomposition method has been implemented in the software that enables processing large data sets. The size of the learning data is virtually unlimited by themore » capacity of the computer physical memory. The software is flexible and extensible. Two upper bounds are implemented to regulate the SVM learning for classification, which allow users to adjust the false positive and false negative rates. The software can be used either as a standalone, general-purpose SVM regression or classification program, or be embedded into a larger software system.« less

Conic Sampling: An Efficient Method for Solving Linear and Quadratic Programming by Randomly Linking Constraints within the Interior

PubMed Central

Serang, Oliver

2012-01-01

Linear programming (LP) problems are commonly used in analysis and resource allocation, frequently surfacing as approximations to more difficult problems. Existing approaches to LP have been dominated by a small group of methods, and randomized algorithms have not enjoyed popularity in practice. This paper introduces a novel randomized method of solving LP problems by moving along the facets and within the interior of the polytope along rays randomly sampled from the polyhedral cones defined by the bounding constraints. This conic sampling method is then applied to randomly sampled LPs, and its runtime performance is shown to compare favorably to the simplex and primal affine-scaling algorithms, especially on polytopes with certain characteristics. The conic sampling method is then adapted and applied to solve a certain quadratic program, which compute a projection onto a polytope; the proposed method is shown to outperform the proprietary software Mathematica on large, sparse QP problems constructed from mass spectometry-based proteomics. PMID:22952741

Stochastic Control of Energy Efficient Buildings: A Semidefinite Programming Approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ma, Xiao; Dong, Jin; Djouadi, Seddik M

2015-01-01

The key goal in energy efficient buildings is to reduce energy consumption of Heating, Ventilation, and Air- Conditioning (HVAC) systems while maintaining a comfortable temperature and humidity in the building. This paper proposes a novel stochastic control approach for achieving joint performance and power control of HVAC. We employ a constrained Stochastic Linear Quadratic Control (cSLQC) by minimizing a quadratic cost function with a disturbance assumed to be Gaussian. The problem is formulated to minimize the expected cost subject to a linear constraint and a probabilistic constraint. By using cSLQC, the problem is reduced to a semidefinite optimization problem, wheremore » the optimal control can be computed efficiently by Semidefinite programming (SDP). Simulation results are provided to demonstrate the effectiveness and power efficiency by utilizing the proposed control approach.« less

Quantum optimization for training support vector machines.

PubMed

Anguita, Davide; Ridella, Sandro; Rivieccio, Fabio; Zunino, Rodolfo

2003-01-01

Refined concepts, such as Rademacher estimates of model complexity and nonlinear criteria for weighting empirical classification errors, represent recent and promising approaches to characterize the generalization ability of Support Vector Machines (SVMs). The advantages of those techniques lie in both improving the SVM representation ability and yielding tighter generalization bounds. On the other hand, they often make Quadratic-Programming algorithms no longer applicable, and SVM training cannot benefit from efficient, specialized optimization techniques. The paper considers the application of Quantum Computing to solve the problem of effective SVM training, especially in the case of digital implementations. The presented research compares the behavioral aspects of conventional and enhanced SVMs; experiments in both a synthetic and real-world problems support the theoretical analysis. At the same time, the related differences between Quadratic-Programming and Quantum-based optimization techniques are considered.

Experimental evaluation of model predictive control and inverse dynamics control for spacecraft proximity and docking maneuvers

NASA Astrophysics Data System (ADS)

Virgili-Llop, Josep; Zagaris, Costantinos; Park, Hyeongjun; Zappulla, Richard; Romano, Marcello

2018-03-01

An experimental campaign has been conducted to evaluate the performance of two different guidance and control algorithms on a multi-constrained docking maneuver. The evaluated algorithms are model predictive control (MPC) and inverse dynamics in the virtual domain (IDVD). A linear-quadratic approach with a quadratic programming solver is used for the MPC approach. A nonconvex optimization problem results from the IDVD approach, and a nonlinear programming solver is used. The docking scenario is constrained by the presence of a keep-out zone, an entry cone, and by the chaser's maximum actuation level. The performance metrics for the experiments and numerical simulations include the required control effort and time to dock. The experiments have been conducted in a ground-based air-bearing test bed, using spacecraft simulators that float over a granite table.

A reduced successive quadratic programming strategy for errors-in-variables estimation.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tjoa, I.-B.; Biegler, L. T.; Carnegie-Mellon Univ.

Parameter estimation problems in process engineering represent a special class of nonlinear optimization problems, because the maximum likelihood structure of the objective function can be exploited. Within this class, the errors in variables method (EVM) is particularly interesting. Here we seek a weighted least-squares fit to the measurements with an underdetermined process model. Thus, both the number of variables and degrees of freedom available for optimization increase linearly with the number of data sets. Large optimization problems of this type can be particularly challenging and expensive to solve because, for general-purpose nonlinear programming (NLP) algorithms, the computational effort increases atmore » least quadratically with problem size. In this study we develop a tailored NLP strategy for EVM problems. The method is based on a reduced Hessian approach to successive quadratic programming (SQP), but with the decomposition performed separately for each data set. This leads to the elimination of all variables but the model parameters, which are determined by a QP coordination step. In this way the computational effort remains linear in the number of data sets. Moreover, unlike previous approaches to the EVM problem, global and superlinear properties of the SQP algorithm apply naturally. Also, the method directly incorporates inequality constraints on the model parameters (although not on the fitted variables). This approach is demonstrated on five example problems with up to 102 degrees of freedom. Compared to general-purpose NLP algorithms, large improvements in computational performance are observed.« less

An algorithm for the solution of dynamic linear programs

NASA Technical Reports Server (NTRS)

Psiaki, Mark L.

1989-01-01

The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation scheme.

Computer routine adds plotting capabilities to existing programs

NASA Technical Reports Server (NTRS)

Harris, J. C.; Linnekin, J. S.

1966-01-01

PLOTAN, a generalized plot analysis routine written for the IBM 7094 computer, minimizes the difficulties in adding plot capabilities to large existing programs. PLOTAN is used in conjunction with a binary tape writing routine and has the ability to plot any variable on the intermediate binary tape as a function of any other.

Currency Arbitrage Detection Using a Binary Integer Programming Model

ERIC Educational Resources Information Center

Soon, Wanmei; Ye, Heng-Qing

2011-01-01

In this article, we examine the use of a new binary integer programming (BIP) model to detect arbitrage opportunities in currency exchanges. This model showcases an excellent application of mathematics to the real world. The concepts involved are easily accessible to undergraduate students with basic knowledge in Operations Research. Through this…

L2CXCV: A Fortran 77 package for least squares convex/concave data smoothing

NASA Astrophysics Data System (ADS)

Demetriou, I. C.

2006-04-01

Fortran 77 software is given for least squares smoothing to data values contaminated by random errors subject to one sign change in the second divided differences of the smoothed values, where the location of the sign change is also unknown of the optimization problem. A highly useful description of the constraints is that they follow from the assumption of initially increasing and subsequently decreasing rates of change, or vice versa, of the process considered. The underlying algorithm partitions the data into two disjoint sets of adjacent data and calculates the required fit by solving a strictly convex quadratic programming problem for each set. The piecewise linear interpolant to the fit is convex on the first set and concave on the other one. The partition into suitable sets is achieved by a finite iterative algorithm, which is made quite efficient because of the interactions of the quadratic programming problems on consecutive data. The algorithm obtains the solution by employing no more quadratic programming calculations over subranges of data than twice the number of the divided differences constraints. The quadratic programming technique makes use of active sets and takes advantage of a B-spline representation of the smoothed values that allows some efficient updating procedures. The entire code required to implement the method is 2920 Fortran lines. The package has been tested on a variety of data sets and it has performed very efficiently, terminating in an overall number of active set changes over subranges of data that is only proportional to the number of data. The results suggest that the package can be used for very large numbers of data values. Some examples with output are provided to help new users and exhibit certain features of the software. Important applications of the smoothing technique may be found in calculating a sigmoid approximation, which is a common topic in various contexts in applications in disciplines like physics, economics, biology and engineering. Distribution material that includes single and double precision versions of the code, driver programs, technical details of the implementation of the software package and test examples that demonstrate the use of the software is available in an accompanying ASCII file. Program summaryTitle of program:L2CXCV Catalogue identifier:ADXM_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADXM_v1_0 Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Computer:PC Intel Pentium, Sun Sparc Ultra 5, Hewlett-Packard HP UX 11.0 Operating system:WINDOWS 98, 2000, Unix/Solaris 7, Unix/HP UX 11.0 Programming language used:FORTRAN 77 Memory required to execute with typical data:O(n), where n is the number of data No. of bits in a byte:8 No. of lines in distributed program, including test data, etc.:29 349 No. of bytes in distributed program, including test data, etc.:1 276 663 No. of processors used:1 Has the code been vectorized or parallelized?:no Distribution format:default tar.gz Separate documentation available:Yes Nature of physical problem:Analysis of processes that show initially increasing and then decreasing rates of change (sigmoid shape), as, for example, in heat curves, reactor stability conditions, evolution curves, photoemission yields, growth models, utility functions, etc. Identifying an unknown convex/concave (sigmoid) function from some measurements of its values that contain random errors. Also, identifying the inflection point of this sigmoid function. Method of solution:Univariate data smoothing by minimizing the sum of the squares of the residuals (least squares approximation) subject to the condition that the second order divided differences of the smoothed values change sign at most once. Ideally, this is the number of sign changes in the second derivative of the underlying function. The remarkable property of the smoothed values is that they consist of one separate section of optimal components that give nonnegative second divided differences (convexity) and one separate section of optimal components that give nonpositive second divided differences (concavity). The solution process finds the joint (that is the inflection point estimate of the underlying function) of the sections automatically. The underlying method is iterative, each iteration solving a structured strictly convex quadratic programming problem in order to obtain a convex or a concave section over a subrange of data. Restrictions on the complexity of the problem:Number of data, n, is not limited in the software package, but is limited to 2000 in the main driver. The total work of the method requires 2n-2 structured quadratic programming calculations over subranges of data, which in practice does not exceed the amount of O(n) computer operations. Typical running times:CPU time on a PC with an Intel 733 MHz processor operating in Windows 98: About 2 s to smooth n=1000 noisy measurements that follow the shape of the sine function over one period. Summary:L2CXCV is a package of Fortran 77 subroutines for least squares smoothing to n univariate data values contaminated by random errors subject to one sign change in the second divided differences of the smoothed values, where the location of the sign change is unknown. The piecewise linear interpolant to the smoothed values gives a convex/concave fit to the data. The underlying algorithm is based on the property that in this best convex/concave fit, the convex and the concave section are both optimal and separate. The algorithm is iterative, each iteration solving a strictly convex quadratic programming problem for the best convex fit to the first k data, starting from the best convex fit to the first k-1 data. By reversing the order and sign of the data, the algorithm obtains the best concave fit to the last n-k data. Then it chooses that k as the optimal position of the required sign change (which defines the inflection point of the fit), if the convex and the concave components to the first k and the last n-k data, respectively, form a convex/concave vector that gives the least sum of squares of residuals. In effect the algorithm requires at most 2n-2 quadratic programming calculations over subranges of data. The package employs a technique for quadratic programming, which takes advantage of a B-spline representation of the smoothed values and makes use of some efficient O(k) updating procedures, where k is the number of data of a subrange. The package has been tested on a variety of data sets and it has performed very efficiently, terminating in an overall number of active set changes that is about n, thus exhibiting quadratic performance in n. The Fortran codes have been designed to minimize the use of computing resources. Attention has been given to computer rounding errors details, which are essential to the robustness of the software package. Numerical examples with output are provided to help the use of the software and exhibit certain features of the method. Distribution material that includes driver programs, technical details of the installation of the package and test examples that demonstrate the use of the software is available in an ASCII file that accompanies this work.

A contracting-interval program for the Danilewski method. Ph.D. Thesis - Va. Univ.

NASA Technical Reports Server (NTRS)

Harris, J. D.

1971-01-01

The concept of contracting-interval programs is applied to finding the eigenvalues of a matrix. The development is a three-step process in which (1) a program is developed for the reduction of a matrix to Hessenberg form, (2) a program is developed for the reduction of a Hessenberg matrix to colleague form, and (3) the characteristic polynomial with interval coefficients is readily obtained from the interval of colleague matrices. This interval polynomial is then factored into quadratic factors so that the eigenvalues may be obtained. To develop a contracting-interval program for factoring this polynomial with interval coefficients it is necessary to have an iteration method which converges even in the presence of controlled rounding errors. A theorem is stated giving sufficient conditions for the convergence of Newton's method when both the function and its Jacobian cannot be evaluated exactly but errors can be made proportional to the square of the norm of the difference between the previous two iterates. This theorem is applied to prove the convergence of the generalization of the Newton-Bairstow method that is used to obtain quadratic factors of the characteristic polynomial.

The Comparison Study of Quadratic Infinite Beam Program on Optimization Instensity Modulated Radiation Therapy Treatment Planning (IMRTP) between Threshold and Exponential Scatter Method with CERR® In The Case of Lung Cancer

NASA Astrophysics Data System (ADS)

Hardiyanti, Y.; Haekal, M.; Waris, A.; Haryanto, F.

2016-08-01

This research compares the quadratic optimization program on Intensity Modulated Radiation Therapy Treatment Planning (IMRTP) with the Computational Environment for Radiotherapy Research (CERR) software. We assumed that the number of beams used for the treatment planner was about 9 and 13 beams. The case used the energy of 6 MV with Source Skin Distance (SSD) of 100 cm from target volume. Dose calculation used Quadratic Infinite beam (QIB) from CERR. CERR was used in the comparison study between Gauss Primary threshold method and Gauss Primary exponential method. In the case of lung cancer, the threshold variation of 0.01, and 0.004 was used. The output of the dose was distributed using an analysis in the form of DVH from CERR. The maximum dose distributions obtained were on the target volume (PTV) Planning Target Volume, (CTV) Clinical Target Volume, (GTV) Gross Tumor Volume, liver, and skin. It was obtained that if the dose calculation method used exponential and the number of beam 9. When the dose calculation method used the threshold and the number of beam 13, the maximum dose distributions obtained were on the target volume PTV, GTV, heart, and skin.

Patterning in systems driven by nonlocal external forces.

PubMed

Luneville, L; Mallick, K; Pontikis, V; Simeone, D

2016-11-01

This work focuses on systems displaying domain patterns resulting from competing external and internal dynamics. To this end, we introduce a Lyapunov functional capable of describing the steady states of systems subject to external forces, by adding nonlocal terms to the Landau Ginzburg free energy of the system. Thereby, we extend the existing methodology treating long-range order interactions, to the case of external nonlocal forces. By studying the quadratic term of this Lyapunov functional, we compute the phase diagram in the temperature versus external field and we determine all possible modulated phases (domain patterns) as a function of the external forces and the temperature. Finally, we investigate patterning in chemical reactive mixtures and binary mixtures under irradiation, and we show that the last case opens the path toward micro-structural engineering of materials.

Patterning in systems driven by nonlocal external forces

NASA Astrophysics Data System (ADS)

Luneville, L.; Mallick, K.; Pontikis, V.; Simeone, D.

2016-11-01

This work focuses on systems displaying domain patterns resulting from competing external and internal dynamics. To this end, we introduce a Lyapunov functional capable of describing the steady states of systems subject to external forces, by adding nonlocal terms to the Landau Ginzburg free energy of the system. Thereby, we extend the existing methodology treating long-range order interactions, to the case of external nonlocal forces. By studying the quadratic term of this Lyapunov functional, we compute the phase diagram in the temperature versus external field and we determine all possible modulated phases (domain patterns) as a function of the external forces and the temperature. Finally, we investigate patterning in chemical reactive mixtures and binary mixtures under irradiation, and we show that the last case opens the path toward micro-structural engineering of materials.

Binary Number System Training for Graduate Foreign Students at New York Institute of Technology.

ERIC Educational Resources Information Center

Sudsataya, Nuntawun

This thesis describes the design, development, implementation, and evaluation of a training module to instruct graduate foreign students to learn the representation of the binary system and the method of decimal-binary conversion. The designer selected programmed instruction as the method of instruction and used the "lean" approach to…

About the mechanism of ERP-system pilot test

NASA Astrophysics Data System (ADS)

Mitkov, V. V.; Zimin, V. V.

2018-05-01

In the paper the mathematical problem of defining the scope of pilot test is stated, which is a task of quadratic programming. The procedure of the problem solving includes the method of network programming based on the structurally similar network representation of the criterion and constraints and which reduces the original problem to a sequence of simpler evaluation tasks. The evaluation tasks are solved by the method of dichotomous programming.

Mixed-Integer Nonconvex Quadratic Optimization Relaxations and Performance Analysis

DTIC Science & Technology

2016-10-11

Analysis of Interior Point Algorithms for Non-Lipschitz and Nonconvex Minimization,” (W. Bian, X. Chen, and Ye), Math Programming, 149 (2015) 301-327...Chen, Ge, Wang, Ye), Math Programming, 143 (1-2) (2014) 371-383. This paper resolved an important open question in cardinality constrained...Statistical Performance, and Algorithmic Theory for Local Solutions,” (H. Liu, T. Yao, R. Li, Y. Ye) manuscript, 2nd revision in Math Programming

Three-dimensional modeling of flexible pavements : executive summary, August 2001.

DOT National Transportation Integrated Search

2001-08-01

A linear viscoelastic model has been incorporated into a three-dimensional finite element program for analysis of flexible pavements. Linear and quadratic versions of hexahedral elements and quadrilateral axisymmetrix elements are provided. Dynamic p...

Three dimensional modeling of flexible pavements : final report, March 2002.

DOT National Transportation Integrated Search

2001-08-01

A linear viscoelastic model has been incorporated into a three-dimensional finite element program for analysis of flexible pavements. Linear and quadratic versions of hexahedral elements and quadrilateral axisymmetrix elements are provided. Dynamic p...

Interactive application of quadratic expansion of chi-square statistic to nonlinear curve fitting

NASA Technical Reports Server (NTRS)

Badavi, F. F.; Everhart, Joel L.

1987-01-01

This report contains a detailed theoretical description of an all-purpose, interactive curve-fitting routine that is based on P. R. Bevington's description of the quadratic expansion of the Chi-Square statistic. The method is implemented in the associated interactive, graphics-based computer program. Taylor's expansion of Chi-Square is first introduced, and justifications for retaining only the first term are presented. From the expansion, a set of n simultaneous linear equations is derived, then solved by matrix algebra. A brief description of the code is presented along with a limited number of changes that are required to customize the program of a particular task. To evaluate the performance of the method and the goodness of nonlinear curve fitting, two typical engineering problems are examined and the graphical and tabular output of each is discussed. A complete listing of the entire package is included as an appendix.

A duality theorem-based algorithm for inexact quadratic programming problems: Application to waste management under uncertainty

NASA Astrophysics Data System (ADS)

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.

Motor Oil Classification using Color Histograms and Pattern Recognition Techniques.

PubMed

Ahmadi, Shiva; Mani-Varnosfaderani, Ahmad; Habibi, Biuck

2018-04-20

Motor oil classification is important for quality control and the identification of oil adulteration. In thiswork, we propose a simple, rapid, inexpensive and nondestructive approach based on image analysis and pattern recognition techniques for the classification of nine different types of motor oils according to their corresponding color histograms. For this, we applied color histogram in different color spaces such as red green blue (RGB), grayscale, and hue saturation intensity (HSI) in order to extract features that can help with the classification procedure. These color histograms and their combinations were used as input for model development and then were statistically evaluated by using linear discriminant analysis (LDA), quadratic discriminant analysis (QDA), and support vector machine (SVM) techniques. Here, two common solutions for solving a multiclass classification problem were applied: (1) transformation to binary classification problem using a one-against-all (OAA) approach and (2) extension from binary classifiers to a single globally optimized multilabel classification model. In the OAA strategy, LDA, QDA, and SVM reached up to 97% in terms of accuracy, sensitivity, and specificity for both the training and test sets. In extension from binary case, despite good performances by the SVM classification model, QDA and LDA provided better results up to 92% for RGB-grayscale-HSI color histograms and up to 93% for the HSI color map, respectively. In order to reduce the numbers of independent variables for modeling, a principle component analysis algorithm was used. Our results suggest that the proposed method is promising for the identification and classification of different types of motor oils.

Multi-Objectivising Combinatorial Optimisation Problems by Means of Elementary Landscape Decompositions.

PubMed

Ceberio, Josu; Calvo, Borja; Mendiburu, Alexander; Lozano, Jose A

2018-02-15

In the last decade, many works in combinatorial optimisation have shown that, due to the advances in multi-objective optimisation, the algorithms from this field could be used for solving single-objective problems as well. In this sense, a number of papers have proposed multi-objectivising single-objective problems in order to use multi-objective algorithms in their optimisation. In this article, we follow up this idea by presenting a methodology for multi-objectivising combinatorial optimisation problems based on elementary landscape decompositions of their objective function. Under this framework, each of the elementary landscapes obtained from the decomposition is considered as an independent objective function to optimise. In order to illustrate this general methodology, we consider four problems from different domains: the quadratic assignment problem and the linear ordering problem (permutation domain), the 0-1 unconstrained quadratic optimisation problem (binary domain), and the frequency assignment problem (integer domain). We implemented two widely known multi-objective algorithms, NSGA-II and SPEA2, and compared their performance with that of a single-objective GA. The experiments conducted on a large benchmark of instances of the four problems show that the multi-objective algorithms clearly outperform the single-objective approaches. Furthermore, a discussion on the results suggests that the multi-objective space generated by this decomposition enhances the exploration ability, thus permitting NSGA-II and SPEA2 to obtain better results in the majority of the tested instances.

Sparse Regression as a Sparse Eigenvalue Problem

NASA Technical Reports Server (NTRS)

Moghaddam, Baback; Gruber, Amit; Weiss, Yair; Avidan, Shai

2008-01-01

We extend the l0-norm "subspectral" algorithms for sparse-LDA [5] and sparse-PCA [6] to general quadratic costs such as MSE in linear (kernel) regression. The resulting "Sparse Least Squares" (SLS) problem is also NP-hard, by way of its equivalence to a rank-1 sparse eigenvalue problem (e.g., binary sparse-LDA [7]). Specifically, for a general quadratic cost we use a highly-efficient technique for direct eigenvalue computation using partitioned matrix inverses which leads to dramatic x103 speed-ups over standard eigenvalue decomposition. This increased efficiency mitigates the O(n4) scaling behaviour that up to now has limited the previous algorithms' utility for high-dimensional learning problems. Moreover, the new computation prioritizes the role of the less-myopic backward elimination stage which becomes more efficient than forward selection. Similarly, branch-and-bound search for Exact Sparse Least Squares (ESLS) also benefits from partitioned matrix inverse techniques. Our Greedy Sparse Least Squares (GSLS) generalizes Natarajan's algorithm [9] also known as Order-Recursive Matching Pursuit (ORMP). Specifically, the forward half of GSLS is exactly equivalent to ORMP but more efficient. By including the backward pass, which only doubles the computation, we can achieve lower MSE than ORMP. Experimental comparisons to the state-of-the-art LARS algorithm [3] show forward-GSLS is faster, more accurate and more flexible in terms of choice of regularization

Method for optimizing channelized quadratic observers for binary classification of large-dimensional image datasets

PubMed Central

Kupinski, M. K.; Clarkson, E.

2015-01-01

We present a new method for computing optimized channels for channelized quadratic observers (CQO) that is feasible for high-dimensional image data. The method for calculating channels is applicable in general and optimal for Gaussian distributed image data. Gradient-based algorithms for determining the channels are presented for five different information-based figures of merit (FOMs). Analytic solutions for the optimum channels for each of the five FOMs are derived for the case of equal mean data for both classes. The optimum channels for three of the FOMs under the equal mean condition are shown to be the same. This result is critical since some of the FOMs are much easier to compute. Implementing the CQO requires a set of channels and the first- and second-order statistics of channelized image data from both classes. The dimensionality reduction from M measurements to L channels is a critical advantage of CQO since estimating image statistics from channelized data requires smaller sample sizes and inverting a smaller covariance matrix is easier. In a simulation study we compare the performance of ideal and Hotelling observers to CQO. The optimal CQO channels are calculated using both eigenanalysis and a new gradient-based algorithm for maximizing Jeffrey's divergence (J). Optimal channel selection without eigenanalysis makes the J-CQO on large-dimensional image data feasible. PMID:26366764

TRACTS: a program to map oligopurine.oligopyrimidine and other binary DNA tracts

PubMed Central

Gal, Moshe; Katz, Tzvi; Ovadia, Amir; Yagil, Gad

2003-01-01

A program to map the locations and frequencies of DNA tracts composed of only two bases (‘Binary DNA’) is described. The program, TRACTS (URL http://bioportal.weizmann.ac.il/tracts/tracts.html and/or http://bip.weizmann.ac.il/miwbin/servers/tracts) is of interest because long tracts composed of only two bases are highly over-represented in most genomes. In eukaryotes, oligopurine.oligopyrimidine tracts (‘R.Y tracts’) are found in the highest excess. In prokaryotes, W tracts predominate (A,T ‘rich’). A pre-program, ANEX, parses database annotation files of GenBank and EMBL, to produce a convenient one-line list of every gene (exon, intron) in a genome. The main unit lists and analyzes tracts of the three possible binary pairs (R.Y, K.M and S;W). As an example, the results of R.Y tract mapping of mammalian gene p53 is described. PMID:12824393

Visual Typo Correction by Collocative Optimization: A Case Study on Merchandize Images.

PubMed

Wei, Xiao-Yong; Yang, Zhen-Qun; Ngo, Chong-Wah; Zhang, Wei

2014-02-01

Near-duplicate retrieval (NDR) in merchandize images is of great importance to a lot of online applications on e-Commerce websites. In those applications where the requirement of response time is critical, however, the conventional techniques developed for a general purpose NDR are limited, because expensive post-processing like spatial verification or hashing is usually employed to compromise the quantization errors among the visual words used for the images. In this paper, we argue that most of the errors are introduced because of the quantization process where the visual words are considered individually, which has ignored the contextual relations among words. We propose a "spelling or phrase correction" like process for NDR, which extends the concept of collocations to visual domain for modeling the contextual relations. Binary quadratic programming is used to enforce the contextual consistency of words selected for an image, so that the errors (typos) are eliminated and the quality of the quantization process is improved. The experimental results show that the proposed method can improve the efficiency of NDR by reducing vocabulary size by 1000% times, and under the scenario of merchandize image NDR, the expensive local interest point feature used in conventional approaches can be replaced by color-moment feature, which reduces the time cost by 9202% while maintaining comparable performance to the state-of-the-art methods.

Adiabatic quantum computation with neutral atoms via the Rydberg blockade

NASA Astrophysics Data System (ADS)

Goyal, Krittika; Deutsch, Ivan

2011-05-01

We study a trapped-neutral-atom implementation of the adiabatic model of quantum computation whereby the Hamiltonian of a set of interacting qubits is changed adiabatically so that its ground state evolves to the desired output of the algorithm. We employ the ``Rydberg blockade interaction,'' which previously has been used to implement two-qubit entangling gates in the quantum circuit model. Here it is employed via off-resonant virtual dressing of the excited levels, so that atoms always remain in the ground state. The resulting dressed-Rydberg interaction is insensitive to the distance between the atoms within a certain blockade radius, making this process robust to temperature and vibrational fluctuations. Single qubit interactions are implemented with global microwaves and atoms are locally addressed with light shifts. With these ingredients, we study a protocol to implement the two-qubit Quadratic Unconstrained Binary Optimization (QUBO) problem. We model atom trapping, addressing, coherent evolution, and decoherence. We also explore collective control of the many-atom system and generalize the QUBO problem to multiple qubits. We study a trapped-neutral-atom implementation of the adiabatic model of quantum computation whereby the Hamiltonian of a set of interacting qubits is changed adiabatically so that its ground state evolves to the desired output of the algorithm. We employ the ``Rydberg blockade interaction,'' which previously has been used to implement two-qubit entangling gates in the quantum circuit model. Here it is employed via off-resonant virtual dressing of the excited levels, so that atoms always remain in the ground state. The resulting dressed-Rydberg interaction is insensitive to the distance between the atoms within a certain blockade radius, making this process robust to temperature and vibrational fluctuations. Single qubit interactions are implemented with global microwaves and atoms are locally addressed with light shifts. With these ingredients, we study a protocol to implement the two-qubit Quadratic Unconstrained Binary Optimization (QUBO) problem. We model atom trapping, addressing, coherent evolution, and decoherence. We also explore collective control of the many-atom system and generalize the QUBO problem to multiple qubits. We acknowledge funding from the AQUARIUS project, Sandia National Laboratories

Eclipsing Binaries with Possible Tertiary Components

NASA Astrophysics Data System (ADS)

Snyder, LeRoy F.

2013-05-01

Many eclipsing binary star systems (EBS) show long-term variations in their orbital periods which are evident in their O-C (observed minus calculated period) diagrams. This research carried out an analysis of 324 eclipsing binary systems taken from the systems analyzed in the Bob Nelson's O-C Files database. Of these 18 systems displayed evidence of periodic variations of the arrival times of the eclipses. These rates of period changes are sinusoidal variations. The sinusoidal character of these variations is suggestive of Keplerian motion caused by an orbiting companion. The reason for these changes is unknown, but mass loss, apsidal motion, magnetic activity and the presence of a third body have been proposed. This paper has assumed light time effect as the cause of the sinusoidal variations caused by the gravitational pull of a tertiary companion orbiting around the eclipsing binary systems. An observed minus calculated (O-C) diagram of the 324 systems was plotted using a quadratic ephemeris to determine if the system displayed a sinusoidal trend in theO-C residuals. After analysis of the 18 systems, seven systems, AW UMa, BB PEG, OO Aql, V508 Oph, VW Cep, WCrv and YY ERI met the benchmark of the criteria of a possible orbiting companion. The other 11 systems displayed a sinusoidal variation in the O-C residuals of the primary eclipses but these systems in the Bob Nelson's O-C Files did not contain times of minimum (Tmin) of the secondary eclipses and therefore not conclusive in determining the presents of the effects of a tertiary companion. An analysis of the residuals of the seven systems yields a light-time semi-amplitude, orbital period, eccentricity and mass of the tertiary companion as the amplitude of the variation is proportional to the mass, period and inclination of the 3rd orbiting body. Knowing the low mass of the tertiary body in the seven cases the possibility of five of these tertiary companions being brown dwarfs is discussed.

Application of experimental design and derivative spectrophotometry methods in optimization and analysis of biosorption of binary mixtures of basic dyes from aqueous solutions.

PubMed

Asfaram, Arash; Ghaedi, Mehrorang; Ghezelbash, Gholam Reza; Pepe, Francesco

2017-05-01

Simultaneous biosorption of malachite green (MG) and crystal violet (CV) on biosorbent Yarrowia lipolytica ISF7 was studied. An appropriate derivative spectrophotometry technique was used to evaluate the concentration of each dye in binary solutions, despite significant interferences in visible light absorbances. The effects of pH, temperature, growth time, initial MG and CV concentration in batch experiments were assessed using Design of Experiment (DOE) according to central composite second order response surface methodology (RSM). The analysis showed that the greatest biosorption efficiency (>99% for both dyes) can be obtained at pH 7.0, T=28°C, 24h mixing and 20mgL -1 initial concentrations for both MG and CV dyes. The quadratic constructed equation ability for fitting experimental data is judged based on criterions like R 2 values, significant p and lack-of-fit value strongly confirm its high adequacy and applicability for prediction of revel behavior of the system under study. The proposed model showed very high correlation coefficients (R 2 =0.9997 for CV and R 2 =0.9989 for MG), while supported by closeness of predicted and experimental value. A kinetic analysis was carried out, showing that for both dyes a pseudo-second order kinetic model adequately describes the available data. The Langmuir isotherm model in single and binary components has better performance for description of dyes biosorption with maximum monolayer biosorption capacity of 59.4 and 62.7mgg -1 in single component and 46.4 and 50.0mgg -1 for CV and MB in binary components, respectively. The surface structure of biosorbents and the possible biosorbents-dyes interactions between were also evaluated by Fourier transform infrared (FT-IR) spectroscopy and scanning electron microscopy (SEM). The values of thermodynamic parameters including ΔG° and ΔH° strongly confirm which method is spontaneous and endothermic. Copyright © 2017. Published by Elsevier Inc.

First Precision Photometric Observations and Analyses of The Totally Eclipsing, Solar Type Binary, V573 Pegasi

NASA Astrophysics Data System (ADS)

Samec, Ronald G.; Caton, Daniel B.; Faulkner, Danny R.

2018-06-01

CCD, VRI light curves of V573 Peg were taken in 26,27 September and 2, 4 and 6 October, 2017 at the Dark Sky Observatory in North Carolina with the 0.81-m reflector of Appalachian State University by D. Caton. V573 Peg was discovered by the SAVS survey which classified it as a V= 0.51 amplitude, EW variable. They included a rough spectrum identifying the binary was about a type G, although the period would indicate it is an F-type contact binary. Five times of minimum light were calculated, two primary eclipses and three secondary, from our present observations:HJD I = 2458023.6420±0.0012, 2458028.6522±0.0021,HJD II = 2458022.5991±0.0011, 2458023.8510±0.0010 and 2458028.8608±0.0005,The following linear and quadratic ephemerides were determined from all available times of minimum light.JD Hel MinI = 2456876.49437±0.00078d + 0.41745021±0. 00000017 × E, -JD Hel MinI = 2456876.49580±0.00023d + 0. 417448601±0.000000083× E - 0.000000000274±0.000000000012 X E2A 14-year period study (24 times of minimum light) revealed that the orbital period decreasing with a high level of confidence, possibly due to magnetic braking. The mass ratio is found to be somewhat extreme, M2/M1=0.2629±0.0006.Its Roche Lobe fill-out is 25%. The solution had no need of spots. The temperature difference of the components is about ~130 K, with the secondary as the hotter star, so it is a W-type W UMa Binary. The inclination is 80.4±0.1° . The secondary eclipse shows a time of constant light with an eclipse duration of 24 minutes. More details of our results will be given at the meeting.

Quantum-enhanced reinforcement learning for finite-episode games with discrete state spaces

NASA Astrophysics Data System (ADS)

Neukart, Florian; Von Dollen, David; Seidel, Christian; Compostella, Gabriele

2017-12-01

Quantum annealing algorithms belong to the class of metaheuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum annealing machines produced by D-Wave Systems, have been subject to multiple analyses in research, with the aim of characterizing the technology's usefulness for optimization and sampling tasks. Here, we present a way to partially embed both Monte Carlo policy iteration for finding an optimal policy on random observations, as well as how to embed n sub-optimal state-value functions for approximating an improved state-value function given a policy for finite horizon games with discrete state spaces on a D-Wave 2000Q quantum processing unit (QPU). We explain how both problems can be expressed as a quadratic unconstrained binary optimization (QUBO) problem, and show that quantum-enhanced Monte Carlo policy evaluation allows for finding equivalent or better state-value functions for a given policy with the same number episodes compared to a purely classical Monte Carlo algorithm. Additionally, we describe a quantum-classical policy learning algorithm. Our first and foremost aim is to explain how to represent and solve parts of these problems with the help of the QPU, and not to prove supremacy over every existing classical policy evaluation algorithm.

Thermophysical property of undercooled liquid binary alloy composed of metallic and semiconductor elements

NASA Astrophysics Data System (ADS)

Wang, H. P.; Wei, B.

2009-02-01

The thermophysical properties of the liquid Ni-Si binary alloy system were investigated by the molecular dynamics method. The properties investigated include density, excessive volume, enthalpy, mixing enthalpy and specific heat at both superheated and undercooled states. It is found that the density decreases with an increase in the Si content, and so do the temperature coefficients. If the Si content is smaller than 30%, the density changes linearly with the temperature. If it is larger than 30%, the density is a quadratic function of the temperature. The simulated enthalpies of different composition alloys increase linearly with a rise in temperature. This indicates that the specific heats of Ni-Si alloys change little with temperature. The specific heat versus composition first decreases to a minimum value at 50% Si, then experiences a rise to a maximum value at 90% Si and finally falls again. According to the excessive volume and mixing enthalpy, it can be deduced that the Ni-Si alloy system seriously deviates from the ideal solution. Moreover, a comparison was also performed between the present results and the approximated values by the Neumann-Kopp rule. It reveals that this work provides reasonable data in a broad temperature range, especially for the metastable undercooled liquid state.

New spectroscopic binary companions of giant stars and updated metallicity distribution for binary systems

NASA Astrophysics Data System (ADS)

Bluhm, P.; Jones, M. I.; Vanzi, L.; Soto, M. G.; Vos, J.; Wittenmyer, R. A.; Drass, H.; Jenkins, J. S.; Olivares, F.; Mennickent, R. E.; Vučković, M.; Rojo, P.; Melo, C. H. F.

2016-10-01

We report the discovery of 24 spectroscopic binary companions to giant stars. We fully constrain the orbital solution for 6 of these systems. We cannot unambiguously derive the orbital elements for the remaining stars because the phase coverage is incomplete. Of these stars, 6 present radial velocity trends that are compatible with long-period brown dwarf companions. The orbital solutions of the 24 binary systems indicate that these giant binary systems have a wide range in orbital periods, eccentricities, and companion masses. For the binaries with restricted orbital solutions, we find a range of orbital periods of between ~97-1600 days and eccentricities of between ~0.1-0.4. In addition, we studied the metallicity distribution of single and binary giant stars. We computed the metallicity of a total of 395 evolved stars, 59 of wich are in binary systems. We find a flat distribution for these binary stars and therefore conclude that stellar binary systems, and potentially brown dwarfs, have a different formation mechanism than planets. This result is confirmed by recent works showing that extrasolar planets orbiting giants are more frequent around metal-rich stars. Finally, we investigate the eccentricity as a function of the orbital period. We analyzed a total of 130 spectroscopic binaries, including those presented here and systems from the literature. We find that most of the binary stars with periods ≲30 days have circular orbits, while at longer orbital periods we observe a wide spread in their eccentricities. Based on observations collected at La Silla - Paranal Observatory under programs IDs IDs 085.C-0557, 087.C.0476, 089.C-0524, 090.C-0345, 096.A-9020 and through the Chilean Telescope Time under programs IDs CN2012A-73, CN2012B-47, CN2013A-111, CN2013B-51, CN2014A-52 and CN2015A-48.

Vulcan Identification of Eclipsing Binaries in the Kepler Field of View

NASA Astrophysics Data System (ADS)

Mjaseth, Kimberly; Batalha, N.; Borucki, W.; Caldwell, D.; Latham, D.; Martin, K. R.; Rabbette, M.; Witteborn, F.

2007-05-01

We report the discovery of 236 new eclipsing binary stars located in and around the field of view of the Kepler Mission. The binaries were identified from photometric light curves from the Vulcan exoplanet transit survey. The Vulcan camera is comprised of a modest aperture (10cm) f/2.8 Canon lens focusing a 7° x 7° field of view onto a 4096 x 4096 Kodak CCD. The system yields an hour-to-hour relative precision of 0.003 on 12th magnitude stars and saturates at 9th magnitude. The binaries have magnitudes in the range of 9.5 < V < 13.5 and periods ranging from 0.5 to 13 days. The milli-magnitude photometric precision allows detection of transits as shallow as 1%. The catalog contains a total of 273 eclipsing binary stars, including detached systems (high and low mass ratio), contact binaries, and triple systems. We present the derived orbital/transit properties, light curves, and stellar properties for selected targets. In addition, we summarize the results of radial velocity follow-up work. Support for this work came from NASA's Discovery Program and NASA's Origins of the Solar System Program.

Quadrat Data for Fermilab Prairie Plant Survey

Science.gov Websites

Quadrat Data 2012 Quadrat Data 2013 Quadrat Data None taken by volunteers in 2014 due to weather problems . 2015 Quadrat Data 2016 Quadrat Data None taken by volunteers in 2017 due to weather and other problems

Study of neglected (near-)contact binaries using small telescopes

NASA Astrophysics Data System (ADS)

Zejda, Miloslav; Zhang, Jia; Qian, Shengbang; Zhu, Liying; Mikulášek, Zdeněk

2016-07-01

We present the first results of our new program aimed at relatively bright neglected (near-)contact binaries. The targets can be observed using small telescopes from several to several tens of centimeters in diameter. Light ephemeris determined by phenomenological modeling and physical parameters of the system obtained by Wilson-Devinney method are given for the first stars V373 Dra, OQ UMa from our program.

Evolving binary classifiers through parallel computation of multiple fitness cases.

PubMed

Cagnoni, Stefano; Bergenti, Federico; Mordonini, Monica; Adorni, Giovanni

2005-06-01

This paper describes two versions of a novel approach to developing binary classifiers, based on two evolutionary computation paradigms: cellular programming and genetic programming. Such an approach achieves high computation efficiency both during evolution and at runtime. Evolution speed is optimized by allowing multiple solutions to be computed in parallel. Runtime performance is optimized explicitly using parallel computation in the case of cellular programming or implicitly taking advantage of the intrinsic parallelism of bitwise operators on standard sequential architectures in the case of genetic programming. The approach was tested on a digit recognition problem and compared with a reference classifier.

Accretion dynamics in pre-main sequence binaries

NASA Astrophysics Data System (ADS)

Tofflemire, B.; Mathieu, R.; Herczeg, G.; Ardila, D.; Akeson, R.; Ciardi, D.; Johns-Krull, C.

Binary stars are a common outcome of star formation. Orbital resonances, especially in short-period systems, are capable of reshaping the distribution and flows of circumstellar material. Simulations of the binary-disk interaction predict a dynamically cleared gap around the central binary, accompanied by periodic ``pulsed'' accretion events that are driven by orbital motion. To place observational constraints on the binary-disk interaction, we have conducted a long-term monitoring program tracing the time-variable accretion behavior of 9 short-period binaries. In this proceeding we present two results from our campaign: 1) the detection of periodic pulsed accretion events in DQ Tau and TWA 3A, and 2) evidence that the TWA 3A primary is the dominant accretor in the system.

Comparative decision models for anticipating shortage of food grain production in India

NASA Astrophysics Data System (ADS)

Chattopadhyay, Manojit; Mitra, Subrata Kumar

2018-01-01

This paper attempts to predict food shortages in advance from the analysis of rainfall during the monsoon months along with other inputs used for crop production, such as land used for cereal production, percentage of area covered under irrigation and fertiliser use. We used six binary classification data mining models viz., logistic regression, Multilayer Perceptron, kernel lab-Support Vector Machines, linear discriminant analysis, quadratic discriminant analysis and k-Nearest Neighbors Network, and found that linear discriminant analysis and kernel lab-Support Vector Machines are equally suitable for predicting per capita food shortage with 89.69 % accuracy in overall prediction and 92.06 % accuracy in predicting food shortage ( true negative rate). Advance information of food shortage can help policy makers to take remedial measures in order to prevent devastating consequences arising out of food non-availability.

Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

Pham, Huyên, E-mail: pham@math.univ-paris-diderot.fr; Wei, Xiaoli, E-mail: tyswxl@gmail.com

We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zamzam, Ahmed, S.; Zhaoy, Changhong; Dall'Anesey, Emiliano

This paper examines the AC Optimal Power Flow (OPF) problem for multiphase distribution networks featuring renewable energy resources (RESs). We start by outlining a power flow model for radial multiphase systems that accommodates wye-connected and delta-connected RESs and non-controllable energy assets. We then formalize an AC OPF problem that accounts for both types of connections. Similar to various AC OPF renditions, the resultant problem is a non convex quadratically-constrained quadratic program. However, the so-called Feasible Point Pursuit-Successive Convex Approximation algorithm is leveraged to obtain a feasible and yet locally-optimal solution. The merits of the proposed solution approach are demonstrated usingmore » two unbalanced multiphase distribution feeders with both wye and delta connections.« less

Solution of quadratic matrix equations for free vibration analysis of structures.

NASA Technical Reports Server (NTRS)

Gupta, K. K.

1973-01-01

An efficient digital computer procedure and the related numerical algorithm are presented herein for the solution of quadratic matrix equations associated with free vibration analysis of structures. Such a procedure enables accurate and economical analysis of natural frequencies and associated modes of discretized structures. The numerically stable algorithm is based on the Sturm sequence method, which fully exploits the banded form of associated stiffness and mass matrices. The related computer program written in FORTRAN V for the JPL UNIVAC 1108 computer proves to be substantially more accurate and economical than other existing procedures of such analysis. Numerical examples are presented for two structures - a cantilever beam and a semicircular arch.

A new technique for calculations of binary stellar evolution, with application to magnetic braking

NASA Technical Reports Server (NTRS)

Rappaport, S.; Joss, P. C.; Verbunt, F.

1983-01-01

The development of appropriate computer programs has made it possible to conduct studies of stellar evolution which are more detailed and accurate than the investigations previously feasible. However, the use of such programs can also entail some serious drawbacks which are related to the time and expense required for the work. One approach for overcoming these drawbacks involves the employment of simplified stellar evolution codes which incorporate the essential physics of the problem of interest without attempting either great generality or maximal accuracy. Rappaport et al. (1982) have developed a simplified code to study the evolution of close binary stellar systems composed of a collapsed object and a low-mass secondary. The present investigation is concerned with a more general, but still simplified, technique for calculating the evolution of close binary systems with collapsed binaries and mass-losing secondaries.

VASP- VARIABLE DIMENSION AUTOMATIC SYNTHESIS PROGRAM

NASA Technical Reports Server (NTRS)

White, J. S.

1994-01-01

VASP is a variable dimension Fortran version of the Automatic Synthesis Program, ASP. The program is used to implement Kalman filtering and control theory. Basically, it consists of 31 subprograms for solving most modern control problems in linear, time-variant (or time-invariant) control systems. These subprograms include operations of matrix algebra, computation of the exponential of a matrix and its convolution integral, and the solution of the matrix Riccati equation. The user calls these subprograms by means of a FORTRAN main program, and so can easily obtain solutions to most general problems of extremization of a quadratic functional of the state of the linear dynamical system. Particularly, these problems include the synthesis of the Kalman filter gains and the optimal feedback gains for minimization of a quadratic performance index. VASP, as an outgrowth of the Automatic Synthesis Program, has the following improvements: more versatile programming language; more convenient input/output format; some new subprograms which consolidate certain groups of statements that are often repeated; and variable dimensioning. The pertinent difference between the two programs is that VASP has variable dimensioning and more efficient storage. The documentation for the VASP program contains a VASP dictionary and example problems. The dictionary contains a description of each subroutine and instructions on its use. The example problems include dynamic response, optimal control gain, solution of the sampled data matrix Riccati equation, matrix decomposition, and a pseudo-inverse of a matrix. This program is written in FORTRAN IV and has been implemented on the IBM 360. The VASP program was developed in 1971.

A Multiple-star Combined Solution Program - Application to the Population II Binary μ Cas

NASA Astrophysics Data System (ADS)

Gudehus, D. H.

2001-05-01

A multiple-star combined-solution computer program which can simultaneously fit astrometric, speckle, and spectroscopic data, and solve for the orbital parameters, parallax, proper motion, and masses has been written and is now publicly available. Some features of the program are the ability to scale the weights at run time, hold selected parameters constant, handle up to five spectroscopic subcomponents for the primary and the secondary each, account for the light travel time across the system, account for apsidal motion, plot the results, and write the residuals in position to a standard file for further analysis. The spectroscopic subcomponent data can be represented by reflex velocities and/or by independent measurements. A companion editing program which can manage the data files is included in the package. The program has been applied to the Population II binary μ Cas to derive improved masses and an estimate of the primordial helium abundance. The source code, executables, sample data files, and documentation for OpenVMS and Unix, including Linux, are available at http://www.chara.gsu.edu/\\rlap\\ \\ gudehus/binary.html.

Binary Solid-Liquid Phase Equilibria

ERIC Educational Resources Information Center

Ellison, Herbert R.

1978-01-01

Indicates some of the information that may be obtained from a binary solid-liquid phase equilibria experiment and a method to write a computer program that will plot an ideal phase diagram to which the experimental results may be compared. (Author/CP)

Quantum Assisted Learning for Registration of MODIS Images

NASA Astrophysics Data System (ADS)

Pelissier, C.; Le Moigne, J.; Fekete, G.; Halem, M.

2017-12-01

The advent of the first large scale quantum annealer by D-Wave has led to an increased interest in quantum computing. However, the quantum annealing computer of the D-Wave is limited to either solving Quadratic Unconstrained Binary Optimization problems (QUBOs) or using the ground state sampling of an Ising system that can be produced by the D-Wave. These restrictions make it challenging to find algorithms to accelerate the computation of typical Earth Science applications. A major difficulty is that most applications have continuous real-valued parameters rather than binary. Here we present an exploratory study using the ground state sampling to train artificial neural networks (ANNs) to carry out image registration of MODIS images. The key idea to using the D-Wave to train networks is that the quantum chip behaves thermally like Boltzmann machines (BMs), and BMs are known to be successful at recognizing patterns in images. The ground state sampling of the D-Wave also depends on the dynamics of the adiabatic evolution and is subject to other non-thermal fluctuations, but the statistics are thought to be similar and ANNs tend to be robust under fluctuations. In light of this, the D-Wave ground state sampling is used to define a Boltzmann like generative model and is investigated to register MODIS images. Image intensities of MODIS images are transformed using a Discrete Cosine Transform and used to train a several layers network to learn how to align images to a reference image. The network layers consist of an initial sigmoid layer acting as a binary filter of the input followed by a strict binarization using Bernoulli sampling, and then fed into a Boltzmann machine. The output is then classified using a soft-max layer. Results are presented and discussed.

PHOTOMETRIC STUDY OF THE VERY SHORT PERIOD SHALLOW CONTACT BINARY DD COMAE BERENICES

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhu, L.; Qian, S.-B.; Mikulasek, Z.

2010-07-15

The first photometric solutions of the very short period (VSP) close binary DD Comae Berenices (P = 0fd26920811) based on our new complete (IR){sub C} light curves are derived by the 2003 version Wilson-Van Hamme code. They show that the system belongs to shallow contact W-type W UMa systems with a degree of overcontact of 8.7%. The observed light curve distortions are explained by employing the spots model due to the late-type nature of both components. We have collected all available photometric data about the system with emphasis on the individual observational data, which we treated simultaneously using our ownmore » method based on the usage of computed model light curves as templates. We recalculated published times of light minimum and added new ones of our own to construct an O - C diagram that spans over 70 years. Using a least squares method orthogonal quadratic model function, we found that the orbital period of DD Com is continuously increasing with P-dot =0.00401(22) s yr{sup -1}. The period increase may be caused by the mass transfer from the less-massive component to the more-massive one. With the period increase, the binary is evolving from the present shallow contact phase to the broken stage predicted by the thermal relaxation oscillation (TRO) theory. Compared with other VSP systems, DD Com is a rare system that lies on the expanding phase of the TRO cycle. Until now, only four such systems including DD Com are found in this stage. Thus, this target is another good observational proof of the TRO theory in a very short period region.« less

Thermodynamics and kinetics of binary nucleation in ideal-gas mixtures.

PubMed

Alekseechkin, Nikolay V

2015-08-07

The nonisothermal single-component theory of droplet nucleation [N. V. Alekseechkin, Physica A 412, 186 (2014)] is extended to binary case; the droplet volume V, composition x, and temperature T are the variables of the theory. An approach based on macroscopic kinetics (in contrast to the standard microscopic model of nucleation operating with the probabilities of monomer attachment and detachment) is developed for the droplet evolution and results in the derived droplet motion equations in the space (V, x, T)—equations for V̇≡dV/dt, ẋ, and Ṫ. The work W(V, x, T) of the droplet formation is obtained in the vicinity of the saddle point as a quadratic form with diagonal matrix. Also, the problem of generalizing the single-component Kelvin equation for the equilibrium vapor pressure to binary case is solved; it is presented here as a problem of integrability of a Pfaffian equation. The equation for Ṫ is shown to be the first law of thermodynamics for the droplet, which is a consequence of Onsager's reciprocal relations and the linked-fluxes concept. As an example of ideal solution for demonstrative numerical calculations, the o-xylene-m-xylene system is employed. Both nonisothermal and enrichment effects are shown to exist; the mean steady-state overheat of droplets and their mean steady-state enrichment are calculated with the help of the 3D distribution function. Some qualitative peculiarities of the nucleation thermodynamics and kinetics in the water-sulfuric acid system are considered in the model of regular solution. It is shown that there is a small kinetic parameter in the theory due to the small amount of the acid in the vapor and, as a consequence, the nucleation process is isothermal.

Portfolio optimization using fuzzy linear programming

NASA Astrophysics Data System (ADS)

Pandit, Purnima K.

2013-09-01

Portfolio Optimization (PO) is a problem in Finance, in which investor tries to maximize return and minimize risk by carefully choosing different assets. Expected return and risk are the most important parameters with regard to optimal portfolios. In the simple form PO can be modeled as quadratic programming problem which can be put into equivalent linear form. PO problems with the fuzzy parameters can be solved as multi-objective fuzzy linear programming problem. In this paper we give the solution to such problems with an illustrative example.

Automation of reverse engineering process in aircraft modeling and related optimization problems

NASA Technical Reports Server (NTRS)

Li, W.; Swetits, J.

1994-01-01

During the year of 1994, the engineering problems in aircraft modeling were studied. The initial concern was to obtain a surface model with desirable geometric characteristics. Much of the effort during the first half of the year was to find an efficient way of solving a computationally difficult optimization model. Since the smoothing technique in the proposal 'Surface Modeling and Optimization Studies of Aerodynamic Configurations' requires solutions of a sequence of large-scale quadratic programming problems, it is important to design algorithms that can solve each quadratic program in a few interactions. This research led to three papers by Dr. W. Li, which were submitted to SIAM Journal on Optimization and Mathematical Programming. Two of these papers have been accepted for publication. Even though significant progress has been made during this phase of research and computation times was reduced from 30 min. to 2 min. for a sample problem, it was not good enough for on-line processing of digitized data points. After discussion with Dr. Robert E. Smith Jr., it was decided not to enforce shape constraints in order in order to simplify the model. As a consequence, P. Dierckx's nonparametric spline fitting approach was adopted, where one has only one control parameter for the fitting process - the error tolerance. At the same time the surface modeling software developed by Imageware was tested. Research indicated a substantially improved fitting of digitalized data points can be achieved if a proper parameterization of the spline surface is chosen. A winning strategy is to incorporate Dierckx's surface fitting with a natural parameterization for aircraft parts. The report consists of 4 chapters. Chapter 1 provides an overview of reverse engineering related to aircraft modeling and some preliminary findings of the effort in the second half of the year. Chapters 2-4 are the research results by Dr. W. Li on penalty functions and conjugate gradient methods for quadratic programming problems.

High-Speed Numeric Function Generator Using Piecewise Quadratic Approximations

DTIC Science & Technology

2007-09-01

application; User specifies the fuction to approxiamte. % % This programs turns the function provided into an inline function... PRIMARY = < primary file 1> < primary file 2> #SECONDARY = <secondary file 1> <secondary file 2> #CHIP2 = <file to compile to user chip

The Michigan Binary Star Program

NASA Astrophysics Data System (ADS)

Lindner, Rudi P.

2007-07-01

At the end of the nineteenth century, William J. Hussey and Robert G. Aitken, both at Lick Observatory, began a systematic search for unrecorded binary stars with the aid of the 12" and 36" refracting telescopes at Lick Observatory. Aitken's work (and book on binary stars) are well known, Hussey's contributions less so. In 1905 Hussey, a Michigan engineering graduate, returned to direct the Ann Arbor astronomy program, and immediately he began to design new instrumentation for the study of binary stars and to train potential observers. For a time, he spent six months a year at the La Plata Observatory, where he discovered a number of new pairs and decided upon a major southern hemisphere campaign. He spent a decade obtaining the lenses for a large refractor, through the vicissitudes of war and depression. Finally, he obtained a site in South Africa, a 26" refractor, and a small corps of observers, but he died in London en route to fulfill his dream. His right hand man, Richard Rossiter, established the observatory and spent the next thirty years discovering and measuring binary stars: his personal total is a record for the field. This talk is an account of the methods, results, and utility of the extraordinary binary star factory in the veldt.

The reduced space Sequential Quadratic Programming (SQP) method for calculating the worst resonance response of nonlinear systems

NASA Astrophysics Data System (ADS)

Liao, Haitao; Wu, Wenwang; Fang, Daining

2018-07-01

A coupled approach combining the reduced space Sequential Quadratic Programming (SQP) method with the harmonic balance condensation technique for finding the worst resonance response is developed. The nonlinear equality constraints of the optimization problem are imposed on the condensed harmonic balance equations. Making use of the null space decomposition technique, the original optimization formulation in the full space is mathematically simplified, and solved in the reduced space by means of the reduced SQP method. The transformation matrix that maps the full space to the null space of the constrained optimization problem is constructed via the coordinate basis scheme. The removal of the nonlinear equality constraints is accomplished, resulting in a simple optimization problem subject to bound constraints. Moreover, second order correction technique is introduced to overcome Maratos effect. The combination application of the reduced SQP method and condensation technique permits a large reduction of the computational cost. Finally, the effectiveness and applicability of the proposed methodology is demonstrated by two numerical examples.

Development of Quadratic Programming Algorithm Based on Interior Point Method with Estimation Mechanism of Active Constraints

NASA Astrophysics Data System (ADS)

Hashimoto, Hiroyuki; Takaguchi, Yusuke; Nakamura, Shizuka

Instability of calculation process and increase of calculation time caused by increasing size of continuous optimization problem remain the major issues to be solved to apply the technique to practical industrial systems. This paper proposes an enhanced quadratic programming algorithm based on interior point method mainly for improvement of calculation stability. The proposed method has dynamic estimation mechanism of active constraints on variables, which fixes the variables getting closer to the upper/lower limit on them and afterwards releases the fixed ones as needed during the optimization process. It is considered as algorithm-level integration of the solution strategy of active-set method into the interior point method framework. We describe some numerical results on commonly-used bench-mark problems called “CUTEr” to show the effectiveness of the proposed method. Furthermore, the test results on large-sized ELD problem (Economic Load Dispatching problems in electric power supply scheduling) are also described as a practical industrial application.

Documentation of the Fourth Order Band Model

NASA Technical Reports Server (NTRS)

Kalnay-Rivas, E.; Hoitsma, D.

1979-01-01

A general circulation model is presented which uses quadratically conservative, fourth order horizontal space differences on an unstaggered grid and second order vertical space differences with a forward-backward or a smooth leap frog time scheme to solve the primitive equations of motion. The dynamic equations for motion, finite difference equations, a discussion of the structure and flow chart of the program code, a program listing, and three relevent papers are given.

Partial Data Traces: Efficient Generation and Representation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mueller, F; De Supinski, B R; McKee, S A

2001-08-20

Binary manipulation techniques are increasing in popularity. They support program transformations tailored toward certain program inputs, and these transformations have been shown to yield performance gains beyond the scope of static code optimizations without profile-directed feedback. They even deliver moderate gains in the presence of profile-guided optimizations. In addition, transformations can be performed on the entire executable, including library routines. This work focuses on program instrumentation, yet another application of binary manipulation. This paper reports preliminary results on generating partial data traces through dynamic binary rewriting. The contributions are threefold. First, a portable method for extracting precise data traces formore » partial executions of arbitrary applications is developed. Second, a set of hierarchical structures for compactly representing these accesses is developed. Third, an efficient online algorithm to detect regular accesses is introduced. The authors utilize dynamic binary rewriting to selectively collect partial address traces of regions within a program. This allows partial tracing of hot paths for only a short time during program execution in contrast to static rewriting techniques that lack hot path detection and also lack facilities to limit the duration of data collection. Preliminary results show reductions of three orders of a magnitude of inline instrumentation over a dual process approach involving context switching. They also report constant size representations for regular access patters in nested loops. These efforts are part of a larger project to counter the increasing gap between processor and main memory speeds by means of software optimization and hardware enhancements.« less

Stellar and Binary Evolution in Star Clusters

NASA Technical Reports Server (NTRS)

McMillan, Stephen L. W.

2001-01-01

This paper presents a final report on research activities covered on Stellar and Binary Evolution in Star Clusters. Substantial progress was made in the development and dissemination of the "Starlab" software environment. Significant improvements were made to "kira," an N-body simulation program tailored to the study of dense stellar systems such as star clusters and galactic nuclei. Key advances include (1) the inclusion of stellar and binary evolution in a self-consistent manner, (2) proper treatment of the anisotropic Galactic tidal field, (3) numerous technical enhancements in the treatment of binary dynamics and interactions, and (4) full support for the special-purpose GRAPE-4 hardware, boosting the program's performance by a factor of 10-100 over the accelerated version. The data-reduction and analysis tools in Starlab were also substantially expanded. A Starlab Web site (http://www.sns.ias.edu/-starlab) was created and developed. The site contains detailed information on the structure and function of the various tools that comprise the package, as well as download information, "how to" tips and examples of common operations, demonstration programs, animations, etc. All versions of the software are freely distributed to all interested users, along with detailed installation instructions.

Application of Sequential Quadratic Programming to Minimize Smart Active Flap Rotor Hub Loads

NASA Technical Reports Server (NTRS)

Kottapalli, Sesi; Leyland, Jane

2014-01-01

In an analytical study, SMART active flap rotor hub loads have been minimized using nonlinear programming constrained optimization methodology. The recently developed NLPQLP system (Schittkowski, 2010) that employs Sequential Quadratic Programming (SQP) as its core algorithm was embedded into a driver code (NLP10x10) specifically designed to minimize active flap rotor hub loads (Leyland, 2014). Three types of practical constraints on the flap deflections have been considered. To validate the current application, two other optimization methods have been used: i) the standard, linear unconstrained method, and ii) the nonlinear Generalized Reduced Gradient (GRG) method with constraints. The new software code NLP10x10 has been systematically checked out. It has been verified that NLP10x10 is functioning as desired. The following are briefly covered in this paper: relevant optimization theory; implementation of the capability of minimizing a metric of all, or a subset, of the hub loads as well as the capability of using all, or a subset, of the flap harmonics; and finally, solutions for the SMART rotor. The eventual goal is to implement NLP10x10 in a real-time wind tunnel environment.

Optimization strategies based on sequential quadratic programming applied for a fermentation process for butanol production.

PubMed

Pinto Mariano, Adriano; Bastos Borba Costa, Caliane; de Franceschi de Angelis, Dejanira; Maugeri Filho, Francisco; Pires Atala, Daniel Ibraim; Wolf Maciel, Maria Regina; Maciel Filho, Rubens

2009-11-01

In this work, the mathematical optimization of a continuous flash fermentation process for the production of biobutanol was studied. The process consists of three interconnected units, as follows: fermentor, cell-retention system (tangential microfiltration), and vacuum flash vessel (responsible for the continuous recovery of butanol from the broth). The objective of the optimization was to maximize butanol productivity for a desired substrate conversion. Two strategies were compared for the optimization of the process. In one of them, the process was represented by a deterministic model with kinetic parameters determined experimentally and, in the other, by a statistical model obtained using the factorial design technique combined with simulation. For both strategies, the problem was written as a nonlinear programming problem and was solved with the sequential quadratic programming technique. The results showed that despite the very similar solutions obtained with both strategies, the problems found with the strategy using the deterministic model, such as lack of convergence and high computational time, make the use of the optimization strategy with the statistical model, which showed to be robust and fast, more suitable for the flash fermentation process, being recommended for real-time applications coupling optimization and control.

Improvement of Binary Analysis Components in Automated Malware Analysis Framework

DTIC Science & Technology

2017-02-21

analyze malicious software (malware) with minimum human interaction. The system autonomously analyze malware samples by analyzing malware binary program...AFRL-AFOSR-JP-TR-2017-0018 Improvement of Binary Analysis Components in Automated Malware Analysis Framework Keiji Takeda KEIO UNIVERSITY Final...currently valid OMB control number . PLEASE DO NOT RETURN YOUR FORM TO THE ABOVE ORGANIZATION. 1. REPORT DATE (DD-MM-YYYY)      21-02-2017 2. REPORT

A Photometric Study of the Eclipsing Binary Star PY Boötis

NASA Astrophysics Data System (ADS)

Michaels, E. J.

2016-12-01

Presented here are the first precision multi-band CCD photometry of the eclipsing binary star PY Boötis. Best-fit stellar models were determined by analyzing the light curves with the Wilson-Devinney program. Asymmetries in the light curves were interpreted as resulting from magnetic activity which required spots to be included in the model. The resulting model is consistent with a W-type contact eclipsing binary having total eclipses.

NOLIN: A nonlinear laminate analysis program

NASA Technical Reports Server (NTRS)

Kibler, J. J.

1975-01-01

A nonlinear, plane-stress, laminate analysis program, NOLIN, was developed which accounts for laminae nonlinearity under inplane shear and transverse extensional stress. The program determines the nonlinear stress-strain behavior of symmetric laminates subjected to any combination of inplane shear and biaxial extensional loadings. The program has the ability to treat different stress-strain behavior in tension and compression, and predicts laminate failure using any or all of maximum stress, maximum strain, and quadratic interaction failure criteria. A brief description of the program is presented including discussion of the flow of information and details of the input required. Sample problems and a complete listing of the program is also provided.

A Sequential Linear Quadratic Approach for Constrained Nonlinear Optimal Control with Adaptive Time Discretization and Application to Higher Elevation Mars Landing Problem

NASA Astrophysics Data System (ADS)

Sandhu, Amit

A sequential quadratic programming method is proposed for solving nonlinear optimal control problems subject to general path constraints including mixed state-control and state only constraints. The proposed algorithm further develops on the approach proposed in [1] with objective to eliminate the use of a high number of time intervals for arriving at an optimal solution. This is done by introducing an adaptive time discretization to allow formation of a desirable control profile without utilizing a lot of intervals. The use of fewer time intervals reduces the computation time considerably. This algorithm is further used in this thesis to solve a trajectory planning problem for higher elevation Mars landing.

A computer program for modeling non-spherical eclipsing binary star systems

NASA Technical Reports Server (NTRS)

Wood, D. B.

1972-01-01

The accurate analysis of eclipsing binary light curves is fundamental to obtaining information on the physical properties of stars. The model described accounts for the important geometric and photometric distortions such as rotational and tidal distortion, gravity brightening, and reflection effect. This permits a more accurate analysis of interacting eclipsing star systems. The model is designed to be useful to anyone with moderate computing resources. The programs, written in FORTRAN 4 for the IBM 360, consume about 80k bytes of core. The FORTRAN program listings are provided, and the computational aspects are described in some detail.

Optimally stopped variational quantum algorithms

NASA Astrophysics Data System (ADS)

Vinci, Walter; Shabani, Alireza

2018-04-01

Quantum processors promise a paradigm shift in high-performance computing which needs to be assessed by accurate benchmarking measures. In this article, we introduce a benchmark for the variational quantum algorithm (VQA), recently proposed as a heuristic algorithm for small-scale quantum processors. In VQA, a classical optimization algorithm guides the processor's quantum dynamics to yield the best solution for a given problem. A complete assessment of the scalability and competitiveness of VQA should take into account both the quality and the time of dynamics optimization. The method of optimal stopping, employed here, provides such an assessment by explicitly including time as a cost factor. Here, we showcase this measure for benchmarking VQA as a solver for some quadratic unconstrained binary optimization. Moreover, we show that a better choice for the cost function of the classical routine can significantly improve the performance of the VQA algorithm and even improve its scaling properties.

Image Registration and Data Assimilation as a QUBO on the D-Wave Quantum Annealer

NASA Astrophysics Data System (ADS)

Pelissier, C.; LeMoigne, J.; Halem, M.; Simpson, D. G.; Clune, T.

2016-12-01

The advent of the commercially available D-Wave quantum annealer has for the first time allowed investigations of the potential of quantum effects to efficiently carry out certain numerical tasks. The D-Wave computer was initially promoted as a tool to solve Quadratic Unconstrained Binary Optimization problems (QUBOs), but currently, it is also being used to generate the Boltzmann statistics required to train Restricted Boltzmann machines (RBMs). We consider the potential of this new architecture in performing numerical computations required to estimate terrestrial carbon fluxes from OCO-2 observations using the LIS model. The use of RBMs is being investigated in this work, but here we focus on the D-Wave as a QUBO solver, and it's potential to carry out image registration and data assimilation. QUBOs are formulated for both problems and results generated using the D-Wave 2Xtm at the NAS supercomputing facility are presented.

Partial differential equations constrained combinatorial optimization on an adiabatic quantum computer

NASA Astrophysics Data System (ADS)

Chandra, Rishabh

Partial differential equation-constrained combinatorial optimization (PDECCO) problems are a mixture of continuous and discrete optimization problems. PDECCO problems have discrete controls, but since the partial differential equations (PDE) are continuous, the optimization space is continuous as well. Such problems have several applications, such as gas/water network optimization, traffic optimization, micro-chip cooling optimization, etc. Currently, no efficient classical algorithm which guarantees a global minimum for PDECCO problems exists. A new mapping has been developed that transforms PDECCO problem, which only have linear PDEs as constraints, into quadratic unconstrained binary optimization (QUBO) problems that can be solved using an adiabatic quantum optimizer (AQO). The mapping is efficient, it scales polynomially with the size of the PDECCO problem, requires only one PDE solve to form the QUBO problem, and if the QUBO problem is solved correctly and efficiently on an AQO, guarantees a global optimal solution for the original PDECCO problem.

Entropy generation in Gaussian quantum transformations: applying the replica method to continuous-variable quantum information theory

NASA Astrophysics Data System (ADS)

Gagatsos, Christos N.; Karanikas, Alexandros I.; Kordas, Georgios; Cerf, Nicolas J.

2016-02-01

In spite of their simple description in terms of rotations or symplectic transformations in phase space, quadratic Hamiltonians such as those modelling the most common Gaussian operations on bosonic modes remain poorly understood in terms of entropy production. For instance, determining the quantum entropy generated by a Bogoliubov transformation is notably a hard problem, with generally no known analytical solution, while it is vital to the characterisation of quantum communication via bosonic channels. Here we overcome this difficulty by adapting the replica method, a tool borrowed from statistical physics and quantum field theory. We exhibit a first application of this method to continuous-variable quantum information theory, where it enables accessing entropies in an optical parametric amplifier. As an illustration, we determine the entropy generated by amplifying a binary superposition of the vacuum and a Fock state, which yields a surprisingly simple, yet unknown analytical expression.

Radiation reaction for spinning bodies in effective field theory. II. Spin-spin effects

NASA Astrophysics Data System (ADS)

Maia, Natália T.; Galley, Chad R.; Leibovich, Adam K.; Porto, Rafael A.

2017-10-01

We compute the leading post-Newtonian (PN) contributions at quadratic order in the spins to the radiation-reaction acceleration and spin evolution for binary systems, entering at four-and-a-half PN order. Our calculation includes the backreaction from finite-size spin effects, which is presented for the first time. The computation is carried out, from first principles, using the effective field theory framework for spinning extended objects. At this order, nonconservative effects in the spin-spin sector are independent of the spin supplementary conditions. A nontrivial consistency check is performed by showing that the energy loss induced by the resulting radiation-reaction force is equivalent to the total emitted power in the far zone. We find that, in contrast to the spin-orbit contributions (reported in a companion paper), the radiation reaction affects the evolution of the spin vectors once spin-spin effects are incorporated.

The Factorability of Quadratics: Motivation for More Techniques

ERIC Educational Resources Information Center

Bosse, Michael J.; Nandakumar, N. R.

2005-01-01

Typically, secondary and college algebra students attempt to utilize either completing the square or the quadratic formula as techniques to solve a quadratic equation only after frustration with factoring has arisen. While both completing the square and the quadratic formula are techniques which can determine solutions for all quadratic equations,…

Binary tree eigen solver in finite element analysis

NASA Technical Reports Server (NTRS)

Akl, F. A.; Janetzke, D. C.; Kiraly, L. J.

1993-01-01

This paper presents a transputer-based binary tree eigensolver for the solution of the generalized eigenproblem in linear elastic finite element analysis. The algorithm is based on the method of recursive doubling, which parallel implementation of a number of associative operations on an arbitrary set having N elements is of the order of o(log2N), compared to (N-1) steps if implemented sequentially. The hardware used in the implementation of the binary tree consists of 32 transputers. The algorithm is written in OCCAM which is a high-level language developed with the transputers to address parallel programming constructs and to provide the communications between processors. The algorithm can be replicated to match the size of the binary tree transputer network. Parallel and sequential finite element analysis programs have been developed to solve for the set of the least-order eigenpairs using the modified subspace method. The speed-up obtained for a typical analysis problem indicates close agreement with the theoretical prediction given by the method of recursive doubling.

A Loader for Executing Multi-Binary Applications on the Thinking Machines CM-5: It's Not Just for SPMD Anymore

NASA Technical Reports Server (NTRS)

Becker, Jeffrey C.

1995-01-01

The Thinking Machines CM-5 platform was designed to run single program, multiple data (SPMD) applications, i.e., to run a single binary across all nodes of a partition, with each node possibly operating on different data. Certain classes of applications, such as multi-disciplinary computational fluid dynamics codes, are facilitated by the ability to have subsets of the partition nodes running different binaries. In order to extend the CM-5 system software to permit such applications, a multi-program loader was developed. This system is based on the dld loader which was originally developed for workstations. This paper provides a high level description of dld, and describes how it was ported to the CM-5 to provide support for multi-binary applications. Finally, it elaborates how the loader has been used to implement the CM-5 version of MPIRUN, a portable facility for running multi-disciplinary/multi-zonal MPI (Message-Passing Interface Standard) codes.

Nonlinear Curve-Fitting Program

NASA Technical Reports Server (NTRS)

Everhart, Joel L.; Badavi, Forooz F.

1989-01-01

Nonlinear optimization algorithm helps in finding best-fit curve. Nonlinear Curve Fitting Program, NLINEAR, interactive curve-fitting routine based on description of quadratic expansion of X(sup 2) statistic. Utilizes nonlinear optimization algorithm calculating best statistically weighted values of parameters of fitting function and X(sup 2) minimized. Provides user with such statistical information as goodness of fit and estimated values of parameters producing highest degree of correlation between experimental data and mathematical model. Written in FORTRAN 77.

A Centered Projective Algorithm for Linear Programming

DTIC Science & Technology

1988-02-01

zx/l to (PA Karmarkar’s algorithm iterates this procedure. An alternative method, the so-called affine variant (first proposed by Dikin [6] in 1967...trajectories, II. Legendre transform coordinates . central trajectories," manuscripts, to appear in Transactions of the American [6] I.I. Dikin ...34Iterative solution of problems of linear and quadratic programming," Soviet Mathematics Dokladv 8 (1967), 674-675. [7] I.I. Dikin , "On the speed of an

Probability, Problem Solving, and "The Price is Right."

ERIC Educational Resources Information Center

Wood, Eric

1992-01-01

This article discusses the analysis of a decision-making process faced by contestants on the television game show "The Price is Right". The included analyses of the original and related problems concern pattern searching, inductive reasoning, quadratic functions, and graphing. Computer simulation programs in BASIC and tables of…

A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem

DTIC Science & Technology

1990-09-01

Electr6nica e Inform’itica Industrial E.T.S. Ingenieros Industriales Universidad Polit6cnica, Madrid Technical Report SOL 90-12 September 1990 -Y...MURRAY* AND FRANCISCO J. PRIETOt *Systems Optimization Laboratory Department of Operations Research Stanford University tDept. de Automitica, Ingenieria

First Precision Photometric Observations and Analyses of the Totally Eclipsing, Solar Type Binary V573 Pegasi

NASA Astrophysics Data System (ADS)

Samec, R. G.; Caton, D. B.; Faulkner, D. R.

2018-06-01

CCD VRcIc light curves of V573 Peg were taken 26 and 27 September and 2, 4, and 6 October, 2017, at the Dark Sky Observatory in North Carolina with the 0.81-m reflector of Appalachian State University. Five times of minimum light were calculated, two primary and three secondary eclipses, from our present observations. The following quadratic ephemeris was determined from all available times of minimum light: JD Hel MinI = 2456876.4958 (2) d + 0.41744860 (8) × E -2.74 (12) × 10^-10 × E2, where the parentheses hold the ± error in the last two digits of the preceding value. A 14-year period study (covered by 24 times of minimum light) reveals a decreasing orbital period with high confidence, possibly due to magnetic braking. The mass ratio is found to be somewhat extreme, M2 / M1 = 0.2629 ± 0.0006 (M1 / M2 = 3.8). Its Roche Lobe fill-out is ˜25%. The solution had no need of spots. The component temperature difference is about 130 K, with the less massive component as the hotter one, so it is a W-type W UMa Binary. The inclination is 80.4 ± 0.1°. Our secondary eclipse shows a time of constant light with an eclipse duration of 24 minutes. More information is given in the following report.

Establishing Malware Attribution and Binary Provenance Using Multicompilation Techniques

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ramshaw, M. J.

2017-07-28

Malware is a serious problem for computer systems and costs businesses and customers billions of dollars a year in addition to compromising their private information. Detecting malware is particularly difficult because malware source code can be compiled in many different ways and generate many different digital signatures, which causes problems for most anti-malware programs that rely on static signature detection. Our project uses a convolutional neural network to identify malware programs but these require large amounts of data to be effective. Towards that end, we gather thousands of source code files from publicly available programming contest sites and compile themmore » with several different compilers and flags. Building upon current research, we then transform these binary files into image representations and use them to train a long-term recurrent convolutional neural network that will eventually be used to identify how a malware binary was compiled. This information will include the compiler, version of the compiler and the options used in compilation, information which can be critical in determining where a malware program came from and even who authored it.« less

Design of reinforced areas of concrete column using quadratic polynomials

NASA Astrophysics Data System (ADS)

Arif Gunadi, Tjiang; Parung, Herman; Rachman Djamaluddin, Abd; Arwin Amiruddin, A.

2017-11-01

Designing of reinforced concrete columns mostly carried out by a simple planning method which uses column interaction diagram. However, the application of this method is limited because it valids only for certain compressive strenght of the concrete and yield strength of the reinforcement. Thus, a more applicable method is still in need. Another method is the use of quadratic polynomials as a basis for the approach in designing reinforced concrete columns, where the ratio of neutral lines to the effective height of a cross section (ξ) if associated with ξ in the same cross-section with different reinforcement ratios is assumed to form a quadratic polynomial. This is identical to the basic principle used in the Simpson rule for numerical integral using quadratic polynomials and had a sufficiently accurate level of accuracy. The basis of this approach to be used both the normal force equilibrium and the moment equilibrium. The abscissa of the intersection of the two curves is the ratio that had been mentioned, since it fulfill both of the equilibrium. The application of this method is relatively more complicated than the existing method but provided with tables and graphs (N vs ξN ) and (M vs ξM ) so that its used could be simplified. The uniqueness of these tables are only distinguished based on the compresssive strength of the concrete, so in application it could be combined with various yield strenght of the reinforcement available in the market. This method could be solved by using programming languages such as Fortran.

Orbital motion in pre-main sequence binaries

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schaefer, G. H.; Prato, L.; Simon, M.

2014-06-01

We present results from our ongoing program to map the visual orbits of pre-main sequence (PMS) binaries in the Taurus star forming region using adaptive optics imaging at the Keck Observatory. We combine our results with measurements reported in the literature to analyze the orbital motion for each binary. We present preliminary orbits for DF Tau, T Tau S, ZZ Tau, and the Pleiades binary HBC 351. Seven additional binaries show curvature in their relative motion. Currently, we can place lower limits on the orbital periods for these systems; full solutions will be possible with more orbital coverage. Five othermore » binaries show motion that is indistinguishable from linear motion. We suspect that these systems are bound and might show curvature with additional measurements in the future. The observations reported herein lay critical groundwork toward the goal of measuring precise masses for low-mass PMS stars.« less

Analysis and Defense of Vulnerabilities in Binary Code

DTIC Science & Technology

2008-09-29

language . We demonstrate our techniques by automatically generating input filters from vulnerable binary programs. vi Acknowledgments I thank my wife, family...21 2.2 The Vine Intermediate Language . . . . . . . . . . . . . . . . . . . . . . 21 ix 2.2.1 Normalized Memory...The Traditional Weakest Precondition Semantics . . . . . . . . . . . . . 44 3.2.1 The Guarded Command Language . . . . . . . . . . . . . . . . . 44

What the Computer Taught Me About My Students...or Is Binary Search "Natural"?

ERIC Educational Resources Information Center

Pasquino, Anne

1978-01-01

Several examples of student-written programs "teaching" a computer to guess systematically in finding a number between 0 and 10,000 are illustrated. These lend support to the contention that rather than being a "natural" application, using a binary search is a learned technique. (MN)

Binary Star Orbits. IV. Orbits of 18 Southern Interferometric Pairs

NASA Astrophysics Data System (ADS)

Mason, Brian D.; Hartkopf, William I.; Tokovinin, Andrei

2010-09-01

First orbits are presented for 3 interferometric pairs and revised solutions for 15 others, based in part on first results from a recently initiated program of speckle interferometric observations of neglected southern binaries. Eight of these systems contain additional components, with multiplicity ranging up to 6.

B and V photometry and analysis of the eclipsing binary RZ CAS

NASA Astrophysics Data System (ADS)

Riazi, N.; Bagheri, M. R.; Faghihi, F.

1994-01-01

Photoelectric light curves of the eclipsing binary RZ Cas are presented for B and V filters. The light curves are analyzed for light and geometrical elements, starting with a previously suggested preliminary method. The approximate results thus obtained are then optimised through the Wilson-Devinney computer programs.

Users manual for flight control design programs

NASA Technical Reports Server (NTRS)

Nalbandian, J. Y.

1975-01-01

Computer programs for the design of analog and digital flight control systems are documented. The program DIGADAPT uses linear-quadratic-gaussian synthesis algorithms in the design of command response controllers and state estimators, and it applies covariance propagation analysis to the selection of sampling intervals for digital systems. Program SCHED executes correlation and regression analyses for the development of gain and trim schedules to be used in open-loop explicit-adaptive control laws. A linear-time-varying simulation of aircraft motions is provided by the program TVHIS, which includes guidance and control logic, as well as models for control actuator dynamics. The programs are coded in FORTRAN and are compiled and executed on both IBM and CDC computers.

Evaluating the effects of real power losses in optimal power flow based storage integration

DOE PAGES

Castillo, Anya; Gayme, Dennice

2017-03-27

This study proposes a DC optimal power flow (DCOPF) with losses formulation (the `-DCOPF+S problem) and uses it to investigate the role of real power losses in OPF based grid-scale storage integration. We derive the `- DCOPF+S problem by augmenting a standard DCOPF with storage (DCOPF+S) problem to include quadratic real power loss approximations. This procedure leads to a multi-period nonconvex quadratically constrained quadratic program, which we prove can be solved to optimality using either a semidefinite or second order cone relaxation. Our approach has some important benefits over existing models. It is more computationally tractable than ACOPF with storagemore » (ACOPF+S) formulations and the provably exact convex relaxations guarantee that an optimal solution can be attained for a feasible problem. Adding loss approximations to a DCOPF+S model leads to a more accurate representation of locational marginal prices, which have been shown to be critical to determining optimal storage dispatch and siting in prior ACOPF+S based studies. Case studies demonstrate the improved accuracy of the `-DCOPF+S model over a DCOPF+S model and the computational advantages over an ACOPF+S formulation.« less

EVALUATION OF A MEASUREMENT METHOD FOR FOREST VEGETATION IN A LARGE-SCALE ECOLOGICAL SURVEY

EPA Science Inventory

We evaluate a field method for determining species richness and canopy cover of vascular plants for the Forest Health Monitoring Program (FHM), an ecological survey of U.S. forests. Measurements are taken within 12 1-m2 quadrats on 1/15 ha plots in FHM. Species richness and cover...

Primal Barrier Methods for Linear Programming

DTIC Science & Technology

1989-06-01

A Theoretical Bound Concerning the difficulties introduced by an ill-conditioned H- 1, Dikin [Dik67] and Stewart [Stew87] show for a full-rank A...Dik67] I. I. Dikin (1967). Iterative solution of problems of linear and quadratic pro- gramming, Doklady Akademii Nauk SSSR, Tom 174, No. 4. [Fia79] A. V

Interior-Point Methods for Linear Programming: A Challenge to the Simplex Method

DTIC Science & Technology

1988-07-01

subsequently found that the method was first proposed by Dikin in 1967 [6]. Search directions are generated by the same system (5). Any hint of quadratic...1982). Inexact Newton methods, SIAM Journal on Numerical Analysis 19, 400-408. [6] I. I. Dikin (1967). Iterative solution of problems of linear and

Optimization of a bundle divertor for FED

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hively, L.M.; Rothe, K.E.; Minkoff, M.

1982-01-01

Optimal double-T bundle divertor configurations have been obtained for the Fusion Engineering Device (FED). On-axis ripple is minimized, while satisfying a series of engineering constraints. The ensuing non-linear optimization problem is solved via a sequence of quadratic programming subproblems, using the VMCON algorithm. The resulting divertor designs are substantially improved over previous configurations.

Order-Constrained Solutions in K-Means Clustering: Even Better than Being Globally Optimal

ERIC Educational Resources Information Center

Steinley, Douglas; Hubert, Lawrence

2008-01-01

This paper proposes an order-constrained K-means cluster analysis strategy, and implements that strategy through an auxiliary quadratic assignment optimization heuristic that identifies an initial object order. A subsequent dynamic programming recursion is applied to optimally subdivide the object set subject to the order constraint. We show that…

Adaptive dynamic programming for discrete-time linear quadratic regulation based on multirate generalised policy iteration

NASA Astrophysics Data System (ADS)

Chun, Tae Yoon; Lee, Jae Young; Park, Jin Bae; Choi, Yoon Ho

2018-06-01

In this paper, we propose two multirate generalised policy iteration (GPI) algorithms applied to discrete-time linear quadratic regulation problems. The proposed algorithms are extensions of the existing GPI algorithm that consists of the approximate policy evaluation and policy improvement steps. The two proposed schemes, named heuristic dynamic programming (HDP) and dual HDP (DHP), based on multirate GPI, use multi-step estimation (M-step Bellman equation) at the approximate policy evaluation step for estimating the value function and its gradient called costate, respectively. Then, we show that these two methods with the same update horizon can be considered equivalent in the iteration domain. Furthermore, monotonically increasing and decreasing convergences, so called value iteration (VI)-mode and policy iteration (PI)-mode convergences, are proved to hold for the proposed multirate GPIs. Further, general convergence properties in terms of eigenvalues are also studied. The data-driven online implementation methods for the proposed HDP and DHP are demonstrated and finally, we present the results of numerical simulations performed to verify the effectiveness of the proposed methods.

A path following algorithm for the graph matching problem.

PubMed

Zaslavskiy, Mikhail; Bach, Francis; Vert, Jean-Philippe

2009-12-01

We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted graph matching problem as a least-square problem on the set of permutation matrices and relaxing it to two different optimization problems: a quadratic convex and a quadratic concave optimization problem on the set of doubly stochastic matrices. The concave relaxation has the same global minimum as the initial graph matching problem, but the search for its global minimum is also a hard combinatorial problem. We, therefore, construct an approximation of the concave problem solution by following a solution path of a convex-concave problem obtained by linear interpolation of the convex and concave formulations, starting from the convex relaxation. This method allows to easily integrate the information on graph label similarities into the optimization problem, and therefore, perform labeled weighted graph matching. The algorithm is compared with some of the best performing graph matching methods on four data sets: simulated graphs, QAPLib, retina vessel images, and handwritten Chinese characters. In all cases, the results are competitive with the state of the art.

Estimation of positive semidefinite correlation matrices by using convex quadratic semidefinite programming.

PubMed

Fushiki, Tadayoshi

2009-07-01

The correlation matrix is a fundamental statistic that is used in many fields. For example, GroupLens, a collaborative filtering system, uses the correlation between users for predictive purposes. Since the correlation is a natural similarity measure between users, the correlation matrix may be used in the Gram matrix in kernel methods. However, the estimated correlation matrix sometimes has a serious defect: although the correlation matrix is originally positive semidefinite, the estimated one may not be positive semidefinite when not all ratings are observed. To obtain a positive semidefinite correlation matrix, the nearest correlation matrix problem has recently been studied in the fields of numerical analysis and optimization. However, statistical properties are not explicitly used in such studies. To obtain a positive semidefinite correlation matrix, we assume the approximate model. By using the model, an estimate is obtained as the optimal point of an optimization problem formulated with information on the variances of the estimated correlation coefficients. The problem is solved by a convex quadratic semidefinite program. A penalized likelihood approach is also examined. The MovieLens data set is used to test our approach.

On the time-weighted quadratic sum of linear discrete systems

NASA Technical Reports Server (NTRS)

Jury, E. I.; Gutman, S.

1975-01-01

A method is proposed for obtaining the time-weighted quadratic sum for linear discrete systems. The formula of the weighted quadratic sum is obtained from matrix z-transform formulation. In addition, it is shown that this quadratic sum can be derived in a recursive form for several useful weighted functions. The discussion presented parallels that of MacFarlane (1963) for weighted quadratic integral for linear continuous systems.

Photometric study of the eclipsing binary GR Bootis

NASA Astrophysics Data System (ADS)

Zhang, Z. L.; Zhang, Y. P.; Fu, J. N.; Xue, H. F.

2016-07-01

We present CCD photometry and low-resolution spectra of the eclipsing binary GR Boo. A new ephemeris is determined based on all the available times of the minimum light. The period analysis reveals that the orbital period is decreasing with a rate of dP / dt = - 2.05 ×10-10 d yr-1 . A photometric analysis for the obtained light curves is performed with the Wilson-Devinney Differential Correction program for the first time. The photometric solutions confirm the W UMa-type nature of the binary system. The mass ratio turns out to be q = 0.985 ± 0.001 . The evolutionary status and physical nature of the binary system are briefly discussed.

MAGSAT project

NASA Technical Reports Server (NTRS)

1981-01-01

Programs for the conversion of MAGSAT tapes (both CHRONICLE and CHRONINT formats) from IBM binary to DEC 10 binary were developed in ASSEMBLY language) and programs for selection of only a particular part of CHRONICLE tape (e.g., passes over the Indian subcontinent) were also prepared. Data on a few selected quiet and disturbed days were studied by substracting the main field, and the anomalies over the Indian region were partly identified on few of the passes. A national Workshop on MAGSAT was arranged. The potentialities and usefulness of MAGSAT data particularly in the study of crustal lithology was discussed.

THE EFFECTIVENESS OF QUADRATS FOR MEASURING VASCULAR PLANT DIVERSITY

EPA Science Inventory

Quadrats are widely used for measuring characteristics of vascular plant communities. It is well recognized that quadrat size affects measurements of frequency and cover. The ability of quadrats of varying sizes to adequately measure diversity has not been established. An exha...

Controlling behavioral experiments with a new programming language (SORCA) for microcomputer systems.

PubMed

Brinkhus, H B; Klinkenborg, H; Estorf, R; Weber, R

1983-01-01

A new programming language SORCA has been defined and a compiler has been written for Z80-based microcomputer systems with CP/M operating system. The language was developed to control behavioral experiments by external stimuli and by time schedule in real-time. Eight binary hardware input lines are sampled cyclically by the computer and can be used to sense switches, level detectors and other binary information, while 8 binary hardware output lines, that are cyclically updated, can be used to control relays, lamps, generate tones or for other purposes. The typical reaction time (cycle time) of a SORCA-program is 500 microseconds to 1 ms. All functions can be programmed as often as necessary. Included are the basic logic functions, counters, timers, majority gates and other complex functions. Parameters can be given as constants or as a result of a step function or of a random process (with Gaussian or equal distribution). Several tasks can be performed simultaneously. In addition, results of an experiment (e.g., number of reactions or latencies) can be measured and printed out on request or automatically. The language is easy to learn and can also be used for many other control purposes.

Implications of a quadratic stream definition in radiative transfer theory.

NASA Technical Reports Server (NTRS)

Whitney, C.

1972-01-01

An explicit definition of the radiation-stream concept is stated and applied to approximate the integro-differential equation of radiative transfer with a set of twelve coupled differential equations. Computational efficiency is enhanced by distributing the corresponding streams in three-dimensional space in a totally symmetric way. Polarization is then incorporated in this model. A computer program based on the model is briefly compared with a Monte Carlo program for simulation of horizon scans of the earth's atmosphere. It is found to be considerably faster.

Period change of a contact binary system RW Comae Berenices

NASA Astrophysics Data System (ADS)

Maithong, Wiraporn; Phao-ai, Parinda

2017-08-01

In this work, we studied about the period change of a contact binary system RW Comae Berenices. The binary system was observed on March 9th, 2016 by the 105 mm diameter of a refraction telescope with the DSLR digital camera at the Regional Observatory for the Public Nakhon Ratchasima, Thailand. The photometry used the IRIS program. The period change was analyzed by used the O-C diagram. The result shows that the period of the RW Comae Berenices is increasing with 1.89×10-3 seconds/year.

The non-avian theropod quadrate I: standardized terminology with an overview of the anatomy and function

PubMed Central

Araújo, Ricardo; Mateus, Octávio

2015-01-01

The quadrate of reptiles and most other tetrapods plays an important morphofunctional role by allowing the articulation of the mandible with the cranium. In Theropoda, the morphology of the quadrate is particularly complex and varies importantly among different clades of non-avian theropods, therefore conferring a strong taxonomic potential. Inconsistencies in the notation and terminology used in discussions of the theropod quadrate anatomy have been noticed, including at least one instance when no less than eight different terms were given to the same structure. A standardized list of terms and notations for each quadrate anatomical entity is proposed here, with the goal of facilitating future descriptions of this important cranial bone. In addition, an overview of the literature on quadrate function and pneumaticity in non-avian theropods is presented, along with a discussion of the inferences that could be made from this research. Specifically, the quadrate of the large majority of non-avian theropods is akinetic but the diagonally oriented intercondylar sulcus of the mandibular articulation allowed both rami of the mandible to move laterally when opening the mouth in many of theropods. Pneumaticity of the quadrate is also present in most averostran clades and the pneumatic chamber—invaded by the quadrate diverticulum of the mandibular arch pneumatic system—was connected to one or several pneumatic foramina on the medial, lateral, posterior, anterior or ventral sides of the quadrate. PMID:26401455

AESOP- INTERACTIVE DESIGN OF LINEAR QUADRATIC REGULATORS AND KALMAN FILTERS

NASA Technical Reports Server (NTRS)

Lehtinen, B.

1994-01-01

AESOP was developed to solve a number of problems associated with the design of controls and state estimators for linear time-invariant systems. The systems considered are modeled in state-variable form by a set of linear differential and algebraic equations with constant coefficients. Two key problems solved by AESOP are the linear quadratic regulator (LQR) design problem and the steady-state Kalman filter design problem. AESOP is designed to be used in an interactive manner. The user can solve design problems and analyze the solutions in a single interactive session. Both numerical and graphical information are available to the user during the session. The AESOP program is structured around a list of predefined functions. Each function performs a single computation associated with control, estimation, or system response determination. AESOP contains over sixty functions and permits the easy inclusion of user defined functions. The user accesses these functions either by inputting a list of desired functions in the order they are to be performed, or by specifying a single function to be performed. The latter case is used when the choice of function and function order depends on the results of previous functions. The available AESOP functions are divided into several general areas including: 1) program control, 2) matrix input and revision, 3) matrix formation, 4) open-loop system analysis, 5) frequency response, 6) transient response, 7) transient function zeros, 8) LQR and Kalman filter design, 9) eigenvalues and eigenvectors, 10) covariances, and 11) user-defined functions. The most important functions are those that design linear quadratic regulators and Kalman filters. The user interacts with AESOP when using these functions by inputting design weighting parameters and by viewing displays of designed system response. Support functions obtain system transient and frequency responses, transfer functions, and covariance matrices. AESOP can also provide the user with open-loop system information including stability, controllability, and observability. The AESOP program is written in FORTRAN IV for interactive execution and has been implemented on an IBM 3033 computer using TSS 370. As currently configured, AESOP has a central memory requirement of approximately 2 Megs of 8 bit bytes. Memory requirements can be reduced by redimensioning arrays in the AESOP program. Graphical output requires adaptation of the AESOP plot routines to whatever device is available. The AESOP program was developed in 1984.

Secondary School Advanced Mathematics, Chapter 8, Systems of Equations. Student's Text.

ERIC Educational Resources Information Center

Stanford Univ., CA. School Mathematics Study Group.

This text is the last of five in the Secondary School Advanced Mathematics (SSAM) series which was designed to meet the needs of students who have completed the Secondary School Mathematics (SSM) program, and wish to continue their study of mathematics. In this volume the solution of systems of linear and quadratic equations and inequalities in…

User's guide for the northern hardwood stand models: SIMSAP and SIMTIM

Treesearch

Dale S. Solomon; Richard A. Hosmer; Richard A. Hosmer

1987-01-01

SIMSAP and SlMTlM are computer programs that have been developed to simulate the stand growth and development of natural and treated evenaged northern hardwood stands. SIMSAP begins with species distributions by quality classes in sapling stands after regeneration. SIMTIM, the poletimber-sawtimber-harvest phase, uses stocking guides based on quadratic mean stand...

Measuring Human Performance on Clustering Problems: Some Potential Objective Criteria and Experimental Research Opportunities

ERIC Educational Resources Information Center

Brusco, Michael J.

2007-01-01

The study of human performance on discrete optimization problems has a considerable history that spans various disciplines. The two most widely studied problems are the Euclidean traveling salesperson problem and the quadratic assignment problem. The purpose of this paper is to outline a program of study for the measurement of human performance on…

W(h)ither Binary? A Seminar on the Organisation of Higher Education for the 21st Century. Report.

ERIC Educational Resources Information Center

Kerr, Edwin, Ed.; And Others

Replacement of Australia's binary system, which separates the roles of colleges and universities, is discussed in this seminar report. In addition to seven seminar papers, information is provided on the Australian higher education system, including access, the curriculum, research, fiscal accountability, and program relevance and quality. In the…

A Mathematical Study on “Additive Technique” Versus “Branch and Bound Technique” for Solving Binary Programming Problem

NASA Astrophysics Data System (ADS)

Sufahani, Suliadi; Ghazali Kamardan, M.; Saifullah Rusiman, Mohd; Mohamad, Mahathir; Khalid, Kamil; Ali, Maselan; Khalid, Kamal; Nawawi, MKM; Ahmad, Asmala

2018-04-01

A solid body needs adequate supplements from nourishment that we eat each day. Eating pretty much than what our body needs will prompt lack of healthy sustenance (under-nourishment and over-nourishment). In Malaysia, a few reviews have been directed to examine the wholesome status of Malaysians, particularly among youngsters and youths. However there are different methods for taking care of the menu arranging issue and in this paper Binary Programming (BP) is executed. Separately, “Additive Technique (AT)” and “Branch and Bound Technique (BBT)” are utilized as a part of BP. Both methodologies utilize diverse systems and might yield distinctive ideal arrangements. Along these lines, this study expects to build up a scientific model for eating regimen arranging that meets the essential supplement admission and look at the outcomes yield through additive substance and branch and bound methodologies. The information was gathered from different all inclusive schools and furthermore from the Ministry of Education. The model was illuminated by utilizing the Balas Algorithm through AT and Binary Programming through BBT.

Estimating population size with correlated sampling unit estimates

Treesearch

David C. Bowden; Gary C. White; Alan B. Franklin; Joseph L. Ganey

2003-01-01

Finite population sampling theory is useful in estimating total population size (abundance) from abundance estimates of each sampled unit (quadrat). We develop estimators that allow correlated quadrat abundance estimates, even for quadrats in different sampling strata. Correlated quadrat abundance estimates based on mark–recapture or distance sampling methods occur...

Quadratic soliton self-reflection at a quadratically nonlinear interface

NASA Astrophysics Data System (ADS)

Jankovic, Ladislav; Kim, Hongki; Stegeman, George; Carrasco, Silvia; Torner, Lluis; Katz, Mordechai

2003-11-01

The reflection of bulk quadratic solutions incident onto a quadratically nonlinear interface in periodically poled potassium titanyl phosphate was observed. The interface consisted of the boundary between two quasi-phase-matched regions displaced from each other by a half-period. At high intensities and small angles of incidence the soliton is reflected.

Self-Replicating Quadratics

ERIC Educational Resources Information Center

Withers, Christopher S.; Nadarajah, Saralees

2012-01-01

We show that there are exactly four quadratic polynomials, Q(x) = x [superscript 2] + ax + b, such that (x[superscript 2] + ax + b) (x[superscript 2] - ax + b) = (x[superscript 4] + ax[superscript 2] + b). For n = 1, 2, ..., these quadratic polynomials can be written as the product of N = 2[superscript n] quadratic polynomials in x[superscript…

A Path Algorithm for Constrained Estimation

PubMed Central

Zhou, Hua; Lange, Kenneth

2013-01-01

Many least-square problems involve affine equality and inequality constraints. Although there are a variety of methods for solving such problems, most statisticians find constrained estimation challenging. The current article proposes a new path-following algorithm for quadratic programming that replaces hard constraints by what are called exact penalties. Similar penalties arise in l1 regularization in model selection. In the regularization setting, penalties encapsulate prior knowledge, and penalized parameter estimates represent a trade-off between the observed data and the prior knowledge. Classical penalty methods of optimization, such as the quadratic penalty method, solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties!are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. The exact path-following method starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. Path following in Lasso penalized regression, in contrast, starts with a large value of the penalty constant and works its way downward. In both settings, inspection of the entire solution path is revealing. Just as with the Lasso and generalized Lasso, it is possible to plot the effective degrees of freedom along the solution path. For a strictly convex quadratic program, the exact penalty algorithm can be framed entirely in terms of the sweep operator of regression analysis. A few well-chosen examples illustrate the mechanics and potential of path following. This article has supplementary materials available online. PMID:24039382

Advanced fitness landscape analysis and the performance of memetic algorithms.

PubMed

Merz, Peter

2004-01-01

Memetic algorithms (MAs) have demonstrated very effective in combinatorial optimization. This paper offers explanations as to why this is so by investigating the performance of MAs in terms of efficiency and effectiveness. A special class of MAs is used to discuss efficiency and effectiveness for local search and evolutionary meta-search. It is shown that the efficiency of MAs can be increased drastically with the use of domain knowledge. However, effectiveness highly depends on the structure of the problem. As is well-known, identifying this structure is made easier with the notion of fitness landscapes: the local properties of the fitness landscape strongly influence the effectiveness of the local search while the global properties strongly influence the effectiveness of the evolutionary meta-search. This paper also introduces new techniques for analyzing the fitness landscapes of combinatorial problems; these techniques focus on the investigation of random walks in the fitness landscape starting at locally optimal solutions as well as on the escape from the basins of attractions of current local optima. It is shown for NK-landscapes and landscapes of the unconstrained binary quadratic programming problem (BQP) that a random walk to another local optimum can be used to explain the efficiency of recombination in comparison to mutation. Moreover, the paper shows that other aspects like the size of the basins of attractions of local optima are important for the efficiency of MAs and a local search escape analysis is proposed. These simple analysis techniques have several advantages over previously proposed statistical measures and provide valuable insight into the behaviour of MAs on different kinds of landscapes.

Method of optimization onboard communication network

NASA Astrophysics Data System (ADS)

Platoshin, G. A.; Selvesuk, N. I.; Semenov, M. E.; Novikov, V. M.

2018-02-01

In this article the optimization levels of onboard communication network (OCN) are proposed. We defined the basic parameters, which are necessary for the evaluation and comparison of modern OCN, we identified also a set of initial data for possible modeling of the OCN. We also proposed a mathematical technique for implementing the OCN optimization procedure. This technique is based on the principles and ideas of binary programming. It is shown that the binary programming technique allows to obtain an inherently optimal solution for the avionics tasks. An example of the proposed approach implementation to the problem of devices assignment in OCN is considered.

Orthogonality preserving infinite dimensional quadratic stochastic operators

DOE Office of Scientific and Technical Information (OSTI.GOV)

Akın, Hasan; Mukhamedov, Farrukh

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.

Graphical Solution of the Monic Quadratic Equation with Complex Coefficients

ERIC Educational Resources Information Center

Laine, A. D.

2015-01-01

There are many geometrical approaches to the solution of the quadratic equation with real coefficients. In this article it is shown that the monic quadratic equation with complex coefficients can also be solved graphically, by the intersection of two hyperbolas; one hyperbola being derived from the real part of the quadratic equation and one from…

Photometric Analysis and Modeling of Five Mass-Transferring Binary Systems

NASA Astrophysics Data System (ADS)

Geist, Emily; Beaky, Matthew; Jamison, Kate

2018-01-01

In overcontact eclipsing binary systems, both stellar components have overfilled their Roche lobes, resulting in a dumbbell-shaped shared envelope. Mass transfer is common in overcontact binaries, which can be observed as a slow change on the rotation period of the system.We studied five overcontact eclipsing binary systems with evidence of period change, and thus likely mass transfer between the components, identified by Nelson (2014): V0579 Lyr, KN Vul, V0406 Lyr, V2240 Cyg, and MS Her. We used the 31-inch NURO telescope at Lowell Observatory in Flagstaff, Arizona to obtain images in B,V,R, and I filters for V0579 Lyr, and the 16-inch Meade LX200GPS telescope with attached SBIG ST-8XME CCD camera at Juniata College in Huntingdon, Pennsylvania to image KN Vul, V0406 Lyr, V2240 Cyg, and MS Her, also in B,V,R, and I.After data reduction, we created light curves for each of the systems and modeled the eclipsing binaries using the BinaryMaker3 and PHOEBE programs to determine their fundamental physical parameters for the first time. Complete light curves and preliminary models for each of these neglected eclipsing binary systems will be presented.

The 2001 U.S. Naval Observatory Double Star CD-Rom. III. The Third Catalog of Interferometric Measurements of Binary Stars

DTIC Science & Technology

2001-12-01

CHARA southern speckle program from 1989 to 1996 (cf. Hartkopf et al. 1996), and by the more recent speckle e†orts of Horch and colleagues (cf. Horch ...Mason, B. D. 2001, Third Catalog of Interferometric Measurements of Binary Stars (CHARA Contrib. No. 4) (Atlanta : Georgia State Univ.) Horch , E

Improved Bounds on Violation of the Strong Equivalence Principle

NASA Technical Reports Server (NTRS)

Arzoumanian, Z.

2002-01-01

I describe a unique, 20-year-long timing program for the binary pulsar B0655+64, the stalwart control experiment for measurements of gravitational radiation damping in relativistic neutron-star binaries. Observed limits on evolution of the B0655+64 orbit provide new bounds on the existence of dipolar gravitational radiation, and hence on violation of the Strong Equivalence Principle.

PatternCoder: A Programming Support Tool for Learning Binary Class Associations and Design Patterns

ERIC Educational Resources Information Center

Paterson, J. H.; Cheng, K. F.; Haddow, J.

2009-01-01

PatternCoder is a software tool to aid student understanding of class associations. It has a wizard-based interface which allows students to select an appropriate binary class association or design pattern for a given problem. Java code is then generated which allows students to explore the way in which the class associations are implemented in a…

A New Light Curve and Analysis of the Long Period Eclipsing Binary BF Draconis

NASA Astrophysics Data System (ADS)

Wolf, G. W.; Craig, L. E.; Caffey, J. F.

1999-01-01

The star BF Draconis was found to be an eclipsing binary by Strohmeier, Knigge and Ott (1962) and originally thought to be an Algol-type system with a period of 5.6 days. A spectrographic study by Imbert (1985) showed that the period was actually double this value and that the system consisted of two well-separated, almost-equal F-type stars in elliptical orbit. Diethelm, Wolf and Agerer (1993) later published a preliminary light curve of this system showing minima of unequal depth and width with a displaced secondary, confirming the elliptical orbit but disagreeing with Imbert on the specific orbital parameters. As a part of our long-term program of obtaining improved light curves of double-lined spectroscopic and eclipsing binaries, we have observed BF Draconis for the past four years using the 0.4 meter telescope at the Baker Observatory of Southwest Missouri State University. Complete light curves in the Cousins BVRI passbands have been obtained with our Photometrics CCD system, and a new model and orbital parameters for the binary have been determined using the Wilson-Devinney program. This research has been supported by NSF Grants AST-9315061 and AST-9605822 and NASA Grant NGT5-40060.

FASTER 3: A generalized-geometry Monte Carlo computer program for the transport of neutrons and gamma rays. Volume 1: Summary report

NASA Technical Reports Server (NTRS)

Jordan, T. M.

1970-01-01

The theory used in FASTER-III, a Monte Carlo computer program for the transport of neutrons and gamma rays in complex geometries, is outlined. The program includes the treatment of geometric regions bounded by quadratic and quadric surfaces with multiple radiation sources which have specified space, angle, and energy dependence. The program calculates, using importance sampling, the resulting number and energy fluxes at specified point, surface, and volume detectors. It can also calculate minimum weight shield configuration meeting a specified dose rate constraint. Results are presented for sample problems involving primary neutron, and primary and secondary photon, transport in a spherical reactor shield configuration.

On the orbital period of the magnetic cataclysmic variable HU Aquarii

NASA Astrophysics Data System (ADS)

Vogel, J.; Schwope, A.; Schwarz, R.; Kanbach, G.; Dhillon, V. S.; Marsh, T. R.

2008-02-01

We present an analysis of ULTRACAM light curves of the magnetic cataclysmic variable HU Aquarii which were taken at the VLT in May 2005. Since the light curves were serendipitously obtained during a low state, they allowed us to determine the binary and the stellar parameters with high accuracy. The light curve was decomposed into the components originating from the accretion spot, the photosphere surrounding it and the white dwarf itself, which allowed us to extract the eclipse light curve for the pure white dwarf. Combined with high-time resolution observations with different instruments over a 12 year baseline it was possible to get exact eclipse timings of the white dwarf and thus establish a significant deviation from a linear ephemeris. If described by a quadratic term, the period decreases by -1.13×10-11 ss-1. Interpreting this change in period as a pure angular momentum loss (AML) effect, the rate of J˙ = -4.9×1035 erg is much too high to be explained by gravitational radiation alone.

Adaptive and automatic red blood cell counting method based on microscopic hyperspectral imaging technology

NASA Astrophysics Data System (ADS)

Liu, Xi; Zhou, Mei; Qiu, Song; Sun, Li; Liu, Hongying; Li, Qingli; Wang, Yiting

2017-12-01

Red blood cell counting, as a routine examination, plays an important role in medical diagnoses. Although automated hematology analyzers are widely used, manual microscopic examination by a hematologist or pathologist is still unavoidable, which is time-consuming and error-prone. This paper proposes a full-automatic red blood cell counting method which is based on microscopic hyperspectral imaging of blood smears and combines spatial and spectral information to achieve high precision. The acquired hyperspectral image data of the blood smear in the visible and near-infrared spectral range are firstly preprocessed, and then a quadratic blind linear unmixing algorithm is used to get endmember abundance images. Based on mathematical morphological operation and an adaptive Otsu’s method, a binaryzation process is performed on the abundance images. Finally, the connected component labeling algorithm with magnification-based parameter setting is applied to automatically select the binary images of red blood cell cytoplasm. Experimental results show that the proposed method can perform well and has potential for clinical applications.

Boosting quantum annealer performance via sample persistence

NASA Astrophysics Data System (ADS)

Karimi, Hamed; Rosenberg, Gili

2017-07-01

We propose a novel method for reducing the number of variables in quadratic unconstrained binary optimization problems, using a quantum annealer (or any sampler) to fix the value of a large portion of the variables to values that have a high probability of being optimal. The resulting problems are usually much easier for the quantum annealer to solve, due to their being smaller and consisting of disconnected components. This approach significantly increases the success rate and number of observations of the best known energy value in samples obtained from the quantum annealer, when compared with calling the quantum annealer without using it, even when using fewer annealing cycles. Use of the method results in a considerable improvement in success metrics even for problems with high-precision couplers and biases, which are more challenging for the quantum annealer to solve. The results are further enhanced by applying the method iteratively and combining it with classical pre-processing. We present results for both Chimera graph-structured problems and embedded problems from a real-world application.

Multi-Task Learning with Low Rank Attribute Embedding for Multi-Camera Person Re-Identification.

PubMed

Su, Chi; Yang, Fan; Zhang, Shiliang; Tian, Qi; Davis, Larry Steven; Gao, Wen

2018-05-01

We propose Multi-Task Learning with Low Rank Attribute Embedding (MTL-LORAE) to address the problem of person re-identification on multi-cameras. Re-identifications on different cameras are considered as related tasks, which allows the shared information among different tasks to be explored to improve the re-identification accuracy. The MTL-LORAE framework integrates low-level features with mid-level attributes as the descriptions for persons. To improve the accuracy of such description, we introduce the low-rank attribute embedding, which maps original binary attributes into a continuous space utilizing the correlative relationship between each pair of attributes. In this way, inaccurate attributes are rectified and missing attributes are recovered. The resulting objective function is constructed with an attribute embedding error and a quadratic loss concerning class labels. It is solved by an alternating optimization strategy. The proposed MTL-LORAE is tested on four datasets and is validated to outperform the existing methods with significant margins.

The mechanical properties of high speed GTAW weld and factors of nonlinear multiple regression model under external transverse magnetic field

NASA Astrophysics Data System (ADS)

Lu, Lin; Chang, Yunlong; Li, Yingmin; He, Youyou

2013-05-01

A transverse magnetic field was introduced to the arc plasma in the process of welding stainless steel tubes by high-speed Tungsten Inert Gas Arc Welding (TIG for short) without filler wire. The influence of external magnetic field on welding quality was investigated. 9 sets of parameters were designed by the means of orthogonal experiment. The welding joint tensile strength and form factor of weld were regarded as the main standards of welding quality. A binary quadratic nonlinear regression equation was established with the conditions of magnetic induction and flow rate of Ar gas. The residual standard deviation was calculated to adjust the accuracy of regression model. The results showed that, the regression model was correct and effective in calculating the tensile strength and aspect ratio of weld. Two 3D regression models were designed respectively, and then the impact law of magnetic induction on welding quality was researched.

Dynamic Geometry Software and Tracing Tangents in the Context of the Mean Value Theorem: Technique and Theory Production

ERIC Educational Resources Information Center

Martínez-Hernández, Cesar; Ulloa-Azpeitia, Ricardo

2017-01-01

Based on the theoretical elements of the instrumental approach to tool use known as Task-Technique-Theory (Artigue, 2002), this paper analyses and discusses the performance of graduate students enrolled in a Teacher Training program. The latter performance relates to tracing tangent lines to the curve of a quadratic function in Dynamic Geometry…

The Time-domain Spectroscopic Survey: Target Selection for Repeat Spectroscopy

NASA Astrophysics Data System (ADS)

MacLeod, Chelsea L.; Green, Paul J.; Anderson, Scott F.; Eracleous, Michael; Ruan, John J.; Runnoe, Jessie; Nielsen Brandt, William; Badenes, Carles; Greene, Jenny; Morganson, Eric; Schmidt, Sarah J.; Schwope, Axel; Shen, Yue; Amaro, Rachael; Lebleu, Amy; Filiz Ak, Nurten; Grier, Catherine J.; Hoover, Daniel; McGraw, Sean M.; Dawson, Kyle; Hall, Patrick B.; Hawley, Suzanne L.; Mariappan, Vivek; Myers, Adam D.; Pâris, Isabelle; Schneider, Donald P.; Stassun, Keivan G.; Bershady, Matthew A.; Blanton, Michael R.; Seo, Hee-Jong; Tinker, Jeremy; Fernández-Trincado, J. G.; Chambers, Kenneth; Kaiser, Nick; Kudritzki, R.-P.; Magnier, Eugene; Metcalfe, Nigel; Waters, Chris Z.

2018-01-01

As astronomers increasingly exploit the information available in the time domain, spectroscopic variability in particular opens broad new channels of investigation. Here we describe the selection algorithms for all targets intended for repeat spectroscopy in the Time Domain Spectroscopic Survey (TDSS), part of the extended Baryon Oscillation Spectroscopic Survey within the Sloan Digital Sky Survey (SDSS)-IV. Also discussed are the scientific rationale and technical constraints leading to these target selections. The TDSS includes a large “repeat quasar spectroscopy” (RQS) program delivering ∼13,000 repeat spectra of confirmed SDSS quasars, and several smaller “few-epoch spectroscopy” (FES) programs targeting specific classes of quasars as well as stars. The RQS program aims to provide a large and diverse quasar data set for studying variations in quasar spectra on timescales of years, a comparison sample for the FES quasar programs, and an opportunity for discovering rare, serendipitous events. The FES programs cover a wide variety of phenomena in both quasars and stars. Quasar FES programs target broad absorption line quasars, high signal-to-noise ratio normal broad line quasars, quasars with double-peaked or very asymmetric broad emission line profiles, binary supermassive black hole candidates, and the most photometrically variable quasars. Strongly variable stars are also targeted for repeat spectroscopy, encompassing many types of eclipsing binary systems, and classical pulsators like RR Lyrae. Other stellar FES programs allow spectroscopic variability studies of active ultracool dwarf stars, dwarf carbon stars, and white dwarf/M dwarf spectroscopic binaries. We present example TDSS spectra and describe anticipated sample sizes and results.

Semisupervised Support Vector Machines With Tangent Space Intrinsic Manifold Regularization.

PubMed

Sun, Shiliang; Xie, Xijiong

2016-09-01

Semisupervised learning has been an active research topic in machine learning and data mining. One main reason is that labeling examples is expensive and time-consuming, while there are large numbers of unlabeled examples available in many practical problems. So far, Laplacian regularization has been widely used in semisupervised learning. In this paper, we propose a new regularization method called tangent space intrinsic manifold regularization. It is intrinsic to data manifold and favors linear functions on the manifold. Fundamental elements involved in the formulation of the regularization are local tangent space representations, which are estimated by local principal component analysis, and the connections that relate adjacent tangent spaces. Simultaneously, we explore its application to semisupervised classification and propose two new learning algorithms called tangent space intrinsic manifold regularized support vector machines (TiSVMs) and tangent space intrinsic manifold regularized twin SVMs (TiTSVMs). They effectively integrate the tangent space intrinsic manifold regularization consideration. The optimization of TiSVMs can be solved by a standard quadratic programming, while the optimization of TiTSVMs can be solved by a pair of standard quadratic programmings. The experimental results of semisupervised classification problems show the effectiveness of the proposed semisupervised learning algorithms.

Concurrent topology optimization for minimization of total mass considering load-carrying capabilities and thermal insulation simultaneously

NASA Astrophysics Data System (ADS)

Long, Kai; Wang, Xuan; Gu, Xianguang

2017-09-01

The present work introduces a novel concurrent optimization formulation to meet the requirements of lightweight design and various constraints simultaneously. Nodal displacement of macrostructure and effective thermal conductivity of microstructure are regarded as the constraint functions, which means taking into account both the load-carrying capabilities and the thermal insulation properties. The effective properties of porous material derived from numerical homogenization are used for macrostructural analysis. Meanwhile, displacement vectors of macrostructures from original and adjoint load cases are used for sensitivity analysis of the microstructure. Design variables in the form of reciprocal functions of relative densities are introduced and used for linearization of the constraint function. The objective function of total mass is approximately expressed by the second order Taylor series expansion. Then, the proposed concurrent optimization problem is solved using a sequential quadratic programming algorithm, by splitting into a series of sub-problems in the form of the quadratic program. Finally, several numerical examples are presented to validate the effectiveness of the proposed optimization method. The various effects including initial designs, prescribed limits of nodal displacement, and effective thermal conductivity on optimized designs are also investigated. An amount of optimized macrostructures and their corresponding microstructures are achieved.

Quadratic Optimisation with One Quadratic Equality Constraint

DTIC Science & Technology

2010-06-01

This report presents a theoretical framework for minimising a quadratic objective function subject to a quadratic equality constraint. The first part of the report gives a detailed algorithm which computes the global minimiser without calling special nonlinear optimisation solvers. The second part of the report shows how the developed theory can be applied to solve the time of arrival geolocation problem.

Hidden supersymmetry and quadratic deformations of the space-time conformal superalgebra

NASA Astrophysics Data System (ADS)

Yates, L. A.; Jarvis, P. D.

2018-04-01

We analyze the structure of the family of quadratic superalgebras, introduced in Jarvis et al (2011 J. Phys. A: Math. Theor. 44 235205), for the quadratic deformations of N  =  1 space-time conformal supersymmetry. We characterize in particular the ‘zero-step’ modules for this case. In such modules, the odd generators vanish identically, and the quadratic superalgebra is realized on a single irreducible representation of the even subalgebra (which is a Lie algebra). In the case under study, the quadratic deformations of N  =  1 space-time conformal supersymmetry, it is shown that each massless positive energy unitary irreducible representation (in the standard classification of Mack), forms such a zero-step module, for an appropriate parameter choice amongst the quadratic family (with vanishing central charge). For these massless particle multiplets therefore, quadratic supersymmetry is unbroken, in that the supersymmetry generators annihilate all physical states (including the vacuum state), while at the same time, superpartners do not exist.

Linear state feedback, quadratic weights, and closed loop eigenstructures. M.S. Thesis

NASA Technical Reports Server (NTRS)

Thompson, P. M.

1979-01-01

Results are given on the relationships between closed loop eigenstructures, state feedback gain matrices of the linear state feedback problem, and quadratic weights of the linear quadratic regulator. Equations are derived for the angles of general multivariable root loci and linear quadratic optimal root loci, including angles of departure and approach. The generalized eigenvalue problem is used for the first time to compute angles of approach. Equations are also derived to find the sensitivity of closed loop eigenvalues and the directional derivatives of closed loop eigenvectors (with respect to a scalar multiplying the feedback gain matrix or the quadratic control weight). An equivalence class of quadratic weights that produce the same asymptotic eigenstructure is defined, sufficient conditions to be in it are given, a canonical element is defined, and an algorithm to find it is given. The behavior of the optimal root locus in the nonasymptotic region is shown to be different for quadratic weights with the same asymptotic properties.

Long term evolution of surface features on the unusual close binary V361 Lyr

NASA Astrophysics Data System (ADS)

Lister, T. A.

2009-02-01

V361 Lyr has been recognized as an unusual, possibly unique, pre-contact binary which is though to be evolving from a detached binary system into a W UMa contact binary system due to Angular Momentum Loss (AML) and mass transfer. The mass transfer and resulting hot spot on the secondary star allow the physics of accretion to be studied without the normal difficulties of disks and winds that are present in T Tauri stars. I present light curves obtained over a 10 year period as part of long term monitoring program obtained with a variety of telescopes, collect all available times of minima from the literature along with those determined from the light curves and determine the rate of period change.

An improved multiple linear regression and data analysis computer program package

NASA Technical Reports Server (NTRS)

Sidik, S. M.

1972-01-01

NEWRAP, an improved version of a previous multiple linear regression program called RAPIER, CREDUC, and CRSPLT, allows for a complete regression analysis including cross plots of the independent and dependent variables, correlation coefficients, regression coefficients, analysis of variance tables, t-statistics and their probability levels, rejection of independent variables, plots of residuals against the independent and dependent variables, and a canonical reduction of quadratic response functions useful in optimum seeking experimentation. A major improvement over RAPIER is that all regression calculations are done in double precision arithmetic.

Computer-Generated Phase Diagrams for Binary Mixtures.

ERIC Educational Resources Information Center

Jolls, Kenneth R.; And Others

1983-01-01

Computer programs that generate projections of thermodynamic phase surfaces through computer graphics were used to produce diagrams representing properties of water and steam and the pressure-volume-temperature behavior of most of the common equations of state. The program, program options emphasizing thermodynamic features of interest, and…

Constrained binary classification using ensemble learning: an application to cost-efficient targeted PrEP strategies.

PubMed

Zheng, Wenjing; Balzer, Laura; van der Laan, Mark; Petersen, Maya

2018-01-30

Binary classification problems are ubiquitous in health and social sciences. In many cases, one wishes to balance two competing optimality considerations for a binary classifier. For instance, in resource-limited settings, an human immunodeficiency virus prevention program based on offering pre-exposure prophylaxis (PrEP) to select high-risk individuals must balance the sensitivity of the binary classifier in detecting future seroconverters (and hence offering them PrEP regimens) with the total number of PrEP regimens that is financially and logistically feasible for the program. In this article, we consider a general class of constrained binary classification problems wherein the objective function and the constraint are both monotonic with respect to a threshold. These include the minimization of the rate of positive predictions subject to a minimum sensitivity, the maximization of sensitivity subject to a maximum rate of positive predictions, and the Neyman-Pearson paradigm, which minimizes the type II error subject to an upper bound on the type I error. We propose an ensemble approach to these binary classification problems based on the Super Learner methodology. This approach linearly combines a user-supplied library of scoring algorithms, with combination weights and a discriminating threshold chosen to minimize the constrained optimality criterion. We then illustrate the application of the proposed classifier to develop an individualized PrEP targeting strategy in a resource-limited setting, with the goal of minimizing the number of PrEP offerings while achieving a minimum required sensitivity. This proof of concept data analysis uses baseline data from the ongoing Sustainable East Africa Research in Community Health study. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

Menu-Driven Solver Of Linear-Programming Problems

NASA Technical Reports Server (NTRS)

Viterna, L. A.; Ferencz, D.

1992-01-01

Program assists inexperienced user in formulating linear-programming problems. A Linear Program Solver (ALPS) computer program is full-featured LP analysis program. Solves plain linear-programming problems as well as more-complicated mixed-integer and pure-integer programs. Also contains efficient technique for solution of purely binary linear-programming problems. Written entirely in IBM's APL2/PC software, Version 1.01. Packed program contains licensed material, property of IBM (copyright 1988, all rights reserved).

Colliding stellar winds in O-type close binary systems

NASA Technical Reports Server (NTRS)

Gies, Douglas R.

1991-01-01

A study of the stellar wind properties of O-type close binary systems is presented. The main objective of this program was to search for colliding winds in four systems, AO Cas, iota Ori, Plaskett's star, and 29 UW CMa, through an examination of high dispersion UV spectra from IUE and optical spectra of the H alpha and He I lambda 6678 emission lines.

Journal of Chemical Education: Software.

ERIC Educational Resources Information Center

Journal of Chemical Education, 1988

1988-01-01

Describes a chemistry software program that emulates a modern binary gradient HPLC system with reversed phase column behavior. Allows for solvent selection, adjustment of gradient program, column selection, detectory selection, handling of computer sample data, and sample preparation. (MVL)

Scaling Laws for the Multidimensional Burgers Equation with Quadratic External Potential

NASA Astrophysics Data System (ADS)

Leonenko, N. N.; Ruiz-Medina, M. D.

2006-07-01

The reordering of the multidimensional exponential quadratic operator in coordinate-momentum space (see X. Wang, C.H. Oh and L.C. Kwek (1998). J. Phys. A.: Math. Gen. 31:4329-4336) is applied to derive an explicit formulation of the solution to the multidimensional heat equation with quadratic external potential and random initial conditions. The solution to the multidimensional Burgers equation with quadratic external potential under Gaussian strongly dependent scenarios is also obtained via the Hopf-Cole transformation. The limiting distributions of scaling solutions to the multidimensional heat and Burgers equations with quadratic external potential are then obtained under such scenarios.

Tensor contraction engine: Abstraction and automated parallel implementation of configuration-interaction, coupled-cluster, and many-body perturbation theories

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hirata, So

2003-11-20

We develop a symbolic manipulation program and program generator (Tensor Contraction Engine or TCE) that automatically derives the working equations of a well-defined model of second-quantized many-electron theories and synthesizes efficient parallel computer programs on the basis of these equations. Provided an ansatz of a many-electron theory model, TCE performs valid contractions of creation and annihilation operators according to Wick's theorem, consolidates identical terms, and reduces the expressions into the form of multiple tensor contractions acted by permutation operators. Subsequently, it determines the binary contraction order for each multiple tensor contraction with the minimal operation and memory cost, factorizes commonmore » binary contractions (defines intermediate tensors), and identifies reusable intermediates. The resulting ordered list of binary tensor contractions, additions, and index permutations is translated into an optimized program that is combined with the NWChem and UTChem computational chemistry software packages. The programs synthesized by TCE take advantage of spin symmetry, Abelian point-group symmetry, and index permutation symmetry at every stage of calculations to minimize the number of arithmetic operations and storage requirement, adjust the peak local memory usage by index range tiling, and support parallel I/O interfaces and dynamic load balancing for parallel executions. We demonstrate the utility of TCE through automatic derivation and implementation of parallel programs for various models of configuration-interaction theory (CISD, CISDT, CISDTQ), many-body perturbation theory [MBPT(2), MBPT(3), MBPT(4)], and coupled-cluster theory (LCCD, CCD, LCCSD, CCSD, QCISD, CCSDT, and CCSDTQ).« less

Estimating the quadratic mean diameter of fine woody debris for forest type groups of the United States

Treesearch

Christopher W. Woodall; Vicente J. Monleon

2009-01-01

The Forest Inventory and Analysis program of the Forest Service, U.S. Department of Agriculture conducts a national inventory of fine woody debris (FWD); however, the sampling protocols involve tallying only the number of FWD pieces by size class that intersect a sampling transect with no measure of actual size. The line intersect estimator used with those samples...

A design procedure and handling quality criteria for lateral directional flight control systems

NASA Technical Reports Server (NTRS)

Stein, G.; Henke, A. H.

1972-01-01

A practical design procedure for aircraft augmentation systems is described based on quadratic optimal control technology and handling-quality-oriented cost functionals. The procedure is applied to the design of a lateral-directional control system for the F4C aircraft. The design criteria, design procedure, and final control system are validated with a program of formal pilot evaluation experiments.

Correction factors for on-line microprobe analysis of multielement alloy systems

NASA Technical Reports Server (NTRS)

Unnam, J.; Tenney, D. R.; Brewer, W. D.

1977-01-01

An on-line correction technique was developed for the conversion of electron probe X-ray intensities into concentrations of emitting elements. This technique consisted of off-line calculation and representation of binary interaction data which were read into an on-line minicomputer to calculate variable correction coefficients. These coefficients were used to correct the X-ray data without significantly increasing computer core requirements. The binary interaction data were obtained by running Colby's MAGIC 4 program in the reverse mode. The data for each binary interaction were represented by polynomial coefficients obtained by least-squares fitting a third-order polynomial. Polynomial coefficients were generated for most of the common binary interactions at different accelerating potentials and are included. Results are presented for the analyses of several alloy standards to demonstrate the applicability of this correction procedure.

A Novel Partial Sequence Alignment Tool for Finding Large Deletions

PubMed Central

Aruk, Taner; Ustek, Duran; Kursun, Olcay

2012-01-01

Finding large deletions in genome sequences has become increasingly more useful in bioinformatics, such as in clinical research and diagnosis. Although there are a number of publically available next generation sequencing mapping and sequence alignment programs, these software packages do not correctly align fragments containing deletions larger than one kb. We present a fast alignment software package, BinaryPartialAlign, that can be used by wet lab scientists to find long structural variations in their experiments. For BinaryPartialAlign, we make use of the Smith-Waterman (SW) algorithm with a binary-search-based approach for alignment with large gaps that we called partial alignment. BinaryPartialAlign implementation is compared with other straight-forward applications of SW. Simulation results on mtDNA fragments demonstrate the effectiveness (runtime and accuracy) of the proposed method. PMID:22566777

Geometric Approaches to Quadratic Equations from Other Times and Places.

ERIC Educational Resources Information Center

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)

PIFCGT: A PIF autopilot design program for general aviation aircraft

NASA Technical Reports Server (NTRS)

Broussard, J. R.

1983-01-01

This report documents the PIFCGT computer program. In FORTRAN, PIFCGT is a computer design aid for determing Proportional-Integral-Filter (PIF) control laws for aircraft autopilots implemented with a Command Generator Tracker (CGT). The program uses Linear-Quadratic-Regulator synthesis algorithms to determine feedback gains, and includes software to solve the feedforward matrix equation which is useful in determining the command generator tracker feedforward gains. The program accepts aerodynamic stability derivatives and computes the corresponding aerodynamic linear model. The nine autopilot modes that can be designed include four maneuver modes (ROLL SEL, PITCH SEL, HDG SEL, ALT SEL), four final approach models (APR GS, APR LOCI, APR LOCR, APR LOCP), and a BETA HOLD mode. The program has been compiled and executed on a CDC computer.

The massive multiple system HD 64315

NASA Astrophysics Data System (ADS)

Lorenzo, J.; Simón-Díaz, S.; Negueruela, I.; Vilardell, F.; Garcia, M.; Evans, C. J.; Montes, D.

2017-10-01

Context. The O6 Vn star HD 64315 is believed to belong to the star-forming region known as NGC 2467, but previous distance estimates do not support this association. Moreover, it has been identified as a spectroscopic binary, but existing data support contradictory values for its orbital period. Aims: We explore the multiple nature of this star with the aim of determining its distance, and understanding its connection to NGC 2467. Methods: A total of 52 high-resolution spectra have been gathered over a decade. We use their analysis, in combination with the photometric data from All Sky Automated Survey and Hipparcos catalogues, to conclude that HD 64315 is composed of at least two spectroscopic binaries, one of which is an eclipsing binary. We have developed our own program to fit four components to the combined line shapes. Once the four radial velocities were derived, we obtained a model to fit the radial-velocity curves using the Spectroscopic Binary Orbit Program (SBOP). We then implemented the radial velocities of the eclipsing binary and the light curves in the Wilson-Devinney code iteratively to derive stellar parameters for its components. We were also able to analyse the non-eclipsing binary, and to derive minimum masses for its components which dominate the system flux. Results: HD 64315 contains two binary systems, one of which is an eclipsing binary. The two binaries are separated by 0.09 arcsec (or 500 AU) if the most likely distance to the system, 5 kpc, is considered. The presence of fainter companions is not excluded by current observations. The non-eclipsing binary (HD 64315 AaAb) has a period of 2.70962901 ± 0.00000021 d. Its components are hotter than those of the eclipsing binary, and dominate the appearance of the system. The eclipsing binary (HD 64315 BaBb) has a shorter period of 1.0189569 ± 0.0000008 d. We derive masses of 14.6 ± 2.3 M⊙ for both components of the BaBb system. They are almost identical; both stars are overfilling their respective Roche lobes, and share a common envelope in an overcontact configuration. The non-eclipsing binary is a detached system composed of two stars with spectral types around O6 V with minimum masses of 10.8 M⊙ and 10.2 M⊙, and likely masses ≈ 30 M⊙. Conclusions: HD 64315 provides a cautionary tale about high-mass star isolation and multiplicity. Its total mass is likely above 90M⊙, but it seems to have formed without an accompanying cluster. It contains one the most massive overcontact binaries known, a likely merger progenitor in a very wide multiple system. Based on observations obtained at the European Southern Observatory under programmes 078.D-0665(A), 082-D.0136 and 093.A-9001(A). Based on observations made with the Nordic Optical Telescope, operated on the island of La Palma jointly by Denmark, Finland, Iceland, Norway, and Sweden, in the Spanish Observatorio del Roque de los Muchachos of the Instituto de Astrofísica de Canarias.

MARVELS Radial Velocity Solutions to Seven Kepler Eclipsing Binaries

NASA Astrophysics Data System (ADS)

Heslar, Michael Francis; Thomas, Neil B.; Ge, Jian; Ma, Bo; Herczeg, Alec; Reyes, Alan; SDSS-III MARVELS Team

2016-01-01

Eclipsing binaries serve momentous purposes to improve the basis of understanding aspects of stellar astrophysics, such as the accurate calculation of the physical parameters of stars and the enigmatic mass-radius relationship of M and K dwarfs. We report the investigation results of 7 eclipsing binary candidates, initially identified by the Kepler mission, overlapped with the radial velocity observations from the SDSS-III Multi-Object APO Radial-Velocity Exoplanet Large-Area Survey (MARVELS). The RV extractions and spectroscopic solutions of these eclipsing binaries were generated by the University of Florida's 1D data pipeline with a median RV precision of ~60-100 m/s, which was utilized for the DR12 data release. We performed the cross-reference fitting of the MARVELS RV data and the Kepler photometric fluxes obtained from the Kepler Eclipsing Binary Catalog (V2) and modelled the 7 eclipsing binaries in the BinaryMaker3 and PHOEBE programs. This analysis accurately determined the absolute physical and orbital parameters of each binary. Most of the companion stars were determined to have masses of K and M dwarf stars (0.3-0.8 M⊙), and allowed for an investigation into the mass-radius relationship of M and K dwarfs. Among the cases are KIC 9163796, a 122.2 day period "heartbeat star", a recently-discovered class of eccentric binaries known for tidal distortions and pulsations, with a high eccentricity (e~0.75) and KIC 11244501, a 0.29 day period, contact binary with a double-lined spectrum and mass ratio (q~0.45). We also report on the possible reclassification of 2 Kepler eclipsing binary candidates as background eclipsing binaries based on the analysis of the flux measurements, flux ratios of the spectroscopic and photometric solutions, the differences in the FOVs, the image processing of Kepler, and RV and spectral analysis of MARVELS.

ALPS: A Linear Program Solver

NASA Technical Reports Server (NTRS)

Ferencz, Donald C.; Viterna, Larry A.

1991-01-01

ALPS is a computer program which can be used to solve general linear program (optimization) problems. ALPS was designed for those who have minimal linear programming (LP) knowledge and features a menu-driven scheme to guide the user through the process of creating and solving LP formulations. Once created, the problems can be edited and stored in standard DOS ASCII files to provide portability to various word processors or even other linear programming packages. Unlike many math-oriented LP solvers, ALPS contains an LP parser that reads through the LP formulation and reports several types of errors to the user. ALPS provides a large amount of solution data which is often useful in problem solving. In addition to pure linear programs, ALPS can solve for integer, mixed integer, and binary type problems. Pure linear programs are solved with the revised simplex method. Integer or mixed integer programs are solved initially with the revised simplex, and the completed using the branch-and-bound technique. Binary programs are solved with the method of implicit enumeration. This manual describes how to use ALPS to create, edit, and solve linear programming problems. Instructions for installing ALPS on a PC compatible computer are included in the appendices along with a general introduction to linear programming. A programmers guide is also included for assistance in modifying and maintaining the program.

The Eclipsing Binary On-Line Atlas (EBOLA)

NASA Astrophysics Data System (ADS)

Bradstreet, D. H.; Steelman, D. P.; Sanders, S. J.; Hargis, J. R.

2004-05-01

In conjunction with the upcoming release of \\it Binary Maker 3.0, an extensive on-line database of eclipsing binaries is being made available. The purposes of the atlas are: \\begin {enumerate} Allow quick and easy access to information on published eclipsing binaries. Amass a consistent database of light and radial velocity curve solutions to aid in solving new systems. Provide invaluable querying capabilities on all of the parameters of the systems so that informative research can be quickly accomplished on a multitude of published results. Aid observers in establishing new observing programs based upon stars needing new light and/or radial velocity curves. Encourage workers to submit their published results so that others may have easy access to their work. Provide a vast but easily accessible storehouse of information on eclipsing binaries to accelerate the process of understanding analysis techniques and current work in the field. \\end {enumerate} The database will eventually consist of all published eclipsing binaries with light curve solutions. The following information and data will be supplied whenever available for each binary: original light curves in all bandpasses, original radial velocity observations, light curve parameters, RA and Dec, V-magnitudes, spectral types, color indices, periods, binary type, 3D representation of the system near quadrature, plots of the original light curves and synthetic models, plots of the radial velocity observations with theoretical models, and \\it Binary Maker 3.0 data files (parameter, light curve, radial velocity). The pertinent references for each star are also given with hyperlinks directly to the papers via the NASA Abstract website for downloading, if available. In addition the Atlas has extensive searching options so that workers can specifically search for binaries with specific characteristics. The website has more than 150 systems already uploaded. The URL for the site is http://ebola.eastern.edu/.

Formation of Thorne-Żytkow objects in close binaries

NASA Astrophysics Data System (ADS)

Hutilukejiang, Bumareyamu; Zhu, Chunhua; Wang, Zhaojun; Lü, Guoliang

2018-04-01

Thorne-Żytkow objects (TŻOs), originally proposed by Thorne and Żytkow, may form as a result of unstable mass transfer in a massive X-ray binary after a neutron star (NS) is engulfed in the envelope of its companion star. Using a rapid binary evolution program and the Monte Carlo method, we simulated the formation of TŻOs in close binary stars. The Galactic birth rate of TŻOs is about 1.5× 10^{-4} yr^{-1}. Their progenitors may be composed of a NS and a main-sequence star, a star in the Hertzsprung gap or a core-helium burning, or a naked helium star. The birth rates of TŻOs via the above different progenitors are 1.7× 10^{-5}, 1.2× 10^{-4}, 0.7× 10^{-5}, 0.6× 10^{-5} yr^{-1}, respectively. These progenitors may be massive X-ray binaries. We found that the observational properties of three massive X-ray binaries (SMC X-1, Cen X-3 and LMC X-4) in which the companions of NSs may fill their Roche robes were consistent with those of their progenitors.

Capillary-wave dynamics and interface structure modulation in binary Bose-Einstein condensate mixtures

NASA Astrophysics Data System (ADS)

Indekeu, Joseph O.; Van Thu, Nguyen; Lin, Chang-You; Phat, Tran Huu

2018-04-01

The localized low-energy interfacial excitations, or interfacial Nambu-Goldstone modes, of phase-segregated binary mixtures of Bose-Einstein condensates are investigated analytically. To this end a double-parabola approximation (DPA) is performed on the Lagrangian density in Gross-Pitaevskii theory for a system in a uniform potential. This DPA entails a model in which analytic expressions are obtained for the excitations underlying capillary waves or ripplons for arbitrary strength K (>1 ) of the phase segregation. The dispersion relation ω (k ) ∝k3 /2 is derived directly from the Bogoliubov-de Gennes equations in the limit that the wavelength 2 π /k is much larger than the interface width. The proportionality constant in the dispersion relation provides the static interfacial tension. A correction term in ω (k ) of order k5 /2 is calculated analytically within the DPA model. The combined result is tested against numerical diagonalization of the exact Bogoliubov-de Gennes equations. Satisfactory agreement is obtained in the range of physically relevant wavelengths. The ripplon dispersion relation is relevant to state-of-the-art experiments using (quasi)uniform optical-box traps. Furthermore, within the DPA model explicit expressions are obtained for the structural deformation of the interface due to the passing of the capillary wave. It is found that the amplitude of the wave is enhanced by an amount that is quadratic in the ratio of the phase velocity ω /k to the sound velocity c . For generic mixtures consisting of condensates with unequal healing lengths, an additional modulation is predicted of the common value of the condensate densities at the interface.

Quantum annealing for combinatorial clustering

NASA Astrophysics Data System (ADS)

Kumar, Vaibhaw; Bass, Gideon; Tomlin, Casey; Dulny, Joseph

2018-02-01

Clustering is a powerful machine learning technique that groups "similar" data points based on their characteristics. Many clustering algorithms work by approximating the minimization of an objective function, namely the sum of within-the-cluster distances between points. The straightforward approach involves examining all the possible assignments of points to each of the clusters. This approach guarantees the solution will be a global minimum; however, the number of possible assignments scales quickly with the number of data points and becomes computationally intractable even for very small datasets. In order to circumvent this issue, cost function minima are found using popular local search-based heuristic approaches such as k-means and hierarchical clustering. Due to their greedy nature, such techniques do not guarantee that a global minimum will be found and can lead to sub-optimal clustering assignments. Other classes of global search-based techniques, such as simulated annealing, tabu search, and genetic algorithms, may offer better quality results but can be too time-consuming to implement. In this work, we describe how quantum annealing can be used to carry out clustering. We map the clustering objective to a quadratic binary optimization problem and discuss two clustering algorithms which are then implemented on commercially available quantum annealing hardware, as well as on a purely classical solver "qbsolv." The first algorithm assigns N data points to K clusters, and the second one can be used to perform binary clustering in a hierarchical manner. We present our results in the form of benchmarks against well-known k-means clustering and discuss the advantages and disadvantages of the proposed techniques.

Multivariate Approaches for Simultaneous Determination of Avanafil and Dapoxetine by UV Chemometrics and HPLC-QbD in Binary Mixtures and Pharmaceutical Product.

PubMed

2016-04-07

Multivariate UV-spectrophotometric methods and Quality by Design (QbD) HPLC are described for concurrent estimation of avanafil (AV) and dapoxetine (DP) in the binary mixture and in the dosage form. Chemometric methods have been developed, including classical least-squares, principal component regression, partial least-squares, and multiway partial least-squares. Analytical figures of merit, such as sensitivity, selectivity, analytical sensitivity, LOD, and LOQ were determined. QbD consists of three steps, starting with the screening approach to determine the critical process parameter and response variables. This is followed by understanding of factors and levels, and lastly the application of a Box-Behnken design containing four critical factors that affect the method. From an Ishikawa diagram and a risk assessment tool, four main factors were selected for optimization. Design optimization, statistical calculation, and final-condition optimization of all the reactions were Carried out. Twenty-five experiments were done, and a quadratic model was used for all response variables. Desirability plot, surface plot, design space, and three-dimensional plots were calculated. In the optimized condition, HPLC separation was achieved on Phenomenex Gemini C18 column (250 × 4.6 mm, 5 μm) using acetonitrile-buffer (ammonium acetate buffer at pH 3.7 with acetic acid) as a mobile phase at flow rate of 0.7 mL/min. Quantification was done at 239 nm, and temperature was set at 20°C. The developed methods were validated and successfully applied for simultaneous determination of AV and DP in the dosage form.

Determinants of Paracentrotus lividus sea urchin recruitment under oligotrophic conditions: Implications for conservation management.

PubMed

Oliva, Silvia; Farina, Simone; Pinna, Stefania; Guala, Ivan; Agnetta, Davide; Ariotti, Pierre Antoine; Mura, Francesco; Ceccherelli, Giulia

2016-06-01

Sea urchins may deeply shape the structure of macrophyte-dominated communities and require the implementation of sustainable management strategies. In the Mediterranean, the identification of the major recruitment determinants of the keystone sea urchin species Paracentrotus lividus is required, so that source areas of the populations can be identified and exploitation or programmed harvesting can be spatially managed. In this study a collection of eight possible determinants, these encompassing both the biotic (larvae, adult sea urchins, fish, encrusting coralline algae, habitat type and spatial arrangement of habitats) and abiotic (substrate complexity and nutritional status) realms was considered at different spatial scales (site, area, transect and quadrat). Data from a survey including sites subject to different levels of human influence (i.e. from urbanized to protected areas), but all corresponding to an oligotrophic and low-populated region were fitted by means of a generalized linear mixed model. Despite the extensive sampling effort of benthic quadrats, an overall paucity of recruits was found, recruits being aggregated in a very small number of quadrats and in few areas. The analysis of data detected substrate complexity, and adult sea urchin and predatory fish abundances as the momentous determinants of Paracentrotus lividus recruitment. Possible mechanisms of influence are discussed beyond the implications of conservation management. Copyright © 2016 Elsevier Ltd. All rights reserved.

Orbital and Systemic Parameters for Algol Binaries in the Field-of-View of the Kepler Spacecraft

NASA Astrophysics Data System (ADS)

Peters, Geraldine J.; Vaccaro, Todd R.; Wilson, Robert E.

2013-02-01

We propose observations of seven Algol-type binaries with the 4m Echelle spectrograph necessary for the interpretation of ongoing photometry from the it Kepler spacecraft and archival it Kepler data being analyzed for an approved NASA/ADAP project. These Algols are direct-impact systems (periods range from 1.3-4.5^d) in which the gas stream strikes the photosphere of the gainer, producing a shock. The it Kepler light curves reveal striking long and short-term variability never before seen in ground-based observations. Especially interesting is a long-term oscillation in the relative brightness of the quadrature light that we call L/T variability, which appears to be caused from a migrating variable hot spot. The it Kepler photometry is being interpreted with an updated version of the Wilson & Devinney (WD) program. The KPNO spectra will supply it critical input parameters (e.g. temperatures) and yield radial velocity curves from which we will determine the masses of the stars and absolute dimensions of the systems. Currently there are it no published spectra of most of the program binaries, including WX Dra, the prototype L/T variable and our primary target. We request 4 nights of observing time to cover one orbital cycle in the binaries with the longest periods. This project will yield information on the detailed physics of mass transfer, especially the roles of accretion hot spots and magnetic fields, and also test the new WD program for future applications by others working with the it Kepler database.

Toxicity Relationship Analysis Program (TRAP) Version 1.21

EPA Science Inventory

The Toxicity Relationship Analysis Program (TRAP) fits a sigmoidal toxic response versus exposure variable relationship to standard toxicity test data. It will analyze binary (e.g., survival) or continuous (e.g., growth, reproduction) biological effect variables as a function o...

Expected value based fuzzy programming approach to solve integrated supplier selection and inventory control problem with fuzzy demand

NASA Astrophysics Data System (ADS)

Sutrisno; Widowati; Sunarsih; Kartono

2018-01-01

In this paper, a mathematical model in quadratic programming with fuzzy parameter is proposed to determine the optimal strategy for integrated inventory control and supplier selection problem with fuzzy demand. To solve the corresponding optimization problem, we use the expected value based fuzzy programming. Numerical examples are performed to evaluate the model. From the results, the optimal amount of each product that have to be purchased from each supplier for each time period and the optimal amount of each product that have to be stored in the inventory for each time period were determined with minimum total cost and the inventory level was sufficiently closed to the reference level.

Performance Analysis and Design Synthesis (PADS) computer program. Volume 2: Program description, part 2

NASA Technical Reports Server (NTRS)

1972-01-01

The QL module of the Performance Analysis and Design Synthesis (PADS) computer program is described. Execution of this module is initiated when and if subroutine PADSI calls subroutine GROPE. Subroutine GROPE controls the high level logical flow of the QL module. The purpose of the module is to determine a trajectory that satisfies the necessary variational conditions for optimal performance. The module achieves this by solving a nonlinear multi-point boundary value problem. The numerical method employed is described. It is an iterative technique that converges quadratically when it does converge. The three basic steps of the module are: (1) initialization, (2) iteration, and (3) culmination. For Volume 1 see N73-13199.

Marionette

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sullivan, M.; Anderson, D.P.

1988-01-01

Marionette is a system for distributed parallel programming in an environment of networked heterogeneous computer systems. It is based on a master/slave model. The master process can invoke worker operations (asynchronous remote procedure calls to single slaves) and context operations (updates to the state of all slaves). The master and slaves also interact through shared data structures that can be modified only by the master. The master and slave processes are programmed in a sequential language. The Marionette runtime system manages slave process creation, propagates shared data structures to slaves as needed, queues and dispatches worker and context operations, andmore » manages recovery from slave processor failures. The Marionette system also includes tools for automated compilation of program binaries for multiple architectures, and for distributing binaries to remote fuel systems. A UNIX-based implementation of Marionette is described.« less

Convergence of neural networks for programming problems via a nonsmooth Lojasiewicz inequality.

PubMed

Forti, Mauro; Nistri, Paolo; Quincampoix, Marc

2006-11-01

This paper considers a class of neural networks (NNs) for solving linear programming (LP) problems, convex quadratic programming (QP) problems, and nonconvex QP problems where an indefinite quadratic objective function is subject to a set of affine constraints. The NNs are characterized by constraint neurons modeled by ideal diodes with vertical segments in their characteristic, which enable to implement an exact penalty method. A new method is exploited to address convergence of trajectories, which is based on a nonsmooth Lojasiewicz inequality for the generalized gradient vector field describing the NN dynamics. The method permits to prove that each forward trajectory of the NN has finite length, and as a consequence it converges toward a singleton. Furthermore, by means of a quantitative evaluation of the Lojasiewicz exponent at the equilibrium points, the following results on convergence rate of trajectories are established: (1) for nonconvex QP problems, each trajectory is either exponentially convergent, or convergent in finite time, toward a singleton belonging to the set of constrained critical points; (2) for convex QP problems, the same result as in (1) holds; moreover, the singleton belongs to the set of global minimizers; and (3) for LP problems, each trajectory converges in finite time to a singleton belonging to the set of global minimizers. These results, which improve previous results obtained via the Lyapunov approach, are true independently of the nature of the set of equilibrium points, and in particular they hold even when the NN possesses infinitely many nonisolated equilibrium points.

A chance-constrained stochastic approach to intermodal container routing problems.

PubMed

Zhao, Yi; Liu, Ronghui; Zhang, Xi; Whiteing, Anthony

2018-01-01

We consider a container routing problem with stochastic time variables in a sea-rail intermodal transportation system. The problem is formulated as a binary integer chance-constrained programming model including stochastic travel times and stochastic transfer time, with the objective of minimising the expected total cost. Two chance constraints are proposed to ensure that the container service satisfies ship fulfilment and cargo on-time delivery with pre-specified probabilities. A hybrid heuristic algorithm is employed to solve the binary integer chance-constrained programming model. Two case studies are conducted to demonstrate the feasibility of the proposed model and to analyse the impact of stochastic variables and chance-constraints on the optimal solution and total cost.

A chance-constrained stochastic approach to intermodal container routing problems

PubMed Central

Zhao, Yi; Zhang, Xi; Whiteing, Anthony

2018-01-01

We consider a container routing problem with stochastic time variables in a sea-rail intermodal transportation system. The problem is formulated as a binary integer chance-constrained programming model including stochastic travel times and stochastic transfer time, with the objective of minimising the expected total cost. Two chance constraints are proposed to ensure that the container service satisfies ship fulfilment and cargo on-time delivery with pre-specified probabilities. A hybrid heuristic algorithm is employed to solve the binary integer chance-constrained programming model. Two case studies are conducted to demonstrate the feasibility of the proposed model and to analyse the impact of stochastic variables and chance-constraints on the optimal solution and total cost. PMID:29438389

Edit distance for marked point processes revisited: An implementation by binary integer programming

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hirata, Yoshito; Aihara, Kazuyuki

2015-12-15

We implement the edit distance for marked point processes [Suzuki et al., Int. J. Bifurcation Chaos 20, 3699–3708 (2010)] as a binary integer program. Compared with the previous implementation using minimum cost perfect matching, the proposed implementation has two advantages: first, by using the proposed implementation, we can apply a wide variety of software and hardware, even spin glasses and coherent ising machines, to calculate the edit distance for marked point processes; second, the proposed implementation runs faster than the previous implementation when the difference between the numbers of events in two time windows for a marked point process ismore » large.« less

Advanced binary geothermal power plants: Limits of performance

NASA Astrophysics Data System (ADS)

Bliem, C. J.; Mines, G. L.

1991-01-01

The Heat Cycle Research Program is investigating potential improvements to power cycles utilizing moderate temperature geothermal resources to produce electrical power. Investigations have specifically examined Rankine cycle binary power systems. Binary Rankine cycles are more efficient than the flash steam cycles at moderate resource temperature, achieving a higher net brine effectiveness. At resource conditions similar to those at the Heber binary plant, it has been shown that mixtures of saturated hydrocarbons (alkanes) or halogenated hydrocarbons operating in a supercritical Rankine cycle gave improved performance over Rankine cycles with the pure working fluids executing single or dual boiling cycles or supercritical cycles. Recently, other types of cycles have been proposed for binary geothermal service. The feasible limits on efficiency of a plant given practical limits on equipment performance is explored and the methods used in these advanced concept plants to achieve the maximum possible efficiency are discussed. (Here feasible is intended to mean reasonably achievable and not cost effective.) No direct economic analysis was made because of the sensitivity of economic results to site specific input. The limit of performance of three advanced plants were considered. The performance predictions were taken from the developers of each concept. The advanced plants considered appear to be approaching the feasible limit of performance. Ultimately, the plant designer must weigh the advantages and disadvantages of the the different cycles to find the best plant for a given service. In addition, a standard is presented of comparison of the work which has been done in the Heat Cycle Research Program and in the industrial sector by Exergy, Inc. and Polythermal Technologies.

Ffuzz: Towards full system high coverage fuzz testing on binary executables.

PubMed

Zhang, Bin; Ye, Jiaxi; Bi, Xing; Feng, Chao; Tang, Chaojing

2018-01-01

Bugs and vulnerabilities in binary executables threaten cyber security. Current discovery methods, like fuzz testing, symbolic execution and manual analysis, both have advantages and disadvantages when exercising the deeper code area in binary executables to find more bugs. In this paper, we designed and implemented a hybrid automatic bug finding tool-Ffuzz-on top of fuzz testing and selective symbolic execution. It targets full system software stack testing including both the user space and kernel space. Combining these two mainstream techniques enables us to achieve higher coverage and avoid getting stuck both in fuzz testing and symbolic execution. We also proposed two key optimizations to improve the efficiency of full system testing. We evaluated the efficiency and effectiveness of our method on real-world binary software and 844 memory corruption vulnerable programs in the Juliet test suite. The results show that Ffuzz can discover software bugs in the full system software stack effectively and efficiently.

Secondary School Advanced Mathematics, Chapter 6, The Complex Number System, Chapter 7, Equations of the First and Second Degree in Two Variables. Student's Text.

ERIC Educational Resources Information Center

Stanford Univ., CA. School Mathematics Study Group.

This text is the fourth of five in the Secondary School Advanced Mathematics (SSAM) series which was designed to meet the needs of students who have completed the Secondary School Mathematics (SSM) program, and wish to continue their study of mathematics. This text begins with a brief discussion of quadratic equations which motivates the…

Cheetah: Starspot modeling code

NASA Astrophysics Data System (ADS)

Walkowicz, Lucianne; Thomas, Michael; Finkestein, Adam

2014-12-01

Cheetah models starspots in photometric data (lightcurves) by calculating the modulation of a light curve due to starspots. The main parameters of the program are the linear and quadratic limb darkening coefficients, stellar inclination, spot locations and sizes, and the intensity ratio of the spots to the stellar photosphere. Cheetah uses uniform spot contrast and the minimum number of spots needed to produce a good fit and ignores bright regions for the sake of simplicity.

Controllability of semi-infinite rod heating by a point source

NASA Astrophysics Data System (ADS)

Khurshudyan, A.

2018-04-01

The possibility of control over heating of a semi-infinite thin rod by a point source concentrated at an inner point of the rod, is studied. Quadratic and piecewise constant solutions of the problem are derived, and the possibilities of solving appropriate problems of optimal control are indicated. Determining of the parameters of the piecewise constant solution is reduced to a problem of nonlinear programming. Numerical examples are considered.

Students' Understanding of Quadratic Equations

ERIC Educational Resources Information Center

López, Jonathan; Robles, Izraim; Martínez-Planell, Rafael

2016-01-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…

A new numerical approach to solve Thomas-Fermi model of an atom using bio-inspired heuristics integrated with sequential quadratic programming.

PubMed

Raja, Muhammad Asif Zahoor; Zameer, Aneela; Khan, Aziz Ullah; Wazwaz, Abdul Majid

2016-01-01

In this study, a novel bio-inspired computing approach is developed to analyze the dynamics of nonlinear singular Thomas-Fermi equation (TFE) arising in potential and charge density models of an atom by exploiting the strength of finite difference scheme (FDS) for discretization and optimization through genetic algorithms (GAs) hybrid with sequential quadratic programming. The FDS procedures are used to transform the TFE differential equations into a system of nonlinear equations. A fitness function is constructed based on the residual error of constituent equations in the mean square sense and is formulated as the minimization problem. Optimization of parameters for the system is carried out with GAs, used as a tool for viable global search integrated with SQP algorithm for rapid refinement of the results. The design scheme is applied to solve TFE for five different scenarios by taking various step sizes and different input intervals. Comparison of the proposed results with the state of the art numerical and analytical solutions reveals that the worth of our scheme in terms of accuracy and convergence. The reliability and effectiveness of the proposed scheme are validated through consistently getting optimal values of statistical performance indices calculated for a sufficiently large number of independent runs to establish its significance.

Memetic computing through bio-inspired heuristics integration with sequential quadratic programming for nonlinear systems arising in different physical models.

PubMed

Raja, Muhammad Asif Zahoor; Kiani, Adiqa Kausar; Shehzad, Azam; Zameer, Aneela

2016-01-01

In this study, bio-inspired computing is exploited for solving system of nonlinear equations using variants of genetic algorithms (GAs) as a tool for global search method hybrid with sequential quadratic programming (SQP) for efficient local search. The fitness function is constructed by defining the error function for systems of nonlinear equations in mean square sense. The design parameters of mathematical models are trained by exploiting the competency of GAs and refinement are carried out by viable SQP algorithm. Twelve versions of the memetic approach GA-SQP are designed by taking a different set of reproduction routines in the optimization process. Performance of proposed variants is evaluated on six numerical problems comprising of system of nonlinear equations arising in the interval arithmetic benchmark model, kinematics, neurophysiology, combustion and chemical equilibrium. Comparative studies of the proposed results in terms of accuracy, convergence and complexity are performed with the help of statistical performance indices to establish the worth of the schemes. Accuracy and convergence of the memetic computing GA-SQP is found better in each case of the simulation study and effectiveness of the scheme is further established through results of statistics based on different performance indices for accuracy and complexity.

Conservation of Mass and Preservation of Positivity with Ensemble-Type Kalman Filter Algorithms

NASA Technical Reports Server (NTRS)

Janjic, Tijana; Mclaughlin, Dennis; Cohn, Stephen E.; Verlaan, Martin

2014-01-01

This paper considers the incorporation of constraints to enforce physically based conservation laws in the ensemble Kalman filter. In particular, constraints are used to ensure that the ensemble members and the ensemble mean conserve mass and remain nonnegative through measurement updates. In certain situations filtering algorithms such as the ensemble Kalman filter (EnKF) and ensemble transform Kalman filter (ETKF) yield updated ensembles that conserve mass but are negative, even though the actual states must be nonnegative. In such situations if negative values are set to zero, or a log transform is introduced, the total mass will not be conserved. In this study, mass and positivity are both preserved by formulating the filter update as a set of quadratic programming problems that incorporate non-negativity constraints. Simple numerical experiments indicate that this approach can have a significant positive impact on the posterior ensemble distribution, giving results that are more physically plausible both for individual ensemble members and for the ensemble mean. In two examples, an update that includes a non-negativity constraint is able to properly describe the transport of a sharp feature (e.g., a triangle or cone). A number of implementation questions still need to be addressed, particularly the need to develop a computationally efficient quadratic programming update for large ensemble.

Plate/shell structure topology optimization of orthotropic material for buckling problem based on independent continuous topological variables

NASA Astrophysics Data System (ADS)

Ye, Hong-Ling; Wang, Wei-Wei; Chen, Ning; Sui, Yun-Kang

2017-10-01

The purpose of the present work is to study the buckling problem with plate/shell topology optimization of orthotropic material. A model of buckling topology optimization is established based on the independent, continuous, and mapping method, which considers structural mass as objective and buckling critical loads as constraints. Firstly, composite exponential function (CEF) and power function (PF) as filter functions are introduced to recognize the element mass, the element stiffness matrix, and the element geometric stiffness matrix. The filter functions of the orthotropic material stiffness are deduced. Then these filter functions are put into buckling topology optimization of a differential equation to analyze the design sensitivity. Furthermore, the buckling constraints are approximately expressed as explicit functions with respect to the design variables based on the first-order Taylor expansion. The objective function is standardized based on the second-order Taylor expansion. Therefore, the optimization model is translated into a quadratic program. Finally, the dual sequence quadratic programming (DSQP) algorithm and the global convergence method of moving asymptotes algorithm with two different filter functions (CEF and PF) are applied to solve the optimal model. Three numerical results show that DSQP&CEF has the best performance in the view of structural mass and discretion.

A Photometric Study of Three Eclipsing Binary Stars (Poster abstract)

NASA Astrophysics Data System (ADS)

Ryan, A.

2016-12-01

(Abstract only) As part of a program to study eclipsing binary stars that exhibit the O'Connell Effect (OCE) we are observing a selection of binary stars in a long term study. The OCE is a difference in maximum light across the ligthcurve possibly cause by starspots. We observed for 7 nights at McDonald Observatory using the 30-inch telescope in July 2015, and used the same telescope remotely for a total of 20 additional nights in August, October, December, and January. We will present lightcurves for three stars from this study, characterize the OCE for these stars, and present our model results for the physical parameters of the star making up each of these systems.

User Guide and Documentation for Five MODFLOW Ground-Water Modeling Utility Programs

USGS Publications Warehouse

Banta, Edward R.; Paschke, Suzanne S.; Litke, David W.

2008-01-01

This report documents five utility programs designed for use in conjunction with ground-water flow models developed with the U.S. Geological Survey's MODFLOW ground-water modeling program. One program extracts calculated flow values from one model for use as input to another model. The other four programs extract model input or output arrays from one model and make them available in a form that can be used to generate an ArcGIS raster data set. The resulting raster data sets may be useful for visual display of the data or for further geographic data processing. The utility program GRID2GRIDFLOW reads a MODFLOW binary output file of cell-by-cell flow terms for one (source) model grid and converts the flow values to input flow values for a different (target) model grid. The spatial and temporal discretization of the two models may differ. The four other utilities extract selected 2-dimensional data arrays in MODFLOW input and output files and write them to text files that can be imported into an ArcGIS geographic information system raster format. These four utilities require that the model cells be square and aligned with the projected coordinate system in which the model grid is defined. The four raster-conversion utilities are * CBC2RASTER, which extracts selected stress-package flow data from a MODFLOW binary output file of cell-by-cell flows; * DIS2RASTER, which extracts cell-elevation data from a MODFLOW Discretization file; * MFBIN2RASTER, which extracts array data from a MODFLOW binary output file of head or drawdown; and * MULT2RASTER, which extracts array data from a MODFLOW Multiplier file.

Quadratic Damping

ERIC Educational Resources Information Center

Fay, Temple H.

2012-01-01

Quadratic friction involves a discontinuous damping term in equations of motion in order that the frictional force always opposes the direction of the motion. Perhaps for this reason this topic is usually omitted from beginning texts in differential equations and physics. However, quadratic damping is more realistic than viscous damping in many…

Visualising the Roots of Quadratic Equations with Complex Coefficients

ERIC Educational Resources Information Center

Bardell, Nicholas S.

2014-01-01

This paper is a natural extension of the root visualisation techniques first presented by Bardell (2012) for quadratic equations with real coefficients. Consideration is now given to the familiar quadratic equation "y = ax[superscript 2] + bx + c" in which the coefficients "a," "b," "c" are generally…

Simply Prairie Homepage

Science.gov Websites

Ed Home - Data Home PRAIRIE ADVOCATES Project - QUADRAT STUDY Project Answer research questions multi-state quadrat study. Bob Lootens, Fermilab Join us! Check out the Quadrat Study Project. Prairie study a prairie "expert" to facilitate your research student Internet access an e-mail address

Testing Ultracool Models with Precise Luminosities and Masses

NASA Astrophysics Data System (ADS)

Dupuy, Trent; Cushing, Michael; Liu, Michael; Burningham, Ben; Leggett, Sandy; Albert, Loic; Delorme, Philippe

2011-05-01

After years of patient orbital monitoring, there is a growing sample of brown dwarfs with well-determined dynamical masses, representing the gold standard for testing substellar models. A key element of our model tests to date has been the use of integrated-light photometry to provide accurate total luminosity measurements for these binaries. However, some of the ultracool binaries with the most promising orbit motion for yielding dynamical in the masses lack the mid-infrared photometry needed to constrain their SEDs. This is especially crucial for the latest type binaries (spectral types >T5) that will probe the coldest temperature regimes previously untested with dynamical masses. We propose to use IRAC to obtain the needed mid-infrared photometry for a sample of binaries that are part of our ongoing orbital monitoring program with Keck laser guide star adaptive optics. The observational effort needed to characterize these binaries' luminosities using Spitzer is much less daunting in than the years of orbital monitoring needed to measure precise dynamical masses, but it is equally vital for robust tests of theory.

Final binary star results from the ESO VLT Lunar occultations program

DOE Office of Scientific and Technical Information (OSTI.GOV)

Richichi, A.; Fors, O.; Cusano, F.

2014-03-01

We report on 13 subarcsecond binaries, detected by means of lunar occultations in the near-infrared at the ESO Very Large Telescope (VLT). They are all first-time detections except for the visual binary HD 158122, which we resolved for the first time in the near-infrared. The primaries have magnitudes in the range K = 4.5-10.0, and companions in the range K = 6.8-11.1. The magnitude differences have a median value of 2.4, with the largest being 4.6. The projected separations are in the range of 4-168 mas, with a median of 13 mas. We discuss and compare our results with themore » available literature. With this paper, we conclude the mining for binary star detections in the 1226 occultations recorded at the VLT with the ISAAC instrument. We expect that the majority of these binaries may be unresolvable by adaptive optics on current telescopes, and they might be challenging for long-baseline interferometry. However, they constitute an interesting sample for future larger telescopes and for astrometric missions such as GAIA.« less

Geometric quadratic stochastic operator on countable infinite set

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ganikhodjaev, Nasir; Hamzah, Nur Zatul Akmar

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.

An Unexpected Influence on a Quadratic

ERIC Educational Resources Information Center

Davis, Jon D.

2013-01-01

Using technology to explore the coefficients of a quadratic equation can lead to an unexpected result. This article describes an investigation that involves sliders and dynamically linked representations. It guides students to notice the effect that the parameter "a" has on the graphical representation of a quadratic function in the form…

Differences between quadratic equations and functions: Indonesian pre-service secondary mathematics teachers’ views

NASA Astrophysics Data System (ADS)

Aziz, T. A.; Pramudiani, P.; Purnomo, Y. W.

2018-01-01

Difference between quadratic equation and quadratic function as perceived by Indonesian pre-service secondary mathematics teachers (N = 55) who enrolled at one private university in Jakarta City was investigated. Analysis of participants’ written responses and interviews were conducted consecutively. Participants’ written responses highlighted differences between quadratic equation and function by referring to their general terms, main characteristics, processes, and geometrical aspects. However, they showed several obstacles in describing the differences such as inappropriate constraints and improper interpretations. Implications of the study are discussed.

Estimating factors influencing the detection probability of semiaquatic freshwater snails using quadrat survey methods

USGS Publications Warehouse

Roesler, Elizabeth L.; Grabowski, Timothy B.

2018-01-01

Developing effective monitoring methods for elusive, rare, or patchily distributed species requires extra considerations, such as imperfect detection. Although detection is frequently modeled, the opportunity to assess it empirically is rare, particularly for imperiled species. We used Pecos assiminea (Assiminea pecos), an endangered semiaquatic snail, as a case study to test detection and accuracy issues surrounding quadrat searches. Quadrats (9 × 20 cm; n = 12) were placed in suitable Pecos assiminea habitat and randomly assigned a treatment, defined as the number of empty snail shells (0, 3, 6, or 9). Ten observers rotated through each quadrat, conducting 5-min visual searches for shells. The probability of detecting a shell when present was 67.4 ± 3.0%, but it decreased with the increasing litter depth and fewer number of shells present. The mean (± SE) observer accuracy was 25.5 ± 4.3%. Accuracy was positively correlated to the number of shells in the quadrat and negatively correlated to the number of times a quadrat was searched. The results indicate quadrat surveys likely underrepresent true abundance, but accurately determine the presence or absence. Understanding detection and accuracy of elusive, rare, or imperiled species improves density estimates and aids in monitoring and conservation efforts.

Currency arbitrage detection using a binary integer programming model

NASA Astrophysics Data System (ADS)

Soon, Wanmei; Ye, Heng-Qing

2011-04-01

In this article, we examine the use of a new binary integer programming (BIP) model to detect arbitrage opportunities in currency exchanges. This model showcases an excellent application of mathematics to the real world. The concepts involved are easily accessible to undergraduate students with basic knowledge in Operations Research. Through this work, students can learn to link several types of basic optimization models, namely linear programming, integer programming and network models, and apply the well-known sensitivity analysis procedure to accommodate realistic changes in the exchange rates. Beginning with a BIP model, we discuss how it can be reduced to an equivalent but considerably simpler model, where an efficient algorithm can be applied to find the arbitrages and incorporate the sensitivity analysis procedure. A simple comparison is then made with a different arbitrage detection model. This exercise helps students learn to apply basic Operations Research concepts to a practical real-life example, and provides insights into the processes involved in Operations Research model formulations.

MM Algorithms for Geometric and Signomial Programming

PubMed Central

Lange, Kenneth; Zhou, Hua

2013-01-01

This paper derives new algorithms for signomial programming, a generalization of geometric programming. The algorithms are based on a generic principle for optimization called the MM algorithm. In this setting, one can apply the geometric-arithmetic mean inequality and a supporting hyperplane inequality to create a surrogate function with parameters separated. Thus, unconstrained signomial programming reduces to a sequence of one-dimensional minimization problems. Simple examples demonstrate that the MM algorithm derived can converge to a boundary point or to one point of a continuum of minimum points. Conditions under which the minimum point is unique or occurs in the interior of parameter space are proved for geometric programming. Convergence to an interior point occurs at a linear rate. Finally, the MM framework easily accommodates equality and inequality constraints of signomial type. For the most important special case, constrained quadratic programming, the MM algorithm involves very simple updates. PMID:24634545

MM Algorithms for Geometric and Signomial Programming.

PubMed

Lange, Kenneth; Zhou, Hua

2014-02-01

This paper derives new algorithms for signomial programming, a generalization of geometric programming. The algorithms are based on a generic principle for optimization called the MM algorithm. In this setting, one can apply the geometric-arithmetic mean inequality and a supporting hyperplane inequality to create a surrogate function with parameters separated. Thus, unconstrained signomial programming reduces to a sequence of one-dimensional minimization problems. Simple examples demonstrate that the MM algorithm derived can converge to a boundary point or to one point of a continuum of minimum points. Conditions under which the minimum point is unique or occurs in the interior of parameter space are proved for geometric programming. Convergence to an interior point occurs at a linear rate. Finally, the MM framework easily accommodates equality and inequality constraints of signomial type. For the most important special case, constrained quadratic programming, the MM algorithm involves very simple updates.

A velocity-pressure integrated, mixed interpolation, Galerkin finite element method for high Reynolds number laminar flows

NASA Technical Reports Server (NTRS)

Kim, Sang-Wook

1988-01-01

A velocity-pressure integrated, mixed interpolation, Galerkin finite element method for the Navier-Stokes equations is presented. In the method, the velocity variables were interpolated using complete quadratic shape functions and the pressure was interpolated using linear shape functions. For the two dimensional case, the pressure is defined on a triangular element which is contained inside the complete biquadratic element for velocity variables; and for the three dimensional case, the pressure is defined on a tetrahedral element which is again contained inside the complete tri-quadratic element. Thus the pressure is discontinuous across the element boundaries. Example problems considered include: a cavity flow for Reynolds number of 400 through 10,000; a laminar backward facing step flow; and a laminar flow in a square duct of strong curvature. The computational results compared favorable with those of the finite difference methods as well as experimental data available. A finite elememt computer program for incompressible, laminar flows is presented.

Response surface modeling of acid activation of raw diatomite using in sunflower oil bleaching by: Box-Behnken experimental design.

PubMed

Larouci, M; Safa, M; Meddah, B; Aoues, A; Sonnet, P

2015-03-01

The optimum conditions for acid activation of diatomite for maximizing bleaching efficiency of the diatomite in sun flower oil treatment were studied. Box-Behnken experimental design combining with response surface modeling (RSM) and quadratic programming (QP) was employed to obtain the optimum conditions of three independent variables (acid concentration, activation time and solid to liquid) for acid activation of diatomite. The significance of independent variables and their interactions were tested by means of the analysis of variance (ANOVA) with 95 % confidence limits (α = 0.05). The optimum values of the selected variables were obtained by solving the quadratic regression model, as well as by analyzing the response surface contour plots. The experimental conditions at this global point were determined to be acid concentration = 8.963 N, activation time = 11.9878 h, and solid to liquid ratio = 221.2113 g/l, the corresponding bleaching efficiency was found to be about 99 %.

Optimal Link Removal for Epidemic Mitigation: A Two-Way Partitioning Approach

PubMed Central

Enns, Eva A.; Mounzer, Jeffrey J.; Brandeau, Margaret L.

2011-01-01

The structure of the contact network through which a disease spreads may influence the optimal use of resources for epidemic control. In this work, we explore how to minimize the spread of infection via quarantining with limited resources. In particular, we examine which links should be removed from the contact network, given a constraint on the number of removable links, such that the number of nodes which are no longer at risk for infection is maximized. We show how this problem can be posed as a non-convex quadratically constrained quadratic program (QCQP), and we use this formulation to derive a link removal algorithm. The performance of our QCQP-based algorithm is validated on small Erdős-Renyi and small-world random graphs, and then tested on larger, more realistic networks, including a real-world network of injection drug use. We show that our approach achieves near optimal performance and out-perform so ther intuitive link removal algorithms, such as removing links in order of edge centrality. PMID:22115862

GBM Observations of Be X-Ray Binary Outbursts

NASA Technical Reports Server (NTRS)

Wilson-Hodge, Colleen A.; Finger, M. H.; Jenke, P. A.

2014-01-01

Since 2008 we have been monitoring accreting pulsars using the Gamma ray Burst Monitor (GBM) on Fermi. This monitoring program includes daily blind full sky searches for previously unknown or previously quiescent pulsars and source specific analysis to track the frequency evolution of all detected pulsars. To date we have detected outbursts from 23 transient accreting pulsars, including 21 confirmed or likely Be/X-ray binaries. I will describe our techniques and highlight results for selected pulsars.

Broiler responses to increasing selenium supplementation using Zn-L-selenomethionine with special attention to breast myopathies.

PubMed

Cemin, H S; Vieira, S L; Stefanello, C; Kindlein, L; Ferreira, T Z; Fireman, A K

2018-05-01

A study was conducted to evaluate growth performance, carcass and breast yields, and the occurrence and severity of white striping (WS) and wooden breast (WB) myopathies of broilers fed diets supplemented with increasing dietary levels of an organic source of selenium (Zn-L-SeMet). Broilers were fed 6 treatments with 12 replications of 26 birds in a 4-phase feeding program from 1 to 42 days. Corn-soy-based diets were supplemented with 0, 0.2, 0.4, 0.6, 0.8, and 1.0 ppm of Zn-L-SeMet. At 42 d, 6 birds were randomly selected from each pen (n = 72) and processed for carcass and breast yields. Breast fillets were scored for WS and WB at 42 days. Increasing Zn-L-SeMet led to quadratic responses (P < 0.05) for FCR from 1 to 7 d, BWG from 22 to 35 d, and for both responses from 8 to 21 d and 36 to 42 d, as well as in the overall period of 42 days. Carcass and breast yields presented a quadratic improvement (P < 0.01) with increasing Zn-L-SeMet supplementation and Se requirements were estimated at 0.85 and 0.86 ppm, respectively. In the overall period, estimates of Se requirements were 0.64 ppm for BWG and 0.67 ppm for FCR. White striping and WB scores presented quadratic increases (P < 0.01), and maximum scores were observed at 0.68 and 0.67 ppm, respectively. Broilers fed diets formulated without Se supplementation had a higher percentage of normal fillets compared to other Se supplementation levels (quadratic, P < 0.05). In conclusion, increasing Se supplementation to reach maximum growth performance led to higher degrees of severity of WS and WB. Selenium requirements determined in the present study were significantly higher than the present commercial recommendations.

Numerical Simulations of Dynamical Mass Transfer in Binaries

NASA Astrophysics Data System (ADS)

Motl, P. M.; Frank, J.; Tohline, J. E.

1999-05-01

We will present results from our ongoing research project to simulate dynamically unstable mass transfer in near contact binaries with mass ratios different from one. We employ a fully three-dimensional self-consistent field technique to generate synchronously rotating polytropic binaries. With our self-consistent field code we can create equilibrium binaries where one component is, by radius, within about 99 of filling its Roche lobe for example. These initial configurations are evolved using a three-dimensional, Eulerian hydrodynamics code. We make no assumptions about the symmetry of the subsequent flow and the entire binary system is evolved self-consistently under the influence of its own gravitational potential. For a given mass ratio and polytropic index for the binary components, mass transfer via Roche lobe overflow can be predicted to be stable or unstable through simple theoretical arguments. The validity of the approximations made in the stability calculations are tested against our numerical simulations. We acknowledge support from the U.S. National Science Foundation through grants AST-9720771, AST-9528424, and DGE-9355007. This research has been supported, in part, by grants of high-performance computing time on NPACI facilities at the San Diego Supercomputer Center, the Texas Advanced Computing Center and through the PET program of the NAVOCEANO DoD Major Shared Resource Center in Stennis, MS.

No-signaling quantum key distribution: solution by linear programming

NASA Astrophysics Data System (ADS)

Hwang, Won-Young; Bae, Joonwoo; Killoran, Nathan

2015-02-01

We outline a straightforward approach for obtaining a secret key rate using only no-signaling constraints and linear programming. Assuming an individual attack, we consider all possible joint probabilities. Initially, we study only the case where Eve has binary outcomes, and we impose constraints due to the no-signaling principle and given measurement outcomes. Within the remaining space of joint probabilities, by using linear programming, we get bound on the probability of Eve correctly guessing Bob's bit. We then make use of an inequality that relates this guessing probability to the mutual information between Bob and a more general Eve, who is not binary-restricted. Putting our computed bound together with the Csiszár-Körner formula, we obtain a positive key generation rate. The optimal value of this rate agrees with known results, but was calculated in a more straightforward way, offering the potential of generalization to different scenarios.

Radial Velocity Studies of Close Binary Stars. XI.

NASA Astrophysics Data System (ADS)

Pribulla, Theodor; Rucinski, Slavek M.; Lu, Wenxian; Mochnacki, Stefan W.; Conidis, George; Blake, R. M.; DeBond, Heide; Thomson, J. R.; Pych, Wojtek; Ogłoza, Waldemar; Siwak, Michal

2006-08-01

Radial-velocity measurements and sine-curve fits to orbital radial velocity variations are presented for 10 close binary systems: DU Boo, ET Boo, TX Cnc, V1073 Cyg, HL Dra, AK Her, VW LMi, V566 Oph, TV UMi, and AG Vir. With this contribution, the David Dunlap Observatory program has reached the point of 100 published radial velocity orbits. The radial velocities have been determined using an improved fitting technique that uses rotational profiles to approximate individual peaks in broadening functions. Three systems, ET Boo, VW LMi, and TV UMi, are found to be quadruple, while AG Vir appears to be a spectroscopic triple. ET Boo, a member of a close visual binary with Pvis=113 yr, was previously known to be a multiple system, but we show that the second component is actually a close, noneclipsing binary. The new observations have enabled us to determine the spectroscopic orbits of the companion, noneclipsing pairs in ET Boo and VW LMi. A particularly interesting case is VW LMi, for which the period of the mutual revolution of the two spectroscopic binaries is only 355 days. While most of the studied eclipsing pairs are contact binaries, ET Boo is composed of two double-lined detached binaries, and HL Dra is a single-lined detached or semidetached system. Five systems of this group have been observed spectroscopically before: TX Cnc, V1073 Cyg, AK Her (as a single-lined binary), V566 Oph, and AG Vir, but our new data are of much higher quality than in the previous studies. Based on data obtained at the David Dunlap Observatory, University of Toronto, Canada.

Some Paradoxical Results for the Quadratically Weighted Kappa

ERIC Educational Resources Information Center

Warrens, Matthijs J.

2012-01-01

The quadratically weighted kappa is the most commonly used weighted kappa statistic for summarizing interrater agreement on an ordinal scale. The paper presents several properties of the quadratically weighted kappa that are paradoxical. For agreement tables with an odd number of categories "n" it is shown that if one of the raters uses the same…

Quadratic elongation: A quantitative measure of distortion in coordination polyhedra

USGS Publications Warehouse

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.

Analysis of Students' Error in Learning of Quadratic Equations

ERIC Educational Resources Information Center

Zakaria, Effandi; Ibrahim; Maat, Siti Mistima

2010-01-01

The purpose of the study was to determine the students' error in learning quadratic equation. The samples were 30 form three students from a secondary school in Jambi, Indonesia. Diagnostic test was used as the instrument of this study that included three components: factorization, completing the square and quadratic formula. Diagnostic interview…

On the Run-Time Optimization of the Boolean Logic of a Program.

ERIC Educational Resources Information Center

Cadolino, C.; Guazzo, M.

1982-01-01

Considers problem of optimal scheduling of Boolean expression (each Boolean variable represents binary outcome of program module) on single-processor system. Optimization discussed consists of finding operand arrangement that minimizes average execution costs representing consumption of resources (elapsed time, main memory, number of…

Period changes of 7 bright RR Lyrae variables included in the BAV standard program.

NASA Astrophysics Data System (ADS)

Wunder, E.

1995-11-01

On the basis of 1578 times of maxima historical and present period changes of the RR Lyrae stars SW And, SW Aqr, AA Aql, X Ari, RS Boo, RR Cet and XZ Cyg are analysed. In tables the period jumps and the quadratic terms of the elements are quantified and timed; elements are given to describe the historical O-C-curves; instant elements are listed to support nowadays observations.

Guidance/Navigation Requirements Study Final Report. Volume III. Appendices

DTIC Science & Technology

1978-04-30

shown Figure G-2. The free-flight simulation program FFSIM uses quaternions to calculate the body attitude as a function of time. To calculate the...the lack of open-loop damping, the existence of a feedback controller which will stabilize the closed-loon system depends upon the satisfaction of a...re-entry vehicle has dynamic pecularitles which tend to discourage the use of "linear-quadratic" feedback regulators in guidance. The disadvantageous

Robust feature extraction for rapid classification of damage in composites

NASA Astrophysics Data System (ADS)

Coelho, Clyde K.; Reynolds, Whitney; Chattopadhyay, Aditi

2009-03-01

The ability to detect anomalies in signals from sensors is imperative for structural health monitoring (SHM) applications. Many of the candidate algorithms for these applications either require a lot of training examples or are very computationally inefficient for large sample sizes. The damage detection framework presented in this paper uses a combination of Linear Discriminant Analysis (LDA) along with Support Vector Machines (SVM) to obtain a computationally efficient classification scheme for rapid damage state determination. LDA was used for feature extraction of damage signals from piezoelectric sensors on a composite plate and these features were used to train the SVM algorithm in parts, reducing the computational intensity associated with the quadratic optimization problem that needs to be solved during training. SVM classifiers were organized into a binary tree structure to speed up classification, which also reduces the total training time required. This framework was validated on composite plates that were impacted at various locations. The results show that the algorithm was able to correctly predict the different impact damage cases in composite laminates using less than 21 percent of the total available training data after data reduction.

A parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix

NASA Technical Reports Server (NTRS)

Swarztrauber, Paul N.

1993-01-01

A parallel algorithm, called polysection, is presented for computing the eigenvalues of a symmetric tridiagonal matrix. The method is based on a quadratic recurrence in which the characteristic polynomial is constructed on a binary tree from polynomials whose degree doubles at each level. Intervals that contain exactly one zero are determined by the zeros of polynomials at the previous level which ensures that different processors compute different zeros. The signs of the polynomials at the interval endpoints are determined a priori and used to guarantee that all zeros are found. The use of finite-precision arithmetic may result in multiple zeros; however, in this case, the intervals coalesce and their number determines exactly the multiplicity of the zero. For an N x N matrix the eigenvalues can be determined in O(log-squared N) time with N-squared processors and O(N) time with N processors. The method is compared with a parallel variant of bisection that requires O(N-squared) time on a single processor, O(N) time with N processors, and O(log N) time with N-squared processors.

A quantum annealing approach for fault detection and diagnosis of graph-based systems

NASA Astrophysics Data System (ADS)

Perdomo-Ortiz, A.; Fluegemann, J.; Narasimhan, S.; Biswas, R.; Smelyanskiy, V. N.

2015-02-01

Diagnosing the minimal set of faults capable of explaining a set of given observations, e.g., from sensor readouts, is a hard combinatorial optimization problem usually tackled with artificial intelligence techniques. We present the mapping of this combinatorial problem to quadratic unconstrained binary optimization (QUBO), and the experimental results of instances embedded onto a quantum annealing device with 509 quantum bits. Besides being the first time a quantum approach has been proposed for problems in the advanced diagnostics community, to the best of our knowledge this work is also the first research utilizing the route Problem → QUBO → Direct embedding into quantum hardware, where we are able to implement and tackle problem instances with sizes that go beyond previously reported toy-model proof-of-principle quantum annealing implementations; this is a significant leap in the solution of problems via direct-embedding adiabatic quantum optimization. We discuss some of the programmability challenges in the current generation of the quantum device as well as a few possible ways to extend this work to more complex arbitrary network graphs.

Raman and infrared spectroscopic study of the molecular dynamics of N2O in inert solvents

NASA Astrophysics Data System (ADS)

Ouillon, R.

The influence of the rotational motion of the N2O molecule on its own vibrational motion does not noticeably affect the widths of v1 and v3 isotropic spectra of this molecule in inert solvents (SF6 and CCl4). The pure vibrational dephasing plays a predominant role on this band broadening as shown by comparing the experimental vibrational relaxation time with the calculated vibrational dephasing time deduced from either the binary collision (Fischer-Laubereau) or hydrodynamic model (Metiu-Oxtoby), provided the anharmonicity of the intermolecular potential, as regards the former, and the quadratic coupling terms between vibrator and bath, as regards the latter, are taken into account. Examination of the vibrational correlation functions in the framework of the Rothschild model allows a better understanding of the influence of the instantaneous distribution of vibrational frequencies and of the decay of the perturbation on the shape of the isotropic spectra and confirms that the modulation of the N2O vibration by its environment is rather rapid.

Measures and Relative Motions of Some Mostly F. G. W. Struve Doubles

NASA Astrophysics Data System (ADS)

Wiley, E. O.

2012-04-01

Measures of 59 pairs of double stars with long observational histories using "lucky imaging" techniques are reported. Relative motions of 59 pairs are investigated using histories of observation, scatter plots of relative motion, ordinary least-squares (OLS) and total proper motion analyses performed in "R," an open source programming language. A scatter plot of the coefficient of determinations derived from the OLS y|epoch and OLS x|epoch clearly separates common proper motion pairs from optical pairs and what are termed "long-period binary candidates." Differences in proper motion separate optical pairs from long-term binary candidates. An Appendix is provided that details how to use known rectilinear pairs as calibration pairs for the program REDUC.

Lump solutions to nonlinear partial differential equations via Hirota bilinear forms

NASA Astrophysics Data System (ADS)

Ma, Wen-Xiu; Zhou, Yuan

2018-02-01

Lump solutions are analytical rational function solutions localized in all directions in space. We analyze a class of lump solutions, generated from quadratic functions, to nonlinear partial differential equations. The basis of success is the Hirota bilinear formulation and the primary object is the class of positive multivariate quadratic functions. A complete determination of quadratic functions positive in space and time is given, and positive quadratic functions are characterized as sums of squares of linear functions. Necessary and sufficient conditions for positive quadratic functions to solve Hirota bilinear equations are presented, and such polynomial solutions yield lump solutions to nonlinear partial differential equations under the dependent variable transformations u = 2(ln ⁡ f) x and u = 2(ln ⁡ f) xx, where x is one spatial variable. Applications are made for a few generalized KP and BKP equations.

TOWARD PRECISE AGES FOR SINGLE STARS IN THE FIELD. GYROCHRONOLOGY CONSTRAINTS AT SEVERAL Gyr USING WIDE BINARIES. I. AGES FOR INITIAL SAMPLE

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chaname, Julio; Ramirez, Ivan

2012-02-10

We present a program designed to obtain age-rotation measurements of solar-type dwarfs to be used in the calibration of gyrochronology relations at ages of several Gyr. This is a region of parameter space crucial for the large-scale study of the Milky Way, and where the only constraint available today is that provided by the Sun. Our program takes advantage of a set of wide binaries selected so that one component is an evolved star and the other is a main-sequence star of FGK type. In this way, we obtain the age of the system from the evolved star, while themore » rotational properties of the main-sequence component provide the information relevant for gyrochronology regarding the spin-down of solar-type stars. By mining currently available catalogs of wide binaries, we assemble a sample of 37 pairs well positioned for our purposes: 19 with turnoff or subgiant primaries and 18 with white dwarf components. Using high-resolution optical spectroscopy, we measure precise stellar parameters for a subset of 15 of the pairs with turnoff/subgiant components and use these to derive isochronal ages for the corresponding systems. Ages for 16 of the 18 pairs with white dwarf components are taken from the literature. The ages of this initial sample of 31 wide binaries range from 1 to 9 Gyr, with precisions better than {approx}20% for almost half of these systems. When combined with measurements of the rotation period of their main-sequence components, these wide binary systems would potentially provide a similar number of points useful for the calibration of gyrochronology relations at very old ages.« less

Linear and quadratic static response functions and structure functions in Yukawa liquids.

PubMed

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.

Binary Sources and Binary Lenses in Microlensing Surveys of MACHOs

NASA Astrophysics Data System (ADS)

Petrovic, N.; Di Stefano, R.; Perna, R.

2003-12-01

Microlensing is an intriguing phenomenon which may yield information about the nature of dark matter. Early observational searches identified hundreds of microlensing light curves. The data set consisted mainly of point-lens light curves and binary-lens events in which the light curves exhibit caustic crossings. Very few mildly perturbed light curves were observed, although this latter type should constitute the majority of binary lens light curves. Di Stefano (2001) has suggested that the failure to take binary effects into account may have influenced the estimates of optical depth derived from microlensing surveys. The work we report on here is the first step in a systematic analysis of binary lenses and binary sources and their impact on the results of statistical microlensing surveys. In order to asses the problem, we ran Monte-Carlo simulations of various microlensing events involving binary stars (both as the source and as the lens). For each event with peak magnification > 1.34, we sampled the characteristic light curve and recorded the chi squared value when fitting the curve with a point lens model; we used this to asses the perturbation rate. We also recorded the parameters of each system, the maximum magnification, the times at which each light curve started and ended and the number of caustic crossings. We found that both the binarity of sources and the binarity of lenses increased the lensing rate. While the binarity of sources had a negligible effect on the perturbation rates of the light curves, the binarity of lenses had a notable effect. The combination of binary sources and binary lenses produces an observable rate of interesting events exhibiting multiple "repeats" in which the magnification rises above and dips below 1.34 several times. Finally, the binarity of lenses impacted both the durations of the events and the maximum magnifications. This work was supported in part by the SAO intern program (NSF grant AST-9731923) and NASA contracts NAS8-39073 and NAS8-38248 (CXC).

The Effect of Participating in Indiana's Twenty-First Century Scholars Program on College Enrollments

ERIC Educational Resources Information Center

Toutkoushian, Robert K.; Hossler, Don; DesJardins, Stephen L.; McCall, Brian; Gonzalez Canche, Manuel S.

2015-01-01

Our study adds to prior work on Indiana's Twenty-first Century Scholars(TFCS) program by focusing on whether participating in--rather than completing--the program affects the likelihood of students going to college and where they initially enrolled. We first employ binary and multinomial logistic regression to obtain estimates of the impact of the…

Towards a Fundamental Understanding of Short Period Eclipsing Binary Systems Using Kepler Data

NASA Astrophysics Data System (ADS)

Prsa, Andrej

Kepler's ultra-high precision photometry is revolutionizing stellar astrophysics. We are seeing intrinsic phenomena on an unprecedented scale, and interpreting them is both a challenge and an exciting privilege. Eclipsing binary stars are of particular significance for stellar astrophysics because precise modeling leads to fundamental parameters of the orbiting components: masses, radii, temperatures and luminosities to better than 1-2%. On top of that, eclipsing binaries are ideal physical laboratories for studying other physical phenomena, such as asteroseismic properties, chromospheric activity, proximity effects, mass transfer in close binaries, etc. Because of the eclipses, the basic geometry is well constrained, but a follow-up spectroscopy is required to get the dynamical masses and the absolute scale of the system. A conjunction of Kepler photometry and ground- based spectroscopy is a treasure trove for eclipsing binary star astrophysics. This proposal focuses on a carefully selected set of 100 short period eclipsing binary stars. The fundamental goal of the project is to study the intrinsic astrophysical effects typical of short period binaries in great detail, utilizing Kepler photometry and follow-up spectroscopy to devise a robust and consistent set of modeling results. The complementing spectroscopy is being secured from 3 approved and fully funded programs: the NOAO 4-m echelle spectroscopy at Kitt Peak (30 nights; PI Prsa), the 10- m Hobby-Eberly Telescope high-resolution spectroscopy (PI Mahadevan), and the 2.5-m Sloan Digital Sky Survey III spectroscopy (PI Mahadevan). The targets are prioritized by the projected scientific yield. Short period detached binaries host low-mass (K- and M- type) components for which the mass-radius relationship is sparsely populated and still poorly understood, as the radii appear up to 20% larger than predicted by the population models. We demonstrate the spectroscopic detection viability in the secondary-to-primary light ratio regime of ~1-2% for the circumbinary host system Kepler-16. Semi-detached binaries are ideal targets to study the dynamical processes such as mass flow and accretion, and the associated thermal processes such as intensity variation due to distortion of the lobe-filling component and material inflow collisions with accretion disks. Overcontact binaries are very abundant, yet their evolution and radiative properties are poorly understood and conflicting theories exist to explain their population frequency and structure. In addition, we will measure eclipse timing variations for all program binaries that attest to the presence of perturbing third bodies (stellar and substellar!) or dynamical interaction between the components. By a dedicated, detailed, manual modeling of these sets of targets, we will be able to use Kepler's ultra-high precision photometry to a rewarding scientific end. Thanks to the unprecedented quality of Kepler data, this will be a highly focused effort that maximizes the scientific yield and the reliability of the results. Our team has ample experience dealing with Kepler data (PI Prsa serves as chair of the Eclipsing Binary Working Group in the Kepler Science Team), spectroscopic follow-up (Co-Is Mahadevan and Bender both have experience with radial velocity instrumentation and large spectroscopic surveys), and eclipsing binary modeling (PI Prsa and Co-I Devinney both have a long record of theoretical and computational development of modeling tools). The bulk of funding we are requesting is for two postdoctoral research fellows to conduct this work at 0.5 FTE/year each, for the total of 2 years.

An Algebraic Approach for Solving Quadratic Inequalities

ERIC Educational Resources Information Center

Mahmood, Munir; Al-Mirbati, Rudaina

2017-01-01

In recent years most text books utilise either the sign chart or graphing functions in order to solve a quadratic inequality of the form ax[superscript 2] + bx + c < 0 This article demonstrates an algebraic approach to solve the above inequality. To solve a quadratic inequality in the form of ax[superscript 2] + bx + c < 0 or in the…

Effects of Classroom Instruction on Students' Understanding of Quadratic Equations

ERIC Educational Resources Information Center

Vaiyavutjamai, Pongchawee; Clements, M. A.

2006-01-01

Two hundred and thirty-one students in six Grade 9 classes in two government secondary schools located near Chiang Mai, Thailand, attempted to solve the same 18 quadratic equations before and after participating in 11 lessons on quadratic equations. Data from the students' written responses to the equations, together with data in the form of…

Computing the Partial Fraction Decomposition of Rational Functions with Irreducible Quadratic Factors in the Denominators

ERIC Educational Resources Information Center

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…

On Vieta's Formulas and the Determination of a Set of Positive Integers by Their Sum and Product

ERIC Educational Resources Information Center

Valahas, Theodoros; Boukas, Andreas

2011-01-01

In Years 9 and 10 of secondary schooling students are typically introduced to quadratic expressions and functions and related modelling, algebra, and graphing. This includes work on the expansion and factorisation of quadratic expressions (typically with integer values of coefficients), graphing quadratic functions, finding the roots of quadratic…

Sketching the General Quadratic Equation Using Dynamic Geometry Software

ERIC Educational Resources Information Center

Stols, G. H.

2005-01-01

This paper explores a geometrical way to sketch graphs of the general quadratic in two variables with Geometer's Sketchpad. To do this, a geometric procedure as described by De Temple is used, bearing in mind that this general quadratic equation (1) represents all the possible conics (conics sections), and the fact that five points (no three of…

YSOVAR: Six Pre-main-sequence Eclipsing Binaries in the Orion Nebula Cluster

DTIC Science & Technology

2012-06-25

reserved. Printed in the U.S.A. YSOVAR: SIX PRE-MAIN-SEQUENCE ECLIPSING BINARIES IN THE ORION NEBULA CLUSTER M. Morales-Calderón1,2, J. R. Stauffer1, K. G...multi-color light curves for∼2400 candidate Orion Nebula Cluster (ONC) members from our Warm Spitzer Exploration Science Program YSOVAR, we have...readable tables 1. INTRODUCTION The Orion Nebula Cluster (ONC) contains several thousand members, and since it is nearby, it provides an excellent em

Rotating and binary relativistic stars with magnetic field

NASA Astrophysics Data System (ADS)

Markakis, Charalampos

We develop a geometrical treatment of general relativistic magnetohydrodynamics for perfectly conducting fluids in Einstein--Maxwell--Euler spacetimes. The theory is applied to describe a neutron star that is rotating or is orbiting a black hole or another neutron star. Under the hypotheses of stationarity and axisymmetry, we obtain the equations governing magnetohydrodynamic equilibria of rotating neutron stars with poloidal, toroidal or mixed magnetic fields. Under the hypothesis of an approximate helical symmetry, we obtain the first law of thermodynamics governing magnetized equilibria of double neutron star or black hole - neutron star systems in close circular orbits. The first law is written as a relation between the change in the asymptotic Noether charge deltaQ and the changes in the area and electric charge of black holes, and in the vorticity, baryon rest mass, entropy, charge and magnetic flux of the magnetofluid. In an attempt to provide a better theoretical understanding of the methods used to construct models of isolated rotating stars and corotating or irrotational binaries and their unexplained convergence properties, we analytically examine the behavior of different iterative schemes near a static solution. We find the spectrum of the linearized iteration operator and show for self-consistent field methods that iterative instability corresponds to unstable modes of this operator. On the other hand, we show that the success of iteratively stable methods is due to (quasi-)nilpotency of this operator. Finally, we examine the integrability of motion of test particles in a stationary axisymmetric gravitational field. We use a direct approach to seek nontrivial constants of motion polynomial in the momenta---in addition to energy and angular momentum about the symmetry axis. We establish the existence and uniqueness of quadratic constants and the nonexistence of quartic constants for stationary axisymmetric Newtonian potentials with equatorial symmetry and elucidate their relativistic analogues.

Fast Electron Correlation Methods for Molecular Clusters without Basis Set Superposition Errors

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kamiya, Muneaki; Hirata, So; Valiev, Marat

2008-02-19

Two critical extensions to our fast, accurate, and easy-to-implement binary or ternary interaction method for weakly-interacting molecular clusters [Hirata et al. Mol. Phys. 103, 2255 (2005)] have been proposed, implemented, and applied to water hexamers, hydrogen fluoride chains and rings, and neutral and zwitterionic glycine–water clusters with an excellent result for an initial performance assessment. Our original method included up to two- or three-body Coulomb, exchange, and correlation energies exactly and higher-order Coulomb energies in the dipole–dipole approximation. In this work, the dipole moments are replaced by atom-centered point charges determined so that they reproduce the electrostatic potentials of themore » cluster subunits as closely as possible and also self-consistently with one another in the cluster environment. They have been shown to lead to dramatic improvement in the description of short-range electrostatic potentials not only of large, charge-separated subunits like zwitterionic glycine but also of small subunits. Furthermore, basis set superposition errors (BSSE) known to plague direct evaluation of weak interactions have been eliminated by com-bining the Valiron–Mayer function counterpoise (VMFC) correction with our binary or ternary interaction method in an economical fashion (quadratic scaling n2 with respect to the number of subunits n when n is small and linear scaling when n is large). A new variant of VMFC has also been proposed in which three-body and all higher-order Coulomb effects on BSSE are estimated approximately. The BSSE-corrected ternary interaction method with atom-centered point charges reproduces the VMFC-corrected results of conventional electron correlation calculations within 0.1 kcal/mol. The proposed method is significantly more accurate and also efficient than conventional correlation methods uncorrected of BSSE.« less

Partial discharge localization in power transformers based on the sequential quadratic programming-genetic algorithm adopting acoustic emission techniques

NASA Astrophysics Data System (ADS)

Liu, Hua-Long; Liu, Hua-Dong

2014-10-01

Partial discharge (PD) in power transformers is one of the prime reasons resulting in insulation degradation and power faults. Hence, it is of great importance to study the techniques of the detection and localization of PD in theory and practice. The detection and localization of PD employing acoustic emission (AE) techniques, as a kind of non-destructive testing, plus due to the advantages of powerful capability of locating and high precision, have been paid more and more attention. The localization algorithm is the key factor to decide the localization accuracy in AE localization of PD. Many kinds of localization algorithms exist for the PD source localization adopting AE techniques including intelligent and non-intelligent algorithms. However, the existed algorithms possess some defects such as the premature convergence phenomenon, poor local optimization ability and unsuitability for the field applications. To overcome the poor local optimization ability and easily caused premature convergence phenomenon of the fundamental genetic algorithm (GA), a new kind of improved GA is proposed, namely the sequence quadratic programming-genetic algorithm (SQP-GA). For the hybrid optimization algorithm, SQP-GA, the sequence quadratic programming (SQP) algorithm which is used as a basic operator is integrated into the fundamental GA, so the local searching ability of the fundamental GA is improved effectively and the premature convergence phenomenon is overcome. Experimental results of the numerical simulations of benchmark functions show that the hybrid optimization algorithm, SQP-GA, is better than the fundamental GA in the convergence speed and optimization precision, and the proposed algorithm in this paper has outstanding optimization effect. At the same time, the presented SQP-GA in the paper is applied to solve the ultrasonic localization problem of PD in transformers, then the ultrasonic localization method of PD in transformers based on the SQP-GA is proposed. And localization results based on the SQP-GA are compared with some algorithms such as the GA, some other intelligent and non-intelligent algorithms. The results of calculating examples both stimulated and spot experiments demonstrate that the localization method based on the SQP-GA can effectively prevent the results from getting trapped into the local optimum values, and the localization method is of great feasibility and very suitable for the field applications, and the precision of localization is enhanced, and the effectiveness of localization is ideal and satisfactory.

Ffuzz: Towards full system high coverage fuzz testing on binary executables

PubMed Central

2018-01-01

Bugs and vulnerabilities in binary executables threaten cyber security. Current discovery methods, like fuzz testing, symbolic execution and manual analysis, both have advantages and disadvantages when exercising the deeper code area in binary executables to find more bugs. In this paper, we designed and implemented a hybrid automatic bug finding tool—Ffuzz—on top of fuzz testing and selective symbolic execution. It targets full system software stack testing including both the user space and kernel space. Combining these two mainstream techniques enables us to achieve higher coverage and avoid getting stuck both in fuzz testing and symbolic execution. We also proposed two key optimizations to improve the efficiency of full system testing. We evaluated the efficiency and effectiveness of our method on real-world binary software and 844 memory corruption vulnerable programs in the Juliet test suite. The results show that Ffuzz can discover software bugs in the full system software stack effectively and efficiently. PMID:29791469

Data Mining the Ogle-II I-band Database for Eclipsing Binary Stars

NASA Astrophysics Data System (ADS)

Ciocca, M.

2013-08-01

The OGLE I-band database is a searchable database of quality photometric data available to the public. During Phase 2 of the experiment, known as "OGLE-II", I-band observations were made over a period of approximately 1,000 days, resulting in over 1010 measurements of more than 40 million stars. This was accomplished by using a filter with a passband near the standard Cousins Ic. The database of these observations is fully searchable using the mysql database engine, and provides the magnitude measurements and their uncertainties. In this work, a program of data mining the OGLE I-band database was performed, resulting in the discovery of 42 previously unreported eclipsing binaries. Using the software package Peranso (Vanmuster 2011) to analyze the light curves obtained from OGLE-II, the eclipsing types, the epochs and the periods of these eclipsing variables were determined, to one part in 106. A preliminary attempt to model the physical parameters of these binaries was also performed, using the Binary Maker 3 software (Bradstreet and Steelman 2004).

Kitt Peak Speckle Interferometry of Close Visual Binary Stars (Abstract)

NASA Astrophysics Data System (ADS)

Gener, R.; Rowe, D.; Smith, T. C.; Teiche, A.; Harshaw, R.; Wallace, D.; Weise, E.; Wiley, E.; Boyce, G.; Boyce, P.; Branston, D.; Chaney, K.; Clark, R. K.; Estrada, C.; Estrada, R.; Frey, T.; Green, W. L.; Haurberg, N.; Jones, G.; Kenney, J.; Loftin, S.; McGieson, I.; Patel, R.; Plummer, J.; Ridgely, J.; Trueblood, M.; Westergren, D.; Wren, P.

2014-12-01

(Abstract only) Speckle interferometry can be used to overcome normal seeing limitations by taking many very short exposures at high magnification and analyzing the resulting speckles to obtain the position angles and separations of close binary stars. A typical speckle observation of a close binary consists of 1,000 images, each 20 milliseconds in duration. The images are stored as a multi-plane FITS cube. A portable speckle interferometry system that features an electron-multiplying CCD camera was used by the authors during two week-long observing runs on the 2.1-meter telescope at Kitt Peak National Observatory to obtain some 1,000 data cubes of close binaries selected from a dozen different research programs. Many hundreds of single reference stars were also observed and used in deconvolution to remove undesirable atmospheric and telescope optical effects. The database of well over one million images was reduced with the Speckle Interferometry Tool of platesolve3. A few sample results are provided. During the second Kitt Peak run, the McMath-Pierce 1.6- and 0.8-meter solar telescopes were evaluated for nighttime speckle interferometry, while the 0.8-meter Coude feed was used to obtain differential radial velocities of short arc binaries.

Kitt Peak Speckle Interferometry of Close Visual Binary Stars

NASA Astrophysics Data System (ADS)

Genet, Russell M.; Rowe, David; Smith, Thomas C.; Teiche, Alex; Harshaw, Richard; Wallace, Daniel; Weise, Eric; Wiley, Edward; Boyce, Grady; Boyce, Patrick; Branston, Detrick; Chaney, Kayla; Clark, R. Kent; Estrada, Chris; Frey, Thomas; Estrada, Reed; Green, Wayne; Haurberg, Nathalie; Kenney, John; Jones, Greg; Loftin, Sheri; McGieson, Izak; Patel, Rikita; Plummer, Josh; Ridgely, John; Trueblood, Mark; Westergren, Donald; Wren, Paul

2015-09-01

Speckle interferometry can be used to overcome normal seeing limitations by taking many very short exposures at high magnification and analyzing the resulting speckles to obtain the position angles and separations of close binary stars. A typical speckle observation of a close binary consists of 1000 images, each 20 milliseconds in duration. The images are stored as a multi-plane FITS cube. A portable speckle interferometry system that features an electronmultiplying CCD camera was used by the authors during two week-long observing runs on the 2.1-meter telescope at Kitt Peak National Observatory to obtain some 1000 data cubes of close binaries selected from a dozen different research programs. Many hundreds of single reference stars were also observed and used in deconvolution to remove undesirable atmospheric and telescope optical effects. The data base of well over one million images was reduced with the Speckle Interferometry Tool of PlateSolve 3. A few sample results are provided. During the second Kitt Peak run, the McMath-Pierce 1.6- and 0.8-meter solar telescopes were evaluated for nighttime speckle interferometry, while the 0.8-meter Coude feed was used to obtain differential radial velocities of short arc binaries.

Bayesian model-emulation of stochastic gravitational-wave spectra for probes of the final-parsec problem with pulsar-timing arrays

NASA Astrophysics Data System (ADS)

Taylor, Stephen R.; Simon, Joseph; Sampson, Laura

2017-01-01

The final parsec of supermassive black-hole binary evolution is subject to the complex interplay of stellar loss-cone scattering, circumbinary disk accretion, and gravitational-wave emission, with binary eccentricity affected by all of these. The strain spectrum of gravitational-waves in the pulsar-timing band thus encodes rich information about the binary population's response to these various environmental mechanisms. Current spectral models have heretofore followed basic analytic prescriptions, and attempt to investigate these final-parsec mechanisms in an indirect fashion. Here we describe a new technique to directly probe the environmental properties of supermassive black-hole binaries through "Bayesian model-emulation". We perform black-hole binary population synthesis simulations at a restricted set of environmental parameter combinations, compute the strain spectra from these, then train a Gaussian process to learn the shape of the spectrum at any point in parameter space. We describe this technique, demonstrate its efficacy with a program of simulated datasets, then illustrate its power by directly constraining final-parsec physics in a Bayesian analysis of the NANOGrav 5-year dataset. The technique is fast, flexible, and robust.

Bayesian model-emulation of stochastic gravitational-wave spectra for probes of the final-parsec problem with pulsar-timing arrays

NASA Astrophysics Data System (ADS)

Taylor, Stephen; Simon, Joseph; Sampson, Laura

2017-01-01

The final parsec of supermassive black-hole binary evolution is subject to the complex interplay of stellar loss-cone scattering, circumbinary disk accretion, and gravitational-wave emission, with binary eccentricity affected by all of these. The strain spectrum of gravitational-waves in the pulsar-timing band thus encodes rich information about the binary population's response to these various environmental mechanisms. Current spectral models have heretofore followed basic analytic prescriptions, and attempt to investigate these final-parsec mechanisms in an indirect fashion. Here we describe a new technique to directly probe the environmental properties of supermassive black-hole binaries through ``Bayesian model-emulation''. We perform black-hole binary population synthesis simulations at a restricted set of environmental parameter combinations, compute the strain spectra from these, then train a Gaussian process to learn the shape of spectrum at any point in parameter space. We describe this technique, demonstrate its efficacy with a program of simulated datasets, then illustrate its power by directly constraining final-parsec physics in a Bayesian analysis of the NANOGrav 5-year dataset. The technique is fast, flexible, and robust.

Tangent Lines without Derivatives for Quadratic and Cubic Equations

ERIC Educational Resources Information Center

Carroll, William J.

2009-01-01

In the quadratic equation, y = ax[superscript 2] + bx + c, the equation y = bx + c is identified as the equation of the line tangent to the parabola at its y-intercept. This is extended to give a convenient method of graphing tangent lines at any point on the graph of a quadratic or a cubic equation. (Contains 5 figures.)

Using Linear and Quadratic Functions to Teach Number Patterns in Secondary School

ERIC Educational Resources Information Center

Kenan, Kok Xiao-Feng

2017-01-01

This paper outlines an approach to definitively find the general term in a number pattern, of either a linear or quadratic form, by using the general equation of a linear or quadratic function. This approach is governed by four principles: (1) identifying the position of the term (input) and the term itself (output); (2) recognising that each…

Geometrical Solutions of Some Quadratic Equations with Non-Real Roots

ERIC Educational Resources Information Center

Pathak, H. K.; Grewal, A. S.

2002-01-01

This note gives geometrical/graphical methods of finding solutions of the quadratic equation ax[squared] + bx + c = 0, a [not equal to] 0, with non-real roots. Three different cases which give rise to non-real roots of the quadratic equation have been discussed. In case I a geometrical construction and its proof for finding the solutions of the…

Direct Exoplanet Detection with Binary Differential Imaging

NASA Astrophysics Data System (ADS)

Rodigas, Timothy J.; Weinberger, Alycia; Mamajek, Eric E.; Males, Jared R.; Close, Laird M.; Morzinski, Katie; Hinz, Philip M.; Kaib, Nathan

2015-10-01

Binaries are typically excluded from direct imaging exoplanet surveys. However, the recent findings of Kepler and radial velocity programs show that planets can and do form in binary systems. Here, we suggest that visual binaries offer unique advantages for direct imaging. We show that Binary Differential Imaging (BDI), whereby two stars are imaged simultaneously at the same wavelength within the isoplanatic patch at a high Strehl ratio, offers improved point spread function (PSF) subtraction that can result in increased sensitivity to planets close to each star. We demonstrate this by observing a young visual binary separated by 4″ with MagAO/Clio-2 at 3.9 μm, where the Strehl ratio is high, the isoplanatic patch is large, and giant planets are bright. Comparing BDI to angular differential imaging (ADI), we find that BDI’s 5σ contrast is ˜0.5 mag better than ADI’s within ˜1″ for the particular binary we observed. Because planets typically reside close to their host stars, BDI is a promising technique for discovering exoplanets in stellar systems that are often ignored. BDI is also 2-4× more efficient than ADI and classical reference PSF subtraction, since planets can be detected around both the target and PSF reference simultaneously. We are currently exploiting this technique in a new MagAO survey for giant planets in 140 young nearby visual binaries. BDI on a space-based telescope would not be limited by isoplanatism effects and would therefore be an even more powerful tool for imaging and discovering planets. This paper includes data obtained at the 6.5 m Magellan Telescopes located at Las Campanas Observatory, Chile.

Tip-tilt disturbance model identification based on non-linear least squares fitting for Linear Quadratic Gaussian control

NASA Astrophysics Data System (ADS)

Yang, Kangjian; Yang, Ping; Wang, Shuai; Dong, Lizhi; Xu, Bing

2018-05-01

We propose a method to identify tip-tilt disturbance model for Linear Quadratic Gaussian control. This identification method based on Levenberg-Marquardt method conducts with a little prior information and no auxiliary system and it is convenient to identify the tip-tilt disturbance model on-line for real-time control. This identification method makes it easy that Linear Quadratic Gaussian control runs efficiently in different adaptive optics systems for vibration mitigation. The validity of the Linear Quadratic Gaussian control associated with this tip-tilt disturbance model identification method is verified by experimental data, which is conducted in replay mode by simulation.

Functional Data Approximation on Bounded Domains using Polygonal Finite Elements.

PubMed

Cao, Juan; Xiao, Yanyang; Chen, Zhonggui; Wang, Wenping; Bajaj, Chandrajit

2018-07-01

We construct and analyze piecewise approximations of functional data on arbitrary 2D bounded domains using generalized barycentric finite elements, and particularly quadratic serendipity elements for planar polygons. We compare approximation qualities (precision/convergence) of these partition-of-unity finite elements through numerical experiments, using Wachspress coordinates, natural neighbor coordinates, Poisson coordinates, mean value coordinates, and quadratic serendipity bases over polygonal meshes on the domain. For a convex n -sided polygon, the quadratic serendipity elements have 2 n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, rather than the usual n ( n + 1)/2 basis functions to achieve quadratic convergence. Two greedy algorithms are proposed to generate Voronoi meshes for adaptive functional/scattered data approximations. Experimental results show space/accuracy advantages for these quadratic serendipity finite elements on polygonal domains versus traditional finite elements over simplicial meshes. Polygonal meshes and parameter coefficients of the quadratic serendipity finite elements obtained by our greedy algorithms can be further refined using an L 2 -optimization to improve the piecewise functional approximation. We conduct several experiments to demonstrate the efficacy of our algorithm for modeling features/discontinuities in functional data/image approximation.

SUBOPT: A CAD program for suboptimal linear regulators

NASA Technical Reports Server (NTRS)

Fleming, P. J.

1985-01-01

An interactive software package which provides design solutions for both standard linear quadratic regulator (LQR) and suboptimal linear regulator problems is described. Intended for time-invariant continuous systems, the package is easily modified to include sampled-data systems. LQR designs are obtained by established techniques while the large class of suboptimal problems containing controller and/or performance index options is solved using a robust gradient minimization technique. Numerical examples demonstrate features of the package and recent developments are described.

Sparse Recovery via Differential Inclusions

DTIC Science & Technology

2014-07-01

2242. [Wai09] Martin J. Wainwright, Sharp thresholds for high-dimensional and noisy spar- sity recovery using l1 -constrained quadratic programming...solution, (1.11) βt = { 0, if t < 1/y; y(1− e−κ(t−1/y)), otherwise, which converges to the unbiased Bregman ISS estimator exponentially fast. Let us ...are not given the support set S, so the following two prop- erties are used to evaluate the performance of an estimator β̂. 1. Model selection

Structural Optimization of a Distributed Actuation System in a Flexible In-Plane Morphing Wing

DTIC Science & Technology

2007-06-01

Captain, USAF Approved: /signed/ 11 Jun 2007 Dr. Robert Canfield (Chairman) date /signed/ 11 Jun 2007 Dr. Brian Sanders (Member) date /signed/ 11 Jun...can be seen here at the Camp Roberts Flight Test Range [11]. separation, which ultimately increased the overall lift. During wind tunnel tests, the...Matlabr . The outermost loop was written by Mark Spillman and Dr. Robert Canfield and was based on Schittkowski’s Sequential Quadratic Programming (SQP

Modelling biochemical reaction systems by stochastic differential equations with reflection.

PubMed

Niu, Yuanling; Burrage, Kevin; Chen, Luonan

2016-05-07

In this paper, we gave a new framework for modelling and simulating biochemical reaction systems by stochastic differential equations with reflection not in a heuristic way but in a mathematical way. The model is computationally efficient compared with the discrete-state Markov chain approach, and it ensures that both analytic and numerical solutions remain in a biologically plausible region. Specifically, our model mathematically ensures that species numbers lie in the domain D, which is a physical constraint for biochemical reactions, in contrast to the previous models. The domain D is actually obtained according to the structure of the corresponding chemical Langevin equations, i.e., the boundary is inherent in the biochemical reaction system. A variant of projection method was employed to solve the reflected stochastic differential equation model, and it includes three simple steps, i.e., Euler-Maruyama method was applied to the equations first, and then check whether or not the point lies within the domain D, and if not perform an orthogonal projection. It is found that the projection onto the closure D¯ is the solution to a convex quadratic programming problem. Thus, existing methods for the convex quadratic programming problem can be employed for the orthogonal projection map. Numerical tests on several important problems in biological systems confirmed the efficiency and accuracy of this approach. Copyright © 2016 Elsevier Ltd. All rights reserved.

WW Geminorum: An Early B-type Eclipsing Binary Evolving into the Contact Phase

NASA Astrophysics Data System (ADS)

Yang, Y.-G.; Yang, Y.; Dai, H.-F.; Yin, X.-G.

2014-11-01

WW Gem is a B-type eclipsing binary with a period of 1.2378 days. The CCD photometry of this binary was performed in 2013 December using the 85 cm telescope at the Xinglong Stations of the National Astronomical Observatories of China. Using the updated W-D program, the photometric model was deduced from the VRI light curves. The results imply that WW Gem is a near-contact eclipsing binary whose primary component almost fills its Roche lobe. The photometric mass ratio is q ph = 0.48(± 0.05). All collected times of minimum light, including two new ones, were used for the period studies. The orbital period changes of WW Gem could be described by an upward parabola, possibly overlaid by a light-time orbit with a period of P mod = 7.41(± 0.04) yr and a semi-amplitude of A = 0.0079 days(± 0.0005 days), respectively. This kind of cyclic oscillation may be attributed to the light-travel time effect via the third body. The long-term period increases at a rate of dP/dt = +3.47(±0.04) × 10-8 day yr-1, which may be explained by the conserved mass transfer from the less massive component to the more massive one. With mass transfer, the massive binary WW Gem may be evolving into a contact binary.

Binary Classification using Decision Tree based Genetic Programming and Its Application to Analysis of Bio-mass Data

NASA Astrophysics Data System (ADS)

To, Cuong; Pham, Tuan D.

2010-01-01

In machine learning, pattern recognition may be the most popular task. "Similar" patterns identification is also very important in biology because first, it is useful for prediction of patterns associated with disease, for example cancer tissue (normal or tumor); second, similarity or dissimilarity of the kinetic patterns is used to identify coordinately controlled genes or proteins involved in the same regulatory process. Third, similar genes (proteins) share similar functions. In this paper, we present an algorithm which uses genetic programming to create decision tree for binary classification problem. The application of the algorithm was implemented on five real biological databases. Base on the results of comparisons with well-known methods, we see that the algorithm is outstanding in most of cases.

NPOI: recent technology and science

NASA Astrophysics Data System (ADS)

Benson, James A.; Hutter, Donald J.; Johnston, Kenneth J.; Zavala, Robert T.; White, Nathaniel M.; Pauls, Thomas A.; Gilbreath, G. C.; Armstrong, J. T.; Hindsley, Robert B.

2004-10-01

We describe recent science projects that the Navy Prototype Optical Interferometer (NPOI) scientific staff and collaborators are pursuing. Recent results from the wide angle astrometric program and imaging programs (rapid rotators, binaries and Be stars) will be summarized. We discuss some of the technology that enables the NPOI to operate routinely as an observatory astronomical instrument.

An Experimental Comparison of an Intrinsically Programed Text and a Narrative Text.

ERIC Educational Resources Information Center

Senter, R. J.; And Others

The study compared three methods of instruction in binary and octal arithmetic, i.e., (1) Norman Crowder's branched programed text, "The Arithmetic of Computers," (2) another version of this text modified so that subjects could not see the instructional material while answering "branching" questions, and (3) a narrative text…

Revealing Ozgur's Thoughts of a Quadratic Function with a Clinical Interview: Concepts and Their Underlying Reasons

ERIC Educational Resources Information Center

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…

SU-E-T-549: A Combinatorial Optimization Approach to Treatment Planning with Non-Uniform Fractions in Intensity Modulated Proton Therapy

DOE Office of Scientific and Technical Information (OSTI.GOV)

Papp, D; Unkelbach, J

2014-06-01

Purpose: Non-uniform fractionation, i.e. delivering distinct dose distributions in two subsequent fractions, can potentially improve outcomes by increasing biological dose to the target without increasing dose to healthy tissues. This is possible if both fractions deliver a similar dose to normal tissues (exploit the fractionation effect) but high single fraction doses to subvolumes of the target (hypofractionation). Optimization of such treatment plans can be formulated using biological equivalent dose (BED), but leads to intractable nonconvex optimization problems. We introduce a novel optimization approach to address this challenge. Methods: We first optimize a reference IMPT plan using standard techniques that deliversmore » a homogeneous target dose in both fractions. The method then divides the pencil beams into two sets, which are assigned to either fraction one or fraction two. The total intensity of each pencil beam, and therefore the physical dose, remains unchanged compared to the reference plan. The objectives are to maximize the mean BED in the target and to minimize the mean BED in normal tissues, which is a quadratic function of the pencil beam weights. The optimal reassignment of pencil beams to one of the two fractions is formulated as a binary quadratic optimization problem. A near-optimal solution to this problem can be obtained by convex relaxation and randomized rounding. Results: The method is demonstrated for a large arteriovenous malformation (AVM) case treated in two fractions. The algorithm yields a treatment plan, which delivers a high dose to parts of the AVM in one of the fractions, but similar doses in both fractions to the normal brain tissue adjacent to the AVM. Using the approach, the mean BED in the target was increased by approximately 10% compared to what would have been possible with a uniform reference plan for the same normal tissue mean BED.« less

Structural optimization with approximate sensitivities

NASA Technical Reports Server (NTRS)

Patnaik, S. N.; Hopkins, D. A.; Coroneos, R.

1994-01-01

Computational efficiency in structural optimization can be enhanced if the intensive computations associated with the calculation of the sensitivities, that is, gradients of the behavior constraints, are reduced. Approximation to gradients of the behavior constraints that can be generated with small amount of numerical calculations is proposed. Structural optimization with these approximate sensitivities produced correct optimum solution. Approximate gradients performed well for different nonlinear programming methods, such as the sequence of unconstrained minimization technique, method of feasible directions, sequence of quadratic programming, and sequence of linear programming. Structural optimization with approximate gradients can reduce by one third the CPU time that would otherwise be required to solve the problem with explicit closed-form gradients. The proposed gradient approximation shows potential to reduce intensive computation that has been associated with traditional structural optimization.

Quadratic spline subroutine package

USGS Publications Warehouse

Rasmussen, Lowell A.

1982-01-01

A continuous piecewise quadratic function with continuous first derivative is devised for approximating a single-valued, but unknown, function represented by a set of discrete points. The quadratic is proposed as a treatment intermediate between using the angular (but reliable, easily constructed and manipulated) piecewise linear function and using the smoother (but occasionally erratic) cubic spline. Neither iteration nor the solution of a system of simultaneous equations is necessary to determining the coefficients. Several properties of the quadratic function are given. A set of five short FORTRAN subroutines is provided for generating the coefficients (QSC), finding function value and derivatives (QSY), integrating (QSI), finding extrema (QSE), and computing arc length and the curvature-squared integral (QSK). (USGS)

Solving the Integral of Quadratic Forms of Covariance Matrices for Applications in Polarimetric Radar Imagery

NASA Astrophysics Data System (ADS)

Marino, Armando; Hajnsek, Irena

2015-04-01

In this work, the solution of quadratic forms with special application to polarimetric and interferometric covariance matrices is investigated. An analytical solution for the integral of a single quadratic form is derived. Additionally, the integral of the Pol-InSAR coherence (expressed as combination of quadratic forms) is investigated. An approximation for such integral is proposed and defined as Trace coherence. Such approximation is tested on real data to verify that the error is acceptable. The trace coherence can be used for tackle problems related to change detection. Moreover, the use of the Trace coherence in model inversion (as for the RVoG three stage inversion) will be investigated in the future.

Closed-loop stability of linear quadratic optimal systems in the presence of modeling errors

NASA Technical Reports Server (NTRS)

Toda, M.; Patel, R.; Sridhar, B.

1976-01-01

The well-known stabilizing property of linear quadratic state feedback design is utilized to evaluate the robustness of a linear quadratic feedback design in the presence of modeling errors. Two general conditions are obtained for allowable modeling errors such that the resulting closed-loop system remains stable. One of these conditions is applied to obtain two more particular conditions which are readily applicable to practical situations where a designer has information on the bounds of modeling errors. Relations are established between the allowable parameter uncertainty and the weighting matrices of the quadratic performance index, thereby enabling the designer to select appropriate weighting matrices to attain a robust feedback design.

Computer program documentation: Raw-to-processed SINDA program (RTOPHS) user's guide

NASA Technical Reports Server (NTRS)

Damico, S. J.

1980-01-01

Use of the Raw to Processed SINDA(System Improved Numerical Differencing Analyzer) Program, RTOPHS, which provides a means of making the temperature prediction data on binary HSTFLO and HISTRY units generated by SINDA available to engineers in an easy to use format, is discussed. The program accomplishes this by reading the HISTRY unit and according to user input instructions, the desired times and temperature prediction data are extracted and written to a word addressable drum file.

CASPER: A GENERALIZED PROGRAM FOR PLOTTING AND SCALING DATA

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lietzke, M.P.; Smith, R.E.

A Fortran subroutine was written to scale floating-point data and generate a magnetic tape to plot it on the Calcomp 570 digital plotter. The routine permits a great deal of flexibility, and may be used with any type of FORTRAN or FAP calling program. A simple calling program was also written to permit the user to read in data from cards and plot it without any additional programming. Both the Fortran and binary decks are available. (auth)

Three FORTRAN programs for finite-difference solutions to binary diffusion in one and two phases with composition-and time-dependent diffusion coefficients

USGS Publications Warehouse

Sanford, R.F.

1982-01-01

Geological examples of binary diffusion are numerous. They are potential indicators of the duration and rates of geological processes. Analytical solutions to the diffusion equations generally do not allow for variable diffusion coefficients, changing boundary conditions, and impingement of diffusion fields. The three programs presented here are based on Crank-Nicholson finite-difference approximations, which can take into account these complicating factors. Program 1 describes the diffusion of a component into an initially homogeneous phase that has a constant surface composition. Specifically it is written for Fe-Mg exchange in olivine at oxygen fugacities appropriate for the lunar crust, but other components, phases, or fugacities may be substituted by changing the values of the diffusion coefficient. Program 2 simulates the growth of exsolution lamellae. Program 3 describes the growth of reaction rims. These two programs are written for pseudobinary Ca-(Mg, Fe) exchange in pyroxenes. In all three programs, the diffusion coefficients and boundary conditions can be varied systematically with time. To enable users to employ widely different numerical values for diffusion coefficients and diffusion distance, the grid spacing in the space dimension and the increment by which the grid spacing in the time dimension is increased at each time step are input constants that can be varied each time the programs are run to yield a solution of the desired accuracy. ?? 1982.

Improved estimates of the physical properties of the O-star binary V1007 Sco = HD 152248 and notes on several other binaries in the NGC 6231 cluster

NASA Astrophysics Data System (ADS)

Mayer, P.; Harmanec, P.; Nesslinger, S.; Lorenz, R.; Drechsel, H.; Morrell, N.; Wolf, M.

2008-04-01

Context: In spite of the importance of massive O-type stars for astrophysics, their accurate masses and other fundamental properties are still a matter of debate. Determining them reliably is hampered by various factors (stellar winds and other forms of circumstellar matter), and the agreement of derived properties with the model predictions is far from satisfactory. Careful studies of O-type binaries, especially of those in stellar clusters, are therefore desirable. Aims: Having obtained new series of electronic spectra and UB{}V photometry of V1007 Sco, we analysed these data in an effort to check whether the observed properties of V1007 Sco indeed disagree with the prediction of stellar evolutionary models. We briefly analysed data for a few other binaries in NGC 6231, too. Methods: Spectral reductions were carried out with the MIDAS program, photometry reduced using the HEC22 program, the orbital elements were derived with the FOTEL program and the final solutions obtained with the program PHOEBE. Results: Our analysis led to an accurate determination of the apsidal advance, dotω = (0.00884±0.00012) deg d-1, based on a simultaneous solution of all usable radial-velocity and photometric data. This implies an apsidal period of 111.5 years. It is also demonstrated that the orbital inclination must be close to 67°. We arrived at the following preliminary values for masses and radii: M1 = (29.5±0.4) M⊙, M2 = (30.1±0.4) M⊙, R1 = (15.8±0.7) R⊙, and R2 = (15.3±0.5) R⊙. These values clearly indicate a log g of about 3.5 [CGS], implying that the stars are giants and not supergiants, as the standard spectral classification criteria indicate. Based on spectral and photometric observations from ESO La Silla and Cerro Tololo observatories. Tables 4 and 6 are available only in electronic form at the CDS via anonymous ftp to cdsarc.u-strasbg.fr (130.79.128.5) or via http://cdsweb.u-strasbg.fr/cgi-bin/qcat?J/A+A/481/183

VizieR Online Data Catalog: Speckle interferometry at SOAR in 2015 (Tokovinin+, 2016)

NASA Astrophysics Data System (ADS)

Tokovinin, A.; Mason, B. D.; Hartkopf, W. I.; Mendez, R. A.; Horch, E. P.

2018-01-01

The observations reported here were obtained with the high-resolution camera (HRCam)-a fast imager designed to work at the 4.1m SOAR telescope. For practical reasons, the camera was mounted on the SOAR Adaptive Module (SAM). We mostly used the Stromgren y filter (543/22nm) and the near-infrared I filter (788/132nm). The observing time for this program was allocated through NOAO (three nights, programs 15A-0097 and 15B-0009, PI A.T.) and by the Chilean National Time Allocation Committee (three nights in 2015B, program CN2015B-6, PI R.A.M.). All observations were made by A.T. Table2 lists 1303 measures of 924 resolved binary stars and subsystems, including 27 newly resolved pairs. Table3 contains the data on 360 unresolved stars, some of which are listed as binaries in the WDS or resolved here in other filters. Table4 lists 27 newly resolved pairs. (5 data files).

Fortran Program for X-Ray Photoelectron Spectroscopy Data Reformatting

NASA Technical Reports Server (NTRS)

Abel, Phillip B.

1989-01-01

A FORTRAN program has been written for use on an IBM PC/XT or AT or compatible microcomputer (personal computer, PC) that converts a column of ASCII-format numbers into a binary-format file suitable for interactive analysis on a Digital Equipment Corporation (DEC) computer running the VGS-5000 Enhanced Data Processing (EDP) software package. The incompatible floating-point number representations of the two computers were compared, and a subroutine was created to correctly store floating-point numbers on the IBM PC, which can be directly read by the DEC computer. Any file transfer protocol having provision for binary data can be used to transmit the resulting file from the PC to the DEC machine. The data file header required by the EDP programs for an x ray photoelectron spectrum is also written to the file. The user is prompted for the relevant experimental parameters, which are then properly coded into the format used internally by all of the VGS-5000 series EDP packages.

VizieR Online Data Catalog: Astrometric monitoring of ultracool dwarf binaries (Dupuy+, 2017)

NASA Astrophysics Data System (ADS)

Dupuy, T. J.; Liu, M. C.

2017-09-01

In Table 1 we list all 33 binaries in our Keck+CFHT astrometric monitoring sample, along with three other binaries that have published orbit and parallax measurements. We began obtaining resolved Keck AO astrometry in 2007-2008, and we combined our new astrometry with available data in the literature or public archives (e.g., HST and Gemini) to refine our orbital period estimates and thereby our prioritization for Keck observations. We present here new Keck/NIRC2 AO imaging and non-redundant aperture-masking observations, in addition to a re-analysis of our own previously published data and publicly available archival data for our sample binaries. Table 2 gives our measured astrometry and flux ratios for all Keck AO data used in our orbital analysis spanning 2003 Apr 15 to 2016 May 13. In total there are 339 distinct measurements (unique bandpass and epoch for a given target), where 302 of these are direct imaging and 37 are non-redundant aperture masking. Eight of the imaging measurements are from six unpublished archival data sets. See section 3.1.1 for further details. In addition to our Keck AO monitoring, we also obtained data for three T dwarf binaries over a three-year HST program using the Advanced Camera for Surveys (ACS) Wide Field Camera (WFC) in the F814W bandpass. See section 3.1.2 for further details. Many of our sample binaries have HST imaging data in the public archive. We have re-analyzed the available archival data coming from the WFPC2 Planetary Camera (WFPC2-PC1), ACS High Resolution Channel (ACS-HRC), and NICMOS Camera 1 (NICMOS-NIC1). See section 3.1.3 for further details. We present here an updated analysis of our data from the Hawaii Infrared Parallax Program that uses the CFHT facility infrared camera WIRCam. Our observing strategy and custom astrometry pipeline are described in detail in Dupuy & Liu (2012, J/ApJS/201/19). See section 3.2 for further explanations. (10 data files).

Sequential design of discrete linear quadratic regulators via optimal root-locus techniques

NASA Technical Reports Server (NTRS)

Shieh, Leang S.; Yates, Robert E.; Ganesan, Sekar

1989-01-01

A sequential method employing classical root-locus techniques has been developed in order to determine the quadratic weighting matrices and discrete linear quadratic regulators of multivariable control systems. At each recursive step, an intermediate unity rank state-weighting matrix that contains some invariant eigenvectors of that open-loop matrix is assigned, and an intermediate characteristic equation of the closed-loop system containing the invariant eigenvalues is created.

The stability of quadratic-reciprocal functional equation

NASA Astrophysics Data System (ADS)

Song, Aimin; Song, Minwei

2018-04-01

A new quadratic-reciprocal functional equation f ((k +1 )x +k y )+f ((k +1 )x -k y )=2/f (x )f (y )[(k+1 ) 2f (y )+k2f (x )] [(k+1)2f (y )-k2f (x )] 2 is introduced. The Hyers-Ulam stability for the quadratic-reciprocal functional equations is proved in Banach spaces using the direct method and the fixed point method, respectively.

Test spaces and characterizations of quadratic spaces

NASA Astrophysics Data System (ADS)

Dvurečenskij, Anatolij

1996-10-01

We show that a test space consisting of nonzero vectors of a quadratic space E and of the set all maximal orthogonal systems in E is algebraic iff E is Dacey or, equivalently, iff E is orthomodular. In addition, we present another orthomodularity criteria of quadratic spaces, and using the result of Solèr, we show that they can imply that E is a real, complex, or quaternionic Hilbert space.

A note on the relationship between the quadratic mean stand diameter and harmonic mean basal area under size-biased distribution theory

Treesearch

Jeffrey H. Gove

2003-01-01

This note seeks to extend the utility of size-biased distribution theory as applied to forestry through two relationships regarding the quadratic mean stand diameter. First, the quadratic mean stand diameter's relationship to the harmonic mean basal area for horizontal point sampling, which has been known algebraically from early on, is proved under size-biased...

Convexity Conditions and the Legendre-Fenchel Transform for the Product of Finitely Many Positive Definite Quadratic Forms

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhao Yunbin, E-mail: zhaoyy@maths.bham.ac.u

2010-12-15

While the product of finitely many convex functions has been investigated in the field of global optimization, some fundamental issues such as the convexity condition and the Legendre-Fenchel transform for the product function remain unresolved. Focusing on quadratic forms, this paper is aimed at addressing the question: When is the product of finitely many positive definite quadratic forms convex, and what is the Legendre-Fenchel transform for it? First, we show that the convexity of the product is determined intrinsically by the condition number of so-called 'scaled matrices' associated with quadratic forms involved. The main result claims that if the conditionmore » number of these scaled matrices are bounded above by an explicit constant (which depends only on the number of quadratic forms involved), then the product function is convex. Second, we prove that the Legendre-Fenchel transform for the product of positive definite quadratic forms can be expressed, and the computation of the transform amounts to finding the solution to a system of equations (or equally, finding a Brouwer's fixed point of a mapping) with a special structure. Thus, a broader question than the open 'Question 11' in Hiriart-Urruty (SIAM Rev. 49, 225-273, 2007) is addressed in this paper.« less

Quadratic Frequency Modulation Signals Parameter Estimation Based on Two-Dimensional Product Modified Parameterized Chirp Rate-Quadratic Chirp Rate Distribution.

PubMed

Qu, Zhiyu; Qu, Fuxin; Hou, Changbo; Jing, Fulong

2018-05-19

In an inverse synthetic aperture radar (ISAR) imaging system for targets with complex motion, the azimuth echo signals of the target are always modeled as multicomponent quadratic frequency modulation (QFM) signals. The chirp rate (CR) and quadratic chirp rate (QCR) estimation of QFM signals is very important to solve the ISAR image defocus problem. For multicomponent QFM (multi-QFM) signals, the conventional QR and QCR estimation algorithms suffer from the cross-term and poor anti-noise ability. This paper proposes a novel estimation algorithm called a two-dimensional product modified parameterized chirp rate-quadratic chirp rate distribution (2D-PMPCRD) for QFM signals parameter estimation. The 2D-PMPCRD employs a multi-scale parametric symmetric self-correlation function and modified nonuniform fast Fourier transform-Fast Fourier transform to transform the signals into the chirp rate-quadratic chirp rate (CR-QCR) domains. It can greatly suppress the cross-terms while strengthening the auto-terms by multiplying different CR-QCR domains with different scale factors. Compared with high order ambiguity function-integrated cubic phase function and modified Lv's distribution, the simulation results verify that the 2D-PMPCRD acquires higher anti-noise performance and obtains better cross-terms suppression performance for multi-QFM signals with reasonable computation cost.

Exact solutions to quadratic gravity

NASA Astrophysics Data System (ADS)

Pravda, V.; Pravdová, A.; Podolský, J.; Švarc, R.

2017-04-01

Since all Einstein spacetimes are vacuum solutions to quadratic gravity in four dimensions, in this paper we study various aspects of non-Einstein vacuum solutions to this theory. Most such known solutions are of traceless Ricci and Petrov type N with a constant Ricci scalar. Thus we assume the Ricci scalar to be constant which leads to a substantial simplification of the field equations. We prove that a vacuum solution to quadratic gravity with traceless Ricci tensor of type N and aligned Weyl tensor of any Petrov type is necessarily a Kundt spacetime. This will considerably simplify the search for new non-Einstein solutions. Similarly, a vacuum solution to quadratic gravity with traceless Ricci type III and aligned Weyl tensor of Petrov type II or more special is again necessarily a Kundt spacetime. Then we study the general role of conformal transformations in constructing vacuum solutions to quadratic gravity. We find that such solutions can be obtained by solving one nonlinear partial differential equation for a conformal factor on any Einstein spacetime or, more generally, on any background with vanishing Bach tensor. In particular, we show that all geometries conformal to Kundt are either Kundt or Robinson-Trautman, and we provide some explicit Kundt and Robinson-Trautman solutions to quadratic gravity by solving the above mentioned equation on certain Kundt backgrounds.

A Wavelet Bicoherence-Based Quadratic Nonlinearity Feature for Translational Axis Condition Monitoring

PubMed Central

Li, Yong; Wang, Xiufeng; Lin, Jing; Shi, Shengyu

2014-01-01

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. PMID:24473281

A Catalog of Eclipsing Binaries and Variable Stars Observed with ASTEP 400 from Dome C, Antarctica

NASA Astrophysics Data System (ADS)

Chapellier, E.; Mékarnia, D.; Abe, L.; Guillot, T.; Agabi, K.; Rivet, J.-P.; Schmider, F.-X.; Crouzet, N.; Aristidi, E.

2016-10-01

We used the large photometric database of the ASTEP program, whose primary goal was to detect exoplanets in the southern hemisphere from Antarctica, to search for eclipsing binaries (EcBs) and variable stars. 673 EcBs and 1166 variable stars were detected, including 31 previously known stars. The resulting online catalogs give the identification, the classification, the period, and the depth or semi-amplitude of each star. Data and light curves for each object are available at http://astep-vo.oca.eu.

Finite Element Simulation of Articular Contact Mechanics with Quadratic Tetrahedral Elements

PubMed Central

Maas, Steve A.; Ellis, Benjamin J.; Rawlins, David S.; Weiss, Jeffrey A.

2016-01-01

Although it is easier to generate finite element discretizations with tetrahedral elements, trilinear hexahedral (HEX8) elements are more often used in simulations of articular contact mechanics. This is due to numerical shortcomings of linear tetrahedral (TET4) elements, limited availability of quadratic tetrahedron elements in combination with effective contact algorithms, and the perceived increased computational expense of quadratic finite elements. In this study we implemented both ten-node (TET10) and fifteen-node (TET15) quadratic tetrahedral elements in FEBio (www.febio.org) and compared their accuracy, robustness in terms of convergence behavior and computational cost for simulations relevant to articular contact mechanics. Suitable volume integration and surface integration rules were determined by comparing the results of several benchmark contact problems. The results demonstrated that the surface integration rule used to evaluate the contact integrals for quadratic elements affected both convergence behavior and accuracy of predicted stresses. The computational expense and robustness of both quadratic tetrahedral formulations compared favorably to the HEX8 models. Of note, the TET15 element demonstrated superior convergence behavior and lower computational cost than both the TET10 and HEX8 elements for meshes with similar numbers of degrees of freedom in the contact problems that we examined. Finally, the excellent accuracy and relative efficiency of these quadratic tetrahedral elements was illustrated by comparing their predictions with those for a HEX8 mesh for simulation of articular contact in a fully validated model of the hip. These results demonstrate that TET10 and TET15 elements provide viable alternatives to HEX8 elements for simulation of articular contact mechanics. PMID:26900037

Comparison of hexahedral and tetrahedral elements in finite element analysis of the foot and footwear.

PubMed

Tadepalli, Srinivas C; Erdemir, Ahmet; Cavanagh, Peter R

2011-08-11

Finite element analysis has been widely used in the field of foot and footwear biomechanics to determine plantar pressures as well as stresses and strains within soft tissue and footwear materials. When dealing with anatomical structures such as the foot, hexahedral mesh generation accounts for most of the model development time due to geometric complexities imposed by branching and embedded structures. Tetrahedral meshing, which can be more easily automated, has been the approach of choice to date in foot and footwear biomechanics. Here we use the nonlinear finite element program Abaqus (Simulia, Providence, RI) to examine the advantages and disadvantages of tetrahedral and hexahedral elements under compression and shear loading, material incompressibility, and frictional contact conditions, which are commonly seen in foot and footwear biomechanics. This study demonstrated that for a range of simulation conditions, hybrid hexahedral elements (Abaqus C3D8H) consistently performed well while hybrid linear tetrahedral elements (Abaqus C3D4H) performed poorly. On the other hand, enhanced quadratic tetrahedral elements with improved stress visualization (Abaqus C3D10I) performed as well as the hybrid hexahedral elements in terms of contact pressure and contact shear stress predictions. Although the enhanced quadratic tetrahedral element simulations were computationally expensive compared to hexahedral element simulations in both barefoot and footwear conditions, the enhanced quadratic tetrahedral element formulation seems to be very promising for foot and footwear applications as a result of decreased labor and expedited model development, all related to facilitated mesh generation. Copyright © 2011. Published by Elsevier Ltd.

Robust Finite-Dimensional LQG (Linear Quadric Gaussian)-Based Controllers for a Class of Distributed Parameter Systems.

DTIC Science & Technology

1988-06-01

abilities when I lost confidence. Without her help I would not have completed the program. Next, I wish to thank Dr. Peter Maybeck, my research ...being not only a resource for my research . but also for being a friend who listened when I needed a shoulder to cry on. Finally, I wish to give thanks...considered in this research are assumed to be linear quadratic Gaussian (LQG) based controllers. This research first uses a direct approach to

Numerical study of a matrix-free trust-region SQP method for equality constrained optimization.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Heinkenschloss, Matthias; Ridzal, Denis; Aguilo, Miguel Antonio

2011-12-01

This is a companion publication to the paper 'A Matrix-Free Trust-Region SQP Algorithm for Equality Constrained Optimization' [11]. In [11], we develop and analyze a trust-region sequential quadratic programming (SQP) method that supports the matrix-free (iterative, in-exact) solution of linear systems. In this report, we document the numerical behavior of the algorithm applied to a variety of equality constrained optimization problems, with constraints given by partial differential equations (PDEs).

On the structure of nonlinear constitutive equations for fiber reinforced composites

NASA Technical Reports Server (NTRS)

Jansson, Stefan

1992-01-01

The structure of constitutive equations for nonlinear multiaxial behavior of transversely isotropic fiber reinforced metal matrix composites subject to proportional loading was investigated. Results from an experimental program were combined with numerical simulations of the composite behavior for complex stress to reveal the full structure of the equations. It was found that the nonlinear response can be described by a quadratic flow-potential, based on the polynomial stress invariants, together with a hardening rule that is dominated by two different hardening mechanisms.

F100 multivariable control synthesis program: Evaluation of a multivariable control using a real-time engine simulation

NASA Technical Reports Server (NTRS)

Szuch, J. R.; Soeder, J. F.; Seldner, K.; Cwynar, D. S.

1977-01-01

The design, evaluation, and testing of a practical, multivariable, linear quadratic regulator control for the F100 turbofan engine were accomplished. NASA evaluation of the multivariable control logic and implementation are covered. The evaluation utilized a real time, hybrid computer simulation of the engine. Results of the evaluation are presented, and recommendations concerning future engine testing of the control are made. Results indicated that the engine testing of the control should be conducted as planned.

Advanced Energy Storage Management in Distribution Network

DOE Office of Scientific and Technical Information (OSTI.GOV)

Liu, Guodong; Ceylan, Oguzhan; Xiao, Bailu

2016-01-01

With increasing penetration of distributed generation (DG) in the distribution networks (DN), the secure and optimal operation of DN has become an important concern. In this paper, an iterative mixed integer quadratic constrained quadratic programming model to optimize the operation of a three phase unbalanced distribution system with high penetration of Photovoltaic (PV) panels, DG and energy storage (ES) is developed. The proposed model minimizes not only the operating cost, including fuel cost and purchasing cost, but also voltage deviations and power loss. The optimization model is based on the linearized sensitivity coefficients between state variables (e.g., node voltages) andmore » control variables (e.g., real and reactive power injections of DG and ES). To avoid slow convergence when close to the optimum, a golden search method is introduced to control the step size and accelerate the convergence. The proposed algorithm is demonstrated on modified IEEE 13 nodes test feeders with multiple PV panels, DG and ES. Numerical simulation results validate the proposed algorithm. Various scenarios of system configuration are studied and some critical findings are concluded.« less

Analysis of explicit model predictive control for path-following control

PubMed Central

2018-01-01

In this paper, explicit Model Predictive Control(MPC) is employed for automated lane-keeping systems. MPC has been regarded as the key to handle such constrained systems. However, the massive computational complexity of MPC, which employs online optimization, has been a major drawback that limits the range of its target application to relatively small and/or slow problems. Explicit MPC can reduce this computational burden using a multi-parametric quadratic programming technique(mp-QP). The control objective is to derive an optimal front steering wheel angle at each sampling time so that autonomous vehicles travel along desired paths, including straight, circular, and clothoid parts, at high entry speeds. In terms of the design of the proposed controller, a method of choosing weighting matrices in an optimization problem and the range of horizons for path-following control are described through simulations. For the verification of the proposed controller, simulation results obtained using other control methods such as MPC, Linear-Quadratic Regulator(LQR), and driver model are employed, and CarSim, which reflects the features of a vehicle more realistically than MATLAB/Simulink, is used for reliable demonstration. PMID:29534080

Analysis of explicit model predictive control for path-following control.

PubMed

Lee, Junho; Chang, Hyuk-Jun

2018-01-01

In this paper, explicit Model Predictive Control(MPC) is employed for automated lane-keeping systems. MPC has been regarded as the key to handle such constrained systems. However, the massive computational complexity of MPC, which employs online optimization, has been a major drawback that limits the range of its target application to relatively small and/or slow problems. Explicit MPC can reduce this computational burden using a multi-parametric quadratic programming technique(mp-QP). The control objective is to derive an optimal front steering wheel angle at each sampling time so that autonomous vehicles travel along desired paths, including straight, circular, and clothoid parts, at high entry speeds. In terms of the design of the proposed controller, a method of choosing weighting matrices in an optimization problem and the range of horizons for path-following control are described through simulations. For the verification of the proposed controller, simulation results obtained using other control methods such as MPC, Linear-Quadratic Regulator(LQR), and driver model are employed, and CarSim, which reflects the features of a vehicle more realistically than MATLAB/Simulink, is used for reliable demonstration.

Vehicle dynamics control of four in-wheel motor drive electric vehicle using gain scheduling based on tyre cornering stiffness estimation

NASA Astrophysics Data System (ADS)

Xiong, Lu; Yu, Zhuoping; Wang, Yang; Yang, Chen; Meng, Yufeng

2012-06-01

This paper focuses on the vehicle dynamic control system for a four in-wheel motor drive electric vehicle, aiming at improving vehicle stability under critical driving conditions. The vehicle dynamics controller is composed of three modules, i.e. motion following control, control allocation and vehicle state estimation. Considering the strong nonlinearity of the tyres under critical driving conditions, the yaw motion of the vehicle is regulated by gain scheduling control based on the linear quadratic regulator theory. The feed-forward and feedback gains of the controller are updated in real-time by online estimation of the tyre cornering stiffness, so as to ensure the control robustness against environmental disturbances as well as parameter uncertainty. The control allocation module allocates the calculated generalised force requirements to each in-wheel motor based on quadratic programming theory while taking the tyre longitudinal/lateral force coupling characteristic into consideration. Simulations under a variety of driving conditions are carried out to verify the control algorithm. Simulation results indicate that the proposed vehicle stability controller can effectively stabilise the vehicle motion under critical driving conditions.

Controller design approach based on linear programming.

PubMed

Tanaka, Ryo; Shibasaki, Hiroki; Ogawa, Hiromitsu; Murakami, Takahiro; Ishida, Yoshihisa

2013-11-01

This study explains and demonstrates the design method for a control system with a load disturbance observer. Observer gains are determined by linear programming (LP) in terms of the Routh-Hurwitz stability criterion and the final-value theorem. In addition, the control model has a feedback structure, and feedback gains are determined to be the linear quadratic regulator. The simulation results confirmed that compared with the conventional method, the output estimated by our proposed method converges to a reference input faster when a load disturbance is added to a control system. In addition, we also confirmed the effectiveness of the proposed method by performing an experiment with a DC motor. © 2013 ISA. Published by ISA. All rights reserved.

DEM interpolation weight calculation modulus based on maximum entropy

NASA Astrophysics Data System (ADS)

Chen, Tian-wei; Yang, Xia

2015-12-01

There is negative-weight in traditional interpolation of gridding DEM, in the article, the principle of Maximum Entropy is utilized to analyze the model system which depends on modulus of space weight. Negative-weight problem of the DEM interpolation is researched via building Maximum Entropy model, and adding nonnegative, first and second order's Moment constraints, the negative-weight problem is solved. The correctness and accuracy of the method was validated with genetic algorithm in matlab program. The method is compared with the method of Yang Chizhong interpolation and quadratic program. Comparison shows that the volume and scaling of Maximum Entropy's weight is fit to relations of space and the accuracy is superior to the latter two.

Digital program for solving the linear stochastic optimal control and estimation problem

NASA Technical Reports Server (NTRS)

Geyser, L. C.; Lehtinen, B.

1975-01-01

A computer program is described which solves the linear stochastic optimal control and estimation (LSOCE) problem by using a time-domain formulation. The LSOCE problem is defined as that of designing controls for a linear time-invariant system which is disturbed by white noise in such a way as to minimize a performance index which is quadratic in state and control variables. The LSOCE problem and solution are outlined; brief descriptions are given of the solution algorithms, and complete descriptions of each subroutine, including usage information and digital listings, are provided. A test case is included, as well as information on the IBM 7090-7094 DCS time and storage requirements.

New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints.

PubMed

Benko, Matúš; Gfrerer, Helmut

2018-01-01

In this paper, we consider a sufficiently broad class of non-linear mathematical programs with disjunctive constraints, which, e.g. include mathematical programs with complemetarity/vanishing constraints. We present an extension of the concept of [Formula: see text]-stationarity which can be easily combined with the well-known notion of M-stationarity to obtain the stronger property of so-called [Formula: see text]-stationarity. We show how the property of [Formula: see text]-stationarity (and thus also of M-stationarity) can be efficiently verified for the considered problem class by computing [Formula: see text]-stationary solutions of a certain quadratic program. We consider further the situation that the point which is to be tested for [Formula: see text]-stationarity, is not known exactly, but is approximated by some convergent sequence, as it is usually the case when applying some numerical method.

Machine Learning Through Signature Trees. Applications to Human Speech.

ERIC Educational Resources Information Center

White, George M.

A signature tree is a binary decision tree used to classify unknown patterns. An attempt was made to develop a computer program for manipulating signature trees as a general research tool for exploring machine learning and pattern recognition. The program was applied to the problem of speech recognition to test its effectiveness for a specific…

Two-color walking Peregrine solitary waves.

PubMed

Baronio, Fabio; Chen, Shihua; Mihalache, Dumitru

2017-09-15

We study the extreme localization of light, evolving upon a non-zero background, in two-color parametric wave interaction in nonlinear quadratic media. We report the existence of quadratic Peregrine solitary waves, in the presence of significant group-velocity mismatch between the waves (or Poynting vector beam walk-off), in the regime of cascading second-harmonic generation. This finding opens a novel path for the experimental demonstration of extreme rogue waves in ultrafast quadratic nonlinear optics.

Self-accelerating parabolic beams in quadratic nonlinear media

NASA Astrophysics Data System (ADS)

Dolev, Ido; Libster, Ana; Arie, Ady

2012-09-01

We present experimental observation of self-accelerating parabolic beams in quadratic nonlinear media. We show that the intensity peaks of the first and second harmonics are asynchronous with respect to one another in the two transverse coordinates. In addition, the two coupled harmonics have the same acceleration within and after the nonlinear medium. We also study the evolution of second harmonic accelerating beams inside the quadratic media and their correlation with theoretical beams.

Global stability and quadratic Hamiltonian structure in Lotka-Volterra and quasi-polynomial systems

NASA Astrophysics Data System (ADS)

Szederkényi, Gábor; Hangos, Katalin M.

2004-04-01

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.

Directional passability and quadratic steering logic for pyramid-type single gimbal control moment gyros

NASA Astrophysics Data System (ADS)

Yamada, Katsuhiko; Jikuya, Ichiro

2014-09-01

Singularity analysis and the steering logic of pyramid-type single gimbal control moment gyros are studied. First, a new concept of directional passability in a specified direction is introduced to investigate the structure of an elliptic singular surface. The differences between passability and directional passability are discussed in detail and are visualized for 0H, 2H, and 4H singular surfaces. Second, quadratic steering logic (QSL), a new steering logic for passing the singular surface, is investigated. The algorithm is based on the quadratic constrained quadratic optimization problem and is reduced to the Newton method by using Gröbner bases. The proposed steering logic is demonstrated through numerical simulations for both constant torque maneuvering examples and attitude control examples.

Determining the Separation and Position Angles of Orbiting Binary Stars: Comparison of Three Methods

NASA Astrophysics Data System (ADS)

Walsh, Ryan; Boule, Cory; Andrews, Katelyn; Penfield, Andrew; Ross, Ian; Lucas, Gaylon; Braught, Trisha; Harfenist, Steven; Goodale, Keith

2015-07-01

To initiate a long term binary star research program, undergraduate students compared the accuracy and ease of measuring the separations and position angles of three long period binary pairs using three different measurement techniques. It was found that digital image capture using BackyardEOS software and subsequent analysis in Adobe Photoshop was the most accurate and easiest to use of our three methods. The systems WDS J17419+7209 (STF 2241AB), WDS 19418+5032 (STFA 46AB), and WDS 16362+5255 (STF 2087AB) were found to have separations and position angles of: 30", 16°; 39.7", 133°; and 3.1", 104°, respectively. This method produced separation values within 1.3" and position angle values within 1.3° of the most recently observed values found in the Washington Double Star Catalog.

A PC-based bus monitor program for use with the transport systems research vehicle RS-232 communication interfaces

NASA Technical Reports Server (NTRS)

Easley, Wesley C.

1991-01-01

Experiment critical use of RS-232 data busses in the Transport Systems Research Vehicle (TSRV) operated by the Advanced Transport Operating Systems Program Office at the NASA Langley Research Center has recently increased. Each application utilizes a number of nonidentical computer and peripheral configurations and requires task specific software development. To aid these development tasks, an IBM PC-based RS-232 bus monitoring system was produced. It can simultaneously monitor two communication ports of a PC or clone, including the nonstandard bus expansion of the TSRV Grid laptop computers. Display occurs in a separate window for each port's input with binary display being selectable. A number of other features including binary log files, screen capture to files, and a full range of communication parameters are provided.

WW Geminorum: An early B-type eclipsing binary evolving into the contact phase

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yang, Y.-G.; Dai, H.-F.; Yin, X.-G.

2014-11-01

WW Gem is a B-type eclipsing binary with a period of 1.2378 days. The CCD photometry of this binary was performed in 2013 December using the 85 cm telescope at the Xinglong Stations of the National Astronomical Observatories of China. Using the updated W-D program, the photometric model was deduced from the VRI light curves. The results imply that WW Gem is a near-contact eclipsing binary whose primary component almost fills its Roche lobe. The photometric mass ratio is q {sub ph} = 0.48(± 0.05). All collected times of minimum light, including two new ones, were used for the periodmore » studies. The orbital period changes of WW Gem could be described by an upward parabola, possibly overlaid by a light-time orbit with a period of P {sub mod} = 7.41(± 0.04) yr and a semi-amplitude of A = 0.0079 days(± 0.0005 days), respectively. This kind of cyclic oscillation may be attributed to the light-travel time effect via the third body. The long-term period increases at a rate of dP/dt = +3.47(±0.04) × 10{sup –8} day yr{sup –1}, which may be explained by the conserved mass transfer from the less massive component to the more massive one. With mass transfer, the massive binary WW Gem may be evolving into a contact binary.« less

Retention prediction of highly polar ionizable solutes under gradient conditions on a mixed-mode reversed-phase and weak anion-exchange stationary phase.

PubMed

Balkatzopoulou, P; Fasoula, S; Gika, H; Nikitas, P; Pappa-Louisi, A

2015-05-29

In the present work the retention of three highly polar and ionizable solutes - uric acid, nicotinic acid and ascorbic acid - was investigated on a mixed-mode reversed-phase and weak anion-exchange (RP/WAX) stationary phase in buffered aqueous acetonitrile (ACN) mobile phases. A U-shaped retention behavior was observed for all solutes with respect to the eluent organic modifier content studied in a range of 5-95% (v/v). This retention behavior clearly demonstrates the presence of a HILIC-type retention mechanism at ACN-rich hydro-organic eluents and an RP-like retention at aqueous-rich hydro-organic eluents. Hence, this column should be promising for application under both RP and HILIC gradient elution modes. For this reason, a series of programmed elution runs were carried out with increasing (RP) and decreasing (HILIC) organic solvent concentration in the mobile phase. This dual gradient process was successfully modeled by two retention models exhibiting a quadratic or a cubic dependence of the logarithm of the solute retention factor (lnk) upon the organic modifier volume fraction (φ). It was found that both models produced by gradient retention data allow the prediction of solute retention times for both types of programmed elution on the mixed-mode column. Four, in the case of the quadratic model, or five, in the case of the cubic model, initial HILIC- and RP-type gradient runs gave satisfactory retention predictions of any similar kind elution program, even with different flow rate, with an overall error of only 2.5 or 1.7%, respectively. Copyright © 2015 Elsevier B.V. All rights reserved.

Object tracking on mobile devices using binary descriptors

NASA Astrophysics Data System (ADS)

Savakis, Andreas; Quraishi, Mohammad Faiz; Minnehan, Breton

2015-03-01

With the growing ubiquity of mobile devices, advanced applications are relying on computer vision techniques to provide novel experiences for users. Currently, few tracking approaches take into consideration the resource constraints on mobile devices. Designing efficient tracking algorithms and optimizing performance for mobile devices can result in better and more efficient tracking for applications, such as augmented reality. In this paper, we use binary descriptors, including Fast Retina Keypoint (FREAK), Oriented FAST and Rotated BRIEF (ORB), Binary Robust Independent Features (BRIEF), and Binary Robust Invariant Scalable Keypoints (BRISK) to obtain real time tracking performance on mobile devices. We consider both Google's Android and Apple's iOS operating systems to implement our tracking approach. The Android implementation is done using Android's Native Development Kit (NDK), which gives the performance benefits of using native code as well as access to legacy libraries. The iOS implementation was created using both the native Objective-C and the C++ programing languages. We also introduce simplified versions of the BRIEF and BRISK descriptors that improve processing speed without compromising tracking accuracy.

Characterization Of Improved Binary Phase-Only Filters In A Real-Time Coherent Optical Correlation System

NASA Astrophysics Data System (ADS)

Flannery, D.; Keller, P.; Cartwright, S.; Loomis, J.

1987-06-01

Attractive correlation system performance potential is possible using magneto-optic spatial light modulators (SLM) to implement binary phase-only reference filters at high rates, provided the correlation performance of such reduced-information-content filters is adequate for the application. In the case studied here, the desired filter impulse response is a rectangular shape, which cannot be achieved with the usual binary phase-only filter formulation. The correlation application problem is described and techniques for synthesizing improved filter impulse response are considered. A compromise solution involves the cascading of a fixed amplitude-only weighting mask with the binary phase-only SLM. Based on simulations presented, this approach provides improved impulse responses and good correlation performance, while retaining the critical feature of real-time variations of the size, shape, and orientation of the rectangle by electronic programming of the phase pattern in the SLM. Simulations indicate that, for at least one very challenging input scene clutter situation, these filters provide higher correlation signal-to-noise than does "ideal" correlation, i.e. using a perfect rectangle filter response.

VizieR Online Data Catalog: Orbits based on SOAR speckle interferometry. II. (Tokovinin, 2017)

NASA Astrophysics Data System (ADS)

Tokovinin, A.

2018-01-01

We present new or updated orbits of 44 binary systems or subsystems. It is based on speckle interferometric measurements made at the 4.1m Southern Astrophysical Research (SOAR) telescope (Tokovinin et al. 2010, Cat. J/AJ/139/743; 2014, Cat. J/AJ/147/123; 2015, Cat. J/AJ/150/50; 2016, Cat. J/AJ/151/153; 2010PASP..122.1483T; Tokovinin 2012, Cat. J/AJ/144/56) combined with archival data collected in the Washington Double Star Catalog (WDS; Mason et al. 2001-2014, Cat. B/wds). It continues previous work on binary orbits resulting from the SOAR speckle program and follows the template of the Paper I (Tokovinin 2016, Cat. J/AJ/152/138), where the motivation is discussed. Briefly, the calculation of binary orbits is part of the astronomical infrastructure, and visual orbital elements are used in many areas. The state of the art is reflected in the Sixth Catalog of Visual Binary Orbits (VB6; Hartkopf et al. 2001AJ....122.3472H; http://www.usno.navy.mil/USNO/astrometry/optical-IR-prod/wds/orb6.html). (5 data files).

Fluence map optimization (FMO) with dose-volume constraints in IMRT using the geometric distance sorting method.

PubMed

Lan, Yihua; Li, Cunhua; Ren, Haozheng; Zhang, Yong; Min, Zhifang

2012-10-21

A new heuristic algorithm based on the so-called geometric distance sorting technique is proposed for solving the fluence map optimization with dose-volume constraints which is one of the most essential tasks for inverse planning in IMRT. The framework of the proposed method is basically an iterative process which begins with a simple linear constrained quadratic optimization model without considering any dose-volume constraints, and then the dose constraints for the voxels violating the dose-volume constraints are gradually added into the quadratic optimization model step by step until all the dose-volume constraints are satisfied. In each iteration step, an interior point method is adopted to solve each new linear constrained quadratic programming. For choosing the proper candidate voxels for the current dose constraint adding, a so-called geometric distance defined in the transformed standard quadratic form of the fluence map optimization model was used to guide the selection of the voxels. The new geometric distance sorting technique can mostly reduce the unexpected increase of the objective function value caused inevitably by the constraint adding. It can be regarded as an upgrading to the traditional dose sorting technique. The geometry explanation for the proposed method is also given and a proposition is proved to support our heuristic idea. In addition, a smart constraint adding/deleting strategy is designed to ensure a stable iteration convergence. The new algorithm is tested on four cases including head-neck, a prostate, a lung and an oropharyngeal, and compared with the algorithm based on the traditional dose sorting technique. Experimental results showed that the proposed method is more suitable for guiding the selection of new constraints than the traditional dose sorting method, especially for the cases whose target regions are in non-convex shapes. It is a more efficient optimization technique to some extent for choosing constraints than the dose sorting method. By integrating a smart constraint adding/deleting scheme within the iteration framework, the new technique builds up an improved algorithm for solving the fluence map optimization with dose-volume constraints.

Estimation of the standardized ileal digestible valine to lysine ratio required for 25- to 120-kilogram pigs fed low crude protein diets supplemented with crystalline amino acids.

PubMed

Liu, X T; Ma, W F; Zeng, X F; Xie, C Y; Thacker, P A; Htoo, J K; Qiao, S Y

2015-10-01

Four 28-d experiments were conducted to determine the standardized ileal digestible (SID) valine (Val) to lysine (Lys) ratio required for 26- to 46- (Exp. 1), 49- to 70- (Exp. 2), 71- to 92- (Exp. 3), and 94- to 119-kg (Exp. 4) pigs fed low CP diets supplemented with crystalline AA. The first 3 experiments utilized 150 pigs (Duroc × Landrace × Large White), while Exp. 4 utilized 90 finishing pigs. Pigs in all 4 experiments were randomly allocated to 1 of 5 diets with 6 pens per treatment (3 pens of barrows and 3 pens of gilts) and 5 pigs per pen for the first 3 experiments and 3 pigs per pen for Exp. 4. Diets for all experiments were formulated to contain SID Val to Lys ratios of 0.55, 0.60, 0.65, 0.70, or 0.75. In Exp. 1 (26 to 46 kg), ADG increased (linear, = 0.039; quadratic, = 0.042) with an increasing dietary Val:Lys ratio. The SID Val:Lys ratio to maximize ADG was 0.62 using a linear broken-line model and 0.71 using a quadratic model. In Exp. 2 (49 to 70 kg), ADG increased (linear, = 0.021; quadratic, = 0.042) as the SID Val:Lys ratio increased. G:F improved (linear, = 0.039) and serum urea nitrogen (SUN) decreased (linear, = 0.021; quadratic, = 0.024) with an increased SID Val:Lys ratio. The SID Val:Lys ratios to maximize ADG as well as to minimize SUN levels were 0.67 and 0.65, respectively, using a linear broken-line model and 0.72 and 0.71, respectively, using a quadratic model. In Exp. 3 (71 to 92 kg), ADG increased (linear, = 0.007; quadratic, = 0.022) and SUN decreased (linear, = 0.011; quadratic, = 0.034) as the dietary SID Val:Lys ratio increased. The SID Val:Lys ratios to maximize ADG as well as to minimize SUN levels were 0.67 and 0.67, respectively, using a linear broken-line model and 0.72 and 0.74, respectively, using a quadratic model. In Exp. 4 (94 to 119 kg), ADG increased (linear, = 0.041) and G:F was improved (linear, = 0.004; quadratic, = 0.005) as the dietary SID Val:Lys ratio increased. The SID Val:Lys ratio to maximize G:F was 0.68 using a linear broken-line model and 0.72 using a quadratic model. Carcass traits and muscle quality were not influenced by SID Val:Lys ratio. In conclusion, the dietary SID Val:Lys ratios required for 26- to 46-, 49- to 70-, 71- to 92-, and 94- to 119-kg pigs were estimated to be 0.62, 0.66, 0.67, and 0.68, respectively, using a linear broken-line model and 0.71, 0.72, 0.73, and 0.72, respectively, using a quadratic model.

Geometrical and Graphical Solutions of Quadratic Equations.

ERIC Educational Resources Information Center

Hornsby, E. John, Jr.

1990-01-01

Presented are several geometrical and graphical methods of solving quadratic equations. Discussed are Greek origins, Carlyle's method, von Staudt's method, fixed graph methods and imaginary solutions. (CW)

Finite element simulation of articular contact mechanics with quadratic tetrahedral elements.

PubMed

Maas, Steve A; Ellis, Benjamin J; Rawlins, David S; Weiss, Jeffrey A

2016-03-21

Although it is easier to generate finite element discretizations with tetrahedral elements, trilinear hexahedral (HEX8) elements are more often used in simulations of articular contact mechanics. This is due to numerical shortcomings of linear tetrahedral (TET4) elements, limited availability of quadratic tetrahedron elements in combination with effective contact algorithms, and the perceived increased computational expense of quadratic finite elements. In this study we implemented both ten-node (TET10) and fifteen-node (TET15) quadratic tetrahedral elements in FEBio (www.febio.org) and compared their accuracy, robustness in terms of convergence behavior and computational cost for simulations relevant to articular contact mechanics. Suitable volume integration and surface integration rules were determined by comparing the results of several benchmark contact problems. The results demonstrated that the surface integration rule used to evaluate the contact integrals for quadratic elements affected both convergence behavior and accuracy of predicted stresses. The computational expense and robustness of both quadratic tetrahedral formulations compared favorably to the HEX8 models. Of note, the TET15 element demonstrated superior convergence behavior and lower computational cost than both the TET10 and HEX8 elements for meshes with similar numbers of degrees of freedom in the contact problems that we examined. Finally, the excellent accuracy and relative efficiency of these quadratic tetrahedral elements was illustrated by comparing their predictions with those for a HEX8 mesh for simulation of articular contact in a fully validated model of the hip. These results demonstrate that TET10 and TET15 elements provide viable alternatives to HEX8 elements for simulation of articular contact mechanics. Copyright © 2016 Elsevier Ltd. All rights reserved.

Linear quadratic optimization for positive LTI system

NASA Astrophysics Data System (ADS)

Muhafzan, Yenti, Syafrida Wirma; Zulakmal

2017-05-01

Nowaday the linear quadratic optimization subject to positive linear time invariant (LTI) system constitute an interesting study considering it can become a mathematical model of variety of real problem whose variables have to nonnegative and trajectories generated by these variables must be nonnegative. In this paper we propose a method to generate an optimal control of linear quadratic optimization subject to positive linear time invariant (LTI) system. A sufficient condition that guarantee the existence of such optimal control is discussed.

An optimal consumption and investment problem with quadratic utility and negative wealth constraints.

PubMed

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.

Photon-phonon parametric oscillation induced by quadratic coupling in an optomechanical resonator

NASA Astrophysics Data System (ADS)

Zhang, Lin; Ji, Fengzhou; Zhang, Xu; Zhang, Weiping

2017-07-01

A direct photon-phonon parametric effect of quadratic coupling on the mean-field dynamics of an optomechanical resonator in the large-scale-movement regime is found and investigated. Under a weak pumping power, the mechanical resonator damps to a steady state with a nonlinear static response sensitively modified by the quadratic coupling. When the driving power increases beyond the static energy balance, the steady states lose their stabilities via Hopf bifurcations, and the resonator produces stable self-sustained oscillation (limit-circle behavior) of discrete energies with step-like amplitudes due to the parametric effect of quadratic coupling, which can be understood roughly by the power balance between gain and loss on the resonator. A further increase in the pumping power can induce a chaotic dynamic of the resonator via a typical routine of period-doubling bifurcation, but which can be stabilized by the parametric effect through an inversion-bifurcation process back to the limit-circle states. The bifurcation-to-inverse-bifurcation transitions are numerically verified by the maximal Lyapunov exponents of the dynamics, which indicate an efficient way of suppressing the chaotic behavior of the optomechanical resonator by quadratic coupling. Furthermore, the parametric effect of quadratic coupling on the dynamic transitions of an optomechanical resonator can be conveniently detected or traced by the output power spectrum of the cavity field.

Mapping the absolute magnetic field and evaluating the quadratic Zeeman-effect-induced systematic error in an atom interferometer gravimeter

NASA Astrophysics Data System (ADS)

Hu, Qing-Qing; Freier, Christian; Leykauf, Bastian; Schkolnik, Vladimir; Yang, Jun; Krutzik, Markus; Peters, Achim

2017-09-01

Precisely evaluating the systematic error induced by the quadratic Zeeman effect is important for developing atom interferometer gravimeters aiming at an accuracy in the μ Gal regime (1 μ Gal =10-8m /s2 ≈10-9g ). This paper reports on the experimental investigation of Raman spectroscopy-based magnetic field measurements and the evaluation of the systematic error in the gravimetric atom interferometer (GAIN) due to quadratic Zeeman effect. We discuss Raman duration and frequency step-size-dependent magnetic field measurement uncertainty, present vector light shift and tensor light shift induced magnetic field measurement offset, and map the absolute magnetic field inside the interferometer chamber of GAIN with an uncertainty of 0.72 nT and a spatial resolution of 12.8 mm. We evaluate the quadratic Zeeman-effect-induced gravity measurement error in GAIN as 2.04 μ Gal . The methods shown in this paper are important for precisely mapping the absolute magnetic field in vacuum and reducing the quadratic Zeeman-effect-induced systematic error in Raman transition-based precision measurements, such as atomic interferometer gravimeters.

Linear state feedback, quadratic weights, and closed loop eigenstructures. M.S. Thesis. Final Report

NASA Technical Reports Server (NTRS)

Thompson, P. M.

1980-01-01

Equations are derived for the angles of general multivariable root loci and linear quadratic optimal root loci, including angles of departure and approach. The generalized eigenvalue problem is used to compute angles of approach. Equations are also derived to find the sensitivity of closed loop eigenvalue and the directional derivatives of closed loop eigenvectors. An equivalence class of quadratic weights that produce the same asymptotic eigenstructure is defined, a canonical element is defined, and an algorithm to find it is given. The behavior of the optimal root locus in the nonasymptotic region is shown to be different for quadratic weights with the same asymptotic properties. An algorithm is presented that can be used to select a feedback gain matrix for the linear state feedback problem which produces a specified asymptotic eigenstructure. Another algorithm is given to compute the asymptotic eigenstructure properties inherent in a given set of quadratic weights. Finally, it is shown that optimal root loci for nongeneric problems can be approximated by generic ones in the nonasymptotic region.

A Sequence of Sorting Strategies.

ERIC Educational Resources Information Center

Duncan, David R.; Litwiller, Bonnie H.

1984-01-01

Describes eight increasingly sophisticated and efficient sorting algorithms including linear insertion, binary insertion, shellsort, bubble exchange, shakersort, quick sort, straight selection, and tree selection. Provides challenges for the reader and the student to program these efficiently. (JM)

Adaptive bi-level programming for optimal gene knockouts for targeted overproduction under phenotypic constraints

PubMed Central

2013-01-01

Background Optimization procedures to identify gene knockouts for targeted biochemical overproduction have been widely in use in modern metabolic engineering. Flux balance analysis (FBA) framework has provided conceptual simplifications for genome-scale dynamic analysis at steady states. Based on FBA, many current optimization methods for targeted bio-productions have been developed under the maximum cell growth assumption. The optimization problem to derive gene knockout strategies recently has been formulated as a bi-level programming problem in OptKnock for maximum targeted bio-productions with maximum growth rates. However, it has been shown that knockout mutants in fact reach the steady states with the minimization of metabolic adjustment (MOMA) from the corresponding wild-type strains instead of having maximal growth rates after genetic or metabolic intervention. In this work, we propose a new bi-level computational framework--MOMAKnock--which can derive robust knockout strategies under the MOMA flux distribution approximation. Methods In this new bi-level optimization framework, we aim to maximize the production of targeted chemicals by identifying candidate knockout genes or reactions under phenotypic constraints approximated by the MOMA assumption. Hence, the targeted chemical production is the primary objective of MOMAKnock while the MOMA assumption is formulated as the inner problem of constraining the knockout metabolic flux to be as close as possible to the steady-state phenotypes of wide-type strains. As this new inner problem becomes a quadratic programming problem, a novel adaptive piecewise linearization algorithm is developed in this paper to obtain the exact optimal solution to this new bi-level integer quadratic programming problem for MOMAKnock. Results Our new MOMAKnock model and the adaptive piecewise linearization solution algorithm are tested with a small E. coli core metabolic network and a large-scale iAF1260 E. coli metabolic network. The derived knockout strategies are compared with those from OptKnock. Our preliminary experimental results show that MOMAKnock can provide improved targeted productions with more robust knockout strategies. PMID:23368729

Adaptive bi-level programming for optimal gene knockouts for targeted overproduction under phenotypic constraints.

PubMed

Ren, Shaogang; Zeng, Bo; Qian, Xiaoning

2013-01-01

Optimization procedures to identify gene knockouts for targeted biochemical overproduction have been widely in use in modern metabolic engineering. Flux balance analysis (FBA) framework has provided conceptual simplifications for genome-scale dynamic analysis at steady states. Based on FBA, many current optimization methods for targeted bio-productions have been developed under the maximum cell growth assumption. The optimization problem to derive gene knockout strategies recently has been formulated as a bi-level programming problem in OptKnock for maximum targeted bio-productions with maximum growth rates. However, it has been shown that knockout mutants in fact reach the steady states with the minimization of metabolic adjustment (MOMA) from the corresponding wild-type strains instead of having maximal growth rates after genetic or metabolic intervention. In this work, we propose a new bi-level computational framework--MOMAKnock--which can derive robust knockout strategies under the MOMA flux distribution approximation. In this new bi-level optimization framework, we aim to maximize the production of targeted chemicals by identifying candidate knockout genes or reactions under phenotypic constraints approximated by the MOMA assumption. Hence, the targeted chemical production is the primary objective of MOMAKnock while the MOMA assumption is formulated as the inner problem of constraining the knockout metabolic flux to be as close as possible to the steady-state phenotypes of wide-type strains. As this new inner problem becomes a quadratic programming problem, a novel adaptive piecewise linearization algorithm is developed in this paper to obtain the exact optimal solution to this new bi-level integer quadratic programming problem for MOMAKnock. Our new MOMAKnock model and the adaptive piecewise linearization solution algorithm are tested with a small E. coli core metabolic network and a large-scale iAF1260 E. coli metabolic network. The derived knockout strategies are compared with those from OptKnock. Our preliminary experimental results show that MOMAKnock can provide improved targeted productions with more robust knockout strategies.

Orbit of the young very low-mass spectroscopic binary CHXR 74

NASA Astrophysics Data System (ADS)

Joergens, V.; Janson, M.; Müller, A.

2012-01-01

The pre-main sequence star CHXR 74 (M4.25) in Chamaeleon I was found a few years ago to be a very low-mass spectroscopic binary. A determination of its mass would provide a valuable dynamical mass measurement at young ages in the poorly constrained mass regime of <0.3 M⊙. We carried out follow-up radial velocity monitoring with UVES/VLT between 2008 and 2011 and high-resolution adaptive-optic-assisted imaging with NACO/VLT in 2008 with the aim of constraining the binary orbit. We present an orbital solution of the system based on the combined radial velocity data set, which spans more than eleven years of UVES monitoring for CHXR 74. The best-fit Kepler model has an orbital period of 13.1 years, zero eccentricity, and a radial velocity semi-amplitude of 2.2 km s-1. A companion mass M2sini (which is a lower limit due to the unknown orbital inclination i) of 0.08 M⊙ is derived by using a model-dependent mass estimate for the primary of 0.24 M⊙. The binary separation (a1sini + a2) for an inclination of 90° is 3.8 AU, which corresponds to 23 mas. Complementary NACO/VLT images of CHXR 74 were taken with the aim to directly resolve the binary. While there are marginal signs of an extended point spread function (PSF), we have detected no convincing companion to CHXR 74 in the NACO images. From the non-detection of the companion together with a prediction of the binary separation at the time of the NACO observations, we derive an upper limit for the K-band brightness ratio of the two binary components of 0.5. This allows us to estimate an upper limit of the companion mass of 0.14 M⊙ by applying evolutionary models. Thus, we confirm that CHXR 74 is a very low-mass spectroscopic binary and constrain the secondary mass to lie within the range of about 0.08 and 0.14 M⊙. We predict an astrometric signal of the primary between 0.2 and 0.4 mas when taking into account the luminosity of the companion. The Gaia astrometric mission might well be able to solve the astrometric orbit of the primary and in combination with the presented radial velocity data determine an absolute companion mass. Based on observations obtained at the Very Large Telescope of the European Southern Observatory at Paranal, Chile with UVES in program 65.I-0011(A), 72.C-0653(A), 75.C-0851(C), 77.C-0831(A+D), 380.C-0596(A), 082.C-0023(A), 087.C-0962(B), and with NACO in program 380.C-0596(B).

Chandra X-Ray and Hubble Space Telescope Imaging of Optically Selected Kiloparsec-scale Binary Active Galactic Nuclei. II. Host Galaxy Morphology and AGN Activity

NASA Astrophysics Data System (ADS)

Shangguan, Jinyi; Liu, Xin; Ho, Luis C.; Shen, Yue; Peng, Chien Y.; Greene, Jenny E.; Strauss, Michael A.

2016-05-01

Binary active galactic nuclei (AGNs) provide clues to how gas-rich mergers trigger and fuel AGNs and how supermassive black hole (SMBH) pairs evolve in a gas-rich environment. While significant effort has been invested in their identification, the detailed properties of binary AGNs and their host galaxies are still poorly constrained. In a companion paper, we examined the nature of ionizing sources in the double nuclei of four kiloparsec-scale binary AGNs with redshifts between 0.1 and 0.2. Here, we present their host galaxy morphology based on F336W (U-band) and F105W (Y-band) images taken by the Wide Field Camera 3 on board the Hubble Space Telescope. Our targets have double-peaked narrow emission lines and were confirmed to host binary AGNs with follow-up observations. We find that kiloparsec-scale binary AGNs occur in galaxy mergers with diverse morphological types. There are three major mergers with intermediate morphologies and a minor merger with a dominant disk component. We estimate the masses of the SMBHs from their host bulge stellar masses and obtain Eddington ratios for each AGN. Compared with a representative control sample drawn at the same redshift and stellar mass, the AGN luminosities and Eddington ratios of our binary AGNs are similar to those of single AGNs. The U - Y color maps indicate that clumpy star-forming regions could significantly affect the X-ray detection of binary AGNs, e.g., the hardness ratio. Considering the weak X-ray emission in AGNs triggered in merger systems, we suggest that samples of X-ray-selected AGNs may be biased against gas-rich mergers. Based, in part, on observations made with the NASA/ESA Hubble Space Telescope, obtained at the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555. These observations are associated with program number GO 12363.

A Conjugate Gradient Algorithm with Function Value Information and N-Step Quadratic Convergence for Unconstrained Optimization

PubMed Central

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. PMID:26381742

Quadratic RK shooting solution for a environmental parameter prediction boundary value problem

NASA Astrophysics Data System (ADS)

Famelis, Ioannis Th.; Tsitouras, Ch.

2014-10-01

Using tools of Information Geometry, the minimum distance between two elements of a statistical manifold is defined by the corresponding geodesic, e.g. the minimum length curve that connects them. Such a curve, where the probability distribution functions in the case of our meteorological data are two parameter Weibull distributions, satisfies a 2nd order Boundary Value (BV) system. We study the numerical treatment of the resulting special quadratic form system using Shooting method. We compare the solutions of the problem when we employ a classical Singly Diagonally Implicit Runge Kutta (SDIRK) 4(3) pair of methods and a quadratic SDIRK 5(3) pair . Both pairs have the same computational costs whereas the second one attains higher order as it is specially constructed for quadratic problems.

A Conjugate Gradient Algorithm with Function Value Information and N-Step Quadratic Convergence for Unconstrained Optimization.

PubMed

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.

Numerical optimization techniques for bound circulation distribution for minimum induced drag of Nonplanar wings: Computer program documentation

NASA Technical Reports Server (NTRS)

Kuhlman, J. M.; Ku, T. J.

1981-01-01

A two dimensional advanced panel far-field potential flow model of the undistorted, interacting wakes of multiple lifting surfaces was developed which allows the determination of the spanwise bound circulation distribution required for minimum induced drag. This model was implemented in a FORTRAN computer program, the use of which is documented in this report. The nonplanar wakes are broken up into variable sized, flat panels, as chosen by the user. The wake vortex sheet strength is assumed to vary linearly over each of these panels, resulting in a quadratic variation of bound circulation. Panels are infinite in the streamwise direction. The theory is briefly summarized herein; sample results are given for multiple, nonplanar, lifting surfaces, and the use of the computer program is detailed in the appendixes.

Preliminary demonstration of a robust controller design method

NASA Technical Reports Server (NTRS)

Anderson, L. R.

1980-01-01

Alternative computational procedures for obtaining a feedback control law which yields a control signal based on measurable quantitites are evaluated. The three methods evaluated are: (1) the standard linear quadratic regulator design model; (2) minimization of the norm of the feedback matrix, k via nonlinear programming subject to the constraint that the closed loop eigenvalues be in a specified domain in the complex plane; and (3) maximize the angles between the closed loop eigenvectors in combination with minimizing the norm of K also via the constrained nonlinear programming. The third or robust design method was chosen to yield a closed loop system whose eigenvalues are insensitive to small changes in the A and B matrices. The relationship between orthogonality of closed loop eigenvectors and the sensitivity of closed loop eigenvalues is described. Computer programs are described.

Constraints on geothermal reservoir volume change calculations from InSAR surface displacements and injection and production data

NASA Astrophysics Data System (ADS)

Kaven, J. Ole; Barbour, Andrew J.; Ali, Tabrez

2017-04-01

Continual production of geothermal energy at times leads to significant surface displacement that can be observed in high spatial resolution using InSAR imagery. The surface displacement can be analyzed to resolve volume change within the reservoir revealing the often-complicated patterns of reservoir deformation. Simple point source models of reservoir deformation in a homogeneous elastic or poro-elastic medium can be superimposed to provide spatially varying, kinematic representations of reservoir deformation. In many cases, injection and production data are known in insufficient detail; but, when these are available, the same Green functions can be used to constrain the reservoir deformation. Here we outline how the injection and production data can be used to constrain bounds on the solution by posing the inversion as a quadratic programming with inequality constraints and regularization rather than a conventional least squares solution with regularization. We apply this method to InSAR-derived surface displacements at the Coso and Salton Sea Geothermal Fields in California, using publically available injection and production data. At both geothermal fields the available surface deformation in conjunction with the injection and production data permit robust solutions for the spatially varying reservoir deformation. The reservoir deformation pattern resulting from the constrained quadratic programming solution is more heterogeneous when compared to a conventional least squares solution. The increased heterogeneity is consistent with the known structural controls on heat and fluid transport in each geothermal reservoir.

Finding Maximum Cliques on the D-Wave Quantum Annealer

DOE PAGES

Chapuis, Guillaume; Djidjev, Hristo; Hahn, Georg; ...

2018-05-03

This work assesses the performance of the D-Wave 2X (DW) quantum annealer for finding a maximum clique in a graph, one of the most fundamental and important NP-hard problems. Because the size of the largest graphs DW can directly solve is quite small (usually around 45 vertices), we also consider decomposition algorithms intended for larger graphs and analyze their performance. For smaller graphs that fit DW, we provide formulations of the maximum clique problem as a quadratic unconstrained binary optimization (QUBO) problem, which is one of the two input types (together with the Ising model) acceptable by the machine, andmore » compare several quantum implementations to current classical algorithms such as simulated annealing, Gurobi, and third-party clique finding heuristics. We further estimate the contributions of the quantum phase of the quantum annealer and the classical post-processing phase typically used to enhance each solution returned by DW. We demonstrate that on random graphs that fit DW, no quantum speedup can be observed compared with the classical algorithms. On the other hand, for instances specifically designed to fit well the DW qubit interconnection network, we observe substantial speed-ups in computing time over classical approaches.« less

Finding Maximum Cliques on the D-Wave Quantum Annealer

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chapuis, Guillaume; Djidjev, Hristo; Hahn, Georg

This work assesses the performance of the D-Wave 2X (DW) quantum annealer for finding a maximum clique in a graph, one of the most fundamental and important NP-hard problems. Because the size of the largest graphs DW can directly solve is quite small (usually around 45 vertices), we also consider decomposition algorithms intended for larger graphs and analyze their performance. For smaller graphs that fit DW, we provide formulations of the maximum clique problem as a quadratic unconstrained binary optimization (QUBO) problem, which is one of the two input types (together with the Ising model) acceptable by the machine, andmore » compare several quantum implementations to current classical algorithms such as simulated annealing, Gurobi, and third-party clique finding heuristics. We further estimate the contributions of the quantum phase of the quantum annealer and the classical post-processing phase typically used to enhance each solution returned by DW. We demonstrate that on random graphs that fit DW, no quantum speedup can be observed compared with the classical algorithms. On the other hand, for instances specifically designed to fit well the DW qubit interconnection network, we observe substantial speed-ups in computing time over classical approaches.« less

Community-Based Juvenile Reentry Services: The Effects of Service Dosage on Juvenile and Adult Recidivism

ERIC Educational Resources Information Center

Abrams, Laura S.; Terry, Diane; Franke, Todd M.

2011-01-01

In this study the authors examined the influence of length of participation in a community-based reentry program on the odds of reconviction in the juvenile and adult criminal justice systems. A structured telephone survey of reentry program alumni was conducted with 75 transition-age (18-25 year-old) young men. Binary logistic regression analysis…

The Nearest Black Holes

NASA Technical Reports Server (NTRS)

Garcia, M.; Oliversen, Ronald J. (Technical Monitor)

2004-01-01

The goal of this program is to study black holes, both in our Galaxy and in nearby galaxies. We aim to study both 'stellar mass' x-ray binaries containing black holes (both in our Galaxy and in nearby galaxies), and super-massive black holes in nearby galaxies. This program facilitate this study by funding related travel, computer equipment, and partial salary for a post-doc.

The Nearest Black Holes

NASA Technical Reports Server (NTRS)

Oliversen, Ronald J. (Technical Monitor); Garcia, M.

2003-01-01

The goal of this program is to study black holes, both in our Galaxy and in nearby galaxies. We aim to study both 'stellar mass' x-ray binaries containing black holes (both in our Galaxy and in nearby galaxies), and super-massive black holes in nearby galaxies. This program facilitates this study by funding related travel, computer equipment, and partial salary for a post-doc.

Black Muslim Girls Navigating Multiple Oppositional Binaries through Literacy and Letter Writing

ERIC Educational Resources Information Center

McArthur, Sherell A.; Muhammad, Gholnecsar E.

2017-01-01

Writing alongside 12 African American Muslim girls, we led a summer literacy program in an effort to understand how Black Muslim adolescent girls write about their identities and ideas. The 4-week literacy program was designed to engage and support Black Muslim girls, aged 12-17 years old, in reading, writing, and understanding the multiple…

Binary Image Classification: A Genetic Programming Approach to the Problem of Limited Training Instances.

PubMed

Al-Sahaf, Harith; Zhang, Mengjie; Johnston, Mark

2016-01-01

In the computer vision and pattern recognition fields, image classification represents an important yet difficult task. It is a challenge to build effective computer models to replicate the remarkable ability of the human visual system, which relies on only one or a few instances to learn a completely new class or an object of a class. Recently we proposed two genetic programming (GP) methods, one-shot GP and compound-GP, that aim to evolve a program for the task of binary classification in images. The two methods are designed to use only one or a few instances per class to evolve the model. In this study, we investigate these two methods in terms of performance, robustness, and complexity of the evolved programs. We use ten data sets that vary in difficulty to evaluate these two methods. We also compare them with two other GP and six non-GP methods. The results show that one-shot GP and compound-GP outperform or achieve results comparable to competitor methods. Moreover, the features extracted by these two methods improve the performance of other classifiers with handcrafted features and those extracted by a recently developed GP-based method in most cases.

One-loop Parke-Taylor factors for quadratic propagators from massless scattering equations

NASA Astrophysics Data System (ADS)

Gomez, Humberto; Lopez-Arcos, Cristhiam; Talavera, Pedro

2017-10-01

In this paper we reconsider the Cachazo-He-Yuan construction (CHY) of the so called scattering amplitudes at one-loop, in order to obtain quadratic propagators. In theories with colour ordering the key ingredient is the redefinition of the Parke-Taylor factors. After classifying all the possible one-loop CHY-integrands we conjecture a new one-loop amplitude for the massless Bi-adjoint Φ3 theory. The prescription directly reproduces the quadratic propagators of the traditional Feynman approach.

Photometric study and orbital period analysis of the W UMa type contact binary VZ Psc

NASA Astrophysics Data System (ADS)

Ma, S.; Li, K.; Li, Q.-C.; Gao, H.-Y.

2018-02-01

VZ Psc is a W-type contact binary system with a short period of 0.26125897 days. B, V, Rc and Ic light curves of the eclipsing binary system were obtained by using the 1.0 m reflecting telescope at Weihai Observatory of Shandong University. By collecting 136 times of minimum light, we studied the orbital period change of VZ Psc. A sinusoidal variation was discovered in the O - C diagram, and the amplitude of 0.d0023 and the period of 17.7 year were obtained. This can be caused by Applegate mechanism or light-time effect. Both the mechanisms are suited according to our investigation, but we prefer the latter that the light-time effect due to the presence of a third body results in the cyclic variation. By using the W-D program, we analyzed the four color light curves. Because of the asymmetric light curves and the possible third body, we used the spot mode of W-D program with and without L3. We found that a hot spot on the primary component with the third light leads to the best result. A very high filling factor of 94.4% ± 2.8% and orbit inclination of 53.2° were obtained.

Binary Cepheids From High-Angular Resolution

NASA Astrophysics Data System (ADS)

Gallenne, A.; Mérand, A.; Kervella, P.

2015-12-01

Optical interferometry is the only technique giving access to milli-arcsecond (mas) spatial resolution. This is a powerful and unique tool to detect the close orbiting companions of Cepheids, and offers an unique opportunity to make progress in resolving the Cepheid mass discrepancy. Our goal in studying binary Cepheids is to measure the astrometric position of the high-contrast companion, and then combine them with spectroscopic measurements to derive the orbital elements, distances, and dynamical masses. In the course of this program, we developed a new tool, CANDID, to search for high-contrast companions and set detection limits from interferometric observations

Using the Binary Phase-Field Crystal Model to Describe Non-Classical Nucleation Pathways in Gold Nanoparticles

NASA Astrophysics Data System (ADS)

Smith, Nathan; Provatas, Nikolas

Recent experimental work has shown that gold nanoparticles can precipitate from an aqueous solution through a non-classical, multi-step nucleation process. This multi-step process begins with spinodal decomposition into solute-rich and solute-poor liquid domains followed by nucleation from within the solute-rich domains. We present a binary phase-field crystal theory that shows the same phenomology and examine various cross-over regimes in the growth and coarsening of liquid and solid domains. We'd like to the thank Canada Research Chairs (CRC) program for funding this work.

Physical Parameters of Components in Close Binary Systems. V

NASA Astrophysics Data System (ADS)

Zola, S.; Kreiner, J. M.; Zakrzewski, B.; Kjurkchieva, D. P.; Marchev, D. V.; Baran, A.; Rucinski, S. M.; Ogloza, W.; Siwak, M.; Koziel, D.; Drozdz, M.; Pokrzywka, B.

2005-12-01

The paper presents combined spectroscopic and photometric orbital solutions for ten close binary systems: CN And, V776 Cas, FU Dra, UV Lyn, BB Peg, V592 Per, OU Ser, EQ Tau, HN UMa and HT Vir. The photometric data consist of new multicolor light curves, while the spectroscopy has been recently obtained within the radial velocity program at the David Dunlap Observatory (DDO). Absolute parameters of the components for these binary systems are derived. Our results confirm that CN And is not a contact system. Its configuration is semi-detached with the secondary component filling its Roche lobe. The configuration of nine other systems is contact. Three systems (V776 Cas, V592 Per and OU Ser) have high (44-77%) and six (FU Dra, UV Lyn, BB Peg, EQ Tau, HN UMa and HT Vir) low or intermediate (8-32%) fill-out factors. The absolute physical parameters are derived.

Kottamia 74-inch telescope discovery of the new eclipsing binary 2MASS J20004638 + 0547475.: First CCD photometry and light curve analysis

NASA Astrophysics Data System (ADS)

Darwish, M. S.; Shokry, A.; Saad, S. M.; El-Sadek, M. A.; Essam, A.; Ismail, M.

2017-05-01

A CCD photometric study is presented for the eclipsing binary system 2MASS J20004638 + 0547475. Observations of the system were obtained in the V, R and I colours with the 2Kx2K CCD attached to 1.88 m Kottamia Optical Telescope. New times of light minimum and new ephemeris were obtained. The V, R and I light curves were analyzed using the PHOEBE 0.31 program to determine geometrical and physical parameters of the system. The results show that 2MASS J20004638 + 0547475, is A-Type WUMa and is an overcontact binary with high fill-out factor = 69%. The current evolutionary status of the system indicates that the primary component lies very close to the main sequence while the secondary is evolved. The asymmetric maxima were studied and a modeling of the hot spot parameters is given.

Multi-band photometric study of the short-period eclipsing binary GR Boo

NASA Astrophysics Data System (ADS)

Wang, Daimei; Zhang, Liyun; Han, Xianming L.; Lu, Hongpeng

2017-05-01

We present BVRI light curves with complete phase coverage for the short-period (p = 0.377day) eclipsing binary star GR Boo. We carried out the observations using the SARA 90 cm telescope located at Kitt Peak National Observatory. We obtained six new light curve minimum times. By fitting all of the available O-C minimum times, we obtained an updated ephemeris that shows the orbital period of GR Boo is decreasing at a rate of P˙ = - 2.36 ×10-7 days/year. This decrease in its period can be explained by either mass transfer from the more massive component to the less massive one, or angular momentum exchange due to magnetic activities. We also obtained a set of revised orbital parameters using the Wilson & Devinney program. And finally, we concluded that GR Boo is a contact binary with a dark spot.

Quasi-Periodic Oscillations in AM Herculis Binaries -- Cycle 3 Medium

NASA Astrophysics Data System (ADS)

Chanmugam, G.

1992-06-01

AM Her variables are close-binary systems in which a white dwarf with a magnetic field of 20-70 MG accretes matter from a companion star. Theoretical studies of magnetically channeled accretion flows in such systems predict that the shock formed near the white dwarf should oscillate with periods of order 0.1-1 sec. Optical high-speed photometry has indeed shown the existence of such rapid, quasi-periodic oscillations in some AM Her binaries, but not in others. We will use HST to obtain UV and optical high-speed photometry of several AM Her systems, in order to explore further the nature of the oscillations, and to extend the search into the UV. This proposal is a followup to an accepted Cycle 2 program. We are proposing it for Cycle 3 in order to complete our survey of the most suitable AM Her systems during this last opportunity for HSP observations.

A possible third component in the eclipsing binary system HS 2231+2441

NASA Astrophysics Data System (ADS)

Vidmachenko, A. P.; Romanyuk, Ya. O.; Shliahetskaya, Ya. O.

2016-05-01

We used a differential photometry method in which we compared the flow of program star and standard one. Observations of the 21 nights in the period from July 26 to December 2, 2015 are used for processing. The accuracy of determining for each measurement is in the range 0,003...0,009 m for different nights. On the basis of obtained data were created corresponding light curves. Next, we calculate the time difference between the centers of transits. Its time dependence showed the presence of a possible periodic change in the deflection of the middle transit time from the calculated average value. This may indicate the presence of a third object in the eclipsing binary system. It has been found that the periodic variation of the orbital period can be explained by the gravitational influence of a third companion on the central binary system with an orbital period of about 97±10 d.

The Binary Representation of Rational Numbers.

ERIC Educational Resources Information Center

Schmalz, Rosemary

1987-01-01

Presented are the mathematical explanation of the algorithm for representing rational numbers in base two, paper-and-pencil methods for producing the representation, some patterns in these representations, and pseudocode for computer programs to explore these patterns. (MNS)

Multi-hazard evacuation route and shelter planning for buildings.

DOT National Transportation Integrated Search

2014-06-01

A bi-level, two-stage, binary stochastic program with equilibrium constraints, and three variants, are presented that : support the planning and design of shelters and exits, along with hallway fortification strategies and associated : evacuation pat...

Determination of the Fundamental Properties of the Eclipsing Binary V541 Cygni

NASA Astrophysics Data System (ADS)

McGruder, Chima; Torres, Guillermo; Siverd, Robert; Pepper, Joshua; Rodriguez, Joseph; KELT Collaboration

2017-01-01

We report new high-resolution spectroscopic observations of the B-type detached spectroscopic eclipsing binary V541 Cygni (e = 0.465 and P =15.34 days). We combine analysis of these new spectra with analysis of V-band photometry from the literature to obtain the most precise measurements of the fundamental properties of the stars to date (yielding ~1% errors in the masses and ~2% for the radii). A comparison with current stellar evolution models indicates good fits for an age of ~ 200 million years and [Fe/H] ~ -0.2. Available eclipse timings gathered over 40 years were used to re-determine the apsidal motion of the system, dω/dt = 0.993 degs/cent, which is larger than what theory suggests.The SAO REU program was funded in part by the National Science Foundation REU and Department of Defense ASSURE programs under NSF Grant no. 1262851, and by the Smithsonian Institution.

HR 7578 - A K dwarf double-lined spectroscopic binary with peculiar abundances

NASA Technical Reports Server (NTRS)

Fekel, F. C., Jr.; Beavers, W. I.

1983-01-01

The number of double-lined K and M dwarf binaries which is currently known is quite small, only a dozen or less of each type. The HR 7578 system was classified as dK5 on the Mount Wilson system and as K2 V on the MK ystem. A summary of radial-velocity measurements including the observatory and weight of each observation is given in a table. The star with the stronger lines has been called component A. The final orbital element solution with all observations appropriately weighted was computed with a differential corrections computer program described by Barker et al. (1967). The program had been modified for the double-lined case. Of particular interest are the very large eccentricity of the system and the large minimum masses for each component. These large minimum masses suggest that eclipses may be detectable despite the relatively long period and small radii of the stars.

DESGW: Optical Follow-up of BBH LIGO-Virgo Events with DECam

DOE Office of Scientific and Technical Information (OSTI.GOV)

Butler, Robert E.; Soares-Santos, M.; Annis, j.

2017-12-14

The DESGW program is a collaboration between members of the Dark Energy Survey, the wider astronomical community, and the LIGO-Virgo Collaboration to search for optical counterparts of gravitational wave events, such as those expected from binary neutron star mergers or neutron star-black hole mergers. While binary black hole (BBH) events are not expected to produce an electromagnetic (EM) signature, emission is certainly not impossible. The DESGW program has performed follow-up observations of four BBH events detected by LIGO in order to search for any possible EM counterpart. Failure to nd such counterparts is still relevant in that it produces limitsmore » on optical emission from such events. This is a review of follow-up results from O1 BBH events and a discussion of the status of ongoing uniform re-analysis of all BBH events that DESGW has followed up to date.« less

Soft X-ray Absorption Edges in LMXBs

NASA Technical Reports Server (NTRS)

2004-01-01

The XMM observation of LMC X-2 is part of our program to study X-ray absorption in the interstellar medium (ISM). This program includes a variety of bright X-ray binaries in the Galaxy as well as the Magellanic Clouds (LMC and SMC). LMC X-2 is located near the heart of the LMC. Its very soft X-ray spectrum is used to determine abundance and ionization fractions of neutral and lowly ionized oxygen of the ISM in the LMC. The RGS spectrum so far allowed us to determine the O-edge value to be for atomic O, the EW of O-I in the ls-2p resonance absorption line, and the same for O-II. The current study is still ongoing in conjunction with other low absorption sources like Sco X-1 and the recently observed X-ray binary 4U 1957+11.

Schur Stability Regions for Complex Quadratic Polynomials

ERIC Educational Resources Information Center

Cheng, Sui Sun; Huang, Shao Yuan

2010-01-01

Given a quadratic polynomial with complex coefficients, necessary and sufficient conditions are found in terms of the coefficients such that all its roots have absolute values less than 1. (Contains 3 figures.)

Identification of the key ecological factors influencing vegetation degradation in semi-arid agro-pastoral ecotone considering spatial scales

NASA Astrophysics Data System (ADS)

Peng, Yu; Wang, Qinghui; Fan, Min

2017-11-01

When assessing re-vegetation project performance and optimizing land management, identification of the key ecological factors inducing vegetation degradation has crucial implications. Rainfall, temperature, elevation, slope, aspect, land use type, and human disturbance are ecological factors affecting the status of vegetation index. However, at different spatial scales, the key factors may vary. Using Helin County, Inner-Mongolia, China as the study site and combining remote sensing image interpretation, field surveying, and mathematical methods, this study assesses key ecological factors affecting vegetation degradation under different spatial scales in a semi-arid agro-pastoral ecotone. It indicates that the key factors are different at various spatial scales. Elevation, rainfall, and temperature are identified as crucial for all spatial extents. Elevation, rainfall and human disturbance are key factors for small-scale quadrats of 300 m × 300 m and 600 m × 600 m, temperature and land use type are key factors for a medium-scale quadrat of 1 km × 1 km, and rainfall, temperature, and land use are key factors for large-scale quadrats of 2 km × 2 km and 5 km × 5 km. For this region, human disturbance is not the key factor for vegetation degradation across spatial scales. It is necessary to consider spatial scale for the identification of key factors determining vegetation characteristics. The eco-restoration programs at various spatial scales should identify key influencing factors according their scales so as to take effective measurements. The new understanding obtained in this study may help to explore the forces which driving vegetation degradation in the degraded regions in the world.

Searching for Binary Systems Among Nearby Dwarfs Based on Pulkovo Observations and SDSS Data

NASA Astrophysics Data System (ADS)

Khovrichev, M. Yu.; Apetyan, A. A.; Roshchina, E. A.; Izmailov, I. S.; Bikulova, D. A.; Ershova, A. P.; Balyaev, I. A.; Kulikova, A. M.; Petyur, V. V.; Shumilov, A. A.; Os'kina, K. I.; Maksimova, L. A.

2018-02-01

Our goal is to find previously unknown binary systems among low-mass dwarfs in the solar neighborhood and to test the search technique. The basic ideas are to reveal the images of stars with significant ellipticities and/or asymmetries compared to the background stars on CCD frames and to subsequently determine the spatial parameters of the binary system and the magnitude difference between its components. For its realization we have developed a method based on an image shapelet decomposition. All of the comparatively faint stars with large proper motions ( V >13 m , μ > 300 mas yr-1) for which the "duplicate source" flag in the Gaia DR1 catalogue is equal to one have been included in the list of objects for our study. As a result, we have selected 702 stars. To verify our results, we have performed additional observations of 65 stars from this list with the Pulkovo 1-m "Saturn" telescope (2016-2017). We have revealed a total of 138 binary candidates (nine of them from the "Saturn" telescope and SDSS data). Six program stars are known binaries. The images of the primaries of the comparatively wide pairs WDS 14519+5147, WDS 11371+6022, and WDS 15404+2500 are shown to be resolved into components; therefore, we can talk about the detection of triple systems. The angular separation ρ, position angle, and component magnitude difference Δ m have been estimated for almost all of the revealed binary systems. For most stars 1.5'' < ρ < 2.5'', while Δ m <1.5m.

Fast parallel DNA-based algorithms for molecular computation: quadratic congruence and factoring integers.

PubMed

Chang, Weng-Long

2012-03-01

Assume that n is a positive integer. If there is an integer such that M (2) ≡ C (mod n), i.e., the congruence has a solution, then C is said to be a quadratic congruence (mod n). If the congruence does not have a solution, then C is said to be a quadratic noncongruence (mod n). The task of solving the problem is central to many important applications, the most obvious being cryptography. In this article, we describe a DNA-based algorithm for solving quadratic congruence and factoring integers. In additional to this novel contribution, we also show the utility of our encoding scheme, and of the algorithm's submodules. We demonstrate how a variety of arithmetic, shifted and comparative operations, namely bitwise and full addition, subtraction, left shifter and comparison perhaps are performed using strands of DNA.

Quadratic correlation filters for optical correlators

NASA Astrophysics Data System (ADS)

Mahalanobis, Abhijit; Muise, Robert R.; Vijaya Kumar, Bhagavatula V. K.

2003-08-01

Linear correlation filters have been implemented in optical correlators and successfully used for a variety of applications. The output of an optical correlator is usually sensed using a square law device (such as a CCD array) which forces the output to be the squared magnitude of the desired correlation. It is however not a traditional practice to factor the effect of the square-law detector in the design of the linear correlation filters. In fact, the input-output relationship of an optical correlator is more accurately modeled as a quadratic operation than a linear operation. Quadratic correlation filters (QCFs) operate directly on the image data without the need for feature extraction or segmentation. In this sense, the QCFs retain the main advantages of conventional linear correlation filters while offering significant improvements in other respects. Not only is more processing required to detect peaks in the outputs of multiple linear filters, but choosing a winner among them is an error prone task. In contrast, all channels in a QCF work together to optimize the same performance metric and produce a combined output that leads to considerable simplification of the post-processing. In this paper, we propose a novel approach to the design of quadratic correlation based on the Fukunaga Koontz transform. Although quadratic filters are known to be optimum when the data is Gaussian, it is expected that they will perform as well as or better than linear filters in general. Preliminary performance results are provided that show that quadratic correlation filters perform better than their linear counterparts.

Orbital period changes in RW CrA, DX Vel and V0646 Cen

NASA Astrophysics Data System (ADS)

Volkov, I. M.; Chochol, D.; Grygar, J.; Mašek, M.; Juryšek, J.

2017-06-01

We aim to determine the absolute parameters of the components of southern Algol-type binaries with deep eclipses RW CrA, DX Vel, V0646 Cen and interpret their orbital period changes. The data analysis is based on a high quality Walraven photoelectric photometry, obtained in the 1960-70s, our recent CCD photometry, ASAS (Pojmanski, 2002), and Hipparcos (Perryman et al., 1997) photometry of the objects. Their light curves were analyzed using the PHOEBE program with fixed effective temperatures of the primary components, found from disentangling the Walraven (B-U) and (V-B) colour indices. We found the absolute parameters of the components of all three objects. All reliable observed times of minimum light were used to construct and analyze the Eclipse Time Variation (ETV) diagrams. We interpreted the ETV diagrams of the detached binary RW CrA and the semi-detached binary DX Vel by a LIght-Time Effect (LITE), estimated parameters of their orbits and masses of their third bodies. We suggest a long term variation of the inclination angle of both eclipsing binaries, caused by a non-coplanar orientation of their third body orbits. We interpreted the detected orbital period increase in the semi-detached binary V0646 Cen by a mass transfer from the less to more massive component with the rate M⊙ = 6.08×10-9 M⊙/yr.

First all-sky search for continuous gravitational waves from unknown sources in binary systems

NASA Astrophysics Data System (ADS)

Aasi, J.; Abbott, B. P.; Abbott, R.; Abbott, T.; Abernathy, M. R.; Accadia, T.; Acernese, F.; Ackley, K.; Adams, C.; Adams, T.; Addesso, P.; Adhikari, R. X.; Affeldt, C.; Agathos, M.; Aggarwal, N.; Aguiar, O. D.; Ain, A.; Ajith, P.; Alemic, A.; Allen, B.; Allocca, A.; Amariutei, D.; Andersen, M.; Anderson, R.; Anderson, S. B.; Anderson, W. G.; Arai, K.; Araya, M. C.; Arceneaux, C.; Areeda, J.; Aston, S. M.; Astone, P.; Aufmuth, P.; Aulbert, C.; Austin, L.; Aylott, B. E.; Babak, S.; Baker, P. T.; Ballardin, G.; Ballmer, S. W.; Barayoga, J. C.; Barbet, M.; Barish, B. C.; Barker, D.; Barone, F.; Barr, B.; Barsotti, L.; Barsuglia, M.; Barton, M. A.; Bartos, I.; Bassiri, R.; Basti, A.; Batch, J. C.; Bauchrowitz, J.; Bauer, Th. S.; Behnke, B.; Bejger, M.; Beker, M. G.; Belczynski, C.; Bell, A. S.; Bell, C.; Bergmann, G.; Bersanetti, D.; Bertolini, A.; Betzwieser, J.; Beyersdorf, P. T.; Bilenko, I. A.; Billingsley, G.; Birch, J.; Biscans, S.; Bitossi, M.; Bizouard, M. A.; Black, E.; Blackburn, J. K.; Blackburn, L.; Blair, D.; Bloemen, S.; Blom, M.; Bock, O.; Bodiya, T. P.; Boer, M.; Bogaert, G.; Bogan, C.; Bond, C.; Bondu, F.; Bonelli, L.; Bonnand, R.; Bork, R.; Born, M.; Boschi, V.; Bose, Sukanta; Bosi, L.; Bradaschia, C.; Brady, P. R.; Braginsky, V. B.; Branchesi, M.; Brau, J. E.; Briant, T.; Bridges, D. O.; Brillet, A.; Brinkmann, M.; Brisson, V.; Brooks, A. F.; Brown, D. A.; Brown, D. D.; Brückner, F.; Buchman, S.; Bulik, T.; Bulten, H. J.; Buonanno, A.; Burman, R.; Buskulic, D.; Buy, C.; Cadonati, L.; Cagnoli, G.; Calderón Bustillo, J.; Calloni, E.; Camp, J. B.; Campsie, P.; Cannon, K. C.; Canuel, B.; Cao, J.; Capano, C. D.; Carbognani, F.; Carbone, L.; Caride, S.; Castiglia, A.; Caudill, S.; Cavaglià, M.; Cavalier, F.; Cavalieri, R.; Celerier, C.; Cella, G.; Cepeda, C.; Cesarini, E.; Chakraborty, R.; Chalermsongsak, T.; Chamberlin, S. J.; Chao, S.; Charlton, P.; Chassande-Mottin, E.; Chen, X.; Chen, Y.; Chincarini, A.; Chiummo, A.; Cho, H. S.; Chow, J.; Christensen, N.; Chu, Q.; Chua, S. S. Y.; Chung, S.; Ciani, G.; Clara, F.; Clark, J. A.; Cleva, F.; Coccia, E.; Cohadon, P.-F.; Colla, A.; Collette, C.; Colombini, M.; Cominsky, L.; Constancio, M.; Conte, A.; Cook, D.; Corbitt, T. R.; Cordier, M.; Cornish, N.; Corpuz, A.; Corsi, A.; Costa, C. A.; Coughlin, M. W.; Coughlin, S.; Coulon, J.-P.; Countryman, S.; Couvares, P.; Coward, D. M.; Cowart, M.; Coyne, D. C.; Coyne, R.; Craig, K.; Creighton, J. D. E.; Creighton, T. D.; Crowder, S. G.; Cumming, A.; Cunningham, L.; Cuoco, E.; Dahl, K.; Dal Canton, T.; Damjanic, M.; Danilishin, S. L.; D'Antonio, S.; Danzmann, K.; Dattilo, V.; Daveloza, H.; Davier, M.; Davies, G. S.; Daw, E. J.; Day, R.; Dayanga, T.; Debreczeni, G.; Degallaix, J.; Deléglise, S.; Del Pozzo, W.; Denker, T.; Dent, T.; Dereli, H.; Dergachev, V.; De Rosa, R.; DeRosa, R. T.; DeSalvo, R.; Dhurandhar, S.; Díaz, M.; Di Fiore, L.; Di Lieto, A.; Di Palma, I.; Di Virgilio, A.; Donath, A.; Donovan, F.; Dooley, K. L.; Doravari, S.; Dossa, S.; Douglas, R.; Downes, T. P.; Drago, M.; Drever, R. W. P.; Driggers, J. C.; Du, Z.; Dwyer, S.; Eberle, T.; Edo, T.; Edwards, M.; Effler, A.; Eggenstein, H.; Ehrens, P.; Eichholz, J.; Eikenberry, S. S.; Endrőczi, G.; Essick, R.; Etzel, T.; Evans, M.; Evans, T.; Factourovich, M.; Fafone, V.; Fairhurst, S.; Fang, Q.; Farinon, S.; Farr, B.; Farr, W. M.; Favata, M.; Fehrmann, H.; Fejer, M. M.; Feldbaum, D.; Feroz, F.; Ferrante, I.; Ferrini, F.; Fidecaro, F.; Finn, L. S.; Fiori, I.; Fisher, R. P.; Flaminio, R.; Fournier, J.-D.; Franco, S.; Frasca, S.; Frasconi, F.; Frede, M.; Frei, Z.; Freise, A.; Frey, R.; Fricke, T. T.; Fritschel, P.; Frolov, V. V.; Fulda, P.; Fyffe, M.; Gair, J.; Gammaitoni, L.; Gaonkar, S.; Garufi, F.; Gehrels, N.; Gemme, G.; Genin, E.; Gennai, A.; Ghosh, S.; Giaime, J. A.; Giardina, K. D.; Giazotto, A.; Gill, C.; Gleason, J.; Goetz, E.; Goetz, R.; Gondan, L.; González, G.; Gordon, N.; Gorodetsky, M. L.; Gossan, S.; Goßler, S.; Gouaty, R.; Gräf, C.; Graff, P. B.; Granata, M.; Grant, A.; Gras, S.; Gray, C.; Greenhalgh, R. J. S.; Gretarsson, A. M.; Groot, P.; Grote, H.; Grover, K.; Grunewald, S.; Guidi, G. M.; Guido, C.; Gushwa, K.; Gustafson, E. K.; Gustafson, R.; Hammer, D.; Hammond, G.; Hanke, M.; Hanks, J.; Hanna, C.; Hanson, J.; Harms, J.; Harry, G. M.; Harry, I. W.; Harstad, E. D.; Hart, M.; Hartman, M. T.; Haster, C.-J.; Haughian, K.; Heidmann, A.; Heintze, M.; Heitmann, H.; Hello, P.; Hemming, G.; Hendry, M.; Heng, I. S.; Heptonstall, A. W.; Heurs, M.; Hewitson, M.; Hild, S.; Hoak, D.; Hodge, K. A.; Holt, K.; Hooper, S.; Hopkins, P.; Hosken, D. J.; Hough, J.; Howell, E. J.; Hu, Y.; Huerta, E.; Hughey, B.; Husa, S.; Huttner, S. H.; Huynh, M.; Huynh-Dinh, T.; Ingram, D. R.; Inta, R.; Isogai, T.; Ivanov, A.; Iyer, B. R.; Izumi, K.; Jacobson, M.; James, E.; Jang, H.; Jaranowski, P.; Ji, Y.; Jiménez-Forteza, F.; Johnson, W. W.; Jones, D. I.; Jones, R.; Jonker, R. J. G.; Ju, L.; K, Haris; Kalmus, P.; Kalogera, V.; Kandhasamy, S.; Kang, G.; Kanner, J. B.; Karlen, J.; Kasprzack, M.; Katsavounidis, E.; Katzman, W.; Kaufer, H.; Kawabe, K.; Kawazoe, F.; Kéfélian, F.; Keiser, G. M.; Keitel, D.; Kelley, D. B.; Kells, W.; Khalaidovski, A.; Khalili, F. Y.; Khazanov, E. A.; Kim, C.; Kim, K.; Kim, N.; Kim, N. G.; Kim, Y.-M.; King, E. J.; King, P. J.; Kinzel, D. L.; Kissel, J. S.; Klimenko, S.; Kline, J.; Koehlenbeck, S.; Kokeyama, K.; Kondrashov, V.; Koranda, S.; Korth, W. Z.; Kowalska, I.; Kozak, D. B.; Kremin, A.; Kringel, V.; Krishnan, B.; Królak, A.; Kuehn, G.; Kumar, A.; Kumar, P.; Kumar, R.; Kuo, L.; Kutynia, A.; Kwee, P.; Landry, M.; Lantz, B.; Larson, S.; Lasky, P. D.; Lawrie, C.; Lazzarini, A.; Lazzaro, C.; Leaci, P.; Leavey, S.; Lebigot, E. O.; Lee, C.-H.; Lee, H. K.; Lee, H. M.; Lee, J.; Leonardi, M.; Leong, J. R.; Le Roux, A.; Leroy, N.; Letendre, N.; Levin, Y.; Levine, B.; Lewis, J.; Li, T. G. F.; Libbrecht, K.; Libson, A.; Lin, A. C.; Littenberg, T. B.; Litvine, V.; Lockerbie, N. A.; Lockett, V.; Lodhia, D.; Loew, K.; Logue, J.; Lombardi, A. L.; Lorenzini, M.; Loriette, V.; Lormand, M.; Losurdo, G.; Lough, J.; Lubinski, M. J.; Lück, H.; Luijten, E.; Lundgren, A. P.; Lynch, R.; Ma, Y.; Macarthur, J.; Macdonald, E. P.; MacDonald, T.; Machenschalk, B.; MacInnis, M.; Macleod, D. M.; Magana-Sandoval, F.; Mageswaran, M.; Maglione, C.; Mailand, K.; Majorana, E.; Maksimovic, I.; Malvezzi, V.; Man, N.; Manca, G. M.; Mandel, I.; Mandic, V.; Mangano, V.; Mangini, N.; Mantovani, M.; Marchesoni, F.; Marion, F.; Márka, S.; Márka, Z.; Markosyan, A.; Maros, E.; Marque, J.; Martelli, F.; Martin, I. W.; Martin, R. M.; Martinelli, L.; Martynov, D.; Marx, J. N.; Mason, K.; Masserot, A.; Massinger, T. J.; Matichard, F.; Matone, L.; Matzner, R. A.; Mavalvala, N.; Mazumder, N.; Mazzolo, G.; McCarthy, R.; McClelland, D. E.; McGuire, S. C.; McIntyre, G.; McIver, J.; McLin, K.; Meacher, D.; Meadors, G. D.; Mehmet, M.; Meidam, J.; Meinders, M.; Melatos, A.; Mendell, G.; Mercer, R. A.; Meshkov, S.; Messenger, C.; Meyers, P.; Miao, H.; Michel, C.; Mikhailov, E. E.; Milano, L.; Milde, S.; Miller, J.; Minenkov, Y.; Mingarelli, C. M. F.; Mishra, C.; Mitra, S.; Mitrofanov, V. P.; Mitselmakher, G.; Mittleman, R.; Moe, B.; Moesta, P.; Mohan, M.; Mohapatra, S. R. P.; Moraru, D.; Moreno, G.; Morgado, N.; Morriss, S. R.; Mossavi, K.; Mours, B.; Mow-Lowry, C. M.; Mueller, C. L.; Mueller, G.; Mukherjee, S.; Mullavey, A.; Munch, J.; Murphy, D.; Murray, P. G.; Mytidis, A.; Nagy, M. F.; Nanda Kumar, D.; Nardecchia, I.; Naticchioni, L.; Nayak, R. K.; Necula, V.; Nelemans, G.; Neri, I.; Neri, M.; Newton, G.; Nguyen, T.; Nitz, A.; Nocera, F.; Nolting, D.; Normandin, M. E. N.; Nuttall, L. K.; Ochsner, E.; O'Dell, J.; Oelker, E.; Oh, J. J.; Oh, S. H.; Ohme, F.; Oppermann, P.; O'Reilly, B.; O'Shaughnessy, R.; Osthelder, C.; Ottaway, D. J.; Ottens, R. S.; Overmier, H.; Owen, B. J.; Padilla, C.; Pai, A.; Palashov, O.; Palomba, C.; Pan, H.; Pan, Y.; Pankow, C.; Paoletti, F.; Paoletti, R.; Papa, M. A.; Paris, H.; Pasqualetti, A.; Passaquieti, R.; Passuello, D.; Pedraza, M.; Penn, S.; Perreca, A.; Phelps, M.; Pichot, M.; Pickenpack, M.; Piergiovanni, F.; Pierro, V.; Pinard, L.; Pinto, I. M.; Pitkin, M.; Poeld, J.; Poggiani, R.; Poteomkin, A.; Powell, J.; Prasad, J.; Premachandra, S.; Prestegard, T.; Price, L. R.; Prijatelj, M.; Privitera, S.; Prix, R.; Prodi, G. A.; Prokhorov, L.; Puncken, O.; Punturo, M.; Puppo, P.; Qin, J.; Quetschke, V.; Quintero, E.; Quiroga, G.; Quitzow-James, R.; Raab, F. J.; Rabeling, D. S.; Rácz, I.; Radkins, H.; Raffai, P.; Raja, S.; Rajalakshmi, G.; Rakhmanov, M.; Ramet, C.; Ramirez, K.; Rapagnani, P.; Raymond, V.; Re, V.; Read, J.; Reed, C. M.; Regimbau, T.; Reid, S.; Reitze, D. H.; Rhoades, E.; Ricci, F.; Riles, K.; Robertson, N. A.; Robinet, F.; Rocchi, A.; Rodruck, M.; Rolland, L.; Rollins, J. G.; Romano, R.; Romanov, G.; Romie, J. H.; Rosińska, D.; Rowan, S.; Rüdiger, A.; Ruggi, P.; Ryan, K.; Salemi, F.; Sammut, L.; Sandberg, V.; Sanders, J. R.; Sannibale, V.; Santiago-Prieto, I.; Saracco, E.; Sassolas, B.; Sathyaprakash, B. S.; Saulson, P. R.; Savage, R.; Scheuer, J.; Schilling, R.; Schnabel, R.; Schofield, R. M. S.; Schreiber, E.; Schuette, D.; Schutz, B. F.; Scott, J.; Scott, S. M.; Sellers, D.; Sengupta, A. S.; Sentenac, D.; Sequino, V.; Sergeev, A.; Shaddock, D.; Shah, S.; Shahriar, M. S.; Shaltev, M.; Shapiro, B.; Shawhan, P.; Shoemaker, D. H.; Sidery, T. L.; Siellez, K.; Siemens, X.; Sigg, D.; Simakov, D.; Singer, A.; Singer, L.; Singh, R.; Sintes, A. M.; Slagmolen, B. J. J.; Slutsky, J.; Smith, J. R.; Smith, M.; Smith, R. J. E.; Smith-Lefebvre, N. D.; Son, E. J.; Sorazu, B.; Souradeep, T.; Sperandio, L.; Staley, A.; Stebbins, J.; Steinlechner, J.; Steinlechner, S.; Stephens, B. C.; Steplewski, S.; Stevenson, S.; Stone, R.; Stops, D.; Strain, K. A.; Straniero, N.; Strigin, S.; Sturani, R.; Stuver, A. L.; Summerscales, T. Z.; Susmithan, S.; Sutton, P. J.; Swinkels, B.; Tacca, M.; Talukder, D.; Tanner, D. B.; Tarabrin, S. P.; Taylor, R.; ter Braack, A. P. M.; Thirugnanasambandam, M. P.; Thomas, M.; Thomas, P.; Thorne, K. A.; Thorne, K. S.; Thrane, E.; Tiwari, V.; Tokmakov, K. V.; Tomlinson, C.; Toncelli, A.; Tonelli, M.; Torre, O.; Torres, C. V.; Torrie, C. I.; Travasso, F.; Traylor, G.; Tse, M.; Ugolini, D.; Unnikrishnan, C. S.; Urban, A. L.; Urbanek, K.; Vahlbruch, H.; Vajente, G.; Valdes, G.; Vallisneri, M.; van den Brand, J. F. J.; Van Den Broeck, C.; van der Putten, S.; van der Sluys, M. V.; van Heijningen, J.; van Veggel, A. A.; Vass, S.; Vasúth, M.; Vaulin, R.; Vecchio, A.; Vedovato, G.; Veitch, J.; Veitch, P. J.; Venkateswara, K.; Verkindt, D.; Verma, S. S.; Vetrano, F.; Viceré, A.; Vincent-Finley, R.; Vinet, J.-Y.; Vitale, S.; Vo, T.; Vocca, H.; Vorvick, C.; Vousden, W. D.; Vyachanin, S. P.; Wade, A.; Wade, L.; Wade, M.; Walker, M.; Wallace, L.; Wang, M.; Wang, X.; Ward, R. L.; Was, M.; Weaver, B.; Wei, L.-W.; Weinert, M.; Weinstein, A. J.; Weiss, R.; Welborn, T.; Wen, L.; Wessels, P.; West, M.; Westphal, T.; Wette, K.; Whelan, J. T.; White, D. J.; Whiting, B. F.; Wiesner, K.; Wilkinson, C.; Williams, K.; Williams, L.; Williams, R.; Williams, T.; Williamson, A. R.; Willis, J. L.; Willke, B.; Wimmer, M.; Winkler, W.; Wipf, C. C.; Wiseman, A. G.; Wittel, H.; Woan, G.; Worden, J.; Yablon, J.; Yakushin, I.; Yamamoto, H.; Yancey, C. C.; Yang, H.; Yang, Z.; Yoshida, S.; Yvert, M.; ZadroŻny, A.; Zanolin, M.; Zendri, J.-P.; Zhang, Fan; Zhang, L.; Zhao, C.; Zhu, X. J.; Zucker, M. E.; Zuraw, S.; Zweizig, J.; LIGO Scientific Collaboration; Virgo Collaboration

2014-09-01

We present the first results of an all-sky search for continuous gravitational waves from unknown spinning neutron stars in binary systems using LIGO and Virgo data. Using a specially developed analysis program, the TwoSpect algorithm, the search was carried out on data from the sixth LIGO science run and the second and third Virgo science runs. The search covers a range of frequencies from 20 Hz to 520 Hz, a range of orbital periods from 2 to ˜2,254 h and a frequency- and period-dependent range of frequency modulation depths from 0.277 to 100 mHz. This corresponds to a range of projected semimajor axes of the orbit from ˜0.6×10-3 ls to ˜6,500 ls assuming the orbit of the binary is circular. While no plausible candidate gravitational wave events survive the pipeline, upper limits are set on the analyzed data. The most sensitive 95% confidence upper limit obtained on gravitational wave strain is 2.3×10-24 at 217 Hz, assuming the source waves are circularly polarized. Although this search has been optimized for circular binary orbits, the upper limits obtained remain valid for orbital eccentricities as large as 0.9. In addition, upper limits are placed on continuous gravitational wave emission from the low-mass x-ray binary Scorpius X-1 between 20 Hz and 57.25 Hz.

Extending cluster Lot Quality Assurance Sampling designs for surveillance programs

PubMed Central

Hund, Lauren; Pagano, Marcello

2014-01-01

Lot quality assurance sampling (LQAS) has a long history of applications in industrial quality control. LQAS is frequently used for rapid surveillance in global health settings, with areas classified as poor or acceptable performance based on the binary classification of an indicator. Historically, LQAS surveys have relied on simple random samples from the population; however, implementing two-stage cluster designs for surveillance sampling is often more cost-effective than simple random sampling. By applying survey sampling results to the binary classification procedure, we develop a simple and flexible non-parametric procedure to incorporate clustering effects into the LQAS sample design to appropriately inflate the sample size, accommodating finite numbers of clusters in the population when relevant. We use this framework to then discuss principled selection of survey design parameters in longitudinal surveillance programs. We apply this framework to design surveys to detect rises in malnutrition prevalence in nutrition surveillance programs in Kenya and South Sudan, accounting for clustering within villages. By combining historical information with data from previous surveys, we design surveys to detect spikes in the childhood malnutrition rate. PMID:24633656

Extending cluster lot quality assurance sampling designs for surveillance programs.

PubMed

Hund, Lauren; Pagano, Marcello

2014-07-20

Lot quality assurance sampling (LQAS) has a long history of applications in industrial quality control. LQAS is frequently used for rapid surveillance in global health settings, with areas classified as poor or acceptable performance on the basis of the binary classification of an indicator. Historically, LQAS surveys have relied on simple random samples from the population; however, implementing two-stage cluster designs for surveillance sampling is often more cost-effective than simple random sampling. By applying survey sampling results to the binary classification procedure, we develop a simple and flexible nonparametric procedure to incorporate clustering effects into the LQAS sample design to appropriately inflate the sample size, accommodating finite numbers of clusters in the population when relevant. We use this framework to then discuss principled selection of survey design parameters in longitudinal surveillance programs. We apply this framework to design surveys to detect rises in malnutrition prevalence in nutrition surveillance programs in Kenya and South Sudan, accounting for clustering within villages. By combining historical information with data from previous surveys, we design surveys to detect spikes in the childhood malnutrition rate. Copyright © 2014 John Wiley & Sons, Ltd.

Weyl gravity revisited

DOE Office of Scientific and Technical Information (OSTI.GOV)

Álvarez, Enrique; González-Martín, Sergio, E-mail: enrique.alvarez@uam.es, E-mail: sergio.gonzalez.martin@csic.es

2017-02-01

The on shell equivalence of first order and second order formalisms for the Einstein-Hilbert action does not hold for those actions quadratic in curvature. It would seem that by considering the connection and the metric as independent dynamical variables, there are no quartic propagators for any dynamical variable. This suggests that it is possible to get both renormalizability and unitarity along these lines. We have studied a particular instance of those theories, namely Weyl gravity. In this first paper we show that it is not possible to implement this program with the Weyl connection alone.

Orbit of the mercury-manganese binary 41 Eridani

NASA Astrophysics Data System (ADS)

Hummel, C. A.; Schöller, M.; Duvert, G.; Hubrig, S.

2017-04-01

Context. Mercury-manganese (HgMn) stars are a class of slowly rotating chemically peculiar main-sequence late B-type stars. More than two-thirds of the HgMn stars are known to belong to spectroscopic binaries. Aims: By determining orbital solutions for binary HgMn stars, we will be able to obtain the masses for both components and the distance to the system. Consequently, we can establish the position of both components in the Hertzsprung-Russell diagram and confront the chemical peculiarities of the HgMn stars with their age and evolutionary history. Methods: We initiated a program to identify interferometric binaries in a sample of HgMn stars, using the PIONIER near-infrared interferometer at the VLTI on Cerro Paranal, Chile. For the detected systems, we intend to obtain full orbital solutions in conjunction with spectroscopic data. Results: The data obtained for the SB2 system 41 Eridani allowed the determination of the orbital elements with a period of just five days and a semi-major axis of under 2 mas. Including published radial velocity measurements, we derived almost identical masses of 3.17 ± 0.07 M⊙ for the primary and 3.07 ± 0.07 M⊙ for the secondary. The measured magnitude difference is less than 0.1 mag. The orbital parallax is 18.05 ± 0.17 mas, which is in good agreement with the Hipparcos trigonometric parallax of 18.33 ± 0.15 mas. The stellar diameters are resolved as well at 0.39 ± 0.03 mas. The spin rate is synchronized with the orbital rate. Based on observations made with ESO Telescopes at the La Silla Paranal Observatory under program IDs 088.C-0111, 189.C-0644, 090.D-0291, and 090.D-0917.

Looking for the Coldest Atmospheres: a Search for Planetary Mass Companions around T and Y Brown Dwarfs

NASA Astrophysics Data System (ADS)

Fontanive, Clemence

2017-08-01

We propose to obtain WFC3/IR imaging of the very coolest brown dwarfs (T < 800 K) to search for substellar and planetary-mass companions to these objects. Companions discovered by this program would likely be analogues of the 250 K brown dwarf WISE 0855 and would provide vital benchmark objects for theoretical models, closing the gap in mass and temperature between brown dwarfs and planets. Finding such an object as a member of a binary system would be even more valuable as it would allow for the measurement of dynamical masses. We recently placed the first constraints to date on the binary frequency for brown dwarfs with spectral types >T8. This program will triple our current sample size, a requirement in order to confirm our current results and compare substellar binary properties for various spectral type and age populations. The WFC3/IR plate will allow us to probe near equal-mass binaries down to separations of 0.2 (2-3 AU for the typical distances of our targets). True cool companions should show strong absorption around 1.4 um as a result of the deep water absorption band observed at that wavelength in substellar spectra. We therefore propose observations in the WFC3 F127M and F139M filters which will allow us to robustly identify bona fide candidates and distinguish them from background stars based on this spectral feature. Most of our targets lack suitable NGS AO guide stars or LGS AO tip-tilt stars to be observed with ground-based telescopes, and the 1.4 um water band is often unobservable from the ground due to telluric water absorption. WFC3 on HST is thus the only instrument suitable for these observations.

Separating the Spectral Components of the Massive Triple Star System Delta Orionis

NASA Astrophysics Data System (ADS)

Gies, Douglas

2013-10-01

The multiple star system of delta Orionis represents one of the closest examples of a luminous O-star with a strong stellar wind, and it was the target of a recent multi-wavelength campaign to determine the source of the wind X-ray emission. It consists of aclose eclipsing binary with a more distant tertiary, and all the components are massive stars. Investigations of the radial velocity curves of the eclipsing system are made difficult by severe line blending with the spectral lines of the tertiary star, and the resulting mass estimates range by a factor of two. We propose that the solution to this problem is to isolate the flux of the tertiary through high angular resolutionspectroscopy with HST/STIS, and we show how a two visit program of ultraviolet and spatially resolved spectroscopy will provide us with the means to characterize the spectra of all three stars in the triple. This will allow us to reassess a large body of existing optical and UV spectroscopy and determine reliable radial velocity curves for the components in the close binary. By then fitting a new high precision light curve from MOST photometry, we will derive accurate masses, temperatures, radii, and projected rotational velocities for all the components. The inner binary also hasa measured apsidal period, and the new results will form a key test of models of interior structure. The analysis will also provide secure estimates for the geometry and size of the inner binary and the radius of the secondary, the parameters required to analyze the orbital phase variations and sites of origin of the wind X-ray emission documented in a recent Chandra/HETGS program.

Mining Predictors of Success in Air Force Flight Training Regiments via Semantic Analysis of Instructor Evaluations

DTIC Science & Technology

2018-03-01

We apply our methodology to the criticism text written in the flight-training program student evaluations in order to construct a model that...factors. We apply our methodology to the criticism text written in the flight-training program student evaluations in order to construct a model...9 D. BINARY CLASSIFICATION AND FEATURE SELECTION ..........11 III. METHODOLOGY

An analysis of factors affecting participation behavior of limited resource farmers in agricultural cost-share programs in Alabama

Treesearch

Okwudili Onianwa; Gerald Wheelock; Buddhi Gyawali; Jianbang Gan; Mark Dubois; John Schelhas

2004-01-01

This study examines factors that affect the participation behavior of limited resource farmers in agricultural cost-share programs in Alabama. The data were generated from a survey administered to a sample of limited resource farm operators. A binary logit model was employed to analyze the data. Results indicate that college education, age, gross sales, ratio of owned...

The Evolution of the Multiplicity of Embedded Protostars. II. Binary Separation Distribution and Analysis

NASA Astrophysics Data System (ADS)

Connelley, Michael S.; Reipurth, Bo; Tokunaga, Alan T.

2008-06-01

We present the Class I protostellar binary separation distribution based on the data tabulated in a companion paper. We verify the excess of Class I binary stars over solar-type main-sequence stars in the separation range from 500 AU to 4500 AU. Although our sources are in nearby star-forming regions distributed across the entire sky (including Orion), none of our objects are in a high stellar density environment. A log-normal function, used by previous authors to fit the main-sequence and T Tauri binary separation distributions, poorly fits our data, and we determine that a log-uniform function is a better fit. Our observations show that the binary separation distribution changes significantly during the Class I phase, and that the binary frequency at separations greater than 1000 AU declines steadily with respect to spectral index. Despite these changes, the binary frequency remains constant until the end of the Class I phase, when it drops sharply. We propose a scenario to account for the changes in the Class I binary separation distribution. This scenario postulates that a large number of companions with a separation greater than ~1000 AU were ejected during the Class 0 phase, but remain gravitationally bound due to the significant mass of the Class I envelope. As the envelope dissipates, these companions become unbound and the binary frequency at wide separations declines. Circumstellar and circumbinary disks are expected to play an important role in the orbital evolution at closer separations. This scenario predicts that a large number of Class 0 objects should be non-hierarchical multiple systems, and that many Class I young stellar objects (YSOs) with a widely separated companion should also have a very close companion. We also find that Class I protostars are not dynamically pristine, but have experienced dynamical evolution before they are visible as Class I objects. Our analysis shows that the Class I binary frequency and the binary separation distribution strongly depend on the star-forming environment. The Infrared Telescope Facility is operated by the University of Hawaii under Cooperative Agreement no. NCC 5-538 with the National Aeronautics and Space Administration, Science Mission Directorate, Planetary Astronomy Program. The United Kingdom Infrared Telescope is operated by the Joint Astronomy Centre on behalf of the Science and Technology Facilities Council of the U.K. Based in part on data collected at Subaru Telescope, which is operated by the National Astronomical Observatory of Japan.

Contractions and deformations of quasiclassical Lie algebras preserving a nondegenerate quadratic Casimir operator

DOE Office of Scientific and Technical Information (OSTI.GOV)

Campoamor-Stursberg, R., E-mail: rutwig@mat.ucm.e

2008-05-15

By means of contractions of Lie algebras, we obtain new classes of indecomposable quasiclassical Lie algebras that satisfy the Yang-Baxter equations in its reformulation in terms of triple products. These algebras are shown to arise naturally from noncompact real simple algebras with nonsimple complexification, where we impose that a nondegenerate quadratic Casimir operator is preserved by the limiting process. We further consider the converse problem and obtain sufficient conditions on integrable cocycles of quasiclassical Lie algebras in order to preserve nondegenerate quadratic Casimir operators by the associated linear deformations.

Nonadiabatic effects in ultracold molecules via anomalous linear and quadratic Zeeman shifts.

PubMed

McGuyer, B H; Osborn, C B; McDonald, M; Reinaudi, G; Skomorowski, W; Moszynski, R; Zelevinsky, T

2013-12-13

Anomalously large linear and quadratic Zeeman shifts are measured for weakly bound ultracold 88Sr2 molecules near the intercombination-line asymptote. Nonadiabatic Coriolis coupling and the nature of long-range molecular potentials explain how this effect arises and scales roughly cubically with the size of the molecule. The linear shifts yield nonadiabatic mixing angles of the molecular states. The quadratic shifts are sensitive to nearby opposite f-parity states and exhibit fourth-order corrections, providing a stringent test of a state-of-the-art ab initio model.

Exact period-four solutions of a family of n-dimensional quadratic maps via harmonic balance and Gröbner bases.

PubMed

D'Amico, María Belén; Calandrini, Guillermo L

2015-11-01

Analytical solutions of the period-four orbits exhibited by a classical family of n-dimensional quadratic maps are presented. Exact expressions are obtained by applying harmonic balance and Gröbner bases to a single-input single-output representation of the system. A detailed study of a generalized scalar quadratic map and a well-known delayed logistic model is included for illustration. In the former example, conditions for the existence of bistability phenomenon are also introduced.

On orthogonality preserving quadratic stochastic operators

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mukhamedov, Farrukh; Taha, Muhammad Hafizuddin Mohd

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.

Exact period-four solutions of a family of n-dimensional quadratic maps via harmonic balance and Gröbner bases

NASA Astrophysics Data System (ADS)

D'Amico, María Belén; Calandrini, Guillermo L.

2015-11-01

Analytical solutions of the period-four orbits exhibited by a classical family of n-dimensional quadratic maps are presented. Exact expressions are obtained by applying harmonic balance and Gröbner bases to a single-input single-output representation of the system. A detailed study of a generalized scalar quadratic map and a well-known delayed logistic model is included for illustration. In the former example, conditions for the existence of bistability phenomenon are also introduced.

Quantum superintegrable system with a novel chain structure of quadratic algebras

NASA Astrophysics Data System (ADS)

Liao, Yidong; Marquette, Ian; Zhang, Yao-Zhong

2018-06-01

We analyse the n-dimensional superintegrable Kepler–Coulomb system with non-central terms. We find a novel underlying chain structure of quadratic algebras formed by the integrals of motion. We identify the elements for each sub-structure and obtain the algebra relations satisfied by them and the corresponding Casimir operators. These quadratic sub-algebras are realized in terms of a chain of deformed oscillators with factorized structure functions. We construct the finite-dimensional unitary representations of the deformed oscillators, and give an algebraic derivation of the energy spectrum of the superintegrable system.

Finite-dimensional linear approximations of solutions to general irregular nonlinear operator equations and equations with quadratic operators

NASA Astrophysics Data System (ADS)

Kokurin, M. Yu.

2010-11-01

A general scheme for improving approximate solutions to irregular nonlinear operator equations in Hilbert spaces is proposed and analyzed in the presence of errors. A modification of this scheme designed for equations with quadratic operators is also examined. The technique of universal linear approximations of irregular equations is combined with the projection onto finite-dimensional subspaces of a special form. It is shown that, for finite-dimensional quadratic problems, the proposed scheme provides information about the global geometric properties of the intersections of quadrics.

Testing Ultracool Atmospheres with Mass Benchmarks

NASA Astrophysics Data System (ADS)

Dupuy, Trent J.; Liu, Michael C.

2011-08-01

After years of patient orbital monitoring, there is now a sample of ~10 very low-mass stars and brown dwarfs with precise (~5%) dynamical masses. These binaries represent the gold standard for testing substellar theoretical models. Work to date has identified problems with the model-predicted broad-band colors, effective temperatures, and possibly even luminosity evolution with age. However, our ability to test models is currently limited by how well the individual components of these highly prized binaries are characterized. To solve this problem, we propose to obtain narrow-band imaging with Keck/OSIRIS LGS to measure resolved SEDs for this first sizable sample of ultracool binaries with well-determined dynamical masses. This multi- band photometry will enable us to precisely estimate spectral types and effective temperatures of individual binary components, providing the strongest constraints to date on widely used evolutionary and atmospheric models. Our proposed Keck observations are much less daunting in comparison to the years of orbital monitoring needed to yield dynamical masses, but these data are equally vital for robust tests of theory. (Note: Our proposed time is intended to replace the 1 night awarded by NOAO to carry out this program in 2010B, which was completely lost due to weather.)

Large-scale Exploration of Neuronal Morphologies Using Deep Learning and Augmented Reality.

PubMed

Li, Zhongyu; Butler, Erik; Li, Kang; Lu, Aidong; Ji, Shuiwang; Zhang, Shaoting

2018-02-12

Recently released large-scale neuron morphological data has greatly facilitated the research in neuroinformatics. However, the sheer volume and complexity of these data pose significant challenges for efficient and accurate neuron exploration. In this paper, we propose an effective retrieval framework to address these problems, based on frontier techniques of deep learning and binary coding. For the first time, we develop a deep learning based feature representation method for the neuron morphological data, where the 3D neurons are first projected into binary images and then learned features using an unsupervised deep neural network, i.e., stacked convolutional autoencoders (SCAEs). The deep features are subsequently fused with the hand-crafted features for more accurate representation. Considering the exhaustive search is usually very time-consuming in large-scale databases, we employ a novel binary coding method to compress feature vectors into short binary codes. Our framework is validated on a public data set including 58,000 neurons, showing promising retrieval precision and efficiency compared with state-of-the-art methods. In addition, we develop a novel neuron visualization program based on the techniques of augmented reality (AR), which can help users take a deep exploration of neuron morphologies in an interactive and immersive manner.

Double-tick realization of binary control program

NASA Astrophysics Data System (ADS)

Kobylecki, Michał; Kania, Dariusz

2016-12-01

This paper presents a procedure for the implementation of control algorithms for hardware-bit compatible with the standard IEC61131-3. The described transformation based on the sets of calculus and graphs, allows translation of the original form of the control program to the form in full compliance with the original, giving the architecture represented by two tick. The proposed method enables the efficient implementation of the control bits in the FPGA with the use of a standardized programming language LD.

Using State Merging and State Pruning to Address the Path Explosion Problem Faced by Symbolic Execution

DTIC Science & Technology

2014-06-19

urgent and compelling. Recent efforts in this area automate program analysis techniques using model checking and symbolic execution [2, 5–7]. These...bounded model checking tool for x86 binary programs developed at the Air Force Institute of Technology (AFIT). Jiseki creates a bit-vector logic model based...assume there are n different paths through the function foo . The program could potentially call the function foo a bound number of times, resulting in n

Effect of dietary supplementation with Moringa Oleifera leaf on performance, meat quality, and oxidative stability of meat in broilers.

PubMed

Cui, Yao-Ming; Wang, Jing; Lu, Wei; Zhang, Hai-Jun; Wu, Shu-Geng; Qi, Guang-Hai

2018-04-11

The objective of this study was to evaluate the effects of dietary supplementation with Moringa oleifera leaf (MOL) on performance, carcass characteristics, meat quality, and oxidative stability of breast muscle in broilers. A total of 720 1-d-old male Arbor Acres birds were randomly divided into 6 dietary groups, which were fed a basal diet supplemented with 0, 1, 2, 5, 10, and 15% MOL, respectively. Each group had 6 replicates of 20 birds each. The feeding trial lasted for 42 d. The results showed dietary MOL supplementation linearly and quadratically decreased body weight and average daily gain (P < 0.01), and increased feed conversion ratio (P < 0.001). Abdominal fat decreased linearly and quadratically in response to the supplementation of MOL in diets, both on d 21 and 42 (P < 0.001). In breast muscle, dietary supplementation with MOL quadratically increased the contents of C18:2, C18:3n-3, C20:4, polyunsaturated fatty acids (PUFA), n-3 PUFA, n-6 PUFA (P < 0.01), and decreased thrombogenic index (TI; P = 0.019). Dietary inclusion of MOL improved meat color, evidenced by quadratically reduced b* (yellowness) values (45 min postmortem, P = 0.001; 24 h postmortem, P = 0.018) and increased a* (redness) values (24 h postmortem, P < 0.001). Besides, diets supplemented with MOL quadratically decreased malondialdehyde (MDA) levels in breast muscle during storage (P < 0.001). Plasma total anti-oxidative capacity, total superoxide dismutase, glutathione peroxidase activities increased quadratically (P < 0.01), whereas MDA decreased quadratically (P < 0.001), in response to dietary MOL supplementation. In summary, MOL could be used as a feed ingredient for broilers to improve PUFA contents, oxidative stability, color of breast muscle, and abdominal fat without adverse effects on growth performance, with an inclusion of 1.56% in the diets.

Exploring Quadratic Functions with Logger "Pro"

ERIC Educational Resources Information Center

Pope, Derek

2018-01-01

The author shares the lesson that he used to introduce the quadratic unit to students in an extended second-year algebra class, demonstrate why it was appropriate for his struggling learners, and discuss possible future modifications to this lesson.

Symmetric quadratic Hamiltonians with pseudo-Hermitian matrix representation

DOE Office of Scientific and Technical Information (OSTI.GOV)

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 aremore » 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.« less

Calculus students' understanding of the vertex of the quadratic function in relation to the concept of derivative

NASA Astrophysics Data System (ADS)

Burns-Childers, Annie; Vidakovic, Draga

2018-07-01

The purpose of this study was to gain insight into 30, first year calculus students' understanding of the relationship between the concept of vertex of a quadratic function and the concept of the derivative. APOS (action-process-object-schema) theory was applied as a guiding framework of analysis on student written work, think-aloud and follow up group interviews. Students' personal meanings of the vertex, including misconceptions, were explored, along with students' understanding to solve problems pertaining to the derivative of a quadratic function. Results give evidence of students' weak schema of the vertex, lack of connection between different problem types and the importance of linguistics in relation to levels of APOS theory. A preliminary genetic decomposition was developed based on the results. Future research is suggested as a continuation to improve student understanding of the relationship between the vertex of quadratic functions and the derivative.

Synchronization of Coupled Dynamical Systems: Tolerance to Weak Connectivity and Arbitrarily Bounded Time-Varying Delays

DOE Office of Scientific and Technical Information (OSTI.GOV)

Meng, Ziyang; Yang, Tao; Li, Guoqi

Here, we study synchronization of coupled linear systems over networks with weak connectivity and nonuniform time-varying delays. We focus on the case where the internal dynamics are time-varying but non-expansive (stable dynamics with a quadratic Lyapunov function). Both uniformly jointly connected and infinitely jointly connected communication topologies are considered. A new concept of quadratic synchronization is introduced. We first show that global asymptotic quadratic synchronization can be achieved over directed networks with uniform joint connectivity and arbitrarily bounded delays. We then study the case of infinitely jointly connected communication topology. In particular, for the undirected communication topologies, it turns outmore » that the existence of a uniform time interval for the jointly connected communication topology is not necessary and quadratic synchronization can be achieved when the time-varying nonuniform delays are arbitrarily bounded. Finally, simulation results are provided to validate the theoretical results.« less

On Volterra quadratic stochastic operators with continual state space

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ganikhodjaev, Nasir; Hamzah, Nur Zatul Akmar

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 themore » segment X = [0,1] with Borel σ - algebra F on X , prove their regularity and show that the limit measure is a Dirac measure.« less

Towards a unifying approach to diversity measures: bridging the gap between the Shannon entropy and Rao's quadratic index.

PubMed

Ricotta, Carlo; Szeidl, Laszlo

2006-11-01

The diversity of a species assemblage has been studied extensively for many decades in relation to its possible connection with ecosystem functioning and organization. In this view most diversity measures, such as Shannon's entropy, rely upon information theory as a basis for the quantification of diversity. Also, traditional diversity measures are computed using species relative abundances and cannot account for the ecological differences between species. Rao first proposed a diversity index, termed quadratic diversity (Q) that incorporates both species relative abundances and pairwise distances between species. Quadratic diversity is traditionally defined as the expected distance between two randomly selected individuals. In this paper, we show that quadratic diversity can be interpreted as the expected conflict among the species of a given assemblage. From this unusual interpretation, it naturally follows that Rao's Q can be related to the Shannon entropy through a generalized version of the Tsallis parametric entropy.

Homotopy approach to optimal, linear quadratic, fixed architecture compensation

NASA Technical Reports Server (NTRS)

Mercadal, Mathieu

1991-01-01

Optimal linear quadratic Gaussian compensators with constrained architecture are a sensible way to generate good multivariable feedback systems meeting strict implementation requirements. The optimality conditions obtained from the constrained linear quadratic Gaussian are a set of highly coupled matrix equations that cannot be solved algebraically except when the compensator is centralized and full order. An alternative to the use of general parameter optimization methods for solving the problem is to use homotopy. The benefit of the method is that it uses the solution to a simplified problem as a starting point and the final solution is then obtained by solving a simple differential equation. This paper investigates the convergence properties and the limitation of such an approach and sheds some light on the nature and the number of solutions of the constrained linear quadratic Gaussian problem. It also demonstrates the usefulness of homotopy on an example of an optimal decentralized compensator.

Synchronization of Coupled Dynamical Systems: Tolerance to Weak Connectivity and Arbitrarily Bounded Time-Varying Delays

DOE PAGES

Meng, Ziyang; Yang, Tao; Li, Guoqi; ...

2017-09-18

Here, we study synchronization of coupled linear systems over networks with weak connectivity and nonuniform time-varying delays. We focus on the case where the internal dynamics are time-varying but non-expansive (stable dynamics with a quadratic Lyapunov function). Both uniformly jointly connected and infinitely jointly connected communication topologies are considered. A new concept of quadratic synchronization is introduced. We first show that global asymptotic quadratic synchronization can be achieved over directed networks with uniform joint connectivity and arbitrarily bounded delays. We then study the case of infinitely jointly connected communication topology. In particular, for the undirected communication topologies, it turns outmore » that the existence of a uniform time interval for the jointly connected communication topology is not necessary and quadratic synchronization can be achieved when the time-varying nonuniform delays are arbitrarily bounded. Finally, simulation results are provided to validate the theoretical results.« less

GLOBAL SOLUTIONS TO FOLDED CONCAVE PENALIZED NONCONVEX LEARNING

PubMed Central

Liu, Hongcheng; Yao, Tao; Li, Runze

2015-01-01

This paper is concerned with solving nonconvex learning problems with folded concave penalty. Despite that their global solutions entail desirable statistical properties, there lack optimization techniques that guarantee global optimality in a general setting. In this paper, we show that a class of nonconvex learning problems are equivalent to general quadratic programs. This equivalence facilitates us in developing mixed integer linear programming reformulations, which admit finite algorithms that find a provably global optimal solution. We refer to this reformulation-based technique as the mixed integer programming-based global optimization (MIPGO). To our knowledge, this is the first global optimization scheme with a theoretical guarantee for folded concave penalized nonconvex learning with the SCAD penalty (Fan and Li, 2001) and the MCP penalty (Zhang, 2010). Numerical results indicate a significant outperformance of MIPGO over the state-of-the-art solution scheme, local linear approximation, and other alternative solution techniques in literature in terms of solution quality. PMID:27141126

User's manual: Subsonic/supersonic advanced panel pilot code

NASA Technical Reports Server (NTRS)

Moran, J.; Tinoco, E. N.; Johnson, F. T.

1978-01-01

Sufficient instructions for running the subsonic/supersonic advanced panel pilot code were developed. This software was developed as a vehicle for numerical experimentation and it should not be construed to represent a finished production program. The pilot code is based on a higher order panel method using linearly varying source and quadratically varying doublet distributions for computing both linearized supersonic and subsonic flow over arbitrary wings and bodies. This user's manual contains complete input and output descriptions. A brief description of the method is given as well as practical instructions for proper configurations modeling. Computed results are also included to demonstrate some of the capabilities of the pilot code. The computer program is written in FORTRAN IV for the SCOPE 3.4.4 operations system of the Ames CDC 7600 computer. The program uses overlay structure and thirteen disk files, and it requires approximately 132000 (Octal) central memory words.

A new performance index for the repetitive motion of mobile manipulators.

PubMed

Xiao, Lin; Zhang, Yunong

2014-02-01

A mobile manipulator is a robotic device composed of a mobile platform and a stationary manipulator fixed to the platform. To achieve the repetitive motion control of mobile manipulators, the mobile platform and the manipulator have to realize the repetitive motion simultaneously. To do so, a novel quadratic performance index is, for the first time, designed and presented in this paper, of which the effectiveness is analyzed by following a neural dynamics method. Then, a repetitive motion scheme is proposed by combining the criterion, physical constraints, and integrated kinematical equations of mobile manipulators, which is further reformulated as a quadratic programming (QP) subject to equality and bound constraints. In addition, two important Bridge theorems are established to prove that such a QP can be converted equivalently into a linear variational inequality, and then equivalently into a piecewise-linear projection equation (PLPE). A real-time numerical algorithm based on PLPE is thus developed and applied for the online solution of the resultant QP. Two tracking-path tasks demonstrate the effectiveness and accuracy of the repetitive motion scheme. In addition, comparisons between the nonrepetitive and repetitive motion further validate the superiority and novelty of the proposed scheme.

Optimal Fermentation Conditions of Hyaluronidase Inhibition Activity on Asparagus cochinchinensis Merrill by Weissella cibaria.

PubMed

Kim, Minji; Kim, Won-Baek; Koo, Kyoung Yoon; Kim, Bo Ram; Kim, Doohyun; Lee, Seoyoun; Son, Hong Joo; Hwang, Dae Youn; Kim, Dong Seob; Lee, Chung Yeoul; Lee, Heeseob

2017-04-28

This study was conducted to evaluate the hyaluronidase (HAase) inhibition activity of Asparagus cochinchinesis (AC) extracts following fermentation by Weissella cibaria through response surface methodology. To optimize the HAase inhibition activity, a central composite design was introduced based on four variables: the concentration of AC extract ( X 1 : 1-5%), amount of starter culture ( X 2 : 1-5%), pH ( X 3 : 4-8), and fermentation time ( X 4 : 0-10 days). The experimental data were fitted to quadratic regression equations, the accuracy of the equations was analyzed by ANOVA, and the regression coefficients for the surface quadratic model of HAase inhibition activity in the fermented AC extract were estimated by the F test and the corresponding p values. The HAase inhibition activity indicated that fermentation time was most significant among the parameters within the conditions tested. To validate the model, two different conditions among those generated by the Design Expert program were selected. Under both conditions, predicted and experimental data agreed well. Moreover, the content of protodioscin (a well-known compound related to anti-inflammation activity) was elevated after fermentation of the AC extract at the optimized fermentation condition.

Theory of Band Warping and its Effects on Thermoelectronic Transport Properties

NASA Astrophysics Data System (ADS)

Mecholsky, Nicholas; Resca, Lorenzo; Pegg, Ian; Fornari, Marco

2015-03-01

Transport properties of materials depend upon features of band structures near extrema in the BZ. Such features are generally described in terms of quadratic expansions and effective masses. Such expansions, however, are permissible only under strict conditions that are sometimes violated by materials. Suggestive terms such as ``band warping'' have been used to refer to such situations and ad hoc methods have been developed to treat them. We develop a generally applicable theory, based on radial expansions, and a corresponding definition of angular effective mass which also accounts for effects of band non-parabolicity and anisotropy. Further, we develop precise procedures to evaluate band warping quantitatively and as an example we analyze the warping features of valence bands in silicon using first-principles calculations and we compare those with semi-empirical models. We use our theory to generalize derivations of transport coefficients for cases of either single or multiple electronic bands, with either quadratically expansible or warped energy surfaces. We introduce the transport-equivalent ellipsoid and illustrate the drastic effects that band warping can induce on thermoelectric properties using multi-band models. Vitreous State Laboratory and Samsung's GRO program.

Electromagnetic tracking system with reduced distortion using quadratic excitation.

PubMed

Bien, Tomasz; Li, Mengfei; Salah, Zein; Rose, Georg

2014-03-01

Electromagnetic tracking systems, frequently used in minimally invasive surgery, are affected by conductive distorters. The influence of conductive distorters on electromagnetic tracking system accuracy can be reduced through magnetic field modifications. This approach was developed and tested. The voltage induced directly by the emitting coil in the sensing coil without additional influence by the conductive distorter depends on the first derivative of the voltage on the emitting coil. The voltage which is induced indirectly by the emitting coil across the conductive distorter in the sensing coil, however, depends on the second derivative of the voltage on the emitting coil. The electromagnetic tracking system takes advantage of this difference by supplying the emitting coil with a quadratic excitation voltage. The method is adaptive relative to the amount of distortion cause by the conductive distorters. This approach is evaluated with an experimental setup of the electromagnetic tracking system. In vitro testing showed that the maximal error decreased from 10.9 to 3.8 mm when the quadratic voltage was used to excite the emitting coil instead of the sinusoidal voltage. Furthermore, the root mean square error in the proximity of the aluminum disk used as a conductive distorter was reduced from 3.5 to 1.6 mm when the electromagnetic tracking system used the quadratic instead of sinusoidal excitation. Electromagnetic tracking with quadratic excitation is immune to the effects of a conductive distorter, especially compared with sinusoidal excitation of the emitting coil. Quadratic excitation of electromagnetic tracking for computer-assisted surgery is promising for clinical applications.

Individualizing Psychomotor Activities for the Handicapped.

ERIC Educational Resources Information Center

Shemick, John M.

1978-01-01

Public Law 94-142 requires that handicapped students have individual education plans containing goals or objectives, description of placement and services, and evaluation specifications. The Fleishman Binary Decision Flow Diagram provides teachers with technique for analyzing program activities for ability requirements. (CSS)

Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

NASA Technical Reports Server (NTRS)

Cheung, Kar-Ming; Lee, Charles H.

2012-01-01

We developed framework and the mathematical formulation for optimizing communication network using mixed integer programming. The design yields a system that is much smaller, in search space size, when compared to the earlier approach. Our constrained network optimization takes into account the dynamics of link performance within the network along with mission and operation requirements. A unique penalty function is introduced to transform the mixed integer programming into the more manageable problem of searching in a continuous space. The constrained optimization problem was proposed to solve in two stages: first using the heuristic Particle Swarming Optimization algorithm to get a good initial starting point, and then feeding the result into the Sequential Quadratic Programming algorithm to achieve the final optimal schedule. We demonstrate the above planning and scheduling methodology with a scenario of 20 spacecraft and 3 ground stations of a Deep Space Network site. Our approach and framework have been simple and flexible so that problems with larger number of constraints and network can be easily adapted and solved.

Field-antifield and BFV formalisms for quadratic systems with open gauge algebras

DOE Office of Scientific and Technical Information (OSTI.GOV)

Nirov, K.S.; Razumov, A.V.

1992-09-20

In this paper the Lagrangian field-antifield (BV) and Hamiltonian (BFV) BRST formalisms for the general quadratic systems with open gauge algebra are considered. The equivalence between the Lagrangian and Hamiltonian formalisms is proven.

Using Simple Quadratic Equations to Estimate Equilibrium Concentrations of an Acid

ERIC Educational Resources Information Center

Brilleslyper, Michael A.

2004-01-01

Application of quadratic equations to standard problem in chemistry like finding equilibrium concentrations of ions in an acid solution is explained. This clearly shows that pure mathematical analysis has meaningful applications in other areas as well.

Observers for a class of systems with nonlinearities satisfying an incremental quadratic inequality

NASA Technical Reports Server (NTRS)

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.

Atomic-Scale Tuning of Layered Binary Metal Oxides for High Temperature Moving Assemblies

DTIC Science & Technology

2015-06-01

AFRL-OSR-VA-TR-2015-0166 Atomic-Scale Tuning of Layered Binary Metal OxideS ASHLIE MARTINI UNIVERSITY OF CALIFORNIA MERCED Final Report 06/01/2015...Assemblies 5a.  CONTRACT NUMBER 5b.  GRANT NUMBER FA9550-12-1-0221 5c.  PROGRAM ELEMENT NUMBER 6.  AUTHOR(S) ASHLIE MARTINI 5d.  PROJECT NUMBER 5e...ABSTRACT UU 18.  NUMBER        OF        PAGES 19a.  NAME OF RESPONSIBLE PERSON ASHLIE MARTINI Standard Form 298 (Rev. 8/98) Prescribed by ANSI Std. Z39.18