Instantaneous nonlinear assessment of complex cardiovascular dynamics by Laguerre-Volterra point process models.

Science.gov (United States)

Valenza, Gaetano; Citi, Luca; Barbieri, Riccardo

2013-01-01

We report an exemplary study of instantaneous assessment of cardiovascular dynamics performed using point-process nonlinear models based on Laguerre expansion of the linear and nonlinear Wiener-Volterra kernels. As quantifiers, instantaneous measures such as high order spectral features and Lyapunov exponents can be estimated from a quadratic and cubic autoregressive formulation of the model first order moment, respectively. Here, these measures are evaluated on heartbeat series coming from 16 healthy subjects and 14 patients with Congestive Hearth Failure (CHF). Data were gathered from the on-line repository PhysioBank, which has been taken as landmark for testing nonlinear indices. Results show that the proposed nonlinear Laguerre-Volterra point-process methods are able to track the nonlinear and complex cardiovascular dynamics, distinguishing significantly between CHF and healthy heartbeat series.

Global stability and pattern formation in a nonlocal diffusive Lotka-Volterra competition model

Science.gov (United States)

Ni, Wenjie; Shi, Junping; Wang, Mingxin

2018-06-01

A diffusive Lotka-Volterra competition model with nonlocal intraspecific and interspecific competition between species is formulated and analyzed. The nonlocal competition strength is assumed to be determined by a diffusion kernel function to model the movement pattern of the biological species. It is shown that when there is no nonlocal intraspecific competition, the dynamics properties of nonlocal diffusive competition problem are similar to those of classical diffusive Lotka-Volterra competition model regardless of the strength of nonlocal interspecific competition. Global stability of nonnegative constant equilibria are proved using Lyapunov or upper-lower solution methods. On the other hand, strong nonlocal intraspecific competition increases the system spatiotemporal dynamic complexity. For the weak competition case, the nonlocal diffusive competition model may possess nonconstant positive equilibria for some suitably large nonlocal intraspecific competition coefficients.

Fault Detection for Shipboard Monitoring – Volterra Kernel and Hammerstein Model Approaches

DEFF Research Database (Denmark)

Lajic, Zoran; Blanke, Mogens; Nielsen, Ulrik Dam

2009-01-01

In this paper nonlinear fault detection for in-service monitoring and decision support systems for ships will be presented. The ship is described as a nonlinear system, and the stochastic wave elevation and the associated ship responses are conveniently modelled in frequency domain. The transform....... The transformation from time domain to frequency domain has been conducted by use of Volterra theory. The paper takes as an example fault detection of a containership on which a decision support system has been installed....

Parametric output-only identification of time-varying structures using a kernel recursive extended least squares TARMA approach

Science.gov (United States)

Ma, Zhi-Sai; Liu, Li; Zhou, Si-Da; Yu, Lei; Naets, Frank; Heylen, Ward; Desmet, Wim

2018-01-01

The problem of parametric output-only identification of time-varying structures in a recursive manner is considered. A kernelized time-dependent autoregressive moving average (TARMA) model is proposed by expanding the time-varying model parameters onto the basis set of kernel functions in a reproducing kernel Hilbert space. An exponentially weighted kernel recursive extended least squares TARMA identification scheme is proposed, and a sliding-window technique is subsequently applied to fix the computational complexity for each consecutive update, allowing the method to operate online in time-varying environments. The proposed sliding-window exponentially weighted kernel recursive extended least squares TARMA method is employed for the identification of a laboratory time-varying structure consisting of a simply supported beam and a moving mass sliding on it. The proposed method is comparatively assessed against an existing recursive pseudo-linear regression TARMA method via Monte Carlo experiments and shown to be capable of accurately tracking the time-varying dynamics. Furthermore, the comparisons demonstrate the superior achievable accuracy, lower computational complexity and enhanced online identification capability of the proposed kernel recursive extended least squares TARMA approach.

Upport vector machines for nonlinear kernel ARMA system identification.

Science.gov (United States)

Martínez-Ramón, Manel; Rojo-Alvarez, José Luis; Camps-Valls, Gustavo; Muñioz-Marí, Jordi; Navia-Vázquez, Angel; Soria-Olivas, Emilio; Figueiras-Vidal, Aníbal R

2006-11-01

Nonlinear system identification based on support vector machines (SVM) has been usually addressed by means of the standard SVM regression (SVR), which can be seen as an implicit nonlinear autoregressive and moving average (ARMA) model in some reproducing kernel Hilbert space (RKHS). The proposal of this letter is twofold. First, the explicit consideration of an ARMA model in an RKHS (SVM-ARMA2K) is proposed. We show that stating the ARMA equations in an RKHS leads to solving the regularized normal equations in that RKHS, in terms of the autocorrelation and cross correlation of the (nonlinearly) transformed input and output discrete time processes. Second, a general class of SVM-based system identification nonlinear models is presented, based on the use of composite Mercer's kernels. This general class can improve model flexibility by emphasizing the input-output cross information (SVM-ARMA4K), which leads to straightforward and natural combinations of implicit and explicit ARMA models (SVR-ARMA2K and SVR-ARMA4K). Capabilities of these different SVM-based system identification schemes are illustrated with two benchmark problems.

Fast metabolite identification with Input Output Kernel Regression

Science.gov (United States)

Brouard, Céline; Shen, Huibin; Dührkop, Kai; d'Alché-Buc, Florence; Böcker, Sebastian; Rousu, Juho

2016-01-01

Motivation: An important problematic of metabolomics is to identify metabolites using tandem mass spectrometry data. Machine learning methods have been proposed recently to solve this problem by predicting molecular fingerprint vectors and matching these fingerprints against existing molecular structure databases. In this work we propose to address the metabolite identification problem using a structured output prediction approach. This type of approach is not limited to vector output space and can handle structured output space such as the molecule space. Results: We use the Input Output Kernel Regression method to learn the mapping between tandem mass spectra and molecular structures. The principle of this method is to encode the similarities in the input (spectra) space and the similarities in the output (molecule) space using two kernel functions. This method approximates the spectra-molecule mapping in two phases. The first phase corresponds to a regression problem from the input space to the feature space associated to the output kernel. The second phase is a preimage problem, consisting in mapping back the predicted output feature vectors to the molecule space. We show that our approach achieves state-of-the-art accuracy in metabolite identification. Moreover, our method has the advantage of decreasing the running times for the training step and the test step by several orders of magnitude over the preceding methods. Availability and implementation: Contact: celine.brouard@aalto.fi Supplementary information: Supplementary data are available at Bioinformatics online. PMID:27307628

A unified construction for the algebro-geometric quasiperiodic solutions of the Lotka-Volterra and relativistic Lotka-Volterra hierarchy

Science.gov (United States)

Zhao, Peng; Fan, Engui

2015-04-01

In this paper, a new type of integrable differential-difference hierarchy, namely, the generalized relativistic Lotka-Volterra (GRLV) hierarchy, is introduced. This hierarchy is closely related to Lotka-Volterra lattice and relativistic Lotka-Volterra lattice, which allows us to provide a unified and effective way to obtain some exact solutions for both the Lotka-Volterra hierarchy and the relativistic Lotka-Volterra hierarchy. In particular, we shall construct algebro-geometric quasiperiodic solutions for the LV hierarchy and the RLV hierarchy in a unified manner on the basis of the finite gap integration theory.

Nonlinear degradation of a visible-light communication link: A Volterra-series approach

Science.gov (United States)

Kamalakis, Thomas; Dede, Georgia

2018-06-01

Visible light communications can be used to provide illumination and data communication at the same time. In this paper, a reverse-engineering approach is presented for assessing the impact of nonlinear signal distortion in visible light communication links. The approach is based on the Volterra series expansion and has the advantage of accurately accounting for memory effects in contrast to the static nonlinear models that are popular in the literature. Volterra kernels describe the end-to-end system response and can be inferred from measurements. Consequently, this approach does not rely on any particular physical models and assumptions regarding the individual link components. We provide the necessary framework for estimating the nonlinear distortion on the symbol estimates of a discrete multitone modulated link. Various design aspects such as waveform clipping and predistortion are also incorporated in the analysis. Using this framework, the nonlinear signal-to-interference is calculated for the system at hand. It is shown that at high signal amplitudes, the nonlinear signal-to-interference can be less than 25 dB.

On filtering over Îto-Volterra observations

Directory of Open Access Journals (Sweden)

Michael V. Basin

2000-01-01

Full Text Available In this paper, the Kalman-Bucy filter is designed for an Îto-Volterra process over Ito-Volterra observations that cannot be reduced to the case of a differential observation equation. The Kalman-Bucy filter is then designed for an Ito-Volterra process over discontinuous Ito-Volterra observations. Based on the obtained results, the filtering problem over discrete observations with delays is solved. Proofs of the theorems substantiating the filtering algorithms are given.

Reproducing kernel method with Taylor expansion for linear Volterra integro-differential equations

Directory of Open Access Journals (Sweden)

Azizallah Alvandi

2017-06-01

Full Text Available This research aims of the present a new and single algorithm for linear integro-differential equations (LIDE. To apply the reproducing Hilbert kernel method, there is made an equivalent transformation by using Taylor series for solving LIDEs. Shown in series form is the analytical solution in the reproducing kernel space and the approximate solution $ u_{N} $ is constructed by truncating the series to $ N $ terms. It is easy to prove the convergence of $ u_{N} $ to the analytical solution. The numerical solutions from the proposed method indicate that this approach can be implemented easily which shows attractive features.

Multiscale Support Vector Learning With Projection Operator Wavelet Kernel for Nonlinear Dynamical System Identification.

Science.gov (United States)

Lu, Zhao; Sun, Jing; Butts, Kenneth

2016-02-03

A giant leap has been made in the past couple of decades with the introduction of kernel-based learning as a mainstay for designing effective nonlinear computational learning algorithms. In view of the geometric interpretation of conditional expectation and the ubiquity of multiscale characteristics in highly complex nonlinear dynamic systems [1]-[3], this paper presents a new orthogonal projection operator wavelet kernel, aiming at developing an efficient computational learning approach for nonlinear dynamical system identification. In the framework of multiresolution analysis, the proposed projection operator wavelet kernel can fulfill the multiscale, multidimensional learning to estimate complex dependencies. The special advantage of the projection operator wavelet kernel developed in this paper lies in the fact that it has a closed-form expression, which greatly facilitates its application in kernel learning. To the best of our knowledge, it is the first closed-form orthogonal projection wavelet kernel reported in the literature. It provides a link between grid-based wavelets and mesh-free kernel-based methods. Simulation studies for identifying the parallel models of two benchmark nonlinear dynamical systems confirm its superiority in model accuracy and sparsity.

A Historical Gem from Vito Volterra.

Science.gov (United States)

Dunham, William

1990-01-01

Presented is the theorem proposed by Volterra based on the idea that there is no function continuous at each rational point and discontinuous at each irrational point. Discussed are the two conclusions that were drawn by Volterra based on his solution to this problem. (KR)

Quasipolynomial generalization of Lotka-Volterra mappings

Science.gov (United States)

Hernández-Bermejo, Benito; Brenig, Léon

2002-07-01

In recent years, it has been shown that Lotka-Volterra mappings constitute a valuable tool from both the theoretical and the applied points of view, with developments in very diverse fields such as physics, population dynamics, chemistry and economy. The purpose of this work is to demonstrate that many of the most important ideas and algebraic methods that constitute the basis of the quasipolynomial formalism (originally conceived for the analysis of ordinary differential equations) can be extended into the mapping domain. The extension of the formalism into the discrete-time context is remarkable as far as the quasipolynomial methodology had never been shown to be applicable beyond the differential case. It will be demonstrated that Lotka-Volterra mappings play a central role in the quasipolynomial formalism for the discrete-time case. Moreover, the extension of the formalism into the discrete-time domain allows a significant generalization of Lotka-Volterra mappings as well as a whole transfer of algebraic methods into the discrete-time context. The result is a novel and more general conceptual framework for the understanding of Lotka-Volterra mappings as well as a new range of possibilities that become open not only for the theoretical analysis of Lotka-Volterra mappings and their generalizations, but also for the development of new applications.

Quasipolynomial generalization of Lotka-Volterra mappings

International Nuclear Information System (INIS)

Hernandez-Bermejo, Benito; Brenig, Leon

2002-01-01

In recent years, it has been shown that Lotka-Volterra mappings constitute a valuable tool from both the theoretical and the applied points of view, with developments in very diverse fields such as physics, population dynamics, chemistry and economy. The purpose of this work is to demonstrate that many of the most important ideas and algebraic methods that constitute the basis of the quasipolynomial formalism (originally conceived for the analysis of ordinary differential equations) can be extended into the mapping domain. The extension of the formalism into the discrete-time context is remarkable as far as the quasipolynomial methodology had never been shown to be applicable beyond the differential case. It will be demonstrated that Lotka-Volterra mappings play a central role in the quasipolynomial formalism for the discrete-time case. Moreover, the extension of the formalism into the discrete-time domain allows a significant generalization of Lotka-Volterra mappings as well as a whole transfer of algebraic methods into the discrete-time context. The result is a novel and more general conceptual framework for the understanding of Lotka-Volterra mappings as well as a new range of possibilities that become open not only for the theoretical analysis of Lotka-Volterra mappings and their generalizations, but also for the development of new applications. (author)

Continuous Multistep Methods for Volterra Integro-Differential

African Journals Online (AJOL)

Kamoh et al.

DIFFERENTIAL EQUATIONS OF THE SECOND ORDER. 1Kamoh N.M. ... methods, Volterra integro-differential equation, Convergent, ...... Research of a Multistep Method Applied to Numerical Solution of. Volterra ... Congress on Engineering.

Integrable deformations of Lotka-Volterra systems

International Nuclear Information System (INIS)

Ballesteros, Angel; Blasco, Alfonso; Musso, Fabio

2011-01-01

The Hamiltonian structure of a class of three-dimensional (3D) Lotka-Volterra (LV) equations is revisited from a novel point of view by showing that the quadratic Poisson structure underlying its integrability structure is just a real three-dimensional Poisson-Lie group. As a consequence, the Poisson coalgebra map Δ (2) that is given by the group multiplication provides the keystone for the explicit construction of a new family of 3N-dimensional integrable systems that, under certain constraints, contain N sets of deformed versions of the 3D LV equations. Moreover, by considering the most generic Poisson-Lie structure on this group, a new two-parametric integrable perturbation of the 3D LV system through polynomial and rational perturbation terms is explicitly found. -- Highlights: → A new Poisson-Lie approach to the integrability of Lotka-Volterra system is given. → New integrable deformations of the 3D Lotka-Volterra system are obtained. → Integrable Lotka-Volterra-type equations in 3N dimensions are deduced.

Comparative analysis of the influence of creep of concrete composite beams of steel - concrete model based on Volterra integral equation

Directory of Open Access Journals (Sweden)

Partov Doncho

2017-01-01

Full Text Available The paper presents analysis of the stress-strain behaviour and deflection changes due to creep in statically determinate composite steel-concrete beam according to EUROCODE 2, ACI209R-92 and Gardner&Lockman models. The mathematical model involves the equation of equilibrium, compatibility and constitutive relationship, i.e. an elastic law for the steel part and an integral-type creep law of Boltzmann - Volterra for the concrete part considering the above mentioned models. On the basis of the theory of viscoelastic body of Maslov-Arutyunian-Trost-Zerna-Bažant for determining the redistribution of stresses in beam section between concrete plate and steel beam with respect to time 't', two independent Volterra integral equations of the second kind have been derived. Numerical method based on linear approximation of the singular kernel function in the integral equation is presented. Example with the model proposed is investigated.

The conditions of existence of first integrals and Hamiltonian structures of Lotka-Volterra and Volterra systems

International Nuclear Information System (INIS)

Dubovik, V.M.; Galperin, A.G.; Richvitsky, V.S.; Slepnyov, S.K.

2000-01-01

A study of a certain subset of Volterra equations has revealed that some statements about time-independent constants of motion, Hamiltonian functions, and Poisson structure matrices appearing in the Lotka-Volterra equations, either regarded as proven or of the sort that could be proven, are not valid, in fact. Particular cases are given as examples to explain the reasons for the occurring phenomena

Factorization and the synthesis of optimal feedback kernels for differential-delay systems

Science.gov (United States)

Milman, Mark M.; Scheid, Robert E.

1987-01-01

A combination of ideas from the theories of operator Riccati equations and Volterra factorizations leads to the derivation of a novel, relatively simple set of hyperbolic equations which characterize the optimal feedback kernel for the finite-time regulator problem for autonomous differential-delay systems. Analysis of these equations elucidates the underlying structure of the feedback kernel and leads to the development of fast and accurate numerical methods for its computation. Unlike traditional formulations based on the operator Riccati equation, the gain is characterized by means of classical solutions of the derived set of equations. This leads to the development of approximation schemes which are analogous to what has been accomplished for systems of ordinary differential equations with given initial conditions.

On generalized Volterra systems

Science.gov (United States)

Charalambides, S. A.; Damianou, P. A.; Evripidou, C. A.

2015-01-01

We construct a large family of evidently integrable Hamiltonian systems which are generalizations of the KM system. The algorithm uses the root system of a complex simple Lie algebra. The Hamiltonian vector field is homogeneous cubic but in a number of cases a simple change of variables transforms such a system to a quadratic Lotka-Volterra system. We present in detail all such systems in the cases of A3, A4 and we also give some examples from higher dimensions. We classify all possible Lotka-Volterra systems that arise via this algorithm in the An case.

Nonpolynomial vector fields under the Lotka-Volterra normal form

Science.gov (United States)

Hernández-Bermejo, Benito; Fairén, Víctor

1995-02-01

We carry out the generalization of the Lotka-Volterra embedding to flows not explicitly recognizable under the generalized Lotka-Volterra format. The procedure introduces appropriate auxiliary variables, and it is shown how, to a great extent, the final Lotka-Volterra system is independent of their specific definition. Conservation of the topological equivalence during the process is also demonstrated.

Volterra Filtering for ADC Error Correction

Directory of Open Access Journals (Sweden)

J. Saliga

2001-09-01

Full Text Available Dynamic non-linearity of analog-to-digital converters (ADCcontributes significantly to the distortion of digitized signals. Thispaper introduces a new effective method for compensation such adistortion based on application of Volterra filtering. Considering ana-priori error model of ADC allows finding an efficient inverseVolterra model for error correction. Efficiency of proposed method isdemonstrated on experimental results.

Multiscale asymmetric orthogonal wavelet kernel for linear programming support vector learning and nonlinear dynamic systems identification.

Science.gov (United States)

Lu, Zhao; Sun, Jing; Butts, Kenneth

2014-05-01

Support vector regression for approximating nonlinear dynamic systems is more delicate than the approximation of indicator functions in support vector classification, particularly for systems that involve multitudes of time scales in their sampled data. The kernel used for support vector learning determines the class of functions from which a support vector machine can draw its solution, and the choice of kernel significantly influences the performance of a support vector machine. In this paper, to bridge the gap between wavelet multiresolution analysis and kernel learning, the closed-form orthogonal wavelet is exploited to construct new multiscale asymmetric orthogonal wavelet kernels for linear programming support vector learning. The closed-form multiscale orthogonal wavelet kernel provides a systematic framework to implement multiscale kernel learning via dyadic dilations and also enables us to represent complex nonlinear dynamics effectively. To demonstrate the superiority of the proposed multiscale wavelet kernel in identifying complex nonlinear dynamic systems, two case studies are presented that aim at building parallel models on benchmark datasets. The development of parallel models that address the long-term/mid-term prediction issue is more intricate and challenging than the identification of series-parallel models where only one-step ahead prediction is required. Simulation results illustrate the effectiveness of the proposed multiscale kernel learning.

Optimal control of stochastic difference Volterra equations an introduction

CERN Document Server

Shaikhet, Leonid

2015-01-01

This book showcases a subclass of hereditary systems, that is, systems with behaviour depending not only on their current state but also on their past history; it is an introduction to the mathematical theory of optimal control for stochastic difference Volterra equations of neutral type. As such, it will be of much interest to researchers interested in modelling processes in physics, mechanics, automatic regulation, economics and finance, biology, sociology and medicine for all of which such equations are very popular tools. The text deals with problems of optimal control such as meeting given performance criteria, and stabilization, extending them to neutral stochastic difference Volterra equations. In particular, it contrasts the difference analogues of solutions to optimal control and optimal estimation problems for stochastic integral Volterra equations with optimal solutions for corresponding problems in stochastic difference Volterra equations. Optimal Control of Stochastic Difference Volterra Equation...

Nonparametric Identification of Glucose-Insulin Process in IDDM Patient with Multi-meal Disturbance

Science.gov (United States)

Bhattacharjee, A.; Sutradhar, A.

2012-12-01

Modern close loop control for blood glucose level in a diabetic patient necessarily uses an explicit model of the process. A fixed parameter full order or reduced order model does not characterize the inter-patient and intra-patient parameter variability. This paper deals with a frequency domain nonparametric identification of the nonlinear glucose-insulin process in an insulin dependent diabetes mellitus patient that captures the process dynamics in presence of uncertainties and parameter variations. An online frequency domain kernel estimation method has been proposed that uses the input-output data from the 19th order first principle model of the patient in intravenous route. Volterra equations up to second order kernels with extended input vector for a Hammerstein model are solved online by adaptive recursive least square (ARLS) algorithm. The frequency domain kernels are estimated using the harmonic excitation input data sequence from the virtual patient model. A short filter memory length of M = 2 was found sufficient to yield acceptable accuracy with lesser computation time. The nonparametric models are useful for closed loop control, where the frequency domain kernels can be directly used as the transfer function. The validation results show good fit both in frequency and time domain responses with nominal patient as well as with parameter variations.

Automatic Control Systems Modeling by Volterra Polynomials

Directory of Open Access Journals (Sweden)

S. V. Solodusha

2012-01-01

Full Text Available The problem of the existence of the solutions of polynomial Volterra integral equations of the first kind of the second degree is considered. An algorithm of the numerical solution of one class of Volterra nonlinear systems of the first kind is developed. Numerical results for test examples are presented.

Volterra Series Based Distortion Effect

DEFF Research Database (Denmark)

Agerkvist, Finn T.

2010-01-01

A large part of the characteristic sound of the electric guitar comes from nonlinearities in the signal path. Such nonlinearities may come from the input- or output-stage of the amplier, which is often equipped with vacuum tubes or a dedicated distortion pedal. In this paper the Volterra series...... expansion for non linear systems is investigated with respect to generating good distortion. The Volterra series allows for unlimited adjustment of the level and frequency dependency of each distortion component. Subjectively relevant ways of linking the dierent orders are discussed....

Composite spectral functions for solving Volterra's population model

International Nuclear Information System (INIS)

Ramezani, M.; Razzaghi, M.; Dehghan, M.

2007-01-01

An approximate method for solving Volterra's population model for population growth of a species in a closed system is proposed. Volterra's model is a nonlinear integro-differential equation, where the integral term represents the effect of toxin. The approach is based upon composite spectral functions approximations. The properties of composite spectral functions consisting of few terms of orthogonal functions are presented and are utilized to reduce the solution of the Volterra's model to the solution of a system of algebraic equations. The method is easy to implement and yields very accurate result

Volterra, Fascism, and France.

Science.gov (United States)

Capristo, Annalisa

2015-12-01

My contribution focuses on two aspects strictly related each other. On one hand, the progressive marginalization of Volterra from Italian scientific and political life after the rise of Fascism - because of his public anti-Fascist stance, both as a senator and as a professor - until his definitive exclusion on racial grounds in 1938. On the other hand, the reactions of his French colleagues and friends to this ostracism, and the support he received from them. As it emerges from several sources (Volterra's correspondence, institutional documentation, conference proceedings, etc.), it was mainly thanks to their support that he was able to escape the complete isolation and the "civil death" to which the regime condemned many of its adversaries.

Neural network modeling of nonlinear systems based on Volterra series extension of a linear model

Science.gov (United States)

Soloway, Donald I.; Bialasiewicz, Jan T.

1992-01-01

A Volterra series approach was applied to the identification of nonlinear systems which are described by a neural network model. A procedure is outlined by which a mathematical model can be developed from experimental data obtained from the network structure. Applications of the results to the control of robotic systems are discussed.

On chaos in Lotka–Volterra systems: an analytical approach

International Nuclear Information System (INIS)

Kozlov, Vladimir; Vakulenko, Sergey

2013-01-01

In this paper, we study Lotka–Volterra systems with N species and n resources. We show that the long time dynamics of these systems may be complicated. Depending on parameter choice, they can generate all types of hyperbolic dynamics, in particular, chaotic ones. Moreover, Lotka–Volterra systems can generate Lorenz dynamics. We state the conditions on the strong persistence of Lotka–Volterra systems when the number of resources is less than the number of species. (paper)

Hamiltonian structure of the Lotka-Volterra equations

Science.gov (United States)

Nutku, Y.

1990-03-01

The Lotka-Volterra equations governing predator-prey relations are shown to admit Hamiltonian structure with respect to a generalized Poisson bracket. These equations provide an example of a system for which the naive criterion for the existence of Hamiltonian structure fails. We show further that there is a three-component generalization of the Lotka-Volterra equations which is a bi-Hamiltonian system.

Identification of Fusarium damaged wheat kernels using image analysis

Directory of Open Access Journals (Sweden)

Ondřej Jirsa

2011-01-01

Full Text Available Visual evaluation of kernels damaged by Fusarium spp. pathogens is labour intensive and due to a subjective approach, it can lead to inconsistencies. Digital imaging technology combined with appropriate statistical methods can provide much faster and more accurate evaluation of the visually scabby kernels proportion. The aim of the present study was to develop a discrimination model to identify wheat kernels infected by Fusarium spp. using digital image analysis and statistical methods. Winter wheat kernels from field experiments were evaluated visually as healthy or damaged. Deoxynivalenol (DON content was determined in individual kernels using an ELISA method. Images of individual kernels were produced using a digital camera on dark background. Colour and shape descriptors were obtained by image analysis from the area representing the kernel. Healthy and damaged kernels differed significantly in DON content and kernel weight. Various combinations of individual shape and colour descriptors were examined during the development of the model using linear discriminant analysis. In addition to basic descriptors of the RGB colour model (red, green, blue, very good classification was also obtained using hue from the HSL colour model (hue, saturation, luminance. The accuracy of classification using the developed discrimination model based on RGBH descriptors was 85 %. The shape descriptors themselves were not specific enough to distinguish individual kernels.

Multi-Hamiltonian structure of Lotka-Volterra and quantum Volterra models

International Nuclear Information System (INIS)

Cronstroem, C.; Noga, M.

1995-01-01

We consider evolution equations of the Lotka-Volterra type, and elucidate especially their formulation as canonical Hamiltonian systems. The general conditions under which these equations admit several conserved quantities (multi-Hamiltonians) are analysed. A special case, which is related to the Liouville model on a lattice, is considered in detail, both as a classical and as a quantum system. (orig.)

Adaptive Kernel Canonical Correlation Analysis Algorithms for Nonparametric Identification of Wiener and Hammerstein Systems

Directory of Open Access Journals (Sweden)

Ignacio Santamaría

2008-04-01

Full Text Available This paper treats the identification of nonlinear systems that consist of a cascade of a linear channel and a nonlinearity, such as the well-known Wiener and Hammerstein systems. In particular, we follow a supervised identification approach that simultaneously identifies both parts of the nonlinear system. Given the correct restrictions on the identification problem, we show how kernel canonical correlation analysis (KCCA emerges as the logical solution to this problem. We then extend the proposed identification algorithm to an adaptive version allowing to deal with time-varying systems. In order to avoid overfitting problems, we discuss and compare three possible regularization techniques for both the batch and the adaptive versions of the proposed algorithm. Simulations are included to demonstrate the effectiveness of the presented algorithm.

An equivalent condition for stability properties of Lotka-Volterra systems

International Nuclear Information System (INIS)

Chu Tianguang

2007-01-01

We give a solvable Lie algebraic condition for the equivalence of four typical stability notions (asymptotic stability, D-stability, total stability, and Volterra-Lyapunov stability) concerning Lotka-Volterra systems. Our approach makes use of the decomposition of the interaction matrix into symmetric and skew-symmetric parts, which may be related to the cooperative and competitive interaction pattern of a Lotka-Volterra system. The present result covers a known condition and can yield a larger set of interaction matrices for equivalence of the stability properties

Feature fusion using kernel joint approximate diagonalization of eigen-matrices for rolling bearing fault identification

Science.gov (United States)

Liu, Yongbin; He, Bing; Liu, Fang; Lu, Siliang; Zhao, Yilei

2016-12-01

Fault pattern identification is a crucial step for the intelligent fault diagnosis of real-time health conditions in monitoring a mechanical system. However, many challenges exist in extracting the effective feature from vibration signals for fault recognition. A new feature fusion method is proposed in this study to extract new features using kernel joint approximate diagonalization of eigen-matrices (KJADE). In the method, the input space that is composed of original features is mapped into a high-dimensional feature space by nonlinear mapping. Then, the new features can be estimated through the eigen-decomposition of the fourth-order cumulative kernel matrix obtained from the feature space. Therefore, the proposed method could be used to reduce data redundancy because it extracts the inherent pattern structure of different fault classes as it is nonlinear by nature. The integration evaluation factor of between-class and within-class scatters (SS) is employed to depict the clustering performance quantitatively, and the new feature subset extracted by the proposed method is fed into a multi-class support vector machine for fault pattern identification. Finally, the effectiveness of the proposed method is verified by experimental vibration signals with different bearing fault types and severities. Results of several cases show that the KJADE algorithm is efficient in feature fusion for bearing fault identification.

SOLVING FRACTIONAL-ORDER COMPETITIVE LOTKA-VOLTERRA MODEL BY NSFD SCHEMES

Directory of Open Access Journals (Sweden)

S.ZIBAEI

2016-12-01

Full Text Available In this paper, we introduce fractional-order into a model competitive Lotka- Volterra prey-predator system. We will discuss the stability analysis of this fractional system. The non-standard nite difference (NSFD scheme is implemented to study the dynamic behaviors in the fractional-order Lotka-Volterra system. Proposed non-standard numerical scheme is compared with the forward Euler and fourth order Runge-Kutta methods. Numerical results show that the NSFD approach is easy and accurate for implementing when applied to fractional-order Lotka-Volterra model.

Representation of neural networks as Lotka-Volterra systems

International Nuclear Information System (INIS)

Moreau, Yves; Vandewalle, Joos; Louies, Stephane; Brenig, Leon

1999-01-01

We study changes of coordinates that allow the representation of the ordinary differential equations describing continuous-time recurrent neural networks into differential equations describing predator-prey models--also called Lotka-Volterra systems. We transform the equations for the neural network first into quasi-monomial form, where we express the vector field of the dynamical system as a linear combination of products of powers of the variables. In practice, this transformation is possible only if the activation function is the hyperbolic tangent or the logistic sigmoied. From this quasi-monomial form, we can directly transform the system further into Lotka-Volterra equations. The resulting Lotka-Volterra system is of higher dimension than the original system, but the behavior of its first variables is equivalent to the behavior of the original neural network

Lotka-Volterra representation of general nonlinear systems.

Science.gov (United States)

Hernández-Bermejo, B; Fairén, V

1997-02-01

In this article we elaborate on the structure of the generalized Lotka-Volterra (GLV) form for nonlinear differential equations. We discuss here the algebraic properties of the GLV family, such as the invariance under quasimonomial transformations and the underlying structure of classes of equivalence. Each class possesses a unique representative under the classical quadratic Lotka-Volterra form. We show how other standard modeling forms of biological interest, such as S-systems or mass-action systems, are naturally embedded into the GLV form, which thus provides a formal framework for their comparison and for the establishment of transformation rules. We also focus on the issue of recasting of general nonlinear systems into the GLV format. We present a procedure for doing so and point at possible sources of ambiguity that could make the resulting Lotka-Volterra system dependent on the path followed. We then provide some general theorems that define the operational and algorithmic framework in which this is not the case.

A kernel-based approach to MIMO LPV state-space identification and application to a nonlinear process system

NARCIS (Netherlands)

Rizvi, S.Z.; Mohammadpour, J.; Toth, R.; Meskin, N.

2015-01-01

This paper first describes the development of a nonparametric identification method for linear parameter-varying (LPV) state-space models and then applies it to a nonlinear process system. The proposed method uses kernel-based least-squares support vector machines (LS-SVM). While parametric

Solvability of Urysohn and Urysohn-Volterra equations with hysteresis in weighted spaces

International Nuclear Information System (INIS)

Darwish Mohamed Abdalla

2005-09-01

The existence of solutions to nonlinear integral equations of the second kind with hysteresis, of Urysohn-Volterra and Urysohn types has been established. We develop the solvability theory of Urysohn-Volterra equation with hysteresis in weighted spaces proposed by the author [M.A. Darwish, On solvability of Urysohn-Volterra equations with hysteresis in weighted spaces, J. Integral Equations and Application, 14(2) (2002), 151-163]. (author)

Lie Point Symmetries and Exact Solutions of the Coupled Volterra System

International Nuclear Information System (INIS)

Ping, Liu; Sen-Yue, Lou

2010-01-01

The coupled Volterra system, an integrable discrete form of a coupled Korteweg–de Vries (KdV) system applied widely in fluids, Bose–Einstein condensation and atmospheric dynamics, is studied with the help of the Lie point symmetries. Two types of delayed differential reduction systems are derived from the coupled Volterra system by means of the symmetry reduction approach and symbolic computation. Cnoidal wave and solitary wave solutions for a delayed differential reduction system and the coupled Volterra system are proposed, respectively. (general)

Generalized symmetries and conserved quantities of the Lotka-Volterra model

Science.gov (United States)

Baumann, G.; Freyberger, M.

1991-07-01

We examine the generalized symmetries of the Lotka-Volterra model to find the parameter values at which one time-dependent integral of motion exists. In this case the integral can be read off from the symmetries themselves. We also demonstrate the connection to a Hamiltonian structure of the Lotka-Volterra model.

On various integrable discretizations of a general two-component Volterra system

International Nuclear Information System (INIS)

Babalic, Corina N; Carstea, A S

2013-01-01

We present two integrable discretizations of a general differential–difference bicomponent Volterra system. The results are obtained by discretizing directly the corresponding Hirota bilinear equations in two different ways. Multisoliton solutions are presented together with a new discrete form of Lotka–Volterra equation obtained by an alternative bilinearization. (paper)

Volterra equalization of complex modulation utilizing frequency chirp in directly modulated lasers

Science.gov (United States)

Hu, Shaohua; Yi, Xingwen; Zhang, Jing; Song, Yang; Zhu, Mingyue; Qiu, Kun

2018-02-01

We apply Volterra-based equalization for complex modulated optical signals utilizing the frequency chirp in DMLs. We experimentally demonstrate that the higher order Volterra filter is necessary in the higher speed transmissions. For further study, we isolate the adiabatic chirp by injection locking and realize the optical PM transmission. We make a comparison among IM, FM and PM with Volterra equalization, finding that PM and FM are more power insensitive and suitable for high speed, power limited fiber transmission. The performance can be further improved by exploiting the diversity gain.

On a Volterra Stieltjes integral equation

Directory of Open Access Journals (Sweden)

P. T. Vaz

1990-01-01

Full Text Available The paper deals with a study of linear Volterra integral equations involving Lebesgue-Stieltjes integrals in two independent variables. The authors prove an existence theorem using the Banach fixed-point principle. An explicit example is also considered.

Singularly perturbed volterra integro-differential equations | Bijura ...

African Journals Online (AJOL)

Several investigations have been made on singularly perturbed integral equations. This paper aims at presenting an algorithm for the construction of asymptotic solutions and then provide a proof asymptotic correctness to singularly perturbed systems of Volterra integro-differential equations. Mathematics Subject

The Jungle Universe: coupled cosmological models in a Lotka-Volterra framework

Science.gov (United States)

Perez, Jérôme; Füzfa, André; Carletti, Timoteo; Mélot, Laurence; Guedezounme, Lazare

2014-06-01

In this paper, we exploit the fact that the dynamics of homogeneous and isotropic Friedmann-Lemaître universes is a special case of generalized Lotka-Volterra system where the competitive species are the barotropic fluids filling the Universe. Without coupling between those fluids, Lotka-Volterra formulation offers a pedagogical and simple way to interpret usual Friedmann-Lemaître cosmological dynamics. A natural and physical coupling between cosmological fluids is proposed which preserves the structure of the dynamical equations. Using the standard tools of Lotka-Volterra dynamics, we obtain the general Lyapunov function of the system when one of the fluids is coupled to dark energy. This provides in a rigorous form a generic asymptotic behavior for cosmic expansion in presence of coupled species, beyond the standard de Sitter, Einstein-de Sitter and Milne cosmologies. Finally, we conjecture that chaos can appear for at least four interacting fluids.

Robust Kernel (Cross-) Covariance Operators in Reproducing Kernel Hilbert Space toward Kernel Methods

OpenAIRE

Alam, Md. Ashad; Fukumizu, Kenji; Wang, Yu-Ping

2016-01-01

To the best of our knowledge, there are no general well-founded robust methods for statistical unsupervised learning. Most of the unsupervised methods explicitly or implicitly depend on the kernel covariance operator (kernel CO) or kernel cross-covariance operator (kernel CCO). They are sensitive to contaminated data, even when using bounded positive definite kernels. First, we propose robust kernel covariance operator (robust kernel CO) and robust kernel crosscovariance operator (robust kern...

Lie Symmetry of the Diffusive Lotka–Volterra System with Time-Dependent Coefficients

Directory of Open Access Journals (Sweden)

Vasyl’ Davydovych

2018-02-01

Full Text Available Lie symmetry classification of the diffusive Lotka–Volterra system with time-dependent coefficients in the case of a single space variable is studied. A set of such symmetries in an explicit form is constructed. A nontrivial ansatz reducing the Lotka–Volterra system with correctly-specified coefficients to the system of ordinary differential equations (ODEs and an example of the exact solution with a biological interpretation are found.

Security analysis of chaotic communication systems based on Volterra-Wiener-Korenberg model

International Nuclear Information System (INIS)

Lei Min; Meng Guang; Feng Zhengjin

2006-01-01

Pseudo-randomicity is an important cryptological characteristic for proof of encryption algorithms. This paper proposes a nonlinear detecting method based on Volterra-Wiener-Korenberg model and suggests an autocorrelation function to analyze the pseudo-randomicity of chaotic secure systems under different sampling interval. The results show that: (1) the increase of the order of the chaotic transmitter will not necessarily result in a high degree of security; (2) chaotic secure systems have higher and stronger pseudo-randomicity at sparse sampling interval due to the similarity of chaotic time series to the noise; (3) Volterra-Wiener-Korenberg method can also give a further appropriate sparse sampling interval for improving the security of chaotic secure communication systems. For unmasking chaotic communication systems, the Volterra-Wiener-Korenberg technique can be applied to analyze the chaotic time series with surrogate data

Continuous multistep methods for volterra integro-differential ...

African Journals Online (AJOL)

A new class of numerical methods for Volterra integro-differential equations of the second order is developed. The methods are based on interpolation and collocation of the shifted Legendre polynomial as basis function with Trapezoidal quadrature rules. The convergence analysis revealed that the methods are consistent ...

elative controllability of nonlinear neutral Volterra Integrodiferential ...

African Journals Online (AJOL)

In this paper we established sufficient conditions for the relative controllability of the nonlinear neutral volterra integro-differential systems with distributed delays in the control. The results were established using the Schauder's fixed point theorem which is an extension of known results. Journal of the Nigerian Association of ...

On vector analogs of the modified Volterra lattice

Energy Technology Data Exchange (ETDEWEB)

Adler, V E; Postnikov, V V [L D Landau Institute for Theoretical Physics, 1a Semenov pr, 142432 Chernogolovka (Russian Federation); Sochi Branch of Peoples' Friendship University of Russia, 32 Kuibyshev str, 354000 Sochi (Russian Federation)], E-mail: adler@itp.ac.ru, E-mail: postnikovvv@rambler.ru

2008-11-14

The zero curvature representations, Baecklund transformations, nonlinear superposition principle and the simplest explicit solutions of soliton and breather type are presented for two vector generalizations of modified Volterra lattice. The relations with some other integrable equations are established.

Invariants for the generalized Lotka-Volterra equations

Science.gov (United States)

Cairó, Laurent; Feix, Marc R.; Goedert, Joao

A generalisation of Lotka-Volterra System is given when self limiting terms are introduced in the model. We use a modification of the Carleman embedding method to find invariants for this system of equations. The position and stability of the equilibrium point and the regression of system under invariant conditions are studied.

A phenomenological Hamiltonian for the Lotka-Volterra problem

International Nuclear Information System (INIS)

Georgian, T.; Findley, G.L.

1996-01-01

We have presented a Hamiltonian theory of phenomenological chemical kinetics. In the present paper, we extend this treatment to the Lotka-Volterra model of sustained oscillations. Our approach begins with the usual definition of an intrinsic reaction coordinate space (x 1 ,x 2 ) for the Lotka-Volterra problem, which leads to the rate equations x 1 =ax 1 -bx 1 x 2 , x 2 =-cx 2 +bx 1 x 2 , with a,b and c being real constants. We thereafter present a Hamiltonian function H(x,y)[y 1 = x 1 and y 2 = x 2 ] and an associated holonomic constraint, which give rise to the above rates as half of Hamilton's equations. We provide trajectories by numerical integration (4th order Runge-Kutta) and show that H(x,y) is a constant of the motion. Finally, issues involved in developing an analytic solution to this problem are discussed

On the Restriction of the Location of Stable Points for Generalized Lotka-Volterra

OpenAIRE

Livesay, Michael Richard

2017-01-01

We develop tools to determine which fixed points in a generalized Lotka-Volterra system are stable, under certain non-degeneracy conditions. We characterize which faces of the boundary of the domain of the Lotka-Volterra system could contain a stable fixed point. Under various relaxed conditions, we show that whenever a face of the boundary contains a stable point there are no other stable points in any strictly larger face of the boundary.

Any order approximate analytical solution of the nonlinear Volterra's integral equation for accelerator dynamic systems

International Nuclear Information System (INIS)

Liu Chunliang; Xie Xi; Chen Yinbao

1991-01-01

The universal nonlinear dynamic system equation is equivalent to its nonlinear Volterra's integral equation, and any order approximate analytical solution of the nonlinear Volterra's integral equation is obtained by exact analytical method, thus giving another derivation procedure as well as another computation algorithm for the solution of the universal nonlinear dynamic system equation

Global attractivity of positive periodic solution to periodic Lotka-Volterra competition systems with pure delay

Science.gov (United States)

Tang, Xianhua; Cao, Daomin; Zou, Xingfu

We consider a periodic Lotka-Volterra competition system without instantaneous negative feedbacks (i.e., pure-delay systems) x(t)=x(t)[r(t)-∑j=1na(t)x(t-τ(t))], i=1,2,…,n. We establish some 3/2-type criteria for global attractivity of a positive periodic solution of the system, which generalize the well-known Wright's 3/2 criteria for the autonomous delay logistic equation, and thereby, address the open problem proposed by both Kuang [Y. Kuang, Global stability in delayed nonautonomous Lotka-Volterra type systems without saturated equilibria, Differential Integral Equations 9 (1996) 557-567] and Teng [Z. Teng, Nonautonomous Lotka-Volterra systems with delays, J. Differential Equations 179 (2002) 538-561].

Three-dimensional discrete-time Lotka-Volterra models with an application to industrial clusters

Science.gov (United States)

Bischi, G. I.; Tramontana, F.

2010-10-01

We consider a three-dimensional discrete dynamical system that describes an application to economics of a generalization of the Lotka-Volterra prey-predator model. The dynamic model proposed is used to describe the interactions among industrial clusters (or districts), following a suggestion given by [23]. After studying some local and global properties and bifurcations in bidimensional Lotka-Volterra maps, by numerical explorations we show how some of them can be extended to their three-dimensional counterparts, even if their analytic and geometric characterization becomes much more difficult and challenging. We also show a global bifurcation of the three-dimensional system that has no two-dimensional analogue. Besides the particular economic application considered, the study of the discrete version of Lotka-Volterra dynamical systems turns out to be a quite rich and interesting topic by itself, i.e. from a purely mathematical point of view.

Numerical Study of Two-Dimensional Volterra Integral Equations by RDTM and Comparison with DTM

Directory of Open Access Journals (Sweden)

Reza Abazari

2013-01-01

Full Text Available The two-dimensional Volterra integral equations are solved using more recent semianalytic method, the reduced differential transform method (the so-called RDTM, and compared with the differential transform method (DTM. The concepts of DTM and RDTM are briefly explained, and their application to the two-dimensional Volterra integral equations is studied. The results obtained by DTM and RDTM together are compared with exact solution. As an important result, it is depicted that the RDTM results are more accurate in comparison with those obtained by DTM applied to the same Volterra integral equations. The numerical results reveal that the RDTM is very effective, convenient, and quite accurate compared to the other kind of nonlinear integral equations. It is predicted that the RDTM can be found widely applicable in engineering sciences.

Some new retarded nonlinear Volterra-Fredholm type integral inequalities with maxima in two variables and their applications.

Science.gov (United States)

Xu, Run; Ma, Xiangting

2017-01-01

In this paper, we establish some new retarded nonlinear Volterra-Fredholm type integral inequalities with maxima in two independent variables, and we present the applications to research the boundedness of solutions to retarded nonlinear Volterra-Fredholm type integral equations.

Aitken extrapolation and epsilon algorithm for an accelerated solution of weakly singular nonlinear Volterra integral equations

International Nuclear Information System (INIS)

Mesgarani, H; Parmour, P; Aghazadeh, N

2010-01-01

In this paper, we apply Aitken extrapolation and epsilon algorithm as acceleration technique for the solution of a weakly singular nonlinear Volterra integral equation of the second kind. In this paper, based on Tao and Yong (2006 J. Math. Anal. Appl. 324 225-37.) the integral equation is solved by Navot's quadrature formula. Also, Tao and Yong (2006) for the first time applied Richardson extrapolation to accelerating convergence for the weakly singular nonlinear Volterra integral equations of the second kind. To our knowledge, this paper may be the first attempt to apply Aitken extrapolation and epsilon algorithm for the weakly singular nonlinear Volterra integral equations of the second kind.

Integrability of some generalized Lotka - Volterra systems

Energy Technology Data Exchange (ETDEWEB)

Bountis, T.C.; Bier, M.; Hijmans, J.

1983-08-08

Several integrable systems of nonlinear ordinary differential equations of the Lotka-Volterra type are identified by the Painleve property and completely integrated. One such integrable case of N first order ode's is found, with N - 2 free parameters and N arbitrary. The concept of integrability of a general dynamical system, not necessarily derived from a hamiltonian, is also discussed.

Aeroelastic System Development Using Proper Orthogonal Decomposition and Volterra Theory

Science.gov (United States)

Lucia, David J.; Beran, Philip S.; Silva, Walter A.

2003-01-01

This research combines Volterra theory and proper orthogonal decomposition (POD) into a hybrid methodology for reduced-order modeling of aeroelastic systems. The out-come of the method is a set of linear ordinary differential equations (ODEs) describing the modal amplitudes associated with both the structural modes and the POD basis functions for the uid. For this research, the structural modes are sine waves of varying frequency, and the Volterra-POD approach is applied to the fluid dynamics equations. The structural modes are treated as forcing terms which are impulsed as part of the uid model realization. Using this approach, structural and uid operators are coupled into a single aeroelastic operator. This coupling converts a free boundary uid problem into an initial value problem, while preserving the parameter (or parameters) of interest for sensitivity analysis. The approach is applied to an elastic panel in supersonic cross ow. The hybrid Volterra-POD approach provides a low-order uid model in state-space form. The linear uid model is tightly coupled with a nonlinear panel model using an implicit integration scheme. The resulting aeroelastic model provides correct limit-cycle oscillation prediction over a wide range of panel dynamic pressure values. Time integration of the reduced-order aeroelastic model is four orders of magnitude faster than the high-order solution procedure developed for this research using traditional uid and structural solvers.

The period function of the generalized Lotka-Volterra centers

Science.gov (United States)

Villadelprat, J.

2008-05-01

The present paper deals with the period function of the quadratic centers. In the literature different terminologies are used to classify these centers, but essentially there are four families: Hamiltonian, reversible , codimension four Q4 and generalized Lotka-Volterra systems . Chicone [C. Chicone, Review in MathSciNet, Ref. 94h:58072] conjectured that the reversible centers have at most two critical periods, and that the centers of the three other families have a monotonic period function. With regard to the second part of this conjecture, only the monotonicity of the Hamiltonian and Q4 families [W.A. Coppel, L. Gavrilov, The period function of a Hamiltonian quadratic system, Differential Integral Equations 6 (1993) 1357-1365; Y. Zhao, The monotonicity of period function for codimension four quadratic system Q4, J. Differential Equations 185 (2002) 370-387] has been proved. Concerning the family, no substantial progress has been made since the middle 80s, when several authors showed independently the monotonicity of the classical Lotka-Volterra centers [F. Rothe, The periods of the Volterra-Lokta system, J. Reine Angew. Math. 355 (1985) 129-138; R. Schaaf, Global behaviour of solution branches for some Neumann problems depending on one or several parameters, J. Reine Angew. Math. 346 (1984) 1-31; J. Waldvogel, The period in the Lotka-Volterra system is monotonic, J. Math. Anal. Appl. 114 (1986) 178-184]. By means of the first period constant one can easily conclude that the period function of the centers in the family is monotone increasing near the inner boundary of its period annulus (i.e., the center itself). Thus, according to Chicone's conjecture, it should be also monotone increasing near the outer boundary, which in the Poincaré disc is a polycycle. In this paper we show that this is true. In addition we prove that, except for a zero measure subset of the parameter plane, there is no bifurcation of critical periods from the outer boundary. Finally we

[Generalization of the Lotka-Volterra equation].

Science.gov (United States)

Nazarenko, V G

1976-01-01

A complete qualitative study of Lotka--Volterra model with cooperative interactions in the system predator-prey is carried out. The model is as follows: (see abstract). The character of all possible stationary states is investigated in the first quadrant of the phase plane of the model variables depending on the system parameters. It is shown that for the generalized model considered unstable and stable limit cycles only of the infinite amplitude are possible in the first quadrant.

Geometry of carrying simplices of 3-species competitive Lotka–Volterra systems

International Nuclear Information System (INIS)

Baigent, Stephen

2013-01-01

We investigate the existence, uniqueness and Gaussian curvature of the invariant carrying simplices of 3 species autonomous totally competitive Lotka–Volterra systems. Explicit examples are given where the carrying simplex is convex or concave, but also where the curvature is not single-signed. Our method monitors the curvature of an evolving surface that converges uniformly to the carrying simplex, and generally relies on establishing that the Gaussian image of the evolving surface is confined to an invariant cone. We also discuss the relationship between the curvature of the carrying simplex near an interior fixed point and its Split Lyapunov stability. Finally we comment on extensions to general Lotka–Volterra systems that are not competitive. (paper)

Lp-valued stochastic convolution integral driven by Volterra noise

Czech Academy of Sciences Publication Activity Database

Čoupek, P.; Maslowski, B.; Ondreját, Martin

2018-01-01

Roč. 18, č. 6 (2018), č. článku 1850048. ISSN 0219-4937 R&D Projects: GA ČR(CZ) GA15-08819S Institutional support: RVO:67985556 Keywords : Volterra process * Rosenblatt process * hypercontractivity Subject RIV: BA - General Mathematics Impact factor: 0.820, year: 2016

Hamiltonian structure and Darboux theorem for families of generalized Lotka-Volterra systems

Science.gov (United States)

Hernández-Bermejo, Benito; Fairén, Víctor

1998-11-01

This work is devoted to the establishment of a Poisson structure for a format of equations known as generalized Lotka-Volterra systems. These equations, which include the classical Lotka-Volterra systems as a particular case, have been deeply studied in the literature. They have been shown to constitute a whole hierarchy of systems, the characterization of which is made in the context of simple algebra. Our main result is to show that this algebraic structure is completely translatable into the Poisson domain. Important Poisson structures features, such as the symplectic foliation and the Darboux canonical representation, rise as a result of rather simple matrix manipulations.

Periodic dynamics of delayed Lotka–Volterra competition systems with discontinuous harvesting policies via differential inclusions

International Nuclear Information System (INIS)

Cai, Zuowei; Huang, Lihong

2013-01-01

Highlights: • A more practical form of harvesting management policy (DHP) has been proposed. • We analyze the periodic dynamics of a class of discontinuous and delayed Lotka–Volterra competition systems. • We present a new method to obtain the existence of positive periodic solutions via differential inclusions. • The global convergence in measure of harvesting solution is discussed. -- Abstract: This paper considers a general class of delayed Lotka–Volterra competition systems where the harvesting policies are modeled by discontinuous functions or by non-Lipschitz functions. By means of differential inclusions theory, cone expansion and compression fixed point theorem of multi-valued maps and nonsmooth analysis theory with generalized Lyapunov approach, a series of useful criteria on existence, uniqueness and global asymptotic stability of the positive periodic solution is established for the delayed Lotka–Volterra competition systems with discontinuous right-hand sides. Moreover, the global convergence in measure of harvesting solution is discussed. Our results improve and extend previous works on periodic dynamics of delayed Lotka–Volterra competition systems with not only continuous or even Lipschitz continuous but also discontinuous harvesting functions. Finally, we give some corollaries and numerical examples to show the applicability and effectiveness of the proposed criteria

Locally linear approximation for Kernel methods : the Railway Kernel

OpenAIRE

Muñoz, Alberto; González, Javier

2008-01-01

In this paper we present a new kernel, the Railway Kernel, that works properly for general (nonlinear) classification problems, with the interesting property that acts locally as a linear kernel. In this way, we avoid potential problems due to the use of a general purpose kernel, like the RBF kernel, as the high dimension of the induced feature space. As a consequence, following our methodology the number of support vectors is much lower and, therefore, the generalization capab...

Index hypergeometric transform and imitation of analysis of Berezin kernels on hyperbolic spaces

International Nuclear Information System (INIS)

Neretin, Yu A

2001-01-01

The index hypergeometric transform (also called the Olevskii transform or the Jacobi transform) generalizes the spherical transform in L 2 on rank 1 symmetric spaces (that is, real, complex, and quaternionic Lobachevskii spaces). The aim of this paper is to obtain properties of the index hypergeometric transform imitating the analysis of Berezin kernels on rank 1 symmetric spaces. The problem of the explicit construction of a unitary operator identifying L 2 and a Berezin space is also discussed. This problem reduces to an integral expression (the Λ-function), which apparently cannot be expressed in a finite form in terms of standard special functions. (Only for certain special values of the parameter can this expression be reduced to the so-called Volterra type special functions.) Properties of this expression are investigated. For some series of symmetric spaces of large rank the above operator of unitary equivalence can be expressed in terms of the determinant of a matrix of Λ-functions

A Lotka-Volterra competition model with seasonal succession.

Science.gov (United States)

Hsu, Sze-Bi; Zhao, Xiao-Qiang

2012-01-01

A complete classification for the global dynamics of a Lotka-Volterra two species competition model with seasonal succession is obtained via the stability analysis of equilibria and the theory of monotone dynamical systems. The effects of two death rates in the bad season and the proportion of the good season on the competition outcomes are also discussed. © Springer-Verlag 2011

A simple spatiotemporal chaotic Lotka-Volterra model

International Nuclear Information System (INIS)

Sprott, J.C.; Wildenberg, J.C.; Azizi, Yousef

2005-01-01

A mathematically simple example of a high-dimensional (many-species) Lotka-Volterra model that exhibits spatiotemporal chaos in one spatial dimension is described. The model consists of a closed ring of identical agents, each competing for fixed finite resources with two of its four nearest neighbors. The model is prototypical of more complicated models in its quasiperiodic route to chaos (including attracting 3-tori), bifurcations, spontaneous symmetry breaking, and spatial pattern formation

Analyzing kernel matrices for the identification of differentially expressed genes.

Directory of Open Access Journals (Sweden)

Xiao-Lei Xia

Full Text Available One of the most important applications of microarray data is the class prediction of biological samples. For this purpose, statistical tests have often been applied to identify the differentially expressed genes (DEGs, followed by the employment of the state-of-the-art learning machines including the Support Vector Machines (SVM in particular. The SVM is a typical sample-based classifier whose performance comes down to how discriminant samples are. However, DEGs identified by statistical tests are not guaranteed to result in a training dataset composed of discriminant samples. To tackle this problem, a novel gene ranking method namely the Kernel Matrix Gene Selection (KMGS is proposed. The rationale of the method, which roots in the fundamental ideas of the SVM algorithm, is described. The notion of ''the separability of a sample'' which is estimated by performing [Formula: see text]-like statistics on each column of the kernel matrix, is first introduced. The separability of a classification problem is then measured, from which the significance of a specific gene is deduced. Also described is a method of Kernel Matrix Sequential Forward Selection (KMSFS which shares the KMGS method's essential ideas but proceeds in a greedy manner. On three public microarray datasets, our proposed algorithms achieved noticeably competitive performance in terms of the B.632+ error rate.

Sharp conditions for global stability of Lotka-Volterra systems with distributed delays

Science.gov (United States)

Faria, Teresa

We give a criterion for the global attractivity of a positive equilibrium of n-dimensional non-autonomous Lotka-Volterra systems with distributed delays. For a class of autonomous Lotka-Volterra systems, we show that such a criterion is sharp, in the sense that it provides necessary and sufficient conditions for the global asymptotic stability independently of the choice of the delay functions. The global attractivity of positive equilibria is established by imposing a diagonal dominance of the instantaneous negative feedback terms, and relies on auxiliary results showing the boundedness of all positive solutions. The paper improves and generalizes known results in the literature, namely by considering systems with distributed delays rather than discrete delays.

An Extreme Learning Machine Based on the Mixed Kernel Function of Triangular Kernel and Generalized Hermite Dirichlet Kernel

Directory of Open Access Journals (Sweden)

Senyue Zhang

2016-01-01

Full Text Available According to the characteristics that the kernel function of extreme learning machine (ELM and its performance have a strong correlation, a novel extreme learning machine based on a generalized triangle Hermitian kernel function was proposed in this paper. First, the generalized triangle Hermitian kernel function was constructed by using the product of triangular kernel and generalized Hermite Dirichlet kernel, and the proposed kernel function was proved as a valid kernel function of extreme learning machine. Then, the learning methodology of the extreme learning machine based on the proposed kernel function was presented. The biggest advantage of the proposed kernel is its kernel parameter values only chosen in the natural numbers, which thus can greatly shorten the computational time of parameter optimization and retain more of its sample data structure information. Experiments were performed on a number of binary classification, multiclassification, and regression datasets from the UCI benchmark repository. The experiment results demonstrated that the robustness and generalization performance of the proposed method are outperformed compared to other extreme learning machines with different kernels. Furthermore, the learning speed of proposed method is faster than support vector machine (SVM methods.

Blind I/Q imbalance and nonlinear ISI mitigation in Nyquist-SCM direct detection system with cascaded widely linear and Volterra equalizer

Science.gov (United States)

Liu, Na; Ju, Cheng

2018-02-01

Nyquist-SCM signal after fiber transmission, direct detection (DD), and analog down-conversion suffers from linear ISI, nonlinear ISI, and I/Q imbalance, simultaneously. Theoretical analysis based on widely linear (WL) and Volterra series is given to explain the relationship and interaction of these three interferences. A blind equalization algorithm, cascaded WL and Volterra equalizer, is designed to mitigate these three interferences. Furthermore, the feasibility of the proposed cascaded algorithm is experimentally demonstrated based on a 40-Gbps data rate 16-quadrature amplitude modulation (QAM) virtual single sideband (VSSB) Nyquist-SCM DD system over 100-km standard single mode fiber (SSMF) transmission. In addition, the performances of conventional strictly linear equalizer, WL equalizer, Volterra equalizer, and cascaded WL and Volterra equalizer are experimentally evaluated, respectively.

Proteome analysis of the almond kernel (Prunus dulcis).

Science.gov (United States)

Li, Shugang; Geng, Fang; Wang, Ping; Lu, Jiankang; Ma, Meihu

2016-08-01

Almond (Prunus dulcis) is a popular tree nut worldwide and offers many benefits to human health. However, the importance of almond kernel proteins in the nutrition and function in human health requires further evaluation. The present study presents a systematic evaluation of the proteins in the almond kernel using proteomic analysis. The nutrient and amino acid content in almond kernels from Xinjiang is similar to that of American varieties; however, Xinjiang varieties have a higher protein content. Two-dimensional electrophoresis analysis demonstrated a wide distribution of molecular weights and isoelectric points of almond kernel proteins. A total of 434 proteins were identified by LC-MS/MS, and most were proteins that were experimentally confirmed for the first time. Gene ontology (GO) analysis of the 434 proteins indicated that proteins involved in primary biological processes including metabolic processes (67.5%), cellular processes (54.1%), and single-organism processes (43.4%), the main molecular function of almond kernel proteins are in catalytic activity (48.0%), binding (45.4%) and structural molecule activity (11.9%), and proteins are primarily distributed in cell (59.9%), organelle (44.9%), and membrane (22.8%). Almond kernel is a source of a wide variety of proteins. This study provides important information contributing to the screening and identification of almond proteins, the understanding of almond protein function, and the development of almond protein products. © 2015 Society of Chemical Industry. © 2015 Society of Chemical Industry.

Kernel Machine SNP-set Testing under Multiple Candidate Kernels

Science.gov (United States)

Wu, Michael C.; Maity, Arnab; Lee, Seunggeun; Simmons, Elizabeth M.; Harmon, Quaker E.; Lin, Xinyi; Engel, Stephanie M.; Molldrem, Jeffrey J.; Armistead, Paul M.

2013-01-01

Joint testing for the cumulative effect of multiple single nucleotide polymorphisms grouped on the basis of prior biological knowledge has become a popular and powerful strategy for the analysis of large scale genetic association studies. The kernel machine (KM) testing framework is a useful approach that has been proposed for testing associations between multiple genetic variants and many different types of complex traits by comparing pairwise similarity in phenotype between subjects to pairwise similarity in genotype, with similarity in genotype defined via a kernel function. An advantage of the KM framework is its flexibility: choosing different kernel functions allows for different assumptions concerning the underlying model and can allow for improved power. In practice, it is difficult to know which kernel to use a priori since this depends on the unknown underlying trait architecture and selecting the kernel which gives the lowest p-value can lead to inflated type I error. Therefore, we propose practical strategies for KM testing when multiple candidate kernels are present based on constructing composite kernels and based on efficient perturbation procedures. We demonstrate through simulations and real data applications that the procedures protect the type I error rate and can lead to substantially improved power over poor choices of kernels and only modest differences in power versus using the best candidate kernel. PMID:23471868

Global asymptotic stability for a nonautonomous Lotka-Volterra competition system

OpenAIRE

TANIGUCHI, Kunihiko

2014-01-01

We consider nonautonomous N-dimensional generalized Lotka-Volterra competition systems. Under certain conditions we show that there exists a unique solution u* whose components are bounded above and below by positive constants on R, and u* attracts any solution. If such system is periodic, so is u*.

Lie and conditional symmetries of the three-component diffusive Lotka–Volterra system

International Nuclear Information System (INIS)

Cherniha, Roman; Davydovych, Vasyl’

2013-01-01

Lie and Q-conditional symmetries of the classical three-component diffusive Lotka–Volterra system in the case of one space variable are studied. The group-classification problems for finding Lie symmetries and Q-conditional symmetries of the first type are completely solved. Notably, non-Lie symmetries (Q-conditional symmetry operators) for a multi-component nonlinear reaction–diffusion system are constructed for the first time. The results are compared with those derived for the two-component diffusive Lotka–Volterra system. The conditional symmetry obtained for the non-Lie reduction of the three-component system used for modeling competition between three species in population dynamics is applied and the relevant exact solutions are found. Particularly, the exact solution describing different scenarios of competition between three species is constructed. (paper)

An integrable symmetric (2+1)-dimensional Lotka-Volterra equation and a family of its solutions

International Nuclear Information System (INIS)

Hu Xingbiao; Li Chunxia; Nimmo, Jonathan J C; Yu Guofu

2005-01-01

A symmetric (2+1)-dimensional Lotka-Volterra equation is proposed. By means of a dependent variable transformation, the equation is firstly transformed into multilinear form and further decoupled into bilinear form by introducing auxiliary independent variables. A bilinear Baecklund transformation is found and then the corresponding Lax pair is derived. Explicit solutions expressed in terms of pfaffian solutions of the bilinear form of the symmetric (2+1)-dimensional Lotka-Volterra equation are given. As a special case of the pfaffian solutions, we obtain soliton solutions and dromions

Classification of integrable Volterra-type lattices on the sphere: isotropic case

International Nuclear Information System (INIS)

Adler, V E

2008-01-01

The symmetry approach is used for classification of integrable isotropic vector Volterra lattices on the sphere. The list of integrable lattices consists mainly of new equations. Their symplectic structure and associated PDE of vector NLS type are discussed

On the integrability of some generalized Lotka-Volterra systems

Science.gov (United States)

Bier, M.; Hijmans, J.; Bountis, T. C.

1983-08-01

Several integrable systems of nonlinear ordinary differential equations of the Lotka-Volterra type are identified by the Painleveproperty and completely integrated. One such integrable case of N first order ode's is found, with N-2 free parameters and N arbitrary. The concept of integrability of a general dynamical system, not necessarily derived from a Hamiltonian, is also discussed.

Bayesian Frequency Domain Identification of LTI Systems with OBFs kernels

NARCIS (Netherlands)

Darwish, M.A.H.; Lataire, J.P.G.; Tóth, R.

2017-01-01

Regularised Frequency Response Function (FRF) estimation based on Gaussian process regression formulated directly in the frequency-domain has been introduced recently The underlying approach largely depends on the utilised kernel function, which encodes the relevant prior knowledge on the system

Characterisation of Exponential Convergence to Nonequilibrium Limits for Stochastic Volterra Equations

Directory of Open Access Journals (Sweden)

John A. D. Appleby

2008-01-01

Full Text Available This paper considers necessary and sufficient conditions for the solution of a stochastically and deterministically perturbed Volterra equation to converge exponentially to a nonequilibrium and nontrivial limit. Convergence in an almost sure and pth mean sense is obtained.

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

Transcendental smallness in singularly perturbed equations of volterra type

International Nuclear Information System (INIS)

Bijura, Angelina M.

2003-11-01

The application of different limit processes to a physical problem is an important tool in layer type techniques. Hence the study of initial layer correction functions is of central importance for understanding layer-type problems. It is shown that for singularly perturbed problems of Volterra type, the concept of transcendental smallness is an asymptotic one. Transcendentally small terms may be numerically important. (author)

Initial layer theory and model equations of Volterra type

International Nuclear Information System (INIS)

Bijura, Angelina M.

2003-10-01

It is demonstrated here that there exist initial layers to singularly perturbed Volterra equations whose thicknesses are not of order of magnitude of 0(ε), ε → 0. It is also shown that the initial layer theory is extremely useful because it allows one to construct the approximate solution to an equation, which is almost identical to the exact solution. (author)

Evolution of Black-Box Models Based on Volterra Series

Directory of Open Access Journals (Sweden)

Daniel D. Silveira

2015-01-01

Full Text Available This paper presents a historical review of the many behavioral models actually used to model radio frequency power amplifiers and a new classification of these behavioral models. It also discusses the evolution of these models, from a single polynomial to multirate Volterra models, presenting equations and estimation methods. New trends in RF power amplifier behavioral modeling are suggested.

Dynamical behaviors determined by the Lyapunov function in competitive Lotka-Volterra systems

Science.gov (United States)

Tang, Ying; Yuan, Ruoshi; Ma, Yian

2013-01-01

Dynamical behaviors of the competitive Lotka-Volterra system even for 3 species are not fully understood. In this paper, we study this problem from the perspective of the Lyapunov function. We construct explicitly the Lyapunov function using three examples of the competitive Lotka-Volterra system for the whole state space: (1) the general 2-species case, (2) a 3-species model, and (3) the model of May-Leonard. The basins of attraction for these examples are demonstrated, including cases with bistability and cyclical behavior. The first two examples are the generalized gradient system, where the energy dissipation may not follow the gradient of the Lyapunov function. In addition, under a new type of stochastic interpretation, the Lyapunov function also leads to the Boltzmann-Gibbs distribution on the final steady state when multiplicative noise is added.

IDENTIFICATION AND MAPPING OF A GENE FOR RICE SLENDER KERNEL USING Oryza glumaepatula INTROGRESSION LINES

Directory of Open Access Journals (Sweden)

Sobrizal Sobrizal

2016-10-01

Full Text Available World demand for superior rice grain quality tends to increase. One of the  criteria of appearance quality of rice grain is grain shape. Rice consumers  exhibit wide preferences for grain shape, but most Indonesian rice consumers prefer long and slender grain. The objectives of this study were to identify and map a gene for rice slender kernel trait using Oryza  glumaepatula introgression lines with O. sativa cv. Taichung 65 genetic background. A segregation analysis of BC4F2 population derived from backcrosses of a donor parent O. glumaepatula into a recurrent parent Taichung 65 showed that the slender kernel was controlled by a single recessive gene. This new identified gene was designated as sk1 (slender kernel 1. Moreover, based on the RFLP analyses using 14 RFLP markers located on chromosomes 2, 8, 9, and 10 in which the O. glumaepatula chromosomal segments were retained in BC4F2 population, the sk1 was located between RFLP markers C679 and C560 on the long arm of chromosome 2, with map distances of 2.8 and 1.5 cM, respectively. The wild rice O. glumaepatula carried a recessive allele for slender kernel. This allele may be useful in breeding of rice with slender kernel types. In addition, the development of plant materials and RFLP map associated with slender kernel in this study is the preliminary works in the effort to isolate this important grain shape gene.

A novel nonlinear adaptive filter using a pipelined second-order Volterra recurrent neural network.

Science.gov (United States)

Zhao, Haiquan; Zhang, Jiashu

2009-12-01

To enhance the performance and overcome the heavy computational complexity of recurrent neural networks (RNN), a novel nonlinear adaptive filter based on a pipelined second-order Volterra recurrent neural network (PSOVRNN) is proposed in this paper. A modified real-time recurrent learning (RTRL) algorithm of the proposed filter is derived in much more detail. The PSOVRNN comprises of a number of simple small-scale second-order Volterra recurrent neural network (SOVRNN) modules. In contrast to the standard RNN, these modules of a PSOVRNN can be performed simultaneously in a pipelined parallelism fashion, which can lead to a significant improvement in its total computational efficiency. Moreover, since each module of the PSOVRNN is a SOVRNN in which nonlinearity is introduced by the recursive second-order Volterra (RSOV) expansion, its performance can be further improved. Computer simulations have demonstrated that the PSOVRNN performs better than the pipelined recurrent neural network (PRNN) and RNN for nonlinear colored signals prediction and nonlinear channel equalization. However, the superiority of the PSOVRNN over the PRNN is at the cost of increasing computational complexity due to the introduced nonlinear expansion of each module.

The discrete hungry Lotka Volterra system and a new algorithm for computing matrix eigenvalues

Science.gov (United States)

Fukuda, Akiko; Ishiwata, Emiko; Iwasaki, Masashi; Nakamura, Yoshimasa

2009-01-01

The discrete hungry Lotka-Volterra (dhLV) system is a generalization of the discrete Lotka-Volterra (dLV) system which stands for a prey-predator model in mathematical biology. In this paper, we show that (1) some invariants exist which are expressed by dhLV variables and are independent from the discrete time and (2) a dhLV variable converges to some positive constant or zero as the discrete time becomes sufficiently large. Some characteristic polynomial is then factorized with the help of the dhLV system. The asymptotic behaviour of the dhLV system enables us to design an algorithm for computing complex eigenvalues of a certain band matrix.

The discrete hungry Lotka–Volterra system and a new algorithm for computing matrix eigenvalues

International Nuclear Information System (INIS)

Fukuda, Akiko; Ishiwata, Emiko; Iwasaki, Masashi; Nakamura, Yoshimasa

2009-01-01

The discrete hungry Lotka–Volterra (dhLV) system is a generalization of the discrete Lotka–Volterra (dLV) system which stands for a prey–predator model in mathematical biology. In this paper, we show that (1) some invariants exist which are expressed by dhLV variables and are independent from the discrete time and (2) a dhLV variable converges to some positive constant or zero as the discrete time becomes sufficiently large. Some characteristic polynomial is then factorized with the help of the dhLV system. The asymptotic behaviour of the dhLV system enables us to design an algorithm for computing complex eigenvalues of a certain band matrix

Numerical solutions of stochastic Lotka-Volterra equations via operational matrices

Directory of Open Access Journals (Sweden)

F. Hosseini Shekarabi

2016-03-01

Full Text Available In this paper, an efficient and convenient method for numerical solutions of stochastic Lotka-Volterra dynamical system is proposed. Here, we consider block pulse functions and their operational matrices of integration. Illustrative example is included to demonstrate the procedure and accuracy of the operational matrices based on block pulse functions.

Lotka-Volterra competition models for sessile organisms.

Science.gov (United States)

Spencer, Matthew; Tanner, Jason E

2008-04-01

Markov models are widely used to describe the dynamics of communities of sessile organisms, because they are easily fitted to field data and provide a rich set of analytical tools. In typical ecological applications, at any point in time, each point in space is in one of a finite set of states (e.g., species, empty space). The models aim to describe the probabilities of transitions between states. In most Markov models for communities, these transition probabilities are assumed to be independent of state abundances. This assumption is often suspected to be false and is rarely justified explicitly. Here, we start with simple assumptions about the interactions among sessile organisms and derive a model in which transition probabilities depend on the abundance of destination states. This model is formulated in continuous time and is equivalent to a Lotka-Volterra competition model. We fit this model and a variety of alternatives in which transition probabilities do not depend on state abundances to a long-term coral reef data set. The Lotka-Volterra model describes the data much better than all models we consider other than a saturated model (a model with a separate parameter for each transition at each time interval, which by definition fits the data perfectly). Our approach provides a basis for further development of stochastic models of sessile communities, and many of the methods we use are relevant to other types of community. We discuss possible extensions to spatially explicit models.

Lattice defects as Lotka-Volterra societies

Energy Technology Data Exchange (ETDEWEB)

Yost, F.G.

1995-07-01

Since the early part of this century the Lotka-Volterra or predator-prey equations have been known to simulate the stability, instability, and persistent oscillations observed in many biological and ecological societies. These equations have been modified in many ways and have been used to model phenomena as varied as childhood epidemics, enzyme reactions, and conventional warfare. In the work to be described, similarities are drawn between various lattice defects and Lotka-Volterra (LV) societies. Indeed, grain boundaries are known to ``consume`` dislocations, inclusions ``infect`` grain boundaries, and dislocations ``annihilate`` dislocations. Several specific cases of lattice defect interaction kinetics models are drawn from the materials science literature to make these comparisons. Each model will be interpreted as if it were a description of a biological system. Various approaches to the modification of this class of interaction kinetics will be presented and discussed. The earliest example is the Damask-Dienes treatment of vacancy-divacancy annealing kinetics. This historical model will be modified to include the effects of an intermediate species and the results will be compared with the original model. The second example to be examined is the Clark-Alden model for deformation-enhanced grain growth. Dislocation kinetics will be added to this model and results will be discussed considering the original model. The third example to be presented is the Ananthakrishna-Sahoo model of the Portevin-Le Chatelier effect that was offered in 1985 as an extension of the classical Cottrell atmosphere explanation. Their treatment will be modified by inclusion of random interference from a pesky but peripheral species and by allowing a rate constant to be a function of time.

Data-variant kernel analysis

CERN Document Server

Motai, Yuichi

2015-01-01

Describes and discusses the variants of kernel analysis methods for data types that have been intensely studied in recent years This book covers kernel analysis topics ranging from the fundamental theory of kernel functions to its applications. The book surveys the current status, popular trends, and developments in kernel analysis studies. The author discusses multiple kernel learning algorithms and how to choose the appropriate kernels during the learning phase. Data-Variant Kernel Analysis is a new pattern analysis framework for different types of data configurations. The chapters include

Turing patterns in a modified Lotka-Volterra model

International Nuclear Information System (INIS)

McGehee, Edward A.; Peacock-Lopez, Enrique

2005-01-01

In this Letter we consider a modified Lotka-Volterra model widely known as the Bazykin model, which is the MacArthur-Rosenzweig (MR) model that includes a prey-dependent response function and is modified with the inclusion of intraspecies interactions. We show that a quadratic intra-prey interaction term, which is the most realistic nonlinearity, yields sufficient conditions for Turing patterns. For the Bazykin model we find the Turing region in parameter space and Turing patterns in one dimension

Fully-Automated High-Throughput NMR System for Screening of Haploid Kernels of Maize (Corn by Measurement of Oil Content.

Directory of Open Access Journals (Sweden)

Hongzhi Wang

Full Text Available One of the modern crop breeding techniques uses doubled haploid plants that contain an identical pair of chromosomes in order to accelerate the breeding process. Rapid haploid identification method is critical for large-scale selections of double haploids. The conventional methods based on the color of the endosperm and embryo seeds are slow, manual and prone to error. On the other hand, there exists a significant difference between diploid and haploid seeds generated by high oil inducer, which makes it possible to use oil content to identify the haploid. This paper describes a fully-automated high-throughput NMR screening system for maize haploid kernel identification. The system is comprised of a sampler unit to select a single kernel to feed for measurement of NMR and weight, and a kernel sorter to distribute the kernel according to the measurement result. Tests of the system show a consistent accuracy of 94% with an average screening time of 4 seconds per kernel. Field test result is described and the directions for future improvement are discussed.

Fully-Automated High-Throughput NMR System for Screening of Haploid Kernels of Maize (Corn) by Measurement of Oil Content

Science.gov (United States)

Xu, Xiaoping; Huang, Qingming; Chen, Shanshan; Yang, Peiqiang; Chen, Shaojiang; Song, Yiqiao

2016-01-01

One of the modern crop breeding techniques uses doubled haploid plants that contain an identical pair of chromosomes in order to accelerate the breeding process. Rapid haploid identification method is critical for large-scale selections of double haploids. The conventional methods based on the color of the endosperm and embryo seeds are slow, manual and prone to error. On the other hand, there exists a significant difference between diploid and haploid seeds generated by high oil inducer, which makes it possible to use oil content to identify the haploid. This paper describes a fully-automated high-throughput NMR screening system for maize haploid kernel identification. The system is comprised of a sampler unit to select a single kernel to feed for measurement of NMR and weight, and a kernel sorter to distribute the kernel according to the measurement result. Tests of the system show a consistent accuracy of 94% with an average screening time of 4 seconds per kernel. Field test result is described and the directions for future improvement are discussed. PMID:27454427

Numerical Solution of Nonlinear Volterra Integral Equations System Using Simpson’s 3/8 Rule

Directory of Open Access Journals (Sweden)

Adem Kılıçman

2012-01-01

Full Text Available The Simpson’s 3/8 rule is used to solve the nonlinear Volterra integral equations system. Using this rule the system is converted to a nonlinear block system and then by solving this nonlinear system we find approximate solution of nonlinear Volterra integral equations system. One of the advantages of the proposed method is its simplicity in application. Further, we investigate the convergence of the proposed method and it is shown that its convergence is of order O(h4. Numerical examples are given to show abilities of the proposed method for solving linear as well as nonlinear systems. Our results show that the proposed method is simple and effective.

Corrigendum to ;Lotka-Volterra systems satisfying a strong Painlevé property; [Phys. Lett. A 380 (47) (2016) 3977-3982

Science.gov (United States)

Bountis, Tassos; Vanhaecke, Pol

2017-12-01

The comment made after the proof of Proposition 3.3, in our paper [T. Bountis, P. Vanhaecke, Lotka-Volterra systems satisfying a strong Pailevé property, Phys. Lett. A 380 (47) (2016) 3977-3982], saying that the proposition can be generalized when linear terms are added to the Lotka-Volterra systems considered in the paper, is wrong. In general such deformed systems are not even Hamiltonian.

Positive periodic solutions of delayed periodic Lotka-Volterra systems

International Nuclear Information System (INIS)

Lin Wei; Chen Tianping

2005-01-01

In this Letter, for a general class of delayed periodic Lotka-Volterra systems, we prove some new results on the existence of positive periodic solutions by Schauder's fixed point theorem. The global asymptotical stability of positive periodic solutions is discussed further, and conditions for exponential convergence are given. The conditions we obtained are weaker than the previously known ones and can be easily reduced to several special cases

Nonlinear features identified by Volterra series for damage detection in a buckled beam

Directory of Open Access Journals (Sweden)

Shiki S. B.

2014-01-01

Full Text Available The present paper proposes a new index for damage detection based on nonlinear features extracted from prediction errors computed by multiple convolutions using the discrete-time Volterra series. A reference Volterra model is identified with data in the healthy condition and used for monitoring the system operating with linear or nonlinear behavior. When the system has some structural change, possibly associated with damage, the index metrics computed could give an alert to separate the linear and nonlinear contributions, besides provide a diagnostic about the structural state. To show the applicability of the method, an experimental test is performed using nonlinear vibration signals measured in a clamped buckled beam subject to different levels of force applied and with simulated damages through discontinuities inserted in the beam surface.

Global existence for Volterra-Fredholm type neutral impulsive functional integrodifferential equations

Directory of Open Access Journals (Sweden)

V. Vijayakumar

2012-09-01

Full Text Available n this paper, we study the global existence of solutions for the initial value problems for Volterra-Fredholm type neutral impulsive functional integrodifferential equations. Using the Leray-Schauder's Alternative theorem, we derive conditions under which a solution exists globally. An application is provided to illustrate the theory.

Approximate kernel competitive learning.

Science.gov (United States)

Wu, Jian-Sheng; Zheng, Wei-Shi; Lai, Jian-Huang

2015-03-01

Kernel competitive learning has been successfully used to achieve robust clustering. However, kernel competitive learning (KCL) is not scalable for large scale data processing, because (1) it has to calculate and store the full kernel matrix that is too large to be calculated and kept in the memory and (2) it cannot be computed in parallel. In this paper we develop a framework of approximate kernel competitive learning for processing large scale dataset. The proposed framework consists of two parts. First, it derives an approximate kernel competitive learning (AKCL), which learns kernel competitive learning in a subspace via sampling. We provide solid theoretical analysis on why the proposed approximation modelling would work for kernel competitive learning, and furthermore, we show that the computational complexity of AKCL is largely reduced. Second, we propose a pseudo-parallelled approximate kernel competitive learning (PAKCL) based on a set-based kernel competitive learning strategy, which overcomes the obstacle of using parallel programming in kernel competitive learning and significantly accelerates the approximate kernel competitive learning for large scale clustering. The empirical evaluation on publicly available datasets shows that the proposed AKCL and PAKCL can perform comparably as KCL, with a large reduction on computational cost. Also, the proposed methods achieve more effective clustering performance in terms of clustering precision against related approximate clustering approaches. Copyright © 2014 Elsevier Ltd. All rights reserved.

Existence and global attractivity of positive periodic solutions of periodic n-species Lotka-Volterra competition systems with several deviating arguments.

Science.gov (United States)

Fan, M; Wang, K; Jiang, D

1999-08-01

In this paper, we study the existence and global attractivity of positive periodic solutions of periodic n-species Lotka-Volterra competition systems. By using the method of coincidence degree and Lyapunov functional, a set of easily verifiable sufficient conditions are derived for the existence of at least one strictly positive (componentwise) periodic solution of periodic n-species Lotka-Volterra competition systems with several deviating arguments and the existence of a unique globally asymptotically stable periodic solution with strictly positive components of periodic n-species Lotka-Volterra competition system with several delays. Some new results are obtained. As an application, we also examine some special cases of the system we considered, which have been studied extensively in the literature. Some known results are improved and generalized.

Qualitative aspects of Volterra integro-dynamic system on time scales

Directory of Open Access Journals (Sweden)

Vasile Lupulescu

2013-01-01

Full Text Available This paper deals with the resolvent, asymptotic stability and boundedness of the solution of time-varying Volterra integro-dynamic system on time scales in which the coefficient matrix is not necessarily stable. We generalize at time scale some known properties about asymptotic behavior and boundedness from the continuous case. Some new results for discrete case are obtained.

Classification With Truncated Distance Kernel.

Science.gov (United States)

Huang, Xiaolin; Suykens, Johan A K; Wang, Shuning; Hornegger, Joachim; Maier, Andreas

2018-05-01

This brief proposes a truncated distance (TL1) kernel, which results in a classifier that is nonlinear in the global region but is linear in each subregion. With this kernel, the subregion structure can be trained using all the training data and local linear classifiers can be established simultaneously. The TL1 kernel has good adaptiveness to nonlinearity and is suitable for problems which require different nonlinearities in different areas. Though the TL1 kernel is not positive semidefinite, some classical kernel learning methods are still applicable which means that the TL1 kernel can be directly used in standard toolboxes by replacing the kernel evaluation. In numerical experiments, the TL1 kernel with a pregiven parameter achieves similar or better performance than the radial basis function kernel with the parameter tuned by cross validation, implying the TL1 kernel a promising nonlinear kernel for classification tasks.

New stability and boundedness results to Volterra integro-differential equations with delay

Directory of Open Access Journals (Sweden)

Cemil Tunç

2016-04-01

Full Text Available In this paper, we consider a certain non-linear Volterra integro-differential equations with delay. We study stability and boundedness of solutions. The technique of proof involves defining suitable Lyapunov functionals. Our results improve and extend the results obtained in literature.

A remark on the stability and boundedness criteria in retarded Volterra integro-differential equations

Directory of Open Access Journals (Sweden)

Cemil Tunç

2017-10-01

Full Text Available In this article, the authors obtain some clear assumptions for the asymptotic stability (AS and boundedness (B of solutions of non-linear retarded Volterra integro-differential equations (VIDEs of first order by constructing a new Lyapunov functional (LF. The results obtained are new and differ from those found in the literature, and they also contain and improve a result found in the literature under more less restrictive conditions. We establish an example and give a discussion to indicate the applicability of the weaker conditions obtained. We also employ MATLAB-Simulink to display the behaviors of the orbits of the (VIDEs considered. Keywords: Nonlinear, Volterra integro-differential equations, First order, Asymptotic stability, Boundedness, Lyapunov functional, MSC: 34D05, 34K20, 45J05

Asymptotic Behavior of Solutions for Nonlinear Volterra Discrete Equations

Directory of Open Access Journals (Sweden)

E. Messina

2008-01-01

Full Text Available We consider nonlinear difference equations of unbounded order of the form xi=bi−∑j=0iai,jfi−j(xj,  i=0,1,2,…, where fj(x  (j=0,…,i are suitable functions. We establish sufficient conditions for the boundedness and the convergence of xi as i→+∞. Some of these conditions are interesting mainly for studying stability of numerical methods for Volterra integral equations.

Coexistence and Survival in Conservative Lotka-Volterra Networks

Science.gov (United States)

Knebel, Johannes; Krüger, Torben; Weber, Markus F.; Frey, Erwin

2013-04-01

Analyzing coexistence and survival scenarios of Lotka-Volterra (LV) networks in which the total biomass is conserved is of vital importance for the characterization of long-term dynamics of ecological communities. Here, we introduce a classification scheme for coexistence scenarios in these conservative LV models and quantify the extinction process by employing the Pfaffian of the network’s interaction matrix. We illustrate our findings on global stability properties for general systems of four and five species and find a generalized scaling law for the extinction time.

Exact Heat Kernel on a Hypersphere and Its Applications in Kernel SVM

Directory of Open Access Journals (Sweden)

Chenchao Zhao

2018-01-01

Full Text Available Many contemporary statistical learning methods assume a Euclidean feature space. This paper presents a method for defining similarity based on hyperspherical geometry and shows that it often improves the performance of support vector machine compared to other competing similarity measures. Specifically, the idea of using heat diffusion on a hypersphere to measure similarity has been previously proposed and tested by Lafferty and Lebanon [1], demonstrating promising results based on a heuristic heat kernel obtained from the zeroth order parametrix expansion; however, how well this heuristic kernel agrees with the exact hyperspherical heat kernel remains unknown. This paper presents a higher order parametrix expansion of the heat kernel on a unit hypersphere and discusses several problems associated with this expansion method. We then compare the heuristic kernel with an exact form of the heat kernel expressed in terms of a uniformly and absolutely convergent series in high-dimensional angular momentum eigenmodes. Being a natural measure of similarity between sample points dwelling on a hypersphere, the exact kernel often shows superior performance in kernel SVM classifications applied to text mining, tumor somatic mutation imputation, and stock market analysis.

Algebraic features of some generalizations of the Lotka-Volterra system

Science.gov (United States)

Bibik, Yu. V.; Sarancha, D. A.

2010-10-01

For generalizations of the Lotka-Volterra system, an integration method is proposed based on the nontrivial algebraic structure of these generalizations. The method makes use of an auxiliary first-order differential equation derived from the phase curve equation with the help of this algebraic structure. Based on this equation, a Hamiltonian approach can be developed and canonical variables (moreover, action-angle variables) can be constructed.

Mapping QTLs controlling kernel dimensions in a wheat inter-varietal RIL mapping population.

Science.gov (United States)

Cheng, Ruiru; Kong, Zhongxin; Zhang, Liwei; Xie, Quan; Jia, Haiyan; Yu, Dong; Huang, Yulong; Ma, Zhengqiang

2017-07-01

Seven kernel dimension QTLs were identified in wheat, and kernel thickness was found to be the most important dimension for grain weight improvement. Kernel morphology and weight of wheat (Triticum aestivum L.) affect both yield and quality; however, the genetic basis of these traits and their interactions has not been fully understood. In this study, to investigate the genetic factors affecting kernel morphology and the association of kernel morphology traits with kernel weight, kernel length (KL), width (KW) and thickness (KT) were evaluated, together with hundred-grain weight (HGW), in a recombinant inbred line population derived from Nanda2419 × Wangshuibai, with data from five trials (two different locations over 3 years). The results showed that HGW was more closely correlated with KT and KW than with KL. A whole genome scan revealed four QTLs for KL, one for KW and two for KT, distributed on five different chromosomes. Of them, QKl.nau-2D for KL, and QKt.nau-4B and QKt.nau-5A for KT were newly identified major QTLs for the respective traits, explaining up to 32.6 and 41.5% of the phenotypic variations, respectively. Increase of KW and KT and reduction of KL/KT and KW/KT ratios always resulted in significant higher grain weight. Lines combining the Nanda 2419 alleles of the 4B and 5A intervals had wider, thicker, rounder kernels and a 14% higher grain weight in the genotype-based analysis. A strong, negative linear relationship of the KW/KT ratio with grain weight was observed. It thus appears that kernel thickness is the most important kernel dimension factor in wheat improvement for higher yield. Mapping and marker identification of the kernel dimension-related QTLs definitely help realize the breeding goals.

A Two-Species Cooperative Lotka-Volterra System of Degenerate Parabolic Equations

OpenAIRE

Sun, Jiebao; Zhang, Dazhi; Wu, Boying

2011-01-01

We consider a cooperating two-species Lotka-Volterra model of degenerate parabolic equations. We are interested in the coexistence of the species in a bounded domain. We establish the existence of global generalized solutions of the initial boundary value problem by means of parabolic regularization and also consider the existence of the nontrivial time-periodic solution for this system.

The Volterra's integral equation theory for accelerator single-freedom nonlinear components

International Nuclear Information System (INIS)

Wang Sheng; Xie Xi

1996-01-01

The Volterra's integral equation equivalent to the dynamic equation of accelerator single-freedom nonlinear components is given, starting from which the transport operator of accelerator single-freedom nonlinear components and its inverse transport operator are obtained. Therefore, another algorithm for the expert system of the beam transport operator of accelerator single-freedom nonlinear components is developed

Ecological communities with Lotka-Volterra dynamics

Science.gov (United States)

Bunin, Guy

2017-04-01

Ecological communities in heterogeneous environments assemble through the combined effect of species interaction and migration. Understanding the effect of these processes on the community properties is central to ecology. Here we study these processes for a single community subject to migration from a pool of species, with population dynamics described by the generalized Lotka-Volterra equations. We derive exact results for the phase diagram describing the dynamical behaviors, and for the diversity and species abundance distributions. A phase transition is found from a phase where a unique globally attractive fixed point exists to a phase where multiple dynamical attractors exist, leading to history-dependent community properties. The model is shown to possess a symmetry that also establishes a connection with other well-known models.

Subsampling Realised Kernels

DEFF Research Database (Denmark)

Barndorff-Nielsen, Ole Eiler; Hansen, Peter Reinhard; Lunde, Asger

2011-01-01

In a recent paper we have introduced the class of realised kernel estimators of the increments of quadratic variation in the presence of noise. We showed that this estimator is consistent and derived its limit distribution under various assumptions on the kernel weights. In this paper we extend our...... that subsampling is impotent, in the sense that subsampling has no effect on the asymptotic distribution. Perhaps surprisingly, for the efficient smooth kernels, such as the Parzen kernel, we show that subsampling is harmful as it increases the asymptotic variance. We also study the performance of subsampled...

Kernel abortion in maize. II. Distribution of 14C among kernel carboydrates

International Nuclear Information System (INIS)

Hanft, J.M.; Jones, R.J.

1986-01-01

This study was designed to compare the uptake and distribution of 14 C among fructose, glucose, sucrose, and starch in the cob, pedicel, and endosperm tissues of maize (Zea mays L.) kernels induced to abort by high temperature with those that develop normally. Kernels cultured in vitro at 309 and 35 0 C were transferred to [ 14 C]sucrose media 10 days after pollination. Kernels cultured at 35 0 C aborted prior to the onset of linear dry matter accumulation. Significant uptake into the cob, pedicel, and endosperm of radioactivity associated with the soluble and starch fractions of the tissues was detected after 24 hours in culture on atlageled media. After 8 days in culture on [ 14 C]sucrose media, 48 and 40% of the radioactivity associated with the cob carbohydrates was found in the reducing sugars at 30 and 35 0 C, respectively. Of the total carbohydrates, a higher percentage of label was associated with sucrose and lower percentage with fructose and glucose in pedicel tissue of kernels cultured at 35 0 C compared to kernels cultured at 30 0 C. These results indicate that sucrose was not cleaved to fructose and glucose as rapidly during the unloading process in the pedicel of kernels induced to abort by high temperature. Kernels cultured at 35 0 C had a much lower proportion of label associated with endosperm starch (29%) than did kernels cultured at 30 0 C (89%). Kernels cultured at 35 0 C had a correspondingly higher proportion of 14 C in endosperm fructose, glucose, and sucrose

The persistence in a Lotka-Volterra competition systems with impulsive

International Nuclear Information System (INIS)

Zhen Jin; Han Maoan; Li Guihua

2005-01-01

In this paper, a nonautonomous two-dimensional competitive Lotka-Volterra system with impulsive is considered. we study the persistence and extinction, giving two inequalities involving averages of the growth rates and impulsive value, which guarantees persistence of the system. An extension of the principle of competition exclusion is obtained in this paper. Moreover, several examples are also worked out, they show that the impulsive can change the persistence of the system

Optimized Kernel Entropy Components.

Science.gov (United States)

Izquierdo-Verdiguier, Emma; Laparra, Valero; Jenssen, Robert; Gomez-Chova, Luis; Camps-Valls, Gustau

2017-06-01

This brief addresses two main issues of the standard kernel entropy component analysis (KECA) algorithm: the optimization of the kernel decomposition and the optimization of the Gaussian kernel parameter. KECA roughly reduces to a sorting of the importance of kernel eigenvectors by entropy instead of variance, as in the kernel principal components analysis. In this brief, we propose an extension of the KECA method, named optimized KECA (OKECA), that directly extracts the optimal features retaining most of the data entropy by means of compacting the information in very few features (often in just one or two). The proposed method produces features which have higher expressive power. In particular, it is based on the independent component analysis framework, and introduces an extra rotation to the eigen decomposition, which is optimized via gradient-ascent search. This maximum entropy preservation suggests that OKECA features are more efficient than KECA features for density estimation. In addition, a critical issue in both the methods is the selection of the kernel parameter, since it critically affects the resulting performance. Here, we analyze the most common kernel length-scale selection criteria. The results of both the methods are illustrated in different synthetic and real problems. Results show that OKECA returns projections with more expressive power than KECA, the most successful rule for estimating the kernel parameter is based on maximum likelihood, and OKECA is more robust to the selection of the length-scale parameter in kernel density estimation.

A combinatorial method for the vanishing of the Poisson brackets of an integrable Lotka-Volterra system

International Nuclear Information System (INIS)

Itoh, Yoshiaki

2009-01-01

The combinatorial method is useful to obtain conserved quantities for some nonlinear integrable systems, as an alternative to the Lax representation method. Here we extend the combinatorial method and introduce an elementary geometry to show the vanishing of the Poisson brackets of the Hamiltonian structure for a Lotka-Volterra system of competing species. We associate a set of points on a circle with a set of species of the Lotka-Volterra system, where the dominance relations between points are given by the dominance relations between the species. We associate each term of the conserved quantities with a subset of points on the circle, which simplifies to show the vanishing of the Poisson brackets

On stochastic integration for volatility modulated Brownian-driven Volterra processes via white noise analysis

DEFF Research Database (Denmark)

E. Barndorff-Nielsen, Ole; Benth, Fred Espen; Szozda, Benedykt

This paper generalizes the integration theory for volatility modulated Brownian-driven Volterra processes onto the space G* of Potthoff-Timpel distributions. Sufficient conditions for integrability of generalized processes are given, regularity results and properties of the integral are discussed...

On stochastic integration for volatility modulated Brownian-driven Volterra processes via white noise analysis

DEFF Research Database (Denmark)

Barndorff-Nielsen, Ole E.; Benth, Fred Espen; Szozda, Benedykt

This paper generalizes the integration theory for volatility modulated Brownian-driven Volterra processes onto the space G∗ of Potthoff--Timpel distributions. Sufficient conditions for integrability of generalized processes are given, regularity results and properties of the integral are discusse...

Filtered-X Affine Projection Algorithms for Active Noise Control Using Volterra Filters

Directory of Open Access Journals (Sweden)

Sicuranza Giovanni L

2004-01-01

Full Text Available We consider the use of adaptive Volterra filters, implemented in the form of multichannel filter banks, as nonlinear active noise controllers. In particular, we discuss the derivation of filtered-X affine projection algorithms for homogeneous quadratic filters. According to the multichannel approach, it is then easy to pass from these algorithms to those of a generic Volterra filter. It is shown in the paper that the AP technique offers better convergence and tracking capabilities than the classical LMS and NLMS algorithms usually applied in nonlinear active noise controllers, with a limited complexity increase. This paper extends in two ways the content of a previous contribution published in Proc. IEEE-EURASIP Workshop on Nonlinear Signal and Image Processing (NSIP '03, Grado, Italy, June 2003. First of all, a general adaptation algorithm valid for any order of affine projections is presented. Secondly, a more complete set of experiments is reported. In particular, the effects of using multichannel filter banks with a reduced number of channels are investigated and relevant results are shown.

Fault Localization for Synchrophasor Data using Kernel Principal Component Analysis

Directory of Open Access Journals (Sweden)

CHEN, R.

2017-11-01

Full Text Available In this paper, based on Kernel Principal Component Analysis (KPCA of Phasor Measurement Units (PMU data, a nonlinear method is proposed for fault location in complex power systems. Resorting to the scaling factor, the derivative for a polynomial kernel is obtained. Then, the contribution of each variable to the T2 statistic is derived to determine whether a bus is the fault component. Compared to the previous Principal Component Analysis (PCA based methods, the novel version can combat the characteristic of strong nonlinearity, and provide the precise identification of fault location. Computer simulations are conducted to demonstrate the improved performance in recognizing the fault component and evaluating its propagation across the system based on the proposed method.

Gaussian interaction profile kernels for predicting drug-target interaction.

Science.gov (United States)

van Laarhoven, Twan; Nabuurs, Sander B; Marchiori, Elena

2011-11-01

The in silico prediction of potential interactions between drugs and target proteins is of core importance for the identification of new drugs or novel targets for existing drugs. However, only a tiny portion of all drug-target pairs in current datasets are experimentally validated interactions. This motivates the need for developing computational methods that predict true interaction pairs with high accuracy. We show that a simple machine learning method that uses the drug-target network as the only source of information is capable of predicting true interaction pairs with high accuracy. Specifically, we introduce interaction profiles of drugs (and of targets) in a network, which are binary vectors specifying the presence or absence of interaction with every target (drug) in that network. We define a kernel on these profiles, called the Gaussian Interaction Profile (GIP) kernel, and use a simple classifier, (kernel) Regularized Least Squares (RLS), for prediction drug-target interactions. We test comparatively the effectiveness of RLS with the GIP kernel on four drug-target interaction networks used in previous studies. The proposed algorithm achieves area under the precision-recall curve (AUPR) up to 92.7, significantly improving over results of state-of-the-art methods. Moreover, we show that using also kernels based on chemical and genomic information further increases accuracy, with a neat improvement on small datasets. These results substantiate the relevance of the network topology (in the form of interaction profiles) as source of information for predicting drug-target interactions. Software and Supplementary Material are available at http://cs.ru.nl/~tvanlaarhoven/drugtarget2011/. tvanlaarhoven@cs.ru.nl; elenam@cs.ru.nl. Supplementary data are available at Bioinformatics online.

Bifurcation structure of positive stationary solutions for a Lotka-Volterra competition model with diffusion I

Science.gov (United States)

Kan-On, Yukio

2007-04-01

This paper is concerned with the bifurcation structure of positive stationary solutions for a generalized Lotka-Volterra competition model with diffusion. To establish the structure, the bifurcation theory and the interval arithmetic are employed.

A novel adaptive kernel method with kernel centers determined by a support vector regression approach

NARCIS (Netherlands)

Sun, L.G.; De Visser, C.C.; Chu, Q.P.; Mulder, J.A.

2012-01-01

The optimality of the kernel number and kernel centers plays a significant role in determining the approximation power of nearly all kernel methods. However, the process of choosing optimal kernels is always formulated as a global optimization task, which is hard to accomplish. Recently, an

Nonlinear Delay Discrete Inequalities and Their Applications to Volterra Type Difference Equations

Directory of Open Access Journals (Sweden)

Yu Wu

2010-01-01

Full Text Available Delay discrete inequalities with more than one nonlinear term are discussed, which generalize some known results and can be used in the analysis of various problems in the theory of certain classes of discrete equations. Application examples to show boundedness and uniqueness of solutions of a Volterra type difference equation are also given.

Biorthogonal Systems Approximating the Solution of the Nonlinear Volterra Integro-Differential Equation

Directory of Open Access Journals (Sweden)

Berenguer MI

2010-01-01

Full Text Available This paper deals with obtaining a numerical method in order to approximate the solution of the nonlinear Volterra integro-differential equation. We define, following a fixed-point approach, a sequence of functions which approximate the solution of this type of equation, due to some properties of certain biorthogonal systems for the Banach spaces and .

Protein Subcellular Localization with Gaussian Kernel Discriminant Analysis and Its Kernel Parameter Selection.

Science.gov (United States)

Wang, Shunfang; Nie, Bing; Yue, Kun; Fei, Yu; Li, Wenjia; Xu, Dongshu

2017-12-15

Kernel discriminant analysis (KDA) is a dimension reduction and classification algorithm based on nonlinear kernel trick, which can be novelly used to treat high-dimensional and complex biological data before undergoing classification processes such as protein subcellular localization. Kernel parameters make a great impact on the performance of the KDA model. Specifically, for KDA with the popular Gaussian kernel, to select the scale parameter is still a challenging problem. Thus, this paper introduces the KDA method and proposes a new method for Gaussian kernel parameter selection depending on the fact that the differences between reconstruction errors of edge normal samples and those of interior normal samples should be maximized for certain suitable kernel parameters. Experiments with various standard data sets of protein subcellular localization show that the overall accuracy of protein classification prediction with KDA is much higher than that without KDA. Meanwhile, the kernel parameter of KDA has a great impact on the efficiency, and the proposed method can produce an optimum parameter, which makes the new algorithm not only perform as effectively as the traditional ones, but also reduce the computational time and thus improve efficiency.

7 CFR 981.7 - Edible kernel.

Science.gov (United States)

2010-01-01

... 7 Agriculture 8 2010-01-01 2010-01-01 false Edible kernel. 981.7 Section 981.7 Agriculture... Regulating Handling Definitions § 981.7 Edible kernel. Edible kernel means a kernel, piece, or particle of almond kernel that is not inedible. [41 FR 26852, June 30, 1976] ...

Volterra model and quark hadronization into multicomponent hadron system

International Nuclear Information System (INIS)

Darbaidze, Ya.Z.; Rostovtsev, V.A.

1989-01-01

The examples of the multiparticle process characteristic dependence on the number of a low correlated components are considered. The possibility for reducing the differential equation system, which was obtained earlier, to a dissipative type Volterra model of competing biological species for the same food is discussed. An algorithm for the analytical computation of the high order differential equation as a resultant of the of the arising system is given. The examples of linearization and solution of these equations describing the associated multiplicities of charge particles are represented. 25 refs.; 1 tab

Kernel versions of some orthogonal transformations

DEFF Research Database (Denmark)

Nielsen, Allan Aasbjerg

Kernel versions of orthogonal transformations such as principal components are based on a dual formulation also termed Q-mode analysis in which the data enter into the analysis via inner products in the Gram matrix only. In the kernel version the inner products of the original data are replaced...... by inner products between nonlinear mappings into higher dimensional feature space. Via kernel substitution also known as the kernel trick these inner products between the mappings are in turn replaced by a kernel function and all quantities needed in the analysis are expressed in terms of this kernel...... function. This means that we need not know the nonlinear mappings explicitly. Kernel principal component analysis (PCA) and kernel minimum noise fraction (MNF) analyses handle nonlinearities by implicitly transforming data into high (even infinite) dimensional feature space via the kernel function...

Model Selection in Kernel Ridge Regression

DEFF Research Database (Denmark)

Exterkate, Peter

Kernel ridge regression is gaining popularity as a data-rich nonlinear forecasting tool, which is applicable in many different contexts. This paper investigates the influence of the choice of kernel and the setting of tuning parameters on forecast accuracy. We review several popular kernels......, including polynomial kernels, the Gaussian kernel, and the Sinc kernel. We interpret the latter two kernels in terms of their smoothing properties, and we relate the tuning parameters associated to all these kernels to smoothness measures of the prediction function and to the signal-to-noise ratio. Based...... on these interpretations, we provide guidelines for selecting the tuning parameters from small grids using cross-validation. A Monte Carlo study confirms the practical usefulness of these rules of thumb. Finally, the flexible and smooth functional forms provided by the Gaussian and Sinc kernels makes them widely...

Penetuan Bilangan Iodin pada Hydrogenated Palm Kernel Oil (HPKO) dan Refined Bleached Deodorized Palm Kernel Oil (RBDPKO)

OpenAIRE

Sitompul, Monica Angelina

2015-01-01

Have been conducted Determination of Iodin Value by method titration to some Hydrogenated Palm Kernel Oil (HPKO) and Refined Bleached Deodorized Palm Kernel Oil (RBDPKO). The result of analysis obtained the Iodin Value in Hydrogenated Palm Kernel Oil (A) = 0,16 gr I2/100gr, Hydrogenated Palm Kernel Oil (B) = 0,20 gr I2/100gr, Hydrogenated Palm Kernel Oil (C) = 0,24 gr I2/100gr. And in Refined Bleached Deodorized Palm Kernel Oil (A) = 17,51 gr I2/100gr, Refined Bleached Deodorized Palm Kernel ...

7 CFR 981.8 - Inedible kernel.

Science.gov (United States)

2010-01-01

... 7 Agriculture 8 2010-01-01 2010-01-01 false Inedible kernel. 981.8 Section 981.8 Agriculture... Regulating Handling Definitions § 981.8 Inedible kernel. Inedible kernel means a kernel, piece, or particle of almond kernel with any defect scored as serious damage, or damage due to mold, gum, shrivel, or...

String networks in ZN Lotka–Volterra competition models

International Nuclear Information System (INIS)

Avelino, P.P.; Bazeia, D.; Menezes, J.; Oliveira, B.F. de

2014-01-01

In this Letter we give specific examples of Z N Lotka–Volterra competition models leading to the formation of string networks. We show that, in order to promote coexistence, the species may arrange themselves around regions with a high number density of empty sites generated by predator–prey interactions between competing species. These configurations extend into the third dimension giving rise to string networks. We investigate the corresponding dynamics using both stochastic and mean field theory simulations, showing that the coarsening of these string networks follows a scaling law which is analogous to that found in other physical systems in condensed matter and cosmology

7 CFR 981.408 - Inedible kernel.

Science.gov (United States)

2010-01-01

... 7 Agriculture 8 2010-01-01 2010-01-01 false Inedible kernel. 981.408 Section 981.408 Agriculture... Administrative Rules and Regulations § 981.408 Inedible kernel. Pursuant to § 981.8, the definition of inedible kernel is modified to mean a kernel, piece, or particle of almond kernel with any defect scored as...

Stability and Hopf bifurcations in a competitive Lotka-Volterra system with two delays

International Nuclear Information System (INIS)

Song Yongli; Han Maoan; Peng Yahong

2004-01-01

We consider a Lotka-Volterra competition system with two delays. We first investigate the stability of the positive equilibrium and the existence of Hopf bifurcations, and then using the normal form theory and center manifold argument, derive the explicit formulas which determine the stability, direction and other properties of bifurcating periodic solutions

On positive periodic solution of periodic competition Lotka-Volterra system with time delay and diffusion

International Nuclear Information System (INIS)

Sun Wen; Chen Shihua; Hong Zhiming; Wang Changping

2007-01-01

A two-species periodic competition Lotka-Volterra system with time delay and diffusion is investigated. Some sufficient conditions of the existence of positive periodic solution are established for the system by using the continuation theorem of coincidence degree theory

Model selection in kernel ridge regression

DEFF Research Database (Denmark)

Exterkate, Peter

2013-01-01

Kernel ridge regression is a technique to perform ridge regression with a potentially infinite number of nonlinear transformations of the independent variables as regressors. This method is gaining popularity as a data-rich nonlinear forecasting tool, which is applicable in many different contexts....... The influence of the choice of kernel and the setting of tuning parameters on forecast accuracy is investigated. Several popular kernels are reviewed, including polynomial kernels, the Gaussian kernel, and the Sinc kernel. The latter two kernels are interpreted in terms of their smoothing properties......, and the tuning parameters associated to all these kernels are related to smoothness measures of the prediction function and to the signal-to-noise ratio. Based on these interpretations, guidelines are provided for selecting the tuning parameters from small grids using cross-validation. A Monte Carlo study...

LZW-Kernel: fast kernel utilizing variable length code blocks from LZW compressors for protein sequence classification.

Science.gov (United States)

Filatov, Gleb; Bauwens, Bruno; Kertész-Farkas, Attila

2018-05-07

Bioinformatics studies often rely on similarity measures between sequence pairs, which often pose a bottleneck in large-scale sequence analysis. Here, we present a new convolutional kernel function for protein sequences called the LZW-Kernel. It is based on code words identified with the Lempel-Ziv-Welch (LZW) universal text compressor. The LZW-Kernel is an alignment-free method, it is always symmetric, is positive, always provides 1.0 for self-similarity and it can directly be used with Support Vector Machines (SVMs) in classification problems, contrary to normalized compression distance (NCD), which often violates the distance metric properties in practice and requires further techniques to be used with SVMs. The LZW-Kernel is a one-pass algorithm, which makes it particularly plausible for big data applications. Our experimental studies on remote protein homology detection and protein classification tasks reveal that the LZW-Kernel closely approaches the performance of the Local Alignment Kernel (LAK) and the SVM-pairwise method combined with Smith-Waterman (SW) scoring at a fraction of the time. Moreover, the LZW-Kernel outperforms the SVM-pairwise method when combined with BLAST scores, which indicates that the LZW code words might be a better basis for similarity measures than local alignment approximations found with BLAST. In addition, the LZW-Kernel outperforms n-gram based mismatch kernels, hidden Markov model based SAM and Fisher kernel, and protein family based PSI-BLAST, among others. Further advantages include the LZW-Kernel's reliance on a simple idea, its ease of implementation, and its high speed, three times faster than BLAST and several magnitudes faster than SW or LAK in our tests. LZW-Kernel is implemented as a standalone C code and is a free open-source program distributed under GPLv3 license and can be downloaded from https://github.com/kfattila/LZW-Kernel. akerteszfarkas@hse.ru. Supplementary data are available at Bioinformatics Online.

Viscosity kernel of molecular fluids

DEFF Research Database (Denmark)

Puscasu, Ruslan; Todd, Billy; Daivis, Peter

2010-01-01

, temperature, and chain length dependencies of the reciprocal and real-space viscosity kernels are presented. We find that the density has a major effect on the shape of the kernel. The temperature range and chain lengths considered here have by contrast less impact on the overall normalized shape. Functional...... forms that fit the wave-vector-dependent kernel data over a large density and wave-vector range have also been tested. Finally, a structural normalization of the kernels in physical space is considered. Overall, the real-space viscosity kernel has a width of roughly 3–6 atomic diameters, which means...

Kernel learning algorithms for face recognition

CERN Document Server

Li, Jun-Bao; Pan, Jeng-Shyang

2013-01-01

Kernel Learning Algorithms for Face Recognition covers the framework of kernel based face recognition. This book discusses the advanced kernel learning algorithms and its application on face recognition. This book also focuses on the theoretical deviation, the system framework and experiments involving kernel based face recognition. Included within are algorithms of kernel based face recognition, and also the feasibility of the kernel based face recognition method. This book provides researchers in pattern recognition and machine learning area with advanced face recognition methods and its new

Delay-Induced Oscillations in a Competitor-Competitor-Mutualist Lotka-Volterra Model

Directory of Open Access Journals (Sweden)

Changjin Xu

2017-01-01

Full Text Available This paper deals with a competitor-competitor-mutualist Lotka-Volterra model. A series of sufficient criteria guaranteeing the stability and the occurrence of Hopf bifurcation for the model are obtained. Several concrete formulae determine the properties of bifurcating periodic solutions by applying the normal form theory and the center manifold principle. Computer simulations are given to support the theoretical predictions. At last, biological meaning and a conclusion are presented.

Kernel-Based Relevance Analysis with Enhanced Interpretability for Detection of Brain Activity Patterns

Directory of Open Access Journals (Sweden)

Andres M. Alvarez-Meza

2017-10-01

Full Text Available We introduce Enhanced Kernel-based Relevance Analysis (EKRA that aims to support the automatic identification of brain activity patterns using electroencephalographic recordings. EKRA is a data-driven strategy that incorporates two kernel functions to take advantage of the available joint information, associating neural responses to a given stimulus condition. Regarding this, a Centered Kernel Alignment functional is adjusted to learning the linear projection that best discriminates the input feature set, optimizing the required free parameters automatically. Our approach is carried out in two scenarios: (i feature selection by computing a relevance vector from extracted neural features to facilitating the physiological interpretation of a given brain activity task, and (ii enhanced feature selection to perform an additional transformation of relevant features aiming to improve the overall identification accuracy. Accordingly, we provide an alternative feature relevance analysis strategy that allows improving the system performance while favoring the data interpretability. For the validation purpose, EKRA is tested in two well-known tasks of brain activity: motor imagery discrimination and epileptic seizure detection. The obtained results show that the EKRA approach estimates a relevant representation space extracted from the provided supervised information, emphasizing the salient input features. As a result, our proposal outperforms the state-of-the-art methods regarding brain activity discrimination accuracy with the benefit of enhanced physiological interpretation about the task at hand.

Partial Deconvolution with Inaccurate Blur Kernel.

Science.gov (United States)

Ren, Dongwei; Zuo, Wangmeng; Zhang, David; Xu, Jun; Zhang, Lei

2017-10-17

Most non-blind deconvolution methods are developed under the error-free kernel assumption, and are not robust to inaccurate blur kernel. Unfortunately, despite the great progress in blind deconvolution, estimation error remains inevitable during blur kernel estimation. Consequently, severe artifacts such as ringing effects and distortions are likely to be introduced in the non-blind deconvolution stage. In this paper, we tackle this issue by suggesting: (i) a partial map in the Fourier domain for modeling kernel estimation error, and (ii) a partial deconvolution model for robust deblurring with inaccurate blur kernel. The partial map is constructed by detecting the reliable Fourier entries of estimated blur kernel. And partial deconvolution is applied to wavelet-based and learning-based models to suppress the adverse effect of kernel estimation error. Furthermore, an E-M algorithm is developed for estimating the partial map and recovering the latent sharp image alternatively. Experimental results show that our partial deconvolution model is effective in relieving artifacts caused by inaccurate blur kernel, and can achieve favorable deblurring quality on synthetic and real blurry images.Most non-blind deconvolution methods are developed under the error-free kernel assumption, and are not robust to inaccurate blur kernel. Unfortunately, despite the great progress in blind deconvolution, estimation error remains inevitable during blur kernel estimation. Consequently, severe artifacts such as ringing effects and distortions are likely to be introduced in the non-blind deconvolution stage. In this paper, we tackle this issue by suggesting: (i) a partial map in the Fourier domain for modeling kernel estimation error, and (ii) a partial deconvolution model for robust deblurring with inaccurate blur kernel. The partial map is constructed by detecting the reliable Fourier entries of estimated blur kernel. And partial deconvolution is applied to wavelet-based and learning

An Improved Global Harmony Search Algorithm for the Identification of Nonlinear Discrete-Time Systems Based on Volterra Filter Modeling

Directory of Open Access Journals (Sweden)

Zongyan Li

2016-01-01

Full Text Available This paper describes an improved global harmony search (IGHS algorithm for identifying the nonlinear discrete-time systems based on second-order Volterra model. The IGHS is an improved version of the novel global harmony search (NGHS algorithm, and it makes two significant improvements on the NGHS. First, the genetic mutation operation is modified by combining normal distribution and Cauchy distribution, which enables the IGHS to fully explore and exploit the solution space. Second, an opposition-based learning (OBL is introduced and modified to improve the quality of harmony vectors. The IGHS algorithm is implemented on two numerical examples, and they are nonlinear discrete-time rational system and the real heat exchanger, respectively. The results of the IGHS are compared with those of the other three methods, and it has been verified to be more effective than the other three methods on solving the above two problems with different input signals and system memory sizes.

Kernel methods for deep learning

OpenAIRE

Cho, Youngmin

2012-01-01

We introduce a new family of positive-definite kernels that mimic the computation in large neural networks. We derive the different members of this family by considering neural networks with different activation functions. Using these kernels as building blocks, we also show how to construct other positive-definite kernels by operations such as composition, multiplication, and averaging. We explore the use of these kernels in standard models of supervised learning, such as support vector mach...

Generalized Lotka—Volterra systems connected with simple Lie algebras

International Nuclear Information System (INIS)

Charalambides, Stelios A; Damianou, Pantelis A; Evripidou, Charalambos A

2015-01-01

We devise a new method for producing Hamiltonian systems by constructing the corresponding Lax pairs. This is achieved by considering a larger subset of the positive roots than the simple roots of the root system of a simple Lie algebra. We classify all subsets of the positive roots of the root system of type A n for which the corresponding Hamiltonian systems are transformed, via a simple change of variables, to Lotka-Volterra systems. For some special cases of subsets of the positive roots of the root system of type A n , we produce new integrable Hamiltonian systems. (paper)

Generalized Lotka—Volterra systems connected with simple Lie algebras

Science.gov (United States)

Charalambides, Stelios A.; Damianou, Pantelis A.; Evripidou, Charalambos A.

2015-06-01

We devise a new method for producing Hamiltonian systems by constructing the corresponding Lax pairs. This is achieved by considering a larger subset of the positive roots than the simple roots of the root system of a simple Lie algebra. We classify all subsets of the positive roots of the root system of type An for which the corresponding Hamiltonian systems are transformed, via a simple change of variables, to Lotka-Volterra systems. For some special cases of subsets of the positive roots of the root system of type An, we produce new integrable Hamiltonian systems.

7 CFR 981.9 - Kernel weight.

Science.gov (United States)

2010-01-01

... 7 Agriculture 8 2010-01-01 2010-01-01 false Kernel weight. 981.9 Section 981.9 Agriculture Regulations of the Department of Agriculture (Continued) AGRICULTURAL MARKETING SERVICE (Marketing Agreements... Regulating Handling Definitions § 981.9 Kernel weight. Kernel weight means the weight of kernels, including...

Veto-Consensus Multiple Kernel Learning

NARCIS (Netherlands)

Zhou, Y.; Hu, N.; Spanos, C.J.

2016-01-01

We propose Veto-Consensus Multiple Kernel Learning (VCMKL), a novel way of combining multiple kernels such that one class of samples is described by the logical intersection (consensus) of base kernelized decision rules, whereas the other classes by the union (veto) of their complements. The

7 CFR 51.2295 - Half kernel.

Science.gov (United States)

2010-01-01

... 7 Agriculture 2 2010-01-01 2010-01-01 false Half kernel. 51.2295 Section 51.2295 Agriculture... Standards for Shelled English Walnuts (Juglans Regia) Definitions § 51.2295 Half kernel. Half kernel means the separated half of a kernel with not more than one-eighth broken off. ...

An Approximate Approach to Automatic Kernel Selection.

Science.gov (United States)

Ding, Lizhong; Liao, Shizhong

2016-02-02

Kernel selection is a fundamental problem of kernel-based learning algorithms. In this paper, we propose an approximate approach to automatic kernel selection for regression from the perspective of kernel matrix approximation. We first introduce multilevel circulant matrices into automatic kernel selection, and develop two approximate kernel selection algorithms by exploiting the computational virtues of multilevel circulant matrices. The complexity of the proposed algorithms is quasi-linear in the number of data points. Then, we prove an approximation error bound to measure the effect of the approximation in kernel matrices by multilevel circulant matrices on the hypothesis and further show that the approximate hypothesis produced with multilevel circulant matrices converges to the accurate hypothesis produced with kernel matrices. Experimental evaluations on benchmark datasets demonstrate the effectiveness of approximate kernel selection.

Iterative software kernels

Energy Technology Data Exchange (ETDEWEB)

Duff, I.

1994-12-31

This workshop focuses on kernels for iterative software packages. Specifically, the three speakers discuss various aspects of sparse BLAS kernels. Their topics are: `Current status of user lever sparse BLAS`; Current status of the sparse BLAS toolkit`; and `Adding matrix-matrix and matrix-matrix-matrix multiply to the sparse BLAS toolkit`.

Viscozyme L pretreatment on palm kernels improved the aroma of palm kernel oil after kernel roasting.

Science.gov (United States)

Zhang, Wencan; Leong, Siew Mun; Zhao, Feifei; Zhao, Fangju; Yang, Tiankui; Liu, Shaoquan

2018-05-01

With an interest to enhance the aroma of palm kernel oil (PKO), Viscozyme L, an enzyme complex containing a wide range of carbohydrases, was applied to alter the carbohydrates in palm kernels (PK) to modulate the formation of volatiles upon kernel roasting. After Viscozyme treatment, the content of simple sugars and free amino acids in PK increased by 4.4-fold and 4.5-fold, respectively. After kernel roasting and oil extraction, significantly more 2,5-dimethylfuran, 2-[(methylthio)methyl]-furan, 1-(2-furanyl)-ethanone, 1-(2-furyl)-2-propanone, 5-methyl-2-furancarboxaldehyde and 2-acetyl-5-methylfuran but less 2-furanmethanol and 2-furanmethanol acetate were found in treated PKO; the correlation between their formation and simple sugar profile was estimated by using partial least square regression (PLS1). Obvious differences in pyrroles and Strecker aldehydes were also found between the control and treated PKOs. Principal component analysis (PCA) clearly discriminated the treated PKOs from that of control PKOs on the basis of all volatile compounds. Such changes in volatiles translated into distinct sensory attributes, whereby treated PKO was more caramelic and burnt after aqueous extraction and more nutty, roasty, caramelic and smoky after solvent extraction. Copyright © 2018 Elsevier Ltd. All rights reserved.

A kernel version of spatial factor analysis

DEFF Research Database (Denmark)

Nielsen, Allan Aasbjerg

2009-01-01

. Schölkopf et al. introduce kernel PCA. Shawe-Taylor and Cristianini is an excellent reference for kernel methods in general. Bishop and Press et al. describe kernel methods among many other subjects. Nielsen and Canty use kernel PCA to detect change in univariate airborne digital camera images. The kernel...... version of PCA handles nonlinearities by implicitly transforming data into high (even infinite) dimensional feature space via the kernel function and then performing a linear analysis in that space. In this paper we shall apply kernel versions of PCA, maximum autocorrelation factor (MAF) analysis...

Turing pattern dynamics and adaptive discretization for a superdiffusive Lotka-Volterra system

OpenAIRE

Bendahmane , Mostafa; Ruiz-Baier , Ricardo; Tian , Canrong

2016-01-01

International audience; We focus our attention on the effects of introducing the fractional-in-space operator into a Lotka-Volterra competitive model describing population superdiffusion. First, we address the weak solvability of the coupled problem employing the Faedo-Galerkin method and compactness arguments. In addition, we are interested in how cross superdiffusion influences the formation of spatial patterns: a linear stability analysis has been carried out, showing that cross superdiffu...

7 CFR 51.1441 - Half-kernel.

Science.gov (United States)

2010-01-01

... 7 Agriculture 2 2010-01-01 2010-01-01 false Half-kernel. 51.1441 Section 51.1441 Agriculture... Standards for Grades of Shelled Pecans Definitions § 51.1441 Half-kernel. Half-kernel means one of the separated halves of an entire pecan kernel with not more than one-eighth of its original volume missing...

Explicit solution of the Volterra integral equation for transient fields on inhomogeneous arbitrarily shaped dielectric bodies

KAUST Repository

Al Jarro, Ahmed

2011-09-01

A new predictor-corrector scheme for solving the Volterra integral equation to analyze transient electromagnetic wave interactions with arbitrarily shaped inhomogeneous dielectric bodies is considered. Numerical results demonstrating stability and accuracy of the proposed method are presented. © 2011 IEEE.

Stable power laws in variable economies; Lotka-Volterra implies Pareto-Zipf

Science.gov (United States)

Solomon, S.; Richmond, P.

2002-05-01

In recent years we have found that logistic systems of the Generalized Lotka-Volterra type (GLV) describing statistical systems of auto-catalytic elements posses power law distributions of the Pareto-Zipf type. In particular, when applied to economic systems, GLV leads to power laws in the relative individual wealth distribution and in market returns. These power laws and their exponent α are invariant to arbitrary variations in the total wealth of the system and to other endogenously and exogenously induced variations.

Local Observed-Score Kernel Equating

Science.gov (United States)

Wiberg, Marie; van der Linden, Wim J.; von Davier, Alina A.

2014-01-01

Three local observed-score kernel equating methods that integrate methods from the local equating and kernel equating frameworks are proposed. The new methods were compared with their earlier counterparts with respect to such measures as bias--as defined by Lord's criterion of equity--and percent relative error. The local kernel item response…

Analysis of potential urban unstable areas and landslide-induced damages on Volterra historical site through a remote sensing approach

Science.gov (United States)

Del Soldato, Matteo; Bianchini, Silvia; Nolesini, Teresa; Frodella, William; Casagli, Nicola

2017-04-01

Multisystem remote sensing techniques were exploited to provide a comprehensive overview of Volterra (Italy) site stability with regards to its landscape, urban fabric and cultural heritage. Interferometric Synthetic Aperture Radar (InSAR) techniques allow precise measurements of Earth surface displacement, as well as the detection of building deformations on large urban areas. In the field of cultural heritage conservation Infrared thermography (IRT) provides surface temperature mapping and therefore detects various potential criticalities, such as moisture, seepage areas, cracks and structural anomalies. Between winter 2014 and spring 2015 the historical center and south-western sectors of Volterra (Tuscany region, central Italy) were affected by instability phenomena. The spatial distribution, typology and effect on the urban fabrics of the landslide phenomena were investigated by analyzing the geological and geomorphological settings, traditional geotechnical monitoring and advanced remote sensing data such as Persistent Scatterers Interferometry (PSI). The ground deformation rates and the maximum settlement values derived from SAR acquisitions of historical ENVISAT and recent COSMO-SkyMed sensors, in 2003-2009 and 2010-2015 respectively, were compared with background geological data, constructive features, in situ evidences and detailed field inspections in order to classify landslide-damaged buildings. In this way, the detected movements and their potential correspondences with recognized damages were investigated in order to perform an assessment of the built-up areas deformations and damages on Volterra. The IRT technique was applied in order to survey the surface temperature of the historical Volterra wall-enclosure, and allowed highlighting thermal anomalies on this cultural heritage element of the site. The obtained results permitted to better correlate the landslide effects of the recognized deformations in the urban fabric, in order to provide useful

On the long time behavior of non-autonomous Lotka-Volterra models with diffusion via the sub-supertrajectory method

Science.gov (United States)

Langa, José A.; Rodríguez-Bernal, Aníbal; Suárez, Antonio

In this paper we study in detail the geometrical structure of global pullback and forwards attractors associated to non-autonomous Lotka-Volterra systems in all the three cases of competition, symbiosis or prey-predator. In particular, under some conditions on the parameters, we prove the existence of a unique nondegenerate global solution for these models, which attracts any other complete bounded trajectory. Thus, we generalize the existence of a unique strictly positive stable (stationary) solution from the autonomous case and we extend to Lotka-Volterra systems the result for scalar logistic equations. To this end we present the sub-supertrajectory tool as a generalization of the now classical sub-supersolution method. In particular, we also conclude pullback and forwards permanence for the above models.

Credit scoring analysis using kernel discriminant

Science.gov (United States)

Widiharih, T.; Mukid, M. A.; Mustafid

2018-05-01

Credit scoring model is an important tool for reducing the risk of wrong decisions when granting credit facilities to applicants. This paper investigate the performance of kernel discriminant model in assessing customer credit risk. Kernel discriminant analysis is a non- parametric method which means that it does not require any assumptions about the probability distribution of the input. The main ingredient is a kernel that allows an efficient computation of Fisher discriminant. We use several kernel such as normal, epanechnikov, biweight, and triweight. The models accuracy was compared each other using data from a financial institution in Indonesia. The results show that kernel discriminant can be an alternative method that can be used to determine who is eligible for a credit loan. In the data we use, it shows that a normal kernel is relevant to be selected for credit scoring using kernel discriminant model. Sensitivity and specificity reach to 0.5556 and 0.5488 respectively.

Four positive periodic solutions of a discrete time Lotka-Volterra competitive system with harvesting terms

Directory of Open Access Journals (Sweden)

Xinggui Liu

2011-01-01

Full Text Available In this paper, by using Mawhin's continuation theorem of coincidence degree theory, we establish the existence of at least four positive periodic solutions for a discrete time Lotka-Volterra competitive system with harvesting terms. An example is given to illustrate the effectiveness of our results.

Delimiting areas of endemism through kernel interpolation.

Science.gov (United States)

Oliveira, Ubirajara; Brescovit, Antonio D; Santos, Adalberto J

2015-01-01

We propose a new approach for identification of areas of endemism, the Geographical Interpolation of Endemism (GIE), based on kernel spatial interpolation. This method differs from others in being independent of grid cells. This new approach is based on estimating the overlap between the distribution of species through a kernel interpolation of centroids of species distribution and areas of influence defined from the distance between the centroid and the farthest point of occurrence of each species. We used this method to delimit areas of endemism of spiders from Brazil. To assess the effectiveness of GIE, we analyzed the same data using Parsimony Analysis of Endemism and NDM and compared the areas identified through each method. The analyses using GIE identified 101 areas of endemism of spiders in Brazil GIE demonstrated to be effective in identifying areas of endemism in multiple scales, with fuzzy edges and supported by more synendemic species than in the other methods. The areas of endemism identified with GIE were generally congruent with those identified for other taxonomic groups, suggesting that common processes can be responsible for the origin and maintenance of these biogeographic units.

Delimiting areas of endemism through kernel interpolation.

Directory of Open Access Journals (Sweden)

Ubirajara Oliveira

Full Text Available We propose a new approach for identification of areas of endemism, the Geographical Interpolation of Endemism (GIE, based on kernel spatial interpolation. This method differs from others in being independent of grid cells. This new approach is based on estimating the overlap between the distribution of species through a kernel interpolation of centroids of species distribution and areas of influence defined from the distance between the centroid and the farthest point of occurrence of each species. We used this method to delimit areas of endemism of spiders from Brazil. To assess the effectiveness of GIE, we analyzed the same data using Parsimony Analysis of Endemism and NDM and compared the areas identified through each method. The analyses using GIE identified 101 areas of endemism of spiders in Brazil GIE demonstrated to be effective in identifying areas of endemism in multiple scales, with fuzzy edges and supported by more synendemic species than in the other methods. The areas of endemism identified with GIE were generally congruent with those identified for other taxonomic groups, suggesting that common processes can be responsible for the origin and maintenance of these biogeographic units.

Asymptotic Behaviour and Extinction of Delay Lotka-Volterra Model with Jump-Diffusion

OpenAIRE

Dan Li; Jing’an Cui; Guohua Song

2014-01-01

This paper studies the effect of jump-diffusion random environmental perturbations on the asymptotic behaviour and extinction of Lotka-Volterra population dynamics with delays. The contributions of this paper lie in the following: (a) to consider delay stochastic differential equation with jumps, we introduce a proper initial data space, in which the initial data may be discontinuous function with downward jumps; (b) we show that the delay stochastic differential equation with jumps associate...

The human body metabolism process mathematical simulation based on Lotka-Volterra model

Science.gov (United States)

Oliynyk, Andriy; Oliynyk, Eugene; Pyptiuk, Olexandr; DzierŻak, RóŻa; Szatkowska, Małgorzata; Uvaysova, Svetlana; Kozbekova, Ainur

2017-08-01

The mathematical model of metabolism process in human organism based on Lotka-Volterra model has beeng proposed, considering healing regime, nutrition system, features of insulin and sugar fragmentation process in the organism. The numerical algorithm of the model using IV-order Runge-Kutta method has been realized. After the result of calculations the conclusions have been made, recommendations about using the modeling results have been showed, the vectors of the following researches are defined.

Gelfand-Dikii Hamiltonian operator and co-ad joint representation of the Volterra group

International Nuclear Information System (INIS)

Lebedev, D.R.; Manin, Yu.I.

1978-01-01

It is shown that the Gelfand-Dikii Hamiltonian structure is an analogue of a very special class of finite-dimensional symplectic structures, namely, the Kirillow structures on the orbits of the co-adjoint representation of the Lie groups. The Lie group is represented by the Volterra operators. The main interest lies in the possibility of application of the ideology of ''geometric quantization'' to the Lax equations

Kernel parameter dependence in spatial factor analysis

DEFF Research Database (Denmark)

Nielsen, Allan Aasbjerg

2010-01-01

kernel PCA. Shawe-Taylor and Cristianini [4] is an excellent reference for kernel methods in general. Bishop [5] and Press et al. [6] describe kernel methods among many other subjects. The kernel version of PCA handles nonlinearities by implicitly transforming data into high (even infinite) dimensional...... feature space via the kernel function and then performing a linear analysis in that space. In this paper we shall apply a kernel version of maximum autocorrelation factor (MAF) [7, 8] analysis to irregularly sampled stream sediment geochemistry data from South Greenland and illustrate the dependence...... of the kernel width. The 2,097 samples each covering on average 5 km2 are analyzed chemically for the content of 41 elements....

He's homotopy perturbation method for solving systems of Volterra integral equations of the second kind

International Nuclear Information System (INIS)

Biazar, J.; Ghazvini, H.

2009-01-01

In this paper, the He's homotopy perturbation method is applied to solve systems of Volterra integral equations of the second kind. Some examples are presented to illustrate the ability of the method for linear and non-linear such systems. The results reveal that the method is very effective and simple.

Hybrid MPI/OpenMP parallelization of the explicit Volterra integral equation solver for multi-core computer architectures

KAUST Repository

Al Jarro, Ahmed; Bagci, Hakan

2011-01-01

A hybrid MPI/OpenMP scheme for efficiently parallelizing the explicit marching-on-in-time (MOT)-based solution of the time-domain volume (Volterra) integral equation (TD-VIE) is presented. The proposed scheme equally distributes tested field values

Identification of quantitative trait loci for popping traits and kernel characteristics in sorghum grain

Science.gov (United States)

Popped grain sorghum has developed a niche among specialty snack-food consumers. In contrast to popcorn, sorghum has not benefited from persistent selective breeding for popping efficiency and kernel expansion ratio. While recent studies have already demonstrated that popping characteristics are h...

A predictor-corrector scheme for solving the Volterra integral equation

KAUST Repository

Al Jarro, Ahmed

2011-08-01

The occurrence of late time instabilities is a common problem of almost all time marching methods developed for solving time domain integral equations. Implicit marching algorithms are now considered stable with various efforts that have been developed for removing low and high frequency instabilities. On the other hand, literature on stabilizing explicit schemes, which might be considered more efficient since they do not require a matrix inversion at each time step, is practically non-existent. In this work, a stable but still explicit predictor-corrector scheme is proposed for solving the Volterra integral equation and its efficacy is verified numerically. © 2011 IEEE.

Multiple Kernel Learning with Data Augmentation

Science.gov (United States)

2016-11-22

JMLR: Workshop and Conference Proceedings 63:49–64, 2016 ACML 2016 Multiple Kernel Learning with Data Augmentation Khanh Nguyen nkhanh@deakin.edu.au...University, Australia Editors: Robert J. Durrant and Kee-Eung Kim Abstract The motivations of multiple kernel learning (MKL) approach are to increase... kernel expres- siveness capacity and to avoid the expensive grid search over a wide spectrum of kernels . A large amount of work has been proposed to

OS X and iOS Kernel Programming

CERN Document Server

Halvorsen, Ole Henry

2011-01-01

OS X and iOS Kernel Programming combines essential operating system and kernel architecture knowledge with a highly practical approach that will help you write effective kernel-level code. You'll learn fundamental concepts such as memory management and thread synchronization, as well as the I/O Kit framework. You'll also learn how to write your own kernel-level extensions, such as device drivers for USB and Thunderbolt devices, including networking, storage and audio drivers. OS X and iOS Kernel Programming provides an incisive and complete introduction to the XNU kernel, which runs iPhones, i

Model selection for Gaussian kernel PCA denoising

DEFF Research Database (Denmark)

Jørgensen, Kasper Winther; Hansen, Lars Kai

2012-01-01

We propose kernel Parallel Analysis (kPA) for automatic kernel scale and model order selection in Gaussian kernel PCA. Parallel Analysis [1] is based on a permutation test for covariance and has previously been applied for model order selection in linear PCA, we here augment the procedure to also...... tune the Gaussian kernel scale of radial basis function based kernel PCA.We evaluate kPA for denoising of simulated data and the US Postal data set of handwritten digits. We find that kPA outperforms other heuristics to choose the model order and kernel scale in terms of signal-to-noise ratio (SNR...

Periodic solutions of Volterra integral equations

Directory of Open Access Journals (Sweden)

M. N. Islam

1988-01-01

Full Text Available Consider the system of equationsx(t=f(t+∫−∞tk(t,sx(sds,           (1andx(t=f(t+∫−∞tk(t,sg(s,x(sds.       (2Existence of continuous periodic solutions of (1 is shown using the resolvent function of the kernel k. Some important properties of the resolvent function including its uniqueness are obtained in the process. In obtaining periodic solutions of (1 it is necessary that the resolvent of k is integrable in some sense. For a scalar convolution kernel k some explicit conditions are derived to determine whether or not the resolvent of k is integrable. Finally, the existence and uniqueness of continuous periodic solutions of (1 and (2 are btained using the contraction mapping principle as the basic tool.

Paramecium: An Extensible Object-Based Kernel

NARCIS (Netherlands)

van Doorn, L.; Homburg, P.; Tanenbaum, A.S.

1995-01-01

In this paper we describe the design of an extensible kernel, called Paramecium. This kernel uses an object-based software architecture which together with instance naming, late binding and explicit overrides enables easy reconfiguration. Determining which components reside in the kernel protection

Theory of reproducing kernels and applications

CERN Document Server

Saitoh, Saburou

2016-01-01

This book provides a large extension of the general theory of reproducing kernels published by N. Aronszajn in 1950, with many concrete applications. In Chapter 1, many concrete reproducing kernels are first introduced with detailed information. Chapter 2 presents a general and global theory of reproducing kernels with basic applications in a self-contained way. Many fundamental operations among reproducing kernel Hilbert spaces are dealt with. Chapter 2 is the heart of this book. Chapter 3 is devoted to the Tikhonov regularization using the theory of reproducing kernels with applications to numerical and practical solutions of bounded linear operator equations. In Chapter 4, the numerical real inversion formulas of the Laplace transform are presented by applying the Tikhonov regularization, where the reproducing kernels play a key role in the results. Chapter 5 deals with ordinary differential equations; Chapter 6 includes many concrete results for various fundamental partial differential equations. In Chapt...

Kernels for structured data

CERN Document Server

Gärtner, Thomas

2009-01-01

This book provides a unique treatment of an important area of machine learning and answers the question of how kernel methods can be applied to structured data. Kernel methods are a class of state-of-the-art learning algorithms that exhibit excellent learning results in several application domains. Originally, kernel methods were developed with data in mind that can easily be embedded in a Euclidean vector space. Much real-world data does not have this property but is inherently structured. An example of such data, often consulted in the book, is the (2D) graph structure of molecules formed by

Stability analysis of solutions to nonlinear stiff Volterra functional differential equations in Banach spaces

Institute of Scientific and Technical Information of China (English)

LI Shoufu

2005-01-01

A series of stability, contractivity and asymptotic stability results of the solutions to nonlinear stiff Volterra functional differential equations (VFDEs) in Banach spaces is obtained, which provides the unified theoretical foundation for the stability analysis of solutions to nonlinear stiff problems in ordinary differential equations(ODEs), delay differential equations(DDEs), integro-differential equations(IDEs) and VFDEs of other type which appear in practice.

Some stability and boundedness criteria for a class of Volterra integro-differential systems

Directory of Open Access Journals (Sweden)

Jito Vanualailai

2002-01-01

Full Text Available Using Lyapunov and Lyapunov-like functionals, we study the stability and boundedness of the solutions of a system of Volterra integrodifferential equations. Our results, also extending some of the more well-known criteria, give new sufficient conditions for stability of the zero solution of the nonperturbed system, and prove that the same conditions for the perturbed system yield boundedness when the perturbation is $L^2$.

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.

Global asymptotic behavior in a Lotka–Volterra competition system with spatio-temporal delays

International Nuclear Information System (INIS)

Zhang, Jia-Fang; Chen, Heshan

2014-01-01

This paper is concerned with a Lotka–Volterra competition system with spatio-temporal delays. By using the linearization method, we show the local asymptotic behavior of the nonnegative steady-state solutions. Especially, the global asymptotic stability of the positive steady-state solution is investigated by the method of upper and lower solutions. The result of global asymptotic stability implies that the system has no nonconstant positive steady-state solution

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.

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

Cross-diffusional effect in a telegraph reaction diffusion Lotka-Volterra two competitive system

International Nuclear Information System (INIS)

Abdusalam, H.A; Fahmy, E.S.

2003-01-01

It is known now that, telegraph equation is more suitable than ordinary diffusion equation in modelling reaction diffusion in several branches of sciences. Telegraph reaction diffusion Lotka-Volterra two competitive system is considered. We observed that this system can give rise to diffusive instability only in the presence of cross-diffusion. Local and global stability analysis in the cross-diffusional effect are studied by considering suitable Lyapunov functional

7 CFR 981.401 - Adjusted kernel weight.

Science.gov (United States)

2010-01-01

... 7 Agriculture 8 2010-01-01 2010-01-01 false Adjusted kernel weight. 981.401 Section 981.401... Administrative Rules and Regulations § 981.401 Adjusted kernel weight. (a) Definition. Adjusted kernel weight... kernels in excess of five percent; less shells, if applicable; less processing loss of one percent for...

Channel identification machines.

Science.gov (United States)

Lazar, Aurel A; Slutskiy, Yevgeniy B

2012-01-01

We present a formal methodology for identifying a channel in a system consisting of a communication channel in cascade with an asynchronous sampler. The channel is modeled as a multidimensional filter, while models of asynchronous samplers are taken from neuroscience and communications and include integrate-and-fire neurons, asynchronous sigma/delta modulators and general oscillators in cascade with zero-crossing detectors. We devise channel identification algorithms that recover a projection of the filter(s) onto a space of input signals loss-free for both scalar and vector-valued test signals. The test signals are modeled as elements of a reproducing kernel Hilbert space (RKHS) with a Dirichlet kernel. Under appropriate limiting conditions on the bandwidth and the order of the test signal space, the filter projection converges to the impulse response of the filter. We show that our results hold for a wide class of RKHSs, including the space of finite-energy bandlimited signals. We also extend our channel identification results to noisy circuits.

Channel Identification Machines

Directory of Open Access Journals (Sweden)

Aurel A. Lazar

2012-01-01

Full Text Available We present a formal methodology for identifying a channel in a system consisting of a communication channel in cascade with an asynchronous sampler. The channel is modeled as a multidimensional filter, while models of asynchronous samplers are taken from neuroscience and communications and include integrate-and-fire neurons, asynchronous sigma/delta modulators and general oscillators in cascade with zero-crossing detectors. We devise channel identification algorithms that recover a projection of the filter(s onto a space of input signals loss-free for both scalar and vector-valued test signals. The test signals are modeled as elements of a reproducing kernel Hilbert space (RKHS with a Dirichlet kernel. Under appropriate limiting conditions on the bandwidth and the order of the test signal space, the filter projection converges to the impulse response of the filter. We show that our results hold for a wide class of RKHSs, including the space of finite-energy bandlimited signals. We also extend our channel identification results to noisy circuits.

A differential-difference hierarchy associated with relativistic Toda and Volterra hierarchies

International Nuclear Information System (INIS)

Fan Engui; Dai Huihui

2008-01-01

By embedding a free function into a compatible zero curvature equation, we enlarge the original differential-difference hierarchy into a new hierarchy with the free function which still admits zero curvature representation. The new hierarchy not only includes the original hierarchy, but also the well-known relativistic Toda hierarchy and the Volterra hierarchy as special reductions by properly choosing the free function. Infinitely many conservation laws and Darboux transformation for a representative differential-difference system are constructed based on its Lax representation. The exact solutions follow by applying the Darboux transformation

Testing Infrastructure for Operating System Kernel Development

DEFF Research Database (Denmark)

Walter, Maxwell; Karlsson, Sven

2014-01-01

Testing is an important part of system development, and to test effectively we require knowledge of the internal state of the system under test. Testing an operating system kernel is a challenge as it is the operating system that typically provides access to this internal state information. Multi......-core kernels pose an even greater challenge due to concurrency and their shared kernel state. In this paper, we present a testing framework that addresses these challenges by running the operating system in a virtual machine, and using virtual machine introspection to both communicate with the kernel...... and obtain information about the system. We have also developed an in-kernel testing API that we can use to develop a suite of unit tests in the kernel. We are using our framework for for the development of our own multi-core research kernel....

The existence of periodic solutions of the n-species Lotka-Volterra competition systems with impulsive

Energy Technology Data Exchange (ETDEWEB)

Jin Zhen E-mail: jinzhn@263.net; Ma Zhien; Maoan Han

2004-10-01

In this paper, we study the existence of positive periodic solutions of periodic n-species Lotka-Volterra competition systems with impulses. By using the method coincidence degree theorem, a set of easily verifiable sufficient conditions are obtained for the existence of at least one strictly positive periodic solutions. Some known results are improved and generalized.

The existence of periodic solutions of the n-species Lotka-Volterra competition systems with impulsive

International Nuclear Information System (INIS)

Jin Zhen; Ma Zhien; Maoan Han

2004-01-01

In this paper, we study the existence of positive periodic solutions of periodic n-species Lotka-Volterra competition systems with impulses. By using the method coincidence degree theorem, a set of easily verifiable sufficient conditions are obtained for the existence of at least one strictly positive periodic solutions. Some known results are improved and generalized

7 CFR 51.1403 - Kernel color classification.

Science.gov (United States)

2010-01-01

... 7 Agriculture 2 2010-01-01 2010-01-01 false Kernel color classification. 51.1403 Section 51.1403... STANDARDS) United States Standards for Grades of Pecans in the Shell 1 Kernel Color Classification § 51.1403 Kernel color classification. (a) The skin color of pecan kernels may be described in terms of the color...

Isolation and selection of new biosurfactant producing bacteria from degraded palm kernel cake under liquid state fermentation.

Science.gov (United States)

Jamal, Parveen; Mir, Shajrat; Alam, Md Zahangir; Wan Nawawi, Wan M Fazli

2014-01-01

Biosurfactants are surface-active compounds produced by different microorganisms. The aim of this study was to introduce palm kernel cake (PKC) as a novel substrate for biosurfactant production using a potent bacterial strain under liquid state fermentation. This study was primarily based on the isolation and identification of biosurfactant-producing bacteria that could utilize palm kernel cake as a new major substrate. Potential bacterial strains were isolated from degraded PKC and screened for biosurfactant production with the help of the drop collapse assay and by analyzing the surface tension activity. From the screened isolates, a new strain, SM03, showed the best and most consistent results, and was therefore selected as the most potent biosurfactant-producing bacterial strain. The new strain was identified as Providencia alcalifaciens SM03 using the Gen III MicroPlate Biolog Microbial Identification System. The yield of the produced biosurfactant was 8.3 g/L.

Nonmonotonic Behavior of Supermultiplet Pattern Formation in a Noisy Lotka-Volterra System

International Nuclear Information System (INIS)

Fiasconaro, A.; Valenti, D.; Spagnolo, B.

2004-01-01

The noise-induced pattern formation in a population dynamical model of three interacting species in the coexistence regime is investigated. A coupled map lattice of Lotka-Volterra equations in the presence of multiplicative noise is used to analyze the spatiotemporal evolution. The spatial correlation of the species concentration as a function of time and of the noise intensity is investigated. A nonmonotonic behavior of the area of the patterns as a function of both noise intensity and evolution time is found. (author)

Entropy, free energy and phase transitions in the lattice Lotka-Volterra model

International Nuclear Information System (INIS)

Chichigina, O. A.; Tsekouras, G. A.; Provata, A.

2006-01-01

A thermodynamic approach is developed for reactive dynamic models restricted to substrates of arbitrary dimensions, including fractal substrates. The thermodynamic formalism is successfully applied to the lattice Lotka-Volterra (LLV) model of autocatalytic reactions on various lattice substrates. Different regimes of reactions described as phases, and phase transitions, are obtained using this approach. The predictions of thermodynamic theory confirm extensive numerical kinetic Monte Carlo simulations on square and fractal lattices. Extensions of the formalism to multispecies LLV models are also presented

Application of homotopy perturbation method for systems of Volterra integral equations of the first kind

International Nuclear Information System (INIS)

Biazar, J.; Eslami, M.; Aminikhah, H.

2009-01-01

In this article, an application of He's homotopy perturbation method is applied to solve systems of Volterra integral equations of the first kind. Some non-linear examples are prepared to illustrate the efficiency and simplicity of the method. Applying the method for linear systems is so easily that it does not worth to have any example.

The definition of kernel Oz

OpenAIRE

Smolka, Gert

1994-01-01

Oz is a concurrent language providing for functional, object-oriented, and constraint programming. This paper defines Kernel Oz, a semantically complete sublanguage of Oz. It was an important design requirement that Oz be definable by reduction to a lean kernel language. The definition of Kernel Oz introduces three essential abstractions: the Oz universe, the Oz calculus, and the actor model. The Oz universe is a first-order structure defining the values and constraints Oz computes with. The ...

Fabrication of Uranium Oxycarbide Kernels for HTR Fuel

International Nuclear Information System (INIS)

Barnes, Charles; Richardson, Clay; Nagley, Scott; Hunn, John; Shaber, Eric

2010-01-01

Babcock and Wilcox (B and W) has been producing high quality uranium oxycarbide (UCO) kernels for Advanced Gas Reactor (AGR) fuel tests at the Idaho National Laboratory. In 2005, 350-(micro)m, 19.7% 235U-enriched UCO kernels were produced for the AGR-1 test fuel. Following coating of these kernels and forming the coated-particles into compacts, this fuel was irradiated in the Advanced Test Reactor (ATR) from December 2006 until November 2009. B and W produced 425-(micro)m, 14% enriched UCO kernels in 2008, and these kernels were used to produce fuel for the AGR-2 experiment that was inserted in ATR in 2010. B and W also produced 500-(micro)m, 9.6% enriched UO2 kernels for the AGR-2 experiments. Kernels of the same size and enrichment as AGR-1 were also produced for the AGR-3/4 experiment. In addition to fabricating enriched UCO and UO2 kernels, B and W has produced more than 100 kg of natural uranium UCO kernels which are being used in coating development tests. Successive lots of kernels have demonstrated consistent high quality and also allowed for fabrication process improvements. Improvements in kernel forming were made subsequent to AGR-1 kernel production. Following fabrication of AGR-2 kernels, incremental increases in sintering furnace charge size have been demonstrated. Recently small scale sintering tests using a small development furnace equipped with a residual gas analyzer (RGA) has increased understanding of how kernel sintering parameters affect sintered kernel properties. The steps taken to increase throughput and process knowledge have reduced kernel production costs. Studies have been performed of additional modifications toward the goal of increasing capacity of the current fabrication line to use for production of first core fuel for the Next Generation Nuclear Plant (NGNP) and providing a basis for the design of a full scale fuel fabrication facility.

Existence of Generalized Homoclinic Solutions of Lotka-Volterra System under a Small Perturbation

OpenAIRE

Mi, Yuzhen

2016-01-01

This paper investigates Lotka-Volterra system under a small perturbation vxx=-μ(1-a2u-v)v+ϵf(ϵ,v,vx,u,ux), uxx=-(1-u-a1v)u+ϵg(ϵ,v,vx,u,ux). By the Fourier series expansion technique method, the fixed point theorem, the perturbation theorem, and the reversibility, we prove that near μ=0 the system has a generalized homoclinic solution exponentially approaching a periodic solution.

Existence of Generalized Homoclinic Solutions of Lotka-Volterra System under a Small Perturbation

Directory of Open Access Journals (Sweden)

Yuzhen Mi

2016-01-01

Full Text Available This paper investigates Lotka-Volterra system under a small perturbation vxx=-μ(1-a2u-vv+ϵf(ϵ,v,vx,u,ux, uxx=-(1-u-a1vu+ϵg(ϵ,v,vx,u,ux. By the Fourier series expansion technique method, the fixed point theorem, the perturbation theorem, and the reversibility, we prove that near μ=0 the system has a generalized homoclinic solution exponentially approaching a periodic solution.

Anisotropic hydrodynamics with a scalar collisional kernel

Science.gov (United States)

Almaalol, Dekrayat; Strickland, Michael

2018-04-01

Prior studies of nonequilibrium dynamics using anisotropic hydrodynamics have used the relativistic Anderson-Witting scattering kernel or some variant thereof. In this paper, we make the first study of the impact of using a more realistic scattering kernel. For this purpose, we consider a conformal system undergoing transversally homogenous and boost-invariant Bjorken expansion and take the collisional kernel to be given by the leading order 2 ↔2 scattering kernel in scalar λ ϕ4 . We consider both classical and quantum statistics to assess the impact of Bose enhancement on the dynamics. We also determine the anisotropic nonequilibrium attractor of a system subject to this collisional kernel. We find that, when the near-equilibrium relaxation-times in the Anderson-Witting and scalar collisional kernels are matched, the scalar kernel results in a higher degree of momentum-space anisotropy during the system's evolution, given the same initial conditions. Additionally, we find that taking into account Bose enhancement further increases the dynamically generated momentum-space anisotropy.

Object classification and detection with context kernel descriptors

DEFF Research Database (Denmark)

Pan, Hong; Olsen, Søren Ingvor; Zhu, Yaping

2014-01-01

Context information is important in object representation. By embedding context cue of image attributes into kernel descriptors, we propose a set of novel kernel descriptors called Context Kernel Descriptors (CKD) for object classification and detection. The motivation of CKD is to use spatial...... consistency of image attributes or features defined within a neighboring region to improve the robustness of descriptor matching in kernel space. For feature selection, Kernel Entropy Component Analysis (KECA) is exploited to learn a subset of discriminative CKD. Different from Kernel Principal Component...

String networks in Z{sub N} Lotka–Volterra competition models

Energy Technology Data Exchange (ETDEWEB)

Avelino, P.P., E-mail: Pedro.Avelino@astro.up.pt [Centro de Astrofísica da Universidade do Porto, Rua das Estrelas, 4150-762 Porto (Portugal); Departamento de Física e Astronomia, Faculdade de Ciências, Universidade do Porto, Rua do Campo Alegre 687, 4169-007 Porto (Portugal); Bazeia, D. [Instituto de Física, Universidade de São Paulo, 05314-970 São Paulo, SP (Brazil); Departamento de Física, Universidade Federal da Paraíba, 58051-970 João Pessoa, PB (Brazil); Menezes, J. [Centro de Física do Porto, Rua do Campo Alegre 687, 4169-007 Porto (Portugal); Escola de Ciências e Tecnologia, Universidade Federal do Rio Grande do Norte, Caixa Postal 1524, 59072-970 Natal, RN (Brazil); Oliveira, B.F. de [Departamento de Física, Universidade Estadual de Maringá, Av. Colombo 5790, 87020-900 Maringá, PR (Brazil)

2014-01-17

In this Letter we give specific examples of Z{sub N} Lotka–Volterra competition models leading to the formation of string networks. We show that, in order to promote coexistence, the species may arrange themselves around regions with a high number density of empty sites generated by predator–prey interactions between competing species. These configurations extend into the third dimension giving rise to string networks. We investigate the corresponding dynamics using both stochastic and mean field theory simulations, showing that the coarsening of these string networks follows a scaling law which is analogous to that found in other physical systems in condensed matter and cosmology.

Ranking Support Vector Machine with Kernel Approximation.

Science.gov (United States)

Chen, Kai; Li, Rongchun; Dou, Yong; Liang, Zhengfa; Lv, Qi

2017-01-01

Learning to rank algorithm has become important in recent years due to its successful application in information retrieval, recommender system, and computational biology, and so forth. Ranking support vector machine (RankSVM) is one of the state-of-art ranking models and has been favorably used. Nonlinear RankSVM (RankSVM with nonlinear kernels) can give higher accuracy than linear RankSVM (RankSVM with a linear kernel) for complex nonlinear ranking problem. However, the learning methods for nonlinear RankSVM are still time-consuming because of the calculation of kernel matrix. In this paper, we propose a fast ranking algorithm based on kernel approximation to avoid computing the kernel matrix. We explore two types of kernel approximation methods, namely, the Nyström method and random Fourier features. Primal truncated Newton method is used to optimize the pairwise L2-loss (squared Hinge-loss) objective function of the ranking model after the nonlinear kernel approximation. Experimental results demonstrate that our proposed method gets a much faster training speed than kernel RankSVM and achieves comparable or better performance over state-of-the-art ranking algorithms.

Ranking Support Vector Machine with Kernel Approximation

Directory of Open Access Journals (Sweden)

Kai Chen

2017-01-01

Full Text Available Learning to rank algorithm has become important in recent years due to its successful application in information retrieval, recommender system, and computational biology, and so forth. Ranking support vector machine (RankSVM is one of the state-of-art ranking models and has been favorably used. Nonlinear RankSVM (RankSVM with nonlinear kernels can give higher accuracy than linear RankSVM (RankSVM with a linear kernel for complex nonlinear ranking problem. However, the learning methods for nonlinear RankSVM are still time-consuming because of the calculation of kernel matrix. In this paper, we propose a fast ranking algorithm based on kernel approximation to avoid computing the kernel matrix. We explore two types of kernel approximation methods, namely, the Nyström method and random Fourier features. Primal truncated Newton method is used to optimize the pairwise L2-loss (squared Hinge-loss objective function of the ranking model after the nonlinear kernel approximation. Experimental results demonstrate that our proposed method gets a much faster training speed than kernel RankSVM and achieves comparable or better performance over state-of-the-art ranking algorithms.

Dose point kernels for beta-emitting radioisotopes

International Nuclear Information System (INIS)

Prestwich, W.V.; Chan, L.B.; Kwok, C.S.; Wilson, B.

1986-01-01

Knowledge of the dose point kernel corresponding to a specific radionuclide is required to calculate the spatial dose distribution produced in a homogeneous medium by a distributed source. Dose point kernels for commonly used radionuclides have been calculated previously using as a basis monoenergetic dose point kernels derived by numerical integration of a model transport equation. The treatment neglects fluctuations in energy deposition, an effect which has been later incorporated in dose point kernels calculated using Monte Carlo methods. This work describes new calculations of dose point kernels using the Monte Carlo results as a basis. An analytic representation of the monoenergetic dose point kernels has been developed. This provides a convenient method both for calculating the dose point kernel associated with a given beta spectrum and for incorporating the effect of internal conversion. An algebraic expression for allowed beta spectra has been accomplished through an extension of the Bethe-Bacher approximation, and tested against the exact expression. Simplified expression for first-forbidden shape factors have also been developed. A comparison of the calculated dose point kernel for 32 P with experimental data indicates good agreement with a significant improvement over the earlier results in this respect. An analytic representation of the dose point kernel associated with the spectrum of a single beta group has been formulated. 9 references, 16 figures, 3 tables

Rare variant testing across methods and thresholds using the multi-kernel sequence kernel association test (MK-SKAT).

Science.gov (United States)

Urrutia, Eugene; Lee, Seunggeun; Maity, Arnab; Zhao, Ni; Shen, Judong; Li, Yun; Wu, Michael C

Analysis of rare genetic variants has focused on region-based analysis wherein a subset of the variants within a genomic region is tested for association with a complex trait. Two important practical challenges have emerged. First, it is difficult to choose which test to use. Second, it is unclear which group of variants within a region should be tested. Both depend on the unknown true state of nature. Therefore, we develop the Multi-Kernel SKAT (MK-SKAT) which tests across a range of rare variant tests and groupings. Specifically, we demonstrate that several popular rare variant tests are special cases of the sequence kernel association test which compares pair-wise similarity in trait value to similarity in the rare variant genotypes between subjects as measured through a kernel function. Choosing a particular test is equivalent to choosing a kernel. Similarly, choosing which group of variants to test also reduces to choosing a kernel. Thus, MK-SKAT uses perturbation to test across a range of kernels. Simulations and real data analyses show that our framework controls type I error while maintaining high power across settings: MK-SKAT loses power when compared to the kernel for a particular scenario but has much greater power than poor choices.

Wigner functions defined with Laplace transform kernels.

Science.gov (United States)

Oh, Se Baek; Petruccelli, Jonathan C; Tian, Lei; Barbastathis, George

2011-10-24

We propose a new Wigner-type phase-space function using Laplace transform kernels--Laplace kernel Wigner function. Whereas momentum variables are real in the traditional Wigner function, the Laplace kernel Wigner function may have complex momentum variables. Due to the property of the Laplace transform, a broader range of signals can be represented in complex phase-space. We show that the Laplace kernel Wigner function exhibits similar properties in the marginals as the traditional Wigner function. As an example, we use the Laplace kernel Wigner function to analyze evanescent waves supported by surface plasmon polariton. © 2011 Optical Society of America

Metabolic network prediction through pairwise rational kernels.

Science.gov (United States)

Roche-Lima, Abiel; Domaratzki, Michael; Fristensky, Brian

2014-09-26

Metabolic networks are represented by the set of metabolic pathways. Metabolic pathways are a series of biochemical reactions, in which the product (output) from one reaction serves as the substrate (input) to another reaction. Many pathways remain incompletely characterized. One of the major challenges of computational biology is to obtain better models of metabolic pathways. Existing models are dependent on the annotation of the genes. This propagates error accumulation when the pathways are predicted by incorrectly annotated genes. Pairwise classification methods are supervised learning methods used to classify new pair of entities. Some of these classification methods, e.g., Pairwise Support Vector Machines (SVMs), use pairwise kernels. Pairwise kernels describe similarity measures between two pairs of entities. Using pairwise kernels to handle sequence data requires long processing times and large storage. Rational kernels are kernels based on weighted finite-state transducers that represent similarity measures between sequences or automata. They have been effectively used in problems that handle large amount of sequence information such as protein essentiality, natural language processing and machine translations. We create a new family of pairwise kernels using weighted finite-state transducers (called Pairwise Rational Kernel (PRK)) to predict metabolic pathways from a variety of biological data. PRKs take advantage of the simpler representations and faster algorithms of transducers. Because raw sequence data can be used, the predictor model avoids the errors introduced by incorrect gene annotations. We then developed several experiments with PRKs and Pairwise SVM to validate our methods using the metabolic network of Saccharomyces cerevisiae. As a result, when PRKs are used, our method executes faster in comparison with other pairwise kernels. Also, when we use PRKs combined with other simple kernels that include evolutionary information, the accuracy

Transformation of hand-shape features for a biometric identification approach.

Science.gov (United States)

Travieso, Carlos M; Briceño, Juan Carlos; Alonso, Jesús B

2012-01-01

The present work presents a biometric identification system for hand shape identification. The different contours have been coded based on angular descriptions forming a Markov chain descriptor. Discrete Hidden Markov Models (DHMM), each representing a target identification class, have been trained with such chains. Features have been calculated from a kernel based on the HMM parameter descriptors. Finally, supervised Support Vector Machines were used to classify parameters from the DHMM kernel. First, the system was modelled using 60 users to tune the DHMM and DHMM_kernel+SVM configuration parameters and finally, the system was checked with the whole database (GPDS database, 144 users with 10 samples per class). Our experiments have obtained similar results in both cases, demonstrating a scalable, stable and robust system. Our experiments have achieved an upper success rate of 99.87% for the GPDS database using three hand samples per class in training mode, and seven hand samples in test mode. Secondly, the authors have verified their algorithms using another independent and public database (the UST database). Our approach has reached 100% and 99.92% success for right and left hand, respectively; showing the robustness and independence of our algorithms. This success was found using as features the transformation of 100 points hand shape with our DHMM kernel, and as classifier Support Vector Machines with linear separating functions, with similar success.

Transformation of Hand-Shape Features for a Biometric Identification Approach

Directory of Open Access Journals (Sweden)

Jesús B. Alonso

2012-01-01

Full Text Available The present work presents a biometric identification system for hand shape identification. The different contours have been coded based on angular descriptions forming a Markov chain descriptor. Discrete Hidden Markov Models (DHMM, each representing a target identification class, have been trained with such chains. Features have been calculated from a kernel based on the HMM parameter descriptors. Finally, supervised Support Vector Machines were used to classify parameters from the DHMM kernel. First, the system was modelled using 60 users to tune the DHMM and DHMM_kernel+SVM configuration parameters and finally, the system was checked with the whole database (GPDS database, 144 users with 10 samples per class. Our experiments have obtained similar results in both cases, demonstrating a scalable, stable and robust system. Our experiments have achieved an upper success rate of 99.87% for the GPDS database using three hand samples per class in training mode, and seven hand samples in test mode. Secondly, the authors have verified their algorithms using another independent and public database (the UST database. Our approach has reached 100% and 99.92% success for right and left hand, respectively; showing the robustness and independence of our algorithms. This success was found using as features the transformation of 100 points hand shape with our DHMM kernel, and as classifier Support Vector Machines with linear separating functions, with similar success.

Influence Function and Robust Variant of Kernel Canonical Correlation Analysis

OpenAIRE

Alam, Md. Ashad; Fukumizu, Kenji; Wang, Yu-Ping

2017-01-01

Many unsupervised kernel methods rely on the estimation of the kernel covariance operator (kernel CO) or kernel cross-covariance operator (kernel CCO). Both kernel CO and kernel CCO are sensitive to contaminated data, even when bounded positive definite kernels are used. To the best of our knowledge, there are few well-founded robust kernel methods for statistical unsupervised learning. In addition, while the influence function (IF) of an estimator can characterize its robustness, asymptotic ...

The Linux kernel as flexible product-line architecture

NARCIS (Netherlands)

M. de Jonge (Merijn)

2002-01-01

textabstractThe Linux kernel source tree is huge ($>$ 125 MB) and inflexible (because it is difficult to add new kernel components). We propose to make this architecture more flexible by assembling kernel source trees dynamically from individual kernel components. Users then, can select what

Exploiting graph kernels for high performance biomedical relation extraction.

Science.gov (United States)

Panyam, Nagesh C; Verspoor, Karin; Cohn, Trevor; Ramamohanarao, Kotagiri

2018-01-30

Relation extraction from biomedical publications is an important task in the area of semantic mining of text. Kernel methods for supervised relation extraction are often preferred over manual feature engineering methods, when classifying highly ordered structures such as trees and graphs obtained from syntactic parsing of a sentence. Tree kernels such as the Subset Tree Kernel and Partial Tree Kernel have been shown to be effective for classifying constituency parse trees and basic dependency parse graphs of a sentence. Graph kernels such as the All Path Graph kernel (APG) and Approximate Subgraph Matching (ASM) kernel have been shown to be suitable for classifying general graphs with cycles, such as the enhanced dependency parse graph of a sentence. In this work, we present a high performance Chemical-Induced Disease (CID) relation extraction system. We present a comparative study of kernel methods for the CID task and also extend our study to the Protein-Protein Interaction (PPI) extraction task, an important biomedical relation extraction task. We discuss novel modifications to the ASM kernel to boost its performance and a method to apply graph kernels for extracting relations expressed in multiple sentences. Our system for CID relation extraction attains an F-score of 60%, without using external knowledge sources or task specific heuristic or rules. In comparison, the state of the art Chemical-Disease Relation Extraction system achieves an F-score of 56% using an ensemble of multiple machine learning methods, which is then boosted to 61% with a rule based system employing task specific post processing rules. For the CID task, graph kernels outperform tree kernels substantially, and the best performance is obtained with APG kernel that attains an F-score of 60%, followed by the ASM kernel at 57%. The performance difference between the ASM and APG kernels for CID sentence level relation extraction is not significant. In our evaluation of ASM for the PPI task, ASM

Numerical treatments for solving nonlinear mixed integral equation

Directory of Open Access Journals (Sweden)

M.A. Abdou

2016-12-01

Full Text Available We consider a mixed type of nonlinear integral equation (MNLIE of the second kind in the space C[0,T]×L2(Ω,T<1. The Volterra integral terms (VITs are considered in time with continuous kernels, while the Fredholm integral term (FIT is considered in position with singular general kernel. Using the quadratic method and separation of variables method, we obtain a nonlinear system of Fredholm integral equations (NLSFIEs with singular kernel. A Toeplitz matrix method, in each case, is then used to obtain a nonlinear algebraic system. Numerical results are calculated when the kernels take a logarithmic form or Carleman function. Moreover, the error estimates, in each case, are then computed.

The Stationary Distribution and Extinction of Generalized Multispecies Stochastic Lotka-Volterra Predator-Prey System

OpenAIRE

Yin, Fancheng; Yu, Xiaoyan

2015-01-01

This paper is concerned with the existence of stationary distribution and extinction for multispecies stochastic Lotka-Volterra predator-prey system. The contributions of this paper are as follows. (a) By using Lyapunov methods, the sufficient conditions on existence of stationary distribution and extinction are established. (b) By using the space decomposition technique and the continuity of probability, weaker conditions on extinction of the system are obtained. Finally, a numer...

Interaction of Acidithiobacillus ferrooxidans, Rhizobium phaseoli and Rhodotorula sp. in bioleaching process based on Lotka–Volterra model

Directory of Open Access Journals (Sweden)

Xuecheng Zheng

2016-07-01

Conclusion: The relationship among microorganisms during leaching could be described appropriately by Lotka–Volterra model between the initial and peak values. The relationship of A. ferrooxidans and R. phaseoli could be considered as mutualism, whereas, the relationship of A. ferrooxidans and R. phaseoli could be considered as commensalism.

Ridge Regression and Other Kernels for Genomic Selection with R Package rrBLUP

Directory of Open Access Journals (Sweden)

Jeffrey B. Endelman

2011-11-01

Full Text Available Many important traits in plant breeding are polygenic and therefore recalcitrant to traditional marker-assisted selection. Genomic selection addresses this complexity by including all markers in the prediction model. A key method for the genomic prediction of breeding values is ridge regression (RR, which is equivalent to best linear unbiased prediction (BLUP when the genetic covariance between lines is proportional to their similarity in genotype space. This additive model can be broadened to include epistatic effects by using other kernels, such as the Gaussian, which represent inner products in a complex feature space. To facilitate the use of RR and nonadditive kernels in plant breeding, a new software package for R called rrBLUP has been developed. At its core is a fast maximum-likelihood algorithm for mixed models with a single variance component besides the residual error, which allows for efficient prediction with unreplicated training data. Use of the rrBLUP software is demonstrated through several examples, including the identification of optimal crosses based on superior progeny value. In cross-validation tests, the prediction accuracy with nonadditive kernels was significantly higher than RR for wheat ( L. grain yield but equivalent for several maize ( L. traits.

GRIM : Leveraging GPUs for Kernel integrity monitoring

NARCIS (Netherlands)

Koromilas, Lazaros; Vasiliadis, Giorgos; Athanasopoulos, Ilias; Ioannidis, Sotiris

2016-01-01

Kernel rootkits can exploit an operating system and enable future accessibility and control, despite all recent advances in software protection. A promising defense mechanism against rootkits is Kernel Integrity Monitor (KIM) systems, which inspect the kernel text and data to discover any malicious

7 CFR 51.2296 - Three-fourths half kernel.

Science.gov (United States)

2010-01-01

... 7 Agriculture 2 2010-01-01 2010-01-01 false Three-fourths half kernel. 51.2296 Section 51.2296 Agriculture Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards...-fourths half kernel. Three-fourths half kernel means a portion of a half of a kernel which has more than...

On the existence of solutions for Volterra integral inclusions in Banach spaces

Directory of Open Access Journals (Sweden)

Evgenios P. Avgerinos

1993-01-01

Full Text Available In this paper we examine a class of nonlinear integral inclusions defined in a separable Banach space. For this class of inclusions of Volterra type we establish two existence results, one for inclusions with a convex-valued orientor field and the other for inclusions with nonconvex-valued orientor field. We present conditions guaranteeing that the multivalued map that represents the right-hand side of the inclusion is α-condensing using for the proof of our results a known fixed point theorem for α-condensing maps.

Variational Iteration Method for Volterra Functional Integrodifferential Equations with Vanishing Linear Delays

Directory of Open Access Journals (Sweden)

Ali Konuralp

2014-01-01

Full Text Available Application process of variational iteration method is presented in order to solve the Volterra functional integrodifferential equations which have multi terms and vanishing delays where the delay function θ(t vanishes inside the integral limits such that θ(t=qt for 0

Identificación de sistemas no lineales usando series Volterra – Laguerre

OpenAIRE

Medina Ramos, Carlos Celestino; Medina Ramos, Carlos Celestino

2011-01-01

Este trabajo de Tesis está enfocado en la identificación de sistemas no lineales de modelo dinámico no conocido, adicionalmente y en base a los resultados obtenidos, se propone la aplicación del sistema de Control Predictivo no Lineal Basado en Modelos, NMPC, usando el algoritmo de la Matriz Dinámica de Control no Lineal, NDMC. El primer objetivo de este trabajo consiste en implementar una metodología para la identificación de sistemas no lineales usando series de Volterra truncadas; proye...

Examining Potential Boundary Bias Effects in Kernel Smoothing on Equating: An Introduction for the Adaptive and Epanechnikov Kernels.

Science.gov (United States)

Cid, Jaime A; von Davier, Alina A

2015-05-01

Test equating is a method of making the test scores from different test forms of the same assessment comparable. In the equating process, an important step involves continuizing the discrete score distributions. In traditional observed-score equating, this step is achieved using linear interpolation (or an unscaled uniform kernel). In the kernel equating (KE) process, this continuization process involves Gaussian kernel smoothing. It has been suggested that the choice of bandwidth in kernel smoothing controls the trade-off between variance and bias. In the literature on estimating density functions using kernels, it has also been suggested that the weight of the kernel depends on the sample size, and therefore, the resulting continuous distribution exhibits bias at the endpoints, where the samples are usually smaller. The purpose of this article is (a) to explore the potential effects of atypical scores (spikes) at the extreme ends (high and low) on the KE method in distributions with different degrees of asymmetry using the randomly equivalent groups equating design (Study I), and (b) to introduce the Epanechnikov and adaptive kernels as potential alternative approaches to reducing boundary bias in smoothing (Study II). The beta-binomial model is used to simulate observed scores reflecting a range of different skewed shapes.

Adaptive Kernel in Meshsize Boosting Algorithm in KDE ...

African Journals Online (AJOL)

This paper proposes the use of adaptive kernel in a meshsize boosting algorithm in kernel density estimation. The algorithm is a bias reduction scheme like other existing schemes but uses adaptive kernel instead of the regular fixed kernels. An empirical study for this scheme is conducted and the findings are comparatively ...

Stabilization of Large Generalized Lotka-Volterra Foodwebs By Evolutionary Feedback

Science.gov (United States)

Ackland, G. J.; Gallagher, I. D.

2004-10-01

Conventional ecological models show that complexity destabilizes foodwebs, suggesting that foodwebs should have neither large numbers of species nor a large number of interactions. However, in nature the opposite appears to be the case. Here we show that if the interactions between species are allowed to evolve within a generalized Lotka-Volterra model such stabilizing feedbacks and weak interactions emerge automatically. Moreover, we show that trophic levels also emerge spontaneously from the evolutionary approach, and the efficiency of the unperturbed ecosystem increases with time. The key to stability in large foodwebs appears to arise not from complexity perse but from evolution at the level of the ecosystem which favors stabilizing (negative) feedbacks.

A kernel version of multivariate alteration detection

DEFF Research Database (Denmark)

Nielsen, Allan Aasbjerg; Vestergaard, Jacob Schack

2013-01-01

Based on the established methods kernel canonical correlation analysis and multivariate alteration detection we introduce a kernel version of multivariate alteration detection. A case study with SPOT HRV data shows that the kMAD variates focus on extreme change observations.......Based on the established methods kernel canonical correlation analysis and multivariate alteration detection we introduce a kernel version of multivariate alteration detection. A case study with SPOT HRV data shows that the kMAD variates focus on extreme change observations....

Implementing Kernel Methods Incrementally by Incremental Nonlinear Projection Trick.

Science.gov (United States)

Kwak, Nojun

2016-05-20

Recently, the nonlinear projection trick (NPT) was introduced enabling direct computation of coordinates of samples in a reproducing kernel Hilbert space. With NPT, any machine learning algorithm can be extended to a kernel version without relying on the so called kernel trick. However, NPT is inherently difficult to be implemented incrementally because an ever increasing kernel matrix should be treated as additional training samples are introduced. In this paper, an incremental version of the NPT (INPT) is proposed based on the observation that the centerization step in NPT is unnecessary. Because the proposed INPT does not change the coordinates of the old data, the coordinates obtained by INPT can directly be used in any incremental methods to implement a kernel version of the incremental methods. The effectiveness of the INPT is shown by applying it to implement incremental versions of kernel methods such as, kernel singular value decomposition, kernel principal component analysis, and kernel discriminant analysis which are utilized for problems of kernel matrix reconstruction, letter classification, and face image retrieval, respectively.

Uranium kernel formation via internal gelation

International Nuclear Information System (INIS)

Hunt, R.D.; Collins, J.L.

2004-01-01

In the 1970s and 1980s, U.S. Department of Energy (DOE) conducted numerous studies on the fabrication of nuclear fuel particles using the internal gelation process. These amorphous kernels were prone to flaking or breaking when gases tried to escape from the kernels during calcination and sintering. These earlier kernels would not meet today's proposed specifications for reactor fuel. In the interim, the internal gelation process has been used to create hydrous metal oxide microspheres for the treatment of nuclear waste. With the renewed interest in advanced nuclear fuel by the DOE, the lessons learned from the nuclear waste studies were recently applied to the fabrication of uranium kernels, which will become tri-isotropic (TRISO) fuel particles. These process improvements included equipment modifications, small changes to the feed formulations, and a new temperature profile for the calcination and sintering. The modifications to the laboratory-scale equipment and its operation as well as small changes to the feed composition increased the product yield from 60% to 80%-99%. The new kernels were substantially less glassy, and no evidence of flaking was found. Finally, key process parameters were identified, and their effects on the uranium microspheres and kernels are discussed. (orig.)

Kernel learning at the first level of inference.

Science.gov (United States)

Cawley, Gavin C; Talbot, Nicola L C

2014-05-01

Kernel learning methods, whether Bayesian or frequentist, typically involve multiple levels of inference, with the coefficients of the kernel expansion being determined at the first level and the kernel and regularisation parameters carefully tuned at the second level, a process known as model selection. Model selection for kernel machines is commonly performed via optimisation of a suitable model selection criterion, often based on cross-validation or theoretical performance bounds. However, if there are a large number of kernel parameters, as for instance in the case of automatic relevance determination (ARD), there is a substantial risk of over-fitting the model selection criterion, resulting in poor generalisation performance. In this paper we investigate the possibility of learning the kernel, for the Least-Squares Support Vector Machine (LS-SVM) classifier, at the first level of inference, i.e. parameter optimisation. The kernel parameters and the coefficients of the kernel expansion are jointly optimised at the first level of inference, minimising a training criterion with an additional regularisation term acting on the kernel parameters. The key advantage of this approach is that the values of only two regularisation parameters need be determined in model selection, substantially alleviating the problem of over-fitting the model selection criterion. The benefits of this approach are demonstrated using a suite of synthetic and real-world binary classification benchmark problems, where kernel learning at the first level of inference is shown to be statistically superior to the conventional approach, improves on our previous work (Cawley and Talbot, 2007) and is competitive with Multiple Kernel Learning approaches, but with reduced computational expense. Copyright © 2014 Elsevier Ltd. All rights reserved.

Global Polynomial Kernel Hazard Estimation

DEFF Research Database (Denmark)

Hiabu, Munir; Miranda, Maria Dolores Martínez; Nielsen, Jens Perch

2015-01-01

This paper introduces a new bias reducing method for kernel hazard estimation. The method is called global polynomial adjustment (GPA). It is a global correction which is applicable to any kernel hazard estimator. The estimator works well from a theoretical point of view as it asymptotically redu...

Quantum tomography, phase-space observables and generalized Markov kernels

International Nuclear Information System (INIS)

Pellonpaeae, Juha-Pekka

2009-01-01

We construct a generalized Markov kernel which transforms the observable associated with the homodyne tomography into a covariant phase-space observable with a regular kernel state. Illustrative examples are given in the cases of a 'Schroedinger cat' kernel state and the Cahill-Glauber s-parametrized distributions. Also we consider an example of a kernel state when the generalized Markov kernel cannot be constructed.

Formal Derivation of Lotka-Volterra-Haken Amplitude Equations of Task-Related Brain Activity in Multiple, Consecutively Performed Tasks

Science.gov (United States)

Frank, T. D.

The Lotka-Volterra-Haken equations have been frequently used in ecology and pattern formation. Recently, the equations have been proposed by several research groups as amplitude equations for task-related patterns of brain activity. In this theoretical study, the focus is on the circular causality aspect of pattern formation systems as formulated within the framework of synergetics. Accordingly, the stable modes of a pattern formation system inhibit the unstable modes, whereas the unstable modes excite the stable modes. Using this circular causality principle it is shown that under certain conditions the Lotka-Volterra-Haken amplitude equations can be derived from a general model of brain activity akin to the Wilson-Cowan model. The model captures the amplitude dynamics for brain activity patterns in experiments involving several consecutively performed multiple-choice tasks. This is explicitly demonstrated for two-choice tasks involving grasping and walking. A comment on the relevance of the theoretical framework for clinical psychology and schizophrenia is given as well.

Single pass kernel k-means clustering method

Indian Academy of Sciences (India)

paper proposes a simple and faster version of the kernel k-means clustering ... It has been considered as an important tool ... On the other hand, kernel-based clustering methods, like kernel k-means clus- ..... able at the UCI machine learning repository (Murphy 1994). ... All the data sets have only numeric valued features.

Relationship between attenuation coefficients and dose-spread kernels

International Nuclear Information System (INIS)

Boyer, A.L.

1988-01-01

Dose-spread kernels can be used to calculate the dose distribution in a photon beam by convolving the kernel with the primary fluence distribution. The theoretical relationships between various types and components of dose-spread kernels relative to photon attenuation coefficients are explored. These relations can be valuable as checks on the conservation of energy by dose-spread kernels calculated by analytic or Monte Carlo methods

Mixture Density Mercer Kernels: A Method to Learn Kernels

Data.gov (United States)

National Aeronautics and Space Administration — This paper presents a method of generating Mercer Kernels from an ensemble of probabilistic mixture models, where each mixture model is generated from a Bayesian...

Integral equations with contrasting kernels

Directory of Open Access Journals (Sweden)

Theodore Burton

2008-01-01

Full Text Available In this paper we study integral equations of the form $x(t=a(t-\\int^t_0 C(t,sx(sds$ with sharply contrasting kernels typified by $C^*(t,s=\\ln (e+(t-s$ and $D^*(t,s=[1+(t-s]^{-1}$. The kernel assigns a weight to $x(s$ and these kernels have exactly opposite effects of weighting. Each type is well represented in the literature. Our first project is to show that for $a\\in L^2[0,\\infty$, then solutions are largely indistinguishable regardless of which kernel is used. This is a surprise and it leads us to study the essential differences. In fact, those differences become large as the magnitude of $a(t$ increases. The form of the kernel alone projects necessary conditions concerning the magnitude of $a(t$ which could result in bounded solutions. Thus, the next project is to determine how close we can come to proving that the necessary conditions are also sufficient. The third project is to show that solutions will be bounded for given conditions on $C$ regardless of whether $a$ is chosen large or small; this is important in real-world problems since we would like to have $a(t$ as the sum of a bounded, but badly behaved function, and a large well behaved function.

Kernel methods in orthogonalization of multi- and hypervariate data

DEFF Research Database (Denmark)

Nielsen, Allan Aasbjerg

2009-01-01

A kernel version of maximum autocorrelation factor (MAF) analysis is described very briefly and applied to change detection in remotely sensed hyperspectral image (HyMap) data. The kernel version is based on a dual formulation also termed Q-mode analysis in which the data enter into the analysis...... via inner products in the Gram matrix only. In the kernel version the inner products are replaced by inner products between nonlinear mappings into higher dimensional feature space of the original data. Via kernel substitution also known as the kernel trick these inner products between the mappings...... are in turn replaced by a kernel function and all quantities needed in the analysis are expressed in terms of this kernel function. This means that we need not know the nonlinear mappings explicitly. Kernel PCA and MAF analysis handle nonlinearities by implicitly transforming data into high (even infinite...

Improved prediction of drug-target interactions using regularized least squares integrating with kernel fusion technique

Energy Technology Data Exchange (ETDEWEB)

Hao, Ming; Wang, Yanli, E-mail: ywang@ncbi.nlm.nih.gov; Bryant, Stephen H., E-mail: bryant@ncbi.nlm.nih.gov

2016-02-25

Identification of drug-target interactions (DTI) is a central task in drug discovery processes. In this work, a simple but effective regularized least squares integrating with nonlinear kernel fusion (RLS-KF) algorithm is proposed to perform DTI predictions. Using benchmark DTI datasets, our proposed algorithm achieves the state-of-the-art results with area under precision–recall curve (AUPR) of 0.915, 0.925, 0.853 and 0.909 for enzymes, ion channels (IC), G protein-coupled receptors (GPCR) and nuclear receptors (NR) based on 10 fold cross-validation. The performance can further be improved by using a recalculated kernel matrix, especially for the small set of nuclear receptors with AUPR of 0.945. Importantly, most of the top ranked interaction predictions can be validated by experimental data reported in the literature, bioassay results in the PubChem BioAssay database, as well as other previous studies. Our analysis suggests that the proposed RLS-KF is helpful for studying DTI, drug repositioning as well as polypharmacology, and may help to accelerate drug discovery by identifying novel drug targets. - Graphical abstract: Flowchart of the proposed RLS-KF algorithm for drug-target interaction predictions. - Highlights: • A nonlinear kernel fusion algorithm is proposed to perform drug-target interaction predictions. • Performance can further be improved by using the recalculated kernel. • Top predictions can be validated by experimental data.

Improved prediction of drug-target interactions using regularized least squares integrating with kernel fusion technique

International Nuclear Information System (INIS)

Hao, Ming; Wang, Yanli; Bryant, Stephen H.

2016-01-01

Identification of drug-target interactions (DTI) is a central task in drug discovery processes. In this work, a simple but effective regularized least squares integrating with nonlinear kernel fusion (RLS-KF) algorithm is proposed to perform DTI predictions. Using benchmark DTI datasets, our proposed algorithm achieves the state-of-the-art results with area under precision–recall curve (AUPR) of 0.915, 0.925, 0.853 and 0.909 for enzymes, ion channels (IC), G protein-coupled receptors (GPCR) and nuclear receptors (NR) based on 10 fold cross-validation. The performance can further be improved by using a recalculated kernel matrix, especially for the small set of nuclear receptors with AUPR of 0.945. Importantly, most of the top ranked interaction predictions can be validated by experimental data reported in the literature, bioassay results in the PubChem BioAssay database, as well as other previous studies. Our analysis suggests that the proposed RLS-KF is helpful for studying DTI, drug repositioning as well as polypharmacology, and may help to accelerate drug discovery by identifying novel drug targets. - Graphical abstract: Flowchart of the proposed RLS-KF algorithm for drug-target interaction predictions. - Highlights: • A nonlinear kernel fusion algorithm is proposed to perform drug-target interaction predictions. • Performance can further be improved by using the recalculated kernel. • Top predictions can be validated by experimental data.

Kernel based subspace projection of near infrared hyperspectral images of maize kernels

DEFF Research Database (Denmark)

Larsen, Rasmus; Arngren, Morten; Hansen, Per Waaben

2009-01-01

In this paper we present an exploratory analysis of hyper- spectral 900-1700 nm images of maize kernels. The imaging device is a line scanning hyper spectral camera using a broadband NIR illumi- nation. In order to explore the hyperspectral data we compare a series of subspace projection methods ......- tor transform outperform the linear methods as well as kernel principal components in producing interesting projections of the data.......In this paper we present an exploratory analysis of hyper- spectral 900-1700 nm images of maize kernels. The imaging device is a line scanning hyper spectral camera using a broadband NIR illumi- nation. In order to explore the hyperspectral data we compare a series of subspace projection methods...... including principal component analysis and maximum autocorrelation factor analysis. The latter utilizes the fact that interesting phenomena in images exhibit spatial autocorrelation. However, linear projections often fail to grasp the underlying variability on the data. Therefore we propose to use so...

Sparse Event Modeling with Hierarchical Bayesian Kernel Methods

Science.gov (United States)

2016-01-05

SECURITY CLASSIFICATION OF: The research objective of this proposal was to develop a predictive Bayesian kernel approach to model count data based on...several predictive variables. Such an approach, which we refer to as the Poisson Bayesian kernel model, is able to model the rate of occurrence of... kernel methods made use of: (i) the Bayesian property of improving predictive accuracy as data are dynamically obtained, and (ii) the kernel function

The Classification of Diabetes Mellitus Using Kernel k-means

Science.gov (United States)

Alamsyah, M.; Nafisah, Z.; Prayitno, E.; Afida, A. M.; Imah, E. M.

2018-01-01

Diabetes Mellitus is a metabolic disorder which is characterized by chronicle hypertensive glucose. Automatics detection of diabetes mellitus is still challenging. This study detected diabetes mellitus by using kernel k-Means algorithm. Kernel k-means is an algorithm which was developed from k-means algorithm. Kernel k-means used kernel learning that is able to handle non linear separable data; where it differs with a common k-means. The performance of kernel k-means in detecting diabetes mellitus is also compared with SOM algorithms. The experiment result shows that kernel k-means has good performance and a way much better than SOM.

Evaluating the Application of Tissue-Specific Dose Kernels Instead of Water Dose Kernels in Internal Dosimetry : A Monte Carlo Study

NARCIS (Netherlands)

Moghadam, Maryam Khazaee; Asl, Alireza Kamali; Geramifar, Parham; Zaidi, Habib

2016-01-01

Purpose: The aim of this work is to evaluate the application of tissue-specific dose kernels instead of water dose kernels to improve the accuracy of patient-specific dosimetry by taking tissue heterogeneities into consideration. Materials and Methods: Tissue-specific dose point kernels (DPKs) and

Parsimonious Wavelet Kernel Extreme Learning Machine

Directory of Open Access Journals (Sweden)

Wang Qin

2015-11-01

Full Text Available In this study, a parsimonious scheme for wavelet kernel extreme learning machine (named PWKELM was introduced by combining wavelet theory and a parsimonious algorithm into kernel extreme learning machine (KELM. In the wavelet analysis, bases that were localized in time and frequency to represent various signals effectively were used. Wavelet kernel extreme learning machine (WELM maximized its capability to capture the essential features in “frequency-rich” signals. The proposed parsimonious algorithm also incorporated significant wavelet kernel functions via iteration in virtue of Householder matrix, thus producing a sparse solution that eased the computational burden and improved numerical stability. The experimental results achieved from the synthetic dataset and a gas furnace instance demonstrated that the proposed PWKELM is efficient and feasible in terms of improving generalization accuracy and real time performance.

Solutions of First-Order Volterra Type Linear Integrodifferential Equations by Collocation Method

Directory of Open Access Journals (Sweden)

Olumuyiwa A. Agbolade

2017-01-01

Full Text Available The numerical solutions of linear integrodifferential equations of Volterra type have been considered. Power series is used as the basis polynomial to approximate the solution of the problem. Furthermore, standard and Chebyshev-Gauss-Lobatto collocation points were, respectively, chosen to collocate the approximate solution. Numerical experiments are performed on some sample problems already solved by homotopy analysis method and finite difference methods. Comparison of the absolute error is obtained from the present method and those from aforementioned methods. It is also observed that the absolute errors obtained are very low establishing convergence and computational efficiency.

Difference between standard and quasi-conformal BFKL kernels

International Nuclear Information System (INIS)

Fadin, V.S.; Fiore, R.; Papa, A.

2012-01-01

As it was recently shown, the colour singlet BFKL kernel, taken in Möbius representation in the space of impact parameters, can be written in quasi-conformal shape, which is unbelievably simple compared with the conventional form of the BFKL kernel in momentum space. It was also proved that the total kernel is completely defined by its Möbius representation. In this paper we calculated the difference between standard and quasi-conformal BFKL kernels in momentum space and discovered that it is rather simple. Therefore we come to the conclusion that the simplicity of the quasi-conformal kernel is caused mainly by using the impact parameter space.

A laser optical method for detecting corn kernel defects

Energy Technology Data Exchange (ETDEWEB)

Gunasekaran, S.; Paulsen, M. R.; Shove, G. C.

1984-01-01

An opto-electronic instrument was developed to examine individual corn kernels and detect various kernel defects according to reflectance differences. A low power helium-neon (He-Ne) laser (632.8 nm, red light) was used as the light source in the instrument. Reflectance from good and defective parts of corn kernel surfaces differed by approximately 40%. Broken, chipped, and starch-cracked kernels were detected with nearly 100% accuracy; while surface-split kernels were detected with about 80% accuracy. (author)

Kernel maximum autocorrelation factor and minimum noise fraction transformations

DEFF Research Database (Denmark)

Nielsen, Allan Aasbjerg

2010-01-01

in hyperspectral HyMap scanner data covering a small agricultural area, and 3) maize kernel inspection. In the cases shown, the kernel MAF/MNF transformation performs better than its linear counterpart as well as linear and kernel PCA. The leading kernel MAF/MNF variates seem to possess the ability to adapt...

Unified heat kernel regression for diffusion, kernel smoothing and wavelets on manifolds and its application to mandible growth modeling in CT images.

Science.gov (United States)

Chung, Moo K; Qiu, Anqi; Seo, Seongho; Vorperian, Houri K

2015-05-01

We present a novel kernel regression framework for smoothing scalar surface data using the Laplace-Beltrami eigenfunctions. Starting with the heat kernel constructed from the eigenfunctions, we formulate a new bivariate kernel regression framework as a weighted eigenfunction expansion with the heat kernel as the weights. The new kernel method is mathematically equivalent to isotropic heat diffusion, kernel smoothing and recently popular diffusion wavelets. The numerical implementation is validated on a unit sphere using spherical harmonics. As an illustration, the method is applied to characterize the localized growth pattern of mandible surfaces obtained in CT images between ages 0 and 20 by regressing the length of displacement vectors with respect to a surface template. Copyright © 2015 Elsevier B.V. All rights reserved.

Digital signal processing with kernel methods

CERN Document Server

Rojo-Alvarez, José Luis; Muñoz-Marí, Jordi; Camps-Valls, Gustavo

2018-01-01

A realistic and comprehensive review of joint approaches to machine learning and signal processing algorithms, with application to communications, multimedia, and biomedical engineering systems Digital Signal Processing with Kernel Methods reviews the milestones in the mixing of classical digital signal processing models and advanced kernel machines statistical learning tools. It explains the fundamental concepts from both fields of machine learning and signal processing so that readers can quickly get up to speed in order to begin developing the concepts and application software in their own research. Digital Signal Processing with Kernel Methods provides a comprehensive overview of kernel methods in signal processing, without restriction to any application field. It also offers example applications and detailed benchmarking experiments with real and synthetic datasets throughout. Readers can find further worked examples with Matlab source code on a website developed by the authors. * Presents the necess...

Higher-Order Hybrid Gaussian Kernel in Meshsize Boosting Algorithm

African Journals Online (AJOL)

In this paper, we shall use higher-order hybrid Gaussian kernel in a meshsize boosting algorithm in kernel density estimation. Bias reduction is guaranteed in this scheme like other existing schemes but uses the higher-order hybrid Gaussian kernel instead of the regular fixed kernels. A numerical verification of this scheme ...

Adaptive Kernel In The Bootstrap Boosting Algorithm In KDE ...

African Journals Online (AJOL)

This paper proposes the use of adaptive kernel in a bootstrap boosting algorithm in kernel density estimation. The algorithm is a bias reduction scheme like other existing schemes but uses adaptive kernel instead of the regular fixed kernels. An empirical study for this scheme is conducted and the findings are comparatively ...

Windows Vista Kernel-Mode: Functions, Security Enhancements and Flaws

Directory of Open Access Journals (Sweden)

Mohammed D. ABDULMALIK

2008-06-01

Full Text Available Microsoft has made substantial enhancements to the kernel of the Microsoft Windows Vista operating system. Kernel improvements are significant because the kernel provides low-level operating system functions, including thread scheduling, interrupt and exception dispatching, multiprocessor synchronization, and a set of routines and basic objects.This paper describes some of the kernel security enhancements for 64-bit edition of Windows Vista. We also point out some weakness areas (flaws that can be attacked by malicious leading to compromising the kernel.

Nonlinear adaptive synchronization rule for identification of a large amount of parameters in dynamical models

International Nuclear Information System (INIS)

Ma Huanfei; Lin Wei

2009-01-01

The existing adaptive synchronization technique based on the stability theory and invariance principle of dynamical systems, though theoretically proved to be valid for parameters identification in specific models, is always showing slow convergence rate and even failed in practice when the number of parameters becomes large. Here, for parameters update, a novel nonlinear adaptive rule is proposed to accelerate the rate. Its feasibility is validated by analytical arguments as well as by specific parameters identification in the Lotka-Volterra model with multiple species. Two adjustable factors in this rule influence the identification accuracy, which means that a proper choice of these factors leads to an optimal performance of this rule. In addition, a feasible method for avoiding the occurrence of the approximate linear dependence among terms with parameters on the synchronized manifold is also proposed.

Entire solutions of a diffusive and competitive Lotka–Volterra type system with nonlocal delays

International Nuclear Information System (INIS)

Wang, Mingxin; Lv, Guangying

2010-01-01

This paper is concerned with the entire solution of a diffusive and competitive Lotka–Volterra type system with nonlocal delays. The existence of the entire solution is proved by transforming the system with nonlocal delays to a four-dimensional system without delay and using the comparing argument and the sub-super-solution method. Here an entire solution means a classical solution defined for all space and time variables, which behaves as two wave fronts coming from both sides of the x-axis

Dynamics of a Lotka-Volterra type model with applications to marine phage population dynamics

International Nuclear Information System (INIS)

Gavin, C; Pokrovskii, A; Prentice, M; Sobolev, V

2006-01-01

The famous Lotka-Volterra equations play a fundamental role in the mathematical modeling of various ecological and chemical systems. A new modification of these equations has been recently suggested to model the structure of marine phage populations, which are the most abundant biological entities in the biosphere. The purpose of the paper is: (i) to make some methodical remarks concerning this modification; (ii) to discuss new types of canards which arise naturally in this context; (iii) to present results of some numerical experiments

Generalization Performance of Regularized Ranking With Multiscale Kernels.

Science.gov (United States)

Zhou, Yicong; Chen, Hong; Lan, Rushi; Pan, Zhibin

2016-05-01

The regularized kernel method for the ranking problem has attracted increasing attentions in machine learning. The previous regularized ranking algorithms are usually based on reproducing kernel Hilbert spaces with a single kernel. In this paper, we go beyond this framework by investigating the generalization performance of the regularized ranking with multiscale kernels. A novel ranking algorithm with multiscale kernels is proposed and its representer theorem is proved. We establish the upper bound of the generalization error in terms of the complexity of hypothesis spaces. It shows that the multiscale ranking algorithm can achieve satisfactory learning rates under mild conditions. Experiments demonstrate the effectiveness of the proposed method for drug discovery and recommendation tasks.

The influence of noise on nonlinear time series detection based on Volterra-Wiener-Korenberg model

Energy Technology Data Exchange (ETDEWEB)

Lei Min [State Key Laboratory of Vibration, Shock and Noise, Shanghai Jiao Tong University, Shanghai 200030 (China)], E-mail: leimin@sjtu.edu.cn; Meng Guang [State Key Laboratory of Vibration, Shock and Noise, Shanghai Jiao Tong University, Shanghai 200030 (China)

2008-04-15

This paper studies the influence of noises on Volterra-Wiener-Korenberg (VWK) nonlinear test model. Our numerical results reveal that different types of noises lead to different behavior of VWK model detection. For dynamic noise, it is difficult to distinguish chaos from nonchaotic but nonlinear determinism. For time series, measure noise has no impact on chaos determinism detection. This paper also discusses various behavior of VWK model detection with surrogate data for different noises.

Multineuron spike train analysis with R-convolution linear combination kernel.

Science.gov (United States)

Tezuka, Taro

2018-06-01

A spike train kernel provides an effective way of decoding information represented by a spike train. Some spike train kernels have been extended to multineuron spike trains, which are simultaneously recorded spike trains obtained from multiple neurons. However, most of these multineuron extensions were carried out in a kernel-specific manner. In this paper, a general framework is proposed for extending any single-neuron spike train kernel to multineuron spike trains, based on the R-convolution kernel. Special subclasses of the proposed R-convolution linear combination kernel are explored. These subclasses have a smaller number of parameters and make optimization tractable when the size of data is limited. The proposed kernel was evaluated using Gaussian process regression for multineuron spike trains recorded from an animal brain. It was compared with the sum kernel and the population Spikernel, which are existing ways of decoding multineuron spike trains using kernels. The results showed that the proposed approach performs better than these kernels and also other commonly used neural decoding methods. Copyright © 2018 Elsevier Ltd. All rights reserved.

An analysis of 1-D smoothed particle hydrodynamics kernels

International Nuclear Information System (INIS)

Fulk, D.A.; Quinn, D.W.

1996-01-01

In this paper, the smoothed particle hydrodynamics (SPH) kernel is analyzed, resulting in measures of merit for one-dimensional SPH. Various methods of obtaining an objective measure of the quality and accuracy of the SPH kernel are addressed. Since the kernel is the key element in the SPH methodology, this should be of primary concern to any user of SPH. The results of this work are two measures of merit, one for smooth data and one near shocks. The measure of merit for smooth data is shown to be quite accurate and a useful delineator of better and poorer kernels. The measure of merit for non-smooth data is not quite as accurate, but results indicate the kernel is much less important for these types of problems. In addition to the theory, 20 kernels are analyzed using the measure of merit demonstrating the general usefulness of the measure of merit and the individual kernels. In general, it was decided that bell-shaped kernels perform better than other shapes. 12 refs., 16 figs., 7 tabs

Putting Priors in Mixture Density Mercer Kernels

Science.gov (United States)

Srivastava, Ashok N.; Schumann, Johann; Fischer, Bernd

2004-01-01

This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly infinite dimensional feature space. We describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using predefined kernels. These data adaptive kernels can en- code prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS). The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains template for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic- algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code. The results show that the Mixture Density Mercer-Kernel described here outperforms tree-based classification in distinguishing high-redshift galaxies from low- redshift galaxies by approximately 16% on test data, bagged trees by approximately 7%, and bagged trees built on a much larger sample of data by approximately 2%.

NLO corrections to the Kernel of the BKP-equations

Energy Technology Data Exchange (ETDEWEB)

Bartels, J. [Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik; Fadin, V.S. [Budker Institute of Nuclear Physics, Novosibirsk (Russian Federation); Novosibirskij Gosudarstvennyj Univ., Novosibirsk (Russian Federation); Lipatov, L.N. [Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik; Petersburg Nuclear Physics Institute, Gatchina, St. Petersburg (Russian Federation); Vacca, G.P. [INFN, Sezione di Bologna (Italy)

2012-10-02

We present results for the NLO kernel of the BKP equations for composite states of three reggeized gluons in the Odderon channel, both in QCD and in N=4 SYM. The NLO kernel consists of the NLO BFKL kernel in the color octet representation and the connected 3{yields}3 kernel, computed in the tree approximation.

A Fast and Simple Graph Kernel for RDF

NARCIS (Netherlands)

de Vries, G.K.D.; de Rooij, S.

2013-01-01

In this paper we study a graph kernel for RDF based on constructing a tree for each instance and counting the number of paths in that tree. In our experiments this kernel shows comparable classification performance to the previously introduced intersection subtree kernel, but is significantly faster

An SVM model with hybrid kernels for hydrological time series

Science.gov (United States)

Wang, C.; Wang, H.; Zhao, X.; Xie, Q.

2017-12-01

Support Vector Machine (SVM) models have been widely applied to the forecast of climate/weather and its impact on other environmental variables such as hydrologic response to climate/weather. When using SVM, the choice of the kernel function plays the key role. Conventional SVM models mostly use one single type of kernel function, e.g., radial basis kernel function. Provided that there are several featured kernel functions available, each having its own advantages and drawbacks, a combination of these kernel functions may give more flexibility and robustness to SVM approach, making it suitable for a wide range of application scenarios. This paper presents such a linear combination of radial basis kernel and polynomial kernel for the forecast of monthly flowrate in two gaging stations using SVM approach. The results indicate significant improvement in the accuracy of predicted series compared to the approach with either individual kernel function, thus demonstrating the feasibility and advantages of such hybrid kernel approach for SVM applications.

Kernel based eigenvalue-decomposition methods for analysing ham

DEFF Research Database (Denmark)

Christiansen, Asger Nyman; Nielsen, Allan Aasbjerg; Møller, Flemming

2010-01-01

methods, such as PCA, MAF or MNF. We therefore investigated the applicability of kernel based versions of these transformation. This meant implementing the kernel based methods and developing new theory, since kernel based MAF and MNF is not described in the literature yet. The traditional methods only...... have two factors that are useful for segmentation and none of them can be used to segment the two types of meat. The kernel based methods have a lot of useful factors and they are able to capture the subtle differences in the images. This is illustrated in Figure 1. You can see a comparison of the most...... useful factor of PCA and kernel based PCA respectively in Figure 2. The factor of the kernel based PCA turned out to be able to segment the two types of meat and in general that factor is much more distinct, compared to the traditional factor. After the orthogonal transformation a simple thresholding...

Reduced multiple empirical kernel learning machine.

Science.gov (United States)

Wang, Zhe; Lu, MingZhe; Gao, Daqi

2015-02-01

Multiple kernel learning (MKL) is demonstrated to be flexible and effective in depicting heterogeneous data sources since MKL can introduce multiple kernels rather than a single fixed kernel into applications. However, MKL would get a high time and space complexity in contrast to single kernel learning, which is not expected in real-world applications. Meanwhile, it is known that the kernel mapping ways of MKL generally have two forms including implicit kernel mapping and empirical kernel mapping (EKM), where the latter is less attracted. In this paper, we focus on the MKL with the EKM, and propose a reduced multiple empirical kernel learning machine named RMEKLM for short. To the best of our knowledge, it is the first to reduce both time and space complexity of the MKL with EKM. Different from the existing MKL, the proposed RMEKLM adopts the Gauss Elimination technique to extract a set of feature vectors, which is validated that doing so does not lose much information of the original feature space. Then RMEKLM adopts the extracted feature vectors to span a reduced orthonormal subspace of the feature space, which is visualized in terms of the geometry structure. It can be demonstrated that the spanned subspace is isomorphic to the original feature space, which means that the dot product of two vectors in the original feature space is equal to that of the two corresponding vectors in the generated orthonormal subspace. More importantly, the proposed RMEKLM brings a simpler computation and meanwhile needs a less storage space, especially in the processing of testing. Finally, the experimental results show that RMEKLM owns a much efficient and effective performance in terms of both complexity and classification. The contributions of this paper can be given as follows: (1) by mapping the input space into an orthonormal subspace, the geometry of the generated subspace is visualized; (2) this paper first reduces both the time and space complexity of the EKM-based MKL; (3

Kernel principal component analysis for change detection

DEFF Research Database (Denmark)

Nielsen, Allan Aasbjerg; Morton, J.C.

2008-01-01

region acquired at two different time points. If change over time does not dominate the scene, the projection of the original two bands onto the second eigenvector will show change over time. In this paper a kernel version of PCA is used to carry out the analysis. Unlike ordinary PCA, kernel PCA...... with a Gaussian kernel successfully finds the change observations in a case where nonlinearities are introduced artificially....

Enhanced gluten properties in soft kernel durum wheat

Science.gov (United States)

Soft kernel durum wheat is a relatively recent development (Morris et al. 2011 Crop Sci. 51:114). The soft kernel trait exerts profound effects on kernel texture, flour milling including break flour yield, milling energy, and starch damage, and dough water absorption (DWA). With the caveat of reduce...

7 CFR 981.61 - Redetermination of kernel weight.

Science.gov (United States)

2010-01-01

... 7 Agriculture 8 2010-01-01 2010-01-01 false Redetermination of kernel weight. 981.61 Section 981... GROWN IN CALIFORNIA Order Regulating Handling Volume Regulation § 981.61 Redetermination of kernel weight. The Board, on the basis of reports by handlers, shall redetermine the kernel weight of almonds...

Adaptive metric kernel regression

DEFF Research Database (Denmark)

Goutte, Cyril; Larsen, Jan

2000-01-01

Kernel smoothing is a widely used non-parametric pattern recognition technique. By nature, it suffers from the curse of dimensionality and is usually difficult to apply to high input dimensions. In this contribution, we propose an algorithm that adapts the input metric used in multivariate...... regression by minimising a cross-validation estimate of the generalisation error. This allows to automatically adjust the importance of different dimensions. The improvement in terms of modelling performance is illustrated on a variable selection task where the adaptive metric kernel clearly outperforms...

Consistent Estimation of Pricing Kernels from Noisy Price Data

OpenAIRE

Vladislav Kargin

2003-01-01

If pricing kernels are assumed non-negative then the inverse problem of finding the pricing kernel is well-posed. The constrained least squares method provides a consistent estimate of the pricing kernel. When the data are limited, a new method is suggested: relaxed maximization of the relative entropy. This estimator is also consistent. Keywords: $\\epsilon$-entropy, non-parametric estimation, pricing kernel, inverse problems.

Stable Kernel Representations as Nonlinear Left Coprime Factorizations

NARCIS (Netherlands)

Paice, A.D.B.; Schaft, A.J. van der

1994-01-01

A representation of nonlinear systems based on the idea of representing the input-output pairs of the system as elements of the kernel of a stable operator has been recently introduced. This has been denoted the kernel representation of the system. In this paper it is demonstrated that the kernel

7 CFR 981.60 - Determination of kernel weight.

Science.gov (United States)

2010-01-01

... 7 Agriculture 8 2010-01-01 2010-01-01 false Determination of kernel weight. 981.60 Section 981.60... Regulating Handling Volume Regulation § 981.60 Determination of kernel weight. (a) Almonds for which settlement is made on kernel weight. All lots of almonds, whether shelled or unshelled, for which settlement...

End-use quality of soft kernel durum wheat

Science.gov (United States)

Kernel texture is a major determinant of end-use quality of wheat. Durum wheat has very hard kernels. We developed soft kernel durum wheat via Ph1b-mediated homoeologous recombination. The Hardness locus was transferred from Chinese Spring to Svevo durum wheat via back-crossing. ‘Soft Svevo’ had SKC...

Per-Sample Multiple Kernel Approach for Visual Concept Learning

Directory of Open Access Journals (Sweden)

Ling-Yu Duan

2010-01-01

Full Text Available Learning visual concepts from images is an important yet challenging problem in computer vision and multimedia research areas. Multiple kernel learning (MKL methods have shown great advantages in visual concept learning. As a visual concept often exhibits great appearance variance, a canonical MKL approach may not generate satisfactory results when a uniform kernel combination is applied over the input space. In this paper, we propose a per-sample multiple kernel learning (PS-MKL approach to take into account intraclass diversity for improving discrimination. PS-MKL determines sample-wise kernel weights according to kernel functions and training samples. Kernel weights as well as kernel-based classifiers are jointly learned. For efficient learning, PS-MKL employs a sample selection strategy. Extensive experiments are carried out over three benchmarking datasets of different characteristics including Caltech101, WikipediaMM, and Pascal VOC'07. PS-MKL has achieved encouraging performance, comparable to the state of the art, which has outperformed a canonical MKL.

Per-Sample Multiple Kernel Approach for Visual Concept Learning

Directory of Open Access Journals (Sweden)

Tian Yonghong

2010-01-01

Full Text Available Abstract Learning visual concepts from images is an important yet challenging problem in computer vision and multimedia research areas. Multiple kernel learning (MKL methods have shown great advantages in visual concept learning. As a visual concept often exhibits great appearance variance, a canonical MKL approach may not generate satisfactory results when a uniform kernel combination is applied over the input space. In this paper, we propose a per-sample multiple kernel learning (PS-MKL approach to take into account intraclass diversity for improving discrimination. PS-MKL determines sample-wise kernel weights according to kernel functions and training samples. Kernel weights as well as kernel-based classifiers are jointly learned. For efficient learning, PS-MKL employs a sample selection strategy. Extensive experiments are carried out over three benchmarking datasets of different characteristics including Caltech101, WikipediaMM, and Pascal VOC'07. PS-MKL has achieved encouraging performance, comparable to the state of the art, which has outperformed a canonical MKL.

Discrete non-parametric kernel estimation for global sensitivity analysis

International Nuclear Information System (INIS)

Senga Kiessé, Tristan; Ventura, Anne

2016-01-01

This work investigates the discrete kernel approach for evaluating the contribution of the variance of discrete input variables to the variance of model output, via analysis of variance (ANOVA) decomposition. Until recently only the continuous kernel approach has been applied as a metamodeling approach within sensitivity analysis framework, for both discrete and continuous input variables. Now the discrete kernel estimation is known to be suitable for smoothing discrete functions. We present a discrete non-parametric kernel estimator of ANOVA decomposition of a given model. An estimator of sensitivity indices is also presented with its asymtotic convergence rate. Some simulations on a test function analysis and a real case study from agricultural have shown that the discrete kernel approach outperforms the continuous kernel one for evaluating the contribution of moderate or most influential discrete parameters to the model output. - Highlights: • We study a discrete kernel estimation for sensitivity analysis of a model. • A discrete kernel estimator of ANOVA decomposition of the model is presented. • Sensitivity indices are calculated for discrete input parameters. • An estimator of sensitivity indices is also presented with its convergence rate. • An application is realized for improving the reliability of environmental models.

The diffusive Lotka-Volterra predator-prey system with delay.

Science.gov (United States)

Al Noufaey, K S; Marchant, T R; Edwards, M P

2015-12-01

Semi-analytical solutions for the diffusive Lotka-Volterra predator-prey system with delay are considered in one and two-dimensional domains. The Galerkin method is applied, which approximates the spatial structure of both the predator and prey populations. This approach is used to obtain a lower-order, ordinary differential delay equation model for the system of governing delay partial differential equations. Steady-state and transient solutions and the region of parameter space, in which Hopf bifurcations occur, are all found. In some cases simple linear expressions are found as approximations, to describe steady-state solutions and the Hopf parameter regions. An asymptotic analysis for the periodic solution near the Hopf bifurcation point is performed for the one-dimensional domain. An excellent agreement is shown in comparisons between semi-analytical and numerical solutions of the governing equations. Copyright © 2015 Elsevier Inc. All rights reserved.

Deep Restricted Kernel Machines Using Conjugate Feature Duality.

Science.gov (United States)

Suykens, Johan A K

2017-08-01

The aim of this letter is to propose a theory of deep restricted kernel machines offering new foundations for deep learning with kernel machines. From the viewpoint of deep learning, it is partially related to restricted Boltzmann machines, which are characterized by visible and hidden units in a bipartite graph without hidden-to-hidden connections and deep learning extensions as deep belief networks and deep Boltzmann machines. From the viewpoint of kernel machines, it includes least squares support vector machines for classification and regression, kernel principal component analysis (PCA), matrix singular value decomposition, and Parzen-type models. A key element is to first characterize these kernel machines in terms of so-called conjugate feature duality, yielding a representation with visible and hidden units. It is shown how this is related to the energy form in restricted Boltzmann machines, with continuous variables in a nonprobabilistic setting. In this new framework of so-called restricted kernel machine (RKM) representations, the dual variables correspond to hidden features. Deep RKM are obtained by coupling the RKMs. The method is illustrated for deep RKM, consisting of three levels with a least squares support vector machine regression level and two kernel PCA levels. In its primal form also deep feedforward neural networks can be trained within this framework.

Fibonacci collocation method with a residual error Function to solve linear Volterra integro differential equations

Directory of Open Access Journals (Sweden)

Salih Yalcinbas

2016-01-01

Full Text Available In this paper, a new collocation method based on the Fibonacci polynomials is introduced to solve the high-order linear Volterra integro-differential equations under the conditions. Numerical examples are included to demonstrate the applicability and validity of the proposed method and comparisons are made with the existing results. In addition, an error estimation based on the residual functions is presented for this method. The approximate solutions are improved by using this error estimation.

The Convergence Study of the Homotopy Analysis Method for Solving Nonlinear Volterra-Fredholm Integrodifferential Equations

Directory of Open Access Journals (Sweden)

Behzad Ghanbari

2014-01-01

Full Text Available We aim to study the convergence of the homotopy analysis method (HAM in short for solving special nonlinear Volterra-Fredholm integrodifferential equations. The sufficient condition for the convergence of the method is briefly addressed. Some illustrative examples are also presented to demonstrate the validity and applicability of the technique. Comparison of the obtained results HAM with exact solution shows that the method is reliable and capable of providing analytic treatment for solving such equations.

Improved modeling of clinical data with kernel methods.

Science.gov (United States)

Daemen, Anneleen; Timmerman, Dirk; Van den Bosch, Thierry; Bottomley, Cecilia; Kirk, Emma; Van Holsbeke, Caroline; Valentin, Lil; Bourne, Tom; De Moor, Bart

2012-02-01

Despite the rise of high-throughput technologies, clinical data such as age, gender and medical history guide clinical management for most diseases and examinations. To improve clinical management, available patient information should be fully exploited. This requires appropriate modeling of relevant parameters. When kernel methods are used, traditional kernel functions such as the linear kernel are often applied to the set of clinical parameters. These kernel functions, however, have their disadvantages due to the specific characteristics of clinical data, being a mix of variable types with each variable its own range. We propose a new kernel function specifically adapted to the characteristics of clinical data. The clinical kernel function provides a better representation of patients' similarity by equalizing the influence of all variables and taking into account the range r of the variables. Moreover, it is robust with respect to changes in r. Incorporated in a least squares support vector machine, the new kernel function results in significantly improved diagnosis, prognosis and prediction of therapy response. This is illustrated on four clinical data sets within gynecology, with an average increase in test area under the ROC curve (AUC) of 0.023, 0.021, 0.122 and 0.019, respectively. Moreover, when combining clinical parameters and expression data in three case studies on breast cancer, results improved overall with use of the new kernel function and when considering both data types in a weighted fashion, with a larger weight assigned to the clinical parameters. The increase in AUC with respect to a standard kernel function and/or unweighted data combination was maximum 0.127, 0.042 and 0.118 for the three case studies. For clinical data consisting of variables of different types, the proposed kernel function--which takes into account the type and range of each variable--has shown to be a better alternative for linear and non-linear classification problems

Lotka-Volterra system in a random environment

Science.gov (United States)

Dimentberg, Mikhail F.

2002-03-01

Classical Lotka-Volterra (LV) model for oscillatory behavior of population sizes of two interacting species (predator-prey or parasite-host pairs) is conservative. This may imply unrealistically high sensitivity of the system's behavior to environmental variations. Thus, a generalized LV model is considered with the equation for preys' reproduction containing the following additional terms: quadratic ``damping'' term that accounts for interspecies competition, and term with white-noise random variations of the preys' reproduction factor that simulates the environmental variations. An exact solution is obtained for the corresponding Fokker-Planck-Kolmogorov equation for stationary probability densities (PDF's) of the population sizes. It shows that both population sizes are independent γ-distributed stationary random processes. Increasing level of the environmental variations does not lead to extinction of the populations. However it may lead to an intermittent behavior, whereby one or both population sizes experience very rare and violent short pulses or outbreaks while remaining on a very low level most of the time. This intermittency is described analytically by direct use of the solutions for the PDF's as well as by applying theory of excursions of random functions and by predicting PDF of peaks in the predators' population size.

Phase portraits of cubic polynomial vector fields of Lotka-Volterra type having a rational first integral of degree 2

International Nuclear Information System (INIS)

Cairo, Laurent; Llibre, Jaume

2007-01-01

We classify all the global phase portraits of the cubic polynomial vector fields of Lotka-Volterra type having a rational first integral of degree 2. For such vector fields there are exactly 28 different global phase portraits in the Poincare disc up to a reversal of sense of all orbits

Linear and kernel methods for multi- and hypervariate change detection

DEFF Research Database (Denmark)

Nielsen, Allan Aasbjerg; Canty, Morton J.

2010-01-01

. Principal component analysis (PCA) as well as maximum autocorrelation factor (MAF) and minimum noise fraction (MNF) analyses of IR-MAD images, both linear and kernel-based (which are nonlinear), may further enhance change signals relative to no-change background. The kernel versions are based on a dual...... formulation, also termed Q-mode analysis, in which the data enter into the analysis via inner products in the Gram matrix only. In the kernel version the inner products of the original data are replaced by inner products between nonlinear mappings into higher dimensional feature space. Via kernel substitution......, also known as the kernel trick, these inner products between the mappings are in turn replaced by a kernel function and all quantities needed in the analysis are expressed in terms of the kernel function. This means that we need not know the nonlinear mappings explicitly. Kernel principal component...

Kernel based orthogonalization for change detection in hyperspectral images

DEFF Research Database (Denmark)

Nielsen, Allan Aasbjerg

function and all quantities needed in the analysis are expressed in terms of this kernel function. This means that we need not know the nonlinear mappings explicitly. Kernel PCA and MNF analyses handle nonlinearities by implicitly transforming data into high (even infinite) dimensional feature space via...... analysis all 126 spectral bands of the HyMap are included. Changes on the ground are most likely due to harvest having taken place between the two acquisitions and solar effects (both solar elevation and azimuth have changed). Both types of kernel analysis emphasize change and unlike kernel PCA, kernel MNF...

Mitigation of artifacts in rtm with migration kernel decomposition

KAUST Repository

Zhan, Ge; Schuster, Gerard T.

2012-01-01

The migration kernel for reverse-time migration (RTM) can be decomposed into four component kernels using Born scattering and migration theory. Each component kernel has a unique physical interpretation and can be interpreted differently

Semi-Supervised Kernel PCA

DEFF Research Database (Denmark)

Walder, Christian; Henao, Ricardo; Mørup, Morten

We present three generalisations of Kernel Principal Components Analysis (KPCA) which incorporate knowledge of the class labels of a subset of the data points. The first, MV-KPCA, penalises within class variances similar to Fisher discriminant analysis. The second, LSKPCA is a hybrid of least...... squares regression and kernel PCA. The final LR-KPCA is an iteratively reweighted version of the previous which achieves a sigmoid loss function on the labeled points. We provide a theoretical risk bound as well as illustrative experiments on real and toy data sets....

Adaptive Metric Kernel Regression

DEFF Research Database (Denmark)

Goutte, Cyril; Larsen, Jan

1998-01-01

Kernel smoothing is a widely used nonparametric pattern recognition technique. By nature, it suffers from the curse of dimensionality and is usually difficult to apply to high input dimensions. In this paper, we propose an algorithm that adapts the input metric used in multivariate regression...... by minimising a cross-validation estimate of the generalisation error. This allows one to automatically adjust the importance of different dimensions. The improvement in terms of modelling performance is illustrated on a variable selection task where the adaptive metric kernel clearly outperforms the standard...

21 CFR 176.350 - Tamarind seed kernel powder.

Science.gov (United States)

2010-04-01

... 21 Food and Drugs 3 2010-04-01 2009-04-01 true Tamarind seed kernel powder. 176.350 Section 176... Substances for Use Only as Components of Paper and Paperboard § 176.350 Tamarind seed kernel powder. Tamarind seed kernel powder may be safely used as a component of articles intended for use in producing...

Dense Medium Machine Processing Method for Palm Kernel/ Shell ...

African Journals Online (AJOL)

ADOWIE PERE

Cracked palm kernel is a mixture of kernels, broken shells, dusts and other impurities. In ... machine processing method using dense medium, a separator, a shell collector and a kernel .... efficiency, ease of maintenance and uniformity of.

Multivariate and semiparametric kernel regression

OpenAIRE

Härdle, Wolfgang; Müller, Marlene

1997-01-01

The paper gives an introduction to theory and application of multivariate and semiparametric kernel smoothing. Multivariate nonparametric density estimation is an often used pilot tool for examining the structure of data. Regression smoothing helps in investigating the association between covariates and responses. We concentrate on kernel smoothing using local polynomial fitting which includes the Nadaraya-Watson estimator. Some theory on the asymptotic behavior and bandwidth selection is pro...

Notes on the gamma kernel

DEFF Research Database (Denmark)

Barndorff-Nielsen, Ole E.

The density function of the gamma distribution is used as shift kernel in Brownian semistationary processes modelling the timewise behaviour of the velocity in turbulent regimes. This report presents exact and asymptotic properties of the second order structure function under such a model......, and relates these to results of von Karmann and Horwath. But first it is shown that the gamma kernel is interpretable as a Green’s function....

Automatic Modulation Recognition by Support Vector Machines Using Wavelet Kernel

Energy Technology Data Exchange (ETDEWEB)

Feng, X Z; Yang, J; Luo, F L; Chen, J Y; Zhong, X P [College of Mechatronic Engineering and Automation, National University of Defense Technology, Changsha (China)

2006-10-15

Automatic modulation identification plays a significant role in electronic warfare, electronic surveillance systems and electronic counter measure. The task of modulation recognition of communication signals is to determine the modulation type and signal parameters. In fact, automatic modulation identification can be range to an application of pattern recognition in communication field. The support vector machines (SVM) is a new universal learning machine which is widely used in the fields of pattern recognition, regression estimation and probability density. In this paper, a new method using wavelet kernel function was proposed, which maps the input vector xi into a high dimensional feature space F. In this feature space F, we can construct the optimal hyperplane that realizes the maximal margin in this space. That is to say, we can use SVM to classify the communication signals into two groups, namely analogue modulated signals and digitally modulated signals. In addition, computer simulation results are given at last, which show good performance of the method.

Automatic Modulation Recognition by Support Vector Machines Using Wavelet Kernel

International Nuclear Information System (INIS)

Feng, X Z; Yang, J; Luo, F L; Chen, J Y; Zhong, X P

2006-01-01

Automatic modulation identification plays a significant role in electronic warfare, electronic surveillance systems and electronic counter measure. The task of modulation recognition of communication signals is to determine the modulation type and signal parameters. In fact, automatic modulation identification can be range to an application of pattern recognition in communication field. The support vector machines (SVM) is a new universal learning machine which is widely used in the fields of pattern recognition, regression estimation and probability density. In this paper, a new method using wavelet kernel function was proposed, which maps the input vector xi into a high dimensional feature space F. In this feature space F, we can construct the optimal hyperplane that realizes the maximal margin in this space. That is to say, we can use SVM to classify the communication signals into two groups, namely analogue modulated signals and digitally modulated signals. In addition, computer simulation results are given at last, which show good performance of the method

The matrix realization of affine Jacobi varieties and the extended Lotka-Volterra lattice

International Nuclear Information System (INIS)

Inoue, Rei

2004-01-01

We study completely integrable Hamiltonian systems whose monodromy matrices are related to the representatives for the set of gauge equivalence classes M F of polynomial matrices. Let X be the algebraic curve given by the common characteristic equation for M F . We construct the isomorphism from the set of representatives to an affine part of the Jacobi variety of X. This variety corresponds to the invariant manifold of the system, where the Hamiltonian flow is linearized. As an application, we discuss the algebraic complete integrability of the extended Lotka-Volterra lattice with a periodic boundary condition

The inverse problem of determining several coefficients in a nonlinear Lotka–Volterra system

International Nuclear Information System (INIS)

Roques, Lionel; Cristofol, Michel

2012-01-01

In this paper, we prove a uniqueness result in the inverse problem of determining several non-constant coefficients of a system of two parabolic equations, which corresponds to a Lotka–Volterra competition model. Our result gives a sufficient condition for the uniqueness of the determination of four coefficients of the system. This sufficient condition only involves pointwise measurements of the solution (u, v) of the system and of the spatial derivative ∂u/∂x or ∂v/∂x of one component at a single point x 0 , during a time interval (0, ε). Our results are illustrated by numerical computations. (paper)

Calculation of the thermal neutron scattering kernel using the synthetic model. Pt. 2. Zero-order energy transfer kernel

International Nuclear Information System (INIS)

Drozdowicz, K.

1995-01-01

A comprehensive unified description of the application of Granada's Synthetic Model to the slow-neutron scattering by the molecular systems is continued. Detailed formulae for the zero-order energy transfer kernel are presented basing on the general formalism of the model. An explicit analytical formula for the total scattering cross section as a function of the incident neutron energy is also obtained. Expressions of the free gas model for the zero-order scattering kernel and for total scattering kernel are considered as a sub-case of the Synthetic Model. (author). 10 refs

Convergence of barycentric coordinates to barycentric kernels

KAUST Repository

Kosinka, Jiří

2016-02-12

We investigate the close correspondence between barycentric coordinates and barycentric kernels from the point of view of the limit process when finer and finer polygons converge to a smooth convex domain. We show that any barycentric kernel is the limit of a set of barycentric coordinates and prove that the convergence rate is quadratic. Our convergence analysis extends naturally to barycentric interpolants and mappings induced by barycentric coordinates and kernels. We verify our theoretical convergence results numerically on several examples.

Convergence of barycentric coordinates to barycentric kernels

KAUST Repository

Kosinka, Jiří ; Barton, Michael

2016-01-01

We investigate the close correspondence between barycentric coordinates and barycentric kernels from the point of view of the limit process when finer and finer polygons converge to a smooth convex domain. We show that any barycentric kernel is the limit of a set of barycentric coordinates and prove that the convergence rate is quadratic. Our convergence analysis extends naturally to barycentric interpolants and mappings induced by barycentric coordinates and kernels. We verify our theoretical convergence results numerically on several examples.

Hadamard Kernel SVM with applications for breast cancer outcome predictions.

Science.gov (United States)

Jiang, Hao; Ching, Wai-Ki; Cheung, Wai-Shun; Hou, Wenpin; Yin, Hong

2017-12-21

Breast cancer is one of the leading causes of deaths for women. It is of great necessity to develop effective methods for breast cancer detection and diagnosis. Recent studies have focused on gene-based signatures for outcome predictions. Kernel SVM for its discriminative power in dealing with small sample pattern recognition problems has attracted a lot attention. But how to select or construct an appropriate kernel for a specified problem still needs further investigation. Here we propose a novel kernel (Hadamard Kernel) in conjunction with Support Vector Machines (SVMs) to address the problem of breast cancer outcome prediction using gene expression data. Hadamard Kernel outperform the classical kernels and correlation kernel in terms of Area under the ROC Curve (AUC) values where a number of real-world data sets are adopted to test the performance of different methods. Hadamard Kernel SVM is effective for breast cancer predictions, either in terms of prognosis or diagnosis. It may benefit patients by guiding therapeutic options. Apart from that, it would be a valuable addition to the current SVM kernel families. We hope it will contribute to the wider biology and related communities.

Aflatoxin contamination of developing corn kernels.

Science.gov (United States)

Amer, M A

2005-01-01

Preharvest of corn and its contamination with aflatoxin is a serious problem. Some environmental and cultural factors responsible for infection and subsequent aflatoxin production were investigated in this study. Stage of growth and location of kernels on corn ears were found to be one of the important factors in the process of kernel infection with A. flavus & A. parasiticus. The results showed positive correlation between the stage of growth and kernel infection. Treatment of corn with aflatoxin reduced germination, protein and total nitrogen contents. Total and reducing soluble sugar was increase in corn kernels as response to infection. Sucrose and protein content were reduced in case of both pathogens. Shoot system length, seeding fresh weigh and seedling dry weigh was also affected. Both pathogens induced reduction of starch content. Healthy corn seedlings treated with aflatoxin solution were badly affected. Their leaves became yellow then, turned brown with further incubation. Moreover, their total chlorophyll and protein contents showed pronounced decrease. On the other hand, total phenolic compounds were increased. Histopathological studies indicated that A. flavus & A. parasiticus could colonize corn silks and invade developing kernels. Germination of A. flavus spores was occurred and hyphae spread rapidly across the silk, producing extensive growth and lateral branching. Conidiophores and conidia had formed in and on the corn silk. Temperature and relative humidity greatly influenced the growth of A. flavus & A. parasiticus and aflatoxin production.

Extinction in neutrally stable stochastic Lotka-Volterra models

Science.gov (United States)

Dobrinevski, Alexander; Frey, Erwin

2012-05-01

Populations of competing biological species exhibit a fascinating interplay between the nonlinear dynamics of evolutionary selection forces and random fluctuations arising from the stochastic nature of the interactions. The processes leading to extinction of species, whose understanding is a key component in the study of evolution and biodiversity, are influenced by both of these factors. Here, we investigate a class of stochastic population dynamics models based on generalized Lotka-Volterra systems. In the case of neutral stability of the underlying deterministic model, the impact of intrinsic noise on the survival of species is dramatic: It destroys coexistence of interacting species on a time scale proportional to the population size. We introduce a new method based on stochastic averaging which allows one to understand this extinction process quantitatively by reduction to a lower-dimensional effective dynamics. This is performed analytically for two highly symmetrical models and can be generalized numerically to more complex situations. The extinction probability distributions and other quantities of interest we obtain show excellent agreement with simulations.

Kernel Korner : The Linux keyboard driver

NARCIS (Netherlands)

Brouwer, A.E.

1995-01-01

Our Kernel Korner series continues with an article describing the Linux keyboard driver. This article is not for "Kernel Hackers" only--in fact, it will be most useful to those who wish to use their own keyboard to its fullest potential, and those who want to write programs to take advantage of the

The heating of UO_2 kernels in argon gas medium on the physical properties of sintered UO_2 kernels

International Nuclear Information System (INIS)

Damunir; Sri Rinanti Susilowati; Ariyani Kusuma Dewi

2015-01-01

The heating of UO_2 kernels in argon gas medium on the physical properties of sinter UO_2 kernels was conducted. The heated of the UO_2 kernels was conducted in a sinter reactor of a bed type. The sample used was the UO_2 kernels resulted from the reduction results at 800 °C temperature for 3 hours that had the density of 8.13 g/cm"3; porosity of 0.26; O/U ratio of 2.05; diameter of 1146 μm and sphericity of 1.05. The sample was put into a sinter reactor, then it was vacuumed by flowing the argon gas at 180 mmHg pressure to drain the air from the reactor. After that, the cooling water and argon gas were continuously flowed with the pressure of 5 mPa with 1.5 liter/minutes velocity. The reactor temperature was increased and variated at 1200-1500 °C temperature and for 1-4 hours. The sinters UO_2 kernels resulted from the study were analyzed in term of their physical properties including the density, porosity, diameter, sphericity, and specific surface area. The density was analyzed using pycnometer with CCl_4 solution. The porosity was determined using Haynes equation. The diameters and sphericity were showed using the Dino-lite microscope. The specific surface area was determined using surface area meter Nova-1000. The obtained products showed the the heating of UO_2 kernel in argon gas medium were influenced on the physical properties of sinters UO_2 kernel. The condition of best relatively at 1400 °C temperature and 2 hours time. The product resulted from the study was relatively at its best when heating was conducted at 1400 °C temperature and 2 hours time, produced sinters UO_2 kernel with density of 10.14 gr/ml; porosity of 7 %; diameters of 893 μm; sphericity of 1.07 and specific surface area of 4.68 m"2/g with solidify shrinkage of 22 %. (author)

Mitigation of artifacts in rtm with migration kernel decomposition

KAUST Repository

Zhan, Ge

2012-01-01

The migration kernel for reverse-time migration (RTM) can be decomposed into four component kernels using Born scattering and migration theory. Each component kernel has a unique physical interpretation and can be interpreted differently. In this paper, we present a generalized diffraction-stack migration approach for reducing RTM artifacts via decomposition of migration kernel. The decomposition leads to an improved understanding of migration artifacts and, therefore, presents us with opportunities for improving the quality of RTM images.

Realized kernels in practice

DEFF Research Database (Denmark)

Barndorff-Nielsen, Ole Eiler; Hansen, P. Reinhard; Lunde, Asger

2009-01-01

and find a remarkable level of agreement. We identify some features of the high-frequency data, which are challenging for realized kernels. They are when there are local trends in the data, over periods of around 10 minutes, where the prices and quotes are driven up or down. These can be associated......Realized kernels use high-frequency data to estimate daily volatility of individual stock prices. They can be applied to either trade or quote data. Here we provide the details of how we suggest implementing them in practice. We compare the estimates based on trade and quote data for the same stock...

Stationary Response of Lotka—Volterra System with Real Noises

International Nuclear Information System (INIS)

Qi Lu-Yuan; Xu Wei; Gao Wei-Ting

2013-01-01

A stochastic version of Lotka—Volterra model subjected to real noises is proposed and investigated. The approximate stationary probability densities for both predator and prey are obtained analytically. The original system is firstly transformed to a pair of Itô stochastic differential equations. The Itô formula is then carried out to obtain the Itô stochastic differential equation for the period orbit function. The orbit function is considered as slowly varying process under reasonable assumptions. By applying the stochastic averaging method to the orbit function in one period, the averaged Itô stochastic differential equation of the motion orbit and the corresponding Fokker—Planck equation are derived. The probability density functions of the two species are thus formulated. Finally, a classical real noise model is given as an example to show the proposed approximate method. The accuracy of the proposed procedure is verified by Monte Carlo simulation. (interdisciplinary physics and related areas of science and technology)

Anatomically-aided PET reconstruction using the kernel method.

Science.gov (United States)

Hutchcroft, Will; Wang, Guobao; Chen, Kevin T; Catana, Ciprian; Qi, Jinyi

2016-09-21

This paper extends the kernel method that was proposed previously for dynamic PET reconstruction, to incorporate anatomical side information into the PET reconstruction model. In contrast to existing methods that incorporate anatomical information using a penalized likelihood framework, the proposed method incorporates this information in the simpler maximum likelihood (ML) formulation and is amenable to ordered subsets. The new method also does not require any segmentation of the anatomical image to obtain edge information. We compare the kernel method with the Bowsher method for anatomically-aided PET image reconstruction through a simulated data set. Computer simulations demonstrate that the kernel method offers advantages over the Bowsher method in region of interest quantification. Additionally the kernel method is applied to a 3D patient data set. The kernel method results in reduced noise at a matched contrast level compared with the conventional ML expectation maximization algorithm.

Embedded real-time operating system micro kernel design

Science.gov (United States)

Cheng, Xiao-hui; Li, Ming-qiang; Wang, Xin-zheng

2005-12-01

Embedded systems usually require a real-time character. Base on an 8051 microcontroller, an embedded real-time operating system micro kernel is proposed consisting of six parts, including a critical section process, task scheduling, interruption handle, semaphore and message mailbox communication, clock managent and memory managent. Distributed CPU and other resources are among tasks rationally according to the importance and urgency. The design proposed here provides the position, definition, function and principle of micro kernel. The kernel runs on the platform of an ATMEL AT89C51 microcontroller. Simulation results prove that the designed micro kernel is stable and reliable and has quick response while operating in an application system.

Kernel Temporal Differences for Neural Decoding

Science.gov (United States)

Bae, Jihye; Sanchez Giraldo, Luis G.; Pohlmeyer, Eric A.; Francis, Joseph T.; Sanchez, Justin C.; Príncipe, José C.

2015-01-01

We study the feasibility and capability of the kernel temporal difference (KTD)(λ) algorithm for neural decoding. KTD(λ) is an online, kernel-based learning algorithm, which has been introduced to estimate value functions in reinforcement learning. This algorithm combines kernel-based representations with the temporal difference approach to learning. One of our key observations is that by using strictly positive definite kernels, algorithm's convergence can be guaranteed for policy evaluation. The algorithm's nonlinear functional approximation capabilities are shown in both simulations of policy evaluation and neural decoding problems (policy improvement). KTD can handle high-dimensional neural states containing spatial-temporal information at a reasonable computational complexity allowing real-time applications. When the algorithm seeks a proper mapping between a monkey's neural states and desired positions of a computer cursor or a robot arm, in both open-loop and closed-loop experiments, it can effectively learn the neural state to action mapping. Finally, a visualization of the coadaptation process between the decoder and the subject shows the algorithm's capabilities in reinforcement learning brain machine interfaces. PMID:25866504

Collision kernels in the eikonal approximation for Lennard-Jones interaction potential

International Nuclear Information System (INIS)

Zielinska, S.

1985-03-01

The velocity changing collisions are conveniently described by collisional kernels. These kernels depend on an interaction potential and there is a necessity for evaluating them for realistic interatomic potentials. Using the collision kernels, we are able to investigate the redistribution of atomic population's caused by the laser light and velocity changing collisions. In this paper we present the method of evaluating the collision kernels in the eikonal approximation. We discuss the influence of the potential parameters Rsub(o)sup(i), epsilonsub(o)sup(i) on kernel width for a given atomic state. It turns out that unlike the collision kernel for the hard sphere model of scattering the Lennard-Jones kernel is not so sensitive to changes of Rsub(o)sup(i) as the previous one. Contrary to the general tendency of approximating collisional kernels by the Gaussian curve, kernels for the Lennard-Jones potential do not exhibit such a behaviour. (author)

Classification of maize kernels using NIR hyperspectral imaging

DEFF Research Database (Denmark)

Williams, Paul; Kucheryavskiy, Sergey V.

2016-01-01

NIR hyperspectral imaging was evaluated to classify maize kernels of three hardness categories: hard, medium and soft. Two approaches, pixel-wise and object-wise, were investigated to group kernels according to hardness. The pixel-wise classification assigned a class to every pixel from individual...... and specificity of 0.95 and 0.93). Both feature extraction methods can be recommended for classification of maize kernels on production scale....

Influence of wheat kernel physical properties on the pulverizing process.

Science.gov (United States)

Dziki, Dariusz; Cacak-Pietrzak, Grażyna; Miś, Antoni; Jończyk, Krzysztof; Gawlik-Dziki, Urszula

2014-10-01

The physical properties of wheat kernel were determined and related to pulverizing performance by correlation analysis. Nineteen samples of wheat cultivars about similar level of protein content (11.2-12.8 % w.b.) and obtained from organic farming system were used for analysis. The kernel (moisture content 10 % w.b.) was pulverized by using the laboratory hammer mill equipped with round holes 1.0 mm screen. The specific grinding energy ranged from 120 kJkg(-1) to 159 kJkg(-1). On the basis of data obtained many of significant correlations (p kernel physical properties and pulverizing process of wheat kernel, especially wheat kernel hardness index (obtained on the basis of Single Kernel Characterization System) and vitreousness significantly and positively correlated with the grinding energy indices and the mass fraction of coarse particles (> 0.5 mm). Among the kernel mechanical properties determined on the basis of uniaxial compression test only the rapture force was correlated with the impact grinding results. The results showed also positive and significant relationships between kernel ash content and grinding energy requirements. On the basis of wheat physical properties the multiple linear regression was proposed for predicting the average particle size of pulverized kernel.

Polyphasic Approach Including MALDI-TOF MS/MS Analysis for Identification and Characterisation of Fusarium verticillioides in Brazilian Corn Kernels

Directory of Open Access Journals (Sweden)

Susane Chang

2016-02-01

Full Text Available Fusarium verticillioides is considered one of the most important global sources of fumonisins contamination in food and feed. Corn is one of the main commodities produced in the Northeastern Region of Brazil. The present study investigated potential mycotoxigenic fungal strains belonging to the F. verticillioides species isolated from corn kernels in 3 different Regions of the Brazilian State of Pernambuco. A polyphasic approach including classical taxonomy, molecular biology, MALDI-TOF MS and MALDI-TOF MS/MS for the identification and characterisation of the F. verticillioides strains was used. Sixty F. verticillioides strains were isolated and successfully identified by classical morphology, proteomic profiles of MALDI-TOF MS, and by molecular biology using the species-specific primers VERT-1 and VERT-2. FUM1 gene was further detected for all the 60 F. verticillioides by using the primers VERTF-1 and VERTF-2 and through the amplification profiles of the ISSR regions using the primers (GTG5 and (GACA4. Results obtained from molecular analysis shown a low genetic variability among these isolates from the different geographical regions. All of the 60 F. verticillioides isolates assessed by MALDI-TOF MS/MS presented ion peaks with the molecular mass of the fumonisin B1 (721.83 g/mol and B2 (705.83 g/mol.

On Weakly Singular Versions of Discrete Nonlinear Inequalities and Applications

Directory of Open Access Journals (Sweden)

Kelong Cheng

2014-01-01

Full Text Available Some new weakly singular versions of discrete nonlinear inequalities are established, which generalize some existing weakly singular inequalities and can be used in the analysis of nonlinear Volterra type difference equations with weakly singular kernels. A few applications to the upper bound and the uniqueness of solutions of nonlinear difference equations are also involved.

Evolution kernel for the Dirac field

International Nuclear Information System (INIS)

Baaquie, B.E.

1982-06-01

The evolution kernel for the free Dirac field is calculated using the Wilson lattice fermions. We discuss the difficulties due to which this calculation has not been previously performed in the continuum theory. The continuum limit is taken, and the complete energy eigenfunctions as well as the propagator are then evaluated in a new manner using the kernel. (author)

Gradient-based adaptation of general gaussian kernels.

Science.gov (United States)

Glasmachers, Tobias; Igel, Christian

2005-10-01

Gradient-based optimizing of gaussian kernel functions is considered. The gradient for the adaptation of scaling and rotation of the input space is computed to achieve invariance against linear transformations. This is done by using the exponential map as a parameterization of the kernel parameter manifold. By restricting the optimization to a constant trace subspace, the kernel size can be controlled. This is, for example, useful to prevent overfitting when minimizing radius-margin generalization performance measures. The concepts are demonstrated by training hard margin support vector machines on toy data.

Volterra series based predistortion for broadband RF power amplifiers with memory effects

Institute of Scientific and Technical Information of China (English)

Jin Zhe; Song Zhihuan; He Jiaming

2008-01-01

RF power amplifiers(PAs)are usually considered as memoryless devices in most existing predistortion techniques.However,in broadband communication systems,such as WCDMA,the PA memory effects are significant,and memoryless predistortion cannot linearize the PAs effectively.After analyzing the PA memory effects,a novel predistortion method based on the simplified Volterra series is proposed to linearize broadband RF PAs with memory effects.The indirect learning architecture is adopted to design the predistortion scheme and the recursive least squares algorithm with forgetting factor is applied to identify the parameters of the predistorter.Simulation results show that the proposed predistortion method can compensate the nonlinear distortion and memory effects of broadband RF PAs effectively.

Kernel principal component analysis residual diagnosis (KPCARD): An automated method for cosmic ray artifact removal in Raman spectra

International Nuclear Information System (INIS)

Li, Boyan; Calvet, Amandine; Casamayou-Boucau, Yannick; Ryder, Alan G.

2016-01-01

A new, fully automated, rapid method, referred to as kernel principal component analysis residual diagnosis (KPCARD), is proposed for removing cosmic ray artifacts (CRAs) in Raman spectra, and in particular for large Raman imaging datasets. KPCARD identifies CRAs via a statistical analysis of the residuals obtained at each wavenumber in the spectra. The method utilizes the stochastic nature of CRAs; therefore, the most significant components in principal component analysis (PCA) of large numbers of Raman spectra should not contain any CRAs. The process worked by first implementing kernel PCA (kPCA) on all the Raman mapping data and second accurately estimating the inter- and intra-spectrum noise to generate two threshold values. CRA identification was then achieved by using the threshold values to evaluate the residuals for each spectrum and assess if a CRA was present. CRA correction was achieved by spectral replacement where, the nearest neighbor (NN) spectrum, most spectroscopically similar to the CRA contaminated spectrum and principal components (PCs) obtained by kPCA were both used to generate a robust, best curve fit to the CRA contaminated spectrum. This best fit spectrum then replaced the CRA contaminated spectrum in the dataset. KPCARD efficacy was demonstrated by using simulated data and real Raman spectra collected from solid-state materials. The results showed that KPCARD was fast ( 1 million) Raman datasets. - Highlights: • New rapid, automatable method for cosmic ray artifact correction of Raman spectra. • Uses combination of kernel PCA and noise estimation for artifact identification. • Implements a best fit spectrum replacement correction approach.

Analog forecasting with dynamics-adapted kernels

Science.gov (United States)

Zhao, Zhizhen; Giannakis, Dimitrios

2016-09-01

Analog forecasting is a nonparametric technique introduced by Lorenz in 1969 which predicts the evolution of states of a dynamical system (or observables defined on the states) by following the evolution of the sample in a historical record of observations which most closely resembles the current initial data. Here, we introduce a suite of forecasting methods which improve traditional analog forecasting by combining ideas from kernel methods developed in harmonic analysis and machine learning and state-space reconstruction for dynamical systems. A key ingredient of our approach is to replace single-analog forecasting with weighted ensembles of analogs constructed using local similarity kernels. The kernels used here employ a number of dynamics-dependent features designed to improve forecast skill, including Takens’ delay-coordinate maps (to recover information in the initial data lost through partial observations) and a directional dependence on the dynamical vector field generating the data. Mathematically, our approach is closely related to kernel methods for out-of-sample extension of functions, and we discuss alternative strategies based on the Nyström method and the multiscale Laplacian pyramids technique. We illustrate these techniques in applications to forecasting in a low-order deterministic model for atmospheric dynamics with chaotic metastability, and interannual-scale forecasting in the North Pacific sector of a comprehensive climate model. We find that forecasts based on kernel-weighted ensembles have significantly higher skill than the conventional approach following a single analog.

Open Problem: Kernel methods on manifolds and metric spaces

DEFF Research Database (Denmark)

Feragen, Aasa; Hauberg, Søren

2016-01-01

Radial kernels are well-suited for machine learning over general geodesic metric spaces, where pairwise distances are often the only computable quantity available. We have recently shown that geodesic exponential kernels are only positive definite for all bandwidths when the input space has strong...... linear properties. This negative result hints that radial kernel are perhaps not suitable over geodesic metric spaces after all. Here, however, we present evidence that large intervals of bandwidths exist where geodesic exponential kernels have high probability of being positive definite over finite...... datasets, while still having significant predictive power. From this we formulate conjectures on the probability of a positive definite kernel matrix for a finite random sample, depending on the geometry of the data space and the spread of the sample....

Association mapping for kernel phytosterol content in almond

Directory of Open Access Journals (Sweden)

Carolina eFont i Forcada

2015-07-01

Full Text Available Almond kernels are a rich source of phytosterols, which are important compounds for human nutrition. The genetic control of phytosterol content has not yet been documented in almond. Association mapping, also known as linkage disequilibrium, was applied to an almond germplasm collection in order to provide new insight into the genetic control of total and individual sterol contents in kernels. Population structure analysis grouped the accessions into two principal groups, the Mediterranean and the non-Mediterranean. There was a strong subpopulation structure with linkage disequilibrium decaying with increasing genetic distance, resulting in lower levels of linkage disequilibrium between more distant markers. A significant impact of population structure on linkage disequilibrium in the almond cultivar groups was observed. The mean r2 value for all intra-chromosomal loci pairs was 0.040, whereas, the r2 for the inter-chromosomal loci pairs was 0.036. For analysis of association between the markers and phenotypic traits five models were tested. The mixed linear model (MLM approach using co-ancestry values from population structure and kinship estimates (K model as covariates identified a maximum of 13 significant associations. Most of the associations found appeared to map within the interval where many candidate genes involved in the sterol biosynthesis pathway are predicted in the peach genome. These findings provide a valuable foundation for quality gene identification and molecular marker assisted breeding in almond.

Genetic dissection of the maize kernel development process via conditional QTL mapping for three developing kernel-related traits in an immortalized F2 population.

Science.gov (United States)

Zhang, Zhanhui; Wu, Xiangyuan; Shi, Chaonan; Wang, Rongna; Li, Shengfei; Wang, Zhaohui; Liu, Zonghua; Xue, Yadong; Tang, Guiliang; Tang, Jihua

2016-02-01

Kernel development is an important dynamic trait that determines the final grain yield in maize. To dissect the genetic basis of maize kernel development process, a conditional quantitative trait locus (QTL) analysis was conducted using an immortalized F2 (IF2) population comprising 243 single crosses at two locations over 2 years. Volume (KV) and density (KD) of dried developing kernels, together with kernel weight (KW) at different developmental stages, were used to describe dynamic changes during kernel development. Phenotypic analysis revealed that final KW and KD were determined at DAP22 and KV at DAP29. Unconditional QTL mapping for KW, KV and KD uncovered 97 QTLs at different kernel development stages, of which qKW6b, qKW7a, qKW7b, qKW10b, qKW10c, qKV10a, qKV10b and qKV7 were identified under multiple kernel developmental stages and environments. Among the 26 QTLs detected by conditional QTL mapping, conqKW7a, conqKV7a, conqKV10a, conqKD2, conqKD7 and conqKD8a were conserved between the two mapping methodologies. Furthermore, most of these QTLs were consistent with QTLs and genes for kernel development/grain filling reported in previous studies. These QTLs probably contain major genes associated with the kernel development process, and can be used to improve grain yield and quality through marker-assisted selection.

Kernel-based noise filtering of neutron detector signals

International Nuclear Information System (INIS)

Park, Moon Ghu; Shin, Ho Cheol; Lee, Eun Ki

2007-01-01

This paper describes recently developed techniques for effective filtering of neutron detector signal noise. In this paper, three kinds of noise filters are proposed and their performance is demonstrated for the estimation of reactivity. The tested filters are based on the unilateral kernel filter, unilateral kernel filter with adaptive bandwidth and bilateral filter to show their effectiveness in edge preservation. Filtering performance is compared with conventional low-pass and wavelet filters. The bilateral filter shows a remarkable improvement compared with unilateral kernel and wavelet filters. The effectiveness and simplicity of the unilateral kernel filter with adaptive bandwidth is also demonstrated by applying it to the reactivity measurement performed during reactor start-up physics tests

A trace ratio maximization approach to multiple kernel-based dimensionality reduction.

Science.gov (United States)

Jiang, Wenhao; Chung, Fu-lai

2014-01-01

Most dimensionality reduction techniques are based on one metric or one kernel, hence it is necessary to select an appropriate kernel for kernel-based dimensionality reduction. Multiple kernel learning for dimensionality reduction (MKL-DR) has been recently proposed to learn a kernel from a set of base kernels which are seen as different descriptions of data. As MKL-DR does not involve regularization, it might be ill-posed under some conditions and consequently its applications are hindered. This paper proposes a multiple kernel learning framework for dimensionality reduction based on regularized trace ratio, termed as MKL-TR. Our method aims at learning a transformation into a space of lower dimension and a corresponding kernel from the given base kernels among which some may not be suitable for the given data. The solutions for the proposed framework can be found based on trace ratio maximization. The experimental results demonstrate its effectiveness in benchmark datasets, which include text, image and sound datasets, for supervised, unsupervised as well as semi-supervised settings. Copyright © 2013 Elsevier Ltd. All rights reserved.

Predictive Model Equations for Palm Kernel (Elaeis guneensis J ...

African Journals Online (AJOL)

Estimated error of ± 0.18 and ± 0.2 are envisaged while applying the models for predicting palm kernel and sesame oil colours respectively. Keywords: Palm kernel, Sesame, Palm kernel, Oil Colour, Process Parameters, Model. Journal of Applied Science, Engineering and Technology Vol. 6 (1) 2006 pp. 34-38 ...

Heat kernel analysis for Bessel operators on symmetric cones

DEFF Research Database (Denmark)

Möllers, Jan

2014-01-01

. The heat kernel is explicitly given in terms of a multivariable $I$-Bessel function on $Ω$. Its corresponding heat kernel transform defines a continuous linear operator between $L^p$-spaces. The unitary image of the $L^2$-space under the heat kernel transform is characterized as a weighted Bergmann space...

A multi-scale kernel bundle for LDDMM

DEFF Research Database (Denmark)

Sommer, Stefan Horst; Nielsen, Mads; Lauze, Francois Bernard

2011-01-01

The Large Deformation Diffeomorphic Metric Mapping framework constitutes a widely used and mathematically well-founded setup for registration in medical imaging. At its heart lies the notion of the regularization kernel, and the choice of kernel greatly affects the results of registrations...

Training Lp norm multiple kernel learning in the primal.

Science.gov (United States)

Liang, Zhizheng; Xia, Shixiong; Zhou, Yong; Zhang, Lei

2013-10-01

Some multiple kernel learning (MKL) models are usually solved by utilizing the alternating optimization method where one alternately solves SVMs in the dual and updates kernel weights. Since the dual and primal optimization can achieve the same aim, it is valuable in exploring how to perform Lp norm MKL in the primal. In this paper, we propose an Lp norm multiple kernel learning algorithm in the primal where we resort to the alternating optimization method: one cycle for solving SVMs in the primal by using the preconditioned conjugate gradient method and other cycle for learning the kernel weights. It is interesting to note that the kernel weights in our method can obtain analytical solutions. Most importantly, the proposed method is well suited for the manifold regularization framework in the primal since solving LapSVMs in the primal is much more effective than solving LapSVMs in the dual. In addition, we also carry out theoretical analysis for multiple kernel learning in the primal in terms of the empirical Rademacher complexity. It is found that optimizing the empirical Rademacher complexity may obtain a type of kernel weights. The experiments on some datasets are carried out to demonstrate the feasibility and effectiveness of the proposed method. Copyright © 2013 Elsevier Ltd. All rights reserved.

Coupling individual kernel-filling processes with source-sink interactions into GREENLAB-Maize.

Science.gov (United States)

Ma, Yuntao; Chen, Youjia; Zhu, Jinyu; Meng, Lei; Guo, Yan; Li, Baoguo; Hoogenboom, Gerrit

2018-02-13

Failure to account for the variation of kernel growth in a cereal crop simulation model may cause serious deviations in the estimates of crop yield. The goal of this research was to revise the GREENLAB-Maize model to incorporate source- and sink-limited allocation approaches to simulate the dry matter accumulation of individual kernels of an ear (GREENLAB-Maize-Kernel). The model used potential individual kernel growth rates to characterize the individual potential sink demand. The remobilization of non-structural carbohydrates from reserve organs to kernels was also incorporated. Two years of field experiments were conducted to determine the model parameter values and to evaluate the model using two maize hybrids with different plant densities and pollination treatments. Detailed observations were made on the dimensions and dry weights of individual kernels and other above-ground plant organs throughout the seasons. Three basic traits characterizing an individual kernel were compared on simulated and measured individual kernels: (1) final kernel size; (2) kernel growth rate; and (3) duration of kernel filling. Simulations of individual kernel growth closely corresponded to experimental data. The model was able to reproduce the observed dry weight of plant organs well. Then, the source-sink dynamics and the remobilization of carbohydrates for kernel growth were quantified to show that remobilization processes accompanied source-sink dynamics during the kernel-filling process. We conclude that the model may be used to explore options for optimizing plant kernel yield by matching maize management to the environment, taking into account responses at the level of individual kernels. © The Author(s) 2018. Published by Oxford University Press on behalf of the Annals of Botany Company. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

Stochastic subset selection for learning with kernel machines.

Science.gov (United States)

Rhinelander, Jason; Liu, Xiaoping P

2012-06-01

Kernel machines have gained much popularity in applications of machine learning. Support vector machines (SVMs) are a subset of kernel machines and generalize well for classification, regression, and anomaly detection tasks. The training procedure for traditional SVMs involves solving a quadratic programming (QP) problem. The QP problem scales super linearly in computational effort with the number of training samples and is often used for the offline batch processing of data. Kernel machines operate by retaining a subset of observed data during training. The data vectors contained within this subset are referred to as support vectors (SVs). The work presented in this paper introduces a subset selection method for the use of kernel machines in online, changing environments. Our algorithm works by using a stochastic indexing technique when selecting a subset of SVs when computing the kernel expansion. The work described here is novel because it separates the selection of kernel basis functions from the training algorithm used. The subset selection algorithm presented here can be used in conjunction with any online training technique. It is important for online kernel machines to be computationally efficient due to the real-time requirements of online environments. Our algorithm is an important contribution because it scales linearly with the number of training samples and is compatible with current training techniques. Our algorithm outperforms standard techniques in terms of computational efficiency and provides increased recognition accuracy in our experiments. We provide results from experiments using both simulated and real-world data sets to verify our algorithm.

RTOS kernel in portable electrocardiograph

Science.gov (United States)

Centeno, C. A.; Voos, J. A.; Riva, G. G.; Zerbini, C.; Gonzalez, E. A.

2011-12-01

This paper presents the use of a Real Time Operating System (RTOS) on a portable electrocardiograph based on a microcontroller platform. All medical device digital functions are performed by the microcontroller. The electrocardiograph CPU is based on the 18F4550 microcontroller, in which an uCOS-II RTOS can be embedded. The decision associated with the kernel use is based on its benefits, the license for educational use and its intrinsic time control and peripherals management. The feasibility of its use on the electrocardiograph is evaluated based on the minimum memory requirements due to the kernel structure. The kernel's own tools were used for time estimation and evaluation of resources used by each process. After this feasibility analysis, the migration from cyclic code to a structure based on separate processes or tasks able to synchronize events is used; resulting in an electrocardiograph running on one Central Processing Unit (CPU) based on RTOS.

RTOS kernel in portable electrocardiograph

International Nuclear Information System (INIS)

Centeno, C A; Voos, J A; Riva, G G; Zerbini, C; Gonzalez, E A

2011-01-01

This paper presents the use of a Real Time Operating System (RTOS) on a portable electrocardiograph based on a microcontroller platform. All medical device digital functions are performed by the microcontroller. The electrocardiograph CPU is based on the 18F4550 microcontroller, in which an uCOS-II RTOS can be embedded. The decision associated with the kernel use is based on its benefits, the license for educational use and its intrinsic time control and peripherals management. The feasibility of its use on the electrocardiograph is evaluated based on the minimum memory requirements due to the kernel structure. The kernel's own tools were used for time estimation and evaluation of resources used by each process. After this feasibility analysis, the migration from cyclic code to a structure based on separate processes or tasks able to synchronize events is used; resulting in an electrocardiograph running on one Central Processing Unit (CPU) based on RTOS.

RKRD: Runtime Kernel Rootkit Detection

Science.gov (United States)

Grover, Satyajit; Khosravi, Hormuzd; Kolar, Divya; Moffat, Samuel; Kounavis, Michael E.

In this paper we address the problem of protecting computer systems against stealth malware. The problem is important because the number of known types of stealth malware increases exponentially. Existing approaches have some advantages for ensuring system integrity but sophisticated techniques utilized by stealthy malware can thwart them. We propose Runtime Kernel Rootkit Detection (RKRD), a hardware-based, event-driven, secure and inclusionary approach to kernel integrity that addresses some of the limitations of the state of the art. Our solution is based on the principles of using virtualization hardware for isolation, verifying signatures coming from trusted code as opposed to malware for scalability and performing system checks driven by events. Our RKRD implementation is guided by our goals of strong isolation, no modifications to target guest OS kernels, easy deployment, minimal infra-structure impact, and minimal performance overhead. We developed a system prototype and conducted a number of experiments which show that the per-formance impact of our solution is negligible.

Denoising by semi-supervised kernel PCA preimaging

DEFF Research Database (Denmark)

Hansen, Toke Jansen; Abrahamsen, Trine Julie; Hansen, Lars Kai

2014-01-01

Kernel Principal Component Analysis (PCA) has proven a powerful tool for nonlinear feature extraction, and is often applied as a pre-processing step for classification algorithms. In denoising applications Kernel PCA provides the basis for dimensionality reduction, prior to the so-called pre-imag...

Sentiment classification with interpolated information diffusion kernels

NARCIS (Netherlands)

Raaijmakers, S.

2007-01-01

Information diffusion kernels - similarity metrics in non-Euclidean information spaces - have been found to produce state of the art results for document classification. In this paper, we present a novel approach to global sentiment classification using these kernels. We carry out a large array of

A novel method for non-parametric identification of nonlinear restoring forces in nonlinear vibrations from noisy response data: A conservative system

International Nuclear Information System (INIS)

Jang, T. S.; Kwon, S. H.; Han, S. L.

2009-01-01

A novel procedure is proposed to identify the functional form of nonlinear restoring forces in the nonlinear oscillatory motion of a conservative system. Although the problem of identification has a unique solution, formulation results in a Volterra-type of integral equation of the 'first' kind: the solution lacks stability because the integral equation is the 'first' kind. Thus, the new problem at hand is ill-posed. Inevitable small errors during the identification procedure can make the prediction of nonlinear restoring forces useless. We overcome the difficulty by using a stabilization technique of Landweber's regularization in this study. The capability of the proposed procedure is investigated through numerical examples

Linear and kernel methods for multivariate change detection

DEFF Research Database (Denmark)

Canty, Morton J.; Nielsen, Allan Aasbjerg

2012-01-01

), as well as maximum autocorrelation factor (MAF) and minimum noise fraction (MNF) analyses of IR-MAD images, both linear and kernel-based (nonlinear), may further enhance change signals relative to no-change background. IDL (Interactive Data Language) implementations of IR-MAD, automatic radiometric...... normalization, and kernel PCA/MAF/MNF transformations are presented that function as transparent and fully integrated extensions of the ENVI remote sensing image analysis environment. The train/test approach to kernel PCA is evaluated against a Hebbian learning procedure. Matlab code is also available...... that allows fast data exploration and experimentation with smaller datasets. New, multiresolution versions of IR-MAD that accelerate convergence and that further reduce no-change background noise are introduced. Computationally expensive matrix diagonalization and kernel image projections are programmed...

A Fibonacci collocation method for solving a class of Fredholm–Volterra integral equations in two-dimensional spaces

Directory of Open Access Journals (Sweden)

Farshid Mirzaee

2014-06-01

Full Text Available In this paper, we present a numerical method for solving two-dimensional Fredholm–Volterra integral equations (F-VIE. The method reduces the solution of these integral equations to the solution of a linear system of algebraic equations. The existence and uniqueness of the solution and error analysis of proposed method are discussed. The method is computationally very simple and attractive. Finally, numerical examples illustrate the efficiency and accuracy of the method.

Panel data specifications in nonparametric kernel regression

DEFF Research Database (Denmark)

Czekaj, Tomasz Gerard; Henningsen, Arne

parametric panel data estimators to analyse the production technology of Polish crop farms. The results of our nonparametric kernel regressions generally differ from the estimates of the parametric models but they only slightly depend on the choice of the kernel functions. Based on economic reasoning, we...

Scuba: scalable kernel-based gene prioritization.

Science.gov (United States)

Zampieri, Guido; Tran, Dinh Van; Donini, Michele; Navarin, Nicolò; Aiolli, Fabio; Sperduti, Alessandro; Valle, Giorgio

2018-01-25

The uncovering of genes linked to human diseases is a pressing challenge in molecular biology and precision medicine. This task is often hindered by the large number of candidate genes and by the heterogeneity of the available information. Computational methods for the prioritization of candidate genes can help to cope with these problems. In particular, kernel-based methods are a powerful resource for the integration of heterogeneous biological knowledge, however, their practical implementation is often precluded by their limited scalability. We propose Scuba, a scalable kernel-based method for gene prioritization. It implements a novel multiple kernel learning approach, based on a semi-supervised perspective and on the optimization of the margin distribution. Scuba is optimized to cope with strongly unbalanced settings where known disease genes are few and large scale predictions are required. Importantly, it is able to efficiently deal both with a large amount of candidate genes and with an arbitrary number of data sources. As a direct consequence of scalability, Scuba integrates also a new efficient strategy to select optimal kernel parameters for each data source. We performed cross-validation experiments and simulated a realistic usage setting, showing that Scuba outperforms a wide range of state-of-the-art methods. Scuba achieves state-of-the-art performance and has enhanced scalability compared to existing kernel-based approaches for genomic data. This method can be useful to prioritize candidate genes, particularly when their number is large or when input data is highly heterogeneous. The code is freely available at https://github.com/gzampieri/Scuba .

MULTITASKER, Multitasking Kernel for C and FORTRAN Under UNIX

International Nuclear Information System (INIS)

Brooks, E.D. III

1988-01-01

1 - Description of program or function: MULTITASKER implements a multitasking kernel for the C and FORTRAN programming languages that runs under UNIX. The kernel provides a multitasking environment which serves two purposes. The first is to provide an efficient portable environment for the development, debugging, and execution of production multiprocessor programs. The second is to provide a means of evaluating the performance of a multitasking program on model multiprocessor hardware. The performance evaluation features require no changes in the application program source and are implemented as a set of compile- and run-time options in the kernel. 2 - Method of solution: The FORTRAN interface to the kernel is identical in function to the CRI multitasking package provided for the Cray XMP. This provides a migration path to high speed (but small N) multiprocessors once the application has been coded and debugged. With use of the UNIX m4 macro preprocessor, source compatibility can be achieved between the UNIX code development system and the target Cray multiprocessor. The kernel also provides a means of evaluating a program's performance on model multiprocessors. Execution traces may be obtained which allow the user to determine kernel overhead, memory conflicts between various tasks, and the average concurrency being exploited. The kernel may also be made to switch tasks every cpu instruction with a random execution ordering. This allows the user to look for unprotected critical regions in the program. These features, implemented as a set of compile- and run-time options, cause extra execution overhead which is not present in the standard production version of the kernel

KIRMES: kernel-based identification of regulatory modules in euchromatic sequences.

Science.gov (United States)

Schultheiss, Sebastian J; Busch, Wolfgang; Lohmann, Jan U; Kohlbacher, Oliver; Rätsch, Gunnar

2009-08-15

Understanding transcriptional regulation is one of the main challenges in computational biology. An important problem is the identification of transcription factor (TF) binding sites in promoter regions of potential TF target genes. It is typically approached by position weight matrix-based motif identification algorithms using Gibbs sampling, or heuristics to extend seed oligos. Such algorithms succeed in identifying single, relatively well-conserved binding sites, but tend to fail when it comes to the identification of combinations of several degenerate binding sites, as those often found in cis-regulatory modules. We propose a new algorithm that combines the benefits of existing motif finding with the ones of support vector machines (SVMs) to find degenerate motifs in order to improve the modeling of regulatory modules. In experiments on microarray data from Arabidopsis thaliana, we were able to show that the newly developed strategy significantly improves the recognition of TF targets. The python source code (open source-licensed under GPL), the data for the experiments and a Galaxy-based web service are available at http://www.fml.mpg.de/raetsch/suppl/kirmes/.

Multiple kernel boosting framework based on information measure for classification

International Nuclear Information System (INIS)

Qi, Chengming; Wang, Yuping; Tian, Wenjie; Wang, Qun

2016-01-01

The performance of kernel-based method, such as support vector machine (SVM), is greatly affected by the choice of kernel function. Multiple kernel learning (MKL) is a promising family of machine learning algorithms and has attracted many attentions in recent years. MKL combines multiple sub-kernels to seek better results compared to single kernel learning. In order to improve the efficiency of SVM and MKL, in this paper, the Kullback–Leibler kernel function is derived to develop SVM. The proposed method employs an improved ensemble learning framework, named KLMKB, which applies Adaboost to learning multiple kernel-based classifier. In the experiment for hyperspectral remote sensing image classification, we employ feature selected through Optional Index Factor (OIF) to classify the satellite image. We extensively examine the performance of our approach in comparison to some relevant and state-of-the-art algorithms on a number of benchmark classification data sets and hyperspectral remote sensing image data set. Experimental results show that our method has a stable behavior and a noticeable accuracy for different data set.

The solution of linear and nonlinear systems of Volterra functional equations using Adomian-Pade technique

International Nuclear Information System (INIS)

Dehghan, Mehdi; Shakourifar, Mohammad; Hamidi, Asgar

2009-01-01

The purpose of this study is to implement Adomian-Pade (Modified Adomian-Pade) technique, which is a combination of Adomian decomposition method (Modified Adomian decomposition method) and Pade approximation, for solving linear and nonlinear systems of Volterra functional equations. The results obtained by using Adomian-Pade (Modified Adomian-Pade) technique, are compared to those obtained by using Adomian decomposition method (Modified Adomian decomposition method) alone. The numerical results, demonstrate that ADM-PADE (MADM-PADE) technique, gives the approximate solution with faster convergence rate and higher accuracy than using the standard ADM (MADM).

Kernel Methods for Mining Instance Data in Ontologies

Science.gov (United States)

Bloehdorn, Stephan; Sure, York

The amount of ontologies and meta data available on the Web is constantly growing. The successful application of machine learning techniques for learning of ontologies from textual data, i.e. mining for the Semantic Web, contributes to this trend. However, no principal approaches exist so far for mining from the Semantic Web. We investigate how machine learning algorithms can be made amenable for directly taking advantage of the rich knowledge expressed in ontologies and associated instance data. Kernel methods have been successfully employed in various learning tasks and provide a clean framework for interfacing between non-vectorial data and machine learning algorithms. In this spirit, we express the problem of mining instances in ontologies as the problem of defining valid corresponding kernels. We present a principled framework for designing such kernels by means of decomposing the kernel computation into specialized kernels for selected characteristics of an ontology which can be flexibly assembled and tuned. Initial experiments on real world Semantic Web data enjoy promising results and show the usefulness of our approach.

Biasing anisotropic scattering kernels for deep-penetration Monte Carlo calculations

International Nuclear Information System (INIS)

Carter, L.L.; Hendricks, J.S.

1983-01-01

The exponential transform is often used to improve the efficiency of deep-penetration Monte Carlo calculations. This technique is usually implemented by biasing the distance-to-collision kernel of the transport equation, but leaving the scattering kernel unchanged. Dwivedi obtained significant improvements in efficiency by biasing an isotropic scattering kernel as well as the distance-to-collision kernel. This idea is extended to anisotropic scattering, particularly the highly forward Klein-Nishina scattering of gamma rays

The integral first collision kernel method for gamma-ray skyshine analysis[Skyshine; Gamma-ray; First collision kernel; Monte Carlo calculation

Energy Technology Data Exchange (ETDEWEB)

Sheu, R.-D.; Chui, C.-S.; Jiang, S.-H. E-mail: shjiang@mx.nthu.edu.tw

2003-12-01

A simplified method, based on the integral of the first collision kernel, is presented for performing gamma-ray skyshine calculations for the collimated sources. The first collision kernels were calculated in air for a reference air density by use of the EGS4 Monte Carlo code. These kernels can be applied to other air densities by applying density corrections. The integral first collision kernel (IFCK) method has been used to calculate two of the ANSI/ANS skyshine benchmark problems and the results were compared with a number of other commonly used codes. Our results were generally in good agreement with others but only spend a small fraction of the computation time required by the Monte Carlo calculations. The scheme of the IFCK method for dealing with lots of source collimation geometry is also presented in this study.

A kernel adaptive algorithm for quaternion-valued inputs.

Science.gov (United States)

Paul, Thomas K; Ogunfunmi, Tokunbo

2015-10-01

The use of quaternion data can provide benefit in applications like robotics and image recognition, and particularly for performing transforms in 3-D space. Here, we describe a kernel adaptive algorithm for quaternions. A least mean square (LMS)-based method was used, resulting in the derivation of the quaternion kernel LMS (Quat-KLMS) algorithm. Deriving this algorithm required describing the idea of a quaternion reproducing kernel Hilbert space (RKHS), as well as kernel functions suitable with quaternions. A modified HR calculus for Hilbert spaces was used to find the gradient of cost functions defined on a quaternion RKHS. In addition, the use of widely linear (or augmented) filtering is proposed to improve performance. The benefit of the Quat-KLMS and widely linear forms in learning nonlinear transformations of quaternion data are illustrated with simulations.

Improving the Bandwidth Selection in Kernel Equating

Science.gov (United States)

Andersson, Björn; von Davier, Alina A.

2014-01-01

We investigate the current bandwidth selection methods in kernel equating and propose a method based on Silverman's rule of thumb for selecting the bandwidth parameters. In kernel equating, the bandwidth parameters have previously been obtained by minimizing a penalty function. This minimization process has been criticized by practitioners…

Point kernels and superposition methods for scatter dose calculations in brachytherapy

International Nuclear Information System (INIS)

Carlsson, A.K.

2000-01-01

Point kernels have been generated and applied for calculation of scatter dose distributions around monoenergetic point sources for photon energies ranging from 28 to 662 keV. Three different approaches for dose calculations have been compared: a single-kernel superposition method, a single-kernel superposition method where the point kernels are approximated as isotropic and a novel 'successive-scattering' superposition method for improved modelling of the dose from multiply scattered photons. An extended version of the EGS4 Monte Carlo code was used for generating the kernels and for benchmarking the absorbed dose distributions calculated with the superposition methods. It is shown that dose calculation by superposition at and below 100 keV can be simplified by using isotropic point kernels. Compared to the assumption of full in-scattering made by algorithms currently in clinical use, the single-kernel superposition method improves dose calculations in a half-phantom consisting of air and water. Further improvements are obtained using the successive-scattering superposition method, which reduces the overestimates of dose close to the phantom surface usually associated with kernel superposition methods at brachytherapy photon energies. It is also shown that scatter dose point kernels can be parametrized to biexponential functions, making them suitable for use with an effective implementation of the collapsed cone superposition algorithm. (author)

Online learning control using adaptive critic designs with sparse kernel machines.

Science.gov (United States)

Xu, Xin; Hou, Zhongsheng; Lian, Chuanqiang; He, Haibo

2013-05-01

In the past decade, adaptive critic designs (ACDs), including heuristic dynamic programming (HDP), dual heuristic programming (DHP), and their action-dependent ones, have been widely studied to realize online learning control of dynamical systems. However, because neural networks with manually designed features are commonly used to deal with continuous state and action spaces, the generalization capability and learning efficiency of previous ACDs still need to be improved. In this paper, a novel framework of ACDs with sparse kernel machines is presented by integrating kernel methods into the critic of ACDs. To improve the generalization capability as well as the computational efficiency of kernel machines, a sparsification method based on the approximately linear dependence analysis is used. Using the sparse kernel machines, two kernel-based ACD algorithms, that is, kernel HDP (KHDP) and kernel DHP (KDHP), are proposed and their performance is analyzed both theoretically and empirically. Because of the representation learning and generalization capability of sparse kernel machines, KHDP and KDHP can obtain much better performance than previous HDP and DHP with manually designed neural networks. Simulation and experimental results of two nonlinear control problems, that is, a continuous-action inverted pendulum problem and a ball and plate control problem, demonstrate the effectiveness of the proposed kernel ACD methods.

Wheat kernel dimensions: how do they contribute to kernel weight at ...

Indian Academy of Sciences (India)

2011-12-02

Dec 2, 2011 ... yield components, is greatly influenced by kernel dimensions. (KD), such as ..... six linkage gaps, and it covered 3010.70 cM of the whole genome with an ...... Ersoz E. et al. 2009 The Genetic architecture of maize flowering.

A multi-label learning based kernel automatic recommendation method for support vector machine.

Science.gov (United States)

Zhang, Xueying; Song, Qinbao

2015-01-01

Choosing an appropriate kernel is very important and critical when classifying a new problem with Support Vector Machine. So far, more attention has been paid on constructing new kernels and choosing suitable parameter values for a specific kernel function, but less on kernel selection. Furthermore, most of current kernel selection methods focus on seeking a best kernel with the highest classification accuracy via cross-validation, they are time consuming and ignore the differences among the number of support vectors and the CPU time of SVM with different kernels. Considering the tradeoff between classification success ratio and CPU time, there may be multiple kernel functions performing equally well on the same classification problem. Aiming to automatically select those appropriate kernel functions for a given data set, we propose a multi-label learning based kernel recommendation method built on the data characteristics. For each data set, the meta-knowledge data base is first created by extracting the feature vector of data characteristics and identifying the corresponding applicable kernel set. Then the kernel recommendation model is constructed on the generated meta-knowledge data base with the multi-label classification method. Finally, the appropriate kernel functions are recommended to a new data set by the recommendation model according to the characteristics of the new data set. Extensive experiments over 132 UCI benchmark data sets, with five different types of data set characteristics, eleven typical kernels (Linear, Polynomial, Radial Basis Function, Sigmoidal function, Laplace, Multiquadric, Rational Quadratic, Spherical, Spline, Wave and Circular), and five multi-label classification methods demonstrate that, compared with the existing kernel selection methods and the most widely used RBF kernel function, SVM with the kernel function recommended by our proposed method achieved the highest classification performance.

Using the Intel Math Kernel Library on Peregrine | High-Performance

Science.gov (United States)

Computing | NREL the Intel Math Kernel Library on Peregrine Using the Intel Math Kernel Library on Peregrine Learn how to use the Intel Math Kernel Library (MKL) with Peregrine system software. MKL architectures. Core math functions in MKL include BLAS, LAPACK, ScaLAPACK, sparse solvers, fast Fourier

Protein fold recognition using geometric kernel data fusion.

Science.gov (United States)

Zakeri, Pooya; Jeuris, Ben; Vandebril, Raf; Moreau, Yves

2014-07-01

Various approaches based on features extracted from protein sequences and often machine learning methods have been used in the prediction of protein folds. Finding an efficient technique for integrating these different protein features has received increasing attention. In particular, kernel methods are an interesting class of techniques for integrating heterogeneous data. Various methods have been proposed to fuse multiple kernels. Most techniques for multiple kernel learning focus on learning a convex linear combination of base kernels. In addition to the limitation of linear combinations, working with such approaches could cause a loss of potentially useful information. We design several techniques to combine kernel matrices by taking more involved, geometry inspired means of these matrices instead of convex linear combinations. We consider various sequence-based protein features including information extracted directly from position-specific scoring matrices and local sequence alignment. We evaluate our methods for classification on the SCOP PDB-40D benchmark dataset for protein fold recognition. The best overall accuracy on the protein fold recognition test set obtained by our methods is ∼ 86.7%. This is an improvement over the results of the best existing approach. Moreover, our computational model has been developed by incorporating the functional domain composition of proteins through a hybridization model. It is observed that by using our proposed hybridization model, the protein fold recognition accuracy is further improved to 89.30%. Furthermore, we investigate the performance of our approach on the protein remote homology detection problem by fusing multiple string kernels. The MATLAB code used for our proposed geometric kernel fusion frameworks are publicly available at http://people.cs.kuleuven.be/∼raf.vandebril/homepage/software/geomean.php?menu=5/. © The Author 2014. Published by Oxford University Press.

Unsupervised multiple kernel learning for heterogeneous data integration.

Science.gov (United States)

Mariette, Jérôme; Villa-Vialaneix, Nathalie

2018-03-15

Recent high-throughput sequencing advances have expanded the breadth of available omics datasets and the integrated analysis of multiple datasets obtained on the same samples has allowed to gain important insights in a wide range of applications. However, the integration of various sources of information remains a challenge for systems biology since produced datasets are often of heterogeneous types, with the need of developing generic methods to take their different specificities into account. We propose a multiple kernel framework that allows to integrate multiple datasets of various types into a single exploratory analysis. Several solutions are provided to learn either a consensus meta-kernel or a meta-kernel that preserves the original topology of the datasets. We applied our framework to analyse two public multi-omics datasets. First, the multiple metagenomic datasets, collected during the TARA Oceans expedition, was explored to demonstrate that our method is able to retrieve previous findings in a single kernel PCA as well as to provide a new image of the sample structures when a larger number of datasets are included in the analysis. To perform this analysis, a generic procedure is also proposed to improve the interpretability of the kernel PCA in regards with the original data. Second, the multi-omics breast cancer datasets, provided by The Cancer Genome Atlas, is analysed using a kernel Self-Organizing Maps with both single and multi-omics strategies. The comparison of these two approaches demonstrates the benefit of our integration method to improve the representation of the studied biological system. Proposed methods are available in the R package mixKernel, released on CRAN. It is fully compatible with the mixOmics package and a tutorial describing the approach can be found on mixOmics web site http://mixomics.org/mixkernel/. jerome.mariette@inra.fr or nathalie.villa-vialaneix@inra.fr. Supplementary data are available at Bioinformatics online.

Kernel bundle EPDiff

DEFF Research Database (Denmark)

Sommer, Stefan Horst; Lauze, Francois Bernard; Nielsen, Mads

2011-01-01

In the LDDMM framework, optimal warps for image registration are found as end-points of critical paths for an energy functional, and the EPDiff equations describe the evolution along such paths. The Large Deformation Diffeomorphic Kernel Bundle Mapping (LDDKBM) extension of LDDMM allows scale space...

Localized Multiple Kernel Learning Via Sample-Wise Alternating Optimization.

Science.gov (United States)

Han, Yina; Yang, Kunde; Ma, Yuanliang; Liu, Guizhong

2014-01-01

Our objective is to train support vector machines (SVM)-based localized multiple kernel learning (LMKL), using the alternating optimization between the standard SVM solvers with the local combination of base kernels and the sample-specific kernel weights. The advantage of alternating optimization developed from the state-of-the-art MKL is the SVM-tied overall complexity and the simultaneous optimization on both the kernel weights and the classifier. Unfortunately, in LMKL, the sample-specific character makes the updating of kernel weights a difficult quadratic nonconvex problem. In this paper, starting from a new primal-dual equivalence, the canonical objective on which state-of-the-art methods are based is first decomposed into an ensemble of objectives corresponding to each sample, namely, sample-wise objectives. Then, the associated sample-wise alternating optimization method is conducted, in which the localized kernel weights can be independently obtained by solving their exclusive sample-wise objectives, either linear programming (for l1-norm) or with closed-form solutions (for lp-norm). At test time, the learnt kernel weights for the training data are deployed based on the nearest-neighbor rule. Hence, to guarantee their generality among the test part, we introduce the neighborhood information and incorporate it into the empirical loss when deriving the sample-wise objectives. Extensive experiments on four benchmark machine learning datasets and two real-world computer vision datasets demonstrate the effectiveness and efficiency of the proposed algorithm.

Bifurcation analysis in the diffusive Lotka-Volterra system: An application to market economy

International Nuclear Information System (INIS)

Wijeratne, A.W.; Yi Fengqi; Wei Junjie

2009-01-01

A diffusive Lotka-Volterra system is formulated in this paper that represents the dynamics of market share at duopoly. A case in Sri Lankan mobile telecom market was considered that conceptualized the model in interest. Detailed Hopf bifurcation, transcritical and pitchfork bifurcation analysis were performed. The distribution of roots of the characteristic equation suggests that a stable coexistence equilibrium can be achieved by increasing the innovation while minimizing competition by each competitor while regulating existing policies and introducing new ones for product differentiation and value addition. The avenue is open for future research that may use real time information in order to formulate mathematically sound tools for decision making in competitive business environments.

Bifurcation analysis in the diffusive Lotka-Volterra system: An application to market economy

Energy Technology Data Exchange (ETDEWEB)

Wijeratne, A.W. [Department of Mathematics, Harbin Institute of Technology, Harbin 150001 (China); Department of Agri-Business Management, Sabaragamuwa University of Sri Lanka, Belihuloya 70140 (Sri Lanka); Yi Fengqi [Department of Mathematics, Harbin Institute of Technology, Harbin 150001 (China); Wei Junjie [Department of Mathematics, Harbin Institute of Technology, Harbin 150001 (China)], E-mail: weijj@hit.edu.cn

2009-04-30

A diffusive Lotka-Volterra system is formulated in this paper that represents the dynamics of market share at duopoly. A case in Sri Lankan mobile telecom market was considered that conceptualized the model in interest. Detailed Hopf bifurcation, transcritical and pitchfork bifurcation analysis were performed. The distribution of roots of the characteristic equation suggests that a stable coexistence equilibrium can be achieved by increasing the innovation while minimizing competition by each competitor while regulating existing policies and introducing new ones for product differentiation and value addition. The avenue is open for future research that may use real time information in order to formulate mathematically sound tools for decision making in competitive business environments.

Control Transfer in Operating System Kernels

Science.gov (United States)

1994-05-13

microkernel system that runs less code in the kernel address space. To realize the performance benefit of allocating stacks in unmapped kseg0 memory, the...review how I modified the Mach 3.0 kernel to use continuations. Because of Mach’s message-passing microkernel structure, interprocess communication was...critical control transfer paths, deeply- nested call chains are undesirable in any case because of the function call overhead. 4.1.3 Microkernel Operating

Bivariate discrete beta Kernel graduation of mortality data.

Science.gov (United States)

Mazza, Angelo; Punzo, Antonio

2015-07-01

Various parametric/nonparametric techniques have been proposed in literature to graduate mortality data as a function of age. Nonparametric approaches, as for example kernel smoothing regression, are often preferred because they do not assume any particular mortality law. Among the existing kernel smoothing approaches, the recently proposed (univariate) discrete beta kernel smoother has been shown to provide some benefits. Bivariate graduation, over age and calendar years or durations, is common practice in demography and actuarial sciences. In this paper, we generalize the discrete beta kernel smoother to the bivariate case, and we introduce an adaptive bandwidth variant that may provide additional benefits when data on exposures to the risk of death are available; furthermore, we outline a cross-validation procedure for bandwidths selection. Using simulations studies, we compare the bivariate approach proposed here with its corresponding univariate formulation and with two popular nonparametric bivariate graduation techniques, based on Epanechnikov kernels and on P-splines. To make simulations realistic, a bivariate dataset, based on probabilities of dying recorded for the US males, is used. Simulations have confirmed the gain in performance of the new bivariate approach with respect to both the univariate and the bivariate competitors.

A framework for optimal kernel-based manifold embedding of medical image data.

Science.gov (United States)

Zimmer, Veronika A; Lekadir, Karim; Hoogendoorn, Corné; Frangi, Alejandro F; Piella, Gemma

2015-04-01

Kernel-based dimensionality reduction is a widely used technique in medical image analysis. To fully unravel the underlying nonlinear manifold the selection of an adequate kernel function and of its free parameters is critical. In practice, however, the kernel function is generally chosen as Gaussian or polynomial and such standard kernels might not always be optimal for a given image dataset or application. In this paper, we present a study on the effect of the kernel functions in nonlinear manifold embedding of medical image data. To this end, we first carry out a literature review on existing advanced kernels developed in the statistics, machine learning, and signal processing communities. In addition, we implement kernel-based formulations of well-known nonlinear dimensional reduction techniques such as Isomap and Locally Linear Embedding, thus obtaining a unified framework for manifold embedding using kernels. Subsequently, we present a method to automatically choose a kernel function and its associated parameters from a pool of kernel candidates, with the aim to generate the most optimal manifold embeddings. Furthermore, we show how the calculated selection measures can be extended to take into account the spatial relationships in images, or used to combine several kernels to further improve the embedding results. Experiments are then carried out on various synthetic and phantom datasets for numerical assessment of the methods. Furthermore, the workflow is applied to real data that include brain manifolds and multispectral images to demonstrate the importance of the kernel selection in the analysis of high-dimensional medical images. Copyright © 2014 Elsevier Ltd. All rights reserved.

Measurement of Weight of Kernels in a Simulated Cylindrical Fuel Compact for HTGR

International Nuclear Information System (INIS)

Kim, Woong Ki; Lee, Young Woo; Kim, Young Min; Kim, Yeon Ku; Eom, Sung Ho; Jeong, Kyung Chai; Cho, Moon Sung; Cho, Hyo Jin; Kim, Joo Hee

2011-01-01

The TRISO-coated fuel particle for the high temperature gas-cooled reactor (HTGR) is composed of a nuclear fuel kernel and outer coating layers. The coated particles are mixed with graphite matrix to make HTGR fuel element. The weight of fuel kernels in an element is generally measured by the chemical analysis or a gamma-ray spectrometer. Although it is accurate to measure the weight of kernels by the chemical analysis, the samples used in the analysis cannot be put again in the fabrication process. Furthermore, radioactive wastes are generated during the inspection procedure. The gamma-ray spectrometer requires an elaborate reference sample to reduce measurement errors induced from the different geometric shape of test sample from that of reference sample. X-ray computed tomography (CT) is an alternative to measure the weight of kernels in a compact nondestructively. In this study, X-ray CT is applied to measure the weight of kernels in a cylindrical compact containing simulated TRISO-coated particles with ZrO 2 kernels. The volume of kernels as well as the number of kernels in the simulated compact is measured from the 3-D density information. The weight of kernels was calculated from the volume of kernels or the number of kernels. Also, the weight of kernels was measured by extracting the kernels from a compact to review the result of the X-ray CT application

3-D waveform tomography sensitivity kernels for anisotropic media

KAUST Repository

Djebbi, Ramzi

2014-01-01

The complications in anisotropic multi-parameter inversion lie in the trade-off between the different anisotropy parameters. We compute the tomographic waveform sensitivity kernels for a VTI acoustic medium perturbation as a tool to investigate this ambiguity between the different parameters. We use dynamic ray tracing to efficiently handle the expensive computational cost for 3-D anisotropic models. Ray tracing provides also the ray direction information necessary for conditioning the sensitivity kernels to handle anisotropy. The NMO velocity and η parameter kernels showed a maximum sensitivity for diving waves which results in a relevant choice of those parameters in wave equation tomography. The δ parameter kernel showed zero sensitivity; therefore it can serve as a secondary parameter to fit the amplitude in the acoustic anisotropic inversion. Considering the limited penetration depth of diving waves, migration velocity analysis based kernels are introduced to fix the depth ambiguity with reflections and compute sensitivity maps in the deeper parts of the model.

A Fourier-series-based kernel-independent fast multipole method

International Nuclear Information System (INIS)

Zhang Bo; Huang Jingfang; Pitsianis, Nikos P.; Sun Xiaobai

2011-01-01

We present in this paper a new kernel-independent fast multipole method (FMM), named as FKI-FMM, for pairwise particle interactions with translation-invariant kernel functions. FKI-FMM creates, using numerical techniques, sufficiently accurate and compressive representations of a given kernel function over multi-scale interaction regions in the form of a truncated Fourier series. It provides also economic operators for the multipole-to-multipole, multipole-to-local, and local-to-local translations that are typical and essential in the FMM algorithms. The multipole-to-local translation operator, in particular, is readily diagonal and does not dominate in arithmetic operations. FKI-FMM provides an alternative and competitive option, among other kernel-independent FMM algorithms, for an efficient application of the FMM, especially for applications where the kernel function consists of multi-physics and multi-scale components as those arising in recent studies of biological systems. We present the complexity analysis and demonstrate with experimental results the FKI-FMM performance in accuracy and efficiency.

Resummed memory kernels in generalized system-bath master equations

International Nuclear Information System (INIS)

Mavros, Michael G.; Van Voorhis, Troy

2014-01-01

Generalized master equations provide a concise formalism for studying reduced population dynamics. Usually, these master equations require a perturbative expansion of the memory kernels governing the dynamics; in order to prevent divergences, these expansions must be resummed. Resummation techniques of perturbation series are ubiquitous in physics, but they have not been readily studied for the time-dependent memory kernels used in generalized master equations. In this paper, we present a comparison of different resummation techniques for such memory kernels up to fourth order. We study specifically the spin-boson Hamiltonian as a model system bath Hamiltonian, treating the diabatic coupling between the two states as a perturbation. A novel derivation of the fourth-order memory kernel for the spin-boson problem is presented; then, the second- and fourth-order kernels are evaluated numerically for a variety of spin-boson parameter regimes. We find that resumming the kernels through fourth order using a Padé approximant results in divergent populations in the strong electronic coupling regime due to a singularity introduced by the nature of the resummation, and thus recommend a non-divergent exponential resummation (the “Landau-Zener resummation” of previous work). The inclusion of fourth-order effects in a Landau-Zener-resummed kernel is shown to improve both the dephasing rate and the obedience of detailed balance over simpler prescriptions like the non-interacting blip approximation, showing a relatively quick convergence on the exact answer. The results suggest that including higher-order contributions to the memory kernel of a generalized master equation and performing an appropriate resummation can provide a numerically-exact solution to system-bath dynamics for a general spectral density, opening the way to a new class of methods for treating system-bath dynamics

The dipole form of the gluon part of the BFKL kernel

International Nuclear Information System (INIS)

Fadin, V.S.; Fiore, R.; Grabovsky, A.V.; Papa, A.

2007-01-01

The dipole form of the gluon part of the color singlet BFKL kernel in the next-to-leading order (NLO) is obtained in the coordinate representation by direct transfer from the momentum representation, where the kernel was calculated before. With this paper the transformation of the NLO BFKL kernel to the dipole form, started a few months ago with the quark part of the kernel, is completed

Improving prediction of heterodimeric protein complexes using combination with pairwise kernel.

Science.gov (United States)

Ruan, Peiying; Hayashida, Morihiro; Akutsu, Tatsuya; Vert, Jean-Philippe

2018-02-19

Since many proteins become functional only after they interact with their partner proteins and form protein complexes, it is essential to identify the sets of proteins that form complexes. Therefore, several computational methods have been proposed to predict complexes from the topology and structure of experimental protein-protein interaction (PPI) network. These methods work well to predict complexes involving at least three proteins, but generally fail at identifying complexes involving only two different proteins, called heterodimeric complexes or heterodimers. There is however an urgent need for efficient methods to predict heterodimers, since the majority of known protein complexes are precisely heterodimers. In this paper, we use three promising kernel functions, Min kernel and two pairwise kernels, which are Metric Learning Pairwise Kernel (MLPK) and Tensor Product Pairwise Kernel (TPPK). We also consider the normalization forms of Min kernel. Then, we combine Min kernel or its normalization form and one of the pairwise kernels by plugging. We applied kernels based on PPI, domain, phylogenetic profile, and subcellular localization properties to predicting heterodimers. Then, we evaluate our method by employing C-Support Vector Classification (C-SVC), carrying out 10-fold cross-validation, and calculating the average F-measures. The results suggest that the combination of normalized-Min-kernel and MLPK leads to the best F-measure and improved the performance of our previous work, which had been the best existing method so far. We propose new methods to predict heterodimers, using a machine learning-based approach. We train a support vector machine (SVM) to discriminate interacting vs non-interacting protein pairs, based on informations extracted from PPI, domain, phylogenetic profiles and subcellular localization. We evaluate in detail new kernel functions to encode these data, and report prediction performance that outperforms the state-of-the-art.

A modified Lotka-Volterra model for the evolution of coordinate symbiosis in energy enterprise

Science.gov (United States)

Zhou, Li; Wang, Teng; Lyu, Xiaohuan; Yu, Jing

2018-02-01

Recent developments in energy markets make the operating industries more dynamic and complex, and energy enterprises cooperate more closely in the industrial chain and symbiosis. In order to further discuss the evolution of coordinate symbiosis in energy enterprises, a modified Lotka-Volterra equation is introduced to develop a symbiosis analysis model of energy groups. According to the equilibrium and stability analysis, a conclusion is obtained that if the upstream energy group and the downstream energy group are in symbiotic state, the growth of their utility will be greater than their independent value. Energy enterprises can get mutual benefits and positive promotions in industrial chain by their cooperation.

A new discrete dipole kernel for quantitative susceptibility mapping.

Science.gov (United States)

Milovic, Carlos; Acosta-Cabronero, Julio; Pinto, José Miguel; Mattern, Hendrik; Andia, Marcelo; Uribe, Sergio; Tejos, Cristian

2018-09-01

Most approaches for quantitative susceptibility mapping (QSM) are based on a forward model approximation that employs a continuous Fourier transform operator to solve a differential equation system. Such formulation, however, is prone to high-frequency aliasing. The aim of this study was to reduce such errors using an alternative dipole kernel formulation based on the discrete Fourier transform and discrete operators. The impact of such an approach on forward model calculation and susceptibility inversion was evaluated in contrast to the continuous formulation both with synthetic phantoms and in vivo MRI data. The discrete kernel demonstrated systematically better fits to analytic field solutions, and showed less over-oscillations and aliasing artifacts while preserving low- and medium-frequency responses relative to those obtained with the continuous kernel. In the context of QSM estimation, the use of the proposed discrete kernel resulted in error reduction and increased sharpness. This proof-of-concept study demonstrated that discretizing the dipole kernel is advantageous for QSM. The impact on small or narrow structures such as the venous vasculature might by particularly relevant to high-resolution QSM applications with ultra-high field MRI - a topic for future investigations. The proposed dipole kernel has a straightforward implementation to existing QSM routines. Copyright © 2018 Elsevier Inc. All rights reserved.

Genetic Analysis of Kernel Traits in Maize-Teosinte Introgression Populations

Directory of Open Access Journals (Sweden)

Zhengbin Liu

2016-08-01

Full Text Available Seed traits have been targeted by human selection during the domestication of crop species as a way to increase the caloric and nutritional content of food during the transition from hunter-gather to early farming societies. The primary seed trait under selection was likely seed size/weight as it is most directly related to overall grain yield. Additional seed traits involved in seed shape may have also contributed to larger grain. Maize (Zea mays ssp. mays kernel weight has increased more than 10-fold in the 9000 years since domestication from its wild ancestor, teosinte (Z. mays ssp. parviglumis. In order to study how size and shape affect kernel weight, we analyzed kernel morphometric traits in a set of 10 maize-teosinte introgression populations using digital imaging software. We identified quantitative trait loci (QTL for kernel area and length with moderate allelic effects that colocalize with kernel weight QTL. Several genomic regions with strong effects during maize domestication were detected, and a genetic framework for kernel traits was characterized by complex pleiotropic interactions. Our results both confirm prior reports of kernel domestication loci and identify previously uncharacterized QTL with a range of allelic effects, enabling future research into the genetic basis of these traits.

SU-E-T-154: Calculation of Tissue Dose Point Kernels Using GATE Monte Carlo Simulation Toolkit to Compare with Water Dose Point Kernel

Energy Technology Data Exchange (ETDEWEB)

Khazaee, M [shahid beheshti university, Tehran, Tehran (Iran, Islamic Republic of); Asl, A Kamali [Shahid Beheshti University, Tehran, Iran., Tehran, Tehran (Iran, Islamic Republic of); Geramifar, P [Shariati Hospital, Tehran, Iran., Tehran, Tehran (Iran, Islamic Republic of)

2015-06-15

Purpose: the objective of this study was to assess utilizing water dose point kernel (DPK)instead of tissue dose point kernels in convolution algorithms.to the best of our knowledge, in providing 3D distribution of absorbed dose from a 3D distribution of the activity, the human body is considered equivalent to water. as a Result tissue variations are not considered in patient specific dosimetry. Methods: In this study Gate v7.0 was used to calculate tissue dose point kernel. the beta emitter radionuclides which have taken into consideration in this simulation include Y-90, Lu-177 and P-32 which are commonly used in nuclear medicine. the comparison has been performed for dose point kernels of adipose, bone, breast, heart, intestine, kidney, liver, lung and spleen versus water dose point kernel. Results: In order to validate the simulation the Result of 90Y DPK in water were compared with published results of Papadimitroulas et al (Med. Phys., 2012). The results represented that the mean differences between water DPK and other soft tissues DPKs range between 0.6 % and 1.96% for 90Y, except for lung and bone, where the observed discrepancies are 6.3% and 12.19% respectively. The range of DPK difference for 32P is between 1.74% for breast and 18.85% for bone. For 177Lu, the highest difference belongs to bone which is equal to 16.91%. For other soft tissues the least discrepancy is observed in kidney with 1.68%. Conclusion: In all tissues except for lung and bone, the results of GATE for dose point kernel were comparable to water dose point kernel which demonstrates the appropriateness of applying water dose point kernel instead of soft tissues in the field of nuclear medicine.

SU-E-T-154: Calculation of Tissue Dose Point Kernels Using GATE Monte Carlo Simulation Toolkit to Compare with Water Dose Point Kernel

International Nuclear Information System (INIS)

Khazaee, M; Asl, A Kamali; Geramifar, P

2015-01-01

Purpose: the objective of this study was to assess utilizing water dose point kernel (DPK)instead of tissue dose point kernels in convolution algorithms.to the best of our knowledge, in providing 3D distribution of absorbed dose from a 3D distribution of the activity, the human body is considered equivalent to water. as a Result tissue variations are not considered in patient specific dosimetry. Methods: In this study Gate v7.0 was used to calculate tissue dose point kernel. the beta emitter radionuclides which have taken into consideration in this simulation include Y-90, Lu-177 and P-32 which are commonly used in nuclear medicine. the comparison has been performed for dose point kernels of adipose, bone, breast, heart, intestine, kidney, liver, lung and spleen versus water dose point kernel. Results: In order to validate the simulation the Result of 90Y DPK in water were compared with published results of Papadimitroulas et al (Med. Phys., 2012). The results represented that the mean differences between water DPK and other soft tissues DPKs range between 0.6 % and 1.96% for 90Y, except for lung and bone, where the observed discrepancies are 6.3% and 12.19% respectively. The range of DPK difference for 32P is between 1.74% for breast and 18.85% for bone. For 177Lu, the highest difference belongs to bone which is equal to 16.91%. For other soft tissues the least discrepancy is observed in kidney with 1.68%. Conclusion: In all tissues except for lung and bone, the results of GATE for dose point kernel were comparable to water dose point kernel which demonstrates the appropriateness of applying water dose point kernel instead of soft tissues in the field of nuclear medicine

Scientific opinion on the acute health risks related to the presence of cyanogenic glycosides in raw apricot kernels and products derived from raw apricot kernels

DEFF Research Database (Denmark)

Petersen, Annette

of kernels promoted (10 and 60 kernels/day for the general population and cancer patients, respectively), exposures exceeded the ARfD 17–413 and 3–71 times in toddlers and adults, respectively. The estimated maximum quantity of apricot kernels (or raw apricot material) that can be consumed without exceeding...

Kernel Function Tuning for Single-Layer Neural Networks

Czech Academy of Sciences Publication Activity Database

Vidnerová, Petra; Neruda, Roman

-, accepted 28.11. 2017 (2018) ISSN 2278-0149 R&D Projects: GA ČR GA15-18108S Institutional support: RVO:67985807 Keywords : single-layer neural networks * kernel methods * kernel function * optimisation Subject RIV: IN - Informatics, Computer Science http://www.ijmerr.com/

Broken rice kernels and the kinetics of rice hydration and texture during cooking.

Science.gov (United States)

Saleh, Mohammed; Meullenet, Jean-Francois

2013-05-01

During rice milling and processing, broken kernels are inevitably present, although to date it has been unclear as to how the presence of broken kernels affects rice hydration and cooked rice texture. Therefore, this work intended to study the effect of broken kernels in a rice sample on rice hydration and texture during cooking. Two medium-grain and two long-grain rice cultivars were harvested, dried and milled, and the broken kernels were separated from unbroken kernels. Broken rice kernels were subsequently combined with unbroken rice kernels forming treatments of 0, 40, 150, 350 or 1000 g kg(-1) broken kernels ratio. Rice samples were then cooked and the moisture content of the cooked rice, the moisture uptake rate, and rice hardness and stickiness were measured. As the amount of broken rice kernels increased, rice sample texture became increasingly softer (P hardness was negatively correlated to the percentage of broken kernels in rice samples. Differences in the proportions of broken rice in a milled rice sample play a major role in determining the texture properties of cooked rice. Variations in the moisture migration kinetics between broken and unbroken kernels caused faster hydration of the cores of broken rice kernels, with greater starch leach-out during cooking affecting the texture of the cooked rice. The texture of cooked rice can be controlled, to some extent, by varying the proportion of broken kernels in milled rice. © 2012 Society of Chemical Industry.

Stochastic Lotka-Volterra equations: A model of lagged diffusion of technology in an interconnected world

Science.gov (United States)

Chakrabarti, Anindya S.

2016-01-01

We present a model of technological evolution due to interaction between multiple countries and the resultant effects on the corresponding macro variables. The world consists of a set of economies where some countries are leaders and some are followers in the technology ladder. All of them potentially gain from technological breakthroughs. Applying Lotka-Volterra (LV) equations to model evolution of the technology frontier, we show that the way technology diffuses creates repercussions in the partner economies. This process captures the spill-over effects on major macro variables seen in the current highly globalized world due to trickle-down effects of technology.

Local and global stability for Lotka-Volterra systems with distributed delays and instantaneous negative feedbacks

Science.gov (United States)

Faria, Teresa; Oliveira, José J.

This paper addresses the local and global stability of n-dimensional Lotka-Volterra systems with distributed delays and instantaneous negative feedbacks. Necessary and sufficient conditions for local stability independent of the choice of the delay functions are given, by imposing a weak nondelayed diagonal dominance which cancels the delayed competition effect. The global asymptotic stability of positive equilibria is established under conditions slightly stronger than the ones required for the linear stability. For the case of monotone interactions, however, sharper conditions are presented. This paper generalizes known results for discrete delays to systems with distributed delays. Several applications illustrate the results.

Local coding based matching kernel method for image classification.

Directory of Open Access Journals (Sweden)

Yan Song

Full Text Available This paper mainly focuses on how to effectively and efficiently measure visual similarity for local feature based representation. Among existing methods, metrics based on Bag of Visual Word (BoV techniques are efficient and conceptually simple, at the expense of effectiveness. By contrast, kernel based metrics are more effective, but at the cost of greater computational complexity and increased storage requirements. We show that a unified visual matching framework can be developed to encompass both BoV and kernel based metrics, in which local kernel plays an important role between feature pairs or between features and their reconstruction. Generally, local kernels are defined using Euclidean distance or its derivatives, based either explicitly or implicitly on an assumption of Gaussian noise. However, local features such as SIFT and HoG often follow a heavy-tailed distribution which tends to undermine the motivation behind Euclidean metrics. Motivated by recent advances in feature coding techniques, a novel efficient local coding based matching kernel (LCMK method is proposed. This exploits the manifold structures in Hilbert space derived from local kernels. The proposed method combines advantages of both BoV and kernel based metrics, and achieves a linear computational complexity. This enables efficient and scalable visual matching to be performed on large scale image sets. To evaluate the effectiveness of the proposed LCMK method, we conduct extensive experiments with widely used benchmark datasets, including 15-Scenes, Caltech101/256, PASCAL VOC 2007 and 2011 datasets. Experimental results confirm the effectiveness of the relatively efficient LCMK method.

Dynamic behaviors of the periodic Lotka-Volterra competing system with impulsive perturbations

International Nuclear Information System (INIS)

Liu Bing; Teng Zhidong; Liu Wanbo

2007-01-01

In this paper, we investigate a classical periodic Lotka-Volterra competing system with impulsive perturbations. The conditions for the linear stability of trivial periodic solution and semi-trivial periodic solutions are given by applying Floquet theory of linear periodic impulsive equation, and we also give the conditions for the global stability of these solutions as a consequence of some abstract monotone iterative schemes introduced in this paper, which will be also used to get some sufficient conditions for persistence. By using the method of coincidence degree, the conditions for the existence of at least one strictly positive (componentwise) periodic solution are derived. The theoretical results are confirmed by a specific example and numerical simulations. It shows that the dynamic behaviors of the system we consider are quite different from the corresponding system without pulses

Multivariate realised kernels

DEFF Research Database (Denmark)

Barndorff-Nielsen, Ole; Hansen, Peter Reinhard; Lunde, Asger

We propose a multivariate realised kernel to estimate the ex-post covariation of log-prices. We show this new consistent estimator is guaranteed to be positive semi-definite and is robust to measurement noise of certain types and can also handle non-synchronous trading. It is the first estimator...

Process for producing metal oxide kernels and kernels so obtained

International Nuclear Information System (INIS)

Lelievre, Bernard; Feugier, Andre.

1974-01-01

The process desbribed is for producing fissile or fertile metal oxide kernels used in the fabrication of fuels for high temperature nuclear reactors. This process consists in adding to an aqueous solution of at least one metallic salt, particularly actinide nitrates, at least one chemical compound capable of releasing ammonia, in dispersing drop by drop the solution thus obtained into a hot organic phase to gel the drops and transform them into solid particles. These particles are then washed, dried and treated to turn them into oxide kernels. The organic phase used for the gel reaction is formed of a mixture composed of two organic liquids, one acting as solvent and the other being a product capable of extracting the anions from the metallic salt of the drop at the time of gelling. Preferably an amine is used as product capable of extracting the anions. Additionally, an alcohol that causes a part dehydration of the drops can be employed as solvent, thus helping to increase the resistance of the particles [fr

Ideal Gas Resonance Scattering Kernel Routine for the NJOY Code

International Nuclear Information System (INIS)

Rothenstein, W.

1999-01-01

In a recent publication an expression for the temperature-dependent double-differential ideal gas scattering kernel is derived for the case of scattering cross sections that are energy dependent. Some tabulations and graphical representations of the characteristics of these kernels are presented in Ref. 2. They demonstrate the increased probability that neutron scattering by a heavy nuclide near one of its pronounced resonances will bring the neutron energy nearer to the resonance peak. This enhances upscattering, when a neutron with energy just below that of the resonance peak collides with such a nuclide. A routine for using the new kernel has now been introduced into the NJOY code. Here, its principal features are described, followed by comparisons between scattering data obtained by the new kernel, and the standard ideal gas kernel, when such comparisons are meaningful (i.e., for constant values of the scattering cross section a 0 K). The new ideal gas kernel for variable σ s 0 (E) at 0 K leads to the correct Doppler-broadened σ s T (E) at temperature T

Geodesic exponential kernels: When Curvature and Linearity Conflict

DEFF Research Database (Denmark)

Feragen, Aase; Lauze, François; Hauberg, Søren

2015-01-01

manifold, the geodesic Gaussian kernel is only positive definite if the Riemannian manifold is Euclidean. This implies that any attempt to design geodesic Gaussian kernels on curved Riemannian manifolds is futile. However, we show that for spaces with conditionally negative definite distances the geodesic...

Real time kernel performance monitoring with SystemTap

CERN Multimedia

CERN. Geneva

2018-01-01

SystemTap is a dynamic method of monitoring and tracing the operation of a running Linux kernel. In this talk I will present a few practical use cases where SystemTap allowed me to turn otherwise complex userland monitoring tasks in simple kernel probes.

Comparative Analysis of Kernel Methods for Statistical Shape Learning

National Research Council Canada - National Science Library

Rathi, Yogesh; Dambreville, Samuel; Tannenbaum, Allen

2006-01-01

.... In this work, we perform a comparative analysis of shape learning techniques such as linear PCA, kernel PCA, locally linear embedding and propose a new method, kernelized locally linear embedding...

Semi-supervised learning for ordinal Kernel Discriminant Analysis.

Science.gov (United States)

Pérez-Ortiz, M; Gutiérrez, P A; Carbonero-Ruz, M; Hervás-Martínez, C

2016-12-01

Ordinal classification considers those classification problems where the labels of the variable to predict follow a given order. Naturally, labelled data is scarce or difficult to obtain in this type of problems because, in many cases, ordinal labels are given by a user or expert (e.g. in recommendation systems). Firstly, this paper develops a new strategy for ordinal classification where both labelled and unlabelled data are used in the model construction step (a scheme which is referred to as semi-supervised learning). More specifically, the ordinal version of kernel discriminant learning is extended for this setting considering the neighbourhood information of unlabelled data, which is proposed to be computed in the feature space induced by the kernel function. Secondly, a new method for semi-supervised kernel learning is devised in the context of ordinal classification, which is combined with our developed classification strategy to optimise the kernel parameters. The experiments conducted compare 6 different approaches for semi-supervised learning in the context of ordinal classification in a battery of 30 datasets, showing (1) the good synergy of the ordinal version of discriminant analysis and the use of unlabelled data and (2) the advantage of computing distances in the feature space induced by the kernel function. Copyright © 2016 Elsevier Ltd. All rights reserved.

Ideal gas scattering kernel for energy dependent cross-sections

International Nuclear Information System (INIS)

Rothenstein, W.; Dagan, R.

1998-01-01

A third, and final, paper on the calculation of the joint kernel for neutron scattering by an ideal gas in thermal agitation is presented, when the scattering cross-section is energy dependent. The kernel is a function of the neutron energy after scattering, and of the cosine of the scattering angle, as in the case of the ideal gas kernel for a constant bound atom scattering cross-section. The final expression is suitable for numerical calculations

Parameter optimization in the regularized kernel minimum noise fraction transformation

DEFF Research Database (Denmark)

Nielsen, Allan Aasbjerg; Vestergaard, Jacob Schack

2012-01-01

Based on the original, linear minimum noise fraction (MNF) transformation and kernel principal component analysis, a kernel version of the MNF transformation was recently introduced. Inspired by we here give a simple method for finding optimal parameters in a regularized version of kernel MNF...... analysis. We consider the model signal-to-noise ratio (SNR) as a function of the kernel parameters and the regularization parameter. In 2-4 steps of increasingly refined grid searches we find the parameters that maximize the model SNR. An example based on data from the DLR 3K camera system is given....

On flame kernel formation and propagation in premixed gases

Energy Technology Data Exchange (ETDEWEB)

Eisazadeh-Far, Kian; Metghalchi, Hameed [Northeastern University, Mechanical and Industrial Engineering Department, Boston, MA 02115 (United States); Parsinejad, Farzan [Chevron Oronite Company LLC, Richmond, CA 94801 (United States); Keck, James C. [Massachusetts Institute of Technology, Cambridge, MA 02139 (United States)

2010-12-15

Flame kernel formation and propagation in premixed gases have been studied experimentally and theoretically. The experiments have been carried out at constant pressure and temperature in a constant volume vessel located in a high speed shadowgraph system. The formation and propagation of the hot plasma kernel has been simulated for inert gas mixtures using a thermodynamic model. The effects of various parameters including the discharge energy, radiation losses, initial temperature and initial volume of the plasma have been studied in detail. The experiments have been extended to flame kernel formation and propagation of methane/air mixtures. The effect of energy terms including spark energy, chemical energy and energy losses on flame kernel formation and propagation have been investigated. The inputs for this model are the initial conditions of the mixture and experimental data for flame radii. It is concluded that these are the most important parameters effecting plasma kernel growth. The results of laminar burning speeds have been compared with previously published results and are in good agreement. (author)

Insights from Classifying Visual Concepts with Multiple Kernel Learning

Science.gov (United States)

Binder, Alexander; Nakajima, Shinichi; Kloft, Marius; Müller, Christina; Samek, Wojciech; Brefeld, Ulf; Müller, Klaus-Robert; Kawanabe, Motoaki

2012-01-01

Combining information from various image features has become a standard technique in concept recognition tasks. However, the optimal way of fusing the resulting kernel functions is usually unknown in practical applications. Multiple kernel learning (MKL) techniques allow to determine an optimal linear combination of such similarity matrices. Classical approaches to MKL promote sparse mixtures. Unfortunately, 1-norm regularized MKL variants are often observed to be outperformed by an unweighted sum kernel. The main contributions of this paper are the following: we apply a recently developed non-sparse MKL variant to state-of-the-art concept recognition tasks from the application domain of computer vision. We provide insights on benefits and limits of non-sparse MKL and compare it against its direct competitors, the sum-kernel SVM and sparse MKL. We report empirical results for the PASCAL VOC 2009 Classification and ImageCLEF2010 Photo Annotation challenge data sets. Data sets (kernel matrices) as well as further information are available at http://doc.ml.tu-berlin.de/image_mkl/(Accessed 2012 Jun 25). PMID:22936970

Verhulst-Lotka-Volterra (VLV) model of ideological struggle

Science.gov (United States)

Vitanov, Nikolay K.; Dimitrova, Zlatinka I.; Ausloos, Marcel

2010-11-01

A model for ideological struggles is formulated. The underlying set is a closed one, like a country but in which the population size is variable in time. The dynamics of the struggle is described by model equations of Verhulst-Lotka-Volterra kind. Several “ideologies” compete to increase their number of adepts. Such followers can be either converted from one ideology to another or become followers of an ideology though being previously ideologically-free. A reverse process is also allowed. Two kinds of conversions are considered: unitary conversion, e.g. by means of mass communication tools, or binary conversion, e.g. by means of interactions between people. It is found that the steady state, when it exists, depends on the number of ideologies. Moreover when the number of ideologies increases some tension arises between them. This tension can change in the course of time. We propose to measure the ideology tensions through an appropriately defined scale index. Finally it is shown that a slight change in the conditions of the environment can prevent the extinction of some ideology; after almost collapsing the ideology can spread again and can affect a significant part of the country’s population. Two kinds of such resurrection effects are described as phoenix effects.

A method for manufacturing kernels of metallic oxides and the thus obtained kernels

International Nuclear Information System (INIS)

Lelievre Bernard; Feugier, Andre.

1973-01-01

A method is described for manufacturing fissile or fertile metal oxide kernels, consisting in adding at least a chemical compound capable of releasing ammonia to an aqueous solution of actinide nitrates dispersing the thus obtained solution dropwise in a hot organic phase so as to gelify the drops and transform them into solid particles, washing drying and treating said particles so as to transform them into oxide kernels. Such a method is characterized in that the organic phase used in the gel-forming reactions comprises a mixture of two organic liquids, one of which acts as a solvent, whereas the other is a product capable of extracting the metal-salt anions from the drops while the gel forming reaction is taking place. This can be applied to the so-called high temperature nuclear reactors [fr

New Fukui, dual and hyper-dual kernels as bond reactivity descriptors.

Science.gov (United States)

Franco-Pérez, Marco; Polanco-Ramírez, Carlos-A; Ayers, Paul W; Gázquez, José L; Vela, Alberto

2017-06-21

We define three new linear response indices with promising applications for bond reactivity using the mathematical framework of τ-CRT (finite temperature chemical reactivity theory). The τ-Fukui kernel is defined as the ratio between the fluctuations of the average electron density at two different points in the space and the fluctuations in the average electron number and is designed to integrate to the finite-temperature definition of the electronic Fukui function. When this kernel is condensed, it can be interpreted as a site-reactivity descriptor of the boundary region between two atoms. The τ-dual kernel corresponds to the first order response of the Fukui kernel and is designed to integrate to the finite temperature definition of the dual descriptor; it indicates the ambiphilic reactivity of a specific bond and enriches the traditional dual descriptor by allowing one to distinguish between the electron-accepting and electron-donating processes. Finally, the τ-hyper dual kernel is defined as the second-order derivative of the Fukui kernel and is proposed as a measure of the strength of ambiphilic bonding interactions. Although these quantities have never been proposed, our results for the τ-Fukui kernel and for τ-dual kernel can be derived in zero-temperature formulation of the chemical reactivity theory with, among other things, the widely-used parabolic interpolation model.

Elucidating the consumption and CO_2 emissions of fossil fuels and low-carbon energy in the United States using Lotka–Volterra models

International Nuclear Information System (INIS)

Tsai, Bi-Huei; Chang, Chih-Jen; Chang, Chun-Hsien

2016-01-01

By using the Lotka–Volterra model, this work examines for the first time the feasibility of using low-carbon energy to reduce fossil fuel consumption in the United States and, ultimately, to decrease CO_2 emissions. The research sample in this work consists of data on energy consumption and CO_2 emissions in the United States. Parameter estimation results reveal that although the consumption of low-carbon energy increases the consumption of fossil fuels, the latter does not affect the former. Low-carbon energy usage, including nuclear energy and solar photovoltaic power, increases fossil fuel consumption because the entire lifetime of a nuclear or solar energy facility, from the construction of electricity plants to decommissioning, consumes tremendous amounts of fossil fuels. This result verifies the infeasibility of low-carbon energy to replace fossil fuels under the current mining technology, electricity generation skills and governmental policy in the United States and explains why the United States refused to become a signatory of the Kyoto Protocol. Equilibrium analysis results indicate that the annual consumption of fossil fuels will ultimately exceed that of low-carbon energy by 461%. Since our proposed Lotka–Volterra model accurately predicts the consumption and CO_2 emission of different energy sources, this work contributes to the energy policies. - Highlights: • Our Lotka–Volterra model accurately predicts consumption of different energy sources. • We find the current infeasibility of using low-carbon energy to reduce fossil fuels. • The set-up of nuclear and solar plants increases fossil fuel usage in the U.S. • The consumption of fossil fuels will exceed that of low-carbon energy by 435%. • United States government prefers economic development over environmental protection.

Quasi-Dual-Packed-Kerneled Au49 (2,4-DMBT)27 Nanoclusters and the Influence of Kernel Packing on the Electrochemical Gap.

Science.gov (United States)

Liao, Lingwen; Zhuang, Shengli; Wang, Pu; Xu, Yanan; Yan, Nan; Dong, Hongwei; Wang, Chengming; Zhao, Yan; Xia, Nan; Li, Jin; Deng, Haiteng; Pei, Yong; Tian, Shi-Kai; Wu, Zhikun

2017-10-02

Although face-centered cubic (fcc), body-centered cubic (bcc), hexagonal close-packed (hcp), and other structured gold nanoclusters have been reported, it was unclear whether gold nanoclusters with mix-packed (fcc and non-fcc) kernels exist, and the correlation between kernel packing and the properties of gold nanoclusters is unknown. A Au 49 (2,4-DMBT) 27 nanocluster with a shell electron count of 22 has now been been synthesized and structurally resolved by single-crystal X-ray crystallography, which revealed that Au 49 (2,4-DMBT) 27 contains a unique Au 34 kernel consisting of one quasi-fcc-structured Au 21 and one non-fcc-structured Au 13 unit (where 2,4-DMBTH=2,4-dimethylbenzenethiol). Further experiments revealed that the kernel packing greatly influences the electrochemical gap (EG) and the fcc structure has a larger EG than the investigated non-fcc structure. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Detecting Slope and Urban Potential Unstable Areas by Means of Multi-Platform Remote Sensing Techniques: The Volterra (Italy Case Study

Directory of Open Access Journals (Sweden)

Teresa Nolesini

2016-09-01

Full Text Available Volterra (Central Italy is a town of great historical interest, due to its vast and well-preserved cultural heritage, including a 2.6 km long Etruscan-medieval wall enclosure representing one of the most important elements. Volterra is located on a clayey hilltop prone to landsliding, soil erosion, therefore the town is subject to structural deterioration. During 2014, two impressive collapses occurred on the wall enclosure in the southwestern urban sector. Following these events, a monitoring campaign was carried out by means of remote sensing techniques, such as space-borne (PS-InSAR and ground-based (GB-InSAR radar interferometry, in order to analyze the displacements occurring both in the urban area and the surrounding slopes, and therefore to detect possible critical sectors with respect to instability phenomena. Infrared thermography (IRT was also applied with the aim of detecting possible criticalities on the wall-enclosure, with special regards to moisture and seepage areas. PS-InSAR data allowed a stability back-monitoring on the area, revealing 19 active clusters displaying ground velocity higher than 10 mm/year in the period 2011–2015. The GB-InSAR system detected an acceleration up to 1.7 mm/h in near-real time as the March 2014 failure precursor. The IRT technique, employed on a double survey campaign, in both dry and rainy conditions, permitted to acquire 65 thermograms covering 23 sectors of the town wall, highlighting four thermal anomalies. The outcomes of this work demonstrate the usefulness of different remote sensing technologies for deriving information in risk prevention and management, and the importance of choosing the appropriate technology depending on the target, time sampling and investigation scale. In this paper, the use of a multi-platform remote sensing system permitted technical support of the local authorities and conservators, providing a comprehensive overview of the Volterra site, its cultural heritage and

Optimal kernel shape and bandwidth for atomistic support of continuum stress

International Nuclear Information System (INIS)

Ulz, Manfred H; Moran, Sean J

2013-01-01

The treatment of atomistic scale interactions via molecular dynamics simulations has recently found favour for multiscale modelling within engineering. The estimation of stress at a continuum point on the atomistic scale requires a pre-defined kernel function. This kernel function derives the stress at a continuum point by averaging the contribution from atoms within a region surrounding the continuum point. This averaging volume, and therefore the associated stress at a continuum point, is highly dependent on the bandwidth and shape of the kernel. In this paper we propose an effective and entirely data-driven strategy for simultaneously computing the optimal shape and bandwidth for the kernel. We thoroughly evaluate our proposed approach on copper using three classical elasticity problems. Our evaluation yields three key findings: firstly, our technique can provide a physically meaningful estimation of kernel bandwidth; secondly, we show that a uniform kernel is preferred, thereby justifying the default selection of this kernel shape in future work; and thirdly, we can reliably estimate both of these attributes in a data-driven manner, obtaining values that lead to an accurate estimation of the stress at a continuum point. (paper)

Multivariable Christoffel-Darboux Kernels and Characteristic Polynomials of Random Hermitian Matrices

Directory of Open Access Journals (Sweden)

Hjalmar Rosengren

2006-12-01

Full Text Available We study multivariable Christoffel-Darboux kernels, which may be viewed as reproducing kernels for antisymmetric orthogonal polynomials, and also as correlation functions for products of characteristic polynomials of random Hermitian matrices. Using their interpretation as reproducing kernels, we obtain simple proofs of Pfaffian and determinant formulas, as well as Schur polynomial expansions, for such kernels. In subsequent work, these results are applied in combinatorics (enumeration of marked shifted tableaux and number theory (representation of integers as sums of squares.

A multi-resolution approach to heat kernels on discrete surfaces

KAUST Repository

Vaxman, Amir

2010-07-26

Studying the behavior of the heat diffusion process on a manifold is emerging as an important tool for analyzing the geometry of the manifold. Unfortunately, the high complexity of the computation of the heat kernel - the key to the diffusion process - limits this type of analysis to 3D models of modest resolution. We show how to use the unique properties of the heat kernel of a discrete two dimensional manifold to overcome these limitations. Combining a multi-resolution approach with a novel approximation method for the heat kernel at short times results in an efficient and robust algorithm for computing the heat kernels of detailed models. We show experimentally that our method can achieve good approximations in a fraction of the time required by traditional algorithms. Finally, we demonstrate how these heat kernels can be used to improve a diffusion-based feature extraction algorithm. © 2010 ACM.

Compactly Supported Basis Functions as Support Vector Kernels for Classification.

Science.gov (United States)

Wittek, Peter; Tan, Chew Lim

2011-10-01

Wavelet kernels have been introduced for both support vector regression and classification. Most of these wavelet kernels do not use the inner product of the embedding space, but use wavelets in a similar fashion to radial basis function kernels. Wavelet analysis is typically carried out on data with a temporal or spatial relation between consecutive data points. We argue that it is possible to order the features of a general data set so that consecutive features are statistically related to each other, thus enabling us to interpret the vector representation of an object as a series of equally or randomly spaced observations of a hypothetical continuous signal. By approximating the signal with compactly supported basis functions and employing the inner product of the embedding L2 space, we gain a new family of wavelet kernels. Empirical results show a clear advantage in favor of these kernels.

Genome-wide Association Analysis of Kernel Weight in Hard Winter Wheat

Science.gov (United States)

Wheat kernel weight is an important and heritable component of wheat grain yield and a key predictor of flour extraction. Genome-wide association analysis was conducted to identify genomic regions associated with kernel weight and kernel weight environmental response in 8 trials of 299 hard winter ...

A Heterogeneous Multi-core Architecture with a Hardware Kernel for Control Systems

DEFF Research Database (Denmark)

Li, Gang; Guan, Wei; Sierszecki, Krzysztof

2012-01-01

Rapid industrialisation has resulted in a demand for improved embedded control systems with features such as predictability, high processing performance and low power consumption. Software kernel implementation on a single processor is becoming more difficult to satisfy those constraints. This pa......Rapid industrialisation has resulted in a demand for improved embedded control systems with features such as predictability, high processing performance and low power consumption. Software kernel implementation on a single processor is becoming more difficult to satisfy those constraints......). Second, a heterogeneous multi-core architecture is investigated, focusing on its performance in relation to hard real-time constraints and predictable behavior. Third, the hardware implementation of HARTEX is designated to support the heterogeneous multi-core architecture. This hardware kernel has...... several advantages over a similar kernel implemented in software: higher-speed processing capability, parallel computation, and separation between the kernel itself and the applications being run. A microbenchmark has been used to compare the hardware kernel with the software kernel, and compare...

Generalized synthetic kernel approximation for elastic moderation of fast neutrons

International Nuclear Information System (INIS)

Yamamoto, Koji; Sekiya, Tamotsu; Yamamura, Yasunori.

1975-01-01

A method of synthetic kernel approximation is examined in some detail with a view to simplifying the treatment of the elastic moderation of fast neutrons. A sequence of unified kernel (fsub(N)) is introduced, which is then divided into two subsequences (Wsub(n)) and (Gsub(n)) according to whether N is odd (Wsub(n)=fsub(2n-1), n=1,2, ...) or even (Gsub(n)=fsub(2n), n=0,1, ...). The W 1 and G 1 kernels correspond to the usual Wigner and GG kernels, respectively, and the Wsub(n) and Gsub(n) kernels for n>=2 represent generalizations thereof. It is shown that the Wsub(n) kernel solution with a relatively small n (>=2) is superior on the whole to the Gsub(n) kernel solution for the same index n, while both converge to the exact values with increasing n. To evaluate the collision density numerically and rapidly, a simple recurrence formula is derived. In the asymptotic region (except near resonances), this recurrence formula allows calculation with a relatively coarse mesh width whenever hsub(a)<=0.05 at least. For calculations in the transient lethargy region, a mesh width of order epsilon/10 is small enough to evaluate the approximate collision density psisub(N) with an accuracy comparable to that obtained analytically. It is shown that, with the present method, an order of approximation of about n=7 should yield a practically correct solution diviating not more than 1% in collision density. (auth.)

Validation of Born Traveltime Kernels

Science.gov (United States)

Baig, A. M.; Dahlen, F. A.; Hung, S.

2001-12-01

Most inversions for Earth structure using seismic traveltimes rely on linear ray theory to translate observed traveltime anomalies into seismic velocity anomalies distributed throughout the mantle. However, ray theory is not an appropriate tool to use when velocity anomalies have scale lengths less than the width of the Fresnel zone. In the presence of these structures, we need to turn to a scattering theory in order to adequately describe all of the features observed in the waveform. By coupling the Born approximation to ray theory, the first order dependence of heterogeneity on the cross-correlated traveltimes (described by the Fréchet derivative or, more colourfully, the banana-doughnut kernel) may be determined. To determine for what range of parameters these banana-doughnut kernels outperform linear ray theory, we generate several random media specified by their statistical properties, namely the RMS slowness perturbation and the scale length of the heterogeneity. Acoustic waves are numerically generated from a point source using a 3-D pseudo-spectral wave propagation code. These waves are then recorded at a variety of propagation distances from the source introducing a third parameter to the problem: the number of wavelengths traversed by the wave. When all of the heterogeneity has scale lengths larger than the width of the Fresnel zone, ray theory does as good a job at predicting the cross-correlated traveltime as the banana-doughnut kernels do. Below this limit, wavefront healing becomes a significant effect and ray theory ceases to be effective even though the kernels remain relatively accurate provided the heterogeneity is weak. The study of wave propagation in random media is of a more general interest and we will also show our measurements of the velocity shift and the variance of traveltime compare to various theoretical predictions in a given regime.

Effect of Palm Kernel Cake Replacement and Enzyme ...

African Journals Online (AJOL)

A feeding trial which lasted for twelve weeks was conducted to study the performance of finisher pigs fed five different levels of palm kernel cake replacement for maize (0%, 40%, 40%, 60%, 60%) in a maize-palm kernel cake based ration with or without enzyme supplementation. It was a completely randomized design ...

Efficient Online Subspace Learning With an Indefinite Kernel for Visual Tracking and Recognition

NARCIS (Netherlands)

Liwicki, Stephan; Zafeiriou, Stefanos; Tzimiropoulos, Georgios; Pantic, Maja

2012-01-01

We propose an exact framework for online learning with a family of indefinite (not positive) kernels. As we study the case of nonpositive kernels, we first show how to extend kernel principal component analysis (KPCA) from a reproducing kernel Hilbert space to Krein space. We then formulate an

Flour quality and kernel hardness connection in winter wheat

Directory of Open Access Journals (Sweden)

Szabó B. P.

2016-12-01

Full Text Available Kernel hardness is controlled by friabilin protein and it depends on the relation between protein matrix and starch granules. Friabilin is present in high concentration in soft grain varieties and in low concentration in hard grain varieties. The high gluten, hard wheat our generally contains about 12.0–13.0% crude protein under Mid-European conditions. The relationship between wheat protein content and kernel texture is usually positive and kernel texture influences the power consumption during milling. Hard-textured wheat grains require more grinding energy than soft-textured grains.

Deep kernel learning method for SAR image target recognition

Science.gov (United States)

Chen, Xiuyuan; Peng, Xiyuan; Duan, Ran; Li, Junbao

2017-10-01

With the development of deep learning, research on image target recognition has made great progress in recent years. Remote sensing detection urgently requires target recognition for military, geographic, and other scientific research. This paper aims to solve the synthetic aperture radar image target recognition problem by combining deep and kernel learning. The model, which has a multilayer multiple kernel structure, is optimized layer by layer with the parameters of Support Vector Machine and a gradient descent algorithm. This new deep kernel learning method improves accuracy and achieves competitive recognition results compared with other learning methods.

Influence of differently processed mango seed kernel meal on ...

African Journals Online (AJOL)

Influence of differently processed mango seed kernel meal on performance response of west African ... and TD( consisted spear grass and parboiled mango seed kernel meal with concentrate diet in a ratio of 35:30:35). ... HOW TO USE AJOL.

Stability in distribution of a stochastic hybrid competitive Lotka–Volterra model with Lévy jumps

International Nuclear Information System (INIS)

Zhao, Yu; Yuan, Sanling

2016-01-01

Stability in distribution, implying the existence of the invariant probability measure, is an important measure of stochastic hybrid system. However, the effect of Lévy jumps on the stability in distribution is still unclear. In this paper, we consider a n-species competitive Lotka–Volterra model with Lévy jumps under regime-switching. First, we prove the existence of the global positive solution, obtain the upper and lower boundedness. Then, asymptotic stability in distribution as the main result of our paper is derived under some sufficient conditions. Finally, numerical simulations are carried out to support our theoretical results and a brief discussion is given.

Mapping of the stochastic Lotka-Volterra model to models of population genetics and game theory

Science.gov (United States)

Constable, George W. A.; McKane, Alan J.

2017-08-01

The relationship between the M -species stochastic Lotka-Volterra competition (SLVC) model and the M -allele Moran model of population genetics is explored via timescale separation arguments. When selection for species is weak and the population size is large but finite, precise conditions are determined for the stochastic dynamics of the SLVC model to be mappable to the neutral Moran model, the Moran model with frequency-independent selection, and the Moran model with frequency-dependent selection (equivalently a game-theoretic formulation of the Moran model). We demonstrate how these mappings can be used to calculate extinction probabilities and the times until a species' extinction in the SLVC model.

A framework for dense triangular matrix kernels on various manycore architectures

KAUST Repository

Charara, Ali

2017-06-06

We present a new high-performance framework for dense triangular Basic Linear Algebra Subroutines (BLAS) kernels, ie, triangular matrix-matrix multiplication (TRMM) and triangular solve (TRSM), on various manycore architectures. This is an extension of a previous work on a single GPU by the same authors, presented at the EuroPar\\'16 conference, in which we demonstrated the effectiveness of recursive formulations in enhancing the performance of these kernels. In this paper, the performance of triangular BLAS kernels on a single GPU is further enhanced by implementing customized in-place CUDA kernels for TRMM and TRSM, which are called at the bottom of the recursion. In addition, a multi-GPU implementation of TRMM and TRSM is proposed and we show an almost linear performance scaling, as the number of GPUs increases. Finally, the algorithmic recursive formulation of these triangular BLAS kernels is in fact oblivious to the targeted hardware architecture. We, therefore, port these recursive kernels to homogeneous x86 hardware architectures by relying on the vendor optimized BLAS implementations. Results reported on various hardware architectures highlight a significant performance improvement against state-of-the-art implementations. These new kernels are freely available in the KAUST BLAS (KBLAS) open-source library at https://github.com/ecrc/kblas.

A framework for dense triangular matrix kernels on various manycore architectures

KAUST Repository

Charara, Ali; Keyes, David E.; Ltaief, Hatem

2017-01-01

We present a new high-performance framework for dense triangular Basic Linear Algebra Subroutines (BLAS) kernels, ie, triangular matrix-matrix multiplication (TRMM) and triangular solve (TRSM), on various manycore architectures. This is an extension of a previous work on a single GPU by the same authors, presented at the EuroPar'16 conference, in which we demonstrated the effectiveness of recursive formulations in enhancing the performance of these kernels. In this paper, the performance of triangular BLAS kernels on a single GPU is further enhanced by implementing customized in-place CUDA kernels for TRMM and TRSM, which are called at the bottom of the recursion. In addition, a multi-GPU implementation of TRMM and TRSM is proposed and we show an almost linear performance scaling, as the number of GPUs increases. Finally, the algorithmic recursive formulation of these triangular BLAS kernels is in fact oblivious to the targeted hardware architecture. We, therefore, port these recursive kernels to homogeneous x86 hardware architectures by relying on the vendor optimized BLAS implementations. Results reported on various hardware architectures highlight a significant performance improvement against state-of-the-art implementations. These new kernels are freely available in the KAUST BLAS (KBLAS) open-source library at https://github.com/ecrc/kblas.

Global analysis of an impulsive delayed Lotka-Volterra competition system

Science.gov (United States)

Xia, Yonghui

2011-03-01

In this paper, a retarded impulsive n-species Lotka-Volterra competition system with feedback controls is studied. Some sufficient conditions are obtained to guarantee the global exponential stability and global asymptotic stability of a unique equilibrium for such a high-dimensional biological system. The problem considered in this paper is in many aspects more general and incorporates as special cases various problems which have been extensively studied in the literature. Moreover, applying the obtained results to some special cases, I derive some new criteria which generalize and greatly improve some well known results. A method is proposed to investigate biological systems subjected to the effect of both impulses and delays. The method is based on Banach fixed point theory and matrix's spectral theory as well as Lyapunov function. Moreover, some novel analytic techniques are employed to study GAS and GES. It is believed that the method can be extended to other high-dimensional biological systems and complex neural networks. Finally, two examples show the feasibility of the results.

A slow pushed front in a Lotka–Volterra competition model

International Nuclear Information System (INIS)

Holzer, Matt; Scheel, Arnd

2012-01-01

We study invasion speeds in the Lotka–Volterra competition model when the rate of diffusion of one species is small. Our main result is the construction of the selected front and a rigorous asymptotic approximation of its propagation speed, valid to second order. We use techniques from geometric singular perturbation theory and geometric desingularization. The main challenge arises from the slow passage through a saddle-node bifurcation. From a perspective of linear versus nonlinear speed selection, this front provides an interesting example as the propagation speed is slower than the linear spreading speed. However, our front shares many characteristics with pushed fronts that arise when the influence of nonlinearity leads to faster than linear speeds of propagation. We show that this is a result of the linear spreading speed arising as a simple pole of the resolvent instead of as a branch pole. Using the pointwise Green's function, we show that this pole poses no a priori obstacle to marginal stability of the nonlinear travelling front, thus explaining how nonlinear systems can exhibit slower spreading that their linearization in a robust fashion

PERI - auto-tuning memory-intensive kernels for multicore

International Nuclear Information System (INIS)

Williams, S; Carter, J; Oliker, L; Shalf, J; Yelick, K; Bailey, D; Datta, K

2008-01-01

We present an auto-tuning approach to optimize application performance on emerging multicore architectures. The methodology extends the idea of search-based performance optimizations, popular in linear algebra and FFT libraries, to application-specific computational kernels. Our work applies this strategy to sparse matrix vector multiplication (SpMV), the explicit heat equation PDE on a regular grid (Stencil), and a lattice Boltzmann application (LBMHD). We explore one of the broadest sets of multicore architectures in the high-performance computing literature, including the Intel Xeon Clovertown, AMD Opteron Barcelona, Sun Victoria Falls, and the Sony-Toshiba-IBM (STI) Cell. Rather than hand-tuning each kernel for each system, we develop a code generator for each kernel that allows us identify a highly optimized version for each platform, while amortizing the human programming effort. Results show that our auto-tuned kernel applications often achieve a better than 4x improvement compared with the original code. Additionally, we analyze a Roofline performance model for each platform to reveal hardware bottlenecks and software challenges for future multicore systems and applications

PERI - Auto-tuning Memory Intensive Kernels for Multicore

Energy Technology Data Exchange (ETDEWEB)

Bailey, David H; Williams, Samuel; Datta, Kaushik; Carter, Jonathan; Oliker, Leonid; Shalf, John; Yelick, Katherine; Bailey, David H

2008-06-24

We present an auto-tuning approach to optimize application performance on emerging multicore architectures. The methodology extends the idea of search-based performance optimizations, popular in linear algebra and FFT libraries, to application-specific computational kernels. Our work applies this strategy to Sparse Matrix Vector Multiplication (SpMV), the explicit heat equation PDE on a regular grid (Stencil), and a lattice Boltzmann application (LBMHD). We explore one of the broadest sets of multicore architectures in the HPC literature, including the Intel Xeon Clovertown, AMD Opteron Barcelona, Sun Victoria Falls, and the Sony-Toshiba-IBM (STI) Cell. Rather than hand-tuning each kernel for each system, we develop a code generator for each kernel that allows us to identify a highly optimized version for each platform, while amortizing the human programming effort. Results show that our auto-tuned kernel applications often achieve a better than 4X improvement compared with the original code. Additionally, we analyze a Roofline performance model for each platform to reveal hardware bottlenecks and software challenges for future multicore systems and applications.

Kernel Bayesian ART and ARTMAP.

Science.gov (United States)

Masuyama, Naoki; Loo, Chu Kiong; Dawood, Farhan

2018-02-01

Adaptive Resonance Theory (ART) is one of the successful approaches to resolving "the plasticity-stability dilemma" in neural networks, and its supervised learning model called ARTMAP is a powerful tool for classification. Among several improvements, such as Fuzzy or Gaussian based models, the state of art model is Bayesian based one, while solving the drawbacks of others. However, it is known that the Bayesian approach for the high dimensional and a large number of data requires high computational cost, and the covariance matrix in likelihood becomes unstable. This paper introduces Kernel Bayesian ART (KBA) and ARTMAP (KBAM) by integrating Kernel Bayes' Rule (KBR) and Correntropy Induced Metric (CIM) to Bayesian ART (BA) and ARTMAP (BAM), respectively, while maintaining the properties of BA and BAM. The kernel frameworks in KBA and KBAM are able to avoid the curse of dimensionality. In addition, the covariance-free Bayesian computation by KBR provides the efficient and stable computational capability to KBA and KBAM. Furthermore, Correntropy-based similarity measurement allows improving the noise reduction ability even in the high dimensional space. The simulation experiments show that KBA performs an outstanding self-organizing capability than BA, and KBAM provides the superior classification ability than BAM, respectively. Copyright © 2017 Elsevier Ltd. All rights reserved.

Low-Resolution Tactile Image Recognition for Automated Robotic Assembly Using Kernel PCA-Based Feature Fusion and Multiple Kernel Learning-Based Support Vector Machine

Directory of Open Access Journals (Sweden)

Yi-Hung Liu

2014-01-01

Full Text Available In this paper, we propose a robust tactile sensing image recognition scheme for automatic robotic assembly. First, an image reprocessing procedure is designed to enhance the contrast of the tactile image. In the second layer, geometric features and Fourier descriptors are extracted from the image. Then, kernel principal component analysis (kernel PCA is applied to transform the features into ones with better discriminating ability, which is the kernel PCA-based feature fusion. The transformed features are fed into the third layer for classification. In this paper, we design a classifier by combining the multiple kernel learning (MKL algorithm and support vector machine (SVM. We also design and implement a tactile sensing array consisting of 10-by-10 sensing elements. Experimental results, carried out on real tactile images acquired by the designed tactile sensing array, show that the kernel PCA-based feature fusion can significantly improve the discriminating performance of the geometric features and Fourier descriptors. Also, the designed MKL-SVM outperforms the regular SVM in terms of recognition accuracy. The proposed recognition scheme is able to achieve a high recognition rate of over 85% for the classification of 12 commonly used metal parts in industrial applications.

Design and construction of palm kernel cracking and separation ...

African Journals Online (AJOL)

Design and construction of palm kernel cracking and separation machines. ... Username, Password, Remember me, or Register. DOWNLOAD FULL TEXT Open Access DOWNLOAD FULL TEXT Subscription or Fee Access. Design and construction of palm kernel cracking and separation machines. JO Nordiana, K ...

Variable kernel density estimation in high-dimensional feature spaces

CSIR Research Space (South Africa)

Van der Walt, Christiaan M

2017-02-01

Full Text Available Estimating the joint probability density function of a dataset is a central task in many machine learning applications. In this work we address the fundamental problem of kernel bandwidth estimation for variable kernel density estimation in high...

Heat Kernel Asymptotics of Zaremba Boundary Value Problem

Energy Technology Data Exchange (ETDEWEB)

Avramidi, Ivan G. [Department of Mathematics, New Mexico Institute of Mining and Technology (United States)], E-mail: iavramid@nmt.edu

2004-03-15

The Zaremba boundary-value problem is a boundary value problem for Laplace-type second-order partial differential operators acting on smooth sections of a vector bundle over a smooth compact Riemannian manifold with smooth boundary but with discontinuous boundary conditions, which include Dirichlet boundary conditions on one part of the boundary and Neumann boundary conditions on another part of the boundary. We study the heat kernel asymptotics of Zaremba boundary value problem. The construction of the asymptotic solution of the heat equation is described in detail and the heat kernel is computed explicitly in the leading approximation. Some of the first nontrivial coefficients of the heat kernel asymptotic expansion are computed explicitly.

Integrability and Linearizability of the Lotka-Volterra System with a Saddle Point with Rational Hyperbolicity Ratio

Science.gov (United States)

Gravel, Simon; Thibault, Pierre

In this paper, we consider normalizability, integrability and linearizability properties of the Lotka-Volterra system in the neighborhood of a singular point with eigenvalues 1 and - λ. The results are obtained by generalizing and expanding two methods already known: the power expansion of the first integral or of the linearizing transformation and the transformation of the saddle into a node. With these methods we find conditions that are valid for λ∈ R+ or λ∈ Q. These conditions will allow us to find all the integrable and linearizable systems for λ= {p}/{2} and {2}/{p} with p∈ N+.

Graphical analyses of connected-kernel scattering equations

International Nuclear Information System (INIS)

Picklesimer, A.

1982-10-01

Simple graphical techniques are employed to obtain a new (simultaneous) derivation of a large class of connected-kernel scattering equations. This class includes the Rosenberg, Bencze-Redish-Sloan, and connected-kernel multiple scattering equations as well as a host of generalizations of these and other equations. The graphical method also leads to a new, simplified form for some members of the class and elucidates the general structural features of the entire class

An Ensemble Approach to Building Mercer Kernels with Prior Information

Science.gov (United States)

Srivastava, Ashok N.; Schumann, Johann; Fischer, Bernd

2005-01-01

This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly dimensional feature space. we describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using pre-defined kernels. These data adaptive kernels can encode prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. Specifically, we demonstrate the use of the algorithm in situations with extremely small samples of data. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS) and demonstrate the method's superior performance against standard methods. The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains templates for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic-algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code.

Exploration of Shorea robusta (Sal seeds, kernels and its oil

Directory of Open Access Journals (Sweden)

Shashi Kumar C.

2016-12-01

Full Text Available Physical, mechanical, and chemical properties of Shorea robusta seed with wing, seed without wing, and kernel were investigated in the present work. The physico-chemical composition of sal oil was also analyzed. The physico-mechanical properties and proximate composition of seed with wing, seed without wing, and kernel at three moisture contents of 9.50% (w.b, 9.54% (w.b, and 12.14% (w.b, respectively, were studied. The results show that the moisture content of the kernel was highest as compared to seed with wing and seed without wing. The sphericity of the kernel was closer to that of a sphere as compared to seed with wing and seed without wing. The hardness of the seed with wing (32.32, N/mm and seed without wing (42.49, N/mm was lower than the kernels (72.14, N/mm. The proximate composition such as moisture, protein, carbohydrates, oil, crude fiber, and ash content were also determined. The kernel (30.20%, w/w contains higher oil percentage as compared to seed with wing and seed without wing. The scientific data from this work are important for designing of equipment and processes for post-harvest value addition of sal seeds.

A survey of kernel-type estimators for copula and their applications

Science.gov (United States)

Sumarjaya, I. W.

2017-10-01

Copulas have been widely used to model nonlinear dependence structure. Main applications of copulas include areas such as finance, insurance, hydrology, rainfall to name but a few. The flexibility of copula allows researchers to model dependence structure beyond Gaussian distribution. Basically, a copula is a function that couples multivariate distribution functions to their one-dimensional marginal distribution functions. In general, there are three methods to estimate copula. These are parametric, nonparametric, and semiparametric method. In this article we survey kernel-type estimators for copula such as mirror reflection kernel, beta kernel, transformation method and local likelihood transformation method. Then, we apply these kernel methods to three stock indexes in Asia. The results of our analysis suggest that, albeit variation in information criterion values, the local likelihood transformation method performs better than the other kernel methods.

Irradiation performance of coated fuel particles with fission product retaining kernel additives

International Nuclear Information System (INIS)

Foerthmann, R.

1979-10-01

The four irradiation experiments FRJ2-P17, FRJ2-P18, FRJ2-P19, and FRJ2-P20 for testing the efficiency of fission product-retaining kernel additives in coated fuel particles are described. The evaluation of the obtained experimental data led to the following results: - zirconia and alumina kernel additives are not suitable for an effective fission product retention in oxide fuel kernels, - alumina-silica kernel additives reduce the in-pile release of Sr 90 and Ba 140 from BISO-coated particles at temperatures of about 1200 0 C by two orders of magnitude, and the Cs release from kernels by one order of magnitude, - effective transport coefficients including all parameters which contribute to kernel release are given for (Th,U)O 2 mixed oxide kernels and low enriched UO 2 kernels containing 5 wt.% alumina-silica additives: 10g sub(K)/cm 2 s -1 = - 36 028/T + 6,261 (Sr 90), 10g Dsub(K)/cm 2 c -2 = - 29 646/T + 5,826 (Cs 134/137), alumina-silica kernel additives are ineffective for retaining Ag 110 m in coated particles. However, also an intact SiC-interlayer was found not to be effective at temperatures above 1200 0 C, - the penetration of the buffer layer by fission product containing eutectic additive melt during irradiation can be avoided by using additives which consist of alumina and mullite without an excess of silica, - annealing of LASER-failed irradiated particles and the irradiation test FRJ12-P20 indicate that the efficiency of alumina-silica kernel additives is not altered if the coating becomes defect. (orig.) [de

Pathway-Based Kernel Boosting for the Analysis of Genome-Wide Association Studies

Science.gov (United States)

Manitz, Juliane; Burger, Patricia; Amos, Christopher I.; Chang-Claude, Jenny; Wichmann, Heinz-Erich; Kneib, Thomas; Bickeböller, Heike

2017-01-01

The analysis of genome-wide association studies (GWAS) benefits from the investigation of biologically meaningful gene sets, such as gene-interaction networks (pathways). We propose an extension to a successful kernel-based pathway analysis approach by integrating kernel functions into a powerful algorithmic framework for variable selection, to enable investigation of multiple pathways simultaneously. We employ genetic similarity kernels from the logistic kernel machine test (LKMT) as base-learners in a boosting algorithm. A model to explain case-control status is created iteratively by selecting pathways that improve its prediction ability. We evaluated our method in simulation studies adopting 50 pathways for different sample sizes and genetic effect strengths. Additionally, we included an exemplary application of kernel boosting to a rheumatoid arthritis and a lung cancer dataset. Simulations indicate that kernel boosting outperforms the LKMT in certain genetic scenarios. Applications to GWAS data on rheumatoid arthritis and lung cancer resulted in sparse models which were based on pathways interpretable in a clinical sense. Kernel boosting is highly flexible in terms of considered variables and overcomes the problem of multiple testing. Additionally, it enables the prediction of clinical outcomes. Thus, kernel boosting constitutes a new, powerful tool in the analysis of GWAS data and towards the understanding of biological processes involved in disease susceptibility. PMID:28785300

Pathway-Based Kernel Boosting for the Analysis of Genome-Wide Association Studies.

Science.gov (United States)

Friedrichs, Stefanie; Manitz, Juliane; Burger, Patricia; Amos, Christopher I; Risch, Angela; Chang-Claude, Jenny; Wichmann, Heinz-Erich; Kneib, Thomas; Bickeböller, Heike; Hofner, Benjamin

2017-01-01

The analysis of genome-wide association studies (GWAS) benefits from the investigation of biologically meaningful gene sets, such as gene-interaction networks (pathways). We propose an extension to a successful kernel-based pathway analysis approach by integrating kernel functions into a powerful algorithmic framework for variable selection, to enable investigation of multiple pathways simultaneously. We employ genetic similarity kernels from the logistic kernel machine test (LKMT) as base-learners in a boosting algorithm. A model to explain case-control status is created iteratively by selecting pathways that improve its prediction ability. We evaluated our method in simulation studies adopting 50 pathways for different sample sizes and genetic effect strengths. Additionally, we included an exemplary application of kernel boosting to a rheumatoid arthritis and a lung cancer dataset. Simulations indicate that kernel boosting outperforms the LKMT in certain genetic scenarios. Applications to GWAS data on rheumatoid arthritis and lung cancer resulted in sparse models which were based on pathways interpretable in a clinical sense. Kernel boosting is highly flexible in terms of considered variables and overcomes the problem of multiple testing. Additionally, it enables the prediction of clinical outcomes. Thus, kernel boosting constitutes a new, powerful tool in the analysis of GWAS data and towards the understanding of biological processes involved in disease susceptibility.

Dose calculation methods in photon beam therapy using energy deposition kernels

International Nuclear Information System (INIS)

Ahnesjoe, A.

1991-01-01

The problem of calculating accurate dose distributions in treatment planning of megavoltage photon radiation therapy has been studied. New dose calculation algorithms using energy deposition kernels have been developed. The kernels describe the transfer of energy by secondary particles from a primary photon interaction site to its surroundings. Monte Carlo simulations of particle transport have been used for derivation of kernels for primary photon energies form 0.1 MeV to 50 MeV. The trade off between accuracy and calculational speed has been addressed by the development of two algorithms; one point oriented with low computional overhead for interactive use and one for fast and accurate calculation of dose distributions in a 3-dimensional lattice. The latter algorithm models secondary particle transport in heterogeneous tissue by scaling energy deposition kernels with the electron density of the tissue. The accuracy of the methods has been tested using full Monte Carlo simulations for different geometries, and found to be superior to conventional algorithms based on scaling of broad beam dose distributions. Methods have also been developed for characterization of clinical photon beams in entities appropriate for kernel based calculation models. By approximating the spectrum as laterally invariant, an effective spectrum and dose distribution for contaminating charge particles are derived form depth dose distributions measured in water, using analytical constraints. The spectrum is used to calculate kernels by superposition of monoenergetic kernels. The lateral energy fluence distribution is determined by deconvolving measured lateral dose distributions by a corresponding pencil beam kernel. Dose distributions for contaminating photons are described using two different methods, one for estimation of the dose outside of the collimated beam, and the other for calibration of output factors derived from kernel based dose calculations. (au)

Boundary singularity of Poisson and harmonic Bergman kernels

Czech Academy of Sciences Publication Activity Database

Engliš, Miroslav

2015-01-01

Roč. 429, č. 1 (2015), s. 233-272 ISSN 0022-247X R&D Projects: GA AV ČR IAA100190802 Institutional support: RVO:67985840 Keywords : harmonic Bergman kernel * Poisson kernel * pseudodifferential boundary operators Subject RIV: BA - General Mathematics Impact factor: 1.014, year: 2015 http://www.sciencedirect.com/science/article/pii/S0022247X15003170

Optimal Bandwidth Selection in Observed-Score Kernel Equating

Science.gov (United States)

Häggström, Jenny; Wiberg, Marie

2014-01-01

The selection of bandwidth in kernel equating is important because it has a direct impact on the equated test scores. The aim of this article is to examine the use of double smoothing when selecting bandwidths in kernel equating and to compare double smoothing with the commonly used penalty method. This comparison was made using both an equivalent…

Kernel structures for Clouds

Science.gov (United States)

Spafford, Eugene H.; Mckendry, Martin S.

1986-01-01

An overview of the internal structure of the Clouds kernel was presented. An indication of how these structures will interact in the prototype Clouds implementation is given. Many specific details have yet to be determined and await experimentation with an actual working system.

Commutators of Integral Operators with Variable Kernels on Hardy ...

Indian Academy of Sciences (India)

Home; Journals; Proceedings – Mathematical Sciences; Volume 115; Issue 4. Commutators of Integral Operators with Variable Kernels on Hardy Spaces. Pu Zhang Kai Zhao. Volume 115 Issue 4 November 2005 pp 399-410 ... Keywords. Singular and fractional integrals; variable kernel; commutator; Hardy space.

Oven-drying reduces ruminal starch degradation in maize kernels

NARCIS (Netherlands)

Ali, M.; Cone, J.W.; Hendriks, W.H.; Struik, P.C.

2014-01-01

The degradation of starch largely determines the feeding value of maize (Zea mays L.) for dairy cows. Normally, maize kernels are dried and ground before chemical analysis and determining degradation characteristics, whereas cows eat and digest fresh material. Drying the moist maize kernels

Perspectives for practical application of the combined fuel kernels in VVER-type reactors

International Nuclear Information System (INIS)

Baranov, V.; Ternovykh, M.; Tikhomirov, G.; Khlunov, A.; Tenishev, A.; Kurina, I.

2011-01-01

The paper considers the main physical processes that take place in fuel kernels under real operation conditions of VVER-type reactors. Main attention is given to the effects induced by combinations of layers with different physical properties inside of fuel kernels on these physical processes. Basic neutron-physical characteristics were calculated for some combined fuel kernels in fuel rods of VVER-type reactors. There are many goals in development of the combined fuel kernels, and these goals define selecting the combinations and compositions of radial layers inside of the kernels. For example, the slower formation of the rim-layer on outer surface of the kernels made of enriched uranium dioxide can be achieved by introduction of inner layer made of natural or depleted uranium dioxide. Other potential goals (lower temperature in the kernel center, better conditions for burn-up of neutron poisons, better retention of toxic materials) could be reached by other combinations of fuel compositions in central and peripheral zones of the fuel kernels. Also, the paper presents the results obtained in experimental manufacturing of the combined fuel pellets. (authors)

Occurrence of 'super soft' wheat kernel texture in hexaploid and tetraploid wheats

Science.gov (United States)

Wheat kernel texture is a key trait that governs milling performance, flour starch damage, flour particle size, flour hydration properties, and baking quality. Kernel texture is commonly measured using the Perten Single Kernel Characterization System (SKCS). The SKCS returns texture values (Hardness...

Kernel Methods for Machine Learning with Life Science Applications

DEFF Research Database (Denmark)

Abrahamsen, Trine Julie

Kernel methods refer to a family of widely used nonlinear algorithms for machine learning tasks like classification, regression, and feature extraction. By exploiting the so-called kernel trick straightforward extensions of classical linear algorithms are enabled as long as the data only appear a...

Nonlinear Forecasting With Many Predictors Using Kernel Ridge Regression

DEFF Research Database (Denmark)

Exterkate, Peter; Groenen, Patrick J.F.; Heij, Christiaan

This paper puts forward kernel ridge regression as an approach for forecasting with many predictors that are related nonlinearly to the target variable. In kernel ridge regression, the observed predictor variables are mapped nonlinearly into a high-dimensional space, where estimation of the predi...

Mode of inheritance and combining abilities for kernel row number, kernel number per row and grain yield in maize (Zea mays L.)

NARCIS (Netherlands)

Bocanski, J.; Sreckov, Z.; Nastasic, A.; Ivanovic, M.; Djalovic, I.; Vukosavljev, M.

2010-01-01

Bocanski J., Z. Sreckov, A. Nastasic, M. Ivanovic, I.Djalovic and M. Vukosavljev (2010): Mode of inheritance and combining abilities for kernel row number, kernel number per row and grain yield in maize (Zea mays L.) - Genetika, Vol 42, No. 1, 169- 176. Utilization of heterosis requires the study of

Reproducing Kernels and Coherent States on Julia Sets

Energy Technology Data Exchange (ETDEWEB)

Thirulogasanthar, K., E-mail: santhar@cs.concordia.ca; Krzyzak, A. [Concordia University, Department of Computer Science and Software Engineering (Canada)], E-mail: krzyzak@cs.concordia.ca; Honnouvo, G. [Concordia University, Department of Mathematics and Statistics (Canada)], E-mail: g_honnouvo@yahoo.fr

2007-11-15

We construct classes of coherent states on domains arising from dynamical systems. An orthonormal family of vectors associated to the generating transformation of a Julia set is found as a family of square integrable vectors, and, thereby, reproducing kernels and reproducing kernel Hilbert spaces are associated to Julia sets. We also present analogous results on domains arising from iterated function systems.

Reproducing Kernels and Coherent States on Julia Sets

International Nuclear Information System (INIS)

Thirulogasanthar, K.; Krzyzak, A.; Honnouvo, G.

2007-01-01

We construct classes of coherent states on domains arising from dynamical systems. An orthonormal family of vectors associated to the generating transformation of a Julia set is found as a family of square integrable vectors, and, thereby, reproducing kernels and reproducing kernel Hilbert spaces are associated to Julia sets. We also present analogous results on domains arising from iterated function systems

DNA sequence+shape kernel enables alignment-free modeling of transcription factor binding.

Science.gov (United States)

Ma, Wenxiu; Yang, Lin; Rohs, Remo; Noble, William Stafford

2017-10-01

Transcription factors (TFs) bind to specific DNA sequence motifs. Several lines of evidence suggest that TF-DNA binding is mediated in part by properties of the local DNA shape: the width of the minor groove, the relative orientations of adjacent base pairs, etc. Several methods have been developed to jointly account for DNA sequence and shape properties in predicting TF binding affinity. However, a limitation of these methods is that they typically require a training set of aligned TF binding sites. We describe a sequence + shape kernel that leverages DNA sequence and shape information to better understand protein-DNA binding preference and affinity. This kernel extends an existing class of k-mer based sequence kernels, based on the recently described di-mismatch kernel. Using three in vitro benchmark datasets, derived from universal protein binding microarrays (uPBMs), genomic context PBMs (gcPBMs) and SELEX-seq data, we demonstrate that incorporating DNA shape information improves our ability to predict protein-DNA binding affinity. In particular, we observe that (i) the k-spectrum + shape model performs better than the classical k-spectrum kernel, particularly for small k values; (ii) the di-mismatch kernel performs better than the k-mer kernel, for larger k; and (iii) the di-mismatch + shape kernel performs better than the di-mismatch kernel for intermediate k values. The software is available at https://bitbucket.org/wenxiu/sequence-shape.git. rohs@usc.edu or william-noble@uw.edu. Supplementary data are available at Bioinformatics online. © The Author(s) 2017. Published by Oxford University Press.

Multiple Kernel Sparse Representation based Orthogonal Discriminative Projection and Its Cost-Sensitive Extension.

Science.gov (United States)

Zhang, Guoqing; Sun, Huaijiang; Xia, Guiyu; Sun, Quansen

2016-07-07

Sparse representation based classification (SRC) has been developed and shown great potential for real-world application. Based on SRC, Yang et al. [10] devised a SRC steered discriminative projection (SRC-DP) method. However, as a linear algorithm, SRC-DP cannot handle the data with highly nonlinear distribution. Kernel sparse representation-based classifier (KSRC) is a non-linear extension of SRC and can remedy the drawback of SRC. KSRC requires the use of a predetermined kernel function and selection of the kernel function and its parameters is difficult. Recently, multiple kernel learning for SRC (MKL-SRC) [22] has been proposed to learn a kernel from a set of base kernels. However, MKL-SRC only considers the within-class reconstruction residual while ignoring the between-class relationship, when learning the kernel weights. In this paper, we propose a novel multiple kernel sparse representation-based classifier (MKSRC), and then we use it as a criterion to design a multiple kernel sparse representation based orthogonal discriminative projection method (MK-SR-ODP). The proposed algorithm aims at learning a projection matrix and a corresponding kernel from the given base kernels such that in the low dimension subspace the between-class reconstruction residual is maximized and the within-class reconstruction residual is minimized. Furthermore, to achieve a minimum overall loss by performing recognition in the learned low-dimensional subspace, we introduce cost information into the dimensionality reduction method. The solutions for the proposed method can be efficiently found based on trace ratio optimization method [33]. Extensive experimental results demonstrate the superiority of the proposed algorithm when compared with the state-of-the-art methods.

Mixed kernel function support vector regression for global sensitivity analysis

Science.gov (United States)

Cheng, Kai; Lu, Zhenzhou; Wei, Yuhao; Shi, Yan; Zhou, Yicheng

2017-11-01

Global sensitivity analysis (GSA) plays an important role in exploring the respective effects of input variables on an assigned output response. Amongst the wide sensitivity analyses in literature, the Sobol indices have attracted much attention since they can provide accurate information for most models. In this paper, a mixed kernel function (MKF) based support vector regression (SVR) model is employed to evaluate the Sobol indices at low computational cost. By the proposed derivation, the estimation of the Sobol indices can be obtained by post-processing the coefficients of the SVR meta-model. The MKF is constituted by the orthogonal polynomials kernel function and Gaussian radial basis kernel function, thus the MKF possesses both the global characteristic advantage of the polynomials kernel function and the local characteristic advantage of the Gaussian radial basis kernel function. The proposed approach is suitable for high-dimensional and non-linear problems. Performance of the proposed approach is validated by various analytical functions and compared with the popular polynomial chaos expansion (PCE). Results demonstrate that the proposed approach is an efficient method for global sensitivity analysis.

Feature Selection and Kernel Learning for Local Learning-Based Clustering.

Science.gov (United States)

Zeng, Hong; Cheung, Yiu-ming

2011-08-01

The performance of the most clustering algorithms highly relies on the representation of data in the input space or the Hilbert space of kernel methods. This paper is to obtain an appropriate data representation through feature selection or kernel learning within the framework of the Local Learning-Based Clustering (LLC) (Wu and Schölkopf 2006) method, which can outperform the global learning-based ones when dealing with the high-dimensional data lying on manifold. Specifically, we associate a weight to each feature or kernel and incorporate it into the built-in regularization of the LLC algorithm to take into account the relevance of each feature or kernel for the clustering. Accordingly, the weights are estimated iteratively in the clustering process. We show that the resulting weighted regularization with an additional constraint on the weights is equivalent to a known sparse-promoting penalty. Hence, the weights of those irrelevant features or kernels can be shrunk toward zero. Extensive experiments show the efficacy of the proposed methods on the benchmark data sets.

Semisupervised kernel marginal Fisher analysis for face recognition.

Science.gov (United States)

Wang, Ziqiang; Sun, Xia; Sun, Lijun; Huang, Yuchun

2013-01-01

Dimensionality reduction is a key problem in face recognition due to the high-dimensionality of face image. To effectively cope with this problem, a novel dimensionality reduction algorithm called semisupervised kernel marginal Fisher analysis (SKMFA) for face recognition is proposed in this paper. SKMFA can make use of both labelled and unlabeled samples to learn the projection matrix for nonlinear dimensionality reduction. Meanwhile, it can successfully avoid the singularity problem by not calculating the matrix inverse. In addition, in order to make the nonlinear structure captured by the data-dependent kernel consistent with the intrinsic manifold structure, a manifold adaptive nonparameter kernel is incorporated into the learning process of SKMFA. Experimental results on three face image databases demonstrate the effectiveness of our proposed algorithm.

Weighted Feature Gaussian Kernel SVM for Emotion Recognition.

Science.gov (United States)

Wei, Wei; Jia, Qingxuan

2016-01-01

Emotion recognition with weighted feature based on facial expression is a challenging research topic and has attracted great attention in the past few years. This paper presents a novel method, utilizing subregion recognition rate to weight kernel function. First, we divide the facial expression image into some uniform subregions and calculate corresponding recognition rate and weight. Then, we get a weighted feature Gaussian kernel function and construct a classifier based on Support Vector Machine (SVM). At last, the experimental results suggest that the approach based on weighted feature Gaussian kernel function has good performance on the correct rate in emotion recognition. The experiments on the extended Cohn-Kanade (CK+) dataset show that our method has achieved encouraging recognition results compared to the state-of-the-art methods.

Fuzzy-based multi-kernel spherical support vector machine for ...

Indian Academy of Sciences (India)

In the proposed classifier, we design a new multi-kernel function based on the fuzzy triangular membership function. Finally, a newly developed multi-kernel function is incorporated into the spherical support vector machine to enhance the performance significantly. The experimental results are evaluated and performance is ...

Differential evolution algorithm-based kernel parameter selection for Fukunaga-Koontz Transform subspaces construction

Science.gov (United States)

Binol, Hamidullah; Bal, Abdullah; Cukur, Huseyin

2015-10-01

The performance of the kernel based techniques depends on the selection of kernel parameters. That's why; suitable parameter selection is an important problem for many kernel based techniques. This article presents a novel technique to learn the kernel parameters in kernel Fukunaga-Koontz Transform based (KFKT) classifier. The proposed approach determines the appropriate values of kernel parameters through optimizing an objective function constructed based on discrimination ability of KFKT. For this purpose we have utilized differential evolution algorithm (DEA). The new technique overcomes some disadvantages such as high time consumption existing in the traditional cross-validation method, and it can be utilized in any type of data. The experiments for target detection applications on the hyperspectral images verify the effectiveness of the proposed method.

Asymptotic Behaviour and Extinction of Delay Lotka-Volterra Model with Jump-Diffusion

Directory of Open Access Journals (Sweden)

Dan Li

2014-01-01

Full Text Available This paper studies the effect of jump-diffusion random environmental perturbations on the asymptotic behaviour and extinction of Lotka-Volterra population dynamics with delays. The contributions of this paper lie in the following: (a to consider delay stochastic differential equation with jumps, we introduce a proper initial data space, in which the initial data may be discontinuous function with downward jumps; (b we show that the delay stochastic differential equation with jumps associated with our model has a unique global positive solution and give sufficient conditions that ensure stochastically ultimate boundedness, moment average boundedness in time, and asymptotic polynomial growth of our model; (c the sufficient conditions for the extinction of the system are obtained, which generalized the former results and showed that the sufficiently large random jump magnitudes and intensity (average rate of jump events arrival may lead to extinction of the population.

Winnerless competition principle and prediction of the transient dynamics in a Lotka-Volterra model

Science.gov (United States)

Afraimovich, Valentin; Tristan, Irma; Huerta, Ramon; Rabinovich, Mikhail I.

2008-12-01

Predicting the evolution of multispecies ecological systems is an intriguing problem. A sufficiently complex model with the necessary predicting power requires solutions that are structurally stable. Small variations of the system parameters should not qualitatively perturb its solutions. When one is interested in just asymptotic results of evolution (as time goes to infinity), then the problem has a straightforward mathematical image involving simple attractors (fixed points or limit cycles) of a dynamical system. However, for an accurate prediction of evolution, the analysis of transient solutions is critical. In this paper, in the framework of the traditional Lotka-Volterra model (generalized in some sense), we show that the transient solution representing multispecies sequential competition can be reproducible and predictable with high probability.

Modelling microwave heating of discrete samples of oil palm kernels

International Nuclear Information System (INIS)

Law, M.C.; Liew, E.L.; Chang, S.L.; Chan, Y.S.; Leo, C.P.

2016-01-01

Highlights: • Microwave (MW) drying of oil palm kernels is experimentally determined and modelled. • MW heating of discrete samples of oil palm kernels (OPKs) is simulated. • OPK heating is due to contact effect, MW interference and heat transfer mechanisms. • Electric field vectors circulate within OPKs sample. • Loosely-packed arrangement improves temperature uniformity of OPKs. - Abstract: Recently, microwave (MW) pre-treatment of fresh palm fruits has showed to be environmentally friendly compared to the existing oil palm milling process as it eliminates the condensate production of palm oil mill effluent (POME) in the sterilization process. Moreover, MW-treated oil palm fruits (OPF) also possess better oil quality. In this work, the MW drying kinetic of the oil palm kernels (OPK) was determined experimentally. Microwave heating/drying of oil palm kernels was modelled and validated. The simulation results show that temperature of an OPK is not the same over the entire surface due to constructive and destructive interferences of MW irradiance. The volume-averaged temperature of an OPK is higher than its surface temperature by 3–7 °C, depending on the MW input power. This implies that point measurement of temperature reading is inadequate to determine the temperature history of the OPK during the microwave heating process. The simulation results also show that arrangement of OPKs in a MW cavity affects the kernel temperature profile. The heating of OPKs were identified to be affected by factors such as local electric field intensity due to MW absorption, refraction, interference, the contact effect between kernels and also heat transfer mechanisms. The thermal gradient patterns of OPKs change as the heating continues. The cracking of OPKs is expected to occur first in the core of the kernel and then it propagates to the kernel surface. The model indicates that drying of OPKs is a much slower process compared to its MW heating. The model is useful

Finite frequency traveltime sensitivity kernels for acoustic anisotropic media: Angle dependent bananas

KAUST Repository

Djebbi, Ramzi

2013-08-19

Anisotropy is an inherent character of the Earth subsurface. It should be considered for modeling and inversion. The acoustic VTI wave equation approximates the wave behavior in anisotropic media, and especially it\\'s kinematic characteristics. To analyze which parts of the model would affect the traveltime for anisotropic traveltime inversion methods, especially for wave equation tomography (WET), we drive the sensitivity kernels for anisotropic media using the VTI acoustic wave equation. A Born scattering approximation is first derived using the Fourier domain acoustic wave equation as a function of perturbations in three anisotropy parameters. Using the instantaneous traveltime, which unwraps the phase, we compute the kernels. These kernels resemble those for isotropic media, with the η kernel directionally dependent. They also have a maximum sensitivity along the geometrical ray, which is more realistic compared to the cross-correlation based kernels. Focusing on diving waves, which is used more often, especially recently in waveform inversion, we show sensitivity kernels in anisotropic media for this case.

Finite frequency traveltime sensitivity kernels for acoustic anisotropic media: Angle dependent bananas

KAUST Repository

Djebbi, Ramzi; Alkhalifah, Tariq Ali

2013-01-01

Anisotropy is an inherent character of the Earth subsurface. It should be considered for modeling and inversion. The acoustic VTI wave equation approximates the wave behavior in anisotropic media, and especially it's kinematic characteristics. To analyze which parts of the model would affect the traveltime for anisotropic traveltime inversion methods, especially for wave equation tomography (WET), we drive the sensitivity kernels for anisotropic media using the VTI acoustic wave equation. A Born scattering approximation is first derived using the Fourier domain acoustic wave equation as a function of perturbations in three anisotropy parameters. Using the instantaneous traveltime, which unwraps the phase, we compute the kernels. These kernels resemble those for isotropic media, with the η kernel directionally dependent. They also have a maximum sensitivity along the geometrical ray, which is more realistic compared to the cross-correlation based kernels. Focusing on diving waves, which is used more often, especially recently in waveform inversion, we show sensitivity kernels in anisotropic media for this case.

The influence of maize kernel moisture on the sterilizing effect of gamma rays

International Nuclear Information System (INIS)

Khanymova, T.; Poloni, E.

1980-01-01

The influence of 4 levels of maize kernel moisture (16, 20, 25 and 30%) on gamma-ray sterilizing effect was studied and the after-effect of radiation on the microorganisms at short term storage was followed up. Maize kernels of the hybrid Knezha-36 produced in 1975 were used. Gamma-ray treatment of the kernels was effected by GUBEh-4000 irradiator at doses of 0.2 and 0.3 Mrad and after that they were stored for a month at 12 deg and 25 deg C and controlled moisture conditions. Surface and subepidermal infection of the kernels was determined immediately post irradiation and at the end of the experiment. Non-irradiated kernels were used as controls. Results indicated that the initial kernel moisture has a considerable influence on the sterilizing effect of gamma-rays at the rates used in the experiment and affects to a considerable extent the post-irradiation recovery of organisms. The speed of recovery was highest in the treatment with 30% moisture and lowest in the treatment with 16% kernel moisture. Irradiation of the kernels causes pronounced changes on the surface and subepidermal infection. This was due to the unequal radio resistance to the microbial components and to the modifying effect of the moisture holding capacity. The useful effect of maize kernel irradiation was more prolonged at 12 deg C than at 25 deg C

Capturing option anomalies with a variance-dependent pricing kernel

NARCIS (Netherlands)

Christoffersen, P.; Heston, S.; Jacobs, K.

2013-01-01

We develop a GARCH option model with a variance premium by combining the Heston-Nandi (2000) dynamic with a new pricing kernel that nests Rubinstein (1976) and Brennan (1979). While the pricing kernel is monotonic in the stock return and in variance, its projection onto the stock return is

Resolvent kernel for the Kohn Laplacian on Heisenberg groups

Directory of Open Access Journals (Sweden)

Neur Eddine Askour

2002-07-01

Full Text Available We present a formula that relates the Kohn Laplacian on Heisenberg groups and the magnetic Laplacian. Then we obtain the resolvent kernel for the Kohn Laplacian and find its spectral density. We conclude by obtaining the Green kernel for fractional powers of the Kohn Laplacian.