WorldWideScience

Sample records for nonnegative quadratic mappings

  1. Semi-Supervised Half-Quadratic Nonnegative Matrix Factorization for Face Recognition

    KAUST Repository

    Alghamdi, Masheal M.

    2014-05-01

    Face recognition is a challenging problem in computer vision. Difficulties such as slight differences between similar faces of different people, changes in facial expressions, light and illumination condition, and pose variations add extra complications to the face recognition research. Many algorithms are devoted to solving the face recognition problem, among which the family of nonnegative matrix factorization (NMF) algorithms has been widely used as a compact data representation method. Different versions of NMF have been proposed. Wang et al. proposed the graph-based semi-supervised nonnegative learning (S2N2L) algorithm that uses labeled data in constructing intrinsic and penalty graph to enforce separability of labeled data, which leads to a greater discriminating power. Moreover the geometrical structure of labeled and unlabeled data is preserved through using the smoothness assumption by creating a similarity graph that conserves the neighboring information for all labeled and unlabeled data. However, S2N2L is sensitive to light changes, illumination, and partial occlusion. In this thesis, we propose a Semi-Supervised Half-Quadratic NMF (SSHQNMF) algorithm that combines the benefits of S2N2L and the robust NMF by the half- quadratic minimization (HQNMF) algorithm.Our algorithm improves upon the S2N2L algorithm by replacing the Frobenius norm with a robust M-Estimator loss function. A multiplicative update solution for our SSHQNMF algorithmis driven using the half- 4 quadratic (HQ) theory. Extensive experiments on ORL, Yale-A and a subset of the PIE data sets for nine M-estimator loss functions for both SSHQNMF and HQNMF algorithms are investigated, and compared with several state-of-the-art supervised and unsupervised algorithms, along with the original S2N2L algorithm in the context of classification, clustering, and robustness against partial occlusion. The proposed algorithm outperformed the other algorithms. Furthermore, SSHQNMF with Maximum Correntropy

  2. Hyperspectral and multispectral data fusion based on linear-quadratic nonnegative matrix factorization

    Science.gov (United States)

    Benhalouche, Fatima Zohra; Karoui, Moussa Sofiane; Deville, Yannick; Ouamri, Abdelaziz

    2017-04-01

    This paper proposes three multisharpening approaches to enhance the spatial resolution of urban hyperspectral remote sensing images. These approaches, related to linear-quadratic spectral unmixing techniques, use a linear-quadratic nonnegative matrix factorization (NMF) multiplicative algorithm. These methods begin by unmixing the observable high-spectral/low-spatial resolution hyperspectral and high-spatial/low-spectral resolution multispectral images. The obtained high-spectral/high-spatial resolution features are then recombined, according to the linear-quadratic mixing model, to obtain an unobservable multisharpened high-spectral/high-spatial resolution hyperspectral image. In the first designed approach, hyperspectral and multispectral variables are independently optimized, once they have been coherently initialized. These variables are alternately updated in the second designed approach. In the third approach, the considered hyperspectral and multispectral variables are jointly updated. Experiments, using synthetic and real data, are conducted to assess the efficiency, in spatial and spectral domains, of the designed approaches and of linear NMF-based approaches from the literature. Experimental results show that the designed methods globally yield very satisfactory spectral and spatial fidelities for the multisharpened hyperspectral data. They also prove that these methods significantly outperform the used literature approaches.

  3. Semi-Supervised Half-Quadratic Nonnegative Matrix Factorization for Face Recognition

    KAUST Repository

    Alghamdi, Masheal M.

    2014-01-01

    complications to the face recognition research. Many algorithms are devoted to solving the face recognition problem, among which the family of nonnegative matrix factorization (NMF) algorithms has been widely used as a compact data representation method

  4. Nonnegative constraint quadratic program technique to enhance the resolution of γ spectra

    Science.gov (United States)

    Li, Jinglun; Xiao, Wuyun; Ai, Xianyun; Chen, Ye

    2018-04-01

    Two concepts of the nonnegative least squares problem (NNLS) and the linear complementarity problem (LCP) are introduced for the resolution enhancement of the γ spectra. The respective algorithms such as the active set method and the primal-dual interior point method are applied to solve the above two problems. In mathematics, the nonnegative constraint results in the sparsity of the optimal solution of the deconvolution, and it is this sparsity that enhances the resolution. Finally, a comparison in the peak position accuracy and the computation time is made between these two methods and the boosted L_R and Gold methods.

  5. Local hyperspectral data multisharpening based on linear/linear-quadratic nonnegative matrix factorization by integrating lidar data

    Science.gov (United States)

    Benhalouche, Fatima Zohra; Karoui, Moussa Sofiane; Deville, Yannick; Ouamri, Abdelaziz

    2015-10-01

    In this paper, a new Spectral-Unmixing-based approach, using Nonnegative Matrix Factorization (NMF), is proposed to locally multi-sharpen hyperspectral data by integrating a Digital Surface Model (DSM) obtained from LIDAR data. In this new approach, the nature of the local mixing model is detected by using the local variance of the object elevations. The hyper/multispectral images are explored using small zones. In each zone, the variance of the object elevations is calculated from the DSM data in this zone. This variance is compared to a threshold value and the adequate linear/linearquadratic spectral unmixing technique is used in the considered zone to independently unmix hyperspectral and multispectral data, using an adequate linear/linear-quadratic NMF-based approach. The obtained spectral and spatial information thus respectively extracted from the hyper/multispectral images are then recombined in the considered zone, according to the selected mixing model. Experiments based on synthetic hyper/multispectral data are carried out to evaluate the performance of the proposed multi-sharpening approach and literature linear/linear-quadratic approaches used on the whole hyper/multispectral data. In these experiments, real DSM data are used to generate synthetic data containing linear and linear-quadratic mixed pixel zones. The DSM data are also used for locally detecting the nature of the mixing model in the proposed approach. Globally, the proposed approach yields good spatial and spectral fidelities for the multi-sharpened data and significantly outperforms the used literature methods.

  6. Securing Digital Audio using Complex Quadratic Map

    Science.gov (United States)

    Suryadi, MT; Satria Gunawan, Tjandra; Satria, Yudi

    2018-03-01

    In This digital era, exchanging data are common and easy to do, therefore it is vulnerable to be attacked and manipulated from unauthorized parties. One data type that is vulnerable to attack is digital audio. So, we need data securing method that is not vulnerable and fast. One of the methods that match all of those criteria is securing the data using chaos function. Chaos function that is used in this research is complex quadratic map (CQM). There are some parameter value that causing the key stream that is generated by CQM function to pass all 15 NIST test, this means that the key stream that is generated using this CQM is proven to be random. In addition, samples of encrypted digital sound when tested using goodness of fit test are proven to be uniform, so securing digital audio using this method is not vulnerable to frequency analysis attack. The key space is very huge about 8.1×l031 possible keys and the key sensitivity is very small about 10-10, therefore this method is also not vulnerable against brute-force attack. And finally, the processing speed for both encryption and decryption process on average about 450 times faster that its digital audio duration.

  7. Quadratic rational rotations of the torus and dual lattice maps

    CERN Document Server

    Kouptsov, K L; Vivaldi, F

    2002-01-01

    We develop a general formalism for computed-assisted proofs concerning the orbit structure of certain non ergodic piecewise affine maps of the torus, whose eigenvalues are roots of unity. For a specific class of maps, we prove that if the trace is a quadratic irrational (the simplest nontrivial case, comprising 8 maps), then the periodic orbits are organized into finitely many renormalizable families, with exponentially increasing period, plus a finite number of exceptional families. The proof is based on exact computations with algebraic numbers, where units play the role of scaling parameters. Exploiting a duality existing between these maps and lattice maps representing rounded-off planar rotations, we establish the global periodicity of the latter systems, for a set of orbits of full density.

  8. Perron–Frobenius theorem for nonnegative multilinear forms and extensions

    OpenAIRE

    Friedland, S.; Gaubert, S.; Han, L.

    2013-01-01

    We prove an analog of Perron-Frobenius theorem for multilinear forms with nonnegative coefficients, and more generally, for polynomial maps with nonnegative coefficients. We determine the geometric convergence rate of the power algorithm to the unique normalized eigenvector.

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

    Science.gov (United States)

    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

  10. Fixed points for alpha-psi contractive mappings with an application to quadratic integral equations

    Directory of Open Access Journals (Sweden)

    Bessem Samet

    2014-06-01

    Full Text Available Recently, Samet et al [24] introduced the concept of alpha-psi contractive mappings and studied the existence of fixed points for such mappings. In this article, we prove three fixed point theorems for this class of operators in complete metric spaces. Our results extend the results in [24] and well known fixed point theorems due to Banach, Kannan, Chatterjea, Zamfirescu, Berinde, Suzuki, Ciric, Nieto, Lopez, and many others. We prove that alpha-psi contractions unify large classes of contractive type operators, whose fixed points can be obtained by means of the Picard iteration. Finally, we utilize our results to discuss the existence and uniqueness of solutions to a class of quadratic integral equations.

  11. Linear quadratic optimization for positive LTI system

    Science.gov (United States)

    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.

  12. Mapping the absolute magnetic field and evaluating the quadratic Zeeman-effect-induced systematic error in an atom interferometer gravimeter

    Science.gov (United States)

    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.

  13. Non-Archimedean Hyers-Ulam Stability of an Additive-Quadratic Mapping

    Directory of Open Access Journals (Sweden)

    Hassan Azadi Kenary

    2012-01-01

    Full Text Available Using fixed point method and direct method, we prove the Hyers-Ulam stability of the following additive-quadratic functional equation 2((++/+2((−+/+2((+−/+2((−++/=4(+4(+4(, where is a positive real number, in non-Archimedean normed spaces.

  14. A model for the parabolic slices Per1(e2πip/q) in moduli space of quadratic rational maps

    DEFF Research Database (Denmark)

    Uhre, Eva

    2010-01-01

    The notion of relatedness loci in the parabolic slices Per1(e2πip/q) in moduli space of quadratic rational maps is introduced. They are counterparts of the disconnectedness or escape locus in the slice of quadratic polynomials. A model for these loci is presented, and a strategy of proof of the f......The notion of relatedness loci in the parabolic slices Per1(e2πip/q) in moduli space of quadratic rational maps is introduced. They are counterparts of the disconnectedness or escape locus in the slice of quadratic polynomials. A model for these loci is presented, and a strategy of proof...... of the faithfulness of the model is given....

  15. Rainfall induced landslide susceptibility mapping using weight-of-evidence, linear and quadratic discriminant and logistic model tree method

    Science.gov (United States)

    Hong, H.; Zhu, A. X.

    2017-12-01

    Climate change is a common phenomenon and it is very serious all over the world. The intensification of rainfall extremes with climate change is of key importance to society and then it may induce a large impact through landslides. This paper presents GIS-based new ensemble data mining techniques that weight-of-evidence, logistic model tree, linear and quadratic discriminant for landslide spatial modelling. This research was applied in Anfu County, which is a landslide-prone area in Jiangxi Province, China. According to a literature review and research the study area, we select the landslide influencing factor and their maps were digitized in a GIS environment. These landslide influencing factors are the altitude, plan curvature, profile curvature, slope degree, slope aspect, topographic wetness index (TWI), Stream Power Index (SPI), Topographic Wetness Index (SPI), distance to faults, distance to rivers, distance to roads, soil, lithology, normalized difference vegetation index and land use. According to historical information of individual landslide events, interpretation of the aerial photographs, and field surveys supported by the government of Jiangxi Meteorological Bureau of China, 367 landslides were identified in the study area. The landslide locations were divided into two subsets, namely, training and validating (70/30), based on a random selection scheme. In this research, Pearson's correlation was used for the evaluation of the relationship between the landslides and influencing factors. In the next step, three data mining techniques combined with the weight-of-evidence, logistic model tree, linear and quadratic discriminant, were used for the landslide spatial modelling and its zonation. Finally, the landslide susceptibility maps produced by the mentioned models were evaluated by the ROC curve. The results showed that the area under the curve (AUC) of all of the models was > 0.80. At the same time, the highest AUC value was for the linear and quadratic

  16. Nonnegativity of uncertain polynomials

    Directory of Open Access Journals (Sweden)

    Šiljak Dragoslav D.

    1998-01-01

    Full Text Available The purpose of this paper is to derive tests for robust nonnegativity of scalar and matrix polynomials, which are algebraic, recursive, and can be completed in finite number of steps. Polytopic families of polynomials are considered with various characterizations of parameter uncertainty including affine, multilinear, and polynomic structures. The zero exclusion condition for polynomial positivity is also proposed for general parameter dependencies. By reformulating the robust stability problem of complex polynomials as positivity of real polynomials, we obtain new sufficient conditions for robust stability involving multilinear structures, which can be tested using only real arithmetic. The obtained results are applied to robust matrix factorization, strict positive realness, and absolute stability of multivariable systems involving parameter dependent transfer function matrices.

  17. Quadratic Damping

    Science.gov (United States)

    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…

  18. Elastic Model Transitions: a Hybrid Approach Utilizing Quadratic Inequality Constrained Least Squares (LSQI) and Direct Shape Mapping (DSM)

    Science.gov (United States)

    Jurenko, Robert J.; Bush, T. Jason; Ottander, John A.

    2014-01-01

    A method for transitioning linear time invariant (LTI) models in time varying simulation is proposed that utilizes both quadratically constrained least squares (LSQI) and Direct Shape Mapping (DSM) algorithms to determine physical displacements. This approach is applicable to the simulation of the elastic behavior of launch vehicles and other structures that utilize multiple LTI finite element model (FEM) derived mode sets that are propagated throughout time. The time invariant nature of the elastic data for discrete segments of the launch vehicle trajectory presents a problem of how to properly transition between models while preserving motion across the transition. In addition, energy may vary between flex models when using a truncated mode set. The LSQI-DSM algorithm can accommodate significant changes in energy between FEM models and carries elastic motion across FEM model transitions. Compared with previous approaches, the LSQI-DSM algorithm shows improvements ranging from a significant reduction to a complete removal of transients across FEM model transitions as well as maintaining elastic motion from the prior state.

  19. Quadratic algebras

    CERN Document Server

    Polishchuk, Alexander

    2005-01-01

    Quadratic algebras, i.e., algebras defined by quadratic relations, often occur in various areas of mathematics. One of the main problems in the study of these (and similarly defined) algebras is how to control their size. A central notion in solving this problem is the notion of a Koszul algebra, which was introduced in 1970 by S. Priddy and then appeared in many areas of mathematics, such as algebraic geometry, representation theory, noncommutative geometry, K-theory, number theory, and noncommutative linear algebra. The book offers a coherent exposition of the theory of quadratic and Koszul algebras, including various definitions of Koszulness, duality theory, Poincar�-Birkhoff-Witt-type theorems for Koszul algebras, and the Koszul deformation principle. In the concluding chapter of the book, they explain a surprising connection between Koszul algebras and one-dependent discrete-time stochastic processes.

  20. Convex nonnegative matrix factorization with manifold regularization.

    Science.gov (United States)

    Hu, Wenjun; Choi, Kup-Sze; Wang, Peiliang; Jiang, Yunliang; Wang, Shitong

    2015-03-01

    Nonnegative Matrix Factorization (NMF) has been extensively applied in many areas, including computer vision, pattern recognition, text mining, and signal processing. However, nonnegative entries are usually required for the data matrix in NMF, which limits its application. Besides, while the basis and encoding vectors obtained by NMF can represent the original data in low dimension, the representations do not always reflect the intrinsic geometric structure embedded in the data. Motivated by manifold learning and Convex NMF (CNMF), we propose a novel matrix factorization method called Graph Regularized and Convex Nonnegative Matrix Factorization (GCNMF) by introducing a graph regularized term into CNMF. The proposed matrix factorization technique not only inherits the intrinsic low-dimensional manifold structure, but also allows the processing of mixed-sign data matrix. Clustering experiments on nonnegative and mixed-sign real-world data sets are conducted to demonstrate the effectiveness of the proposed method. Copyright © 2014 Elsevier Ltd. All rights reserved.

  1. Linear quadratic Gaussian balancing for discrete-time infinite-dimensional linear systems

    NARCIS (Netherlands)

    Opmeer, MR; Curtain, RF

    2004-01-01

    In this paper, we study the existence of linear quadratic Gaussian (LQG)-balanced realizations for discrete-time infinite-dimensional systems. LQG-balanced realizations are those for which the smallest nonnegative self-adjoint solutions of the control and filter Riccati equations are equal. We show

  2. Optimal Quadratic Programming Algorithms

    CERN Document Server

    Dostal, Zdenek

    2009-01-01

    Quadratic programming (QP) is one technique that allows for the optimization of a quadratic function in several variables in the presence of linear constraints. This title presents various algorithms for solving large QP problems. It is suitable as an introductory text on quadratic programming for graduate students and researchers

  3. Self-Replicating Quadratics

    Science.gov (United States)

    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…

  4. Bidirectional Nonnegative Deep Model and Its Optimization in Learning

    OpenAIRE

    Xianhua Zeng; Zhengyi He; Hong Yu; Shengwei Qu

    2016-01-01

    Nonnegative matrix factorization (NMF) has been successfully applied in signal processing as a simple two-layer nonnegative neural network. Projective NMF (PNMF) with fewer parameters was proposed, which projects a high-dimensional nonnegative data onto a lower-dimensional nonnegative subspace. Although PNMF overcomes the problem of out-of-sample of NMF, it does not consider the nonlinear characteristic of data and is only a kind of narrow signal decomposition method. In this paper, we combin...

  5. On affine non-negative matrix factorization

    DEFF Research Database (Denmark)

    Laurberg, Hans; Hansen, Lars Kai

    2007-01-01

    We generalize the non-negative matrix factorization (NMF) generative model to incorporate an explicit offset. Multiplicative estimation algorithms are provided for the resulting sparse affine NMF model. We show that the affine model has improved uniqueness properties and leads to more accurate id...

  6. Enforced Sparse Non-Negative Matrix Factorization

    Science.gov (United States)

    2016-01-23

    proposals quotas opec legislation revenue england ico iraq vote passenger yen producer iranian surplus Figure 4. Example NMF with and without sparsity...preprint arXiv:1007.0380, 2010. [22] A. Cichocki and P. Anh-Huy, “Fast local algorithms for large scale nonnegative matrix and tensor factorizations

  7. Max–min distance nonnegative matrix factorization

    KAUST Repository

    Wang, Jim Jing-Yan; Gao, Xin

    2014-01-01

    Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problems. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basis matrix and a nonnegative coefficient matrix. The columns of the coefficient matrix can be used as new representations of these data samples. However, traditional NMF methods ignore class labels of the data samples. In this paper, we propose a novel supervised NMF algorithm to improve the discriminative ability of the new representation by using the class labels. Using the class labels, we separate all the data sample pairs into within-class pairs and between-class pairs. To improve the discriminative ability of the new NMF representations, we propose to minimize the maximum distance of the within-class pairs in the new NMF space, and meanwhile to maximize the minimum distance of the between-class pairs. With this criterion, we construct an objective function and optimize it with regard to basis and coefficient matrices, and slack variables alternatively, resulting in an iterative algorithm. The proposed algorithm is evaluated on three pattern classification problems and experiment results show that it outperforms the state-of-the-art supervised NMF methods.

  8. Shifted Non-negative Matrix Factorization

    DEFF Research Database (Denmark)

    Mørup, Morten; Madsen, Kristoffer Hougaard; Hansen, Lars Kai

    2007-01-01

    Non-negative matrix factorization (NMF) has become a widely used blind source separation technique due to its part based representation and ease of interpretability. We currently extend the NMF model to allow for delays between sources and sensors. This is a natural extension for spectrometry data...

  9. When to call a linear system nonnegative

    NARCIS (Netherlands)

    Nieuwenhuis, J.W.

    1998-01-01

    In this paper we will consider discrete time invariant linear systems that allow for an input-state-output representation with a finite dimensional state space, and that have a finite number of inputs and outputs. The basic issue in this paper is when to call these systems nonnegative. An important

  10. Max–min distance nonnegative matrix factorization

    KAUST Repository

    Wang, Jim Jing-Yan

    2014-10-26

    Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problems. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basis matrix and a nonnegative coefficient matrix. The columns of the coefficient matrix can be used as new representations of these data samples. However, traditional NMF methods ignore class labels of the data samples. In this paper, we propose a novel supervised NMF algorithm to improve the discriminative ability of the new representation by using the class labels. Using the class labels, we separate all the data sample pairs into within-class pairs and between-class pairs. To improve the discriminative ability of the new NMF representations, we propose to minimize the maximum distance of the within-class pairs in the new NMF space, and meanwhile to maximize the minimum distance of the between-class pairs. With this criterion, we construct an objective function and optimize it with regard to basis and coefficient matrices, and slack variables alternatively, resulting in an iterative algorithm. The proposed algorithm is evaluated on three pattern classification problems and experiment results show that it outperforms the state-of-the-art supervised NMF methods.

  11. Nonnegative Matrix Factorizations Performing Object Detection and Localization

    Directory of Open Access Journals (Sweden)

    G. Casalino

    2012-01-01

    Full Text Available We study the problem of detecting and localizing objects in still, gray-scale images making use of the part-based representation provided by nonnegative matrix factorizations. Nonnegative matrix factorization represents an emerging example of subspace methods, which is able to extract interpretable parts from a set of template image objects and then to additively use them for describing individual objects. In this paper, we present a prototype system based on some nonnegative factorization algorithms, which differ in the additional properties added to the nonnegative representation of data, in order to investigate if any additional constraint produces better results in general object detection via nonnegative matrix factorizations.

  12. Ligand-based virtual screening and in silico design of new antimalarial compounds using nonstochastic and stochastic total and atom-type quadratic maps.

    Science.gov (United States)

    Marrero-Ponce, Yovani; Iyarreta-Veitía, Maité; Montero-Torres, Alina; Romero-Zaldivar, Carlos; Brandt, Carlos A; Avila, Priscilla E; Kirchgatter, Karin; Machado, Yanetsy

    2005-01-01

    and stochastic atom-based quadratic fingerprints were 93.93% and 92.77%, respectively. The quadratic maps-based TOMOCOMD-CARDD approach implemented in this work was successfully compared with four of the most useful models for antimalarials selection reported to date. The developed models were then used in a simulation of a virtual search for Ras FTase (FTase = farnesyltransferase) inhibitors with antimalarial activity; 70% and 100% of the 10 inhibitors used in this virtual search were correctly classified, showing the ability of the models to identify new lead antimalarials. Finally, these two QSAR models were used in the identification of previously unknown antimalarials. In this sense, three synthetic intermediaries of quinolinic compounds were evaluated as active/inactive ones using the developed models. The synthesis and biological evaluation of these chemicals against two malaria strains, using chloroquine as a reference, was performed. An accuracy of 100% with the theoretical predictions was observed. Compound 3 showed antimalarial activity, being the first report of an arylaminomethylenemalonate having such behavior. This result opens a door to a virtual study considering a higher variability of the structural core already evaluated, as well as of other chemicals not included in this study. We conclude that the approach described here seems to be a promising QSAR tool for the molecular discovery of novel classes of antimalarial drugs, which may meet the dual challenges posed by drug-resistant parasites and the rapid progression of malaria illnesses.

  13. Bidirectional Nonnegative Deep Model and Its Optimization in Learning

    Directory of Open Access Journals (Sweden)

    Xianhua Zeng

    2016-01-01

    Full Text Available Nonnegative matrix factorization (NMF has been successfully applied in signal processing as a simple two-layer nonnegative neural network. Projective NMF (PNMF with fewer parameters was proposed, which projects a high-dimensional nonnegative data onto a lower-dimensional nonnegative subspace. Although PNMF overcomes the problem of out-of-sample of NMF, it does not consider the nonlinear characteristic of data and is only a kind of narrow signal decomposition method. In this paper, we combine the PNMF with deep learning and nonlinear fitting to propose a bidirectional nonnegative deep learning (BNDL model and its optimization learning algorithm, which can obtain nonlinear multilayer deep nonnegative feature representation. Experiments show that the proposed model can not only solve the problem of out-of-sample of NMF but also learn hierarchical nonnegative feature representations with better clustering performance than classical NMF, PNMF, and Deep Semi-NMF algorithms.

  14. Non-negative Matrix Factorization for Binary Data

    DEFF Research Database (Denmark)

    Larsen, Jacob Søgaard; Clemmensen, Line Katrine Harder

    We propose the Logistic Non-negative Matrix Factorization for decomposition of binary data. Binary data are frequently generated in e.g. text analysis, sensory data, market basket data etc. A common method for analysing non-negative data is the Non-negative Matrix Factorization, though...... this is in theory not appropriate for binary data, and thus we propose a novel Non-negative Matrix Factorization based on the logistic link function. Furthermore we generalize the method to handle missing data. The formulation of the method is compared to a previously proposed method (Tome et al., 2015). We compare...... the performance of the Logistic Non-negative Matrix Factorization to Least Squares Non-negative Matrix Factorization and Kullback-Leibler (KL) Non-negative Matrix Factorization on sets of binary data: a synthetic dataset, a set of student comments on their professors collected in a binary term-document matrix...

  15. Gravitation and quadratic forms

    International Nuclear Information System (INIS)

    Ananth, Sudarshan; Brink, Lars; Majumdar, Sucheta; Mali, Mahendra; Shah, Nabha

    2017-01-01

    The light-cone Hamiltonians describing both pure (N=0) Yang-Mills and N=4 super Yang-Mills may be expressed as quadratic forms. Here, we show that this feature extends to theories of gravity. We demonstrate how the Hamiltonians of both pure gravity and N=8 supergravity, in four dimensions, may be written as quadratic forms. We examine the effect of residual reparametrizations on the Hamiltonian and the resulting quadratic form.

  16. Gravitation and quadratic forms

    Energy Technology Data Exchange (ETDEWEB)

    Ananth, Sudarshan [Indian Institute of Science Education and Research,Pune 411008 (India); Brink, Lars [Department of Physics, Chalmers University of Technology,S-41296 Göteborg (Sweden); Institute of Advanced Studies and Department of Physics & Applied Physics,Nanyang Technological University,Singapore 637371 (Singapore); Majumdar, Sucheta [Indian Institute of Science Education and Research,Pune 411008 (India); Mali, Mahendra [School of Physics, Indian Institute of Science Education and Research,Thiruvananthapuram, Trivandrum 695016 (India); Shah, Nabha [Indian Institute of Science Education and Research,Pune 411008 (India)

    2017-03-31

    The light-cone Hamiltonians describing both pure (N=0) Yang-Mills and N=4 super Yang-Mills may be expressed as quadratic forms. Here, we show that this feature extends to theories of gravity. We demonstrate how the Hamiltonians of both pure gravity and N=8 supergravity, in four dimensions, may be written as quadratic forms. We examine the effect of residual reparametrizations on the Hamiltonian and the resulting quadratic form.

  17. Faithfully quadratic rings

    CERN Document Server

    Dickmann, M

    2015-01-01

    In this monograph the authors extend the classical algebraic theory of quadratic forms over fields to diagonal quadratic forms with invertible entries over broad classes of commutative, unitary rings where -1 is not a sum of squares and 2 is invertible. They accomplish this by: (1) Extending the classical notion of matrix isometry of forms to a suitable notion of T-isometry, where T is a preorder of the given ring, A, or T = A^2. (2) Introducing in this context three axioms expressing simple properties of (value) representation of elements of the ring by quadratic forms, well-known to hold in

  18. Rescuing Quadratic Inflation

    CERN Document Server

    Ellis, John; Sueiro, Maria

    2014-01-01

    Inflationary models based on a single scalar field $\\phi$ with a quadratic potential $V = \\frac{1}{2} m^2 \\phi^2$ are disfavoured by the recent Planck constraints on the scalar index, $n_s$, and the tensor-to-scalar ratio for cosmological density perturbations, $r_T$. In this paper we study how such a quadratic inflationary model can be rescued by postulating additional fields with quadratic potentials, such as might occur in sneutrino models, which might serve as either curvatons or supplementary inflatons. Introducing a second scalar field reduces but does not remove the pressure on quadratic inflation, but we find a sample of three-field models that are highly compatible with the Planck data on $n_s$ and $r_T$. We exhibit a specific three-sneutrino example that is also compatible with the data on neutrino mass difference and mixing angles.

  19. Separable quadratic stochastic operators

    International Nuclear Information System (INIS)

    Rozikov, U.A.; Nazir, S.

    2009-04-01

    We consider quadratic stochastic operators, which are separable as a product of two linear operators. Depending on properties of these linear operators we classify the set of the separable quadratic stochastic operators: first class of constant operators, second class of linear and third class of nonlinear (separable) quadratic stochastic operators. Since the properties of operators from the first and second classes are well known, we mainly study the properties of the operators of the third class. We describe some Lyapunov functions of the operators and apply them to study ω-limit sets of the trajectories generated by the operators. We also compare our results with known results of the theory of quadratic operators and give some open problems. (author)

  20. Extremal extensions for the sum of nonnegative selfadjoint relations

    NARCIS (Netherlands)

    Hassi, Seppo; Sandovici, Adrian; De Snoo, Henk; Winkler, Henrik

    2007-01-01

    The sum A + B of two nonnegative selfadjoint relations (multivalued operators) A and B is a nonnegative relation. The class of all extremal extensions of the sum A + B is characterized as products of relations via an auxiliary Hilbert space associated with A and B. The so-called form sum extension

  1. The Perron-Frobenius theorem for multi-homogeneous mappings

    OpenAIRE

    Gautier, Antoine; Tudisco, Francesco; Hein, Matthias

    2018-01-01

    The Perron-Frobenius theory for nonnegative matrices has been generalized to order-preserving homogeneous mappings on a cone and more recently to nonnegative multilinear forms. We unify both approaches by introducing the concept of order-preserving multi-homogeneous mappings, their associated nonlinear spectral problems and spectral radii. We show several Perron-Frobenius type results for these mappings addressing existence, uniqueness and maximality of nonnegative and positive eigenpairs. We...

  2. How quantum are non-negative wavefunctions?

    International Nuclear Information System (INIS)

    Hastings, M. B.

    2016-01-01

    We consider wavefunctions which are non-negative in some tensor product basis. We study what possible teleportation can occur in such wavefunctions, giving a complete answer in some cases (when one system is a qubit) and partial answers elsewhere. We use this to show that a one-dimensional wavefunction which is non-negative and has zero correlation length can be written in a “coherent Gibbs state” form, as explained later. We conjecture that such holds in higher dimensions. Additionally, some results are provided on possible teleportation in general wavefunctions, explaining how Schmidt coefficients before measurement limit the possible Schmidt coefficients after measurement, and on the absence of a “generalized area law” [D. Aharonov et al., in Proceedings of Foundations of Computer Science (FOCS) (IEEE, 2014), p. 246; e-print arXiv.org:1410.0951] even for Hamiltonians with no sign problem. One of the motivations for this work is an attempt to prove a conjecture about ground state wavefunctions which have an “intrinsic” sign problem that cannot be removed by any quantum circuit. We show a weaker version of this, showing that the sign problem is intrinsic for commuting Hamiltonians in the same phase as the double semion model under the technical assumption that TQO-2 holds [S. Bravyi et al., J. Math. Phys. 51, 093512 (2010)

  3. How quantum are non-negative wavefunctions?

    Energy Technology Data Exchange (ETDEWEB)

    Hastings, M. B. [Station Q, Microsoft Research, Santa Barbara, California 93106-6105, USA and Quantum Architectures and Computation Group, Microsoft Research, Redmond, Washington 98052 (United States)

    2016-01-15

    We consider wavefunctions which are non-negative in some tensor product basis. We study what possible teleportation can occur in such wavefunctions, giving a complete answer in some cases (when one system is a qubit) and partial answers elsewhere. We use this to show that a one-dimensional wavefunction which is non-negative and has zero correlation length can be written in a “coherent Gibbs state” form, as explained later. We conjecture that such holds in higher dimensions. Additionally, some results are provided on possible teleportation in general wavefunctions, explaining how Schmidt coefficients before measurement limit the possible Schmidt coefficients after measurement, and on the absence of a “generalized area law” [D. Aharonov et al., in Proceedings of Foundations of Computer Science (FOCS) (IEEE, 2014), p. 246; e-print arXiv.org:1410.0951] even for Hamiltonians with no sign problem. One of the motivations for this work is an attempt to prove a conjecture about ground state wavefunctions which have an “intrinsic” sign problem that cannot be removed by any quantum circuit. We show a weaker version of this, showing that the sign problem is intrinsic for commuting Hamiltonians in the same phase as the double semion model under the technical assumption that TQO-2 holds [S. Bravyi et al., J. Math. Phys. 51, 093512 (2010)].

  4. Incremental Nonnegative Matrix Factorization for Face Recognition

    Directory of Open Access Journals (Sweden)

    Wen-Sheng Chen

    2008-01-01

    Full Text Available Nonnegative matrix factorization (NMF is a promising approach for local feature extraction in face recognition tasks. However, there are two major drawbacks in almost all existing NMF-based methods. One shortcoming is that the computational cost is expensive for large matrix decomposition. The other is that it must conduct repetitive learning, when the training samples or classes are updated. To overcome these two limitations, this paper proposes a novel incremental nonnegative matrix factorization (INMF for face representation and recognition. The proposed INMF approach is based on a novel constraint criterion and our previous block strategy. It thus has some good properties, such as low computational complexity, sparse coefficient matrix. Also, the coefficient column vectors between different classes are orthogonal. In particular, it can be applied to incremental learning. Two face databases, namely FERET and CMU PIE face databases, are selected for evaluation. Compared with PCA and some state-of-the-art NMF-based methods, our INMF approach gives the best performance.

  5. On Convex Quadratic Approximation

    NARCIS (Netherlands)

    den Hertog, D.; de Klerk, E.; Roos, J.

    2000-01-01

    In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of

  6. Aspects of Quadratic Gravity

    CERN Document Server

    Alvarez-Gaume, Luis; Kounnas, Costas; Lust, Dieter; Riotto, Antonio

    2016-01-01

    We discuss quadratic gravity where terms quadratic in the curvature tensor are included in the action. After reviewing the corresponding field equations, we analyze in detail the physical propagating modes in some specific backgrounds. First we confirm that the pure $R^2$ theory is indeed ghost free. Then we point out that for flat backgrounds the pure $R^2$ theory propagates only a scalar massless mode and no spin-two tensor mode. However, the latter emerges either by expanding the theory around curved backgrounds like de Sitter or anti-de Sitter, or by changing the long-distance dynamics by introducing the standard Einstein term. In both cases, the theory is modified in the infrared and a propagating graviton is recovered. Hence we recognize a subtle interplay between the UV and IR properties of higher order gravity. We also calculate the corresponding Newton's law for general quadratic curvature theories. Finally, we discuss how quadratic actions may be obtained from a fundamental theory like string- or M-...

  7. A Quadratic Spring Equation

    Science.gov (United States)

    Fay, Temple H.

    2010-01-01

    Through numerical investigations, we study examples of the forced quadratic spring equation [image omitted]. By performing trial-and-error numerical experiments, we demonstrate the existence of stability boundaries in the phase plane indicating initial conditions yielding bounded solutions, investigate the resonance boundary in the [omega]…

  8. Projective-Dual Method for Solving Systems of Linear Equations with Nonnegative Variables

    Science.gov (United States)

    Ganin, B. V.; Golikov, A. I.; Evtushenko, Yu. G.

    2018-02-01

    In order to solve an underdetermined system of linear equations with nonnegative variables, the projection of a given point onto its solutions set is sought. The dual of this problem—the problem of unconstrained maximization of a piecewise-quadratic function—is solved by Newton's method. The problem of unconstrained optimization dual of the regularized problem of finding the projection onto the solution set of the system is considered. A connection of duality theory and Newton's method with some known algorithms of projecting onto a standard simplex is shown. On the example of taking into account the specifics of the constraints of the transport linear programming problem, the possibility to increase the efficiency of calculating the generalized Hessian matrix is demonstrated. Some examples of numerical calculations using MATLAB are presented.

  9. Hidden conic quadratic representation of some nonconvex quadratic optimization problems

    NARCIS (Netherlands)

    Ben-Tal, A.; den Hertog, D.

    The problem of minimizing a quadratic objective function subject to one or two quadratic constraints is known to have a hidden convexity property, even when the quadratic forms are indefinite. The equivalent convex problem is a semidefinite one, and the equivalence is based on the celebrated

  10. Binary classification posed as a quadratically constrained quadratic ...

    Indian Academy of Sciences (India)

    Binary classification is posed as a quadratically constrained quadratic problem and solved using the proposed method. Each class in the binary classification problem is modeled as a multidimensional ellipsoid to forma quadratic constraint in the problem. Particle swarms help in determining the optimal hyperplane or ...

  11. Link Prediction via Convex Nonnegative Matrix Factorization on Multiscale Blocks

    Directory of Open Access Journals (Sweden)

    Enming Dong

    2014-01-01

    Full Text Available Low rank matrices approximations have been used in link prediction for networks, which are usually global optimal methods and lack of using the local information. The block structure is a significant local feature of matrices: entities in the same block have similar values, which implies that links are more likely to be found within dense blocks. We use this insight to give a probabilistic latent variable model for finding missing links by convex nonnegative matrix factorization with block detection. The experiments show that this method gives better prediction accuracy than original method alone. Different from the original low rank matrices approximations methods for link prediction, the sparseness of solutions is in accord with the sparse property for most real complex networks. Scaling to massive size network, we use the block information mapping matrices onto distributed architectures and give a divide-and-conquer prediction method. The experiments show that it gives better results than common neighbors method when the networks have a large number of missing links.

  12. Multiplicative algorithms for constrained non-negative matrix factorization

    KAUST Repository

    Peng, Chengbin; Wong, Kachun; Rockwood, Alyn; Zhang, Xiangliang; Jiang, Jinling; Keyes, David E.

    2012-01-01

    Non-negative matrix factorization (NMF) provides the advantage of parts-based data representation through additive only combinations. It has been widely adopted in areas like item recommending, text mining, data clustering, speech denoising, etc

  13. Quadratic Diophantine equations

    CERN Document Server

    Andreescu, Titu

    2015-01-01

    This monograph treats the classical theory of quadratic Diophantine equations and guides the reader through the last two decades of computational techniques and progress in the area. These new techniques combined with the latest increases in computational power shed new light on important open problems. The authors motivate the study of quadratic Diophantine equations with excellent examples, open problems, and applications. Moreover, the exposition aptly demonstrates many applications of results and techniques from the study of Pell-type equations to other problems in number theory. The book is intended for advanced undergraduate and graduate students as well as researchers. It challenges the reader to apply not only specific techniques and strategies, but also to employ methods and tools from other areas of mathematics, such as algebra and analysis.

  14. On Improving Convergence Rates for Nonnegative Kernel Density Estimators

    OpenAIRE

    Terrell, George R.; Scott, David W.

    1980-01-01

    To improve the rate of decrease of integrated mean square error for nonparametric kernel density estimators beyond $0(n^{-\\frac{4}{5}}),$ we must relax the constraint that the density estimate be a bonafide density function, that is, be nonnegative and integrate to one. All current methods for kernel (and orthogonal series) estimators relax the nonnegativity constraint. In this paper we show how to achieve similar improvement by relaxing the integral constraint only. This is important in appl...

  15. Isotropy of quadratic forms

    Indian Academy of Sciences (India)

    V. Suresh University Of Hyderabad Hyderabad

    2008-10-31

    Oct 31, 2008 ... We say that (a1,··· ,an) is a zero of the polynomial f if f (a1,··· ,an) = 0. One of the main problems in Mathematics is to determine whether the given polynomial has a (non-trivial) zero or not. For example, let us recall the Fermat's last theorem: V. Suresh University Of Hyderabad Hyderabad. Isotropy of quadratic ...

  16. Multiple graph regularized nonnegative matrix factorization

    KAUST Repository

    Wang, Jim Jing-Yan

    2013-10-01

    Non-negative matrix factorization (NMF) has been widely used as a data representation method based on components. To overcome the disadvantage of NMF in failing to consider the manifold structure of a data set, graph regularized NMF (GrNMF) has been proposed by Cai et al. by constructing an affinity graph and searching for a matrix factorization that respects graph structure. Selecting a graph model and its corresponding parameters is critical for this strategy. This process is usually carried out by cross-validation or discrete grid search, which are time consuming and prone to overfitting. In this paper, we propose a GrNMF, called MultiGrNMF, in which the intrinsic manifold is approximated by a linear combination of several graphs with different models and parameters inspired by ensemble manifold regularization. Factorization metrics and linear combination coefficients of graphs are determined simultaneously within a unified object function. They are alternately optimized in an iterative algorithm, thus resulting in a novel data representation algorithm. Extensive experiments on a protein subcellular localization task and an Alzheimer\\'s disease diagnosis task demonstrate the effectiveness of the proposed algorithm. © 2013 Elsevier Ltd. All rights reserved.

  17. Weighted nonnegative tensor factorization for atmospheric tomography reconstruction

    Science.gov (United States)

    Carmona-Ballester, David; Trujillo-Sevilla, Juan M.; Bonaque-González, Sergio; Gómez-Cárdenes, Óscar; Rodríguez-Ramos, José M.

    2018-06-01

    Context. Increasing the area on the sky over which atmospheric turbulences can be corrected is a matter of wide interest in astrophysics, especially when a new generation of extremely large telescopes (ELT) is to come in the near future. Aims: In this study we tested if a method for visual representation in three-dimensional displays, the weighted nonnegative tensor factorization (WNTF), is able to improve the quality of the atmospheric tomography (AT) reconstruction as compared to a more standardized method like a randomized Kaczmarz algorithm. Methods: A total of 1000 different atmospheres were simulated and recovered by both methods. Recovering was computed for two and three layers and for four different constellations of laser guiding stars (LGS). The goodness of both methods was tested by means of the radial average of the Strehl ratio across the field of view of a telescope of 8m diameter with a sky coverage of 97.8 arcsec. Results: The proposed method significantly outperformed the Kaczmarz in all tested cases (p ≤ 0.05). In WNTF, three-layers configuration provided better outcomes, but there was no clear relation between different LGS constellations and the quality of Strehl ratio maps. Conclusions: The WNTF method is a novel technique in astronomy and its use to recover atmospheric turbulence profiles was proposed and tested. It showed better quality of reconstruction than a conventional Kaczmarz algorithm independently of the number and height of recovered atmospheric layers and of the constellation of laser guide star used. The WNTF method was shown to be a useful tool in highly ill-posed AT problems, where the difficulty of classical algorithms produce high Strehl value maps.

  18. Quadratic spatial soliton interactions

    Science.gov (United States)

    Jankovic, Ladislav

    Quadratic spatial soliton interactions were investigated in this Dissertation. The first part deals with characterizing the principal features of multi-soliton generation and soliton self-reflection. The second deals with two beam processes leading to soliton interactions and collisions. These subjects were investigated both theoretically and experimentally. The experiments were performed by using potassium niobate (KNBO 3) and periodically poled potassium titanyl phosphate (KTP) crystals. These particular crystals were desirable for these experiments because of their large nonlinear coefficients and, more importantly, because the experiments could be performed under non-critical-phase-matching (NCPM) conditions. The single soliton generation measurements, performed on KNBO3 by launching the fundamental component only, showed a broad angular acceptance bandwidth which was important for the soliton collisions performed later. Furthermore, at high input intensities multi-soliton generation was observed for the first time. The influence on the multi-soliton patterns generated of the input intensity and beam symmetry was investigated. The combined experimental and theoretical efforts indicated that spatial and temporal noise on the input laser beam induced multi-soliton patterns. Another research direction pursued was intensity dependent soliton routing by using of a specially engineered quadratically nonlinear interface within a periodically poled KTP sample. This was the first time demonstration of the self-reflection phenomenon in a system with a quadratic nonlinearity. The feature investigated is believed to have a great potential for soliton routing and manipulation by engineered structures. A detailed investigation was conducted on two soliton interaction and collision processes. Birth of an additional soliton resulting from a two soliton collision was observed and characterized for the special case of a non-planar geometry. A small amount of spiraling, up to 30

  19. Greedy Algorithms for Nonnegativity-Constrained Simultaneous Sparse Recovery

    Science.gov (United States)

    Kim, Daeun; Haldar, Justin P.

    2016-01-01

    This work proposes a family of greedy algorithms to jointly reconstruct a set of vectors that are (i) nonnegative and (ii) simultaneously sparse with a shared support set. The proposed algorithms generalize previous approaches that were designed to impose these constraints individually. Similar to previous greedy algorithms for sparse recovery, the proposed algorithms iteratively identify promising support indices. In contrast to previous approaches, the support index selection procedure has been adapted to prioritize indices that are consistent with both the nonnegativity and shared support constraints. Empirical results demonstrate for the first time that the combined use of simultaneous sparsity and nonnegativity constraints can substantially improve recovery performance relative to existing greedy algorithms that impose less signal structure. PMID:26973368

  20. Quadratic soliton self-reflection at a quadratically nonlinear interface

    Science.gov (United States)

    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.

  1. Comparative Study of Inference Methods for Bayesian Nonnegative Matrix Factorisation

    DEFF Research Database (Denmark)

    Brouwer, Thomas; Frellsen, Jes; Liò, Pietro

    2017-01-01

    In this paper, we study the trade-offs of different inference approaches for Bayesian matrix factorisation methods, which are commonly used for predicting missing values, and for finding patterns in the data. In particular, we consider Bayesian nonnegative variants of matrix factorisation and tri......-factorisation, and compare non-probabilistic inference, Gibbs sampling, variational Bayesian inference, and a maximum-a-posteriori approach. The variational approach is new for the Bayesian nonnegative models. We compare their convergence, and robustness to noise and sparsity of the data, on both synthetic and real...

  2. Quadratic brackets from symplectic forms

    International Nuclear Information System (INIS)

    Alekseev, Anton Yu.; Todorov, Ivan T.

    1994-01-01

    We give a physicist oriented survey of Poisson-Lie symmetries of classical systems. We consider finite-dimensional geometric actions and the chiral WZNW model as examples for the general construction. An essential point is the appearance of quadratic Poisson brackets for group-like variables. It is believed that upon quantization they lead to quadratic exchange algebras. ((orig.))

  3. Students' Understanding of Quadratic Equations

    Science.gov (United States)

    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…

  4. Data Reduction Algorithm Using Nonnegative Matrix Factorization with Nonlinear Constraints

    Science.gov (United States)

    Sembiring, Pasukat

    2017-12-01

    Processing ofdata with very large dimensions has been a hot topic in recent decades. Various techniques have been proposed in order to execute the desired information or structure. Non- Negative Matrix Factorization (NMF) based on non-negatives data has become one of the popular methods for shrinking dimensions. The main strength of this method is non-negative object, the object model by a combination of some basic non-negative parts, so as to provide a physical interpretation of the object construction. The NMF is a dimension reduction method thathasbeen used widely for numerous applications including computer vision,text mining, pattern recognitions,and bioinformatics. Mathematical formulation for NMF did not appear as a convex optimization problem and various types of algorithms have been proposed to solve the problem. The Framework of Alternative Nonnegative Least Square(ANLS) are the coordinates of the block formulation approaches that have been proven reliable theoretically and empirically efficient. This paper proposes a new algorithm to solve NMF problem based on the framework of ANLS.This algorithm inherits the convergenceproperty of the ANLS framework to nonlinear constraints NMF formulations.

  5. A non-negative Wigner-type distribution

    International Nuclear Information System (INIS)

    Cartwright, N.D.

    1976-01-01

    The Wigner function, which is commonly used as a joint distribution for non-commuting observables, is shown to be non-negative in all quantum states when smoothed with a gaussian whose variances are greater than or equal to those of the minimum uncertainty wave packet. (Auth.)

  6. On the nonnegative inverse eigenvalue problem of traditional matrices

    Directory of Open Access Journals (Sweden)

    Alimohammad Nazari

    2014-07-01

    Full Text Available In this paper, at first for a given set of real or complex numbers $\\sigma$ with nonnegativesummation, we introduce some special conditions that with them there is no nonnegativetridiagonal matrix in which $\\sigma$ is its spectrum. In continue we present some conditions forexistence such nonnegative tridiagonal matrices.

  7. On nonnegative solutions of second order linear functional differential equations

    Czech Academy of Sciences Publication Activity Database

    Lomtatidze, Alexander; Vodstrčil, Petr

    2004-01-01

    Roč. 32, č. 1 (2004), s. 59-88 ISSN 1512-0015 Institutional research plan: CEZ:AV0Z1019905 Keywords : second order linear functional differential equations * nonnegative solution * two-point boundary value problem Subject RIV: BA - General Mathematics

  8. A Sequential Quadratically Constrained Quadratic Programming Method of Feasible Directions

    International Nuclear Information System (INIS)

    Jian Jinbao; Hu Qingjie; Tang Chunming; Zheng Haiyan

    2007-01-01

    In this paper, a sequential quadratically constrained quadratic programming method of feasible directions is proposed for the optimization problems with nonlinear inequality constraints. At each iteration of the proposed algorithm, a feasible direction of descent is obtained by solving only one subproblem which consist of a convex quadratic objective function and simple quadratic inequality constraints without the second derivatives of the functions of the discussed problems, and such a subproblem can be formulated as a second-order cone programming which can be solved by interior point methods. To overcome the Maratos effect, an efficient higher-order correction direction is obtained by only one explicit computation formula. The algorithm is proved to be globally convergent and superlinearly convergent under some mild conditions without the strict complementarity. Finally, some preliminary numerical results are reported

  9. On Characterization of Quadratic Splines

    DEFF Research Database (Denmark)

    Chen, B. T.; Madsen, Kaj; Zhang, Shuzhong

    2005-01-01

    that the representation can be refined in a neighborhood of a non-degenerate point and a set of non-degenerate minimizers. Based on these characterizations, many existing algorithms for specific convex quadratic splines are also finite convergent for a general convex quadratic spline. Finally, we study the relationship...... between the convexity of a quadratic spline function and the monotonicity of the corresponding LCP problem. It is shown that, although both conditions lead to easy solvability of the problem, they are different in general....

  10. Note Onset Detection via Nonnegative Factorization of Magnitude Spectrum

    Directory of Open Access Journals (Sweden)

    Saeid Sanei

    2008-06-01

    Full Text Available A novel approach for onset detection of musical notes from audio signals is presented. In contrast to most commonly used conventional approaches, the proposed method features new detection functions constructed from the linear temporal bases that are obtained from the decomposition of musical spectra using nonnegative matrix factorization (NMF. Three forms of detection function, namely, first-order difference function, psychoacoustically motivated relative difference function, and constant-balanced relative difference function, are considered. As the approach works directly on input data, no prior knowledge or statistical information is therefore required. Practical issues, including the choice of the factorization rank and detection robustness to instruments, are also examined experimentally. Due to the scalability issue with the generated nonnegative matrix, the proposed method is only applied to relatively short, single instrument (or voice recordings. Numerical examples are provided to show the good performance of the proposed method, including comparisons between the three detection functions.

  11. Multiple Kernel Learning for adaptive graph regularized nonnegative matrix factorization

    KAUST Repository

    Wang, Jim Jing-Yan; AbdulJabbar, Mustafa Abdulmajeed

    2012-01-01

    Nonnegative Matrix Factorization (NMF) has been continuously evolving in several areas like pattern recognition and information retrieval methods. It factorizes a matrix into a product of 2 low-rank non-negative matrices that will define parts-based, and linear representation of non-negative data. Recently, Graph regularized NMF (GrNMF) is proposed to find a compact representation, which uncovers the hidden semantics and simultaneously respects the intrinsic geometric structure. In GNMF, an affinity graph is constructed from the original data space to encode the geometrical information. In this paper, we propose a novel idea which engages a Multiple Kernel Learning approach into refining the graph structure that reflects the factorization of the matrix and the new data space. The GrNMF is improved by utilizing the graph refined by the kernel learning, and then a novel kernel learning method is introduced under the GrNMF framework. Our approach shows encouraging results of the proposed algorithm in comparison to the state-of-the-art clustering algorithms like NMF, GrNMF, SVD etc.

  12. Stability in quadratic torsion theories

    Energy Technology Data Exchange (ETDEWEB)

    Vasilev, Teodor Borislavov; Cembranos, Jose A.R.; Gigante Valcarcel, Jorge; Martin-Moruno, Prado [Universidad Complutense de Madrid, Departamento de Fisica Teorica I, Madrid (Spain)

    2017-11-15

    We revisit the definition and some of the characteristics of quadratic theories of gravity with torsion. We start from a Lagrangian density quadratic in the curvature and torsion tensors. By assuming that General Relativity should be recovered when the torsion vanishes and investigating the behaviour of the vector and pseudo-vector torsion fields in the weak-gravity regime, we present a set of necessary conditions for the stability of these theories. Moreover, we explicitly obtain the gravitational field equations using the Palatini variational principle with the metricity condition implemented via a Lagrange multiplier. (orig.)

  13. Stability in quadratic torsion theories

    International Nuclear Information System (INIS)

    Vasilev, Teodor Borislavov; Cembranos, Jose A.R.; Gigante Valcarcel, Jorge; Martin-Moruno, Prado

    2017-01-01

    We revisit the definition and some of the characteristics of quadratic theories of gravity with torsion. We start from a Lagrangian density quadratic in the curvature and torsion tensors. By assuming that General Relativity should be recovered when the torsion vanishes and investigating the behaviour of the vector and pseudo-vector torsion fields in the weak-gravity regime, we present a set of necessary conditions for the stability of these theories. Moreover, we explicitly obtain the gravitational field equations using the Palatini variational principle with the metricity condition implemented via a Lagrange multiplier. (orig.)

  14. Quadratic prediction of factor scores

    NARCIS (Netherlands)

    Wansbeek, T

    1999-01-01

    Factor scores are naturally predicted by means of their conditional expectation given the indicators y. Under normality this expectation is linear in y but in general it is an unknown function of y. II is discussed that under nonnormality factor scores can be more precisely predicted by a quadratic

  15. On quadratic variation of martingales

    Indian Academy of Sciences (India)

    On quadratic variation of martingales. 459. The proof relied on the theory of stochastic integration. Subsequently, in Karandikar. [4], the formula was derived using only Doob's maximal inequality. Thus this could be the starting point for the development of stochastic calculus for continuous semimartingales without bringing in ...

  16. Impurity solitons with quadratic nonlinearities

    DEFF Research Database (Denmark)

    Clausen, Carl A. Balslev; Torres, Juan P-; Torner, Lluis

    1998-01-01

    We fmd families of solitary waves mediated by parametric mixing in quadratic nonlinear media that are localized at point-defect impurities. Solitons localized at attractive impurities are found to be dynamically stable. It is shown that localization at the impurity modifies strongly the soliton...

  17. Quadratic divergences and dimensional regularisation

    International Nuclear Information System (INIS)

    Jack, I.; Jones, D.R.T.

    1990-01-01

    We present a detailed analysis of quadratic and quartic divergences in dimensionally regulated renormalisable theories. We perform explicit three-loop calculations for a general theory of scalars and fermions. We find that the higher-order quartic divergences are related to the lower-order ones by the renormalisation group β-functions. (orig.)

  18. Wind Noise Reduction using Non-negative Sparse Coding

    DEFF Research Database (Denmark)

    Schmidt, Mikkel N.; Larsen, Jan; Hsiao, Fu-Tien

    2007-01-01

    We introduce a new speaker independent method for reducing wind noise in single-channel recordings of noisy speech. The method is based on non-negative sparse coding and relies on a wind noise dictionary which is estimated from an isolated noise recording. We estimate the parameters of the model ...... and discuss their sensitivity. We then compare the algorithm with the classical spectral subtraction method and the Qualcomm-ICSI-OGI noise reduction method. We optimize the sound quality in terms of signal-to-noise ratio and provide results on a noisy speech recognition task....

  19. Adaptive and neuroadaptive control for nonnegative and compartmental dynamical systems

    Science.gov (United States)

    Volyanskyy, Kostyantyn Y.

    Neural networks have been extensively used for adaptive system identification as well as adaptive and neuroadaptive control of highly uncertain systems. The goal of adaptive and neuroadaptive control is to achieve system performance without excessive reliance on system models. To improve robustness and the speed of adaptation of adaptive and neuroadaptive controllers several controller architectures have been proposed in the literature. In this dissertation, we develop a new neuroadaptive control architecture for nonlinear uncertain dynamical systems. The proposed framework involves a novel controller architecture with additional terms in the update laws that are constructed using a moving window of the integrated system uncertainty. These terms can be used to identify the ideal system weights of the neural network as well as effectively suppress system uncertainty. Linear and nonlinear parameterizations of the system uncertainty are considered and state and output feedback neuroadaptive controllers are developed. Furthermore, we extend the developed framework to discrete-time dynamical systems. To illustrate the efficacy of the proposed approach we apply our results to an aircraft model with wing rock dynamics, a spacecraft model with unknown moment of inertia, and an unmanned combat aerial vehicle undergoing actuator failures, and compare our results with standard neuroadaptive control methods. Nonnegative systems are essential in capturing the behavior of a wide range of dynamical systems involving dynamic states whose values are nonnegative. A sub-class of nonnegative dynamical systems are compartmental systems. These systems are derived from mass and energy balance considerations and are comprised of homogeneous interconnected microscopic subsystems or compartments which exchange variable quantities of material via intercompartmental flow laws. In this dissertation, we develop direct adaptive and neuroadaptive control framework for stabilization, disturbance

  20. Quadratic third-order tensor optimization problem with quadratic constraints

    Directory of Open Access Journals (Sweden)

    Lixing Yang

    2014-05-01

    Full Text Available Quadratically constrained quadratic programs (QQPs problems play an important modeling role for many diverse problems. These problems are in general NP hard and numerically intractable. Semidenite programming (SDP relaxations often provide good approximate solutions to these hard problems. For several special cases of QQP, e.g., convex programs and trust region subproblems, SDP relaxation provides the exact optimal value, i.e., there is a zero duality gap. However, this is not true for the general QQP, or even the QQP with two convex constraints, but a nonconvex objective.In this paper, we consider a certain QQP where the variable is neither vector nor matrix but a third-order tensor. This problem can be viewed as a generalization of the ordinary QQP with vector or matrix as it's variant. Under some mild conditions, we rst show that SDP relaxation provides exact optimal solutions for the original problem. Then we focus on two classes of homogeneous quadratic tensor programming problems which have no requirements on the constraints number. For one, we provide an easily implemental polynomial time algorithm to approximately solve the problem and discuss the approximation ratio. For the other, we show there is no gap between the SDP relaxation and itself.

  1. Identification of necessary and sufficient conditions for real non-negativeness of rational matrices

    International Nuclear Information System (INIS)

    Saeed, K.

    1982-12-01

    The necessary and sufficient conditions for real non-negativeness of rational matrices have been identified. A programmable algorithm is developed and is given with its computer flow chart. This algorithm can be used as a general solution to test the real non-negativeness of rational matrices. The computer program assures the feasibility of the suggested algorithm. (author)

  2. Exact solutions to quadratic gravity

    Czech Academy of Sciences Publication Activity Database

    Pravda, Vojtěch; Pravdová, Alena; Podolský, J.; Švarc, J.

    2017-01-01

    Roč. 95, č. 8 (2017), č. článku 084025. ISSN 2470-0010 R&D Projects: GA ČR GB14-37086G Institutional support: RVO:67985840 Keywords : quadratic gravity * exact solutions * Kundt spacetimes Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 4.568, year: 2016 https://journals.aps.org/prd/abstract/10.1103/PhysRevD.95.084025

  3. On Quadratic Variation of Martingales

    Indian Academy of Sciences (India)

    where D ( [ 0 , ∞ ) , R ) denotes the class of real valued r.c.l.l. functions on [ 0 , ∞ ) such that for a locally square integrable martingale ( M t ) with r.c.l.l. paths,. Ψ ( M . ( ) ) = A . ( ). gives the quadratic variation process (written usually as [ M , M ] t ) of ( M t ) . We also show that this process ( A t ) is the unique increasing ...

  4. Exact solutions to quadratic gravity

    Czech Academy of Sciences Publication Activity Database

    Pravda, Vojtěch; Pravdová, Alena; Podolský, J.; Švarc, J.

    2017-01-01

    Roč. 95, č. 8 (2017), č. článku 084025. ISSN 2470-0010 R&D Projects: GA ČR GB14-37086G Institutional support: RVO:67985840 Keywords : quadratic gravity * exact solutions * Kundt spacetimes Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 4.568, year: 2016 https://journals. aps .org/prd/abstract/10.1103/PhysRevD.95.084025

  5. A flexible R package for nonnegative matrix factorization

    Directory of Open Access Journals (Sweden)

    Seoighe Cathal

    2010-07-01

    Full Text Available Abstract Background Nonnegative Matrix Factorization (NMF is an unsupervised learning technique that has been applied successfully in several fields, including signal processing, face recognition and text mining. Recent applications of NMF in bioinformatics have demonstrated its ability to extract meaningful information from high-dimensional data such as gene expression microarrays. Developments in NMF theory and applications have resulted in a variety of algorithms and methods. However, most NMF implementations have been on commercial platforms, while those that are freely available typically require programming skills. This limits their use by the wider research community. Results Our objective is to provide the bioinformatics community with an open-source, easy-to-use and unified interface to standard NMF algorithms, as well as with a simple framework to help implement and test new NMF methods. For that purpose, we have developed a package for the R/BioConductor platform. The package ports public code to R, and is structured to enable users to easily modify and/or add algorithms. It includes a number of published NMF algorithms and initialization methods and facilitates the combination of these to produce new NMF strategies. Commonly used benchmark data and visualization methods are provided to help in the comparison and interpretation of the results. Conclusions The NMF package helps realize the potential of Nonnegative Matrix Factorization, especially in bioinformatics, providing easy access to methods that have already yielded new insights in many applications. Documentation, source code and sample data are available from CRAN.

  6. Nonnegative Matrix Factorization with Rank Regularization and Hard Constraint.

    Science.gov (United States)

    Shang, Ronghua; Liu, Chiyang; Meng, Yang; Jiao, Licheng; Stolkin, Rustam

    2017-09-01

    Nonnegative matrix factorization (NMF) is well known to be an effective tool for dimensionality reduction in problems involving big data. For this reason, it frequently appears in many areas of scientific and engineering literature. This letter proposes a novel semisupervised NMF algorithm for overcoming a variety of problems associated with NMF algorithms, including poor use of prior information, negative impact on manifold structure of the sparse constraint, and inaccurate graph construction. Our proposed algorithm, nonnegative matrix factorization with rank regularization and hard constraint (NMFRC), incorporates label information into data representation as a hard constraint, which makes full use of prior information. NMFRC also measures pairwise similarity according to geodesic distance rather than Euclidean distance. This results in more accurate measurement of pairwise relationships, resulting in more effective manifold information. Furthermore, NMFRC adopts rank constraint instead of norm constraints for regularization to balance the sparseness and smoothness of data. In this way, the new data representation is more representative and has better interpretability. Experiments on real data sets suggest that NMFRC outperforms four other state-of-the-art algorithms in terms of clustering accuracy.

  7. Orthogonality preserving infinite dimensional quadratic stochastic operators

    International Nuclear Information System (INIS)

    Akın, Hasan; Mukhamedov, Farrukh

    2015-01-01

    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

  8. Extending the Scope of Robust Quadratic Optimization

    NARCIS (Netherlands)

    Marandi, Ahmadreza; Ben-Tal, A.; den Hertog, Dick; Melenberg, Bertrand

    In this paper, we derive tractable reformulations of the robust counterparts of convex quadratic and conic quadratic constraints with concave uncertainties for a broad range of uncertainty sets. For quadratic constraints with convex uncertainty, it is well-known that the robust counterpart is, in

  9. Coherent states for quadratic Hamiltonians

    International Nuclear Information System (INIS)

    Contreras-Astorga, Alonso; Fernandez C, David J; Velazquez, Mercedes

    2011-01-01

    The coherent states for a set of quadratic Hamiltonians in the trap regime are constructed. A matrix technique which allows us to directly identify the creation and annihilation operators will be presented. Then, the coherent states as simultaneous eigenstates of the annihilation operators will be derived, and will be compared with those attained through the displacement operator method. The corresponding wavefunction will be found, and a general procedure for obtaining several mean values involving the canonical operators in these states will be described. The results will be illustrated through the asymmetric Penning trap.

  10. Quadratic Variation by Markov Chains

    DEFF Research Database (Denmark)

    Hansen, Peter Reinhard; Horel, Guillaume

    We introduce a novel estimator of the quadratic variation that is based on the the- ory of Markov chains. The estimator is motivated by some general results concerning filtering contaminated semimartingales. Specifically, we show that filtering can in prin- ciple remove the effects of market...... microstructure noise in a general framework where little is assumed about the noise. For the practical implementation, we adopt the dis- crete Markov chain model that is well suited for the analysis of financial high-frequency prices. The Markov chain framework facilitates simple expressions and elegant analyti...

  11. Factorization method of quadratic template

    Science.gov (United States)

    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.

  12. Optimal control linear quadratic methods

    CERN Document Server

    Anderson, Brian D O

    2007-01-01

    This augmented edition of a respected text teaches the reader how to use linear quadratic Gaussian methods effectively for the design of control systems. It explores linear optimal control theory from an engineering viewpoint, with step-by-step explanations that show clearly how to make practical use of the material.The three-part treatment begins with the basic theory of the linear regulator/tracker for time-invariant and time-varying systems. The Hamilton-Jacobi equation is introduced using the Principle of Optimality, and the infinite-time problem is considered. The second part outlines the

  13. Symmetric nonnegative matrix factorization: algorithms and applications to probabilistic clustering.

    Science.gov (United States)

    He, Zhaoshui; Xie, Shengli; Zdunek, Rafal; Zhou, Guoxu; Cichocki, Andrzej

    2011-12-01

    Nonnegative matrix factorization (NMF) is an unsupervised learning method useful in various applications including image processing and semantic analysis of documents. This paper focuses on symmetric NMF (SNMF), which is a special case of NMF decomposition. Three parallel multiplicative update algorithms using level 3 basic linear algebra subprograms directly are developed for this problem. First, by minimizing the Euclidean distance, a multiplicative update algorithm is proposed, and its convergence under mild conditions is proved. Based on it, we further propose another two fast parallel methods: α-SNMF and β -SNMF algorithms. All of them are easy to implement. These algorithms are applied to probabilistic clustering. We demonstrate their effectiveness for facial image clustering, document categorization, and pattern clustering in gene expression.

  14. Nonnegative least-squares image deblurring: improved gradient projection approaches

    Science.gov (United States)

    Benvenuto, F.; Zanella, R.; Zanni, L.; Bertero, M.

    2010-02-01

    The least-squares approach to image deblurring leads to an ill-posed problem. The addition of the nonnegativity constraint, when appropriate, does not provide regularization, even if, as far as we know, a thorough investigation of the ill-posedness of the resulting constrained least-squares problem has still to be done. Iterative methods, converging to nonnegative least-squares solutions, have been proposed. Some of them have the 'semi-convergence' property, i.e. early stopping of the iteration provides 'regularized' solutions. In this paper we consider two of these methods: the projected Landweber (PL) method and the iterative image space reconstruction algorithm (ISRA). Even if they work well in many instances, they are not frequently used in practice because, in general, they require a large number of iterations before providing a sensible solution. Therefore, the main purpose of this paper is to refresh these methods by increasing their efficiency. Starting from the remark that PL and ISRA require only the computation of the gradient of the functional, we propose the application to these algorithms of special acceleration techniques that have been recently developed in the area of the gradient methods. In particular, we propose the application of efficient step-length selection rules and line-search strategies. Moreover, remarking that ISRA is a scaled gradient algorithm, we evaluate its behaviour in comparison with a recent scaled gradient projection (SGP) method for image deblurring. Numerical experiments demonstrate that the accelerated methods still exhibit the semi-convergence property, with a considerable gain both in the number of iterations and in the computational time; in particular, SGP appears definitely the most efficient one.

  15. Quadratic reactivity fuel cycle model

    International Nuclear Information System (INIS)

    Lewins, J.D.

    1985-01-01

    For educational purposes it is highly desirable to provide simple yet realistic models for fuel cycle and fuel economy. In particular, a lumped model without recourse to detailed spatial calculations would be very helpful in providing the student with a proper understanding of the purposes of fuel cycle calculations. A teaching model for fuel cycle studies based on a lumped model assuming the summability of partial reactivities with a linear dependence of reactivity usefully illustrates fuel utilization concepts. The linear burnup model does not satisfactorily represent natural enrichment reactors. A better model, showing the trend of initial plutonium production before subsequent fuel burnup and fission product generation, is a quadratic fit. The study of M-batch cycles, reloading 1/Mth of the core at end of cycle, is now complicated by nonlinear equations. A complete account of the asymptotic cycle for any order of M-batch refueling can be given and compared with the linear model. A complete account of the transient cycle can be obtained readily in the two-batch model and this exact solution would be useful in verifying numerical marching models. It is convenient to treat the parabolic fit rho = 1 - tau 2 as a special case of the general quadratic fit rho = 1 - C/sub tau/ - (1 - C)tau 2 in suitably normalized reactivity and cycle time units. The parabolic results are given in this paper

  16. A max version of Perron--Frobenius theorem for nonnegative tensor

    OpenAIRE

    Afshin, Hamid Reza; Shojaeifard, Ali Reza

    2015-01-01

    In this paper we generalize the max algebra system of nonnegative matrices to the class of nonnegative tensors and derive its fundamental properties. If $\\mathbb{A} \\in \\Re_ + ^{\\left[ {m,n} \\right]}$ is a nonnegative essentially positive tensor such that satisfies the condition class NC, we prove that there exist $\\mu \\left( \\mathbb{A} \\right)$ and a corresponding positive vector $x$ such that $\\mathop {\\max }\\limits_{1 \\le{i_2}\\cdots {i_m} \\le n} \\left\\{ {{a_{i{i_2}\\cdots {i_m}}}{x_{{i_2}}}...

  17. Dynamical invariants for variable quadratic Hamiltonians

    International Nuclear Information System (INIS)

    Suslov, Sergei K

    2010-01-01

    We consider linear and quadratic integrals of motion for general variable quadratic Hamiltonians. Fundamental relations between the eigenvalue problem for linear dynamical invariants and solutions of the corresponding Cauchy initial value problem for the time-dependent Schroedinger equation are emphasized. An eigenfunction expansion of the solution of the initial value problem is also found. A nonlinear superposition principle for generalized Ermakov systems is established as a result of decomposition of the general quadratic invariant in terms of the linear ones.

  18. Quadratically convergent MCSCF scheme using Fock operators

    International Nuclear Information System (INIS)

    Das, G.

    1981-01-01

    A quadratically convergent formulation of the MCSCF method using Fock operators is presented. Among its advantages the present formulation is quadratically convergent unlike the earlier ones based on Fock operators. In contrast to other quadratically convergent schemes as well as the one based on generalized Brillouin's theorem, this method leads easily to a hybrid scheme where the weakly coupled orbitals (such as the core) are handled purely by Fock equations, while the rest of the orbitals are treated by a quadratically convergent approach with a truncated virtual space obtained by the use of the corresponding Fock equations

  19. Geometrical and Graphical Solutions of Quadratic Equations.

    Science.gov (United States)

    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)

  20. Multiobjective Optimization Involving Quadratic Functions

    Directory of Open Access Journals (Sweden)

    Oscar Brito Augusto

    2014-01-01

    Full Text Available Multiobjective optimization is nowadays a word of order in engineering projects. Although the idea involved is simple, the implementation of any procedure to solve a general problem is not an easy task. Evolutionary algorithms are widespread as a satisfactory technique to find a candidate set for the solution. Usually they supply a discrete picture of the Pareto front even if this front is continuous. In this paper we propose three methods for solving unconstrained multiobjective optimization problems involving quadratic functions. In the first, for biobjective optimization defined in the bidimensional space, a continuous Pareto set is found analytically. In the second, applicable to multiobjective optimization, a condition test is proposed to check if a point in the decision space is Pareto optimum or not and, in the third, with functions defined in n-dimensional space, a direct noniterative algorithm is proposed to find the Pareto set. Simple problems highlight the suitability of the proposed methods.

  1. Quadratic Lagrangians and Legendre transformation

    International Nuclear Information System (INIS)

    Magnano, G.

    1988-01-01

    In recent years interest is grown about the so-called non-linear Lagrangians for gravitation. In particular, the quadratic lagrangians are currently believed to play a fundamental role both for quantum gravity and for the super-gravity approach. The higher order and high degree of non-linearity of these theories make very difficult to extract physical information out of them. The author discusses how the Legendre transformation can be applied to a wide class of non-linear theories: it corresponds to a conformal transformation whenever the Lagrangian depends only on the scalar curvature, while it has a more general form if the Lagrangian depends on the full Ricci tensor

  2. Contribution of non-negative matrix factorization to the classification of remote sensing images

    Science.gov (United States)

    Karoui, M. S.; Deville, Y.; Hosseini, S.; Ouamri, A.; Ducrot, D.

    2008-10-01

    Remote sensing has become an unavoidable tool for better managing our environment, generally by realizing maps of land cover using classification techniques. The classification process requires some pre-processing, especially for data size reduction. The most usual technique is Principal Component Analysis. Another approach consists in regarding each pixel of the multispectral image as a mixture of pure elements contained in the observed area. Using Blind Source Separation (BSS) methods, one can hope to unmix each pixel and to perform the recognition of the classes constituting the observed scene. Our contribution consists in using Non-negative Matrix Factorization (NMF) combined with sparse coding as a solution to BSS, in order to generate new images (which are at least partly separated images) using HRV SPOT images from Oran area, Algeria). These images are then used as inputs of a supervised classifier integrating textural information. The results of classifications of these "separated" images show a clear improvement (correct pixel classification rate improved by more than 20%) compared to classification of initial (i.e. non separated) images. These results show the contribution of NMF as an attractive pre-processing for classification of multispectral remote sensing imagery.

  3. Multi-view clustering via multi-manifold regularized non-negative matrix factorization.

    Science.gov (United States)

    Zong, Linlin; Zhang, Xianchao; Zhao, Long; Yu, Hong; Zhao, Qianli

    2017-04-01

    Non-negative matrix factorization based multi-view clustering algorithms have shown their competitiveness among different multi-view clustering algorithms. However, non-negative matrix factorization fails to preserve the locally geometrical structure of the data space. In this paper, we propose a multi-manifold regularized non-negative matrix factorization framework (MMNMF) which can preserve the locally geometrical structure of the manifolds for multi-view clustering. MMNMF incorporates consensus manifold and consensus coefficient matrix with multi-manifold regularization to preserve the locally geometrical structure of the multi-view data space. We use two methods to construct the consensus manifold and two methods to find the consensus coefficient matrix, which leads to four instances of the framework. Experimental results show that the proposed algorithms outperform existing non-negative matrix factorization based algorithms for multi-view clustering. Copyright © 2017 Elsevier Ltd. All rights reserved.

  4. Dictionary Learning Based on Nonnegative Matrix Factorization Using Parallel Coordinate Descent

    Directory of Open Access Journals (Sweden)

    Zunyi Tang

    2013-01-01

    Full Text Available Sparse representation of signals via an overcomplete dictionary has recently received much attention as it has produced promising results in various applications. Since the nonnegativities of the signals and the dictionary are required in some applications, for example, multispectral data analysis, the conventional dictionary learning methods imposed simply with nonnegativity may become inapplicable. In this paper, we propose a novel method for learning a nonnegative, overcomplete dictionary for such a case. This is accomplished by posing the sparse representation of nonnegative signals as a problem of nonnegative matrix factorization (NMF with a sparsity constraint. By employing the coordinate descent strategy for optimization and extending it to multivariable case for processing in parallel, we develop a so-called parallel coordinate descent dictionary learning (PCDDL algorithm, which is structured by iteratively solving the two optimal problems, the learning process of the dictionary and the estimating process of the coefficients for constructing the signals. Numerical experiments demonstrate that the proposed algorithm performs better than the conventional nonnegative K-SVD (NN-KSVD algorithm and several other algorithms for comparison. What is more, its computational consumption is remarkably lower than that of the compared algorithms.

  5. Quadratic independence of coordinate functions of certain ...

    Indian Academy of Sciences (India)

    ... are `quadratically independent' in the sense that they do not satisfy any nontrivial homogeneous quadratic relations among them. Using this, it is proved that there is no genuine compact quantum group which can act faithfully on C ( M ) such that the action leaves invariant the linear span of the above coordinate functions.

  6. Sibling curves of quadratic polynomials | Wiggins | Quaestiones ...

    African Journals Online (AJOL)

    Sibling curves were demonstrated in [1, 2] as a novel way to visualize the zeroes of real valued functions. In [3] it was shown that a polynomial of degree n has n sibling curves. This paper focuses on the algebraic and geometric properites of the sibling curves of real and complex quadratic polynomials. Key words: Quadratic ...

  7. An example in linear quadratic optimal control

    NARCIS (Netherlands)

    Weiss, George; Zwart, Heiko J.

    1998-01-01

    We construct a simple example of a quadratic optimal control problem for an infinite-dimensional linear system based on a shift semigroup. This system has an unbounded control operator. The cost is quadratic in the input and the state, and the weighting operators are bounded. Despite its extreme

  8. Quadratic Boost A-Source Impedance Network

    DEFF Research Database (Denmark)

    Siwakoti, Yam Prasad; Blaabjerg, Frede; Chub, Andrii

    2016-01-01

    A novel quadratic boost A-source impedance network is proposed to realize converters that demand very high voltage gain. To satisfy the requirement, the network uses an autotransformer where the obtained gain is quadratically dependent on the duty ratio and is unmatched by any existing impedance...

  9. Sparse Nonnegative Matrix Factorization Strategy for Cochlear Implants

    Directory of Open Access Journals (Sweden)

    Hongmei Hu

    2015-12-01

    Full Text Available Current cochlear implant (CI strategies carry speech information via the waveform envelope in frequency subbands. CIs require efficient speech processing to maximize information transfer to the brain, especially in background noise, where the speech envelope is not robust to noise interference. In such conditions, the envelope, after decomposition into frequency bands, may be enhanced by sparse transformations, such as nonnegative matrix factorization (NMF. Here, a novel CI processing algorithm is described, which works by applying NMF to the envelope matrix (envelopogram of 22 frequency channels in order to improve performance in noisy environments. It is evaluated for speech in eight-talker babble noise. The critical sparsity constraint parameter was first tuned using objective measures and then evaluated with subjective speech perception experiments for both normal hearing and CI subjects. Results from vocoder simulations with 10 normal hearing subjects showed that the algorithm significantly enhances speech intelligibility with the selected sparsity constraints. Results from eight CI subjects showed no significant overall improvement compared with the standard advanced combination encoder algorithm, but a trend toward improvement of word identification of about 10 percentage points at +15 dB signal-to-noise ratio (SNR was observed in the eight CI subjects. Additionally, a considerable reduction of the spread of speech perception performance from 40% to 93% for advanced combination encoder to 80% to 100% for the suggested NMF coding strategy was observed.

  10. Learning a Nonnegative Sparse Graph for Linear Regression.

    Science.gov (United States)

    Fang, Xiaozhao; Xu, Yong; Li, Xuelong; Lai, Zhihui; Wong, Wai Keung

    2015-09-01

    Previous graph-based semisupervised learning (G-SSL) methods have the following drawbacks: 1) they usually predefine the graph structure and then use it to perform label prediction, which cannot guarantee an overall optimum and 2) they only focus on the label prediction or the graph structure construction but are not competent in handling new samples. To this end, a novel nonnegative sparse graph (NNSG) learning method was first proposed. Then, both the label prediction and projection learning were integrated into linear regression. Finally, the linear regression and graph structure learning were unified within the same framework to overcome these two drawbacks. Therefore, a novel method, named learning a NNSG for linear regression was presented, in which the linear regression and graph learning were simultaneously performed to guarantee an overall optimum. In the learning process, the label information can be accurately propagated via the graph structure so that the linear regression can learn a discriminative projection to better fit sample labels and accurately classify new samples. An effective algorithm was designed to solve the corresponding optimization problem with fast convergence. Furthermore, NNSG provides a unified perceptiveness for a number of graph-based learning methods and linear regression methods. The experimental results showed that NNSG can obtain very high classification accuracy and greatly outperforms conventional G-SSL methods, especially some conventional graph construction methods.

  11. Multiplicative algorithms for constrained non-negative matrix factorization

    KAUST Repository

    Peng, Chengbin

    2012-12-01

    Non-negative matrix factorization (NMF) provides the advantage of parts-based data representation through additive only combinations. It has been widely adopted in areas like item recommending, text mining, data clustering, speech denoising, etc. In this paper, we provide an algorithm that allows the factorization to have linear or approximatly linear constraints with respect to each factor. We prove that if the constraint function is linear, algorithms within our multiplicative framework will converge. This theory supports a large variety of equality and inequality constraints, and can facilitate application of NMF to a much larger domain. Taking the recommender system as an example, we demonstrate how a specialized weighted and constrained NMF algorithm can be developed to fit exactly for the problem, and the tests justify that our constraints improve the performance for both weighted and unweighted NMF algorithms under several different metrics. In particular, on the Movielens data with 94% of items, the Constrained NMF improves recall rate 3% compared to SVD50 and 45% compared to SVD150, which were reported as the best two in the top-N metric. © 2012 IEEE.

  12. Quadratic Hedging of Basis Risk

    Directory of Open Access Journals (Sweden)

    Hardy Hulley

    2015-02-01

    Full Text Available This paper examines a simple basis risk model based on correlated geometric Brownian motions. We apply quadratic criteria to minimize basis risk and hedge in an optimal manner. Initially, we derive the Föllmer–Schweizer decomposition for a European claim. This allows pricing and hedging under the minimal martingale measure, corresponding to the local risk-minimizing strategy. Furthermore, since the mean-variance tradeoff process is deterministic in our setup, the minimal martingale- and variance-optimal martingale measures coincide. Consequently, the mean-variance optimal strategy is easily constructed. Simple pricing and hedging formulae for put and call options are derived in terms of the Black–Scholes formula. Due to market incompleteness, these formulae depend on the drift parameters of the processes. By making a further equilibrium assumption, we derive an approximate hedging formula, which does not require knowledge of these parameters. The hedging strategies are tested using Monte Carlo experiments, and are compared with results achieved using a utility maximization approach.

  13. linear-quadratic-linear model

    Directory of Open Access Journals (Sweden)

    Tanwiwat Jaikuna

    2017-02-01

    Full Text Available Purpose: To develop an in-house software program that is able to calculate and generate the biological dose distribution and biological dose volume histogram by physical dose conversion using the linear-quadratic-linear (LQL model. Material and methods : The Isobio software was developed using MATLAB version 2014b to calculate and generate the biological dose distribution and biological dose volume histograms. The physical dose from each voxel in treatment planning was extracted through Computational Environment for Radiotherapy Research (CERR, and the accuracy was verified by the differentiation between the dose volume histogram from CERR and the treatment planning system. An equivalent dose in 2 Gy fraction (EQD2 was calculated using biological effective dose (BED based on the LQL model. The software calculation and the manual calculation were compared for EQD2 verification with pair t-test statistical analysis using IBM SPSS Statistics version 22 (64-bit. Results: Two and three-dimensional biological dose distribution and biological dose volume histogram were displayed correctly by the Isobio software. Different physical doses were found between CERR and treatment planning system (TPS in Oncentra, with 3.33% in high-risk clinical target volume (HR-CTV determined by D90%, 0.56% in the bladder, 1.74% in the rectum when determined by D2cc, and less than 1% in Pinnacle. The difference in the EQD2 between the software calculation and the manual calculation was not significantly different with 0.00% at p-values 0.820, 0.095, and 0.593 for external beam radiation therapy (EBRT and 0.240, 0.320, and 0.849 for brachytherapy (BT in HR-CTV, bladder, and rectum, respectively. Conclusions : The Isobio software is a feasible tool to generate the biological dose distribution and biological dose volume histogram for treatment plan evaluation in both EBRT and BT.

  14. Manifold regularized discriminative nonnegative matrix factorization with fast gradient descent.

    Science.gov (United States)

    Guan, Naiyang; Tao, Dacheng; Luo, Zhigang; Yuan, Bo

    2011-07-01

    Nonnegative matrix factorization (NMF) has become a popular data-representation method and has been widely used in image processing and pattern-recognition problems. This is because the learned bases can be interpreted as a natural parts-based representation of data and this interpretation is consistent with the psychological intuition of combining parts to form a whole. For practical classification tasks, however, NMF ignores both the local geometry of data and the discriminative information of different classes. In addition, existing research results show that the learned basis is unnecessarily parts-based because there is neither explicit nor implicit constraint to ensure the representation parts-based. In this paper, we introduce the manifold regularization and the margin maximization to NMF and obtain the manifold regularized discriminative NMF (MD-NMF) to overcome the aforementioned problems. The multiplicative update rule (MUR) can be applied to optimizing MD-NMF, but it converges slowly. In this paper, we propose a fast gradient descent (FGD) to optimize MD-NMF. FGD contains a Newton method that searches the optimal step length, and thus, FGD converges much faster than MUR. In addition, FGD includes MUR as a special case and can be applied to optimizing NMF and its variants. For a problem with 165 samples in R(1600), FGD converges in 28 s, while MUR requires 282 s. We also apply FGD in a variant of MD-NMF and experimental results confirm its efficiency. Experimental results on several face image datasets suggest the effectiveness of MD-NMF.

  15. Uniform sparse bounds for discrete quadratic phase Hilbert transforms

    Science.gov (United States)

    Kesler, Robert; Arias, Darío Mena

    2017-09-01

    For each α \\in T consider the discrete quadratic phase Hilbert transform acting on finitely supported functions f : Z → C according to H^{α }f(n):= \\sum _{m ≠ 0} e^{iα m^2} f(n - m)/m. We prove that, uniformly in α \\in T , there is a sparse bound for the bilinear form for every pair of finitely supported functions f,g : Z→ C . The sparse bound implies several mapping properties such as weighted inequalities in an intersection of Muckenhoupt and reverse Hölder classes.

  16. Designing Camera Networks by Convex Quadratic Programming

    KAUST Repository

    Ghanem, Bernard; Wonka, Peter; Cao, Yuanhao

    2015-01-01

    be formulated mathematically as a convex binary quadratic program (BQP) under linear constraints. Moreover, we propose an optimization strategy with a favorable trade-off between speed and solution quality. Our solution

  17. Schur Stability Regions for Complex Quadratic Polynomials

    Science.gov (United States)

    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.)

  18. Quadratic Functionals with General Boundary Conditions

    International Nuclear Information System (INIS)

    Dosla, Z.; Dosly, O.

    1997-01-01

    The purpose of this paper is to give the Reid 'Roundabout Theorem' for quadratic functionals with general boundary conditions. In particular, we describe the so-called coupled point and regularity condition introduced in terms of Riccati equation solutions

  19. Radiotherapy treatment planning linear-quadratic radiobiology

    CERN Document Server

    Chapman, J Donald

    2015-01-01

    Understand Quantitative Radiobiology from a Radiation Biophysics PerspectiveIn the field of radiobiology, the linear-quadratic (LQ) equation has become the standard for defining radiation-induced cell killing. Radiotherapy Treatment Planning: Linear-Quadratic Radiobiology describes tumor cell inactivation from a radiation physics perspective and offers appropriate LQ parameters for modeling tumor and normal tissue responses.Explore the Latest Cell Killing Numbers for Defining Iso-Effective Cancer TreatmentsThe book compil

  20. Solitons in quadratic nonlinear photonic crystals

    DEFF Research Database (Denmark)

    Corney, Joel Frederick; Bang, Ole

    2001-01-01

    We study solitons in one-dimensional quadratic nonlinear photonic crystals with modulation of both the linear and nonlinear susceptibilities. We derive averaged equations that include induced cubic nonlinearities, which can be defocusing, and we numerically find previously unknown soliton families....... Because of these induced cubic terms, solitons still exist even when the effective quadratic nonlinearity vanishes and conventional theory predicts that there can be no soliton. We demonstrate that both bright and dark forms of these solitons can propagate stably....

  1. Audio Source Separation in Reverberant Environments Using β-Divergence-Based Nonnegative Factorization

    DEFF Research Database (Denmark)

    Fakhry, Mahmoud; Svaizer, Piergiorgio; Omologo, Maurizio

    2017-01-01

    -maximization algorithm and used to separate the signals by means of multichannel Wiener filtering. We propose to estimate these parameters by applying nonnegative factorization based on prior information on source variances. In the nonnegative factorization, spectral basis matrices can be defined as the prior...... information. The matrices can be either extracted or indirectly made available through a redundant library that is trained in advance. In a separate step, applying nonnegative tensor factorization, two algorithms are proposed in order to either extract or detect the basis matrices that best represent......In Gaussian model-based multichannel audio source separation, the likelihood of observed mixtures of source signals is parametrized by source spectral variances and by associated spatial covariance matrices. These parameters are estimated by maximizing the likelihood through an expectation...

  2. A Fast Gradient Method for Nonnegative Sparse Regression With Self-Dictionary

    Science.gov (United States)

    Gillis, Nicolas; Luce, Robert

    2018-01-01

    A nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the given input data matrix belong to the cone generated by a (small) subset of them. The provably most robust methods to identify these conic basis columns are based on nonnegative sparse regression and self dictionaries, and require the solution of large-scale convex optimization problems. In this paper we study a particular nonnegative sparse regression model with self dictionary. As opposed to previously proposed models, this model yields a smooth optimization problem where the sparsity is enforced through linear constraints. We show that the Euclidean projection on the polyhedron defined by these constraints can be computed efficiently, and propose a fast gradient method to solve our model. We compare our algorithm with several state-of-the-art methods on synthetic data sets and real-world hyperspectral images.

  3. Non-negative matrix factorization in texture feature for classification of dementia with MRI data

    Science.gov (United States)

    Sarwinda, D.; Bustamam, A.; Ardaneswari, G.

    2017-07-01

    This paper investigates applications of non-negative matrix factorization as feature selection method to select the features from gray level co-occurrence matrix. The proposed approach is used to classify dementia using MRI data. In this study, texture analysis using gray level co-occurrence matrix is done to feature extraction. In the feature extraction process of MRI data, we found seven features from gray level co-occurrence matrix. Non-negative matrix factorization selected three features that influence of all features produced by feature extractions. A Naïve Bayes classifier is adapted to classify dementia, i.e. Alzheimer's disease, Mild Cognitive Impairment (MCI) and normal control. The experimental results show that non-negative factorization as feature selection method able to achieve an accuracy of 96.4% for classification of Alzheimer's and normal control. The proposed method also compared with other features selection methods i.e. Principal Component Analysis (PCA).

  4. Single-channel source separation using non-negative matrix factorization

    DEFF Research Database (Denmark)

    Schmidt, Mikkel Nørgaard

    -determined and its solution relies on making appropriate assumptions concerning the sources. This dissertation is concerned with model-based probabilistic single-channel source separation based on non-negative matrix factorization, and consists of two parts: i) three introductory chapters and ii) five published...... papers. The first part introduces the single-channel source separation problem as well as non-negative matrix factorization and provides a comprehensive review of existing approaches, applications, and practical algorithms. This serves to provide context for the second part, the published papers......, in which a number of methods for single-channel source separation based on non-negative matrix factorization are presented. In the papers, the methods are applied to separating audio signals such as speech and musical instruments and separating different types of tissue in chemical shift imaging....

  5. Robust fluence map optimization via alternating direction method of multipliers with empirical parameter optimization

    International Nuclear Information System (INIS)

    Gao, Hao

    2016-01-01

    For the treatment planning during intensity modulated radiation therapy (IMRT) or volumetric modulated arc therapy (VMAT), beam fluence maps can be first optimized via fluence map optimization (FMO) under the given dose prescriptions and constraints to conformally deliver the radiation dose to the targets while sparing the organs-at-risk, and then segmented into deliverable MLC apertures via leaf or arc sequencing algorithms. This work is to develop an efficient algorithm for FMO based on alternating direction method of multipliers (ADMM). Here we consider FMO with the least-square cost function and non-negative fluence constraints, and its solution algorithm is based on ADMM, which is efficient and simple-to-implement. In addition, an empirical method for optimizing the ADMM parameter is developed to improve the robustness of the ADMM algorithm. The ADMM based FMO solver was benchmarked with the quadratic programming method based on the interior-point (IP) method using the CORT dataset. The comparison results suggested the ADMM solver had a similar plan quality with slightly smaller total objective function value than IP. A simple-to-implement ADMM based FMO solver with empirical parameter optimization is proposed for IMRT or VMAT. (paper)

  6. Linear-quadratic control and quadratic differential forms for multidimensional behaviors

    NARCIS (Netherlands)

    Napp, D.; Trentelman, H.L.

    2011-01-01

    This paper deals with systems described by constant coefficient linear partial differential equations (nD-systems) from a behavioral point of view. In this context we treat the linear-quadratic control problem where the performance functional is the integral of a quadratic differential form. We look

  7. Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem

    DEFF Research Database (Denmark)

    Mak, Vicky; Thomadsen, Tommy

    2006-01-01

    This paper considers the cardinality constrained quadratic knapsack problem (QKP) and the quadratic selective travelling salesman problem (QSTSP). The QKP is a generalization of the knapsack problem and the QSTSP is a generalization of the travelling salesman problem. Thus, both problems are NP...

  8. Nonnegative Matrix Factor 2-D Deconvolution for Blind Single Channel Source Separation

    DEFF Research Database (Denmark)

    Schmidt, Mikkel N.; Mørup, Morten

    2006-01-01

    We present a novel method for blind separation of instruments in polyphonic music based on a non-negative matrix factor 2-D deconvolution algorithm. Using a model which is convolutive in both time and frequency we factorize a spectrogram representation of music into components corresponding...

  9. Wigner weight functions and Weyl symbols of non-negative definite linear operators

    NARCIS (Netherlands)

    Janssen, A.J.E.M.

    1989-01-01

    In this paper we present several necessary and, for radially symmetric functions, necessary and sufficient conditions for a function of two variables to be a Wigner weight function (Weyl symbol of a non-negative definite linear operator of L2(R)). These necessary conditions are in terms of spread

  10. Admissible solutions for a class of nonlinear parabolic problem with non-negative data

    Czech Academy of Sciences Publication Activity Database

    Feireisl, Eduard; Petzeltová, Hana; Simondon, F.

    2001-01-01

    Roč. 131, č. 5 (2001), s. 857-883 ISSN 0308-2105 R&D Projects: GA AV ČR IAA1019703 Keywords : admissible solutions%nonlinear parabolic problem * admissible solutions * comparison principle * non-negative data Subject RIV: BA - General Mathematics Impact factor: 0.441, year: 2001

  11. Efficient non-negative constrained model-based inversion in optoacoustic tomography

    International Nuclear Information System (INIS)

    Ding, Lu; Luís Deán-Ben, X; Lutzweiler, Christian; Razansky, Daniel; Ntziachristos, Vasilis

    2015-01-01

    The inversion accuracy in optoacoustic tomography depends on a number of parameters, including the number of detectors employed, discrete sampling issues or imperfectness of the forward model. These parameters result in ambiguities on the reconstructed image. A common ambiguity is the appearance of negative values, which have no physical meaning since optical absorption can only be higher or equal than zero. We investigate herein algorithms that impose non-negative constraints in model-based optoacoustic inversion. Several state-of-the-art non-negative constrained algorithms are analyzed. Furthermore, an algorithm based on the conjugate gradient method is introduced in this work. We are particularly interested in investigating whether positive restrictions lead to accurate solutions or drive the appearance of errors and artifacts. It is shown that the computational performance of non-negative constrained inversion is higher for the introduced algorithm than for the other algorithms, while yielding equivalent results. The experimental performance of this inversion procedure is then tested in phantoms and small animals, showing an improvement in image quality and quantitativeness with respect to the unconstrained approach. The study performed validates the use of non-negative constraints for improving image accuracy compared to unconstrained methods, while maintaining computational efficiency. (paper)

  12. Sparse Non-negative Matrix Factor 2-D Deconvolution for Automatic Transcription of Polyphonic Music

    DEFF Research Database (Denmark)

    Schmidt, Mikkel N.; Mørup, Morten

    2006-01-01

    We present a novel method for automatic transcription of polyphonic music based on a recently published algorithm for non-negative matrix factor 2-D deconvolution. The method works by simultaneously estimating a time-frequency model for an instrument and a pattern corresponding to the notes which...... are played based on a log-frequency spectrogram of the music....

  13. Asymptotics of the Perron-Frobenius eigenvalue of nonnegative Hessenberg-Toeplitz matrices

    NARCIS (Netherlands)

    Janssen, A.J.E.M.

    1989-01-01

    Asymptotic results for the Perron-Frobenius eigenvalue of a nonnegative Hessenberg-Toeplitz matrix as the dimension of the matrix tends to 8 are given. The results are used and interpreted in terms of source entropies in the case where the Hessenberg-Toeplitz matrix arises as the transition matrix

  14. Hessian regularization based symmetric nonnegative matrix factorization for clustering gene expression and microbiome data.

    Science.gov (United States)

    Ma, Yuanyuan; Hu, Xiaohua; He, Tingting; Jiang, Xingpeng

    2016-12-01

    Nonnegative matrix factorization (NMF) has received considerable attention due to its interpretation of observed samples as combinations of different components, and has been successfully used as a clustering method. As an extension of NMF, Symmetric NMF (SNMF) inherits the advantages of NMF. Unlike NMF, however, SNMF takes a nonnegative similarity matrix as an input, and two lower rank nonnegative matrices (H, H T ) are computed as an output to approximate the original similarity matrix. Laplacian regularization has improved the clustering performance of NMF and SNMF. However, Laplacian regularization (LR), as a classic manifold regularization method, suffers some problems because of its weak extrapolating ability. In this paper, we propose a novel variant of SNMF, called Hessian regularization based symmetric nonnegative matrix factorization (HSNMF), for this purpose. In contrast to Laplacian regularization, Hessian regularization fits the data perfectly and extrapolates nicely to unseen data. We conduct extensive experiments on several datasets including text data, gene expression data and HMP (Human Microbiome Project) data. The results show that the proposed method outperforms other methods, which suggests the potential application of HSNMF in biological data clustering. Copyright © 2016. Published by Elsevier Inc.

  15. Guises and disguises of quadratic divergences

    Energy Technology Data Exchange (ETDEWEB)

    Cherchiglia, A.L., E-mail: adriano@fisica.ufmg.br [Departamento de Física, ICEx, Universidade Federal de Minas Gerais, P.O. BOX 702, 30.161-970, Belo Horizonte, MG (Brazil); Vieira, A.R., E-mail: arvieira@fisica.ufmg.br [Departamento de Física, ICEx, Universidade Federal de Minas Gerais, P.O. BOX 702, 30.161-970, Belo Horizonte, MG (Brazil); Hiller, Brigitte, E-mail: brigitte@teor.fis.uc.pt [Departamento de Física, Faculdade de Ciências e Tecnologia, Universidade de Coimbra, 3004-516 Coimbra (Portugal); Baêta Scarpelli, A.P., E-mail: scarpelli.apbs@dpf.gov.br [Setor Técnico-Científico, Departamento de Polícia Federal, Rua Hugo D’Antola, 95 - Lapa, São Paulo (Brazil); Sampaio, Marcos, E-mail: marcos.sampaio@durham.ac.uk [Departamento de Física, ICEx, Universidade Federal de Minas Gerais, P.O. BOX 702, 30.161-970, Belo Horizonte, MG (Brazil); Centre for Particle Theory, Department of Mathematical Sciences, Durham University, South Road Durham DH1 3LE (United Kingdom)

    2014-12-15

    In this contribution, we present a new perspective on the control of quadratic divergences in quantum field theory, in general, and in the Higgs naturalness problem, in particular. Our discussion is essentially based on an approach where UV divergences are parameterized, after being reduced to basic divergent integrals (BDI) in one internal momentum, as functions of a cutoff and a renormalization group scale λ. We illustrate our proposal with well-known examples, such as the gluon vacuum self energy of QCD and the Higgs decay in two photons within this approach. We also discuss frameworks in effective low-energy QCD models, where quadratic divergences are indeed fundamental.

  16. Indirect quantum tomography of quadratic Hamiltonians

    Energy Technology Data Exchange (ETDEWEB)

    Burgarth, Daniel [Institute for Mathematical Sciences, Imperial College London, London SW7 2PG (United Kingdom); Maruyama, Koji; Nori, Franco, E-mail: daniel@burgarth.de, E-mail: kmaruyama@riken.jp [Advanced Science Institute, RIKEN, Wako-shi, Saitama 351-0198 (Japan)

    2011-01-15

    A number of many-body problems can be formulated using Hamiltonians that are quadratic in the creation and annihilation operators. Here, we show how such quadratic Hamiltonians can be efficiently estimated indirectly, employing very few resources. We found that almost all the properties of the Hamiltonian are determined by its surface and that these properties can be measured even if the system can only be initialized to a mixed state. Therefore, our method can be applied to various physical models, with important examples including coupled nano-mechanical oscillators, hopping fermions in optical lattices and transverse Ising chains.

  17. Nonlinear dynamics of quadratically cubic systems

    International Nuclear Information System (INIS)

    Rudenko, O V

    2013-01-01

    We propose a modified form of the well-known nonlinear dynamic equations with quadratic relations used to model a cubic nonlinearity. We show that such quadratically cubic equations sometimes allow exact solutions and sometimes make the original problem easier to analyze qualitatively. Occasionally, exact solutions provide a useful tool for studying new phenomena. Examples considered include nonlinear ordinary differential equations and Hopf, Burgers, Korteweg–de Vries, and nonlinear Schrödinger partial differential equations. Some problems are solved exactly in the space–time and spectral representations. Unsolved problems potentially solvable by the proposed approach are listed. (methodological notes)

  18. PSQP: Puzzle Solving by Quadratic Programming.

    Science.gov (United States)

    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.

  19. Cascaded Quadratic Soliton Compression in Waveguide Structures

    DEFF Research Database (Denmark)

    Guo, Hairun

    between the Kerr nonlinear effects and the dispersive effects in the medium. A Kerr-like nonlinearity is produced through the cascaded phase mismatched quadratic process, e.g. the second harmonic generation process, which can be flexibly tuned in both the sign and the amplitude, making possible a strong......-phase-matching technology is not necessarily needed. In large-RI-changed waveguides, CQSC is extended to the mid-infrared range to generate single-cycle pulses with purely nonlinear interactions, since an all-normal dispersion profile could be achieved within the guidance band. We believe that CQSC in quadratic waveguides...

  20. On orthogonality preserving quadratic stochastic operators

    Energy Technology Data Exchange (ETDEWEB)

    Mukhamedov, Farrukh; Taha, Muhammad Hafizuddin Mohd [Department of Computational and Theoretical Sciences, Faculty of Science International Islamic University Malaysia, P.O. Box 141, 25710 Kuantan, Pahang Malaysia (Malaysia)

    2015-05-15

    A quadratic stochastic operator (in short QSO) is usually used to present the time evolution of differing species in biology. Some quadratic stochastic operators have been studied by Lotka and Volterra. In the present paper, we first give a simple characterization of Volterra QSO in terms of absolutely continuity of discrete measures. Further, we introduce a notion of orthogonal preserving QSO, and describe such kind of operators defined on two dimensional simplex. It turns out that orthogonal preserving QSOs are permutations of Volterra QSO. The associativity of genetic algebras generated by orthogonal preserving QSO is studied too.

  1. Bound constrained quadratic programming via piecewise

    DEFF Research Database (Denmark)

    Madsen, Kaj; Nielsen, Hans Bruun; Pinar, M. C.

    1999-01-01

    of a symmetric, positive definite matrix, and is solved by Newton iteration with line search. The paper describes the algorithm and its implementation including estimation of lambda/sub 1/ , how to get a good starting point for the iteration, and up- and downdating of Cholesky factorization. Results of extensive......We consider the strictly convex quadratic programming problem with bounded variables. A dual problem is derived using Lagrange duality. The dual problem is the minimization of an unconstrained, piecewise quadratic function. It involves a lower bound of lambda/sub 1/ , the smallest eigenvalue...

  2. On orthogonality preserving quadratic stochastic operators

    International Nuclear Information System (INIS)

    Mukhamedov, Farrukh; Taha, Muhammad Hafizuddin Mohd

    2015-01-01

    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

  3. Eigenfunctions of quadratic hamiltonians in Wigner representation

    International Nuclear Information System (INIS)

    Akhundova, Eh.A.; Dodonov, V.V.; Man'ko, V.I.

    1984-01-01

    Exact solutions of the Schroedinger equation in Wigner representation are obtained for an arbitrary non-stationary N-dimensional quadratic Hamiltonian. It is shown that the complete system of the solutions can always be chosen in the form of the products of Laguerre polynomials, the arguments of which are the quadratic integrals of motion of the corresponding classical problem. The generating function is found for the transition probabilities between Fock states which represent a many-dimensional generatization of a well-known Husimi formula for the oscillator of variable frequency. As an example, the motion of a charged particle in an uniform alternate electromagnetic field is considered in detail

  4. Quadratic mass relations in topological bootstrap theory

    International Nuclear Information System (INIS)

    Jones, C.E.; Uschersohn, J.

    1980-01-01

    From the requirement of reality of discontinuities of scattering amplitudes at the spherical level of the topological bootstrap theory, a large number of mass relations for hadrons is derived. Quadratic mass formulas for the symmetry-breaking pattern of both mesons and baryon is obtained and their relation to conventional models of symmetry breaking is briefly discussed

  5. STABILIZED SEQUENTIAL QUADRATIC PROGRAMMING: A SURVEY

    Directory of Open Access Journals (Sweden)

    Damián Fernández

    2014-12-01

    Full Text Available We review the motivation for, the current state-of-the-art in convergence results, and some open questions concerning the stabilized version of the sequential quadratic programming algorithm for constrained optimization. We also discuss the tools required for its local convergence analysis, globalization challenges, and extentions of the method to the more general variational problems.

  6. The Quadratic Selective Travelling Salesman Problem

    DEFF Research Database (Denmark)

    Thomadsen, Tommy; Stidsen, Thomas K.

    2003-01-01

    A well-known extension of the Travelling Salesman Problem (TSP) is the Selective TSP (STSP): Each node has an associated profit and instead of visiting all nodes, the most profitable set of nodes, taking into account the tour cost, is visited. The Quadratic STSP (QSTSP) adds the additional...

  7. orthogonal and scaling transformations of quadratic functions

    African Journals Online (AJOL)

    Preferred Customer

    functions of sub-problems of various nonlinear programming problems that employ methods such as sequential quadratic programming and trust-region methods (Sorensen, 1982; Eldersveld,. 1991; Nocedal and Wright, 1999). Various problems in Algebra, Functional Analysis,. Analytic Geometry and Computational Mathe-.

  8. Fundamental quadratic variational principle underlying general relativity

    International Nuclear Information System (INIS)

    Atkins, W.K.

    1983-01-01

    The fundamental result of Lanczos is used in a new type of quadratic variational principle whose field equations are the Einstein field equations together with the Yang-Mills type equations for the Riemann curvature. Additionally, a spin-2 theory of gravity for the special case of the Einstein vacuum is discussed

  9. Investigating Students' Mathematical Difficulties with Quadratic Equations

    Science.gov (United States)

    O'Connor, Bronwyn Reid; Norton, Stephen

    2016-01-01

    This paper examines the factors that hinder students' success in working with and understanding the mathematics of quadratic equations using a case study analysis of student error patterns. Twenty-five Year 11 students were administered a written test to examine their understanding of concepts and procedures associated with this topic. The…

  10. Commuting quantum traces for quadratic algebras

    International Nuclear Information System (INIS)

    Nagy, Zoltan; Avan, Jean; Doikou, Anastasia; Rollet, Genevieve

    2005-01-01

    Consistent tensor products on auxiliary spaces, hereafter denoted 'fusion procedures', and commuting transfer matrices are defined for general quadratic algebras, nondynamical and dynamical, inspired by results on reflection algebras. Applications of these procedures then yield integer-indexed families of commuting Hamiltonians

  11. Optimality Conditions for Fuzzy Number Quadratic Programming with Fuzzy Coefficients

    Directory of Open Access Journals (Sweden)

    Xue-Gang Zhou

    2014-01-01

    Full Text Available The purpose of the present paper is to investigate optimality conditions and duality theory in fuzzy number quadratic programming (FNQP in which the objective function is fuzzy quadratic function with fuzzy number coefficients and the constraint set is fuzzy linear functions with fuzzy number coefficients. Firstly, the equivalent quadratic programming of FNQP is presented by utilizing a linear ranking function and the dual of fuzzy number quadratic programming primal problems is introduced. Secondly, we present optimality conditions for fuzzy number quadratic programming. We then prove several duality results for fuzzy number quadratic programming problems with fuzzy coefficients.

  12. ORACLS: A system for linear-quadratic-Gaussian control law design

    Science.gov (United States)

    Armstrong, E. S.

    1978-01-01

    A modern control theory design package (ORACLS) for constructing controllers and optimal filters for systems modeled by linear time-invariant differential or difference equations is described. Numerical linear-algebra procedures are used to implement the linear-quadratic-Gaussian (LQG) methodology of modern control theory. Algorithms are included for computing eigensystems of real matrices, the relative stability of a matrix, factored forms for nonnegative definite matrices, the solutions and least squares approximations to the solutions of certain linear matrix algebraic equations, the controllability properties of a linear time-invariant system, and the steady state covariance matrix of an open-loop stable system forced by white noise. Subroutines are provided for solving both the continuous and discrete optimal linear regulator problems with noise free measurements and the sampled-data optimal linear regulator problem. For measurement noise, duality theory and the optimal regulator algorithms are used to solve the continuous and discrete Kalman-Bucy filter problems. Subroutines are also included which give control laws causing the output of a system to track the output of a prescribed model.

  13. Enhanced surrogate models for statistical design exploiting space mapping technology

    DEFF Research Database (Denmark)

    Koziel, Slawek; Bandler, John W.; Mohamed, Achmed S.

    2005-01-01

    We present advances in microwave and RF device modeling exploiting Space Mapping (SM) technology. We propose new SM modeling formulations utilizing input mappings, output mappings, frequency scaling and quadratic approximations. Our aim is to enhance circuit models for statistical analysis...

  14. A Poisson nonnegative matrix factorization method with parameter subspace clustering constraint for endmember extraction in hyperspectral imagery

    Science.gov (United States)

    Sun, Weiwei; Ma, Jun; Yang, Gang; Du, Bo; Zhang, Liangpei

    2017-06-01

    A new Bayesian method named Poisson Nonnegative Matrix Factorization with Parameter Subspace Clustering Constraint (PNMF-PSCC) has been presented to extract endmembers from Hyperspectral Imagery (HSI). First, the method integrates the liner spectral mixture model with the Bayesian framework and it formulates endmember extraction into a Bayesian inference problem. Second, the Parameter Subspace Clustering Constraint (PSCC) is incorporated into the statistical program to consider the clustering of all pixels in the parameter subspace. The PSCC could enlarge differences among ground objects and helps finding endmembers with smaller spectrum divergences. Meanwhile, the PNMF-PSCC method utilizes the Poisson distribution as the prior knowledge of spectral signals to better explain the quantum nature of light in imaging spectrometer. Third, the optimization problem of PNMF-PSCC is formulated into maximizing the joint density via the Maximum A Posterior (MAP) estimator. The program is finally solved by iteratively optimizing two sub-problems via the Alternating Direction Method of Multipliers (ADMM) framework and the FURTHESTSUM initialization scheme. Five state-of-the art methods are implemented to make comparisons with the performance of PNMF-PSCC on both the synthetic and real HSI datasets. Experimental results show that the PNMF-PSCC outperforms all the five methods in Spectral Angle Distance (SAD) and Root-Mean-Square-Error (RMSE), and especially it could identify good endmembers for ground objects with smaller spectrum divergences.

  15. Geometric Approaches to Quadratic Equations from Other Times and Places.

    Science.gov (United States)

    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)

  16. Coherent states of systems with quadratic Hamiltonians

    Energy Technology Data Exchange (ETDEWEB)

    Bagrov, V.G., E-mail: bagrov@phys.tsu.ru [Department of Physics, Tomsk State University, Tomsk (Russian Federation); Gitman, D.M., E-mail: gitman@if.usp.br [Tomsk State University, Tomsk (Russian Federation); Pereira, A.S., E-mail: albertoufcg@hotmail.com [Universidade de Sao Paulo (USP), Sao Paulo, SP (Brazil). Instituto de Fisica

    2015-06-15

    Different families of generalized coherent states (CS) for one-dimensional systems with general time-dependent quadratic Hamiltonian are constructed. In principle, all known CS of systems with quadratic Hamiltonian are members of these families. Some of the constructed generalized CS are close enough to the well-known due to Schroedinger and Glauber CS of a harmonic oscillator; we call them simply CS. However, even among these CS, there exist different families of complete sets of CS. These families differ by values of standard deviations at the initial time instant. According to the values of these initial standard deviations, one can identify some of the families with semiclassical CS. We discuss properties of the constructed CS, in particular, completeness relations, minimization of uncertainty relations and so on. As a unknown application of the general construction, we consider different CS of an oscillator with a time dependent frequency. (author)

  17. Coherent states of systems with quadratic Hamiltonians

    International Nuclear Information System (INIS)

    Bagrov, V.G.; Gitman, D.M.; Pereira, A.S.

    2015-01-01

    Different families of generalized coherent states (CS) for one-dimensional systems with general time-dependent quadratic Hamiltonian are constructed. In principle, all known CS of systems with quadratic Hamiltonian are members of these families. Some of the constructed generalized CS are close enough to the well-known due to Schroedinger and Glauber CS of a harmonic oscillator; we call them simply CS. However, even among these CS, there exist different families of complete sets of CS. These families differ by values of standard deviations at the initial time instant. According to the values of these initial standard deviations, one can identify some of the families with semiclassical CS. We discuss properties of the constructed CS, in particular, completeness relations, minimization of uncertainty relations and so on. As a unknown application of the general construction, we consider different CS of an oscillator with a time dependent frequency. (author)

  18. On quadratic residue codes and hyperelliptic curves

    Directory of Open Access Journals (Sweden)

    David Joyner

    2008-01-01

    Full Text Available For an odd prime p and each non-empty subset S⊂GF(p, consider the hyperelliptic curve X S defined by y 2 =f S (x, where f S (x = ∏ a∈S (x-a. Using a connection between binary quadratic residue codes and hyperelliptic curves over GF(p, this paper investigates how coding theory bounds give rise to bounds such as the following example: for all sufficiently large primes p there exists a subset S⊂GF(p for which the bound |X S (GF(p| > 1.39p holds. We also use the quasi-quadratic residue codes defined below to construct an example of a formally self-dual optimal code whose zeta function does not satisfy the ``Riemann hypothesis.''

  19. Quaternion orders, quadratic forms, and Shimura curves

    CERN Document Server

    Alsina, Montserrat

    2004-01-01

    Shimura curves are a far-reaching generalization of the classical modular curves. They lie at the crossroads of many areas, including complex analysis, hyperbolic geometry, algebraic geometry, algebra, and arithmetic. The text provides an introduction to the subject from a theoretic and algorithmic perspective. The main topics covered in it are Shimura curves defined over the rational number field, the construction of their fundamental domains, and the determination of their complex multiplication points. The study of complex multiplication points in Shimura curves leads to the study of families of binary quadratic forms with algebraic coefficients and to their classification by arithmetic Fuchsian groups. In this regard, the authors develop a theory full of new possibilities which parallels Gauss' theory on the classification of binary quadratic forms with integral coefficients by the action of the modular group. Each topic covered in the book begins with a theoretical discussion followed by carefully worked...

  20. Quadratic hamiltonians and relativistic quantum mechanics

    International Nuclear Information System (INIS)

    Razumov, A.V.; Solov'ev, V.O.; Taranov, A.Yu.

    1981-01-01

    For the case of a charged scalar field described by a quadratic hamiltonian the equivalent relativistic quantum mechanics is constructed in one-particle sector. Complete investigation of a charged relativistic particle motion in the Coulomb field is carried out. Subcritical as well as supercritical cases are considered. In the course of investigation of the charged scalar particle in the Coulomb field the diagonalization of the quadratic hamiltonian describing the charged scalar quantized field interaction with the external Coulomb field has taken place. Mathematically this problem is bound to the construction of self-conjugated expansions of the symmetric operator. The construction of such expansion is necessary at any small external field magnitude [ru

  1. Lambda-lifting in Quadratic Time

    DEFF Research Database (Denmark)

    Danvy, O.; Schultz, U.P.

    2004-01-01

    -lifting transforms a block-structured program into a set of recursive equations, one for each local function in the source program. Each equation carries extra parameters to account for the free variables of the corresponding local function and of all its callees. It is the search for these extra parameters......Lambda-lifting is a program transformation that is used in compilers, partial evaluators, and program transformers. In this article, we show how to reduce its complexity from cubic time to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda...... that yields the cubic factor in the traditional formulation of lambda-lifting, which is due to Johnsson. This search is carried out by computing a transitive closure. To reduce the complexity of lambda-lifting, we partition the call graph of the source program into strongly connected components, based...

  2. Quadratic Interpolation and Linear Lifting Design

    Directory of Open Access Journals (Sweden)

    Joel Solé

    2007-03-01

    Full Text Available A quadratic image interpolation method is stated. The formulation is connected to the optimization of lifting steps. This relation triggers the exploration of several interpolation possibilities within the same context, which uses the theory of convex optimization to minimize quadratic functions with linear constraints. The methods consider possible knowledge available from a given application. A set of linear equality constraints that relate wavelet bases and coefficients with the underlying signal is introduced in the formulation. As a consequence, the formulation turns out to be adequate for the design of lifting steps. The resulting steps are related to the prediction minimizing the detail signal energy and to the update minimizing the l2-norm of the approximation signal gradient. Results are reported for the interpolation methods in terms of PSNR and also, coding results are given for the new update lifting steps.

  3. Lambda-Lifting in Quadratic Time

    DEFF Research Database (Denmark)

    Danvy, Olivier; Schultz, Ulrik Pagh

    2002-01-01

    Lambda-lifting is a program transformation that is used in compilers, partial evaluators, and program transformers. In this article, we show how to reduce its complexity from cubic time to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda-lifting...... that yields the cubic factor in the traditional formulation of lambda-lifting, which is due to Johnsson. This search is carried out by computing a transitive closure. To reduce the complexity of lambda-lifting, we partition the call graph of the source program into strongly connected components, based...... of lambda-lifting from O(n^3) to O(n^2) . where n is the size of the program. Since a lambda-lifter can output programs of size O(n^2), our algorithm is asympotically optimal....

  4. Lambda-Lifting in Quadratic Time

    DEFF Research Database (Denmark)

    Danvy, Olivier; Schultz, Ulrik Pagh

    2003-01-01

    Lambda-lifting is a program transformation that is used in compilers, partial evaluators, and program transformers. In this article, we show how to reduce its complexity from cubic time to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda-lifting...... that yields the cubic factor in the traditional formulation of lambda-lifting, which is due to Johnsson. This search is carried out by computing a transitive closure. To reduce the complexity of lambda-lifting, we partition the call graph of the source program into strongly connected components, based...... of lambda-lifting from O(n^3) to O(n^2) . where n is the size of the program. Since a lambda-lifter can output programs of size O(n^2), our algorithm is asympotically optimal....

  5. Lambda-Lifting in Quadratic Time

    DEFF Research Database (Denmark)

    Danvy, Olivier; Schultz, Ulrik Pagh

    2004-01-01

    Lambda-lifting is a program transformation that is used in compilers, partial evaluators, and program transformers. In this article, we show how to reduce its complexity from cubic time to quadratic time, and we present a flow-sensitive lambda-lifter that also works in quadratic time. Lambda-lifting...... that yields the cubic factor in the traditional formulation of lambda-lifting, which is due to Johnsson. This search is carried out by computing a transitive closure. To reduce the complexity of lambda-lifting, we partition the call graph of the source program into strongly connected components, based...... of lambda-lifting from O(n^3) to O(n^2) . where n is the size of the program. Since a lambda-lifter can output programs of size O(n^2), our algorithm is asympotically optimal....

  6. Temporal quadratic expansion nodal Green's function method

    International Nuclear Information System (INIS)

    Liu Cong; Jing Xingqing; Xu Xiaolin

    2000-01-01

    A new approach is presented to efficiently solve the three-dimensional space-time reactor dynamics equation which overcomes the disadvantages of current methods. In the Temporal Quadratic Expansion Nodal Green's Function Method (TQE/NGFM), the Quadratic Expansion Method (QEM) is used for the temporal solution with the Nodal Green's Function Method (NGFM) employed for the spatial solution. Test calculational results using TQE/NGFM show that its time step size can be 5-20 times larger than that of the Fully Implicit Method (FIM) for similar precision. Additionally, the spatial mesh size with NGFM can be nearly 20 times larger than that using the finite difference method. So, TQE/NGFM is proved to be an efficient reactor dynamics analysis method

  7. Non-negative factor analysis supporting the interpretation of elemental distribution images acquired by XRF

    International Nuclear Information System (INIS)

    Alfeld, Matthias; Falkenberg, Gerald; Wahabzada, Mirwaes; Bauckhage, Christian; Kersting, Kristian; Wellenreuther, Gerd

    2014-01-01

    Stacks of elemental distribution images acquired by XRF can be difficult to interpret, if they contain high degrees of redundancy and components differing in their quantitative but not qualitative elemental composition. Factor analysis, mainly in the form of Principal Component Analysis (PCA), has been used to reduce the level of redundancy and highlight correlations. PCA, however, does not yield physically meaningful representations as they often contain negative values. This limitation can be overcome, by employing factor analysis that is restricted to non-negativity. In this paper we present the first application of the Python Matrix Factorization Module (pymf) on XRF data. This is done in a case study on the painting Saul and David from the studio of Rembrandt van Rijn. We show how the discrimination between two different Co containing compounds with minimum user intervention and a priori knowledge is supported by Non-Negative Matrix Factorization (NMF).

  8. Approximate L0 constrained Non-negative Matrix and Tensor Factorization

    DEFF Research Database (Denmark)

    Mørup, Morten; Madsen, Kristoffer Hougaard; Hansen, Lars Kai

    2008-01-01

    Non-negative matrix factorization (NMF), i.e. V = WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based representation. The NMF decomposition is not in general unique and a part based representation not guaranteed. However...... constraint. In general, solving for a given L0 norm is an NP hard problem thus convex relaxatin to regularization by the L1 norm is often considered, i.e., minimizing ( 1/2 ||V-WHk||^2+lambda|H|_1). An open problem is to control the degree of sparsity imposed. We here demonstrate that a full regularization......, the L1 regularization strength lambda that best approximates a given L0 can be directly accessed and in effect used to control the sparsity of H. The MATLAB code for the NLARS algorithm is available for download....

  9. Robust Nonnegative Matrix Factorization via Joint Graph Laplacian and Discriminative Information for Identifying Differentially Expressed Genes

    Directory of Open Access Journals (Sweden)

    Ling-Yun Dai

    2017-01-01

    Full Text Available Differential expression plays an important role in cancer diagnosis and classification. In recent years, many methods have been used to identify differentially expressed genes. However, the recognition rate and reliability of gene selection still need to be improved. In this paper, a novel constrained method named robust nonnegative matrix factorization via joint graph Laplacian and discriminative information (GLD-RNMF is proposed for identifying differentially expressed genes, in which manifold learning and the discriminative label information are incorporated into the traditional nonnegative matrix factorization model to train the objective matrix. Specifically, L2,1-norm minimization is enforced on both the error function and the regularization term which is robust to outliers and noise in gene data. Furthermore, the multiplicative update rules and the details of convergence proof are shown for the new model. The experimental results on two publicly available cancer datasets demonstrate that GLD-RNMF is an effective method for identifying differentially expressed genes.

  10. Gene Module Identification from Microarray Data Using Nonnegative Independent Component Analysis

    Directory of Open Access Journals (Sweden)

    Ting Gong

    2007-01-01

    Full Text Available Genes mostly interact with each other to form transcriptional modules for performing single or multiple functions. It is important to unravel such transcriptional modules and to determine how disturbances in them may lead to disease. Here, we propose a non-negative independent component analysis (nICA approach for transcriptional module discovery. nICA method utilizes the non-negativity constraint to enforce the independence of biological processes within the participated genes. In such, nICA decomposes the observed gene expression into positive independent components, which fi ts better to the reality of corresponding putative biological processes. In conjunction with nICA modeling, visual statistical data analyzer (VISDA is applied to group genes into modules in latent variable space. We demonstrate the usefulness of the approach through the identification of composite modules from yeast data and the discovery of pathway modules in muscle regeneration.

  11. Walking solitons in quadratic nonlinear media

    OpenAIRE

    Torner Sabata, Lluís; Mazilu, D; Mihalache, Dumitru

    1996-01-01

    We study self-action of light in parametric wave interactions in nonlinear quadratic media. We show the existence of stationary solitons in the presence of Poynting vector beam walk-off or different group velocities between the waves. We discover that the new solitons constitute a two-parameter family, and they exist for different wave intensities and transverse velocities. We discuss the properties of the walking solitons and their experimental implications. Peer Reviewed

  12. Quadratic Term Structure Models in Discrete Time

    OpenAIRE

    Marco Realdon

    2006-01-01

    This paper extends the results on quadratic term structure models in continuos time to the discrete time setting. The continuos time setting can be seen as a special case of the discrete time one. Recursive closed form solutions for zero coupon bonds are provided even in the presence of multiple correlated underlying factors. Pricing bond options requires simple integration. Model parameters may well be time dependent without scuppering such tractability. Model estimation does not require a r...

  13. Least Squares Problems with Absolute Quadratic Constraints

    Directory of Open Access Journals (Sweden)

    R. Schöne

    2012-01-01

    Full Text Available This paper analyzes linear least squares problems with absolute quadratic constraints. We develop a generalized theory following Bookstein's conic-fitting and Fitzgibbon's direct ellipse-specific fitting. Under simple preconditions, it can be shown that a minimum always exists and can be determined by a generalized eigenvalue problem. This problem is numerically reduced to an eigenvalue problem by multiplications of Givens' rotations. Finally, four applications of this approach are presented.

  14. Stochastic Linear Quadratic Optimal Control Problems

    International Nuclear Information System (INIS)

    Chen, S.; Yong, J.

    2001-01-01

    This paper is concerned with the stochastic linear quadratic optimal control problem (LQ problem, for short) for which the coefficients are allowed to be random and the cost functional is allowed to have a negative weight on the square of the control variable. Some intrinsic relations among the LQ problem, the stochastic maximum principle, and the (linear) forward-backward stochastic differential equations are established. Some results involving Riccati equation are discussed as well

  15. Quadratic tracer dynamical models tobacco growth

    International Nuclear Information System (INIS)

    Qiang Jiyi; Hua Cuncai; Wang Shaohua

    2011-01-01

    In order to study the non-uniformly transferring process of some tracer dosages, we assume that the absorption of some tracer by tobacco is a quadratic function of the tracer quantity of the tracer in the case of fast absorption, whereas the exclusion of the tracer from tobacco is a linear function of the tracer quantity in the case of slow exclusion, after the tracer is introduced into tobacco once at zero time. A single-compartment quadratic dynamical model of Logistic type is established for the leaves of tobacco. Then, a two-compartment quadratic dynamical model is established for leaves and calms of the tobacco. Qualitative analysis of the models shows that the tracer applied to the leaves of the tobacco is excluded finally; however, the tracer stays at the tobacco for finite time. Two methods are also given for computing the parameters in the models. Finally, the results of the models are verified by the 32 P experiment for the absorption of tobacco. (authors)

  16. A Finite Continuation Algorithm for Bound Constrained Quadratic Programming

    DEFF Research Database (Denmark)

    Madsen, Kaj; Nielsen, Hans Bruun; Pinar, Mustafa C.

    1999-01-01

    The dual of the strictly convex quadratic programming problem with unit bounds is posed as a linear $\\ell_1$ minimization problem with quadratic terms. A smooth approximation to the linear $\\ell_1$ function is used to obtain a parametric family of piecewise-quadratic approximation problems...

  17. Graphical Solution of the Monic Quadratic Equation with Complex Coefficients

    Science.gov (United States)

    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…

  18. Discrete conservation of nonnegativity for elliptic problems solved by the hp-FEM

    Czech Academy of Sciences Publication Activity Database

    Šolín, P.; Vejchodský, Tomáš; Araiza, R.

    2007-01-01

    Roč. 76, 1-3 (2007), s. 205-210 ISSN 0378-4754 R&D Projects: GA ČR GP201/04/P021 Institutional research plan: CEZ:AV0Z10190503 Keywords : discrete nonnegativity conservation * discrete Green's function * elliptic problems * hp-FEM * higher-order finite element methods * Poisson equation * numerical experimetns Subject RIV: BA - General Mathematics Impact factor: 0.738, year: 2007

  19. Alternating optimization method based on nonnegative matrix factorizations for deep neural networks

    OpenAIRE

    Sakurai, Tetsuya; Imakura, Akira; Inoue, Yuto; Futamura, Yasunori

    2016-01-01

    The backpropagation algorithm for calculating gradients has been widely used in computation of weights for deep neural networks (DNNs). This method requires derivatives of objective functions and has some difficulties finding appropriate parameters such as learning rate. In this paper, we propose a novel approach for computing weight matrices of fully-connected DNNs by using two types of semi-nonnegative matrix factorizations (semi-NMFs). In this method, optimization processes are performed b...

  20. A characterization of trace zero bisymmetric nonnegative $5 \\times 5$ matrices

    OpenAIRE

    Somphotphisut, Somchai; Wiboonton, Keng

    2017-01-01

    Let $\\lambda_1 \\geq \\lambda_2 \\geq \\lambda_3 \\geq \\lambda_4 \\geq \\lambda_5 \\geq -\\lambda_1$ be real numbers such that $\\sum_{i=1}^5 \\lambda_i =0$. In \\cite{oren}, O. Spector prove that a necessary and sufficient condition for $\\lambda_1, \\lambda_2, \\lambda_3, \\lambda_4, \\lambda_5$ to be the eigenvalues of a symmetric nonnegative $5 \\times 5$ matrix is "$\\lambda_2+\\lambda_5

  1. Nonnegative definite EAP and ODF estimation via a unified multi-shell HARDI reconstruction.

    Science.gov (United States)

    Cheng, Jian; Jiang, Tianzi; Deriche, Rachid

    2012-01-01

    In High Angular Resolution Diffusion Imaging (HARDI), Orientation Distribution Function (ODF) and Ensemble Average Propagator (EAP) are two important Probability Density Functions (PDFs) which reflect the water diffusion and fiber orientations. Spherical Polar Fourier Imaging (SPFI) is a recent model-free multi-shell HARDI method which estimates both EAP and ODF from the diffusion signals with multiple b values. As physical PDFs, ODFs and EAPs are nonnegative definite respectively in their domains S2 and R3. However, existing ODF/EAP estimation methods like SPFI seldom consider this natural constraint. Although some works considered the nonnegative constraint on the given discrete samples of ODF/EAP, the estimated ODF/EAP is not guaranteed to be nonnegative definite in the whole continuous domain. The Riemannian framework for ODFs and EAPs has been proposed via the square root parameterization based on pre-estimated ODFs and EAPs by other methods like SPFI. However, there is no work on how to estimate the square root of ODF/EAP called as the wavefuntion directly from diffusion signals. In this paper, based on the Riemannian framework for ODFs/EAPs and Spherical Polar Fourier (SPF) basis representation, we propose a unified model-free multi-shell HARDI method, named as Square Root Parameterized Estimation (SRPE), to simultaneously estimate both the wavefunction of EAPs and the nonnegative definite ODFs and EAPs from diffusion signals. The experiments on synthetic data and real data showed SRPE is more robust to noise and has better EAP reconstruction than SPFI, especially for EAP profiles at large radius.

  2. MR-NTD: Manifold Regularization Nonnegative Tucker Decomposition for Tensor Data Dimension Reduction and Representation.

    Science.gov (United States)

    Li, Xutao; Ng, Michael K; Cong, Gao; Ye, Yunming; Wu, Qingyao

    2017-08-01

    With the advancement of data acquisition techniques, tensor (multidimensional data) objects are increasingly accumulated and generated, for example, multichannel electroencephalographies, multiview images, and videos. In these applications, the tensor objects are usually nonnegative, since the physical signals are recorded. As the dimensionality of tensor objects is often very high, a dimension reduction technique becomes an important research topic of tensor data. From the perspective of geometry, high-dimensional objects often reside in a low-dimensional submanifold of the ambient space. In this paper, we propose a new approach to perform the dimension reduction for nonnegative tensor objects. Our idea is to use nonnegative Tucker decomposition (NTD) to obtain a set of core tensors of smaller sizes by finding a common set of projection matrices for tensor objects. To preserve geometric information in tensor data, we employ a manifold regularization term for the core tensors constructed in the Tucker decomposition. An algorithm called manifold regularization NTD (MR-NTD) is developed to solve the common projection matrices and core tensors in an alternating least squares manner. The convergence of the proposed algorithm is shown, and the computational complexity of the proposed method scales linearly with respect to the number of tensor objects and the size of the tensor objects, respectively. These theoretical results show that the proposed algorithm can be efficient. Extensive experimental results have been provided to further demonstrate the effectiveness and efficiency of the proposed MR-NTD algorithm.

  3. An Analysis and Application of Fast Nonnegative Orthogonal Matching Pursuit for Image Categorization in Deep Networks

    Directory of Open Access Journals (Sweden)

    Bo Wang

    2015-01-01

    Full Text Available Nonnegative orthogonal matching pursuit (NOMP has been proven to be a more stable encoder for unsupervised sparse representation learning. However, previous research has shown that NOMP is suboptimal in terms of computational cost, as the coefficients selection and refinement using nonnegative least squares (NNLS have been divided into two separate steps. It is found that this problem severely reduces the efficiency of encoding for large-scale image patches. In this work, we study fast nonnegative OMP (FNOMP as an efficient encoder which can be accelerated by the implementation of QR factorization and iterations of coefficients in deep networks for full-size image categorization task. It is analyzed and demonstrated that using relatively simple gain-shape vector quantization for training dictionary, FNOMP not only performs more efficiently than NOMP for encoding but also significantly improves the classification accuracy compared to OMP based algorithm. In addition, FNOMP based algorithm is superior to other state-of-the-art methods on several publicly available benchmarks, that is, Oxford Flowers, UIUC-Sports, and Caltech101.

  4. Non-negative Feynman endash Kac kernels in Schroedinger close-quote s interpolation problem

    International Nuclear Information System (INIS)

    Blanchard, P.; Garbaczewski, P.; Olkiewicz, R.

    1997-01-01

    The local formulations of the Markovian interpolating dynamics, which is constrained by the prescribed input-output statistics data, usually utilize strictly positive Feynman endash Kac kernels. This implies that the related Markov diffusion processes admit vanishing probability densities only at the boundaries of the spatial volume confining the process. We discuss an extension of the framework to encompass singular potentials and associated non-negative Feynman endash Kac-type kernels. It allows us to deal with a class of continuous interpolations admitted by general non-negative solutions of the Schroedinger boundary data problem. The resulting nonstationary stochastic processes are capable of both developing and destroying nodes (zeros) of probability densities in the course of their evolution, also away from the spatial boundaries. This observation conforms with the general mathematical theory (due to M. Nagasawa and R. Aebi) that is based on the notion of multiplicative functionals, extending in turn the well known Doob close-quote s h-transformation technique. In view of emphasizing the role of the theory of non-negative solutions of parabolic partial differential equations and the link with open-quotes Wiener exclusionclose quotes techniques used to evaluate certain Wiener functionals, we give an alternative insight into the issue, that opens a transparent route towards applications.copyright 1997 American Institute of Physics

  5. Analysis Sparse Representation for Nonnegative Signals Based on Determinant Measure by DC Programming

    Directory of Open Access Journals (Sweden)

    Yujie Li

    2018-01-01

    Full Text Available Analysis sparse representation has recently emerged as an alternative approach to the synthesis sparse model. Most existing algorithms typically employ the l0-norm, which is generally NP-hard. Other existing algorithms employ the l1-norm to relax the l0-norm, which sometimes cannot promote adequate sparsity. Most of these existing algorithms focus on general signals and are not suitable for nonnegative signals. However, many signals are necessarily nonnegative such as spectral data. In this paper, we present a novel and efficient analysis dictionary learning algorithm for nonnegative signals with the determinant-type sparsity measure which is convex and differentiable. The analysis sparse representation can be cast in three subproblems, sparse coding, dictionary update, and signal update, because the determinant-type sparsity measure would result in a complex nonconvex optimization problem, which cannot be easily solved by standard convex optimization methods. Therefore, in the proposed algorithms, we use a difference of convex (DC programming scheme for solving the nonconvex problem. According to our theoretical analysis and simulation study, the main advantage of the proposed algorithm is its greater dictionary learning efficiency, particularly compared with state-of-the-art algorithms. In addition, our proposed algorithm performs well in image denoising.

  6. Quadratic stochastic operators: Results and open problems

    International Nuclear Information System (INIS)

    Ganikhodzhaev, R.N.; Rozikov, U.A.

    2009-03-01

    The history of the quadratic stochastic operators can be traced back to the work of S. Bernshtein (1924). For more than 80 years this theory has been developed and many papers were published. In recent years it has again become of interest in connection with numerous applications in many branches of mathematics, biology and physics. But most results of the theory were published in non English journals, full text of which are not accessible. In this paper we give a brief description of the results and discuss several open problems. (author)

  7. Sequential Quadratic Programming Algorithms for Optimization

    Science.gov (United States)

    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

  8. On a quadratic inverse eigenvalue problem

    International Nuclear Information System (INIS)

    Cai, Yunfeng; Xu, Shufang

    2009-01-01

    This paper concerns the quadratic inverse eigenvalue problem (QIEP) of constructing real symmetric matrices M, C and K of size n × n, with M nonsingular, so that the quadratic matrix polynomial Q(λ) ≡ λ 2 M + λC + K has a completely prescribed set of eigenvalues and eigenvectors. It is shown via construction that the QIEP has a solution if and only if r 0, where r and δ are computable from the prescribed spectral data. A necessary and sufficient condition for the existence of a solution to the QIEP with M being positive definite is also established in a constructive way. Furthermore, two algorithms are developed: one is to solve the QIEP; another is to find a particular solution to the QIEP with the leading coefficient matrix being positive definite, which also provides us an approach to a simultaneous reduction of real symmetric matrix triple (M, C, K) by real congruence. Numerical results show that the two algorithms are feasible and numerically reliable

  9. Phase space eigenfunctions of multidimensional quadratic Hamiltonians

    International Nuclear Information System (INIS)

    Dodonov, V.V.; Man'ko, V.I.

    1986-01-01

    We obtain the explicit expressions for phace space eigenfunctions (PSE),i.e. Weyl's symbols of dyadic operators like vertical stroken> ,vertical strokem>, being the solution of the Schroedinger equation with the Hamiltonian which is a quite arbitrary multidimensional quadratic form of the operators of Cartesian coordinates and conjugated to them momenta with time-dependent coefficients. It is shown that for an arbitrary quadratic Hamiltonian one can always construct the set of completely factorized PSE which are products of N factors, each factor being dependent only on two arguments for nnot=m and on a single argument for n=m. These arguments are nothing but constants of motion of the correspondent classical system. PSE are expressed in terms of the associated Laguerre polynomials in the case of a discrete spectrum and in terms of the Airy functions in the continuous spectrum case. Three examples are considered: a harmonic oscillator with a time-dependent frequency, a charged particle in a nonstationary uniform magnetic field, and a particle in a time-dependent uniform potential field. (orig.)

  10. Quadratic forms for Feynman-Kac semigroups

    International Nuclear Information System (INIS)

    Hibey, Joseph L.; Charalambous, Charalambos D.

    2006-01-01

    Some problems in a stochastic setting often involve the need to evaluate the Feynman-Kac formula that follows from models described in terms of stochastic differential equations. Equivalent representations in terms of partial differential equations are also of interest, and these establish the well-known connection between probabilistic and deterministic formulations of these problems. In this Letter, this connection is studied in terms of the quadratic form associated with the Feynman-Kac semigroup. The probability measures that naturally arise in this approach, and thus define how Brownian motion is killed at a specified rate while exiting a set, are interpreted as a random time change of the original stochastic differential equation. Furthermore, since random time changes alter the diffusion coefficients in stochastic differential equations while Girsanov-type measure transformations alter their drift coefficients, their simultaneous use should lead to more tractable solutions for some classes of problems. For example, the minimization of some quadratic forms leads to solutions that satisfy certain partial differential equations and, therefore, the techniques discussed provide a variational approach for finding these solutions

  11. Facets for the Cardinality Constrained Quadratic Knapsack Problem and the Quadratic Selective Travelling Salesman Problem

    DEFF Research Database (Denmark)

    Mak, Vicky; Thomadsen, Tommy

    2004-01-01

    A well-known extension of the Travelling Salesman Problem (TSP) is the Selective (or Prize-collecting) TSP: In addition to the edge-costs, each node has an associated reward (denoted the node-reward) and instead of visiting all nodes, only profitable nodes are visited. The Quadratic Selective TSP...

  12. A locally conservative non-negative finite element formulation for anisotropic advective-diffusive-reactive systems

    Science.gov (United States)

    Mudunuru, M. K.; Shabouei, M.; Nakshatrala, K.

    2015-12-01

    Advection-diffusion-reaction (ADR) equations appear in various areas of life sciences, hydrogeological systems, and contaminant transport. Obtaining stable and accurate numerical solutions can be challenging as the underlying equations are coupled, nonlinear, and non-self-adjoint. Currently, there is neither a robust computational framework available nor a reliable commercial package known that can handle various complex situations. Herein, the objective of this poster presentation is to present a novel locally conservative non-negative finite element formulation that preserves the underlying physical and mathematical properties of a general linear transient anisotropic ADR equation. In continuous setting, governing equations for ADR systems possess various important properties. In general, all these properties are not inherited during finite difference, finite volume, and finite element discretizations. The objective of this poster presentation is two fold: First, we analyze whether the existing numerical formulations (such as SUPG and GLS) and commercial packages provide physically meaningful values for the concentration of the chemical species for various realistic benchmark problems. Furthermore, we also quantify the errors incurred in satisfying the local and global species balance for two popular chemical kinetics schemes: CDIMA (chlorine dioxide-iodine-malonic acid) and BZ (Belousov--Zhabotinsky). Based on these numerical simulations, we show that SUPG and GLS produce unphysical values for concentration of chemical species due to the violation of the non-negative constraint, contain spurious node-to-node oscillations, and have large errors in local and global species balance. Second, we proposed a novel finite element formulation to overcome the above difficulties. The proposed locally conservative non-negative computational framework based on low-order least-squares finite elements is able to preserve these underlying physical and mathematical properties

  13. Sparse modeling of EELS and EDX spectral imaging data by nonnegative matrix factorization

    Energy Technology Data Exchange (ETDEWEB)

    Shiga, Motoki, E-mail: shiga_m@gifu-u.ac.jp [Department of Electrical, Electronic and Computer Engineering, Gifu University, 1-1, Yanagido, Gifu 501-1193 (Japan); Tatsumi, Kazuyoshi; Muto, Shunsuke [Advanced Measurement Technology Center, Institute of Materials and Systems for Sustainability, Nagoya University, Chikusa-ku, Nagoya 464-8603 (Japan); Tsuda, Koji [Graduate School of Frontier Sciences, University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa 277-8561 (Japan); Center for Materials Research by Information Integration, National Institute for Materials Science, 1-2-1 Sengen, Tsukuba 305-0047 (Japan); Biotechnology Research Institute for Drug Discovery, National Institute of Advanced Industrial Science and Technology, 2-4-7 Aomi Koto-ku, Tokyo 135-0064 (Japan); Yamamoto, Yuta [High-Voltage Electron Microscope Laboratory, Institute of Materials and Systems for Sustainability, Nagoya University, Chikusa-ku, Nagoya 464-8603 (Japan); Mori, Toshiyuki [Environment and Energy Materials Division, National Institute for Materials Science, 1-1 Namiki, Tsukuba 305-0044 (Japan); Tanji, Takayoshi [Division of Materials Research, Institute of Materials and Systems for Sustainability, Nagoya University, Chikusa-ku, Nagoya 464-8603 (Japan)

    2016-11-15

    Advances in scanning transmission electron microscopy (STEM) techniques have enabled us to automatically obtain electron energy-loss (EELS)/energy-dispersive X-ray (EDX) spectral datasets from a specified region of interest (ROI) at an arbitrary step width, called spectral imaging (SI). Instead of manually identifying the potential constituent chemical components from the ROI and determining the chemical state of each spectral component from the SI data stored in a huge three-dimensional matrix, it is more effective and efficient to use a statistical approach for the automatic resolution and extraction of the underlying chemical components. Among many different statistical approaches, we adopt a non-negative matrix factorization (NMF) technique, mainly because of the natural assumption of non-negative values in the spectra and cardinalities of chemical components, which are always positive in actual data. This paper proposes a new NMF model with two penalty terms: (i) an automatic relevance determination (ARD) prior, which optimizes the number of components, and (ii) a soft orthogonal constraint, which clearly resolves each spectrum component. For the factorization, we further propose a fast optimization algorithm based on hierarchical alternating least-squares. Numerical experiments using both phantom and real STEM-EDX/EELS SI datasets demonstrate that the ARD prior successfully identifies the correct number of physically meaningful components. The soft orthogonal constraint is also shown to be effective, particularly for STEM-EELS SI data, where neither the spatial nor spectral entries in the matrices are sparse. - Highlights: • Automatic resolution of chemical components from spectral imaging is considered. • We propose a new non-negative matrix factorization with two new penalties. • The first penalty is sparseness to choose the number of components from data. • Experimental results with real data demonstrate effectiveness of our method.

  14. Quadratic residues and non-residues selected topics

    CERN Document Server

    Wright, Steve

    2016-01-01

    This book offers an account of the classical theory of quadratic residues and non-residues with the goal of using that theory as a lens through which to view the development of some of the fundamental methods employed in modern elementary, algebraic, and analytic number theory. The first three chapters present some basic facts and the history of quadratic residues and non-residues and discuss various proofs of the Law of Quadratic Reciprosity in depth, with an emphasis on the six proofs that Gauss published. The remaining seven chapters explore some interesting applications of the Law of Quadratic Reciprocity, prove some results concerning the distribution and arithmetic structure of quadratic residues and non-residues, provide a detailed proof of Dirichlet’s Class-Number Formula, and discuss the question of whether quadratic residues are randomly distributed. The text is a valuable resource for graduate and advanced undergraduate students as well as for mathematicians interested in number theory.

  15. The boundaries of golden-mean Siegel disks in the complex quadratic H\\'enon family are not smooth

    OpenAIRE

    Yampolsky, Michael; Yang, Jonguk

    2016-01-01

    As was recently shown by the first author and others, golden-mean Siegel disks of sufficiently dissipative complex quadratic H\\'enon maps are bounded by topological circles. In this paper we investigate the geometric properties of such curves, and demonstrate that they cannot be $C^1$-smooth.

  16. Reduction of Non-stationary Noise using a Non-negative Latent Variable Decomposition

    DEFF Research Database (Denmark)

    Schmidt, Mikkel Nørgaard; Larsen, Jan

    2008-01-01

    We present a method for suppression of non-stationary noise in single channel recordings of speech. The method is based on a non-negative latent variable decomposition model for the speech and noise signals, learned directly from a noisy mixture. In non-speech regions an over complete basis...... is learned for the noise that is then used to jointly estimate the speech and the noise from the mixture. We compare the method to the classical spectral subtraction approach, where the noise spectrum is estimated as the average over non-speech frames. The proposed method significantly outperforms...

  17. On the Equivalence of Nonnegative Matrix Factorization and K-means- Spectral Clustering

    Energy Technology Data Exchange (ETDEWEB)

    Ding, Chris; He, Xiaofeng; Simon, Horst D.; Jin, Rong

    2005-12-04

    We provide a systematic analysis of nonnegative matrix factorization (NMF) relating to data clustering. We generalize the usual X = FG{sup T} decomposition to the symmetric W = HH{sup T} and W = HSH{sup T} decompositions. We show that (1) W = HH{sup T} is equivalent to Kernel K-means clustering and the Laplacian-based spectral clustering. (2) X = FG{sup T} is equivalent to simultaneous clustering of rows and columns of a bipartite graph. We emphasizes the importance of orthogonality in NMF and soft clustering nature of NMF. These results are verified with experiments on face images and newsgroups.

  18. KPII: Cauchy-Jost function, Darboux transformations and totally nonnegative matrices

    Science.gov (United States)

    Boiti, M.; Pempinelli, F.; Pogrebkov, A. K.

    2017-07-01

    Direct definition of the Cauchy-Jost (known also as Cauchy-Baker-Akhiezer) function is given in the case of a pure solitonic solution. Properties of this function are discussed in detail using the Kadomtsev-Petviashvili II equation as an example. This enables formulation of the Darboux transformations in terms of the Cauchy-Jost function and classification of these transformations. Action of Darboux transformations on Grassmanians—i.e. on the space of soliton parameters—is derived and the relation of the Darboux transformations with the property of total nonnegativity of elements of corresponding Grassmanians is discussed. To the memory of our friend and colleague Peter P Kulish

  19. Spectral multipliers on spaces of distributions associated with non-negative self-adjoint operators

    DEFF Research Database (Denmark)

    Georgiadis, Athanasios; Nielsen, Morten

    2018-01-01

    and Triebel–Lizorkin spaces with full range of indices is established too. As an application, we obtain equivalent norm characterizations for the spaces mentioned above. Non-classical spaces as well as Lebesgue, Hardy, (generalized) Sobolev and Lipschitz spaces are also covered by our approach.......We consider spaces of homogeneous type associated with a non-negative self-adjoint operator whose heat kernel satisfies certain upper Gaussian bounds. Spectral multipliers are introduced and studied on distributions associated with this operator. The boundedness of spectral multipliers on Besov...

  20. Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation

    Directory of Open Access Journals (Sweden)

    Philippe Dumas

    2007-01-01

    Full Text Available We analyse the asymptotic behaviour in the mean of a non-commutative rational series, which originates from differential cryptanalysis, using tools from probability theory, and from analytic number theory. We derive a Fourier representation of a first-order summation function obtained by interpreting this rational series as a non-classical rational sequence via the octal numeration system. The method is applicable to a wide class of sequences rational with respect to a numeration system essentially under the condition that they admit a linear representation with nonnegative coefficients.

  1. Fast Bayesian Non-Negative Matrix Factorisation and Tri-Factorisation

    DEFF Research Database (Denmark)

    Brouwer, Thomas; Frellsen, Jes; Liò, Pietro

    We present a fast variational Bayesian algorithm for performing non-negative matrix factorisation and tri-factorisation. We show that our approach achieves faster convergence per iteration and timestep (wall-clock) than Gibbs sampling and non-probabilistic approaches, and do not require additional...... samples to estimate the posterior. We show that in particular for matrix tri-factorisation convergence is difficult, but our variational Bayesian approach offers a fast solution, allowing the tri-factorisation approach to be used more effectively....

  2. A Necessary Condition for the Spectrum of Nonnegative Symmetric $ 5 \\times 5 $ Matrices

    OpenAIRE

    Loewy, Raphael; Spector, Oren

    2016-01-01

    Let $A$ be a nonnegative symmetric $ 5 \\times 5 $ matrix with eigenvalues $ \\lambda_1 \\geq \\lambda_2 \\geq \\lambda_3 \\geq \\lambda_4 \\geq \\lambda_5 $. We show that if $ \\sum_{i=1}^{5} \\lambda_{i} \\geq \\frac{1}{2} \\lambda_1 $ then $ \\lambda_3 \\leq \\sum_{i=1}^{5} \\lambda_{i} $. McDonald and Neumann showed that $ \\lambda_1 + \\lambda_3 + \\lambda_4 \\geq 0 $. Let $ \\sigma = \\left( \\lambda_1, \\lambda_2, \\lambda_3, \\lambda_4, \\lambda_5 \\right) $ be a list of decreasing real numbers satisfying: 1. $ \\su...

  3. Exact cancellation of quadratic divergences in top condensation models

    International Nuclear Information System (INIS)

    Blumhofer, A.

    1995-01-01

    We discuss the hierarchy problem and the corresponding quadratic divergences in the top mode Standard Model. Quadratic divergences appear at each order 1/N c since fermionic and bosonic contributions are of different order 1/N c . It is shown that the full dynamical system to all orders in 1/N c admits a solution, where the sum of all quadratic divergent contributions disappears. ((orig.))

  4. Distance matrices and quadratic embedding of graphs

    Directory of Open Access Journals (Sweden)

    Nobuaki Obata

    2018-04-01

    Full Text Available A connected graph is said to be of QE class if it admits  a quadratic embedding in a Hilbert space, or equivalently, if the distance matrix is conditionally negative definite. Several criteria for a graph to be of QE class are derived from the point of view of graph operations. For a quantitative criterion the QE constant is introduced and concrete examples are shown with explicit calculation. If the distance matrix admits a constant row sum, the QE constant coincides with the second largest eigenvalue of the distance matrix. The QE constants are determined for all graphs on $n$ vertices with $n\\le5$, among which two are not of QE class.

  5. Low-rank quadratic semidefinite programming

    KAUST Repository

    Yuan, Ganzhao

    2013-04-01

    Low rank matrix approximation is an attractive model in large scale machine learning problems, because it can not only reduce the memory and runtime complexity, but also provide a natural way to regularize parameters while preserving learning accuracy. In this paper, we address a special class of nonconvex quadratic matrix optimization problems, which require a low rank positive semidefinite solution. Despite their non-convexity, we exploit the structure of these problems to derive an efficient solver that converges to their local optima. Furthermore, we show that the proposed solution is capable of dramatically enhancing the efficiency and scalability of a variety of concrete problems, which are of significant interest to the machine learning community. These problems include the Top-k Eigenvalue problem, Distance learning and Kernel learning. Extensive experiments on UCI benchmarks have shown the effectiveness and efficiency of our proposed method. © 2012.

  6. Polarization Nonlinear Optics of Quadratically Nonlinear Azopolymers

    International Nuclear Information System (INIS)

    Konorov, S.O.; Akimov, D.A.; Ivanov, A.A.; Petrov, A.N.; Alfimov, M.V.; Yakimanskii, A.V.; Smirnov, N.N.; Ivanova, V.N.; Kudryavtsev, V.V.; Podshivalov, A.A.; Sokolova, I.M.; Zheltikov, A.M.

    2005-01-01

    The polarization properties of second harmonic and sum-frequency signals generated by femtosecond laser pulses in films of polymers containing covalent groups of an azobenzothiazole chromophore polarized by an external electric field are investigated. It is shown that the methods of polarization nonlinear optics make it possible to determine the structure of oriented molecular dipoles and reveal important properties of the motion of collectivized πelectrons in organic molecules with strong optical nonlinearities. The polarization measurements show that the tensor of quadratic nonlinear optical susceptibility of chromophore fragments oriented by an external field in macromolecules of the noted azopolymers has a degenerate form. This is indicative of a predominantly one-dimensional character of motion of collectivized π electrons along an extended group of atoms in such molecules

  7. Gain scheduled linear quadratic control for quadcopter

    Science.gov (United States)

    Okasha, M.; Shah, J.; Fauzi, W.; Hanouf, Z.

    2017-12-01

    This study exploits the dynamics and control of quadcopters using Linear Quadratic Regulator (LQR) control approach. The quadcopter’s mathematical model is derived using the Newton-Euler method. It is a highly manoeuvrable, nonlinear, coupled with six degrees of freedom (DOF) model, which includes aerodynamics and detailed gyroscopic moments that are often ignored in many literatures. The linearized model is obtained and characterized by the heading angle (i.e. yaw angle) of the quadcopter. The adopted control approach utilizes LQR method to track several reference trajectories including circle and helix curves with significant variation in the yaw angle. The controller is modified to overcome difficulties related to the continuous changes in the operating points and eliminate chattering and discontinuity that is observed in the control input signal. Numerical non-linear simulations are performed using MATLAB and Simulink to illustrate to accuracy and effectiveness of the proposed controller.

  8. Charged black holes in quadratic gravity

    International Nuclear Information System (INIS)

    Matyjasek, Jerzy; Tryniecki, Dariusz

    2004-01-01

    Iterative solutions to fourth-order gravity describing static and electrically charged black holes are constructed. The obtained solutions are parametrized by two integration constants which are related to the electric charge and the exact location of the event horizon. Special emphasis is put on the extremal black holes. It is explicitly demonstrated that in the extremal limit the exact location of the (degenerate) event horizon is given by r + =|e|. Similarly to the classical Reissner-Nordstroem solution, the near-horizon geometry of the charged black holes in quadratic gravity, when expanded into the whole manifold, is simply that of Bertotti and Robinson. Similar considerations have been carried out for boundary conditions of the second type which employ the electric charge and the mass of the system as seen by a distant observer. The relations between results obtained within the framework of each method are briefly discussed

  9. Lambda-Lifting in Quadratic Time

    DEFF Research Database (Denmark)

    Danvy, Olivier; Schultz, Ulrik Pagh

    2002-01-01

    Lambda-lifting is a program transformation used in compilers and in partial evaluators and that operates in cubic time. In this article, we show how to reduce this complexity to quadratic time. Lambda-lifting transforms a block-structured program into a set of recursive equations, one for each...... local function in the source program. Each equation carries extra parameters to account for the free variables of the corresponding local function and of all its callees. It is the search for these extra parameters that yields the cubic factor in the traditional formulation of lambda-lifting, which...... is not needed. We therefore simplify the search for extra parameters by treating each strongly connected component instead of each function as a unit, thereby reducing the time complexity of lambda-lifting from O(n 3 log n)toO(n2 log n), where n is the size of the program. Since a lambda-lifter can output...

  10. Low-rank quadratic semidefinite programming

    KAUST Repository

    Yuan, Ganzhao; Zhang, Zhenjie; Ghanem, Bernard; Hao, Zhifeng

    2013-01-01

    Low rank matrix approximation is an attractive model in large scale machine learning problems, because it can not only reduce the memory and runtime complexity, but also provide a natural way to regularize parameters while preserving learning accuracy. In this paper, we address a special class of nonconvex quadratic matrix optimization problems, which require a low rank positive semidefinite solution. Despite their non-convexity, we exploit the structure of these problems to derive an efficient solver that converges to their local optima. Furthermore, we show that the proposed solution is capable of dramatically enhancing the efficiency and scalability of a variety of concrete problems, which are of significant interest to the machine learning community. These problems include the Top-k Eigenvalue problem, Distance learning and Kernel learning. Extensive experiments on UCI benchmarks have shown the effectiveness and efficiency of our proposed method. © 2012.

  11. A ''quadratized'' augmented plane wave method

    International Nuclear Information System (INIS)

    Smrcka, L.

    1982-02-01

    The exact radial solution inside the muffin-tin sphere is replaced by its Taylor expansion with respect to the energy, truncated after the quadratic term. Making use of it the energy independent augmented plane waves are formed which lead to the secular equations linear in energy. The method resembles the currently used linearized APW method but yields higher accuracy. The analysis of solution inside one muffin-tin sphere shows that the eigenvalue error is proportional to (E-E 0 ) 6 as compared with (E-E 0 ) 4 for LAPW. The error of eigenfunctions is (E-E 0 ) 3 ((E-E 0 ) 2 for LAPW). These conclusions are confirmed by direct numerical calculation of band structure of Cu and Al. (author)

  12. Quadratic gravity in first order formalism

    Energy Technology Data Exchange (ETDEWEB)

    Alvarez, Enrique; Anero, Jesus; Gonzalez-Martin, Sergio, E-mail: enrique.alvarez@uam.es, E-mail: jesusanero@gmail.com, E-mail: sergio.gonzalez.martin@uam.es [Departamento de Física Teórica and Instituto de Física Teórica (IFT-UAM/CSIC), Universidad Autónoma de Madrid, Cantoblanco, 28049, Madrid (Spain)

    2017-10-01

    We consider the most general action for gravity which is quadratic in curvature. In this case first order and second order formalisms are not equivalent. This framework is a good candidate for a unitary and renormalizable theory of the gravitational field; in particular, there are no propagators falling down faster than 1/ p {sup 2}. The drawback is of course that the parameter space of the theory is too big, so that in many cases will be far away from a theory of gravity alone. In order to analyze this issue, the interaction between external sources was examined in some detail. We find that this interaction is conveyed mainly by propagation of the three-index connection field. At any rate the theory as it stands is in the conformal invariant phase; only when Weyl invariance is broken through the coupling to matter can an Einstein-Hilbert term (and its corresponding Planck mass scale) be generated by quantum corrections.

  13. Large-scale sequential quadratic programming algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Eldersveld, S.K.

    1992-09-01

    The problem addressed is the general nonlinear programming problem: finding a local minimizer for a nonlinear function subject to a mixture of nonlinear equality and inequality constraints. The methods studied are in the class of sequential quadratic programming (SQP) algorithms, which have previously proved successful for problems of moderate size. Our goal is to devise an SQP algorithm that is applicable to large-scale optimization problems, using sparse data structures and storing less curvature information but maintaining the property of superlinear convergence. The main features are: 1. The use of a quasi-Newton approximation to the reduced Hessian of the Lagrangian function. Only an estimate of the reduced Hessian matrix is required by our algorithm. The impact of not having available the full Hessian approximation is studied and alternative estimates are constructed. 2. The use of a transformation matrix Q. This allows the QP gradient to be computed easily when only the reduced Hessian approximation is maintained. 3. The use of a reduced-gradient form of the basis for the null space of the working set. This choice of basis is more practical than an orthogonal null-space basis for large-scale problems. The continuity condition for this choice is proven. 4. The use of incomplete solutions of quadratic programming subproblems. Certain iterates generated by an active-set method for the QP subproblem are used in place of the QP minimizer to define the search direction for the nonlinear problem. An implementation of the new algorithm has been obtained by modifying the code MINOS. Results and comparisons with MINOS and NPSOL are given for the new algorithm on a set of 92 test problems.

  14. Computation of a numerically satisfactory pair of solutions of the differential equation for conical functions of non-negative integer orders

    NARCIS (Netherlands)

    T.M. Dunster (Mark); A. Gil (Amparo); J. Segura (Javier); N.M. Temme (Nico)

    2014-01-01

    textabstractWe consider the problem of computing satisfactory pair of solutions of the differential equation for Legendre functions of non-negative integer order $\\mu$ and degree $-\\frac12+i\\tau$, where $\\tau$ is a non-negative real parameter. Solutions of this equation are the conical functions

  15. Single-Trial Decoding of Bistable Perception Based on Sparse Nonnegative Tensor Decomposition

    Science.gov (United States)

    Wang, Zhisong; Maier, Alexander; Logothetis, Nikos K.; Liang, Hualou

    2008-01-01

    The study of the neuronal correlates of the spontaneous alternation in perception elicited by bistable visual stimuli is promising for understanding the mechanism of neural information processing and the neural basis of visual perception and perceptual decision-making. In this paper, we develop a sparse nonnegative tensor factorization-(NTF)-based method to extract features from the local field potential (LFP), collected from the middle temporal (MT) visual cortex in a macaque monkey, for decoding its bistable structure-from-motion (SFM) perception. We apply the feature extraction approach to the multichannel time-frequency representation of the intracortical LFP data. The advantages of the sparse NTF-based feature extraction approach lies in its capability to yield components common across the space, time, and frequency domains yet discriminative across different conditions without prior knowledge of the discriminating frequency bands and temporal windows for a specific subject. We employ the support vector machines (SVMs) classifier based on the features of the NTF components for single-trial decoding the reported perception. Our results suggest that although other bands also have certain discriminability, the gamma band feature carries the most discriminative information for bistable perception, and that imposing the sparseness constraints on the nonnegative tensor factorization improves extraction of this feature. PMID:18528515

  16. Online multi-modal robust non-negative dictionary learning for visual tracking.

    Science.gov (United States)

    Zhang, Xiang; Guan, Naiyang; Tao, Dacheng; Qiu, Xiaogang; Luo, Zhigang

    2015-01-01

    Dictionary learning is a method of acquiring a collection of atoms for subsequent signal representation. Due to its excellent representation ability, dictionary learning has been widely applied in multimedia and computer vision. However, conventional dictionary learning algorithms fail to deal with multi-modal datasets. In this paper, we propose an online multi-modal robust non-negative dictionary learning (OMRNDL) algorithm to overcome this deficiency. Notably, OMRNDL casts visual tracking as a dictionary learning problem under the particle filter framework and captures the intrinsic knowledge about the target from multiple visual modalities, e.g., pixel intensity and texture information. To this end, OMRNDL adaptively learns an individual dictionary, i.e., template, for each modality from available frames, and then represents new particles over all the learned dictionaries by minimizing the fitting loss of data based on M-estimation. The resultant representation coefficient can be viewed as the common semantic representation of particles across multiple modalities, and can be utilized to track the target. OMRNDL incrementally learns the dictionary and the coefficient of each particle by using multiplicative update rules to respectively guarantee their non-negativity constraints. Experimental results on a popular challenging video benchmark validate the effectiveness of OMRNDL for visual tracking in both quantity and quality.

  17. Non-negative matrix factorization by maximizing correntropy for cancer clustering

    KAUST Repository

    Wang, Jim Jing-Yan; Wang, Xiaolei; Gao, Xin

    2013-01-01

    Background: Non-negative matrix factorization (NMF) has been shown to be a powerful tool for clustering gene expression data, which are widely used to classify cancers. NMF aims to find two non-negative matrices whose product closely approximates the original matrix. Traditional NMF methods minimize either the l2 norm or the Kullback-Leibler distance between the product of the two matrices and the original matrix. Correntropy was recently shown to be an effective similarity measurement due to its stability to outliers or noise.Results: We propose a maximum correntropy criterion (MCC)-based NMF method (NMF-MCC) for gene expression data-based cancer clustering. Instead of minimizing the l2 norm or the Kullback-Leibler distance, NMF-MCC maximizes the correntropy between the product of the two matrices and the original matrix. The optimization problem can be solved by an expectation conditional maximization algorithm.Conclusions: Extensive experiments on six cancer benchmark sets demonstrate that the proposed method is significantly more accurate than the state-of-the-art methods in cancer clustering. 2013 Wang et al.; licensee BioMed Central Ltd.

  18. Impact of the Choice of Normalization Method on Molecular Cancer Class Discovery Using Nonnegative Matrix Factorization.

    Science.gov (United States)

    Yang, Haixuan; Seoighe, Cathal

    2016-01-01

    Nonnegative Matrix Factorization (NMF) has proved to be an effective method for unsupervised clustering analysis of gene expression data. By the nonnegativity constraint, NMF provides a decomposition of the data matrix into two matrices that have been used for clustering analysis. However, the decomposition is not unique. This allows different clustering results to be obtained, resulting in different interpretations of the decomposition. To alleviate this problem, some existing methods directly enforce uniqueness to some extent by adding regularization terms in the NMF objective function. Alternatively, various normalization methods have been applied to the factor matrices; however, the effects of the choice of normalization have not been carefully investigated. Here we investigate the performance of NMF for the task of cancer class discovery, under a wide range of normalization choices. After extensive evaluations, we observe that the maximum norm showed the best performance, although the maximum norm has not previously been used for NMF. Matlab codes are freely available from: http://maths.nuigalway.ie/~haixuanyang/pNMF/pNMF.htm.

  19. Aspect-Aided Dynamic Non-Negative Sparse Representation-Based Microwave Image Classification

    Directory of Open Access Journals (Sweden)

    Xinzheng Zhang

    2016-09-01

    Full Text Available Classification of target microwave images is an important application in much areas such as security, surveillance, etc. With respect to the task of microwave image classification, a recognition algorithm based on aspect-aided dynamic non-negative least square (ADNNLS sparse representation is proposed. Firstly, an aspect sector is determined, the center of which is the estimated aspect angle of the testing sample. The training samples in the aspect sector are divided into active atoms and inactive atoms by smooth self-representative learning. Secondly, for each testing sample, the corresponding active atoms are selected dynamically, thereby establishing dynamic dictionary. Thirdly, the testing sample is represented with ℓ 1 -regularized non-negative sparse representation under the corresponding dynamic dictionary. Finally, the class label of the testing sample is identified by use of the minimum reconstruction error. Verification of the proposed algorithm was conducted using the Moving and Stationary Target Acquisition and Recognition (MSTAR database which was acquired by synthetic aperture radar. Experiment results validated that the proposed approach was able to capture the local aspect characteristics of microwave images effectively, thereby improving the classification performance.

  20. Non-negative matrix factorization by maximizing correntropy for cancer clustering

    KAUST Repository

    Wang, Jim Jing-Yan

    2013-03-24

    Background: Non-negative matrix factorization (NMF) has been shown to be a powerful tool for clustering gene expression data, which are widely used to classify cancers. NMF aims to find two non-negative matrices whose product closely approximates the original matrix. Traditional NMF methods minimize either the l2 norm or the Kullback-Leibler distance between the product of the two matrices and the original matrix. Correntropy was recently shown to be an effective similarity measurement due to its stability to outliers or noise.Results: We propose a maximum correntropy criterion (MCC)-based NMF method (NMF-MCC) for gene expression data-based cancer clustering. Instead of minimizing the l2 norm or the Kullback-Leibler distance, NMF-MCC maximizes the correntropy between the product of the two matrices and the original matrix. The optimization problem can be solved by an expectation conditional maximization algorithm.Conclusions: Extensive experiments on six cancer benchmark sets demonstrate that the proposed method is significantly more accurate than the state-of-the-art methods in cancer clustering. 2013 Wang et al.; licensee BioMed Central Ltd.

  1. Label-Informed Non-negative Matrix Factorization with Manifold Regularization for Discriminative Subnetwork Detection.

    Science.gov (United States)

    Watanabe, Takanori; Tunc, Birkan; Parker, Drew; Kim, Junghoon; Verma, Ragini

    2016-10-01

    In this paper, we present a novel method for obtaining a low dimensional representation of a complex brain network that: (1) can be interpreted in a neurobiologically meaningful way, (2) emphasizes group differences by accounting for label information, and (3) captures the variation in disease subtypes/severity by respecting the intrinsic manifold structure underlying the data. Our method is a supervised variant of non-negative matrix factorization (NMF), and achieves dimensionality reduction by extracting an orthogonal set of subnetworks that are interpretable, reconstructive of the original data, and also discriminative at the group level. In addition, the method includes a manifold regularizer that encourages the low dimensional representations to be smooth with respect to the intrinsic geometry of the data, allowing subjects with similar disease-severity to share similar network representations. While the method is generalizable to other types of non-negative network data, in this work we have used structural connectomes (SCs) derived from diffusion data to identify the cortical/subcortical connections that have been disrupted in abnormal neurological state. Experiments on a traumatic brain injury (TBI) dataset demonstrate that our method can identify subnetworks that can reliably classify TBI from controls and also reveal insightful connectivity patterns that may be indicative of a biomarker.

  2. Orthogonal and Scaling Transformations of Quadratic Functions with ...

    African Journals Online (AJOL)

    In this paper we present a non-singular transformation that can reduce a given quadratic function defined on Rn to another simpler quadratic function and study the impact of the transformation in relation to the problem of minimization of the function. In particular, we construct a non-singular transformation that can reduce a ...

  3. Quadratic Twists of Rigid Calabi–Yau Threefolds Over

    DEFF Research Database (Denmark)

    Gouvêa, Fernando Q.; Kiming, Ian; Yui, Noriko

    2013-01-01

    of weight 4 on some Γ 0(N). We show that quadratic twisting of a threefold corresponds to twisting the attached newform by quadratic characters and illustrate with a number of obvious and not so obvious examples. The question is motivated by the deeper question of which newforms of weight 4 on some Γ 0(N...

  4. Approximate *-derivations and approximate quadratic *-derivations on C*-algebras

    Directory of Open Access Journals (Sweden)

    Park Choonkil

    2011-01-01

    Full Text Available Abstract In this paper, we prove the stability of *-derivations and of quadratic *-derivations on Banach *-algebras. We moreover prove the superstability of *-derivations and of quadratic *-derivations on C*-algebras. 2000 Mathematics Subject Classification: 39B52; 47B47; 46L05; 39B72.

  5. A Linear Programming Reformulation of the Standard Quadratic Optimization Problem

    NARCIS (Netherlands)

    de Klerk, E.; Pasechnik, D.V.

    2005-01-01

    The problem of minimizing a quadratic form over the standard simplex is known as the standard quadratic optimization problem (SQO).It is NPhard, and contains the maximum stable set problem in graphs as a special case.In this note we show that the SQO problem may be reformulated as an (exponentially

  6. Effects of Classroom Instruction on Students' Understanding of Quadratic Equations

    Science.gov (United States)

    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…

  7. Analysis of Students' Error in Learning of Quadratic Equations

    Science.gov (United States)

    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…

  8. Sketching the General Quadratic Equation Using Dynamic Geometry Software

    Science.gov (United States)

    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…

  9. Tangent Lines without Derivatives for Quadratic and Cubic Equations

    Science.gov (United States)

    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.)

  10. Visualising the Roots of Quadratic Equations with Complex Coefficients

    Science.gov (United States)

    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…

  11. Regularity of optimal transport maps on multiple products of spheres

    OpenAIRE

    Figalli, Alessio; Kim, Young-Heon; McCann, Robert J.

    2010-01-01

    This article addresses regularity of optimal transport maps for cost="squared distance" on Riemannian manifolds that are products of arbitrarily many round spheres with arbitrary sizes and dimensions. Such manifolds are known to be non-negatively cross-curved [KM2]. Under boundedness and non-vanishing assumptions on the transfered source and target densities we show that optimal maps stay away from the cut-locus (where the cost exhibits singularity), and obtain injectivity and continuity of o...

  12. AUTOJOM, Quadratic Equation Coefficient for Conic Volume, Parallelepipeds, Wedges, Pyramids. JOMREAD, Check of 3-D Geometry Structure from Quadratic Surfaces

    International Nuclear Information System (INIS)

    2005-01-01

    Nature of physical problem solved: AUTOJOM is a computer program that will generate the coefficients of any quadratic equation used to define conic volumes and also the coefficients of the planes needed to define parallelepipeds, wedges, and pyramids. JOMREAD is a computer code to check any 3D geometry composed of and constructed with quadratic surfaces

  13. Are ghost surfaces quadratic-flux-minimizing?

    International Nuclear Information System (INIS)

    Hudson, S.R.; Dewar, R.L.

    2009-01-01

    Two candidates for 'almost-invariant' toroidal surfaces passing through magnetic islands, namely quadratic-flux-minimizing (QFMin) surfaces and ghost surfaces, use families of periodic pseudo-orbits (i.e. paths for which the action is not exactly extremal). QFMin pseudo-orbits, which are coordinate-dependent, are field lines obtained from a modified magnetic field, and ghost-surface pseudo-orbits are obtained by displacing closed field lines in the direction of steepest descent of magnetic action, ∫A.dl. A generalized Hamiltonian definition of ghost surfaces is given and specialized to the usual Lagrangian definition. A modified Hamilton's Principle is introduced that allows the use of Lagrangian integration for calculation of the QFMin pseudo-orbits. Numerical calculations show QFMin and Lagrangian ghost surfaces give very similar results for a chaotic magnetic field perturbed from an integrable case, and this is explained using a perturbative construction of an auxiliary poloidal angle for which QFMin and Lagrangian ghost surfaces are the same up to second order. While presented in the context of 3-dimensional magnetic field line systems, the concepts are applicable to defining almost-invariant tori in other 11/2 degree-of-freedom nonintegrable Lagrangian/Hamiltonian systems.

  14. Designing Camera Networks by Convex Quadratic Programming

    KAUST Repository

    Ghanem, Bernard

    2015-05-04

    ​In this paper, we study the problem of automatic camera placement for computer graphics and computer vision applications. We extend the problem formulations of previous work by proposing a novel way to incorporate visibility constraints and camera-to-camera relationships. For example, the placement solution can be encouraged to have cameras that image the same important locations from different viewing directions, which can enable reconstruction and surveillance tasks to perform better. We show that the general camera placement problem can be formulated mathematically as a convex binary quadratic program (BQP) under linear constraints. Moreover, we propose an optimization strategy with a favorable trade-off between speed and solution quality. Our solution is almost as fast as a greedy treatment of the problem, but the quality is significantly higher, so much so that it is comparable to exact solutions that take orders of magnitude more computation time. Because it is computationally attractive, our method also allows users to explore the space of solutions for variations in input parameters. To evaluate its effectiveness, we show a range of 3D results on real-world floorplans (garage, hotel, mall, and airport). ​

  15. Improving the robustness of Surface Enhanced Raman Spectroscopy based sensors by Bayesian Non-negative Matrix Factorization

    DEFF Research Database (Denmark)

    Alstrøm, Tommy Sonne; Frøhling, Kasper Bayer; Larsen, Jan

    2014-01-01

    a Bayesian Non-negative Matrix Factorization (NMF) approach to identify locations of target molecules. The proposed method is able to successfully analyze the spectra and extract the target spectrum. A visualization of the loadings of the basis vector is created and the results show a clear SNR enhancement...

  16. Non-negative Tensor Factorization with missing data for the modeling of gene expressions in the Human Brain

    DEFF Research Database (Denmark)

    Nielsen, Søren Føns Vind; Mørup, Morten

    2014-01-01

    Non-negative Tensor Factorization (NTF) has become a prominent tool for analyzing high dimensional multi-way structured data. In this paper we set out to analyze gene expression across brain regions in multiple subjects based on data from the Allen Human Brain Atlas [1] with more than 40 % data m...

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

    International Nuclear Information System (INIS)

    Zhao Yunbin

    2010-01-01

    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 condition 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.

  18. A revisit to quadratic programming with fuzzy parameters

    International Nuclear Information System (INIS)

    Liu, S.-T.

    2009-01-01

    Quadratic programming has been widely applied to solving real-world problems. Recently, Liu describes a solution method for solving a class of fuzzy quadratic programming problems, where the cost coefficients of the linear terms in objective function, constraint coefficients, and right-hand sides are fuzzy numbers [Liu ST. Quadratic programming with fuzzy parameters: a membership function approach. Chaos, Solitons and Fractals 2009;40:237-45]. In this paper, we generalize Liu's method to a more general fuzzy quadratic programming problem, where the cost coefficients in objective function, constraint coefficients, and right-hand sides are all fuzzy numbers. A pair of two-level mathematical programs is formulated to calculate the upper bound and lower bound of the objective values of the fuzzy quadratic program. Based on the duality theorem and by applying the variable transformation technique, the pair of two-level mathematical programs is transformed into a family of conventional one-level quadratic programs. Solving the pair of quadratic programs produces the fuzzy objective values of the problem. With the ability of calculating the fuzzy objective value developed in this paper, it might help initiate wider applications.

  19. Attributed community mining using joint general non-negative matrix factorization with graph Laplacian

    Science.gov (United States)

    Chen, Zigang; Li, Lixiang; Peng, Haipeng; Liu, Yuhong; Yang, Yixian

    2018-04-01

    Community mining for complex social networks with link and attribute information plays an important role according to different application needs. In this paper, based on our proposed general non-negative matrix factorization (GNMF) algorithm without dimension matching constraints in our previous work, we propose the joint GNMF with graph Laplacian (LJGNMF) to implement community mining of complex social networks with link and attribute information according to different application needs. Theoretical derivation result shows that the proposed LJGNMF is fully compatible with previous methods of integrating traditional NMF and symmetric NMF. In addition, experimental results show that the proposed LJGNMF can meet the needs of different community minings by adjusting its parameters, and the effect is better than traditional NMF in the community vertices attributes entropy.

  20. Categorical dimensions of human odor descriptor space revealed by non-negative matrix factorization

    Energy Technology Data Exchange (ETDEWEB)

    Chennubhotla, Chakra [University of Pittsburgh School of Medicine, Pittsburgh PA; Castro, Jason [Bates College

    2013-01-01

    In contrast to most other sensory modalities, the basic perceptual dimensions of olfaction remain un- clear. Here, we use non-negative matrix factorization (NMF) - a dimensionality reduction technique - to uncover structure in a panel of odor profiles, with each odor defined as a point in multi-dimensional descriptor space. The properties of NMF are favorable for the analysis of such lexical and perceptual data, and lead to a high-dimensional account of odor space. We further provide evidence that odor di- mensions apply categorically. That is, odor space is not occupied homogenously, but rather in a discrete and intrinsically clustered manner. We discuss the potential implications of these results for the neural coding of odors, as well as for developing classifiers on larger datasets that may be useful for predicting perceptual qualities from chemical structures.

  1. Facial Expression Recognition via Non-Negative Least-Squares Sparse Coding

    Directory of Open Access Journals (Sweden)

    Ying Chen

    2014-05-01

    Full Text Available Sparse coding is an active research subject in signal processing, computer vision, and pattern recognition. A novel method of facial expression recognition via non-negative least squares (NNLS sparse coding is presented in this paper. The NNLS sparse coding is used to form a facial expression classifier. To testify the performance of the presented method, local binary patterns (LBP and the raw pixels are extracted for facial feature representation. Facial expression recognition experiments are conducted on the Japanese Female Facial Expression (JAFFE database. Compared with other widely used methods such as linear support vector machines (SVM, sparse representation-based classifier (SRC, nearest subspace classifier (NSC, K-nearest neighbor (KNN and radial basis function neural networks (RBFNN, the experiment results indicate that the presented NNLS method performs better than other used methods on facial expression recognition tasks.

  2. HPC-NMF: A High-Performance Parallel Algorithm for Nonnegative Matrix Factorization

    Energy Technology Data Exchange (ETDEWEB)

    2016-08-22

    NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient distributed algorithms to solve the problem for big data sets. We propose a high-performance distributed-memory parallel algorithm that computes the factorization by iteratively solving alternating non-negative least squares (NLS) subproblems for $\\WW$ and $\\HH$. It maintains the data and factor matrices in memory (distributed across processors), uses MPI for interprocessor communication, and, in the dense case, provably minimizes communication costs (under mild assumptions). As opposed to previous implementation, our algorithm is also flexible: It performs well for both dense and sparse matrices, and allows the user to choose any one of the multiple algorithms for solving the updates to low rank factors $\\WW$ and $\\HH$ within the alternating iterations.

  3. Validation of Spectral Unmixing Results from Informed Non-Negative Matrix Factorization (INMF) of Hyperspectral Imagery

    Science.gov (United States)

    Wright, L.; Coddington, O.; Pilewskie, P.

    2017-12-01

    Hyperspectral instruments are a growing class of Earth observing sensors designed to improve remote sensing capabilities beyond discrete multi-band sensors by providing tens to hundreds of continuous spectral channels. Improved spectral resolution, range and radiometric accuracy allow the collection of large amounts of spectral data, facilitating thorough characterization of both atmospheric and surface properties. We describe the development of an Informed Non-Negative Matrix Factorization (INMF) spectral unmixing method to exploit this spectral information and separate atmospheric and surface signals based on their physical sources. INMF offers marked benefits over other commonly employed techniques including non-negativity, which avoids physically impossible results; and adaptability, which tailors the method to hyperspectral source separation. The INMF algorithm is adapted to separate contributions from physically distinct sources using constraints on spectral and spatial variability, and library spectra to improve the initial guess. Using this INMF algorithm we decompose hyperspectral imagery from the NASA Hyperspectral Imager for the Coastal Ocean (HICO), with a focus on separating surface and atmospheric signal contributions. HICO's coastal ocean focus provides a dataset with a wide range of atmospheric and surface conditions. These include atmospheres with varying aerosol optical thicknesses and cloud cover. HICO images also provide a range of surface conditions including deep ocean regions, with only minor contributions from the ocean surfaces; and more complex shallow coastal regions with contributions from the seafloor or suspended sediments. We provide extensive comparison of INMF decomposition results against independent measurements of physical properties. These include comparison against traditional model-based retrievals of water-leaving, aerosol, and molecular scattering radiances and other satellite products, such as aerosol optical thickness from

  4. Doubly Nonparametric Sparse Nonnegative Matrix Factorization Based on Dependent Indian Buffet Processes.

    Science.gov (United States)

    Xuan, Junyu; Lu, Jie; Zhang, Guangquan; Xu, Richard Yi Da; Luo, Xiangfeng

    2018-05-01

    Sparse nonnegative matrix factorization (SNMF) aims to factorize a data matrix into two optimized nonnegative sparse factor matrices, which could benefit many tasks, such as document-word co-clustering. However, the traditional SNMF typically assumes the number of latent factors (i.e., dimensionality of the factor matrices) to be fixed. This assumption makes it inflexible in practice. In this paper, we propose a doubly sparse nonparametric NMF framework to mitigate this issue by using dependent Indian buffet processes (dIBP). We apply a correlation function for the generation of two stick weights associated with each column pair of factor matrices while still maintaining their respective marginal distribution specified by IBP. As a consequence, the generation of two factor matrices will be columnwise correlated. Under this framework, two classes of correlation function are proposed: 1) using bivariate Beta distribution and 2) using Copula function. Compared with the single IBP-based NMF, this paper jointly makes two factor matrices nonparametric and sparse, which could be applied to broader scenarios, such as co-clustering. This paper is seen to be much more flexible than Gaussian process-based and hierarchial Beta process-based dIBPs in terms of allowing the two corresponding binary matrix columns to have greater variations in their nonzero entries. Our experiments on synthetic data show the merits of this paper compared with the state-of-the-art models in respect of factorization efficiency, sparsity, and flexibility. Experiments on real-world data sets demonstrate the efficiency of this paper in document-word co-clustering tasks.

  5. Algorithms for sparse, symmetric, definite quadratic lambda-matrix eigenproblems

    International Nuclear Information System (INIS)

    Scott, D.S.; Ward, R.C.

    1981-01-01

    Methods are presented for computing eigenpairs of the quadratic lambda-matrix, M lambda 2 + C lambda + K, where M, C, and K are large and sparse, and have special symmetry-type properties. These properties are sufficient to insure that all the eigenvalues are real and that theory analogous to the standard symmetric eigenproblem exists. The methods employ some standard techniques such as partial tri-diagonalization via the Lanczos Method and subsequent eigenpair calculation, shift-and- invert strategy and subspace iteration. The methods also employ some new techniques such as Rayleigh-Ritz quadratic roots and the inertia of symmetric, definite, quadratic lambda-matrices

  6. Integrable Hamiltonian systems and interactions through quadratic constraints

    International Nuclear Information System (INIS)

    Pohlmeyer, K.

    1975-08-01

    Osub(n)-invariant classical relativistic field theories in one time and one space dimension with interactions that are entirely due to quadratic constraints are shown to be closely related to integrable Hamiltonian systems. (orig.) [de

  7. A perturbative solution for gravitational waves in quadratic gravity

    International Nuclear Information System (INIS)

    Neto, Edgard C de Rey; Aguiar, Odylio D; Araujo, Jose C N de

    2003-01-01

    We find a gravitational wave solution to the linearized version of quadratic gravity by adding successive perturbations to Einstein's linearized field equations. We show that only the Ricci-squared quadratic invariant contributes to give a different solution to those found in Einstein's general relativity. The perturbative solution is written as a power series in the β parameter, the coefficient of the Ricci-squared term in the quadratic gravitational action. We also show that, for monochromatic waves of a given angular frequency ω, the perturbative solution can be summed out to give an exact solution to the linearized version of quadratic gravity, for 0 1/2 . This result may lead to implications for the predictions for gravitational wave backgrounds of cosmological origin

  8. Accurate nonlocal theory for cascaded quadratic soliton compression

    DEFF Research Database (Denmark)

    Bache, Morten; Bang, Ole; Moses, Jeffrey

    2007-01-01

    We study soliton compression in bulk quadratic nonlinear materials at 800 nm, where group-velocity mismatch dominates. We develop a nonlocal theory showing that efficient compression depends strongly on characteristic nonlocal time scales related to pulse dispersion....

  9. Resolving Actuator Redundancy - Control Allocation vs. Linear Quadratic Control

    OpenAIRE

    Härkegård, Ola

    2004-01-01

    When designing control laws for systems with more inputs than controlled variables, one issue to consider is how to deal with actuator redundancy. Two tools for distributing the control effort among a redundant set of actuators are control allocation and linear quadratic control design. In this paper, we investigate the relationship between these two design tools when a quadratic performance index is used for control allocation. We show that for a particular class of linear systems, they give...

  10. Quadratic measurement and conditional state preparation in an optomechanical system

    DEFF Research Database (Denmark)

    A. Brawley, George; Vanner, Michael A.; Bowen, Warwick P.

    2014-01-01

    We experimentally demonstrate, for the first time, quadratic measurement of mechanical motion in an optomechanical system. We use this nonlinear easurement to conditionally prepare classical non-Gaussian states of motion of a micro-mechanical oscillator.......We experimentally demonstrate, for the first time, quadratic measurement of mechanical motion in an optomechanical system. We use this nonlinear easurement to conditionally prepare classical non-Gaussian states of motion of a micro-mechanical oscillator....

  11. Scale-Invariant Rotating Black Holes in Quadratic Gravity

    Directory of Open Access Journals (Sweden)

    Guido Cognola

    2015-07-01

    Full Text Available Black hole solutions in pure quadratic theories of gravity are interesting since they allow the formulation of a set of scale-invariant thermodynamics laws. Recently, we have proven that static scale-invariant black holes have a well-defined entropy, which characterizes equivalent classes of solutions. In this paper, we generalize these results and explore the thermodynamics of rotating black holes in pure quadratic gravity.

  12. A Trust-region-based Sequential Quadratic Programming Algorithm

    DEFF Research Database (Denmark)

    Henriksen, Lars Christian; Poulsen, Niels Kjølstad

    This technical note documents the trust-region-based sequential quadratic programming algorithm used in other works by the authors. The algorithm seeks to minimize a convex nonlinear cost function subject to linear inequalty constraints and nonlinear equality constraints.......This technical note documents the trust-region-based sequential quadratic programming algorithm used in other works by the authors. The algorithm seeks to minimize a convex nonlinear cost function subject to linear inequalty constraints and nonlinear equality constraints....

  13. Staff turnover in hotels : exploring the quadratic and linear relationships.

    OpenAIRE

    Mohsin, A.; Lengler, J.F.B.; Aguzzoli, R.L.

    2015-01-01

    The aim of this study is to assess whether the relationship between intention to leave the job and its antecedents is quadratic or linear. To explore those relationships a theoretical model (see Fig. 1) and eight hypotheses are proposed. Each linear hypothesis is followed by an alternative quadratic hypothesis. The alternative hypotheses propose that the relationship between the four antecedent constructs and intention to leave the job might not be linear, as the existing literature suggests....

  14. On wave-packet dynamics in a decaying quadratic potential

    DEFF Research Database (Denmark)

    Møller, Klaus Braagaard; Henriksen, Niels Engholm

    1997-01-01

    We consider the time-dependent Schrodinger equation for a quadratic potential with an exponentially decaying force constant. General analytical solutions are presented and we highlight in particular, the signatures of classical mechanics in the wave packet dynamics.......We consider the time-dependent Schrodinger equation for a quadratic potential with an exponentially decaying force constant. General analytical solutions are presented and we highlight in particular, the signatures of classical mechanics in the wave packet dynamics....

  15. The stability of quadratic-reciprocal functional equation

    Science.gov (United States)

    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.

  16. Burgers' turbulence problem with linear or quadratic external potential

    DEFF Research Database (Denmark)

    Barndorff-Nielsen, Ole Eiler; Leonenko, N.N.

    2005-01-01

    We consider solutions of Burgers' equation with linear or quadratic external potential and stationary random initial conditions of Ornstein-Uhlenbeck type. We study a class of limit laws that correspond to a scale renormalization of the solutions.......We consider solutions of Burgers' equation with linear or quadratic external potential and stationary random initial conditions of Ornstein-Uhlenbeck type. We study a class of limit laws that correspond to a scale renormalization of the solutions....

  17. Quadratic programming with fuzzy parameters: A membership function approach

    International Nuclear Information System (INIS)

    Liu, S.-T.

    2009-01-01

    Quadratic programming has been widely applied to solving real world problems. The conventional quadratic programming model requires the parameters to be known constants. In the real world, however, the parameters are seldom known exactly and have to be estimated. This paper discusses the fuzzy quadratic programming problems where the cost coefficients, constraint coefficients, and right-hand sides are represented by convex fuzzy numbers. Since the parameters in the program are fuzzy numbers, the derived objective value is a fuzzy number as well. Using Zadeh's extension principle, a pair of two-level mathematical programs is formulated to calculate the upper bound and lower bound of the objective values of the fuzzy quadratic program. Based on the duality theorem and by applying the variable transformation technique, the pair of two-level mathematical programs is transformed into a family of conventional one-level quadratic programs. Solving the pair of quadratic programs produces the fuzzy objective values of the problem. An example illustrates method proposed in this paper.

  18. Decomposing the time-frequency representation of EEG using non-negative matrix and multi-way factorization

    DEFF Research Database (Denmark)

    Mørup, Morten; Hansen, Lars Kai; Parnas, Josef

    2006-01-01

    We demonstrate how non-negative matrix factorization (NMF) can be used to decompose the inter trial phase coherence (ITPC) of multi-channel EEG to yield a unique decomposition of time-frequency signatures present in various degrees in the recording channels. The NMF optimization is easily...... generalized to a parallel factor (PARAFAC) model to form a non-negative multi-way factorization (NMWF). While the NMF can examine subject specific activities the NMWF can effectively extract the most similar activities across subjects and or conditions. The methods are tested on a proprioceptive stimulus...... consisting of a weight change in a handheld load. While somatosensory gamma oscillations have previously only been evoked by electrical stimuli we hypothesized that a natural proprioceptive stimulus also would be able to evoke gamma oscillations. ITPC maxima were determined by visual inspection...

  19. A Nonnegative Latent Factor Model for Large-Scale Sparse Matrices in Recommender Systems via Alternating Direction Method.

    Science.gov (United States)

    Luo, Xin; Zhou, MengChu; Li, Shuai; You, Zhuhong; Xia, Yunni; Zhu, Qingsheng

    2016-03-01

    Nonnegative matrix factorization (NMF)-based models possess fine representativeness of a target matrix, which is critically important in collaborative filtering (CF)-based recommender systems. However, current NMF-based CF recommenders suffer from the problem of high computational and storage complexity, as well as slow convergence rate, which prevents them from industrial usage in context of big data. To address these issues, this paper proposes an alternating direction method (ADM)-based nonnegative latent factor (ANLF) model. The main idea is to implement the ADM-based optimization with regard to each single feature, to obtain high convergence rate as well as low complexity. Both computational and storage costs of ANLF are linear with the size of given data in the target matrix, which ensures high efficiency when dealing with extremely sparse matrices usually seen in CF problems. As demonstrated by the experiments on large, real data sets, ANLF also ensures fast convergence and high prediction accuracy, as well as the maintenance of nonnegativity constraints. Moreover, it is simple and easy to implement for real applications of learning systems.

  20. Comparison between linear quadratic and early time dose models

    International Nuclear Information System (INIS)

    Chougule, A.A.; Supe, S.J.

    1993-01-01

    During the 70s, much interest was focused on fractionation in radiotherapy with the aim of improving tumor control rate without producing unacceptable normal tissue damage. To compare the radiobiological effectiveness of various fractionation schedules, empirical formulae such as Nominal Standard Dose, Time Dose Factor, Cumulative Radiation Effect and Tumour Significant Dose, were introduced and were used despite many shortcomings. It has been claimed that a recent linear quadratic model is able to predict the radiobiological responses of tumours as well as normal tissues more accurately. We compared Time Dose Factor and Tumour Significant Dose models with the linear quadratic model for tumour regression in patients with carcinomas of the cervix. It was observed that the prediction of tumour regression estimated by the Tumour Significant Dose and Time Dose factor concepts varied by 1.6% from that of the linear quadratic model prediction. In view of the lack of knowledge of the precise values of the parameters of the linear quadratic model, it should be applied with caution. One can continue to use the Time Dose Factor concept which has been in use for more than a decade as its results are within ±2% as compared to that predicted by the linear quadratic model. (author). 11 refs., 3 figs., 4 tabs

  1. ENDMEMBER EXTRACTION OF HIGHLY MIXED DATA USING L1 SPARSITY-CONSTRAINED MULTILAYER NONNEGATIVE MATRIX FACTORIZATION

    Directory of Open Access Journals (Sweden)

    H. Fang

    2018-04-01

    Full Text Available Due to the limited spatial resolution of remote hyperspectral sensors, pixels are usually highly mixed in the hyperspectral images. Endmember extraction refers to the process identifying the pure endmember signatures from the mixture, which is an important step towards the utilization of hyperspectral data. Nonnegative matrix factorization (NMF is a widely used method of endmember extraction due to its effectiveness and convenience. While most NMF-based methods have single-layer structures, which may have difficulties in effectively learning the structures of highly mixed and complex data. On the other hand, multilayer algorithms have shown great advantages in learning data features and been widely studied in many fields. In this paper, we presented a L1 sparsityconstrained multilayer NMF method for endmember extraction of highly mixed data. Firstly, the multilayer NMF structure was obtained by unfolding NMF into a certain number of layers. In each layer, the abundance matrix was decomposed into the endmember matrix and abundance matrix of the next layer. Besides, to improve the performance of NMF, we incorporated sparsity constraints to the multilayer NMF model by adding a L1 regularizer of the abundance matrix to each layer. At last, a layer-wise optimization method based on NeNMF was proposed to train the multilayer NMF structure. Experiments were conducted on both synthetic data and real data. The results demonstrate that our proposed algorithm can achieve better results than several state-of-art approaches.

  2. Nonnegative Tensor Factorization Approach Applied to Fission Chamber’s Output Signals Blind Source Separation

    Science.gov (United States)

    Laassiri, M.; Hamzaoui, E.-M.; Cherkaoui El Moursli, R.

    2018-02-01

    Inside nuclear reactors, gamma-rays emitted from nuclei together with the neutrons introduce unwanted backgrounds in neutron spectra. For this reason, powerful extraction methods are needed to extract useful neutron signal from recorded mixture and thus to obtain clearer neutron flux spectrum. Actually, several techniques have been developed to discriminate between neutrons and gamma-rays in a mixed radiation field. Most of these techniques, tackle using analogue discrimination methods. Others propose to use some organic scintillators to achieve the discrimination task. Recently, systems based on digital signal processors are commercially available to replace the analog systems. As alternative to these systems, we aim in this work to verify the feasibility of using a Nonnegative Tensor Factorization (NTF) to blind extract neutron component from mixture signals recorded at the output of fission chamber (WL-7657). This last have been simulated through the Geant4 linked to Garfield++ using a 252Cf neutron source. To achieve our objective of obtaining the best possible neutron-gamma discrimination, we have applied the two different NTF algorithms, which have been found to be the best methods that allow us to analyse this kind of nuclear data.

  3. Non-Negative Tensor Factorization for Human Behavioral Pattern Mining in Online Games

    Directory of Open Access Journals (Sweden)

    Anna Sapienza

    2018-03-01

    Full Text Available Multiplayer online battle arena is a genre of online games that has become extremely popular. Due to their success, these games also drew the attention of our research community, because they provide a wealth of information about human online interactions and behaviors. A crucial problem is the extraction of activity patterns that characterize this type of data, in an interpretable way. Here, we leverage the Non-negative Tensor Factorization to detect hidden correlated behaviors of playing in a well-known game: League of Legends. To this aim, we collect the entire gaming history of a group of about 1000 players, which accounts for roughly 100K matches. By applying our framework we are able to separate players into different groups. We show that each group exhibits similar features and playing strategies, as well as similar temporal trajectories, i.e., behavioral progressions over the course of their gaming history. We surprisingly discover that playing strategies are stable over time and we provide an explanation for this observation.

  4. Exploring Mixed Membership Stochastic Block Models via Non-negative Matrix Factorization

    KAUST Repository

    Peng, Chengbin

    2014-12-01

    Many real-world phenomena can be modeled by networks in which entities and connections are represented by nodes and edges respectively. When certain nodes are highly connected with each other, those nodes forms a cluster, which is called community in our context. It is usually assumed that each node belongs to one community only, but evidences in biology and social networks reveal that the communities often overlap with each other. In other words, one node can probably belong to multiple communities. In light of that, mixed membership stochastic block models (MMB) have been developed to model those networks with overlapping communities. Such a model contains three matrices: two incidence matrices indicating in and out connections and one probability matrix. When the probability of connections for nodes between communities are significantly small, the parameter inference problem to this model can be solved by a constrained non-negative matrix factorization (NMF) algorithm. In this paper, we explore the connection between the two models and propose an algorithm based on NMF to infer the parameters of MMB. The proposed algorithms can detect overlapping communities regardless of knowing or not the number of communities. Experiments show that our algorithm can achieve a better community detection performance than the traditional NMF algorithm. © 2014 IEEE.

  5. Using Separable Nonnegative Matrix Factorization Techniques for the Analysis of Time-Resolved Raman Spectra

    Science.gov (United States)

    Luce, R.; Hildebrandt, P.; Kuhlmann, U.; Liesen, J.

    2016-09-01

    The key challenge of time-resolved Raman spectroscopy is the identification of the constituent species and the analysis of the kinetics of the underlying reaction network. In this work we present an integral approach that allows for determining both the component spectra and the rate constants simultaneously from a series of vibrational spectra. It is based on an algorithm for non-negative matrix factorization which is applied to the experimental data set following a few pre-processing steps. As a prerequisite for physically unambiguous solutions, each component spectrum must include one vibrational band that does not significantly interfere with vibrational bands of other species. The approach is applied to synthetic "experimental" spectra derived from model systems comprising a set of species with component spectra differing with respect to their degree of spectral interferences and signal-to-noise ratios. In each case, the species involved are connected via monomolecular reaction pathways. The potential and limitations of the approach for recovering the respective rate constants and component spectra are discussed.

  6. Feature selection and multi-kernel learning for adaptive graph regularized nonnegative matrix factorization

    KAUST Repository

    Wang, Jim Jing-Yan

    2014-09-20

    Nonnegative matrix factorization (NMF), a popular part-based representation technique, does not capture the intrinsic local geometric structure of the data space. Graph regularized NMF (GNMF) was recently proposed to avoid this limitation by regularizing NMF with a nearest neighbor graph constructed from the input data set. However, GNMF has two main bottlenecks. First, using the original feature space directly to construct the graph is not necessarily optimal because of the noisy and irrelevant features and nonlinear distributions of data samples. Second, one possible way to handle the nonlinear distribution of data samples is by kernel embedding. However, it is often difficult to choose the most suitable kernel. To solve these bottlenecks, we propose two novel graph-regularized NMF methods, AGNMFFS and AGNMFMK, by introducing feature selection and multiple-kernel learning to the graph regularized NMF, respectively. Instead of using a fixed graph as in GNMF, the two proposed methods learn the nearest neighbor graph that is adaptive to the selected features and learned multiple kernels, respectively. For each method, we propose a unified objective function to conduct feature selection/multi-kernel learning, NMF and adaptive graph regularization simultaneously. We further develop two iterative algorithms to solve the two optimization problems. Experimental results on two challenging pattern classification tasks demonstrate that the proposed methods significantly outperform state-of-the-art data representation methods.

  7. Fitting a circular distribution based on nonnegative trigonometric sums for wind direction in Malaysia

    Science.gov (United States)

    Masseran, Nurulkamal; Razali, Ahmad Mahir; Ibrahim, Kamarulzaman; Zaharim, Azami; Sopian, Kamaruzzaman

    2015-02-01

    Wind direction has a substantial effect on the environment and human lives. As examples, the wind direction influences the dispersion of particulate matter in the air and affects the construction of engineering structures, such as towers, bridges, and tall buildings. Therefore, a statistical analysis of the wind direction provides important information about the wind regime at a particular location. In addition, knowledge of the wind direction and wind speed can be used to derive information about the energy potential. This study investigated the characteristics of the wind regime of Mersing, Malaysia. A circular distribution based on Nonnegative Trigonometric Sums (NNTS) was fitted to a histogram of the average hourly wind direction data. The Newton-like manifold algorithm was used to estimate the parameter of each component of the NNTS model. Next, the suitability of each NNTS model was judged based on a graphical representation and Akaike's Information Criteria. The study found that the NNTS model with six or more components was able to fit the wind directional data for the Mersing station.

  8. Graph regularized nonnegative matrix factorization for temporal link prediction in dynamic networks

    Science.gov (United States)

    Ma, Xiaoke; Sun, Penggang; Wang, Yu

    2018-04-01

    Many networks derived from society and nature are temporal and incomplete. The temporal link prediction problem in networks is to predict links at time T + 1 based on a given temporal network from time 1 to T, which is essential to important applications. The current algorithms either predict the temporal links by collapsing the dynamic networks or collapsing features derived from each network, which are criticized for ignoring the connection among slices. to overcome the issue, we propose a novel graph regularized nonnegative matrix factorization algorithm (GrNMF) for the temporal link prediction problem without collapsing the dynamic networks. To obtain the feature for each network from 1 to t, GrNMF factorizes the matrix associated with networks by setting the rest networks as regularization, which provides a better way to characterize the topological information of temporal links. Then, the GrNMF algorithm collapses the feature matrices to predict temporal links. Compared with state-of-the-art methods, the proposed algorithm exhibits significantly improved accuracy by avoiding the collapse of temporal networks. Experimental results of a number of artificial and real temporal networks illustrate that the proposed method is not only more accurate but also more robust than state-of-the-art approaches.

  9. Beyond cross-domain learning: Multiple-domain nonnegative matrix factorization

    KAUST Repository

    Wang, Jim Jing-Yan; Gao, Xin

    2014-01-01

    Traditional cross-domain learning methods transfer learning from a source domain to a target domain. In this paper, we propose the multiple-domain learning problem for several equally treated domains. The multiple-domain learning problem assumes that samples from different domains have different distributions, but share the same feature and class label spaces. Each domain could be a target domain, while also be a source domain for other domains. A novel multiple-domain representation method is proposed for the multiple-domain learning problem. This method is based on nonnegative matrix factorization (NMF), and tries to learn a basis matrix and coding vectors for samples, so that the domain distribution mismatch among different domains will be reduced under an extended variation of the maximum mean discrepancy (MMD) criterion. The novel algorithm - multiple-domain NMF (MDNMF) - was evaluated on two challenging multiple-domain learning problems - multiple user spam email detection and multiple-domain glioma diagnosis. The effectiveness of the proposed algorithm is experimentally verified. © 2013 Elsevier Ltd. All rights reserved.

  10. Beyond cross-domain learning: Multiple-domain nonnegative matrix factorization

    KAUST Repository

    Wang, Jim Jing-Yan

    2014-02-01

    Traditional cross-domain learning methods transfer learning from a source domain to a target domain. In this paper, we propose the multiple-domain learning problem for several equally treated domains. The multiple-domain learning problem assumes that samples from different domains have different distributions, but share the same feature and class label spaces. Each domain could be a target domain, while also be a source domain for other domains. A novel multiple-domain representation method is proposed for the multiple-domain learning problem. This method is based on nonnegative matrix factorization (NMF), and tries to learn a basis matrix and coding vectors for samples, so that the domain distribution mismatch among different domains will be reduced under an extended variation of the maximum mean discrepancy (MMD) criterion. The novel algorithm - multiple-domain NMF (MDNMF) - was evaluated on two challenging multiple-domain learning problems - multiple user spam email detection and multiple-domain glioma diagnosis. The effectiveness of the proposed algorithm is experimentally verified. © 2013 Elsevier Ltd. All rights reserved.

  11. Predicting protein-protein interactions from multimodal biological data sources via nonnegative matrix tri-factorization.

    Science.gov (United States)

    Wang, Hua; Huang, Heng; Ding, Chris; Nie, Feiping

    2013-04-01

    Protein interactions are central to all the biological processes and structural scaffolds in living organisms, because they orchestrate a number of cellular processes such as metabolic pathways and immunological recognition. Several high-throughput methods, for example, yeast two-hybrid system and mass spectrometry method, can help determine protein interactions, which, however, suffer from high false-positive rates. Moreover, many protein interactions predicted by one method are not supported by another. Therefore, computational methods are necessary and crucial to complete the interactome expeditiously. In this work, we formulate the problem of predicting protein interactions from a new mathematical perspective--sparse matrix completion, and propose a novel nonnegative matrix factorization (NMF)-based matrix completion approach to predict new protein interactions from existing protein interaction networks. Through using manifold regularization, we further develop our method to integrate different biological data sources, such as protein sequences, gene expressions, protein structure information, etc. Extensive experimental results on four species, Saccharomyces cerevisiae, Drosophila melanogaster, Homo sapiens, and Caenorhabditis elegans, have shown that our new methods outperform related state-of-the-art protein interaction prediction methods.

  12. Hessian regularization based non-negative matrix factorization for gene expression data clustering.

    Science.gov (United States)

    Liu, Xiao; Shi, Jun; Wang, Congzhi

    2015-01-01

    Since a key step in the analysis of gene expression data is to detect groups of genes that have similar expression patterns, clustering technique is then commonly used to analyze gene expression data. Data representation plays an important role in clustering analysis. The non-negative matrix factorization (NMF) is a widely used data representation method with great success in machine learning. Although the traditional manifold regularization method, Laplacian regularization (LR), can improve the performance of NMF, LR still suffers from the problem of its weak extrapolating power. Hessian regularization (HR) is a newly developed manifold regularization method, whose natural properties make it more extrapolating, especially for small sample data. In this work, we propose the HR-based NMF (HR-NMF) algorithm, and then apply it to represent gene expression data for further clustering task. The clustering experiments are conducted on five commonly used gene datasets, and the results indicate that the proposed HR-NMF outperforms LR-based NMM and original NMF, which suggests the potential application of HR-NMF for gene expression data.

  13. A Global Sampling Based Image Matting Using Non-Negative Matrix Factorization

    Directory of Open Access Journals (Sweden)

    NAVEED ALAM

    2017-10-01

    Full Text Available Image matting is a technique in which a foreground is separated from the background of a given image along with the pixel wise opacity. This foreground can then be seamlessly composited in a different background to obtain a novel scene. This paper presents a global non-parametric sampling algorithm over image patches and utilizes a dimension reduction technique known as NMF (Non-Negative Matrix Factorization. Although some existing non-parametric approaches use large nearby foreground and background regions to sample patches but these approaches fail to take the whole image to sample patches. It is because of the high memory and computational requirements. The use of NMF in the proposed algorithm allows the dimension reduction which reduces the computational cost and memory requirement. The use of NMF also allow the proposed approach to use the whole foreground and background region in the image and reduces the patch complexity and help in efficient patch sampling. The use of patches not only allows the incorporation of the pixel colour but also the local image structure. The use of local structures in the image is important to estimate a high-quality alpha matte especially in the images which have regions containing high texture. The proposed algorithm is evaluated on the standard data set and obtained results are comparable to the state-of-the-art matting techniques

  14. A global sampling based image matting using non-negative matrix factorization

    International Nuclear Information System (INIS)

    Alam, N.; Sarim, M.; Shaikh, A.B.

    2017-01-01

    Image matting is a technique in which a foreground is separated from the background of a given image along with the pixel wise opacity. This foreground can then be seamlessly composited in a different background to obtain a novel scene. This paper presents a global non-parametric sampling algorithm over image patches and utilizes a dimension reduction technique known as NMF (Non-Negative Matrix Factorization). Although some existing non-parametric approaches use large nearby foreground and background regions to sample patches but these approaches fail to take the whole image to sample patches. It is because of the high memory and computational requirements. The use of NMF in the proposed algorithm allows the dimension reduction which reduces the computational cost and memory requirement. The use of NMF also allow the proposed approach to use the whole foreground and background region in the image and reduces the patch complexity and help in efficient patch sampling. The use of patches not only allows the incorporation of the pixel colour but also the local image structure. The use of local structures in the image is important to estimate a high-quality alpha matte especially in the images which have regions containing high texture. The proposed algorithm is evaluated on the standard data set and obtained results are comparable to the state-of-the-art matting techniques. (author)

  15. Canonical polyadic decomposition of third-order semi-nonnegative semi-symmetric tensors using LU and QR matrix factorizations

    Science.gov (United States)

    Wang, Lu; Albera, Laurent; Kachenoura, Amar; Shu, Huazhong; Senhadji, Lotfi

    2014-12-01

    Semi-symmetric three-way arrays are essential tools in blind source separation (BSS) particularly in independent component analysis (ICA). These arrays can be built by resorting to higher order statistics of the data. The canonical polyadic (CP) decomposition of such semi-symmetric three-way arrays allows us to identify the so-called mixing matrix, which contains the information about the intensities of some latent source signals present in the observation channels. In addition, in many applications, such as the magnetic resonance spectroscopy (MRS), the columns of the mixing matrix are viewed as relative concentrations of the spectra of the chemical components. Therefore, the two loading matrices of the three-way array, which are equal to the mixing matrix, are nonnegative. Most existing CP algorithms handle the symmetry and the nonnegativity separately. Up to now, very few of them consider both the semi-nonnegativity and the semi-symmetry structure of the three-way array. Nevertheless, like all the methods based on line search, trust region strategies, and alternating optimization, they appear to be dependent on initialization, requiring in practice a multi-initialization procedure. In order to overcome this drawback, we propose two new methods, called [InlineEquation not available: see fulltext.] and [InlineEquation not available: see fulltext.], to solve the problem of CP decomposition of semi-nonnegative semi-symmetric three-way arrays. Firstly, we rewrite the constrained optimization problem as an unconstrained one. In fact, the nonnegativity constraint of the two symmetric modes is ensured by means of a square change of variable. Secondly, a Jacobi-like optimization procedure is adopted because of its good convergence property. More precisely, the two new methods use LU and QR matrix factorizations, respectively, which consist in formulating high-dimensional optimization problems into several sequential polynomial and rational subproblems. By using both LU

  16. The quadratic reciprocity law a collection of classical proofs

    CERN Document Server

    Baumgart, Oswald

    2015-01-01

    This book is the English translation of Baumgart’s thesis on the early proofs of the quadratic reciprocity law (“Über das quadratische Reciprocitätsgesetz. Eine vergleichende Darstellung der Beweise”), first published in 1885. It is divided into two parts. The first part presents a very brief history of the development of number theory up to Legendre, as well as detailed descriptions of several early proofs of the quadratic reciprocity law. The second part highlights Baumgart’s comparisons of the principles behind these proofs. A current list of all known proofs of the quadratic reciprocity law, with complete references, is provided in the appendix. This book will appeal to all readers interested in elementary number theory and the history of number theory.

  17. Quadratic algebra approach to relativistic quantum Smorodinsky-Winternitz systems

    International Nuclear Information System (INIS)

    Marquette, Ian

    2011-01-01

    There exists a relation between the Klein-Gordon and the Dirac equations with scalar and vector potentials of equal magnitude and the Schroedinger equation. We obtain the relativistic energy spectrum for the four relativistic quantum Smorodinsky-Winternitz systems from their quasi-Hamiltonian and the quadratic algebras studied by Daskaloyannis in the nonrelativistic context. We also apply the quadratic algebra approach directly to the initial Dirac equation for these four systems and show that the quadratic algebras obtained are the same than those obtained from the quasi-Hamiltonians. We point out how results obtained in context of quantum superintegrable systems and their polynomial algebras can be applied to the quantum relativistic case.

  18. The bounds of feasible space on constrained nonconvex quadratic programming

    Science.gov (United States)

    Zhu, Jinghao

    2008-03-01

    This paper presents a method to estimate the bounds of the radius of the feasible space for a class of constrained nonconvex quadratic programmingsE Results show that one may compute a bound of the radius of the feasible space by a linear programming which is known to be a P-problem [N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984) 373-395]. It is proposed that one applies this method for using the canonical dual transformation [D.Y. Gao, Canonical duality theory and solutions to constrained nonconvex quadratic programming, J. Global Optimization 29 (2004) 377-399] for solving a standard quadratic programming problem.

  19. Large N saddle formulation of quadratic building block theories

    International Nuclear Information System (INIS)

    Halpern, M.B.

    1980-01-01

    I develop a large N saddle point formulation for the broad class of 'theories of quadratic building blocks'. Such theories are those on which the sums over internal indices are contained in quadratic building blocks, e.g. PHI 2 = Σsup(N)sub(a-1)PHi sup(a)sup(a). The formulation applies as well to fermions, derivative coupling and non-polynomial interactions. In a related development, closed Schwinger-Dyson equations for Green functions of the building blocks are derived and solved for large N. (orig.)

  20. Remarks on second-order quadratic systems in algebras

    Directory of Open Access Journals (Sweden)

    Art Sagle

    2017-10-01

    Full Text Available This paper is an addendum to our earlier paper [8], where a systematic study of quadratic systems of second order ordinary differential equations defined in commutative algebras was presented. Here we concentrate on special solutions and energy considerations of some quadratic systems defined in algebras which need not be commutative, however, we shall throughout assume the algebra to be associative. We here also give a positive answer to an open question, concerning periodic motions of such systems, posed in our earlier paper.

  1. Dhage Iteration Method for Generalized Quadratic Functional Integral Equations

    Directory of Open Access Journals (Sweden)

    Bapurao C. Dhage

    2015-01-01

    Full Text Available In this paper we prove the existence as well as approximations of the solutions for a certain nonlinear generalized quadratic functional integral equation. An algorithm for the solutions is developed and it is shown that the sequence of successive approximations starting at a lower or upper solution converges monotonically to the solutions of related quadratic functional integral equation under some suitable mixed hybrid conditions. We rely our main result on Dhage iteration method embodied in a recent hybrid fixed point theorem of Dhage (2014 in partially ordered normed linear spaces. An example is also provided to illustrate the abstract theory developed in the paper.

  2. Quantum tomography and classical propagator for quadratic quantum systems

    International Nuclear Information System (INIS)

    Man'ko, O.V.

    1999-03-01

    The classical propagator for tomographic probability (which describes the quantum state instead of wave function or density matrix) is presented for quadratic quantum systems and its relation to the quantum propagator is considered. The new formalism of quantum mechanics, based on the probability representation of the state, is applied to particular quadratic systems - the harmonic oscillator, particle's free motion, problems of an ion in a Paul trap and in asymmetric Penning trap, and to the process of stimulated Raman scattering. The classical propagator for these systems is written in an explicit form. (author)

  3. New robust chaotic system with exponential quadratic term

    International Nuclear Information System (INIS)

    Bao Bocheng; Li Chunbiao; Liu Zhong; Xu Jianping

    2008-01-01

    This paper proposes a new robust chaotic system of three-dimensional quadratic autonomous ordinary differential equations by introducing an exponential quadratic term. This system can display a double-scroll chaotic attractor with only two equilibria, and can be found to be robust chaotic in a very wide parameter domain with positive maximum Lyapunov exponent. Some basic dynamical properties and chaotic behaviour of novel attractor are studied. By numerical simulation, this paper verifies that the three-dimensional system can also evolve into periodic and chaotic behaviours by a constant controller. (general)

  4. Subgroups of class groups of algebraic quadratic function fields

    International Nuclear Information System (INIS)

    Wang Kunpeng; Zhang Xianke

    2001-09-01

    Ideal class groups H(K) of algebraic quadratic function fields K are studied, by using mainly the theory of continued fractions of algebraic functions. Properties of such continued fractions are discussed first. Then a necessary and sufficient condition is given for the class group H(K) to contain a cyclic subgroup of any order n, this criterion condition holds true for both real and imaginary fields K. Furthermore, several series of function fields K, including real, inertia imaginary, as well as ramified imaginary quadratic function fields, are given, and their class groups H(K) are proved to contain cyclic subgroups of order n. (author)

  5. Smoothing optimization of supporting quadratic surfaces with Zernike polynomials

    Science.gov (United States)

    Zhang, Hang; Lu, Jiandong; Liu, Rui; Ma, Peifu

    2018-03-01

    A new optimization method to get a smooth freeform optical surface from an initial surface generated by the supporting quadratic method (SQM) is proposed. To smooth the initial surface, a 9-vertex system from the neighbor quadratic surface and the Zernike polynomials are employed to establish a linear equation system. A local optimized surface to the 9-vertex system can be build by solving the equations. Finally, a continuous smooth optimization surface is constructed by stitching the above algorithm on the whole initial surface. The spot corresponding to the optimized surface is no longer discrete pixels but a continuous distribution.

  6. Adaptive Multiview Nonnegative Matrix Factorization Algorithm for Integration of Multimodal Biomedical Data

    Directory of Open Access Journals (Sweden)

    Bisakha Ray

    2017-08-01

    Full Text Available The amounts and types of available multimodal tumor data are rapidly increasing, and their integration is critical for fully understanding the underlying cancer biology and personalizing treatment. However, the development of methods for effectively integrating multimodal data in a principled manner is lagging behind our ability to generate the data. In this article, we introduce an extension to a multiview nonnegative matrix factorization algorithm (NNMF for dimensionality reduction and integration of heterogeneous data types and compare the predictive modeling performance of the method on unimodal and multimodal data. We also present a comparative evaluation of our novel multiview approach and current data integration methods. Our work provides an efficient method to extend an existing dimensionality reduction method. We report rigorous evaluation of the method on large-scale quantitative protein and phosphoprotein tumor data from the Clinical Proteomic Tumor Analysis Consortium (CPTAC acquired using state-of-the-art liquid chromatography mass spectrometry. Exome sequencing and RNA-Seq data were also available from The Cancer Genome Atlas for the same tumors. For unimodal data, in case of breast cancer, transcript levels were most predictive of estrogen and progesterone receptor status and copy number variation of human epidermal growth factor receptor 2 status. For ovarian and colon cancers, phosphoprotein and protein levels were most predictive of tumor grade and stage and residual tumor, respectively. When multiview NNMF was applied to multimodal data to predict outcomes, the improvement in performance is not overall statistically significant beyond unimodal data, suggesting that proteomics data may contain more predictive information regarding tumor phenotypes than transcript levels, probably due to the fact that proteins are the functional gene products and therefore a more direct measurement of the functional state of the tumor. Here, we

  7. Gene Ranking of RNA-Seq Data via Discriminant Non-Negative Matrix Factorization.

    Science.gov (United States)

    Jia, Zhilong; Zhang, Xiang; Guan, Naiyang; Bo, Xiaochen; Barnes, Michael R; Luo, Zhigang

    2015-01-01

    RNA-sequencing is rapidly becoming the method of choice for studying the full complexity of transcriptomes, however with increasing dimensionality, accurate gene ranking is becoming increasingly challenging. This paper proposes an accurate and sensitive gene ranking method that implements discriminant non-negative matrix factorization (DNMF) for RNA-seq data. To the best of our knowledge, this is the first work to explore the utility of DNMF for gene ranking. When incorporating Fisher's discriminant criteria and setting the reduced dimension as two, DNMF learns two factors to approximate the original gene expression data, abstracting the up-regulated or down-regulated metagene by using the sample label information. The first factor denotes all the genes' weights of two metagenes as the additive combination of all genes, while the second learned factor represents the expression values of two metagenes. In the gene ranking stage, all the genes are ranked as a descending sequence according to the differential values of the metagene weights. Leveraging the nature of NMF and Fisher's criterion, DNMF can robustly boost the gene ranking performance. The Area Under the Curve analysis of differential expression analysis on two benchmarking tests of four RNA-seq data sets with similar phenotypes showed that our proposed DNMF-based gene ranking method outperforms other widely used methods. Moreover, the Gene Set Enrichment Analysis also showed DNMF outweighs others. DNMF is also computationally efficient, substantially outperforming all other benchmarked methods. Consequently, we suggest DNMF is an effective method for the analysis of differential gene expression and gene ranking for RNA-seq data.

  8. Structure constrained semi-nonnegative matrix factorization for EEG-based motor imagery classification.

    Science.gov (United States)

    Lu, Na; Li, Tengfei; Pan, Jinjin; Ren, Xiaodong; Feng, Zuren; Miao, Hongyu

    2015-05-01

    Electroencephalogram (EEG) provides a non-invasive approach to measure the electrical activities of brain neurons and has long been employed for the development of brain-computer interface (BCI). For this purpose, various patterns/features of EEG data need to be extracted and associated with specific events like cue-paced motor imagery. However, this is a challenging task since EEG data are usually non-stationary time series with a low signal-to-noise ratio. In this study, we propose a novel method, called structure constrained semi-nonnegative matrix factorization (SCS-NMF), to extract the key patterns of EEG data in time domain by imposing the mean envelopes of event-related potentials (ERPs) as constraints on the semi-NMF procedure. The proposed method is applicable to general EEG time series, and the extracted temporal features by SCS-NMF can also be combined with other features in frequency domain to improve the performance of motor imagery classification. Real data experiments have been performed using the SCS-NMF approach for motor imagery classification, and the results clearly suggest the superiority of the proposed method. Comparison experiments have also been conducted. The compared methods include ICA, PCA, Semi-NMF, Wavelets, EMD and CSP, which further verified the effectivity of SCS-NMF. The SCS-NMF method could obtain better or competitive performance over the state of the art methods, which provides a novel solution for brain pattern analysis from the perspective of structure constraint. Copyright © 2015 Elsevier Ltd. All rights reserved.

  9. Nonnegative matrix factorization with the Itakura-Saito divergence: with application to music analysis.

    Science.gov (United States)

    Févotte, Cédric; Bertin, Nancy; Durrieu, Jean-Louis

    2009-03-01

    This letter presents theoretical, algorithmic, and experimental results about nonnegative matrix factorization (NMF) with the Itakura-Saito (IS) divergence. We describe how IS-NMF is underlaid by a well-defined statistical model of superimposed gaussian components and is equivalent to maximum likelihood estimation of variance parameters. This setting can accommodate regularization constraints on the factors through Bayesian priors. In particular, inverse-gamma and gamma Markov chain priors are considered in this work. Estimation can be carried out using a space-alternating generalized expectation-maximization (SAGE) algorithm; this leads to a novel type of NMF algorithm, whose convergence to a stationary point of the IS cost function is guaranteed. We also discuss the links between the IS divergence and other cost functions used in NMF, in particular, the Euclidean distance and the generalized Kullback-Leibler (KL) divergence. As such, we describe how IS-NMF can also be performed using a gradient multiplicative algorithm (a standard algorithm structure in NMF) whose convergence is observed in practice, though not proven. Finally, we report a furnished experimental comparative study of Euclidean-NMF, KL-NMF, and IS-NMF algorithms applied to the power spectrogram of a short piano sequence recorded in real conditions, with various initializations and model orders. Then we show how IS-NMF can successfully be employed for denoising and upmix (mono to stereo conversion) of an original piece of early jazz music. These experiments indicate that IS-NMF correctly captures the semantics of audio and is better suited to the representation of music signals than NMF with the usual Euclidean and KL costs.

  10. Decentralized linear quadratic power system stabilizers for multi ...

    Indian Academy of Sciences (India)

    Linear quadratic stabilizers are well-known for their superior control capabilities when compared to the conventional lead–lag power system stabilizers. However, they have not seen much of practical importance as the state variables are generally not measurable; especially the generator rotor angle measurement is not ...

  11. Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations

    DEFF Research Database (Denmark)

    Nam, Phan Thanh; Napiorkowski, Marcin; Solovej, Jan Philip

    2016-01-01

    We provide general conditions for which bosonic quadratic Hamiltonians on Fock spaces can be diagonalized by Bogoliubov transformations. Our results cover the case when quantum systems have infinite degrees of freedom and the associated one-body kinetic and paring operators are unbounded. Our...

  12. ON WEIGHTED GENERALIZED FUNCTIONS ASSOCIATED WITH QUADRATIC FORMS

    Directory of Open Access Journals (Sweden)

    E. L. Shishkina

    2016-12-01

    Full Text Available In this article we consider certain types of weighted generalized functions associated with nondegenerate quadratic forms. Such functions and their derivatives are used for constructing fundamental solutions of iterated ultra-hyperbolic equations with the Bessel operator and for constructing negative real powers of ultra-hyperbolic operators with the Bessel operator.

  13. Feedback nash equilibria for linear quadratic descriptor differential games

    NARCIS (Netherlands)

    Engwerda, J.C.; Salmah, S.

    2012-01-01

    In this paper, we consider the non-cooperative linear feedback Nash quadratic differential game with an infinite planning horizon for descriptor systems of index one. The performance function is assumed to be indefinite. We derive both necessary and sufficient conditions under which this game has a

  14. Initial post dynamic buckling of a quadratic-cubic column ...

    African Journals Online (AJOL)

    In this investigation, we determine the dynamic buckling load of an imperfect finite column resting on a mixed quadratic-cubic nonlinear elastic foundation trapped by an explicitly time dependent sinusoidally slowly varying dynamic load .The resultant coefficients are dynamically slowly varying and the formulation contains ...

  15. Quadratic algebras in the noncommutative integration method of wave equation

    International Nuclear Information System (INIS)

    Varaksin, O.L.

    1995-01-01

    The paper deals with the investigation of applications of the method of noncommutative integration of linear differential equations by partial derivatives. Nontrivial example was taken for integration of three-dimensions wave equation with the use of non-Abelian quadratic algebras

  16. Propagator of a time-dependent unbound quadratic Hamiltonian system

    International Nuclear Information System (INIS)

    Yeon, K.H.; Kim, H.J.; Um, C.I.; George, T.F.; Pandey, L.N.

    1996-01-01

    The propagator for a time-dependent unbound quadratic Hamiltonian system is explicitly evaluated using the path integral method. Two time-invariant quantities of the system are found where these invariants determine whether or not the system is bound. Several examples are considered to illustrate that the propagator obtained for the unbound systems is correct

  17. On Fredholm-Stieltjes quadratic integral equation with supremum

    International Nuclear Information System (INIS)

    Darwish, M.A.

    2007-08-01

    We prove an existence theorem of monotonic solutions for a quadratic integral equation of Fredholm-Stieltjes type in C[0,1]. The concept of measure of non-compactness and a fixed point theorem due to Darbo are the main tools in carrying out our proof. (author)

  18. Quadratic theory and feedback controllers for linear time delay systems

    International Nuclear Information System (INIS)

    Lee, E.B.

    1976-01-01

    Recent research on the design of controllers for systems having time delays is discussed. Results for the ''open loop'' and ''closed loop'' designs will be presented. In both cases results for minimizing a quadratic cost functional are given. The usefulness of these results is not known, but similar results for the non-delay case are being routinely applied. (author)

  19. Pareto optimality in infinite horizon linear quadratic differential games

    NARCIS (Netherlands)

    Reddy, P.V.; Engwerda, J.C.

    2013-01-01

    In this article we derive conditions for the existence of Pareto optimal solutions for linear quadratic infinite horizon cooperative differential games. First, we present a necessary and sufficient characterization for Pareto optimality which translates to solving a set of constrained optimal

  20. Special cases of the quadratic shortest path problem

    NARCIS (Netherlands)

    Sotirov, Renata; Hu, Hao

    2017-01-01

    The quadratic shortest path problem (QSPP) is the problem of finding a path with prespecified start vertex s and end vertex t in a digraph such that the sum of weights of arcs and the sum of interaction costs over all pairs of arcs on the path is minimized. We first consider a variant of the QSPP

  1. Quadratic Poisson brackets compatible with an algebra structure

    OpenAIRE

    Balinsky, A. A.; Burman, Yu.

    1994-01-01

    Quadratic Poisson brackets on a vector space equipped with a bilinear multiplication are studied. A notion of a bracket compatible with the multiplication is introduced and an effective criterion of such compatibility is given. Among compatible brackets, a subclass of coboundary brackets is described, and such brackets are enumerated in a number of examples.

  2. On misclassication probabilities of linear and quadratic classiers ...

    African Journals Online (AJOL)

    We study the theoretical misclassication probability of linear and quadratic classiers and examine the performance of these classiers under distributional variations in theory and using simulation. We derive expression for Bayes errors for some competing distributions from the same family under location shift. Keywords: ...

  3. Feedback Nash Equilibria for Linear Quadratic Descriptor Differential Games

    NARCIS (Netherlands)

    Engwerda, J.C.; Salmah, Y.

    2010-01-01

    In this note we consider the non-cooperative linear feedback Nash quadratic differential game with an infinite planning horizon for descriptor systems of index one. The performance function is assumed to be indefinite. We derive both necessary and sufficient conditions under which this game has a

  4. A Unified Approach to Teaching Quadratic and Cubic Equations.

    Science.gov (United States)

    Ward, A. J. B.

    2003-01-01

    Presents a simple method for teaching the algebraic solution of cubic equations via completion of the cube. Shows that this method is readily accepted by students already familiar with completion of the square as a method for quadratic equations. (Author/KHR)

  5. Analysis of Quadratic Diophantine Equations with Fibonacci Number Solutions

    Science.gov (United States)

    Leyendekkers, J. V.; Shannon, A. G.

    2004-01-01

    An analysis is made of the role of Fibonacci numbers in some quadratic Diophantine equations. A general solution is obtained for finding factors in sums of Fibonacci numbers. Interpretation of the results is facilitated by the use of a modular ring which also permits extension of the analysis.

  6. Visualising the Complex Roots of Quadratic Equations with Real Coefficients

    Science.gov (United States)

    Bardell, Nicholas S.

    2012-01-01

    The roots of the general quadratic equation y = ax[superscript 2] + bx + c (real a, b, c) are known to occur in the following sets: (i) real and distinct; (ii) real and coincident; and (iii) a complex conjugate pair. Case (iii), which provides the focus for this investigation, can only occur when the values of the real coefficients a, b, and c are…

  7. Nonlocal description of X waves in quadratic nonlinear materials

    DEFF Research Database (Denmark)

    Larsen, Peter Ulrik Vingaard; Sørensen, Mads Peter; Bang, Ole

    2006-01-01

    We study localized light bullets and X-waves in quadratic media and show how the notion of nonlocality can provide an alternative simple physical picture of both types of multi-dimensional nonlinear waves. For X-waves we show that a local cascading limit in terms of a nonlinear Schrodinger equation...

  8. Linear and quadratic in temperature resistivity from holography

    Energy Technology Data Exchange (ETDEWEB)

    Ge, Xian-Hui [Department of Physics, Shanghai University, Shanghai 200444 (China); Shanghai Key Laboratory of High Temperature Superconductors,Shanghai 200444 (China); Shanghai Key Lab for Astrophysics,100 Guilin Road, 200234 Shanghai (China); Tian, Yu [School of Physics, University of Chinese Academy of Sciences,Beijing, 100049 (China); Shanghai Key Laboratory of High Temperature Superconductors,Shanghai 200444 (China); Wu, Shang-Yu [Department of Electrophysics, National Chiao Tung University,Hsinchu 300 (China); Wu, Shao-Feng [Department of Physics, Shanghai University, Shanghai 200444 (China); Shanghai Key Laboratory of High Temperature Superconductors,Shanghai 200444 (China); Shanghai Key Lab for Astrophysics,100 Guilin Road, 200234 Shanghai (China)

    2016-11-22

    We present a new black hole solution in the asymptotic Lifshitz spacetime with a hyperscaling violating factor. A novel computational method is introduced to compute the DC thermoelectric conductivities analytically. We find that both the linear-T and quadratic-T contributions to the resistivity can be realized, indicating that a more detailed comparison with experimental phenomenology can be performed in this scenario.

  9. Temperature dependence of Kerr coefficient and quadratic polarized optical coefficient of a paraelectric Mn:Fe:KTN crystal

    Directory of Open Access Journals (Sweden)

    Qieni Lu

    2015-08-01

    Full Text Available We measure temperature dependence on Kerr coefficient and quadratic polarized optical coefficient of a paraelectric Mn:Fe:KTN crystal simultaneously in this work, based on digital holographic interferometry (DHI. And the spatial distribution of the field-induced refractive index change can also be visualized and estimated by numerically retrieving sequential phase maps of Mn:Fe:KTN crystal from recording digital holograms in different states. The refractive indices decrease with increasing temperature and quadratic polarized optical coefficient is insensitive to temperature. The experimental results suggest that the DHI method presented here is highly applicable in both visualizing the temporal and spatial behavior of the internal electric field and accurately measuring electro-optic coefficient for electrooptical media.

  10. A PET reconstruction formulation that enforces non-negativity in projection space for bias reduction in Y-90 imaging

    Science.gov (United States)

    Lim, Hongki; Dewaraja, Yuni K.; Fessler, Jeffrey A.

    2018-02-01

    Most existing PET image reconstruction methods impose a nonnegativity constraint in the image domain that is natural physically, but can lead to biased reconstructions. This bias is particularly problematic for Y-90 PET because of the low probability positron production and high random coincidence fraction. This paper investigates a new PET reconstruction formulation that enforces nonnegativity of the projections instead of the voxel values. This formulation allows some negative voxel values, thereby potentially reducing bias. Unlike the previously reported NEG-ML approach that modifies the Poisson log-likelihood to allow negative values, the new formulation retains the classical Poisson statistical model. To relax the non-negativity constraint embedded in the standard methods for PET reconstruction, we used an alternating direction method of multipliers (ADMM). Because choice of ADMM parameters can greatly influence convergence rate, we applied an automatic parameter selection method to improve the convergence speed. We investigated the methods using lung to liver slices of XCAT phantom. We simulated low true coincidence count-rates with high random fractions corresponding to the typical values from patient imaging in Y-90 microsphere radioembolization. We compared our new methods with standard reconstruction algorithms and NEG-ML and a regularized version thereof. Both our new method and NEG-ML allow more accurate quantification in all volumes of interest while yielding lower noise than the standard method. The performance of NEG-ML can degrade when its user-defined parameter is tuned poorly, while the proposed algorithm is robust to any count level without requiring parameter tuning.

  11. NMF-mGPU: non-negative matrix factorization on multi-GPU systems.

    Science.gov (United States)

    Mejía-Roa, Edgardo; Tabas-Madrid, Daniel; Setoain, Javier; García, Carlos; Tirado, Francisco; Pascual-Montano, Alberto

    2015-02-13

    In the last few years, the Non-negative Matrix Factorization ( NMF ) technique has gained a great interest among the Bioinformatics community, since it is able to extract interpretable parts from high-dimensional datasets. However, the computing time required to process large data matrices may become impractical, even for a parallel application running on a multiprocessors cluster. In this paper, we present NMF-mGPU, an efficient and easy-to-use implementation of the NMF algorithm that takes advantage of the high computing performance delivered by Graphics-Processing Units ( GPUs ). Driven by the ever-growing demands from the video-games industry, graphics cards usually provided in PCs and laptops have evolved from simple graphics-drawing platforms into high-performance programmable systems that can be used as coprocessors for linear-algebra operations. However, these devices may have a limited amount of on-board memory, which is not considered by other NMF implementations on GPU. NMF-mGPU is based on CUDA ( Compute Unified Device Architecture ), the NVIDIA's framework for GPU computing. On devices with low memory available, large input matrices are blockwise transferred from the system's main memory to the GPU's memory, and processed accordingly. In addition, NMF-mGPU has been explicitly optimized for the different CUDA architectures. Finally, platforms with multiple GPUs can be synchronized through MPI ( Message Passing Interface ). In a four-GPU system, this implementation is about 120 times faster than a single conventional processor, and more than four times faster than a single GPU device (i.e., a super-linear speedup). Applications of GPUs in Bioinformatics are getting more and more attention due to their outstanding performance when compared to traditional processors. In addition, their relatively low price represents a highly cost-effective alternative to conventional clusters. In life sciences, this results in an excellent opportunity to facilitate the

  12. Predicting and understanding comprehensive drug-drug interactions via semi-nonnegative matrix factorization.

    Science.gov (United States)

    Yu, Hui; Mao, Kui-Tao; Shi, Jian-Yu; Huang, Hua; Chen, Zhi; Dong, Kai; Yiu, Siu-Ming

    2018-04-11

    Drug-drug interactions (DDIs) always cause unexpected and even adverse drug reactions. It is important to identify DDIs before drugs are used in the market. However, preclinical identification of DDIs requires much money and time. Computational approaches have exhibited their abilities to predict potential DDIs on a large scale by utilizing pre-market drug properties (e.g. chemical structure). Nevertheless, none of them can predict two comprehensive types of DDIs, including enhancive and degressive DDIs, which increases and decreases the behaviors of the interacting drugs respectively. There is a lack of systematic analysis on the structural relationship among known DDIs. Revealing such a relationship is very important, because it is able to help understand how DDIs occur. Both the prediction of comprehensive DDIs and the discovery of structural relationship among them play an important guidance when making a co-prescription. In this work, treating a set of comprehensive DDIs as a signed network, we design a novel model (DDINMF) for the prediction of enhancive and degressive DDIs based on semi-nonnegative matrix factorization. Inspiringly, DDINMF achieves the conventional DDI prediction (AUROC = 0.872 and AUPR = 0.605) and the comprehensive DDI prediction (AUROC = 0.796 and AUPR = 0.579). Compared with two state-of-the-art approaches, DDINMF shows it superiority. Finally, representing DDIs as a binary network and a signed network respectively, an analysis based on NMF reveals crucial knowledge hidden among DDIs. Our approach is able to predict not only conventional binary DDIs but also comprehensive DDIs. More importantly, it reveals several key points about the DDI network: (1) both binary and signed networks show fairly clear clusters, in which both drug degree and the difference between positive degree and negative degree show significant distribution; (2) the drugs having large degrees tend to have a larger difference between positive degree

  13. Learning Microbial Community Structures with Supervised and Unsupervised Non-negative Matrix Factorization.

    Science.gov (United States)

    Cai, Yun; Gu, Hong; Kenney, Toby

    2017-08-31

    Learning the structure of microbial communities is critical in understanding the different community structures and functions of microbes in distinct individuals. We view microbial communities as consisting of many subcommunities which are formed by certain groups of microbes functionally dependent on each other. The focus of this paper is on methods for extracting the subcommunities from the data, in particular Non-Negative Matrix Factorization (NMF). Our methods can be applied to both OTU data and functional metagenomic data. We apply the existing unsupervised NMF method and also develop a new supervised NMF method for extracting interpretable information from classification problems. The relevance of the subcommunities identified by NMF is demonstrated by their excellent performance for classification. Through three data examples, we demonstrate how to interpret the features identified by NMF to draw meaningful biological conclusions and discover hitherto unidentified patterns in the data. Comparing whole metagenomes of various mammals, (Muegge et al., Science 332:970-974, 2011), the biosynthesis of macrolides pathway is found in hindgut-fermenting herbivores, but not carnivores. This is consistent with results in veterinary science that macrolides should not be given to non-ruminant herbivores. For time series microbiome data from various body sites (Caporaso et al., Genome Biol 12:50, 2011), a shift in the microbial communities is identified for one individual. The shift occurs at around the same time in the tongue and gut microbiomes, indicating that the shift is a genuine biological trait, rather than an artefact of the method. For whole metagenome data from IBD patients and healthy controls (Qin et al., Nature 464:59-65, 2010), we identify differences in a number of pathways (some known, others new). NMF is a powerful tool for identifying the key features of microbial communities. These identified features can not only be used to perform difficult

  14. The cyclicity of period annulus of a quadratic reversible Lotka–Volterra system

    International Nuclear Information System (INIS)

    Li, Chengzhi; Llibre, Jaume

    2009-01-01

    We prove that by perturbing the periodic annulus of the quadratic polynomial reversible Lotka–Volterra differential system, inside the class of all quadratic polynomial differential systems we can obtain at most two limit cycles

  15. Induced motion of domain walls in multiferroics with quadratic interaction

    Energy Technology Data Exchange (ETDEWEB)

    Gerasimchuk, Victor S., E-mail: viktor.gera@gmail.com [National Technical University of Ukraine “Kyiv Polytechnic Institute”, Peremohy Avenue 37, 03056 Kiev (Ukraine); Shitov, Anatoliy A., E-mail: shitov@mail.ru [Donbass National Academy of Civil Engineering, Derzhavina Street 2, 86123 Makeevka, Donetsk Region (Ukraine)

    2013-10-15

    We theoretically study the dynamics of 180-degree domain wall of the ab-type in magnetic materials with quadratic magnetoelectric interaction in external alternating magnetic and electric fields. The features of the oscillatory and translational motions of the domain walls and stripe structures depending on the parameters of external fields and characteristics of the multiferroics are discussed. The possibility of the domain walls drift in a purely electric field is established. - Highlights: • We study DW and stripe DS in multiferroics with quadratic magnetoelectric interaction. • We build up the theory of oscillatory and translational (drift) DW and DS motion. • DW motion can be caused by crossed alternating electric and magnetic fields. • DW motion can be caused by alternating “pure” electric field. • DW drift velocity is formed by the AFM and Dzyaloshinskii interaction terms.

  16. Symmetric coupling of angular momenta, quadratic algebras and discrete polynomials

    International Nuclear Information System (INIS)

    Aquilanti, V; Marinelli, D; Marzuoli, A

    2014-01-01

    Eigenvalues and eigenfunctions of the volume operator, associated with the symmetric coupling of three SU(2) angular momentum operators, can be analyzed on the basis of a discrete Schrödinger–like equation which provides a semiclassical Hamiltonian picture of the evolution of a 'quantum of space', as shown by the authors in [1]. Emphasis is given here to the formalization in terms of a quadratic symmetry algebra and its automorphism group. This view is related to the Askey scheme, the hierarchical structure which includes all hypergeometric polynomials of one (discrete or continuous) variable. Key tool for this comparative analysis is the duality operation defined on the generators of the quadratic algebra and suitably extended to the various families of overlap functions (generalized recoupling coefficients). These families, recognized as lying at the top level of the Askey scheme, are classified and a few limiting cases are addressed

  17. Quadratic grating apodized photon sieves for simultaneous multiplane microscopy

    Science.gov (United States)

    Cheng, Yiguang; Zhu, Jiangping; He, Yu; Tang, Yan; Hu, Song; Zhao, Lixin

    2017-10-01

    We present a new type of imaging device, named quadratic grating apodized photon sieve (QGPS), used as the objective for simultaneous multiplane imaging in X-rays. The proposed QGPS is structured based on the combination of two concepts: photon sieves and quadratic gratings. Its design principles are also expounded in detail. Analysis of imaging properties of QGPS in terms of point-spread function shows that QGPS can image multiple layers within an object field onto a single image plane. Simulated and experimental results in visible light both demonstrate the feasibility of QGPS for simultaneous multiplane imaging, which is extremely promising to detect dynamic specimens by X-ray microscopy in the physical and life sciences.

  18. QUADRATIC SERENDIPITY FINITE ELEMENTS ON POLYGONS USING GENERALIZED BARYCENTRIC COORDINATES.

    Science.gov (United States)

    Rand, Alexander; Gillette, Andrew; Bajaj, Chandrajit

    2014-01-01

    We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n -gon, our construction produces 2 n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, by transforming and combining a set of n ( n + 1)/2 basis functions known to obtain quadratic convergence. The technique broadens the scope of the so-called 'serendipity' elements, previously studied only for quadrilateral and regular hexahedral meshes, by employing the theory of generalized barycentric coordinates. Uniform a priori error estimates are established over the class of convex quadrilaterals with bounded aspect ratio as well as over the class of convex planar polygons satisfying additional shape regularity conditions to exclude large interior angles and short edges. Numerical evidence is provided on a trapezoidal quadrilateral mesh, previously not amenable to serendipity constructions, and applications to adaptive meshing are discussed.

  19. Linear Quadratic Controller with Fault Detection in Compact Disk Players

    DEFF Research Database (Denmark)

    Vidal, Enrique Sanchez; Hansen, K.G.; Andersen, R.S.

    2001-01-01

    The design of the positioning controllers in Optical Disk Drives are today subjected to a trade off between an acceptable suppression of external disturbances and an acceptable immunity against surfaces defects. In this paper an algorithm is suggested to detect defects of the disk surface combined...... with an observer and a Linear Quadratic Regulator. As a result, the mentioned trade off is minimized and the playability of the tested compact disk player is considerably enhanced....

  20. Observers for Systems with Nonlinearities Satisfying an Incremental Quadratic Inequality

    Science.gov (United States)

    Acikmese, Ahmet Behcet; Corless, Martin

    2004-01-01

    We consider the problem of state estimation for nonlinear time-varying systems whose nonlinearities satisfy an incremental quadratic inequality. These observer results unifies earlier results in the literature; and extend it to some additional classes of nonlinearities. Observers are presented which guarantee that the state estimation error exponentially converges to zero. Observer design involves solving linear matrix inequalities for the observer gain matrices. Results are illustrated by application to a simple model of an underwater.

  1. Information sets as permutation cycles for quadratic residue codes

    Directory of Open Access Journals (Sweden)

    Richard A. Jenson

    1982-01-01

    Full Text Available The two cases p=7 and p=23 are the only known cases where the automorphism group of the [p+1,   (p+1/2] extended binary quadratic residue code, O(p, properly contains PSL(2,p. These codes have some of their information sets represented as permutation cycles from Aut(Q(p. Analysis proves that all information sets of Q(7 are so represented but those of Q(23 are not.

  2. On a linear-quadratic problem with Caputo derivative

    Directory of Open Access Journals (Sweden)

    Dariusz Idczak

    2016-01-01

    Full Text Available In this paper, we study a linear-quadratic optimal control problem with a fractional control system containing a Caputo derivative of unknown function. First, we derive the formulas for the differential and gradient of the cost functional under given constraints. Next, we prove an existence result and derive a maximum principle. Finally, we describe the gradient and projection of the gradient methods for the problem under consideration.

  3. Stationary walking solitons in bulk quadratic nonlinear media

    OpenAIRE

    Mihalache, Dumitru; Mazilu, D; Crasonavn, L C; Torner Sabata, Lluís

    1997-01-01

    We study the mutual trapping of fundamental and second-harmonic light beams propagating in bulk quadratic nonlinear media in the presence of Poynting vector beam walk-off. We show numerically the existence of a two-parameter family of (2 + 1)-dimensional stationary, spatial walking solitons. We have found that the solitons exist at various values of material parameters with different wave intensities and soliton velocities. We discuss the differences between (2 + 1) and (1 + 1)-dimensional wa...

  4. Bifurcation in Z2-symmetry quadratic polynomial systems with delay

    International Nuclear Information System (INIS)

    Zhang Chunrui; Zheng Baodong

    2009-01-01

    Z 2 -symmetry systems are considered. Firstly the general forms of Z 2 -symmetry quadratic polynomial system are given, and then a three-dimensional Z 2 equivariant system is considered, which describes the relations of two predator species for a single prey species. Finally, the explicit formulas for determining the Fold and Hopf bifurcations are obtained by using the normal form theory and center manifold argument.

  5. Design of Linear-Quadratic-Regulator for a CSTR process

    Science.gov (United States)

    Meghna, P. R.; Saranya, V.; Jaganatha Pandian, B.

    2017-11-01

    This paper aims at creating a Linear Quadratic Regulator (LQR) for a Continuous Stirred Tank Reactor (CSTR). A CSTR is a common process used in chemical industries. It is a highly non-linear system. Therefore, in order to create the gain feedback controller, the model is linearized. The controller is designed for the linearized model and the concentration and volume of the liquid in the reactor are kept at a constant value as required.

  6. A Note on 5-bit Quadratic Permutations’ Classification

    OpenAIRE

    Božilov, Dušan; Bilgin, Begül; Sahin, Hacı Ali

    2017-01-01

    Classification of vectorial Boolean functions up to affine equivalence is used widely to analyze various cryptographic and implementation properties of symmetric-key algorithms. We show that there exist 75 affine equivalence classes of 5-bit quadratic permutations. Furthermore, we explore important cryptographic properties of these classes, such as linear and differential properties and degrees of their inverses, together with multiplicative complexity and existence of uniform threshold reali...

  7. Integrable systems with quadratic nonlinearity in Fourier space

    International Nuclear Information System (INIS)

    Marikhin, V.G.

    2003-01-01

    The Lax pair representation in Fourier space is used to obtain a list of integrable scalar evolutionary equations with quadratic nonlinearity. The known systems of this type such as KdV, intermediate long-wave equation (ILW), Camassa-Holm and Degasperis-Procesi systems are represented in this list. Some new systems are obtained as well. Two-dimensional and discrete generalizations are discussed

  8. Complex eigenvalues for neutron transport equation with quadratically anisotropic scattering

    International Nuclear Information System (INIS)

    Sjoestrand, N.G.

    1981-01-01

    Complex eigenvalues for the monoenergetic neutron transport equation in the buckling approximation have been calculated for various combinations of linearly and quadratically anisotropic scattering. The results are discussed in terms of the time-dependent case. Tables are given of complex bucklings for real decay constants and of complex decay constants for real bucklings. The results fit nicely into the pattern of real and purely imaginary eigenvalues obtained earlier. (author)

  9. Application of Nonnegative Tensor Factorization for neutron-gamma discrimination of Monte Carlo simulated fission chamber’s output signals

    Directory of Open Access Journals (Sweden)

    Mounia Laassiri

    Full Text Available For efficient exploitation of research reactors, it is important to discern neutron flux distribution inside the reactor with the best possible precision. For this reason, fission and ionization chambers are used to measure the neutron field. In these arrays, the sequences of the neutron interaction points in the fission chamber can correctly be identified in order to obtain true neutron energies emitted by nuclei of interest. However, together with the neutrons, gamma-rays are also emitted from nuclei and thereby affect neutron spectra. The originality of this study consists in the application of tensor based blind source separation methods to extract independent components from signals recorded at the fission chamber preamplifier’s output. The objective is to achieve software neutron-gamma discrimination using Nonnegative Tensor Factorization tools. For reasons of nuclear safety, we first simulate the neutron flux inside the TRIGA Mark II Reactor using Monte Carlo methods under Geant4 platform linked to Garfield++. Geant4 simulations allow the fission chamber construction whereas linking the model to Garfield++ permits to simulate drift parameters from the ionization of the filling gas, which is not possible otherwise. Keywords: Fission chamber (FC, Geant4, Garfield++, Neutron-gamma discrimination, Nonnegative Tensor Factorization (NTF

  10. ℓ1/2-norm regularized nonnegative low-rank and sparse affinity graph for remote sensing image segmentation

    Science.gov (United States)

    Tian, Shu; Zhang, Ye; Yan, Yiming; Su, Nan

    2016-10-01

    Segmentation of real-world remote sensing images is a challenge due to the complex texture information with high heterogeneity. Thus, graph-based image segmentation methods have been attracting great attention in the field of remote sensing. However, most of the traditional graph-based approaches fail to capture the intrinsic structure of the feature space and are sensitive to noises. A ℓ-norm regularization-based graph segmentation method is proposed to segment remote sensing images. First, we use the occlusion of the random texture model (ORTM) to extract the local histogram features. Then, a ℓ-norm regularized low-rank and sparse representation (LNNLRS) is implemented to construct a ℓ-regularized nonnegative low-rank and sparse graph (LNNLRS-graph), by the union of feature subspaces. Moreover, the LNNLRS-graph has a high ability to discriminate the manifold intrinsic structure of highly homogeneous texture information. Meanwhile, the LNNLRS representation takes advantage of the low-rank and sparse characteristics to remove the noises and corrupted data. Last, we introduce the LNNLRS-graph into the graph regularization nonnegative matrix factorization to enhance the segmentation accuracy. The experimental results using remote sensing images show that when compared to five state-of-the-art image segmentation methods, the proposed method achieves more accurate segmentation results.

  11. ℓ2,1 Norm and Hessian Regularized Non-Negative Matrix Factorization with Discriminability for Data Representation

    Directory of Open Access Journals (Sweden)

    Peng Luo

    2017-09-01

    Full Text Available Matrix factorization based methods have widely been used in data representation. Among them, Non-negative Matrix Factorization (NMF is a promising technique owing to its psychological and physiological interpretation of spontaneously occurring data. On one hand, although traditional Laplacian regularization can enhance the performance of NMF, it still suffers from the problem of its weak extrapolating ability. On the other hand, standard NMF disregards the discriminative information hidden in the data and cannot guarantee the sparsity of the factor matrices. In this paper, a novel algorithm called ℓ 2 , 1 norm and Hessian Regularized Non-negative Matrix Factorization with Discriminability (ℓ 2 , 1 HNMFD, is developed to overcome the aforementioned problems. In ℓ 2 , 1 HNMFD, Hessian regularization is introduced in the framework of NMF to capture the intrinsic manifold structure of the data. ℓ 2 , 1 norm constraints and approximation orthogonal constraints are added to assure the group sparsity of encoding matrix and characterize the discriminative information of the data simultaneously. To solve the objective function, an efficient optimization scheme is developed to settle it. Our experimental results on five benchmark data sets have demonstrated that ℓ 2 , 1 HNMFD can learn better data representation and provide better clustering results.

  12. General quadratic gauge theory: constraint structure, symmetries and physical functions

    Energy Technology Data Exchange (ETDEWEB)

    Gitman, D M [Institute of Physics, University of Sao Paulo (Brazil); Tyutin, I V [Lebedev Physics Institute, Moscow (Russian Federation)

    2005-06-17

    How can we relate the constraint structure and constraint dynamics of the general gauge theory in the Hamiltonian formulation to specific features of the theory in the Lagrangian formulation, especially relate the constraint structure to the gauge transformation structure of the Lagrangian action? How can we construct the general expression for the gauge charge if the constraint structure in the Hamiltonian formulation is known? Whether we can identify the physical functions defined as commuting with first-class constraints in the Hamiltonian formulation and the physical functions defined as gauge invariant functions in the Lagrangian formulation? The aim of the present paper is to consider the general quadratic gauge theory and to answer the above questions for such a theory in terms of strict assertions. To fulfil such a programme, we demonstrate the existence of the so-called superspecial phase-space variables in terms of which the quadratic Hamiltonian action takes a simple canonical form. On the basis of such a representation, we analyse a functional arbitrariness in the solutions of the equations of motion of the quadratic gauge theory and derive the general structure of symmetries by analysing a symmetry equation. We then use these results to identify the two definitions of physical functions and thus prove the Dirac conjecture.

  13. Quadratic time dependent Hamiltonians and separation of variables

    International Nuclear Information System (INIS)

    Anzaldo-Meneses, A.

    2017-01-01

    Time dependent quantum problems defined by quadratic Hamiltonians are solved using canonical transformations. The Green’s function is obtained and a comparison with the classical Hamilton–Jacobi method leads to important geometrical insights like exterior differential systems, Monge cones and time dependent Gaussian metrics. The Wei–Norman approach is applied using unitary transformations defined in terms of generators of the associated Lie groups, here the semi-direct product of the Heisenberg group and the symplectic group. A new explicit relation for the unitary transformations is given in terms of a finite product of elementary transformations. The sequential application of adequate sets of unitary transformations leads naturally to a new separation of variables method for time dependent Hamiltonians, which is shown to be related to the Inönü–Wigner contraction of Lie groups. The new method allows also a better understanding of interacting particles or coupled modes and opens an alternative way to analyze topological phases in driven systems. - Highlights: • Exact unitary transformation reducing time dependent quadratic quantum Hamiltonian to zero. • New separation of variables method and simultaneous uncoupling of modes. • Explicit examples of transformations for one to four dimensional problems. • New general evolution equation for quadratic form in the action, respectively Green’s function.

  14. Design of reinforced areas of concrete column using quadratic polynomials

    Science.gov (United States)

    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.

  15. Fast, multiple optimizations of quadratic dose objective functions in IMRT

    International Nuclear Information System (INIS)

    Breedveld, Sebastiaan; Storchi, Pascal R M; Keijzer, Marleen; Heijmen, Ben J M

    2006-01-01

    Inverse treatment planning for intensity-modulated radiotherapy may include time consuming, multiple minimizations of an objective function. In this paper, methods are presented to speed up the process of (repeated) minimization of the well-known quadratic dose objective function, extended with a smoothing term that ensures generation of clinically acceptable beam profiles. In between two subsequent optimizations, the voxel-dependent importance factors of the quadratic terms will generally be adjusted, based on an intermediate plan evaluation. The objective function has been written in matrix-vector format, facilitating the use of a recently published, fast quadratic minimization algorithm, instead of commonly applied gradient-based methods. This format also reduces the calculation time in between subsequent minimizations, related to adjustment of the voxel-dependent importance factors. Sparse matrices are used to limit the required amount of computer memory. For three patients, comparisons have been made with a gradient method. Mean speed improvements of up to a factor of 37 have been achieved

  16. Measurement of quadratic electrogyration effect in castor oil

    Science.gov (United States)

    Izdebski, Marek; Ledzion, Rafał; Górski, Piotr

    2015-07-01

    This work presents a detailed analysis of electrogyration measurement in liquids with the usage of an optical polarimetric technique. Theoretical analysis of the optical response to an applied electric field is illustrated by experimental data for castor oil which exhibits natural optical activity, quadratic electro-optic effect and quadratic electrogyration effect. Moreover, the experimental data show that interaction of the oil with a pair of flat electrodes induces a significant dichroism and natural linear birefringence. The combination of these effects occurring at the same time complicates the procedure of measurements. It has been found that a single measurement is insufficient to separate the contribution of the electrogyration effect, but it is possible on the basis of several measurements performed with various orientations of the polarizer and the analyser. The obtained average values of the quadratic electrogyration coefficient β13 in castor oil at room temperature are from - 0.92 ×10-22 to - 1.44 ×10-22m2V-2 depending on the origin of the oil. Although this study is focused on measurements in castor oil, the presented analysis is much more general.

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

    Science.gov (United States)

    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

  18. Spatial statistics of pitting corrosion patterning: Quadrat counts and the non-homogeneous Poisson process

    International Nuclear Information System (INIS)

    Lopez de la Cruz, J.; Gutierrez, M.A.

    2008-01-01

    This paper presents a stochastic analysis of spatial point patterns as effect of localized pitting corrosion. The Quadrat Counts method is studied with two empirical pit patterns. The results are dependent on the quadrat size and bias is introduced when empty quadrats are accounted for the analysis. The spatially inhomogeneous Poisson process is used to improve the performance of the Quadrat Counts method. The latter combines Quadrat Counts with distance-based statistics in the analysis of pit patterns. The Inter-Event and the Nearest-Neighbour statistics are here implemented in order to compare their results. Further, the treatment of patterns in irregular domains is discussed

  19. Vacuum solutions of Bianchi cosmologies in quadratic gravity

    International Nuclear Information System (INIS)

    Deus, Juliano Alves de; Muller, Daniel

    2011-01-01

    Full text: In this work we solve numerically the vacuum solutions of field equations of Bianchi homogeneous universes in the context of Semiclassical theory. Our interest is to study the quadratic theory of gravity with regard in the cosmological description of our universe in periods of intense fields. Bianchi cosmologies are anisotropic homogeneous cosmological models, but can include the isotropic models as particular cases (Bianchi I, VII and IX include homogeneous and isotropic Friedmann models plane, hyperbolic and spherical, respectively). Homogeneous models are good cosmological representations of our universe. With focus in solutions for intense fields, like the early universe, where isotropy is not necessarily required, the adopted scenario is the vacuum solutions, where the geometry is dominant in determining the gravitation. Still following in this way, the Semiclassical theory, which considers quantum matter fields propagating in classical geometrical background, is addressed to give the field equations. This formalism leads to fourth-order ordinary differential equations, in contrast to second-order equations from General Relativity. The Lagrangian of the theory is quadratic in the Ricci scalar and in the Ricci tensor. The equations system is highly non-linear and can be only numerically solved, except perhaps for few particular cases. We obtained numerical solutions for Bianchi V II A evolving to Minkowski and to de Sitter solutions, and also to singularities. The both first and second solutions were obtained choosing initial conditions near from respective exact vacuum solutions from Einstein theory, which are also exact solutions of the quadratic theory. Other Bianchi types are still under study. (author)

  20. Lipschitz stability of the K-quadratic functional equation | Chahbi ...

    African Journals Online (AJOL)

    Let N be the set of all positive integers, G an Abelian group with a metric d and E a normed space. For any f : G → E we define the k-quadratic difference of the function f by the formula Qk ƒ(x; y) := 2ƒ(x) + 2k2ƒ(y) - f(x + ky) - f(x - ky) for x; y ∈ G and k ∈ N. Under some assumptions about f and Qkƒ we prove that if Qkƒ is ...

  1. BRST operator for superconformal algebras with quadratic nonlinearity

    International Nuclear Information System (INIS)

    Khviengia, Z.; Sezgin, E.

    1993-07-01

    We construct the quantum BRST operators for a large class of superconformal and quasi-superconformal algebras with quadratic nonlinearity. The only free parameter in these algebras is the level of the (super) Kac-Moody sector. The nilpotency of the quantum BRST operator imposes a condition on the level. We find this condition for (quasi) superconformal algebras with a Kac-Moody sector based on a simple Lie algebra and for the Z 2 x Z 2 -graded superconformal algebras with a Kac-Moody sector based on the superalgebra osp(N modul 2M) or sl (N + 2 modul N). (author). 22 refs, 3 tabs

  2. Quadratic integrand double-hybrid made spin-component-scaled

    Energy Technology Data Exchange (ETDEWEB)

    Brémond, Éric, E-mail: eric.bremond@iit.it; Savarese, Marika [CompuNet, Istituto Italiano di Tecnologia, via Morego 30, I-16163 Genoa (Italy); Sancho-García, Juan C.; Pérez-Jiménez, Ángel J. [Departamento de Química Física, Universidad de Alicante, E-03080 Alicante (Spain); Adamo, Carlo [CompuNet, Istituto Italiano di Tecnologia, via Morego 30, I-16163 Genoa (Italy); Chimie ParisTech, PSL Research University, CNRS, Institut de Recherche de Chimie Paris IRCP, F-75005 Paris (France); Institut Universitaire de France, 103 Boulevard Saint Michel, F-75005 Paris (France)

    2016-03-28

    We propose two analytical expressions aiming to rationalize the spin-component-scaled (SCS) and spin-opposite-scaled (SOS) schemes for double-hybrid exchange-correlation density-functionals. Their performances are extensively tested within the framework of the nonempirical quadratic integrand double-hybrid (QIDH) model on energetic properties included into the very large GMTKN30 benchmark database, and on structural properties of semirigid medium-sized organic compounds. The SOS variant is revealed as a less computationally demanding alternative to reach the accuracy of the original QIDH model without losing any theoretical background.

  3. SPEECH EMOTION RECOGNITION USING MODIFIED QUADRATIC DISCRIMINATION FUNCTION

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Quadratic Discrimination Function(QDF)is commonly used in speech emotion recognition,which proceeds on the premise that the input data is normal distribution.In this Paper,we propose a transformation to normalize the emotional features,then derivate a Modified QDF(MQDF) to speech emotion recognition.Features based on prosody and voice quality are extracted and Principal Component Analysis Neural Network (PCANN) is used to reduce dimension of the feature vectors.The results show that voice quality features are effective supplement for recognition.and the method in this paper could improve the recognition ratio effectively.

  4. On Exponential Hedging and Related Quadratic Backward Stochastic Differential Equations

    International Nuclear Information System (INIS)

    Sekine, Jun

    2006-01-01

    The dual optimization problem for the exponential hedging problem is addressed with a cone constraint. Without boundedness conditions on the terminal payoff and the drift of the Ito-type controlled process, the backward stochastic differential equation, which has a quadratic growth term in the drift, is derived as a necessary and sufficient condition for optimality via a variational method and dynamic programming. Further, solvable situations are given, in which the value and the optimizer are expressed in closed forms with the help of the Clark-Haussmann-Ocone formula

  5. Quadratic Forms and Semiclassical Eigenfunction Hypothesis for Flat Tori

    Science.gov (United States)

    T. Sardari, Naser

    2018-03-01

    Let Q( X) be any integral primitive positive definite quadratic form in k variables, where {k≥4}, and discriminant D. For any integer n, we give an upper bound on the number of integral solutions of Q( X) = n in terms of n, k, and D. As a corollary, we prove a conjecture of Lester and Rudnick on the small scale equidistribution of almost all functions belonging to any orthonormal basis of a given eigenspace of the Laplacian on the flat torus {T^d} for {d≥ 5}. This conjecture is motivated by the work of Berry [2,3] on the semiclassical eigenfunction hypothesis.

  6. Abelian groups and quadratic residues in weak arithmetic

    Czech Academy of Sciences Publication Activity Database

    Jeřábek, Emil

    2010-01-01

    Roč. 56, č. 3 (2010), s. 262-278 ISSN 0942-5616 R&D Projects: GA AV ČR IAA1019401; GA MŠk(CZ) 1M0545 Institutional research plan: CEZ:AV0Z10190503 Keywords : bounded arithmetic * abelian group * Fermat's little theorem * quadratic reciprocity Subject RIV: BA - General Mathematics Impact factor: 0.361, year: 2010 http://onlinelibrary.wiley.com/doi/10.1002/malq.200910009/abstract;jsessionid=9F636FFACB84C025FD90C7E6880350DD.f03t03

  7. Analysis of electroperforated materials using the quadrat counts method

    Energy Technology Data Exchange (ETDEWEB)

    Miranda, E; Garzon, C; Garcia-Garcia, J [Departament d' Enginyeria Electronica, Universitat Autonoma de Barcelona, 08193 Bellaterra, Barcelona (Spain); MartInez-Cisneros, C; Alonso, J, E-mail: enrique.miranda@uab.cat [Departament de Quimica AnalItica, Universitat Autonoma de Barcelona, 08193 Bellaterra, Barcelona (Spain)

    2011-06-23

    The electroperforation distribution in thin porous materials is investigated using the quadrat counts method (QCM), a classical statistical technique aimed to evaluate the deviation from complete spatial randomness (CSR). Perforations are created by means of electrical discharges generated by needle-like tungsten electrodes. The objective of perforating a thin porous material is to enhance its air permeability, a critical issue in many industrial applications involving paper, plastics, textiles, etc. Using image analysis techniques and specialized statistical software it is shown that the perforation locations follow, beyond a certain length scale, a homogeneous 2D Poisson distribution.

  8. C1 Rational Quadratic Trigonometric Interpolation Spline for Data Visualization

    Directory of Open Access Journals (Sweden)

    Shengjun Liu

    2015-01-01

    Full Text Available A new C1 piecewise rational quadratic trigonometric spline with four local positive shape parameters in each subinterval is constructed to visualize the given planar data. Constraints are derived on these free shape parameters to generate shape preserving interpolation curves for positive and/or monotonic data sets. Two of these shape parameters are constrained while the other two can be set free to interactively control the shape of the curves. Moreover, the order of approximation of developed interpolant is investigated as O(h3. Numeric experiments demonstrate that our method can construct nice shape preserving interpolation curves efficiently.

  9. Soliton interaction in quadratic and cubic bulk media

    DEFF Research Database (Denmark)

    Johansen, Steffen Kjær; Bang, Ole

    2000-01-01

    Summary form only given. The understanding of how and to what extend the cubic nonlinearity affects beam propagation and spatial soliton formation in quadratic media is of vital importance in fundamental and applied nonlinear physics. We consider beam propagation under type-I SHG conditions...... in lossless bulk second order nonlinear optical materials with a nonvanishing third order nonlinearity. It is known that in pure second order systems a single soliton can never collapse whereas in systems with both nonlinearities and that stable single soliton propagation can only in some circumstances...

  10. Linear-quadratic model predictions for tumor control probability

    International Nuclear Information System (INIS)

    Yaes, R.J.

    1987-01-01

    Sigmoid dose-response curves for tumor control are calculated from the linear-quadratic model parameters α and Β, obtained from human epidermoid carcinoma cell lines, and are much steeper than the clinical dose-response curves for head and neck cancers. One possible explanation is the presence of small radiation-resistant clones arising from mutations in an initially homogeneous tumor. Using the mutation theory of Delbruck and Luria and of Goldie and Coldman, the authors discuss the implications of such radiation-resistant clones for clinical radiation therapy

  11. Sub-quadratic decoding of one-point hermitian codes

    DEFF Research Database (Denmark)

    Nielsen, Johan Sebastian Rosenkilde; Beelen, Peter

    2015-01-01

    We present the first two sub-quadratic complexity decoding algorithms for one-point Hermitian codes. The first is based on a fast realization of the Guruswami-Sudan algorithm using state-of-the-art algorithms from computer algebra for polynomial-ring matrix minimization. The second is a power...... decoding algorithm: an extension of classical key equation decoding which gives a probabilistic decoding algorithm up to the Sudan radius. We show how the resulting key equations can be solved by the matrix minimization algorithms from computer algebra, yielding similar asymptotic complexities....

  12. Field equations for gravity quadratic in the curvature

    International Nuclear Information System (INIS)

    Rose, B.

    1992-01-01

    Vacuum field equations for gravity are studied having their origin in a Lagrangian quadratic in the curvature. The motivation for this choice of the Lagrangian-namely the treating of gravity in a strict analogy to gauge theories of Yang-Mills type-is criticized, especially the implied view of connections as gauge potentials with no dynamical relation to the metric. The correct field equations with respect to variation of the connections and the metric independently are given. We deduce field equations which differs from previous ones by variation of the metric, the torsion, and the nonmetricity from which the connections are built. 6 refs

  13. Quadratic Hamiltonians on non-symmetric Poisson structures

    International Nuclear Information System (INIS)

    Arribas, M.; Blesa, F.; Elipe, A.

    2007-01-01

    Many dynamical systems may be represented in a set of non-canonical coordinates that generate an su(2) algebraic structure. The topology of the phase space is the one of the S 2 sphere, the Poisson structure is the one of the rigid body, and the Hamiltonian is a parametric quadratic form in these 'spherical' coordinates. However, there are other problems in which the Poisson structure losses its symmetry. In this paper we analyze this case and, we show how the loss of the spherical symmetry affects the phase flow and parametric bifurcations for the bi-parametric cases

  14. Detecting the Community Structure and Activity Patterns of Temporal Networks: A Non-Negative Tensor Factorization Approach

    Science.gov (United States)

    Gauvin, Laetitia; Panisson, André; Cattuto, Ciro

    2014-01-01

    The increasing availability of temporal network data is calling for more research on extracting and characterizing mesoscopic structures in temporal networks and on relating such structure to specific functions or properties of the system. An outstanding challenge is the extension of the results achieved for static networks to time-varying networks, where the topological structure of the system and the temporal activity patterns of its components are intertwined. Here we investigate the use of a latent factor decomposition technique, non-negative tensor factorization, to extract the community-activity structure of temporal networks. The method is intrinsically temporal and allows to simultaneously identify communities and to track their activity over time. We represent the time-varying adjacency matrix of a temporal network as a three-way tensor and approximate this tensor as a sum of terms that can be interpreted as communities of nodes with an associated activity time series. We summarize known computational techniques for tensor decomposition and discuss some quality metrics that can be used to tune the complexity of the factorized representation. We subsequently apply tensor factorization to a temporal network for which a ground truth is available for both the community structure and the temporal activity patterns. The data we use describe the social interactions of students in a school, the associations between students and school classes, and the spatio-temporal trajectories of students over time. We show that non-negative tensor factorization is capable of recovering the class structure with high accuracy. In particular, the extracted tensor components can be validated either as known school classes, or in terms of correlated activity patterns, i.e., of spatial and temporal coincidences that are determined by the known school activity schedule. PMID:24497935

  15. Exploring syndrome differentiation using non-negative matrix factorization and cluster analysis in patients with atopic dermatitis.

    Science.gov (United States)

    Yun, Younghee; Jung, Wonmo; Kim, Hyunho; Jang, Bo-Hyoung; Kim, Min-Hee; Noh, Jiseong; Ko, Seong-Gyu; Choi, Inhwa

    2017-08-01

    Syndrome differentiation (SD) results in a diagnostic conclusion based on a cluster of concurrent symptoms and signs, including pulse form and tongue color. In Korea, there is a strong interest in the standardization of Traditional Medicine (TM). In order to standardize TM treatment, standardization of SD should be given priority. The aim of this study was to explore the SD, or symptom clusters, of patients with atopic dermatitis (AD) using non-negative factorization methods and k-means clustering analysis. We screened 80 patients and enrolled 73 eligible patients. One TM dermatologist evaluated the symptoms/signs using an existing clinical dataset from patients with AD. This dataset was designed to collect 15 dermatologic and 18 systemic symptoms/signs associated with AD. Non-negative matrix factorization was used to decompose the original data into a matrix with three features and a weight matrix. The point of intersection of the three coordinates from each patient was placed in three-dimensional space. With five clusters, the silhouette score reached 0.484, and this was the best silhouette score obtained from two to nine clusters. Patients were clustered according to the varying severity of concurrent symptoms/signs. Through the distribution of the null hypothesis generated by 10,000 permutation tests, we found significant cluster-specific symptoms/signs from the confidence intervals in the upper and lower 2.5% of the distribution. Patients in each cluster showed differences in symptoms/signs and severity. In a clinical situation, SD and treatment are based on the practitioners' observations and clinical experience. SD, identified through informatics, can contribute to development of standardized, objective, and consistent SD for each disease. Copyright © 2017. Published by Elsevier Ltd.

  16. Cyclic subgroups in class groups of real quadratic fields

    International Nuclear Information System (INIS)

    Washington, L.C.; Zhang Xianke.

    1994-01-01

    While examining the class numbers of the real quadratic field Q(√n 2 + 3n + 9), we observed that the class number is often a multiple of 3. There is a simple explanation for this, namely -27 = (2n + 3) 2 - 4(n 2 + 3n + 9), so the cubes of the prime ideals above 3 are principal. If the prime ideals themselves are non-principal then 3 must divide the class number. In the present paper, we study this idea from a couple different directions. In the first section we present a criterion that allows us to show that the ideal class group of a real quadratic field has a cyclic subgroup of a given order n. We then give several families of fields to which this criterion applies, hence in which the ideal class groups contain elements of order n. In the second section, we discuss the situation where there is only a potential element of order p (=an odd prime) in the class group, such as the situation described above. We present a modification of the Cohen-Lenstra heuristics for the probability that in this situation the class number is actually a multiple of p. We also extend this idea to predict how often the potential element of order p is actually non-trivial. Both of these predictions agree fairly well with the numerical data. (author). 14 refs, 2 tabs

  17. Universality of quadratic to linear magnetoresistance crossover in disordered conductors

    Science.gov (United States)

    Lara, Silvia; Ramakrishnan, Navneeth; Lai, Ying Tong; Adam, Shaffique

    Many experiments measuring Magnetoresistance (MR) showed unsaturating linear behavior at high magnetic fields and quadratic behavior at low fields. In the literature, two very different theoretical models have been used to explain this classical MR as a consequence of sample disorder. The phenomenological Random Resistor Network (RRN) model constructs a grid of four-terminal resistors each with a varying random resistance. The Effective Medium Theory (EMT) model imagines a smoothly varying disorder potential that causes a continuous variation of the local conductivity. In this theoretical work, we demonstrate numerically that both the RRN and EMT models belong to the same universality class, and that a single parameter (the ratio of the fluctuations in the carrier density to the average carrier density) completely determines both the magnitude of the MR and the B-field scale for the crossover from quadratic to linear MR. By considering several experimental data sets in the literature, ranging from thin films of InSb to graphene to Weyl semimetals like Na3Bi, we show that this disorder-induced mechanism for MR is in good agreement with the experiments, and that this comparison of MR with theory reveals information about the spatial carrier density inhomogeneity. This work was supported by the National Research Foundation of Singapore (NRF-NRFF2012-01).

  18. STRUCTURE OPTIMIZATION OF RESERVATION BY PRECISE QUADRATIC REGULARIZATION

    Directory of Open Access Journals (Sweden)

    KOSOLAP A. I.

    2015-11-01

    Full Text Available The problem of optimization of the structure of systems redundancy elements. Such problems arise in the design of complex systems. To improve the reliability of operation of such systems of its elements are duplicated. This increases system cost and improves its reliability. When optimizing these systems is maximized probability of failure of the entire system while limiting its cost or the cost is minimized for a given probability of failure-free operation. A mathematical model of the problem is a discrete backup multiextremal. To search for the global extremum of currently used methods of Lagrange multipliers, coordinate descent, dynamic programming, random search. These methods guarantee a just and local solutions are used in the backup tasks of small dimension. In the work for solving redundancy uses a new method for accurate quadratic regularization. This method allows you to convert the original discrete problem to the maximization of multi vector norm on a convex set. This means that the diversity of the tasks given to the problem of redundancy maximize vector norm on a convex set. To solve the problem, a reformed straightdual interior point methods. Currently, it is the best method for local optimization of nonlinear problems. Transformed the task includes a new auxiliary variable, which is determined by dichotomy. There have been numerous comparative numerical experiments in problems with the number of redundant subsystems to one hundred. These experiments confirm the effectiveness of the method of precise quadratic regularization for solving problems of redundancy.

  19. DQM: Decentralized Quadratically Approximated Alternating Direction Method of Multipliers

    Science.gov (United States)

    Mokhtari, Aryan; Shi, Wei; Ling, Qing; Ribeiro, Alejandro

    2016-10-01

    This paper considers decentralized consensus optimization problems where nodes of a network have access to different summands of a global objective function. Nodes cooperate to minimize the global objective by exchanging information with neighbors only. A decentralized version of the alternating directions method of multipliers (DADMM) is a common method for solving this category of problems. DADMM exhibits linear convergence rate to the optimal objective but its implementation requires solving a convex optimization problem at each iteration. This can be computationally costly and may result in large overall convergence times. The decentralized quadratically approximated ADMM algorithm (DQM), which minimizes a quadratic approximation of the objective function that DADMM minimizes at each iteration, is proposed here. The consequent reduction in computational time is shown to have minimal effect on convergence properties. Convergence still proceeds at a linear rate with a guaranteed constant that is asymptotically equivalent to the DADMM linear convergence rate constant. Numerical results demonstrate advantages of DQM relative to DADMM and other alternatives in a logistic regression problem.

  20. Wave propagation in elastic medium with heterogeneous quadratic nonlinearity

    International Nuclear Information System (INIS)

    Tang Guangxin; Jacobs, Laurence J.; Qu Jianmin

    2011-01-01

    This paper studies the one-dimensional wave propagation in an elastic medium with spatially non-uniform quadratic nonlinearity. Two problems are solved analytically. One is for a time-harmonic wave propagating in a half-space where the displacement is prescribed on the surface of the half-space. It is found that spatial non-uniformity of the material nonlinearity causes backscattering of the second order harmonic, which when combined with the forward propagating waves generates a standing wave in steady-state wave motion. The second problem solved is the reflection from and transmission through a layer of finite thickness embedded in an otherwise linearly elastic medium of infinite extent, where it is assumed that the layer has a spatially non-uniform quadratic nonlinearity. The results show that the transmission coefficient for the second order harmonic is proportional to the spatial average of the nonlinearity across the thickness of the layer, independent of the spatial distribution of the nonlinearity. On the other hand, the coefficient of reflection is proportional to a weighted average of the nonlinearity across the layer thickness. The weight function in this weighted average is related to the propagating phase, thus making the coefficient of reflection dependent on the spatial distribution of the nonlinearity. Finally, the paper concludes with some discussions on how to use the reflected and transmitted second harmonic waves to evaluate the variance and autocorrelation length of nonlinear parameter β when the nonlinearity distribution in the layer is a stochastic process.

  1. Electroweak vacuum stability and finite quadratic radiative corrections

    Energy Technology Data Exchange (ETDEWEB)

    Masina, Isabella [Ferrara Univ. (Italy). Dipt. di Fisica e Scienze della Terra; INFN, Sezione di Ferrara (Italy); Southern Denmark Univ., Odense (Denmark). CP3-Origins; Southern Denmark Univ., Odense (Denmark). DIAS; Nardini, Germano [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Quiros, Mariano [Institucio Catalana de Recerca i Estudis Avancats (ICREA), Barcelona (Spain); IFAE-IAB, Barcelona (Spain)

    2015-07-15

    If the Standard Model (SM) is an effective theory, as currently believed, it is valid up to some energy scale Λ to which the Higgs vacuum expectation value is sensitive throughout radiative quadratic terms. The latter ones destabilize the electroweak vacuum and generate the SM hierarchy problem. For a given perturbative Ultraviolet (UV) completion, the SM cutoff can be computed in terms of fundamental parameters. If the UV mass spectrum involves several scales the cutoff is not unique and each SM sector has its own UV cutoff Λ{sub i}. We have performed this calculation assuming the Minimal Supersymmetric Standard Model (MSSM) is the SM UV completion. As a result, from the SM point of view, the quadratic corrections to the Higgs mass are equivalent to finite threshold contributions. For the measured values of the top quark and Higgs masses, and depending on the values of the different cutoffs Λ{sub i}, these contributions can cancel even at renormalization scales as low as multi-TeV, unlike the case of a single cutoff where the cancellation only occurs at Planckian energies, a result originally obtained by Veltman. From the MSSM point of view, the requirement of stability of the electroweak minimum under radiative corrections is incorporated into the matching conditions and provides an extra constraint on the Focus Point solution to the little hierarchy problem in the MSSM. These matching conditions can be employed for precise calculations of the Higgs sector in scenarios with heavy supersymmetric fields.

  2. Learning quadratic receptive fields from neural responses to natural stimuli.

    Science.gov (United States)

    Rajan, Kanaka; Marre, Olivier; Tkačik, Gašper

    2013-07-01

    Models of neural responses to stimuli with complex spatiotemporal correlation structure often assume that neurons are selective for only a small number of linear projections of a potentially high-dimensional input. In this review, we explore recent modeling approaches where the neural response depends on the quadratic form of the input rather than on its linear projection, that is, the neuron is sensitive to the local covariance structure of the signal preceding the spike. To infer this quadratic dependence in the presence of arbitrary (e.g., naturalistic) stimulus distribution, we review several inference methods, focusing in particular on two information theory-based approaches (maximization of stimulus energy and of noise entropy) and two likelihood-based approaches (Bayesian spike-triggered covariance and extensions of generalized linear models). We analyze the formal relationship between the likelihood-based and information-based approaches to demonstrate how they lead to consistent inference. We demonstrate the practical feasibility of these procedures by using model neurons responding to a flickering variance stimulus.

  3. On bent and semi-bent quadratic Boolean functions

    DEFF Research Database (Denmark)

    Charpin, P.; Pasalic, Enes; Tavernier, C.

    2005-01-01

    correlation and high nonlinearity. We say that such a sequence is generated by a semi-bent function. Some new families of such function, represented by f(x) = Sigma(i=1)(n-1/2) c(i)Tr(x(2t+1)), n odd and c(i) is an element of F-2, have recently (2002) been introduced by Khoo et al. We first generalize......The maximum-length sequences, also called m-sequences, have received a lot of attention since the late 1960s. In terms of linear-feedback shift register (LFSR) synthesis they are usually generated by certain power polynomials over a finite field and in addition are characterized by a low cross...... their results to even n. We further investigate the conditions on the choice of ci for explicit definitions of new infinite families having three and four trace terms. Also, a class of nonpermutation polynomials whose composition with a quadratic function yields again a quadratic semi-bent function is specified...

  4. Complex projective threefolds with non-negative canonical Euler-Poincare characteristic

    OpenAIRE

    Chen, Meng; Zuo, Kang

    2006-01-01

    Let $V$ be a complex nonsingular projective 3-fold of general type with $\\chi(\\omega_V)\\geq 0$ (resp. $>0$). We prove that the m-canonical map $\\Phi_{|mK_V|}$ is birational onto its image for all $m\\ge 14$ (resp. $\\geq 8$). Known examples show that the lower bound $r_3=14$ (resp. $=8$) is optimal.

  5. Effects of quadratic and cubic nonlinearities on a perfectly tuned parametric amplifier

    DEFF Research Database (Denmark)

    Neumeyer, Stefan; Sorokin, Vladislav; Thomsen, Jon Juel

    2016-01-01

    We consider the performance of a parametric amplifier with perfect tuning (two-to-one ratio between the parametric and direct excitation frequencies) and quadratic and cubic nonlinearities. A forced Duffing–Mathieu equation with appended quadratic nonlinearity is considered as the model system......, and approximate analytical steady-state solutions and corresponding stabilities are obtained by the method of varying amplitudes. Some general effects of pure quadratic, and mixed quadratic and cubic nonlinearities on parametric amplification are shown. In particular, the effects of mixed quadratic and cubic...... nonlinearities may generate additional amplitude–frequency solutions. In this case an increased response and a more phase sensitive amplitude (phase between excitation frequencies) is obtained, as compared to the case with either pure quadratic or cubic nonlinearity. Furthermore, jumps and bi...

  6. The Model and Quadratic Stability Problem of Buck Converter in DCM

    Directory of Open Access Journals (Sweden)

    Li Xiaojing

    2016-01-01

    Full Text Available Quadratic stability is an important performance for control systems. At first, the model of Buck Converter in DCM is built based on the theories of hybrid systems and switched linear systems primarily. Then quadratic stability of SLS and hybrid feedback switching rule are introduced. The problem of Buck Converter’s quadratic stability is researched afterwards. In the end, the simulation analysis and verification are provided. Both experimental verification and theoretical analysis results indicate that the output of Buck Converter in DCM has an excellent performance via quadratic stability control and switching rules.

  7. A Quadratically Convergent O(square root of nL-Iteration Algorithm for Linear Programming

    National Research Council Canada - National Science Library

    Ye, Y; Gueler, O; Tapia, Richard A; Zhang, Y

    1991-01-01

    ...)-iteration complexity while exhibiting superlinear convergence of the duality gap to zero under the assumption that the iteration sequence converges, and quadratic convergence of the duality gap...

  8. Describing Quadratic Cremer Point Polynomials by Parabolic Perturbations

    DEFF Research Database (Denmark)

    Sørensen, Dan Erik Krarup

    1996-01-01

    We describe two infinite order parabolic perturbation proceduresyielding quadratic polynomials having a Cremer fixed point. The main ideais to obtain the polynomial as the limit of repeated parabolic perturbations.The basic tool at each step is to control the behaviour of certain externalrays.......Polynomials of the Cremer type correspond to parameters at the boundary of ahyperbolic component of the Mandelbrot set. In this paper we concentrate onthe main cardioid component. We investigate the differences between two-sided(i.e. alternating) and one-sided parabolic perturbations.In the two-sided case, we prove...... the existence of polynomials having an explicitlygiven external ray accumulating both at the Cremer point and at its non-periodicpreimage. We think of the Julia set as containing a "topologists double comb".In the one-sided case we prove a weaker result: the existence of polynomials havingan explicitly given...

  9. Diagonalizing quadratic bosonic operators by non-autonomous flow equations

    CERN Document Server

    Bach, Volker

    2016-01-01

    The authors study a non-autonomous, non-linear evolution equation on the space of operators on a complex Hilbert space. They specify assumptions that ensure the global existence of its solutions and allow them to derive its asymptotics at temporal infinity. They demonstrate that these assumptions are optimal in a suitable sense and more general than those used before. The evolution equation derives from the Brocketâe"Wegner flow that was proposed to diagonalize matrices and operators by a strongly continuous unitary flow. In fact, the solution of the non-linear flow equation leads to a diagonalization of Hamiltonian operators in boson quantum field theory which are quadratic in the field.

  10. Optimal Piecewise-Linear Approximation of the Quadratic Chaotic Dynamics

    Directory of Open Access Journals (Sweden)

    J. Petrzela

    2012-04-01

    Full Text Available This paper shows the influence of piecewise-linear approximation on the global dynamics associated with autonomous third-order dynamical systems with the quadratic vector fields. The novel method for optimal nonlinear function approximation preserving the system behavior is proposed and experimentally verified. This approach is based on the calculation of the state attractor metric dimension inside a stochastic optimization routine. The approximated systems are compared to the original by means of the numerical integration. Real electronic circuits representing individual dynamical systems are derived using classical as well as integrator-based synthesis and verified by time-domain analysis in Orcad Pspice simulator. The universality of the proposed method is briefly discussed, especially from the viewpoint of the higher-order dynamical systems. Future topics and perspectives are also provided

  11. Absence of the Gribov ambiguity in a quadratic gauge

    International Nuclear Information System (INIS)

    Raval, Haresh

    2016-01-01

    The Gribov ambiguity exists in various gauges. Algebraic gauges are likely to be ambiguity free. However, algebraic gauges are not Lorentz invariant, which is their fundamental flaw. In addition, they are not generally compatible with the boundary conditions on the gauge fields, which are needed to compactify the space i.e., the ambiguity continues to exist on a compact manifold. Here we discuss a quadratic gauge fixing, which is Lorentz invariant. We consider an example of a spherically symmetric gauge field configuration in which we prove that this Lorentz invariant gauge removes the ambiguity on a compact manifold S 3 , when a proper boundary condition on the gauge configuration is taken into account. Thus, we provide one example where the ambiguity is absent on a compact manifold in the algebraic gauge. We also show that the BRST invariance is preserved in this gauge. (orig.)

  12. Absence of the Gribov ambiguity in a quadratic gauge

    Energy Technology Data Exchange (ETDEWEB)

    Raval, Haresh [Indian Institute of Technology, Bombay, Department of Physics, Mumbai (India)

    2016-05-15

    The Gribov ambiguity exists in various gauges. Algebraic gauges are likely to be ambiguity free. However, algebraic gauges are not Lorentz invariant, which is their fundamental flaw. In addition, they are not generally compatible with the boundary conditions on the gauge fields, which are needed to compactify the space i.e., the ambiguity continues to exist on a compact manifold. Here we discuss a quadratic gauge fixing, which is Lorentz invariant. We consider an example of a spherically symmetric gauge field configuration in which we prove that this Lorentz invariant gauge removes the ambiguity on a compact manifold S{sup 3}, when a proper boundary condition on the gauge configuration is taken into account. Thus, we provide one example where the ambiguity is absent on a compact manifold in the algebraic gauge. We also show that the BRST invariance is preserved in this gauge. (orig.)

  13. Quadratic time dependent Hamiltonians and separation of variables

    Science.gov (United States)

    Anzaldo-Meneses, A.

    2017-06-01

    Time dependent quantum problems defined by quadratic Hamiltonians are solved using canonical transformations. The Green's function is obtained and a comparison with the classical Hamilton-Jacobi method leads to important geometrical insights like exterior differential systems, Monge cones and time dependent Gaussian metrics. The Wei-Norman approach is applied using unitary transformations defined in terms of generators of the associated Lie groups, here the semi-direct product of the Heisenberg group and the symplectic group. A new explicit relation for the unitary transformations is given in terms of a finite product of elementary transformations. The sequential application of adequate sets of unitary transformations leads naturally to a new separation of variables method for time dependent Hamiltonians, which is shown to be related to the Inönü-Wigner contraction of Lie groups. The new method allows also a better understanding of interacting particles or coupled modes and opens an alternative way to analyze topological phases in driven systems.

  14. Trajectory generation for manipulators using linear quadratic optimal tracking

    Directory of Open Access Journals (Sweden)

    Olav Egeland

    1989-04-01

    Full Text Available The reference trajectory is normally known in advance in manipulator control which makes it possible to apply linear quadratic optimal tracking. This gives a control system which rounds corners and generates optimal feedforward. The method may be used for references consisting of straight-line segments as an alternative to the two-step method of using splines to smooth the reference and then applying feedforward. In addition, the method can be used for more complex trajectories. The actual dynamics of the manipulator are taken into account, and this results in smooth and accurate tracking. The method has been applied in combination with the computed torque technique and excellent performance was demonstrated in a simulation study. The method has also been applied experimentally to an industrial spray-painting robot where a saw-tooth reference was tracked. The corner was rounded extremely well, and the steady-state tracking error was eliminated by the optimal feedforward.

  15. Low photon count based digital holography for quadratic phase cryptography.

    Science.gov (United States)

    Muniraj, Inbarasan; Guo, Changliang; Malallah, Ra'ed; Ryle, James P; Healy, John J; Lee, Byung-Geun; Sheridan, John T

    2017-07-15

    Recently, the vulnerability of the linear canonical transform-based double random phase encryption system to attack has been demonstrated. To alleviate this, we present for the first time, to the best of our knowledge, a method for securing a two-dimensional scene using a quadratic phase encoding system operating in the photon-counted imaging (PCI) regime. Position-phase-shifting digital holography is applied to record the photon-limited encrypted complex samples. The reconstruction of the complex wavefront involves four sparse (undersampled) dataset intensity measurements (interferograms) at two different positions. Computer simulations validate that the photon-limited sparse-encrypted data has adequate information to authenticate the original data set. Finally, security analysis, employing iterative phase retrieval attacks, has been performed.

  16. Limits to compression with cascaded quadratic soliton compressors

    DEFF Research Database (Denmark)

    Bache, Morten; Bang, Ole; Krolikowski, Wieslaw

    2008-01-01

    We study cascaded quadratic soliton compressors and address the physical mechanisms that limit the compression. A nonlocal model is derived, and the nonlocal response is shown to have an additional oscillatory component in the nonstationary regime when the group-velocity mismatch (GVM) is strong....... This inhibits efficient compression. Raman-like perturbations from the cascaded nonlinearity, competing cubic nonlinearities, higher-order dispersion, and soliton energy may also limit compression, and through realistic numerical simulations we point out when each factor becomes important. We find......, the simulations show that reaching single-cycle duration is ultimately inhibited by competing cubic nonlinearities as well as dispersive waves, that only show up when taking higher-order dispersion into account....

  17. Wind turbine power tracking using an improved multimodel quadratic approach.

    Science.gov (United States)

    Khezami, Nadhira; Benhadj Braiek, Naceur; Guillaud, Xavier

    2010-07-01

    In this paper, an improved multimodel optimal quadratic control structure for variable speed, pitch regulated wind turbines (operating at high wind speeds) is proposed in order to integrate high levels of wind power to actively provide a primary reserve for frequency control. On the basis of the nonlinear model of the studied plant, and taking into account the wind speed fluctuations, and the electrical power variation, a multimodel linear description is derived for the wind turbine, and is used for the synthesis of an optimal control law involving a state feedback, an integral action and an output reference model. This new control structure allows a rapid transition of the wind turbine generated power between different desired set values. This electrical power tracking is ensured with a high-performance behavior for all other state variables: turbine and generator rotational speeds and mechanical shaft torque; and smooth and adequate evolution of the control variables. 2010 ISA. Published by Elsevier Ltd. All rights reserved.

  18. Neural network for solving convex quadratic bilevel programming problems.

    Science.gov (United States)

    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.

  19. Quadratic Finite Element Method for 1D Deterministic Transport

    International Nuclear Information System (INIS)

    Tolar, D R Jr.; Ferguson, J M

    2004-01-01

    In the discrete ordinates, or SN, numerical solution of the transport equation, both the spatial ((und r)) and angular ((und (Omega))) dependences on the angular flux ψ(und r),(und (Omega))are modeled discretely. While significant effort has been devoted toward improving the spatial discretization of the angular flux, we focus on improving the angular discretization of ψ(und r),(und (Omega)). Specifically, we employ a Petrov-Galerkin quadratic finite element approximation for the differencing of the angular variable (μ) in developing the one-dimensional (1D) spherical geometry S N equations. We develop an algorithm that shows faster convergence with angular resolution than conventional S N algorithms

  20. Schwarz and multilevel methods for quadratic spline collocation

    Energy Technology Data Exchange (ETDEWEB)

    Christara, C.C. [Univ. of Toronto, Ontario (Canada); Smith, B. [Univ. of California, Los Angeles, CA (United States)

    1994-12-31

    Smooth spline collocation methods offer an alternative to Galerkin finite element methods, as well as to Hermite spline collocation methods, for the solution of linear elliptic Partial Differential Equations (PDEs). Recently, optimal order of convergence spline collocation methods have been developed for certain degree splines. Convergence proofs for smooth spline collocation methods are generally more difficult than for Galerkin finite elements or Hermite spline collocation, and they require stronger assumptions and more restrictions. However, numerical tests indicate that spline collocation methods are applicable to a wider class of problems, than the analysis requires, and are very competitive to finite element methods, with respect to efficiency. The authors will discuss Schwarz and multilevel methods for the solution of elliptic PDEs using quadratic spline collocation, and compare these with domain decomposition methods using substructuring. Numerical tests on a variety of parallel machines will also be presented. In addition, preliminary convergence analysis using Schwarz and/or maximum principle techniques will be presented.

  1. Engineering quadratic nonlinear photonic crystals for frequency conversion of lasers

    Science.gov (United States)

    Chen, Baoqin; Hong, Lihong; Hu, Chenyang; Zhang, Chao; Liu, Rongjuan; Li, Zhiyuan

    2018-03-01

    Nonlinear frequency conversion offers an effective way to extend the laser wavelength range. Quadratic nonlinear photonic crystals (NPCs) are artificial materials composed of domain-inversion structures whose sign of nonlinear coefficients are modulated with desire to implement quasi-phase matching (QPM) required for nonlinear frequency conversion. These structures can offer various reciprocal lattice vectors (RLVs) to compensate the phase-mismatching during the quadratic nonlinear optical processes, including second-harmonic generation (SHG), sum-frequency generation and the cascaded third-harmonic generation (THG). The modulation pattern of the nonlinear coefficients is flexible, which can be one-dimensional or two-dimensional (2D), be periodic, quasi-periodic, aperiodic, chirped, or super-periodic. As a result, these NPCs offer very flexible QPM scheme to satisfy various nonlinear optics and laser frequency conversion problems via design of the modulation patterns and RLV spectra. In particular, we introduce the electric poling technique for fabricating QPM structures, a simple effective nonlinear coefficient model for efficiently and precisely evaluating the performance of QPM structures, the concept of super-QPM and super-periodically poled lithium niobate for finely tuning nonlinear optical interactions, the design of 2D ellipse QPM NPC structures enabling continuous tunability of SHG in a broad bandwidth by simply changing the transport direction of pump light, and chirped QPM structures that exhibit broadband RLVs and allow for simultaneous radiation of broadband SHG, THG, HHG and thus coherent white laser from a single crystal. All these technical, theoretical, and physical studies on QPM NPCs can help to gain a deeper insight on the mechanisms, approaches, and routes for flexibly controlling the interaction of lasers with various QPM NPCs for high-efficiency frequency conversion and creation of novel lasers.

  2. Estimation of stature from sternum - Exploring the quadratic models.

    Science.gov (United States)

    Saraf, Ashish; Kanchan, Tanuj; Krishan, Kewal; Ateriya, Navneet; Setia, Puneet

    2018-04-14

    Identification of the dead is significant in examination of unknown, decomposed and mutilated human remains. Establishing the biological profile is the central issue in such a scenario, and stature estimation remains one of the important criteria in this regard. The present study was undertaken to estimate stature from different parts of the sternum. A sample of 100 sterna was obtained from individuals during the medicolegal autopsies. Length of the deceased and various measurements of the sternum were measured. Student's t-test was performed to find the sex differences in stature and sternal measurements included in the study. Correlation between stature and sternal measurements were analysed using Karl Pearson's correlation, and linear and quadratic regression models were derived. All the measurements were found to be significantly larger in males than females. Stature correlated best with the combined length of sternum, among males (R = 0.894), females (R = 0.859), and for the total sample (R = 0.891). The study showed that the models derived for stature estimation from combined length of sternum are likely to give the most accurate estimates of stature in forensic case work when compared to manubrium and mesosternum. Accuracy of stature estimation further increased with quadratic models derived for the mesosternum among males and combined length of sternum among males and females when compared to linear regression models. Future studies in different geographical locations and a larger sample size are proposed to confirm the study observations. Copyright © 2018 Elsevier Ltd and Faculty of Forensic and Legal Medicine. All rights reserved.

  3. Solutions of the Schrödinger equation with inversely quadratic Hellmann plus inversely quadratic potential using Nikiforov-Uvarov method

    International Nuclear Information System (INIS)

    Ita, B. I.; Ehi-Eromosele, C. O.; Edobor-Osoh, A.; Ikeuba, A. I.

    2014-01-01

    By using the Nikiforov-Uvarov (NU) method, the Schrödinger equation has been solved for the interaction of inversely quadratic Hellmann (IQHP) and inversely quadratic potential (IQP) for any angular momentum quantum number, l. The energy eigenvalues and their corresponding eigenfunctions have been obtained in terms of Laguerre polynomials. Special cases of the sum of these potentials have been considered and their energy eigenvalues also obtained

  4. Dynamics of a new family of iterative processes for quadratic polynomials

    Science.gov (United States)

    Gutiérrez, J. M.; Hernández, M. A.; Romero, N.

    2010-03-01

    In this work we show the presence of the well-known Catalan numbers in the study of the convergence and the dynamical behavior of a family of iterative methods for solving nonlinear equations. In fact, we introduce a family of methods, depending on a parameter . These methods reach the order of convergence m+2 when they are applied to quadratic polynomials with different roots. Newton's and Chebyshev's methods appear as particular choices of the family appear for m=0 and m=1, respectively. We make both analytical and graphical studies of these methods, which give rise to rational functions defined in the extended complex plane. Firstly, we prove that the coefficients of the aforementioned family of iterative processes can be written in terms of the Catalan numbers. Secondly, we make an incursion into its dynamical behavior. In fact, we show that the rational maps related to these methods can be written in terms of the entries of the Catalan triangle. Next we analyze its general convergence, by including some computer plots showing the intricate structure of the Universal Julia sets associated with the methods.

  5. Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem

    NARCIS (Netherlands)

    de Klerk, E.; Sotirov, R.

    2007-01-01

    We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E. Burkard,

  6. Scaling laws for soliton pulse compression by cascaded quadratic nonlinearities (vol 24, pg 2752, 2007)

    DEFF Research Database (Denmark)

    Bache, Morten; Moses, J.; Wise, F.W.

    2010-01-01

    Erratum for [M. Bache, J. Moses, and F. W. Wise, "Scaling laws for soliton pulse compression by cascaded quadratic nonlinearities," J. Opt. Soc. Am. B 24, 2752-2762 (2007)].......Erratum for [M. Bache, J. Moses, and F. W. Wise, "Scaling laws for soliton pulse compression by cascaded quadratic nonlinearities," J. Opt. Soc. Am. B 24, 2752-2762 (2007)]....

  7. An Alternating Direction Method for Convex Quadratic Second-Order Cone Programming with Bounded Constraints

    Directory of Open Access Journals (Sweden)

    Xuewen Mu

    2015-01-01

    quadratic programming over second-order cones and a bounded set. At each iteration, we only need to compute the metric projection onto the second-order cones and the projection onto the bound set. The result of convergence is given. Numerical results demonstrate that our method is efficient for the convex quadratic second-order cone programming problems with bounded constraints.

  8. The regular indefinite linear-quadratic problem with linear endpoint constraints

    NARCIS (Netherlands)

    Soethoudt, J.M.; Trentelman, H.L.

    1989-01-01

    This paper deals with the infinite horizon linear-quadratic problem with indefinite cost. Given a linear system, a quadratic cost functional and a subspace of the state space, we consider the problem of minimizing the cost functional over all inputs for which the state trajectory converges to that

  9. A Novel Single Switch Transformerless Quadratic DC/DC Buck-Boost Converter

    DEFF Research Database (Denmark)

    Mostaan, Ali; A. Gorji, Saman; N. Soltani, Mohsen

    2017-01-01

    A novel quadratic buck-boost DC/DC converter is presented in this study. The proposed converter utilizes only one active switch and can step-up/down the input voltage, while the existing single switch quadratic buck/boost converters can only work in step-up or step-down mode. First, the proposed ...

  10. Geometrical Solutions of Some Quadratic Equations with Non-Real Roots

    Science.gov (United States)

    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…

  11. Estimating sample size for a small-quadrat method of botanical ...

    African Journals Online (AJOL)

    Reports the results of a study conducted to determine an appropriate sample size for a small-quadrat method of botanical survey for application in the Mixed Bushveld of South Africa. Species density and grass density were measured using a small-quadrat method in eight plant communities in the Nylsvley Nature Reserve.

  12. Mapping out Map Libraries

    Directory of Open Access Journals (Sweden)

    Ferjan Ormeling

    2008-09-01

    Full Text Available Discussing the requirements for map data quality, map users and their library/archives environment, the paper focuses on the metadata the user would need for a correct and efficient interpretation of the map data. For such a correct interpretation, knowledge of the rules and guidelines according to which the topographers/cartographers work (such as the kind of data categories to be collected, and the degree to which these rules and guidelines were indeed followed are essential. This is not only valid for the old maps stored in our libraries and archives, but perhaps even more so for the new digital files as the format in which we now have to access our geospatial data. As this would be too much to ask from map librarians/curators, some sort of web 2.0 environment is sought where comments about data quality, completeness and up-to-dateness from knowledgeable map users regarding the specific maps or map series studied can be collected and tagged to scanned versions of these maps on the web. In order not to be subject to the same disadvantages as Wikipedia, where the ‘communis opinio’ rather than scholarship, seems to be decisive, some checking by map curators of this tagged map use information would still be needed. Cooperation between map curators and the International Cartographic Association ( ICA map and spatial data use commission to this end is suggested.

  13. Non-negative Matrix Factorization for Self-calibration of Photometric Redshift Scatter in Weak-lensing Surveys

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Le; Yu, Yu; Zhang, Pengjie, E-mail: lezhang@sjtu.edu.cn [Department of Astronomy, Shanghai Jiao Tong University, Shanghai, 200240 (China)

    2017-10-10

    Photo- z error is one of the major sources of systematics degrading the accuracy of weak-lensing cosmological inferences. Zhang et al. proposed a self-calibration method combining galaxy–galaxy correlations and galaxy–shear correlations between different photo- z bins. Fisher matrix analysis shows that it can determine the rate of photo- z outliers at a level of 0.01%–1% merely using photometric data and do not rely on any prior knowledge. In this paper, we develop a new algorithm to implement this method by solving a constrained nonlinear optimization problem arising in the self-calibration process. Based on the techniques of fixed-point iteration and non-negative matrix factorization, the proposed algorithm can efficiently and robustly reconstruct the scattering probabilities between the true- z and photo- z bins. The algorithm has been tested extensively by applying it to mock data from simulated stage IV weak-lensing projects. We find that the algorithm provides a successful recovery of the scatter rates at the level of 0.01%–1%, and the true mean redshifts of photo- z bins at the level of 0.001, which may satisfy the requirements in future lensing surveys.

  14. Modeling Polio Data Using the First Order Non-Negative Integer-Valued Autoregressive, INAR(1), Model

    Science.gov (United States)

    Vazifedan, Turaj; Shitan, Mahendran

    Time series data may consists of counts, such as the number of road accidents, the number of patients in a certain hospital, the number of customers waiting for service at a certain time and etc. When the value of the observations are large it is usual to use Gaussian Autoregressive Moving Average (ARMA) process to model the time series. However if the observed counts are small, it is not appropriate to use ARMA process to model the observed phenomenon. In such cases we need to model the time series data by using Non-Negative Integer valued Autoregressive (INAR) process. The modeling of counts data is based on the binomial thinning operator. In this paper we illustrate the modeling of counts data using the monthly number of Poliomyelitis data in United States between January 1970 until December 1983. We applied the AR(1), Poisson regression model and INAR(1) model and the suitability of these models were assessed by using the Index of Agreement(I.A.). We found that INAR(1) model is more appropriate in the sense it had a better I.A. and it is natural since the data are counts.

  15. Using Dynamic Multi-Task Non-Negative Matrix Factorization to Detect the Evolution of User Preferences in Collaborative Filtering.

    Directory of Open Access Journals (Sweden)

    Bin Ju

    Full Text Available Predicting what items will be selected by a target user in the future is an important function for recommendation systems. Matrix factorization techniques have been shown to achieve good performance on temporal rating-type data, but little is known about temporal item selection data. In this paper, we developed a unified model that combines Multi-task Non-negative Matrix Factorization and Linear Dynamical Systems to capture the evolution of user preferences. Specifically, user and item features are projected into latent factor space by factoring co-occurrence matrices into a common basis item-factor matrix and multiple factor-user matrices. Moreover, we represented both within and between relationships of multiple factor-user matrices using a state transition matrix to capture the changes in user preferences over time. The experiments show that our proposed algorithm outperforms the other algorithms on two real datasets, which were extracted from Netflix movies and Last.fm music. Furthermore, our model provides a novel dynamic topic model for tracking the evolution of the behavior of a user over time.

  16. Using Dynamic Multi-Task Non-Negative Matrix Factorization to Detect the Evolution of User Preferences in Collaborative Filtering.

    Science.gov (United States)

    Ju, Bin; Qian, Yuntao; Ye, Minchao; Ni, Rong; Zhu, Chenxi

    2015-01-01

    Predicting what items will be selected by a target user in the future is an important function for recommendation systems. Matrix factorization techniques have been shown to achieve good performance on temporal rating-type data, but little is known about temporal item selection data. In this paper, we developed a unified model that combines Multi-task Non-negative Matrix Factorization and Linear Dynamical Systems to capture the evolution of user preferences. Specifically, user and item features are projected into latent factor space by factoring co-occurrence matrices into a common basis item-factor matrix and multiple factor-user matrices. Moreover, we represented both within and between relationships of multiple factor-user matrices using a state transition matrix to capture the changes in user preferences over time. The experiments show that our proposed algorithm outperforms the other algorithms on two real datasets, which were extracted from Netflix movies and Last.fm music. Furthermore, our model provides a novel dynamic topic model for tracking the evolution of the behavior of a user over time.

  17. Robust extraction of basis functions for simultaneous and proportional myoelectric control via sparse non-negative matrix factorization

    Science.gov (United States)

    Lin, Chuang; Wang, Binghui; Jiang, Ning; Farina, Dario

    2018-04-01

    Objective. This paper proposes a novel simultaneous and proportional multiple degree of freedom (DOF) myoelectric control method for active prostheses. Approach. The approach is based on non-negative matrix factorization (NMF) of surface EMG signals with the inclusion of sparseness constraints. By applying a sparseness constraint to the control signal matrix, it is possible to extract the basis information from arbitrary movements (quasi-unsupervised approach) for multiple DOFs concurrently. Main Results. In online testing based on target hitting, able-bodied subjects reached a greater throughput (TP) when using sparse NMF (SNMF) than with classic NMF or with linear regression (LR). Accordingly, the completion time (CT) was shorter for SNMF than NMF or LR. The same observations were made in two patients with unilateral limb deficiencies. Significance. The addition of sparseness constraints to NMF allows for a quasi-unsupervised approach to myoelectric control with superior results with respect to previous methods for the simultaneous and proportional control of multi-DOF. The proposed factorization algorithm allows robust simultaneous and proportional control, is superior to previous supervised algorithms, and, because of minimal supervision, paves the way to online adaptation in myoelectric control.

  18. Generation and dynamics of quadratic birefringent spatial gap solitons

    International Nuclear Information System (INIS)

    Anghel-Vasilescu, P.; Dorignac, J.; Geniet, F.; Leon, J.; Taki, A.

    2011-01-01

    A method is proposed to generate and study the dynamics of spatial light solitons in a birefringent medium with quadratic nonlinearity. Although no analytical expression for propagating solitons has been obtained, our numerical simulations show the existence of stable localized spatial solitons in the frequency forbidden band gap of the medium. The dynamics of these objects is quite rich and manifests for instance elastic reflections, or inelastic collisions where two solitons merge and propagate as a single solitary wave. We derive the dynamics of the slowly varying envelopes of the three fields (second harmonic pump and two-component signal) and study this new system theoretically. We show that it does present a threshold for nonlinear supratransmission that can be calculated from a series expansion approach with a very high accuracy. Specific physical implications of our theoretical predictions are illustrated on LiGaTe 2 (LGT) crystals. Once irradiated by a cw laser beam of 10 μm wavelength, at an incidence beyond the extinction angle, such crystals will transmit light, in the form of spatial solitons generated in the nonlinear regime above the nonlinear supratransmission threshold.

  19. Elastic Model Transitions Using Quadratic Inequality Constrained Least Squares

    Science.gov (United States)

    Orr, Jeb S.

    2012-01-01

    A technique is presented for initializing multiple discrete finite element model (FEM) mode sets for certain types of flight dynamics formulations that rely on superposition of orthogonal modes for modeling the elastic response. Such approaches are commonly used for modeling launch vehicle dynamics, and challenges arise due to the rapidly time-varying nature of the rigid-body and elastic characteristics. By way of an energy argument, a quadratic inequality constrained least squares (LSQI) algorithm is employed to e ect a smooth transition from one set of FEM eigenvectors to another with no requirement that the models be of similar dimension or that the eigenvectors be correlated in any particular way. The physically unrealistic and controversial method of eigenvector interpolation is completely avoided, and the discrete solution approximates that of the continuously varying system. The real-time computational burden is shown to be negligible due to convenient features of the solution method. Simulation results are presented, and applications to staging and other discontinuous mass changes are discussed

  20. Quadratic stabilisability of multi-agent systems under switching topologies

    Science.gov (United States)

    Guan, Yongqiang; Ji, Zhijian; Zhang, Lin; Wang, Long

    2014-12-01

    This paper addresses the stabilisability of multi-agent systems (MASs) under switching topologies. Necessary and/or sufficient conditions are presented in terms of graph topology. These conditions explicitly reveal how the intrinsic dynamics of the agents, the communication topology and the external control input affect stabilisability jointly. With the appropriate selection of some agents to which the external inputs are applied and the suitable design of neighbour-interaction rules via a switching topology, an MAS is proved to be stabilisable even if so is not for each of uncertain subsystem. In addition, a method is proposed to constructively design a switching rule for MASs with norm-bounded time-varying uncertainties. The switching rules designed via this method do not rely on uncertainties, and the switched MAS is quadratically stabilisable via decentralised external self-feedback for all uncertainties. With respect to applications of the stabilisability results, the formation control and the cooperative tracking control are addressed. Numerical simulations are presented to demonstrate the effectiveness of the proposed results.

  1. Asymptotic behavior for a quadratic nonlinear Schrodinger equation

    Directory of Open Access Journals (Sweden)

    Pavel I. Naumkin

    2008-02-01

    Full Text Available We study the initial-value problem for the quadratic nonlinear Schrodinger equation $$displaylines{ iu_{t}+frac{1}{2}u_{xx}=partial _{x}overline{u}^{2},quad xin mathbb{R},; t>1, cr u(1,x=u_{1}(x,quad xin mathbb{R}. }$$ For small initial data $u_{1}in mathbf{H}^{2,2}$ we prove that there exists a unique global solution $uin mathbf{C}([1,infty ;mathbf{H}^{2,2}$ of this Cauchy problem. Moreover we show that the large time asymptotic behavior of the solution is defined in the region $|x|leq Csqrt{t}$ by the self-similar solution $frac{1}{sqrt{t}}MS(frac{x}{sqrt{t}}$ such that the total mass $$ frac{1}{sqrt{t}}int_{mathbb{R}}MS(frac{x}{sqrt{t}} dx=int_{mathbb{R}}u_{1}(xdx, $$ and in the far region $|x|>sqrt{t}$ the asymptotic behavior of solutions has rapidly oscillating structure similar to that of the cubic nonlinear Schrodinger equations.

  2. Quadratic electromechanical strain in silicon investigated by scanning probe microscopy

    Science.gov (United States)

    Yu, Junxi; Esfahani, Ehsan Nasr; Zhu, Qingfeng; Shan, Dongliang; Jia, Tingting; Xie, Shuhong; Li, Jiangyu

    2018-04-01

    Piezoresponse force microscopy (PFM) is a powerful tool widely used to characterize piezoelectricity and ferroelectricity at the nanoscale. However, it is necessary to distinguish microscopic mechanisms between piezoelectricity and non-piezoelectric contributions measured by PFM. In this work, we systematically investigate the first and second harmonic apparent piezoresponses of a silicon wafer in both vertical and lateral modes, and we show that it exhibits an apparent electromechanical response that is quadratic to the applied electric field, possibly arising from ionic electrochemical dipoles induced by the charged probe. As a result, the electromechanical response measured is dominated by the second harmonic response in the vertical mode, and its polarity can be switched by the DC voltage with the evolving coercive field and maximum amplitude, in sharp contrast to typical ferroelectric materials we used as control. The ionic activity in silicon is also confirmed by the scanning thermo-ionic microscopy measurement, and the work points toward a set of methods to distinguish true piezoelectricity from the apparent ones.

  3. Asymptotic performance of regularized quadratic discriminant analysis based classifiers

    KAUST Repository

    Elkhalil, Khalil

    2017-12-13

    This paper carries out a large dimensional analysis of the standard regularized quadratic discriminant analysis (QDA) classifier designed on the assumption that data arise from a Gaussian mixture model. The analysis relies on fundamental results from random matrix theory (RMT) when both the number of features and the cardinality of the training data within each class grow large at the same pace. Under some mild assumptions, we show that the asymptotic classification error converges to a deterministic quantity that depends only on the covariances and means associated with each class as well as the problem dimensions. Such a result permits a better understanding of the performance of regularized QDA and can be used to determine the optimal regularization parameter that minimizes the misclassification error probability. Despite being valid only for Gaussian data, our theoretical findings are shown to yield a high accuracy in predicting the performances achieved with real data sets drawn from popular real data bases, thereby making an interesting connection between theory and practice.

  4. Graph Modeling for Quadratic Assignment Problems Associated with the Hypercube

    International Nuclear Information System (INIS)

    Mittelmann, Hans; Peng Jiming; Wu Xiaolin

    2009-01-01

    In the paper we consider the quadratic assignment problem arising from channel coding in communications where one coefficient matrix is the adjacency matrix of a hypercube in a finite dimensional space. By using the geometric structure of the hypercube, we first show that there exist at least n different optimal solutions to the underlying QAPs. Moreover, the inherent symmetries in the associated hypercube allow us to obtain partial information regarding the optimal solutions and thus shrink the search space and improve all the existing QAP solvers for the underlying QAPs.Secondly, we use graph modeling technique to derive a new integer linear program (ILP) models for the underlying QAPs. The new ILP model has n(n-1) binary variables and O(n 3 log(n)) linear constraints. This yields the smallest known number of binary variables for the ILP reformulation of QAPs. Various relaxations of the new ILP model are obtained based on the graphical characterization of the hypercube, and the lower bounds provided by the LP relaxations of the new model are analyzed and compared with what provided by several classical LP relaxations of QAPs in the literature.

  5. Separability of diagonal symmetric states: a quadratic conic optimization problem

    Directory of Open Access Journals (Sweden)

    Jordi Tura

    2018-01-01

    Full Text Available We study the separability problem in mixtures of Dicke states i.e., the separability of the so-called Diagonal Symmetric (DS states. First, we show that separability in the case of DS in $C^d\\otimes C^d$ (symmetric qudits can be reformulated as a quadratic conic optimization problem. This connection allows us to exchange concepts and ideas between quantum information and this field of mathematics. For instance, copositive matrices can be understood as indecomposable entanglement witnesses for DS states. As a consequence, we show that positivity of the partial transposition (PPT is sufficient and necessary for separability of DS states for $d \\leq 4$. Furthermore, for $d \\geq 5$, we provide analytic examples of PPT-entangled states. Second, we develop new sufficient separability conditions beyond the PPT criterion for bipartite DS states. Finally, we focus on $N$-partite DS qubits, where PPT is known to be necessary and sufficient for separability. In this case, we present a family of almost DS states that are PPT with respect to each partition but nevertheless entangled.

  6. Linear versus quadratic portfolio optimization model with transaction cost

    Science.gov (United States)

    Razak, Norhidayah Bt Ab; Kamil, Karmila Hanim; Elias, Siti Masitah

    2014-06-01

    Optimization model is introduced to become one of the decision making tools in investment. Hence, it is always a big challenge for investors to select the best model that could fulfill their goal in investment with respect to risk and return. In this paper we aims to discuss and compare the portfolio allocation and performance generated by quadratic and linear portfolio optimization models namely of Markowitz and Maximin model respectively. The application of these models has been proven to be significant and popular among others. However transaction cost has been debated as one of the important aspects that should be considered for portfolio reallocation as portfolio return could be significantly reduced when transaction cost is taken into consideration. Therefore, recognizing the importance to consider transaction cost value when calculating portfolio' return, we formulate this paper by using data from Shariah compliant securities listed in Bursa Malaysia. It is expected that, results from this paper will effectively justify the advantage of one model to another and shed some lights in quest to find the best decision making tools in investment for individual investors.

  7. Evolution of universes in quadratic theories of gravity

    International Nuclear Information System (INIS)

    Barrow, John D.; Hervik, Sigbjoern

    2006-01-01

    We use a dynamical systems approach to investigate Bianchi type I and II universes in quadratic theories of gravity. Because of the complicated nature of the equations of motion we focus on the stability of exact solutions and find that there exists an isotropic Friedmann-Robertson-Walker (FRW) universe acting as a past attractor. This may indicate that there is an isotropization mechanism at early times for these kind of theories. We also discuss the Kasner universes, elucidate the associated center manifold structure, and show that there exists a set of nonzero measure which has the Kasner solutions as a past attractor. Regarding the late-time behavior, the stability shows a dependence of the parameters of the theory. We give the conditions under which the de Sitter solution is stable and also show that for certain values of the parameters there is a possible late-time behavior with phantomlike behavior. New types of anisotropic inflationary behavior are found which do not have counterparts in general relativity

  8. Methods of using the quadratic assignment problem solution

    Directory of Open Access Journals (Sweden)

    Izabela Kudelska

    2012-09-01

    Full Text Available Background: Quadratic assignment problem (QAP is one of the most interesting of combinatorial optimization. Was presented by Koopman and Beckamanna in 1957, as a mathematical model of the location of indivisible tasks. This problem belongs to the class NP-hard issues. This forces the application to the solution already approximate methods for tasks with a small size (over 30. Even though it is much harder than other combinatorial optimization problems, it enjoys wide interest because it models the important class of decision problems. Material and methods: The discussion was an artificial intelligence tool that allowed to solve the problem QAP, among others are: genetic algorithms, Tabu Search, Branch and Bound. Results and conclusions: QAP did not arise directly as a model for certain actions, but he found its application in many areas. Examples of applications of the problem is: arrangement of buildings on the campus of the university, layout design of electronic components in systems with large scale integration (VLSI, design a hospital, arrangement of keys on the keyboard.

  9. Noise-induced chaos in a quadratically nonlinear oscillator

    International Nuclear Information System (INIS)

    Gan Chunbiao

    2006-01-01

    The present paper focuses on the noise-induced chaos in a quadratically nonlinear oscillator. Simple zero points of the stochastic Melnikov integral theoretically mean the necessary rising of noise-induced chaotic response in the system based on the stochastic Melnikov method. To quantify the noise-induced chaos, the boundary of the system's safe basin is firstly studied and it is shown to be incursively fractal when chaos arises. Three cases are considered in simulating the safe basin of the system, i.e., the system is excited only by the harmonic excitation, by both the harmonic and the Gaussian white noise excitations, and only by the Gaussian white noise excitation. Secondly, the leading Lyapunov exponent by Rosenstein's algorithm is shown to quantify the chaotic nature of the sample time series of the system. The results show that the boundary of the safe basin can also be fractal even if the system is excited only by the external Gaussian white noise. Most importantly, the almost-harmonic, the noise-induced chaotic and the thoroughly random responses can be found in the system

  10. Mismatch management for optical and matter-wave quadratic solitons

    International Nuclear Information System (INIS)

    Driben, R.; Oz, Y.; Malomed, B. A.; Gubeskys, A.; Yurovsky, V. A.

    2007-01-01

    We propose a way to control solitons in χ (2) (quadratically nonlinear) systems by means of periodic modulation imposed on the phase-mismatch parameter ('mismatch management', MM). It may be realized in the cotransmission of fundamental-frequency (FF) and second-harmonic (SH) waves in a planar optical waveguide via a long-period modulation of the usual quasi-phase-matching pattern of ferroelectric domains. In an altogether different physical setting, the MM may also be implemented by dint of the Feshbach resonance in a harmonically modulated magnetic field in a hybrid atomic-molecular Bose-Einstein condensate (BEC), with the atomic and molecular mean fields (MFs) playing the roles of the FF and SH, respectively. Accordingly, the problem is analyzed in two different ways. First, in the optical model, we identify stability regions for spatial solitons in the MM system, in terms of the MM amplitude and period, using the MF equations for spatially inhomogeneous configurations. In particular, an instability enclave is found inside the stability area. The robustness of the solitons is also tested against variation of the shape of the input pulse, and a threshold for the formation of stable solitons is found in terms of the power. Interactions between stable solitons are virtually unaffected by the MM. The second method (parametric approximation), going beyond the MF description, is developed for spatially homogeneous states in the BEC model. It demonstrates that the MF description is valid for large modulation periods, while, at smaller periods, non-MF components acquire gain, which implies destruction of the MF under the action of the high-frequency MM

  11. Quadratic adaptive algorithm for solving cardiac action potential models.

    Science.gov (United States)

    Chen, Min-Hung; Chen, Po-Yuan; Luo, Ching-Hsing

    2016-10-01

    An adaptive integration method is proposed for computing cardiac action potential models accurately and efficiently. Time steps are adaptively chosen by solving a quadratic formula involving the first and second derivatives of the membrane action potential. To improve the numerical accuracy, we devise an extremum-locator (el) function to predict the local extremum when approaching the peak amplitude of the action potential. In addition, the time step restriction (tsr) technique is designed to limit the increase in time steps, and thus prevent the membrane potential from changing abruptly. The performance of the proposed method is tested using the Luo-Rudy phase 1 (LR1), dynamic (LR2), and human O'Hara-Rudy dynamic (ORd) ventricular action potential models, and the Courtemanche atrial model incorporating a Markov sodium channel model. Numerical experiments demonstrate that the action potential generated using the proposed method is more accurate than that using the traditional Hybrid method, especially near the peak region. The traditional Hybrid method may choose large time steps near to the peak region, and sometimes causes the action potential to become distorted. In contrast, the proposed new method chooses very fine time steps in the peak region, but large time steps in the smooth region, and the profiles are smoother and closer to the reference solution. In the test on the stiff Markov ionic channel model, the Hybrid blows up if the allowable time step is set to be greater than 0.1ms. In contrast, our method can adjust the time step size automatically, and is stable. Overall, the proposed method is more accurate than and as efficient as the traditional Hybrid method, especially for the human ORd model. The proposed method shows improvement for action potentials with a non-smooth morphology, and it needs further investigation to determine whether the method is helpful during propagation of the action potential. Copyright © 2016 Elsevier Ltd. All rights

  12. Joint Dictionary Learning-Based Non-Negative Matrix Factorization for Voice Conversion to Improve Speech Intelligibility After Oral Surgery.

    Science.gov (United States)

    Fu, Szu-Wei; Li, Pei-Chun; Lai, Ying-Hui; Yang, Cheng-Chien; Hsieh, Li-Chun; Tsao, Yu

    2017-11-01

    Objective: This paper focuses on machine learning based voice conversion (VC) techniques for improving the speech intelligibility of surgical patients who have had parts of their articulators removed. Because of the removal of parts of the articulator, a patient's speech may be distorted and difficult to understand. To overcome this problem, VC methods can be applied to convert the distorted speech such that it is clear and more intelligible. To design an effective VC method, two key points must be considered: 1) the amount of training data may be limited (because speaking for a long time is usually difficult for postoperative patients); 2) rapid conversion is desirable (for better communication). Methods: We propose a novel joint dictionary learning based non-negative matrix factorization (JD-NMF) algorithm. Compared to conventional VC techniques, JD-NMF can perform VC efficiently and effectively with only a small amount of training data. Results: The experimental results demonstrate that the proposed JD-NMF method not only achieves notably higher short-time objective intelligibility (STOI) scores (a standardized objective intelligibility evaluation metric) than those obtained using the original unconverted speech but is also significantly more efficient and effective than a conventional exemplar-based NMF VC method. Conclusion: The proposed JD-NMF method may outperform the state-of-the-art exemplar-based NMF VC method in terms of STOI scores under the desired scenario. Significance: We confirmed the advantages of the proposed joint training criterion for the NMF-based VC. Moreover, we verified that the proposed JD-NMF can effectively improve the speech intelligibility scores of oral surgery patients. Objective: This paper focuses on machine learning based voice conversion (VC) techniques for improving the speech intelligibility of surgical patients who have had parts of their articulators removed. Because of the removal of parts of the articulator, a patient

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

    Science.gov (United States)

    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.

  14. Isotropic harmonic oscillator plus inverse quadratic potential in N-dimensional spaces

    International Nuclear Information System (INIS)

    Oyewumi, K.A.; Bangudu, E.A.

    2003-01-01

    Some aspects of the N-dimensional isotropic harmonic plus inverse quadratic potential were discussed. The hyperradial equation for isotropic harmonic oscillator plus inverse quadratic potential is solved by transformation into the confluent hypergeometric equation to obtain the normalized hyperradial solution. Together with the hyperangular solutions (hyperspherical harmonics), these form the complete energy eigenfunctions of the N-dimensional isotropic harmonic oscillator plus inverse quadratic potential and the energy eigenvalues are also obtained. These are dimensionally dependent. The dependence of radial solution on the dimensions or potential strength and the degeneracy of the energy levels are discussed. (author)

  15. A necessary and sufficient condition for a real quadratic extension to have class number one

    International Nuclear Information System (INIS)

    Alemu, Y.

    1990-02-01

    We give a necessary and sufficient condition for a real quadratic extension to have class number one and discuss the applicability of the result to find the class number one fields with small discriminant. 9 refs, 3 tabs

  16. Quadratic contributions of softly broken supersymmetry in the light of loop regularization

    Energy Technology Data Exchange (ETDEWEB)

    Bai, Dong [Chinese Academy of Sciences, Key Laboratory of Theoretical Physics, Institute of Theoretical Physics, Beijing (China); University of Chinese Academy of Sciences, School of Physical Sciences, Beijing (China); Wu, Yue-Liang [Chinese Academy of Sciences, Key Laboratory of Theoretical Physics, Institute of Theoretical Physics, Beijing (China); International Centre for Theoretical Physics Asia-Pacific (ICTP-AP), Beijing (China); University of Chinese Academy of Sciences, School of Physical Sciences, Beijing (China)

    2017-09-15

    Loop regularization (LORE) is a novel regularization scheme in modern quantum field theories. It makes no change to the spacetime structure and respects both gauge symmetries and supersymmetry. As a result, LORE should be useful in calculating loop corrections in supersymmetry phenomenology. To further demonstrate its power, in this article we revisit in the light of LORE the old issue of the absence of quadratic contributions (quadratic divergences) in softly broken supersymmetric field theories. It is shown explicitly by Feynman diagrammatic calculations that up to two loops the Wess-Zumino model with soft supersymmetry breaking terms (WZ' model), one of the simplest models with the explicit supersymmetry breaking, is free of quadratic contributions. All the quadratic contributions cancel with each other perfectly, which is consistent with results dictated by the supergraph techniques. (orig.)

  17. Projection of curves on B-spline surfaces using quadratic reparameterization

    KAUST Repository

    Yang, Yijun; Zeng, Wei; Zhang, Hui; Yong, Junhai; Paul, Jean Claude

    2010-01-01

    Curves on surfaces play an important role in computer aided geometric design. In this paper, we present a hyperbola approximation method based on the quadratic reparameterization of Bézier surfaces, which generates reasonable low degree curves lying

  18. Observers for a class of systems with nonlinearities satisfying an incremental quadratic inequality

    Science.gov (United States)

    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.

  19. Fouha Bay Moving Window Analysis, Benthic Quadrat Surveys at Guam in 2014

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — PIRO Fishery Biologist gathered benthic cover data using a 1m2 quadrat with 25 intersecting points every five meters along a transect running from the inner bay to...

  20. Globally convergent optimization algorithm using conservative convex separable diagonal quadratic approximations

    NARCIS (Netherlands)

    Groenwold, A.A.; Wood, D.W.; Etman, L.F.P.; Tosserams, S.

    2009-01-01

    We implement and test a globally convergent sequential approximate optimization algorithm based on (convexified) diagonal quadratic approximations. The algorithm resides in the class of globally convergent optimization methods based on conservative convex separable approximations developed by

  1. Guam Community Coral Reef Monitoring Program, Benthic Quadrat Surveys at Guam in 2013

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Guam community members gathered benthic cover data using a 0.25m2 quadrat with 6 intersecting points at each meter along a 25-meter transect. Members identified...

  2. Integrable quadratic classical Hamiltonians on so(4) and so(3, 1)

    International Nuclear Information System (INIS)

    Sokolov, Vladimir V; Wolf, Thomas

    2006-01-01

    We investigate a special class of quadratic Hamiltonians on so(4) and so(3, 1) and describe Hamiltonians that have additional polynomial integrals. One of the main results is a new integrable case with an integral of sixth degree

  3. New trace formulae for a quadratic pencil of the Schroedinger operator

    International Nuclear Information System (INIS)

    Yang Chuanfu

    2010-01-01

    This work deals with the eigenvalue problem for a quadratic pencil of the Schroedinger operator on a finite closed interval with the two-point boundary conditions. We will obtain new regularized trace formulas for this class of differential pencil.

  4. Fourier transform and mean quadratic variation of Bernoulli convolution on homogeneous Cantor set

    Energy Technology Data Exchange (ETDEWEB)

    Yu Zuguo E-mail: yuzg@hotmail.comz.yu

    2004-07-01

    For the Bernoulli convolution on homogeneous Cantor set, under some condition, it is proved that the mean quadratic variation and the average of Fourier transform of this measure are bounded above and below.

  5. Cost Cumulant-Based Control for a Class of Linear Quadratic Tracking Problems

    National Research Council Canada - National Science Library

    Pham, Khanh D

    2007-01-01

    .... For instance, the present paper extends the application of cost-cumulant controller design to control of a wide class of linear-quadratic tracking systems where output measurements of a tracker...

  6. Field equations of the gauge theory of gravitation originate from a quadratic Lagrangian with torsion

    International Nuclear Information System (INIS)

    Gogala, B.

    1983-01-01

    The equations of the gauge theory of gravitation are derived from a complex quadratic Lagrangian with torsion. The derivation is performed in a coordinate basis in a completely covariant way. (author)

  7. Use of Quadratic Time-Frequency Representations to Analyze Cetacean Mammal Sounds

    National Research Council Canada - National Science Library

    Papandreou-Suppappola, Antonia

    2001-01-01

    .... Analysis of the group delay structure of the mammalian vocal communication signals was matched to the appropriate quadratic time-frequency class for proper signal processing with minimal skewing of the results...

  8. Using Simple Quadratic Equations to Estimate Equilibrium Concentrations of an Acid

    Science.gov (United States)

    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.

  9. Usefulness of FC-TRIPLEX Chagas/Leish IgG1 as confirmatory assay for non-negative results in blood bank screening of Chagas disease.

    Science.gov (United States)

    Campos, Fernanda Magalhães Freire; Repoles, Laura Cotta; de Araújo, Fernanda Fortes; Peruhype-Magalhães, Vanessa; Xavier, Marcelo Antônio Pascoal; Sabino, Ester Cerdeira; de Freitas Carneiro Proietti, Anna Bárbara; Andrade, Mariléia Chaves; Teixeira-Carvalho, Andréa; Martins-Filho, Olindo Assis; Gontijo, Célia Maria Ferreira

    2018-04-01

    A relevant issue in Chagas disease serological diagnosis regards the requirement of using several confirmatory methods to elucidate the status of non-negative results from blood bank screening. The development of a single reliable method may potentially contribute to distinguish true and false positive results. Our aim was to evaluate the performance of the multiplexed flow-cytometry anti-T. cruzi/Leishmania IgG1 serology/(FC-TRIPLEX Chagas/Leish IgG1) with three conventional confirmatory criteria (ELISA-EIA, Immunofluorescence assay-IIF and EIA/IIF consensus criterion) to define the final status of samples with actual/previous non-negative results during anti-T. cruzi ELISA-screening in blood banks. Apart from inconclusive results, the FC-TRIPLEX presented a weak agreement index with EIA, while a strong agreement was observed when either IIF or EIA/IIF consensus criteria were applied. Discriminant analysis and Spearman's correlation further corroborates the agreement scores. ROC curve analysis showed that FC-TRIPLEX performance indexes were higher when IIF and EIA/IIF consensus were used as a confirmatory criterion. Logistic regression analysis further demonstrated that the probability of FC-TRIPLEX to yield positive results was higher for inconclusive results from IIF and EIA/IIF consensus. Machine learning tools illustrated the high level of categorical agreement between FC-TRIPLEX versus IIF or EIA/IIF consensus. Together, these findings demonstrated the usefulness of FC-TRIPLEX as a tool to elucidate the status of non-negative results in blood bank screening of Chagas disease. Copyright © 2018. Published by Elsevier B.V.

  10. Optimized Large-scale CMB Likelihood and Quadratic Maximum Likelihood Power Spectrum Estimation

    Science.gov (United States)

    Gjerløw, E.; Colombo, L. P. L.; Eriksen, H. K.; Górski, K. M.; Gruppuso, A.; Jewell, J. B.; Plaszczynski, S.; Wehus, I. K.

    2015-11-01

    We revisit the problem of exact cosmic microwave background (CMB) likelihood and power spectrum estimation with the goal of minimizing computational costs through linear compression. This idea was originally proposed for CMB purposes by Tegmark et al., and here we develop it into a fully functioning computational framework for large-scale polarization analysis, adopting WMAP as a working example. We compare five different linear bases (pixel space, harmonic space, noise covariance eigenvectors, signal-to-noise covariance eigenvectors, and signal-plus-noise covariance eigenvectors) in terms of compression efficiency, and find that the computationally most efficient basis is the signal-to-noise eigenvector basis, which is closely related to the Karhunen-Loeve and Principal Component transforms, in agreement with previous suggestions. For this basis, the information in 6836 unmasked WMAP sky map pixels can be compressed into a smaller set of 3102 modes, with a maximum error increase of any single multipole of 3.8% at ℓ ≤ 32 and a maximum shift in the mean values of a joint distribution of an amplitude-tilt model of 0.006σ. This compression reduces the computational cost of a single likelihood evaluation by a factor of 5, from 38 to 7.5 CPU seconds, and it also results in a more robust likelihood by implicitly regularizing nearly degenerate modes. Finally, we use the same compression framework to formulate a numerically stable and computationally efficient variation of the Quadratic Maximum Likelihood implementation, which requires less than 3 GB of memory and 2 CPU minutes per iteration for ℓ ≤ 32, rendering low-ℓ QML CMB power spectrum analysis fully tractable on a standard laptop.

  11. Quadratic Hierarchy Flavor Rule as the Origin of Dirac CP-Violating Phases

    OpenAIRE

    Lipmanov, E. M.

    2007-01-01

    The premise of an organizing quadratic hierarchy rule in lepton-quark flavor physics was used earlier for explanation of the hierarchy patterns of four generic pairs of flavor quantities 1) charged-lepton and 2) neutrino deviations from mass-degeneracy, 3) deviations of lepton mixing from maximal magnitude and 4) deviations of quark mixing from minimal one. Here it is shown that the quadratic hierarchy equation that is uniquely related to three flavor particle generations may have yet another...

  12. Electron laser acceleration in vacuum by a quadratically chirped laser pulse

    International Nuclear Information System (INIS)

    Salamin, Yousef I; Jisrawi, Najeh M

    2014-01-01

    Single MeV electrons in vacuum subjected to single high-intensity quadratically chirped laser pulses are shown to gain multi-GeV energies. The laser pulses are modelled by finite-duration trapezoidal and cos  2 pulse-shapes and the equations of motion are solved numerically. It is found that, typically, the maximum energy gain from interaction with a quadratic chirp is about half of what would be gained from a linear chirp. (paper)

  13. Analytic Expression of Arbitrary Matrix Elements for Boson Exponential Quadratic Polynomial Operators

    Institute of Scientific and Technical Information of China (English)

    XU Xiu-Wei; REN Ting-Qi; LIU Shu-Yan; MA Qiu-Ming; LIU Sheng-Dian

    2007-01-01

    Making use of the transformation relation among usual, normal, and antinormal ordering for the multimode boson exponential quadratic polynomial operators (BEQPO's), we present the analytic expression of arbitrary matrix elements for BEQPO's. As a preliminary application, we obtain the exact expressions of partition function about the boson quadratic polynomial system, matrix elements in particle-number, coordinate, and momentum representation, and P representation for the BEQPO's.

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

    Energy Technology Data Exchange (ETDEWEB)

    Szederkenyi, Gabor; Hangos, Katalin M

    2004-04-26

    We show that the global stability of quasi-polynomial (QP) and Lotka-Volterra (LV) systems with the well-known logarithmic Lyapunov function is equivalent to the existence of a local generalized dissipative Hamiltonian description of the LV system with a diagonal quadratic form as a Hamiltonian function. The Hamiltonian function can be calculated and the quadratic dissipativity neighborhood of the origin can be estimated by solving linear matrix inequalities.

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

    Science.gov (United States)

    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.

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

    International Nuclear Information System (INIS)

    Szederkenyi, Gabor; Hangos, Katalin M.

    2004-01-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

  17. On the Equivalence of Quadratic Optimization Problems Commonly Used in Portfolio Theory

    OpenAIRE

    Taras Bodnar; Nestor Parolya; Wolfgang Schmid

    2012-01-01

    In the paper, we consider three quadratic optimization problems which are frequently applied in portfolio theory, i.e, the Markowitz mean-variance problem as well as the problems based on the mean-variance utility function and the quadratic utility.Conditions are derived under which the solutions of these three optimization procedures coincide and are lying on the efficient frontier, the set of mean-variance optimal portfolios. It is shown that the solutions of the Markowitz optimization prob...

  18. Decay constants for pulsed monoenergetic neutron systems with quadratically anisotropic scattering

    International Nuclear Information System (INIS)

    Sjoestrand, N.G.

    1977-06-01

    The eigenvalues of the time-dependent transport equation for monoenergetic neutrons have been studied numerically for various combinations of linearly and quadratically anisotropic scattering assuming a space dependence of e β . The results, presented in the form of tables and graphs, show that quadratic anisotropy leads to a more complicated eigenvalue spectrum. However, no drastic changes occur in comparison to purely linear anistropy.(author)

  19. On the equivalence of vacuum equations of gauge quadratic theory of gravity and general relativity theory

    International Nuclear Information System (INIS)

    Zhitnikov, V.V.; Ponomarev, V.N.

    1986-01-01

    An attempt is made to compare the solution of field equations, corresponding to quadratic equations for the fields (g μν , Γ μν α ) in gauge gravitation theory (GGT) with general relativity theory solutions. Without restrictions for a concrete type of metrics only solutions of equations, for which torsion turns to zero, are considered. Equivalence of vacuum equations of gauge quadratic theory of gravity and general relativity theory is proved using the Newman-Penrose formalism

  20. Exponential quadratic operators and evolution of bosonic systems coupled to a heat bath

    International Nuclear Information System (INIS)

    Ni Xiaotong; Liu Yuxi; Kwek, L. C.; Wang Xiangbin

    2010-01-01

    Using exponential quadratic operators, we present a general framework for studying the exact dynamics of system-bath interaction in which the Hamiltonian is described by the quadratic form of bosonic operators. To demonstrate the versatility of the approach, we study how the environment affects the squeezing of quadrature components of the system. We further propose that the squeezing can be enhanced when parity kicks are applied to the system.

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

    Science.gov (United States)

    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.

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

    Science.gov (United States)

    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.

  3. Permanent vegetation quadrats on Olkiluoto island. Establishment and results from the first inventory

    Energy Technology Data Exchange (ETDEWEB)

    Huhta, A.P.; Korpela, L. [Finnish Forest Research Institute, Helsinki (Finland)

    2006-05-15

    This report describes in detail the vegetation quadrats established inside the permanent, follow-up sample plots (Forest Extensive High-level monitoring plots, FEH) on Olkiluoto Island. During summer 2005 a total of 94 sample plots (a 30 m{sup 2}), each containing eight quadrats (a 1m{sup 2}), were investigated. The total number of sampled quadrats was 752. Seventy of the 94 plots represent coniferous stands: 57 Norway spruce-dominated and 13 Scots pine-dominated stands. Ten of the plots represent deciduous, birch-dominated (Betula spp.) stands, 7 plots common alder-dominated (Alnus glutinosa) stands, and seven plots are mires. The majority of the coniferous tree stands were growing on sites representing various succession stages of the Myrtillus, Vaccinium-Myrtillus and Deschampsia-Myrtillus forest site types. The pine-dominated stands growing on exposed bedrock clearly differed from the other coniferous stands: the vegetation was characterised by the Cladina, Calluna-Cladina and Empetrum-Vaccinium vitis-idaea/Vaccinium Myrtillus forest site types. The deciduous stands were characterized by tall grasses, especially Calamagrostis epigejos, C. purpurea and Deschampsia flexuosa. The vegetation of the deciduous stands dominated by common alder represented grove-like sites and seashore groves. Typical species for mires included Calamagrostis purpurea, Calla palustris, Equisetum sylvaticum, and especially white mosses (Sphagnum spp.). A total of 184 vascular plant species were found growing within the quadrats. Due to the high number of quadrats in these forests, the spruce stands had the highest total number of species, but the birch and alder-dominated forests had the highest average number of species per quadrat. This basic inventory of the permanent vegetation quadrats on Olkiluoto Island provides a sound starting point for future vegetation surveys. Guidelines for future inventories and supplementary sampling are given in the discussion part of this report. (orig.)

  4. Permanent vegetation quadrats on Olkiluoto island. Establishment and results from the first inventory

    International Nuclear Information System (INIS)

    Huhta, A.P.; Korpela, L.

    2006-05-01

    This report describes in detail the vegetation quadrats established inside the permanent, follow-up sample plots (Forest Extensive High-level monitoring plots, FEH) on Olkiluoto Island. During summer 2005 a total of 94 sample plots (a 30 m 2 ), each containing eight quadrats (a 1m 2 ), were investigated. The total number of sampled quadrats was 752. Seventy of the 94 plots represent coniferous stands: 57 Norway spruce-dominated and 13 Scots pine-dominated stands. Ten of the plots represent deciduous, birch-dominated (Betula spp.) stands, 7 plots common alder-dominated (Alnus glutinosa) stands, and seven plots are mires. The majority of the coniferous tree stands were growing on sites representing various succession stages of the Myrtillus, Vaccinium-Myrtillus and Deschampsia-Myrtillus forest site types. The pine-dominated stands growing on exposed bedrock clearly differed from the other coniferous stands: the vegetation was characterised by the Cladina, Calluna-Cladina and Empetrum-Vaccinium vitis-idaea/Vaccinium Myrtillus forest site types. The deciduous stands were characterized by tall grasses, especially Calamagrostis epigejos, C. purpurea and Deschampsia flexuosa. The vegetation of the deciduous stands dominated by common alder represented grove-like sites and seashore groves. Typical species for mires included Calamagrostis purpurea, Calla palustris, Equisetum sylvaticum, and especially white mosses (Sphagnum spp.). A total of 184 vascular plant species were found growing within the quadrats. Due to the high number of quadrats in these forests, the spruce stands had the highest total number of species, but the birch and alder-dominated forests had the highest average number of species per quadrat. This basic inventory of the permanent vegetation quadrats on Olkiluoto Island provides a sound starting point for future vegetation surveys. Guidelines for future inventories and supplementary sampling are given in the discussion part of this report. (orig.)

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

    Directory of Open Access Journals (Sweden)

    Yong Li

    2014-01-01

    Full Text Available The translational axis is one of the most important subsystems in modern machine tools, as its degradation may result in the loss of the product qualification and lower the control precision. Condition-based maintenance (CBM has been considered as one of the advanced maintenance schemes to achieve effective, reliable and cost-effective operation of machine systems, however, current vibration-based maintenance schemes cannot be employed directly in the translational axis system, due to its complex structure and the inefficiency of commonly used condition monitoring features. In this paper, a wavelet bicoherence-based quadratic nonlinearity feature is proposed for translational axis condition monitoring by using the torque signature of the drive servomotor. Firstly, the quadratic nonlinearity of the servomotor torque signature is discussed, and then, a biphase randomization wavelet bicoherence is introduced for its quadratic nonlinear detection. On this basis, a quadratic nonlinearity feature is proposed for condition monitoring of the translational axis. The properties of the proposed quadratic nonlinearity feature are investigated by simulations. Subsequently, this feature is applied to the real-world servomotor torque data collected from the X-axis on a high precision vertical machining centre. All the results show that the performance of the proposed feature is much better than that of original condition monitoring features.

  6. Bôcher and Abstract Contractions of 2nd Order Quadratic Algebras

    Science.gov (United States)

    Escobar-Ruiz, Mauricio A.; Kalnins, Ernest G.; Miller, Willar, Jr.; Subag, Eyal

    2017-03-01

    Quadratic algebras are generalizations of Lie algebras which include the symmetry algebras of 2nd order superintegrable systems in 2 dimensions as special cases. The superintegrable systems are exactly solvable physical systems in classical and quantum mechanics. Distinct superintegrable systems and their quadratic algebras can be related by geometric contractions, induced by Bôcher contractions of the conformal Lie algebra {so}(4,C) to itself. In this paper we give a precise definition of Bôcher contractions and show how they can be classified. They subsume well known contractions of {e}(2,C) and {so}(3,C) and have important physical and geometric meanings, such as the derivation of the Askey scheme for obtaining all hypergeometric orthogonal polynomials as limits of Racah/Wilson polynomials. We also classify abstract nondegenerate quadratic algebras in terms of an invariant that we call a canonical form. We describe an algorithm for finding the canonical form of such algebras. We calculate explicitly all canonical forms arising from quadratic algebras of 2D nondegenerate superintegrable systems on constant curvature spaces and Darboux spaces. We further discuss contraction of quadratic algebras, focusing on those coming from superintegrable systems.

  7. Classification of the quantum two dimensional superintegrable systems with quadratic integrals and the Stackel transforms

    International Nuclear Information System (INIS)

    Dakaloyannis, C.

    2006-01-01

    Full text: (author)The two dimensional quantum superintegrable systems with quadratic integrals of motion on a manifold are classified by using the quadratic associative algebra of the integrals of motion. There are six general fundamental classes of quantum superintegrable systems corresponding to the classical ones. Analytic formulas for the involved integrals are calculated in all the cases. All the known quantum superintegrable systems with quadratic integrals are classified as special cases of these six general classes. The coefficients of the quadratic associative algebra of integrals are calculated and they are compared to the coefficients of the corresponding coefficients of the Poisson quadratic algebra of the classical systems. The quantum coefficients are similar as the classical ones multiplied by a quantum coefficient -n 2 plus a quantum deformation of order n 4 and n 6 . The systems inside the classes are transformed using Stackel transforms in the quantum case as in the classical case and general form is discussed. The idea of the Jacobi Hamiltonian corresponding to the Jacobi metric in the classical case is discussed

  8. Photon–phonon parametric oscillation induced by quadratic coupling in an optomechanical resonator

    International Nuclear Information System (INIS)

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

    2017-01-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. (paper)

  9. Geometric Methods in the Algebraic Theory of Quadratic Forms : Summer School

    CERN Document Server

    2004-01-01

    The geometric approach to the algebraic theory of quadratic forms is the study of projective quadrics over arbitrary fields. Function fields of quadrics have been central to the proofs of fundamental results since the renewal of the theory by Pfister in the 1960's. Recently, more refined geometric tools have been brought to bear on this topic, such as Chow groups and motives, and have produced remarkable advances on a number of outstanding problems. Several aspects of these new methods are addressed in this volume, which includes - an introduction to motives of quadrics by Alexander Vishik, with various applications, notably to the splitting patterns of quadratic forms under base field extensions; - papers by Oleg Izhboldin and Nikita Karpenko on Chow groups of quadrics and their stable birational equivalence, with application to the construction of fields which carry anisotropic quadratic forms of dimension 9, but none of higher dimension; - a contribution in French by Bruno Kahn which lays out a general fra...

  10. Theoretical analysis of integral neutron transport equation using collision probability method with quadratic flux approach

    International Nuclear Information System (INIS)

    Shafii, Mohammad Ali; Meidianti, Rahma; Wildian,; Fitriyani, Dian; Tongkukut, Seni H. J.; Arkundato, Artoto

    2014-01-01

    Theoretical analysis of integral neutron transport equation using collision probability (CP) method with quadratic flux approach has been carried out. In general, the solution of the neutron transport using the CP method is performed with the flat flux approach. In this research, the CP method is implemented in the cylindrical nuclear fuel cell with the spatial of mesh being conducted into non flat flux approach. It means that the neutron flux at any point in the nuclear fuel cell are considered different each other followed the distribution pattern of quadratic flux. The result is presented here in the form of quadratic flux that is better understanding of the real condition in the cell calculation and as a starting point to be applied in computational calculation

  11. Nearly Quadratic n-Derivations on Non-Archimedean Banach Algebras

    Directory of Open Access Journals (Sweden)

    Madjid Eshaghi Gordji

    2012-01-01

    Full Text Available Let n>1 be an integer, let A be an algebra, and X be an A-module. A quadratic function D:A→X is called a quadratic n-derivation if D(∏i=1nai=D(a1a22⋯an2+a12D(a2a32⋯an2+⋯+a12a22⋯an−12D(an for all a1,...,an∈A. We investigate the Hyers-Ulam stability of quadratic n-derivations from non-Archimedean Banach algebras into non-Archimedean Banach modules by using the Banach fixed point theorem.

  12. A Comparative Analysis of Quadratics Unit in Singaporean, Turkish and IBDP Mathematics Textbooks

    Directory of Open Access Journals (Sweden)

    Reyhan Sağlam

    2012-12-01

    Full Text Available The purpose of this study was to analyze and compare the contents of the chapters on quadratics in three mathematics textbooks selected from Turkey, Singapore, and the International Baccalaureate Diploma Program (IBDP through content analysis. The analysis of mathematical content showed that the three textbooks have different approaches and priorities in terms of the positions of chapters and weights of the quadratics units, and the time allocated to them within the respective curricular programs. It was also found that the Turkish textbook covers a greater number of learning outcomes targeted for quadratics among the three mathematics syllabi, showing a detailed treatment of the topic compared to the other two textbooks.Key Words: Content analysis, international comparative studies, mathematics textbooks

  13. Theoretical analysis of integral neutron transport equation using collision probability method with quadratic flux approach

    Energy Technology Data Exchange (ETDEWEB)

    Shafii, Mohammad Ali, E-mail: mashafii@fmipa.unand.ac.id; Meidianti, Rahma, E-mail: mashafii@fmipa.unand.ac.id; Wildian,, E-mail: mashafii@fmipa.unand.ac.id; Fitriyani, Dian, E-mail: mashafii@fmipa.unand.ac.id [Department of Physics, Andalas University Padang West Sumatera Indonesia (Indonesia); Tongkukut, Seni H. J. [Department of Physics, Sam Ratulangi University Manado North Sulawesi Indonesia (Indonesia); Arkundato, Artoto [Department of Physics, Jember University Jember East Java Indonesia (Indonesia)

    2014-09-30

    Theoretical analysis of integral neutron transport equation using collision probability (CP) method with quadratic flux approach has been carried out. In general, the solution of the neutron transport using the CP method is performed with the flat flux approach. In this research, the CP method is implemented in the cylindrical nuclear fuel cell with the spatial of mesh being conducted into non flat flux approach. It means that the neutron flux at any point in the nuclear fuel cell are considered different each other followed the distribution pattern of quadratic flux. The result is presented here in the form of quadratic flux that is better understanding of the real condition in the cell calculation and as a starting point to be applied in computational calculation.

  14. Numerical Methods for Solution of the Extended Linear Quadratic Control Problem

    DEFF Research Database (Denmark)

    Jørgensen, John Bagterp; Frison, Gianluca; Gade-Nielsen, Nicolai Fog

    2012-01-01

    In this paper we present the extended linear quadratic control problem, its efficient solution, and a discussion of how it arises in the numerical solution of nonlinear model predictive control problems. The extended linear quadratic control problem is the optimal control problem corresponding...... to the Karush-Kuhn-Tucker system that constitute the majority of computational work in constrained nonlinear and linear model predictive control problems solved by efficient MPC-tailored interior-point and active-set algorithms. We state various methods of solving the extended linear quadratic control problem...... and discuss instances in which it arises. The methods discussed in the paper have been implemented in efficient C code for both CPUs and GPUs for a number of test examples....

  15. Finite element method with quadratic quadrilateral unit for solving two dimensional incompressible N-S equation

    International Nuclear Information System (INIS)

    Tao Ganqiang; Yu Qing; Xiao Xiao

    2011-01-01

    Viscous and incompressible fluid flow is important for numerous engineering mechanics problems. Because of high non linear and incompressibility for Navier-Stokes equation, it is very difficult to solve Navier-Stokes equation by numerical method. According to its characters of Navier-Stokes equation, quartic derivation controlling equation of the two dimensional incompressible Navier-Stokes equation is set up firstly. The method solves the problem for dealing with vorticity boundary and automatically meets incompressibility condition. Then Finite Element equation for Navier-Stokes equation is proposed by using quadratic quadrilateral unit with 8 nodes in which the unit function is quadratic and non linear.-Based on it, the Finite Element program of quadratic quadrilateral unit with 8 nodes is developed. Lastly, numerical experiment proves the accuracy and dependability of the method and also shows the method has good application prospect in computational fluid mechanics. (authors)

  16. Fast parallel DNA-based algorithms for molecular computation: quadratic congruence and factoring integers.

    Science.gov (United States)

    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.

  17. Estimating nonlinear selection gradients using quadratic regression coefficients: double or nothing?

    Science.gov (United States)

    Stinchcombe, John R; Agrawal, Aneil F; Hohenlohe, Paul A; Arnold, Stevan J; Blows, Mark W

    2008-09-01

    The use of regression analysis has been instrumental in allowing evolutionary biologists to estimate the strength and mode of natural selection. Although directional and correlational selection gradients are equal to their corresponding regression coefficients, quadratic regression coefficients must be doubled to estimate stabilizing/disruptive selection gradients. Based on a sample of 33 papers published in Evolution between 2002 and 2007, at least 78% of papers have not doubled quadratic regression coefficients, leading to an appreciable underestimate of the strength of stabilizing and disruptive selection. Proper treatment of quadratic regression coefficients is necessary for estimation of fitness surfaces and contour plots, canonical analysis of the gamma matrix, and modeling the evolution of populations on an adaptive landscape.

  18. Newton's method for solving a quadratic matrix equation with special coefficient matrices

    International Nuclear Information System (INIS)

    Seo, Sang-Hyup; Seo, Jong Hyun; Kim, Hyun-Min

    2014-01-01

    We consider the iterative method for solving a quadratic matrix equation with special coefficient matrices which arises in the quasi-birth-death problem. In this paper, we show that the elementwise minimal positive solvents to quadratic matrix equations can be obtained using Newton's method. We also prove that the convergence rate of the Newton iteration is quadratic if the Fréchet derivative at the elementwise minimal positive solvent is nonsingular. However, if the Fréchet derivative is singular, the convergence rate is at least linear. Numerical experiments of the convergence rate are given.(This is summarized a paper which is to appear in Honam Mathematical Journal.)

  19. Inference for the jump part of quadratic variation of Itô semimartingales

    DEFF Research Database (Denmark)

    Veraart, Almut

    Recent research has focused on modelling asset prices by Itô semimartingales. In such a modelling framework, the quadratic variation consists of a continuous and a jump component. This paper is about inference on the jump part of the quadratic variation, which can be estimated by the difference...... of realised variance and realised multipower variation. The main contribution of this paper is twofold. First, it provides a bivariate asymptotic limit theory for realised variance and realised multipower variation in the presence of jumps. Second, this paper presents new, consistent estimators for the jump...

  20. Inference for the jump part of quadratic variation of Itô semimartingales

    DEFF Research Database (Denmark)

    Veraart, Almut

    2010-01-01

    Recent research has focused on modeling asset prices by Itô semimartingales. In such a modeling framework, the quadratic variation consists of a continuous and a jump component. This paper is about inference on the jump part of the quadratic variation, which can be estimated by the difference...... of realized variance and realized multipower variation. The main contribution of this paper is twofold. First, it provides a bivariate asymptotic limit theory for realized variance and realized multipower variation in the presence of jumps. Second, this paper presents new, consistent estimators for the jump...

  1. Finite-Time Stability and Stabilization of Nonlinear Quadratic Systems with Jumps

    Directory of Open Access Journals (Sweden)

    Minsong Zhang

    2014-01-01

    Full Text Available This paper investigates the problems of finite-time stability and finite-time stabilization for nonlinear quadratic systems with jumps. The jump time sequences here are assumed to satisfy some given constraints. Based on Lyapunov function and a particular presentation of the quadratic terms, sufficient conditions for finite-time stability and finite-time stabilization are developed to a set containing bilinear matrix inequalities (BLIMs and linear matrix inequalities (LMIs. Numerical examples are given to illustrate the effectiveness of the proposed methodology.

  2. Self-repeating properties of four-petal Gaussian vortex beams in quadratic index medium

    Science.gov (United States)

    Zou, Defeng; Li, Xiaohui; Chai, Tong; Zheng, Hairong

    2018-05-01

    In this paper, we investigate the propagation properties of four-petal Gaussian vortex (FPGV) beams propagating through the quadratic index medium, obtaining the analytical expression of FPGV beams. The effects of beam order n, topological charge m and beam waist ω0 are investigated. Results show that quadratic index medium support periodic distributions of FPGV beams. A hollow optical wall or an optical central principal maximum surrounded by symmetrical sidelobes will occur at the center of a period. At length, they will evolve into four petals structure, exactly same as the intensity distributions at source plane.

  3. Cascaded quadratic soliton compression of high-power femtosecond fiber lasers in Lithium Niobate crystals

    DEFF Research Database (Denmark)

    Bache, Morten; Moses, Jeffrey; Wise, Frank W.

    2008-01-01

    The output of a high-power femtosecond fiber laser is typically 300 fs with a wavelength around $\\lambda=1030-1060$ nm. Our numerical simulations show that cascaded quadratic soliton compression in bulk LiNbO$_3$ can compress such pulses to below 100 fs.......The output of a high-power femtosecond fiber laser is typically 300 fs with a wavelength around $\\lambda=1030-1060$ nm. Our numerical simulations show that cascaded quadratic soliton compression in bulk LiNbO$_3$ can compress such pulses to below 100 fs....

  4. Pseudodynamic systems approach based on a quadratic approximation of update equations for diffuse optical tomography.

    Science.gov (United States)

    Biswas, Samir Kumar; Kanhirodan, Rajan; Vasu, Ram Mohan; Roy, Debasish

    2011-08-01

    We explore a pseudodynamic form of the quadratic parameter update equation for diffuse optical tomographic reconstruction from noisy data. A few explicit and implicit strategies for obtaining the parameter updates via a semianalytical integration of the pseudodynamic equations are proposed. Despite the ill-posedness of the inverse problem associated with diffuse optical tomography, adoption of the quadratic update scheme combined with the pseudotime integration appears not only to yield higher convergence, but also a muted sensitivity to the regularization parameters, which include the pseudotime step size for integration. These observations are validated through reconstructions with both numerically generated and experimentally acquired data.

  5. An Extension to a Filter Implementation of Local Quadratic Surface for Image Noise Estimation

    DEFF Research Database (Denmark)

    Nielsen, Allan Aasbjerg

    1999-01-01

    Based on regression analysis this paper gives a description for simple image filter design. Specifically 3x3 filter implementations of a quadratic surface, residuals from this surface, gradients and the Laplacian are given. For the residual a 5x5 filter is given also. It is shown that the 3x3......) it is concluded that if striping is to be considered as a part of the noise, the residual from a 3x3 median filter seems best. If we are interested in a salt-and-pepper noise estimator the proposed extension to the 3x3 filter for the residual from a quadratic surface seems best. Simple statistics...

  6. Thermal response test data of five quadratic cross section precast pile heat exchangers.

    Science.gov (United States)

    Alberdi-Pagola, Maria

    2018-06-01

    This data article comprises records from five Thermal Response Tests (TRT) of quadratic cross section pile heat exchangers. Pile heat exchangers, typically referred to as energy piles, consist of traditional foundation piles with embedded heat exchanger pipes. The data presented in this article are related to the research article entitled "Comparing heat flow models for interpretation of precast quadratic pile heat exchanger thermal response tests" (Alberdi-Pagola et al., 2018) [1]. The TRT data consists of measured inlet and outlet temperatures, fluid flow and injected heat rate recorded every 10 min. The field dataset is made available to enable model verification studies.

  7. Thermal response test data of five quadratic cross section precast pile heat exchangers

    Directory of Open Access Journals (Sweden)

    Maria Alberdi-Pagola

    2018-06-01

    Full Text Available This data article comprises records from five Thermal Response Tests (TRT of quadratic cross section pile heat exchangers. Pile heat exchangers, typically referred to as energy piles, consist of traditional foundation piles with embedded heat exchanger pipes. The data presented in this article are related to the research article entitled “Comparing heat flow models for interpretation of precast quadratic pile heat exchanger thermal response tests” (Alberdi-Pagola et al., 2018 [1]. The TRT data consists of measured inlet and outlet temperatures, fluid flow and injected heat rate recorded every 10 min. The field dataset is made available to enable model verification studies.

  8. Newton equation for canonical, Lie-algebraic, and quadratic deformation of classical space

    International Nuclear Information System (INIS)

    Daszkiewicz, Marcin; Walczyk, Cezary J.

    2008-01-01

    The Newton equation describing particle motion in a constant external field force on canonical, Lie-algebraic, and quadratic space-time is investigated. We show that for canonical deformation of space-time the dynamical effects are absent, while in the case of Lie-algebraic noncommutativity, when spatial coordinates commute to the time variable, the additional acceleration of the particle is generated. We also indicate that in the case of spatial coordinates commuting in a Lie-algebraic way, as well as for quadratic deformation, there appear additional velocity and position-dependent forces

  9. Mixmaster cosmological model in theories of gravity with a quadratic Lagrangian

    International Nuclear Information System (INIS)

    Barrow, J.D.; Sirousse-Zia, H.

    1989-01-01

    We use the method of matched asymptotic expansions to examine the behavior of the vacuum Bianchi type-IX mixmaster universe in a gravity theory derived from a purely quadratic gravitational Lagrangian. The chaotic behavior characteristic of the general-relativistic mixmaster model disappears and the asymptotic behavior is of the monotonic, nonchaotic form found in the exactly soluble Bianchi type-I models of the quadratic theory. The asymptotic behavior far from the singularity is also found to be of monotonic nonchaotic type

  10. Robust Weak Chimeras in Oscillator Networks with Delayed Linear and Quadratic Interactions

    Science.gov (United States)

    Bick, Christian; Sebek, Michael; Kiss, István Z.

    2017-10-01

    We present an approach to generate chimera dynamics (localized frequency synchrony) in oscillator networks with two populations of (at least) two elements using a general method based on a delayed interaction with linear and quadratic terms. The coupling design yields robust chimeras through a phase-model-based design of the delay and the ratio of linear and quadratic components of the interactions. We demonstrate the method in the Brusselator model and experiments with electrochemical oscillators. The technique opens the way to directly bridge chimera dynamics in phase models and real-world oscillator networks.

  11. Rational quadratic trigonometric Bézier curve based on new basis with exponential functions

    Directory of Open Access Journals (Sweden)

    Wu Beibei

    2017-06-01

    Full Text Available We construct a rational quadratic trigonometric Bézier curve with four shape parameters by introducing two exponential functions into the trigonometric basis functions in this paper. It has the similar properties as the rational quadratic Bézier curve. For given control points, the shape of the curve can be flexibly adjusted by changing the shape parameters and the weight. Some conics can be exactly represented when the control points, the shape parameters and the weight are chosen appropriately. The C0, C1 and C2 continuous conditions for joining two constructed curves are discussed. Some examples are given.

  12. The quadratic-form identity for constructing the Hamiltonian structure of integrable systems

    International Nuclear Information System (INIS)

    Guo Fukui; Zhang Yufeng

    2005-01-01

    A usual loop algebra, not necessarily the matrix form of the loop algebra A-tilde n-1 , is also made use of for constructing linear isospectral problems, whose compatibility conditions exhibit a zero-curvature equation from which integrable systems are derived. In order to look for the Hamiltonian structure of such integrable systems, a quadratic-form identity is created in the present paper whose special case is just the trace identity; that is, when taking the loop algebra A-tilde 1 , the quadratic-form identity presented in this paper is completely consistent with the trace identity

  13. Design of variable-weight quadratic congruence code for optical CDMA

    Science.gov (United States)

    Feng, Gang; Cheng, Wen-Qing; Chen, Fu-Jun

    2015-09-01

    A variable-weight code family referred to as variable-weight quadratic congruence code (VWQCC) is constructed by algebraic transformation for incoherent synchronous optical code division multiple access (OCDMA) systems. Compared with quadratic congruence code (QCC), VWQCC doubles the code cardinality and provides the multiple code-sets with variable code-weight. Moreover, the bit-error rate (BER) performance of VWQCC is superior to those of conventional variable-weight codes by removing or padding pulses under the same chip power assumption. The experiment results show that VWQCC can be well applied to the OCDMA with quality of service (QoS) requirements.

  14. Classification of ξ(s)-Quadratic Stochastic Operators on 2D simplex

    International Nuclear Information System (INIS)

    Mukhamedov, Farrukh; Saburov, Mansoor; Qaralleh, Izzat

    2013-01-01

    A quadratic stochastic operator (in short QSO) is usually used to present the time evolution of differing species in biology. Some QSO has been studied by Lotka and Volterra. The general problem in the nonlinear operator theory is to study the behavior of operators. This problem was not fully finished even for the quadratic stochastic operators. To study this problem it was investigated several classes of such QSO. In this paper we study ξ (s) -QSO class of operators. We study such kind of operators on 2D simplex. We first classify these ξ (s) -QSO into 20 classes. Further, we investigate the dynamics of one class of such operators.

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

    Science.gov (United States)

    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.

  16. Spatial Solitons and Induced Kerr Effects in Quasi-Phase-Matched Quadratic Media

    DEFF Research Database (Denmark)

    Clausen, Carl A. Balslev; Bang, Ole; Kivshar, Yu.S.

    1997-01-01

    We show that the evolution of the average intensity of cw beams in a quasi-phase-matched quadratic (or chi((2))) medium is strongly influenced by induced Kerr effects, such as self- and cross-phase modulation. We prove the existence of rapidly oscillating solitary waves (a spatial analog of the g......We show that the evolution of the average intensity of cw beams in a quasi-phase-matched quadratic (or chi((2))) medium is strongly influenced by induced Kerr effects, such as self- and cross-phase modulation. We prove the existence of rapidly oscillating solitary waves (a spatial analog...

  17. OPTIMAL SHRINKAGE ESTIMATION OF MEAN PARAMETERS IN FAMILY OF DISTRIBUTIONS WITH QUADRATIC VARIANCE.

    Science.gov (United States)

    Xie, Xianchao; Kou, S C; Brown, Lawrence

    2016-03-01

    This paper discusses the simultaneous inference of mean parameters in a family of distributions with quadratic variance function. We first introduce a class of semi-parametric/parametric shrinkage estimators and establish their asymptotic optimality properties. Two specific cases, the location-scale family and the natural exponential family with quadratic variance function, are then studied in detail. We conduct a comprehensive simulation study to compare the performance of the proposed methods with existing shrinkage estimators. We also apply the method to real data and obtain encouraging results.

  18. Inelastic scattering in a local polaron model with quadratic coupling to bosons

    DEFF Research Database (Denmark)

    Olsen, Thomas

    2009-01-01

    We calculate the inelastic scattering probabilities in the wide band limit of a local polaron model with quadratic coupling to bosons. The central object is a two-particle Green's function which is calculated exactly using a purely algebraic approach. Compared with the usual linear interaction term...... a quadratic interaction term gives higher probabilities for inelastic scattering involving a large number of bosons. As an application we consider the problem hot-electron-mediated energy transfer at surfaces and use the delta self-consistent field extension of density-functional theory to calculate...

  19. Exact solutions for oscillators with quadratic damping and mixed-parity nonlinearity

    International Nuclear Information System (INIS)

    Lai, S K; Chow, K W

    2012-01-01

    Exact vibration modes of a nonlinear oscillator, which contains both quadratic friction and a mixed-parity restoring force, are derived analytically. Two families of exact solutions are obtained in terms of rational expressions for classical Jacobi elliptic functions. The present solutions allow the investigation of the dynamical behaviour of the system in response to changes in physical parameters that concern nonlinearity. The physical significance of the signs (i.e. attractive or repulsive nature) of the linear, quadratic and cubic restoring forces is discussed. A qualitative analysis is also conducted to provide valuable physical insight into the nature of the system. (paper)

  20. Solving symmetric-definite quadratic lambda-matrix problems without factorization

    International Nuclear Information System (INIS)

    Scott, D.S.; Ward, R.C.

    1982-01-01

    Algorithms are presented for computing some of the eigenvalues and their associated eigenvectors of the quadratic lambda-matrix M lambda 2 C lambda + K. M, C, and K are assumed to have special symmetry-type properties which insure that theory analogous to the standard symmetric eigenproblem exists. The algorithms are based on a generalization of the Rayleigh quotient and the Lanczos method for computing eigenpairs of standard symmetric eigenproblems. Monotone quadratic convergence of the basic method is proved. Test examples are presented

  1. An online re-linearization scheme suited for Model Predictive and Linear Quadratic Control

    DEFF Research Database (Denmark)

    Henriksen, Lars Christian; Poulsen, Niels Kjølstad

    This technical note documents the equations for primal-dual interior-point quadratic programming problem solver used for MPC. The algorithm exploits the special structure of the MPC problem and is able to reduce the computational burden such that the computational burden scales with prediction...... horizon length in a linear way rather than cubic, which would be the case if the structure was not exploited. It is also shown how models used for design of model-based controllers, e.g. linear quadratic and model predictive, can be linearized both at equilibrium and non-equilibrium points, making...

  2. An L∞/L1-Constrained Quadratic Optimization Problem with Applications to Neural Networks

    International Nuclear Information System (INIS)

    Leizarowitz, Arie; Rubinstein, Jacob

    2003-01-01

    Pattern formation in associative neural networks is related to a quadratic optimization problem. Biological considerations imply that the functional is constrained in the L ∞ norm and in the L 1 norm. We consider such optimization problems. We derive the Euler-Lagrange equations, and construct basic properties of the maximizers. We study in some detail the case where the kernel of the quadratic functional is finite-dimensional. In this case the optimization problem can be fully characterized by the geometry of a certain convex and compact finite-dimensional set

  3. Relativistic quantum vorticity of the quadratic form of the Dirac equation

    International Nuclear Information System (INIS)

    Asenjo, Felipe A; Mahajan, Swadesh M

    2015-01-01

    We explore the fluid version of the quadratic form of the Dirac equation, sometimes called the Feynman–Gell-Mann equation. The dynamics of the quantum spinor field is represented by equations of motion for the fluid density, the velocity field, and the spin field. In analogy with classical relativistic and non-relativistic quantum theories, the fully relativistic fluid formulation of this equation allows a vortex dynamics. The vortical form is described by a total tensor field that is the weighted combination of the inertial, electromagnetic and quantum forces. The dynamics contrives the quadratic form of the Dirac equation as a total vorticity free system. (paper)

  4. The cyclicity of a class of quadratic reversible system of genus one

    International Nuclear Information System (INIS)

    Shao Yi; Zhao Yulin

    2011-01-01

    Highlights: → We prove Conjecture 1 in Ref. Gautier et al. under certain conditions. → We apply the zero isocline of the Riccati equation to study the behavior of ω(h) in Section . → We present a method to find the number of zeros of I''(h) in Section . - Abstract: In this paper, we investigate the bifurcations of limit cycles in a class of planar quadratic reversible system of genus one x . =y+4x 2 ,y . =-x(1-8/3 y) under quadratic perturbations. It is proved that the cyclicity of the period annulus is equal to two.

  5. Synchronising chaotic Chua's circuit using switching feedback control based on piecewise quadratic Lyapunov functions

    International Nuclear Information System (INIS)

    Hong-Bin, Zhang; Jian-Wei, Xia; Yong-Bin, Yu; Chuang-Yin, Dang

    2010-01-01

    This paper investigates the chaos synchronisation between two coupled chaotic Chua's circuits. The sufficient condition presented by linear matrix inequalities (LMIs) of global asymptotic synchronisation is attained based on piecewise quadratic Lyapunov functions. First, we obtain the piecewise linear differential inclusions (pwLDIs) model of synchronisation error dynamics, then we design a switching (piecewise-linear) feedback control law to stabilise it based on the piecewise quadratic Laypunov functions. Then we give some numerical simulations to demonstrate the effectiveness of our theoretical results

  6. Lot-Order Assignment Applying Priority Rules for the Single-Machine Total Tardiness Scheduling with Nonnegative Time-Dependent Processing Times

    Directory of Open Access Journals (Sweden)

    Jae-Gon Kim

    2015-01-01

    Full Text Available Lot-order assignment is to assign items in lots being processed to orders to fulfill the orders. It is usually performed periodically for meeting the due dates of orders especially in a manufacturing industry with a long production cycle time such as the semiconductor manufacturing industry. In this paper, we consider the lot-order assignment problem (LOAP with the objective of minimizing the total tardiness of the orders with distinct due dates. We show that we can solve the LOAP optimally by finding an optimal sequence for the single-machine total tardiness scheduling problem with nonnegative time-dependent processing times (SMTTSP-NNTDPT. Also, we address how the priority rules for the SMTTSP can be modified to those for the SMTTSP-NNTDPT to solve the LOAP. In computational experiments, we discuss the performances of the suggested priority rules and show the result of the proposed approach outperforms that of the commercial optimization software package.

  7. Encoding of rat working memory by power of multi-channel local field potentials via sparse non-negative matrix factorization

    Institute of Scientific and Technical Information of China (English)

    Xu Liu; Tiao-Tiao Liu; Wen-Wen Bai; Hu Yi; Shuang-Yan Li; Xin Tian

    2013-01-01

    Working memory plays an important role in human cognition.This study investigated how working memory was encoded by the power of multi-channel local field potentials (LFPs) based on sparse nonnegative matrix factorization (SNMF).SNMF was used to extract features from LFPs recorded from the prefrontal cortex of four Sprague-Dawley rats during a memory task in a Y maze,with 10 trials for each rat.Then the power-increased LFP components were selected as working memory-related features and the other components were removed.After that,the inverse operation of SNMF was used to study the encoding of working memory in the timefrequency domain.We demonstrated that theta and gamma power increased significantly during the working memory task.The results suggested that postsynaptic activity was simulated well by the sparse activity model.The theta and gamma bands were meaningful for encoding working memory.

  8. Parametric perturbations and suppression of chaos in n-dimensional maps

    International Nuclear Information System (INIS)

    Loskutov, A.Y.; Rybalko, S.D.

    1994-11-01

    The problem of a qualitative change in dynamics of n-dimensional chaotic maps under the influence of parametric perturbations is considered. We prove that for certain maps, - the quadratic maps family, a piece wise linear maps family, and a two-dimensional map having a hyberbolic attractor, - there are perturbations which lead to suppression of chaos. Arguments that for such maps the set of parameter values corresponding to the ordered behaviour has the positive Lebesgue measure, are given. (author). 36 refs, 12 figs

  9. On the dynamic Stability of a quadratic-cubic elastic model structure ...

    African Journals Online (AJOL)

    The main substance of this investigation is the determination of the dynamic buckling load of an imperfect quadratic-cubic elastic model structure , which ,in itself, is a Mathematical generalization of some of the many physical structures normally encountered in engineering practice and allied fields. The load function in ...

  10. Stability of Pexiderized Quadratic Functional Equation in Random 2-Normed Spaces

    Directory of Open Access Journals (Sweden)

    Mohammed A. Alghamdi

    2015-01-01

    Full Text Available The aim of this paper is to investigate the stability of Hyers-Ulam-Rassias type theorems by considering the pexiderized quadratic functional equation in the setting of random 2-normed spaces (RTNS, while the concept of random 2-normed space has been recently studied by Goleţ (2005.

  11. Results of radiotherapy in craniopharyngiomas analysed by the linear quadratic model

    Energy Technology Data Exchange (ETDEWEB)

    Guerkaynak, M. [Dept. of Radiation Oncology, Hacettepe Univ., Ankara (Turkey); Oezyar, E. [Dept. of Radiation Oncology, Hacettepe Univ., Ankara (Turkey); Zorlu, F. [Dept. of Radiation Oncology, Hacettepe Univ., Ankara (Turkey); Akyol, F.H. [Dept. of Radiation Oncology, Hacettepe Univ., Ankara (Turkey); Lale Atahan, I. [Dept. of Radiation Oncology, Hacettepe Univ., Ankara (Turkey)

    1994-12-31

    In 23 craniopharyngioma patients treated by limited surgery and external radiotherapy, the results concerning local control were analysed by linear quadratic formula. A biologically effective dose (BED) of 55 Gy, calculated with time factor and an {alpha}/{beta} value of 10 Gy, seemed to be adequate for local control. (orig.).

  12. On the Computation of Optimal Monotone Mean-Variance Portfolios via Truncated Quadratic Utility

    OpenAIRE

    Ales Cerný; Fabio Maccheroni; Massimo Marinacci; Aldo Rustichini

    2008-01-01

    We report a surprising link between optimal portfolios generated by a special type of variational preferences called divergence preferences (cf. [8]) and optimal portfolios generated by classical expected utility. As a special case we connect optimization of truncated quadratic utility (cf. [2]) to the optimal monotone mean-variance portfolios (cf. [9]), thus simplifying the computation of the latter.

  13. Afrika Statistika ISSN 2316-090X Quadratic loss estimation of a ...

    African Journals Online (AJOL)

    vector X is normally distributed with mean θ and of covariance matrix the identity Ip. In this setting, the random vectors X and U are independent then the situation becomes the same as when just the vector X is available, so here, we do not consider the residual vector. U. So in the first step, we study the quadratic loss ...

  14. A numerical algorithm to find all feedback Nash equilibria in scalar affine quadratic differential games

    NARCIS (Netherlands)

    Engwerda, Jacob

    2015-01-01

    This note deals with solving scalar coupled algebraic Riccati equations. These equations arise in finding linear feedback Nash equilibria of the scalar N-player affine quadratic differential game. A numerical procedure is provided to compute all the stabilizing solutions. The main idea is to

  15. An Analysis and Design for Nonlinear Quadratic Systems Subject to Nested Saturation

    Directory of Open Access Journals (Sweden)

    Minsong Zhang

    2013-01-01

    Full Text Available This paper considers the stability problem for nonlinear quadratic systems with nested saturation input. The interesting treatment method proposed to nested saturation here is put into use a well-established linear differential control tool. And the new conclusions include the existing conclusion on this issue and have less conservatism than before. Simulation example illustrates the effectiveness of the established methodologies.

  16. A New GCD Algorithm for Quadratic Number Rings with Unique Factorization

    DEFF Research Database (Denmark)

    Agarwal, Saurabh; Frandsen, Gudmund Skovbjerg

    2006-01-01

    We present an algorithm to compute a greatest common divisor of two integers in a quadratic number ring that is a unique factorization domain. The algorithm uses bit operations in a ring of discriminant Δ. This appears to be the first gcd algorithm of complexity o(n 2) for any fixed non-Euclidean...

  17. Wave packet dynamics and photofragmentation in time-dependent quadratic potentials

    DEFF Research Database (Denmark)

    Møller, Klaus Braagaard; Henriksen, Niels Engholm

    1996-01-01

    We study the dynamics of generalized harmonic oscillator states in time-dependent quadratic potentials and derive analytical expressions for the momentum space and the Wigner phase space representation of these wave packets. Using these results we consider a model for the rotational excitation...

  18. On the buckling of magnetothermoviscoelastic plate and an associated quadratic operator bundle

    International Nuclear Information System (INIS)

    El-Sayed, M.A.

    1987-10-01

    The paper is devoted to the application of the theory of quadratic self-adjoint operator bundles to investigate the problem of oscillations and stability of an isotropic homogeneous, thermoviscoelastic ferromagnetic plate of arbitrary shape, small constant thickness and infinite electric conductivity, placed in a transverse uniform constant magnetic field and clamped along its whole boundary. 14 refs

  19. Designing microstructured polymer optical fibers for cascaded quadratic soliton compression of femtosecond pulses

    DEFF Research Database (Denmark)

    Bache, Morten

    2009-01-01

    The dispersion of index-guiding microstructured polymer optical fibers is calculated for second-harmonic generation. The quadratic nonlinearity is assumed to come from poling of the polymer, which in this study is chosen to be the cyclic olefin copolymer Topas. We found a very large phase mismatc...

  20. Comparing heat flow models for interpretation of precast quadratic pile heat exchanger thermal response tests

    DEFF Research Database (Denmark)

    Alberdi Pagola, Maria; Poulsen, Søren Erbs; Loveridge, Fleur

    2018-01-01

    This paper investigates the applicability of currently available analytical, empirical and numerical heat flow models for interpreting thermal response tests (TRT) of quadratic cross section precast pile heat exchangers. A 3D finite element model (FEM) is utilised for interpreting five TRTs by in...