Science.gov

Sample records for polynomial based rk

  1. Accelerated solution of non-linear flow problems using Chebyshev iteration polynomial based RK recursions

    SciTech Connect

    Lorber, A.A.; Carey, G.F.; Bova, S.W.; Harle, C.H.

    1996-12-31

    The connection between the solution of linear systems of equations by iterative methods and explicit time stepping techniques is used to accelerate to steady state the solution of ODE systems arising from discretized PDEs which may involve either physical or artificial transient terms. Specifically, a class of Runge-Kutta (RK) time integration schemes with extended stability domains has been used to develop recursion formulas which lead to accelerated iterative performance. The coefficients for the RK schemes are chosen based on the theory of Chebyshev iteration polynomials in conjunction with a local linear stability analysis. We refer to these schemes as Chebyshev Parameterized Runge Kutta (CPRK) methods. CPRK methods of one to four stages are derived as functions of the parameters which describe an ellipse {Epsilon} which the stability domain of the methods is known to contain. Of particular interest are two-stage, first-order CPRK and four-stage, first-order methods. It is found that the former method can be identified with any two-stage RK method through the correct choice of parameters. The latter method is found to have a wide range of stability domains, with a maximum extension of 32 along the real axis. Recursion performance results are presented below for a model linear convection-diffusion problem as well as non-linear fluid flow problems discretized by both finite-difference and finite-element methods.

  2. Polynomials

    NASA Technical Reports Server (NTRS)

    Apostol, Tom M. (Editor)

    1991-01-01

    In this 'Project Mathematics! series, sponsored by California Institute for Technology (CalTech), the mathematical concept of polynomials in rectangular coordinate (x, y) systems are explored. sing film footage of real life applications and computer animation sequences, the history of, the application of, and the different linear coordinate systems for quadratic, cubic, intersecting, and higher degree of polynomials are discussed.

  3. New Polynomial-Based Molecular Descriptors with Low Degeneracy

    PubMed Central

    Dehmer, Matthias; Mueller, Laurin A. J.; Graber, Armin

    2010-01-01

    In this paper, we introduce a novel graph polynomial called the ‘information polynomial’ of a graph. This graph polynomial can be derived by using a probability distribution of the vertex set. By using the zeros of the obtained polynomial, we additionally define some novel spectral descriptors. Compared with those based on computing the ordinary characteristic polynomial of a graph, we perform a numerical study using real chemical databases. We obtain that the novel descriptors do have a high discrimination power. PMID:20689599

  4. Complex Chebyshev-polynomial-based unified model (CCPBUM) neural networks

    NASA Astrophysics Data System (ADS)

    Jeng, Jin-Tsong; Lee, Tsu-Tian

    1998-03-01

    In this paper, we propose complex Chebyshev Polynomial Based unified model neural network for the approximation of complex- valued function. Based on this approximate transformable technique, we have derived the relationship between the single-layered neural network and multi-layered perceptron neural network. It is shown that the complex Chebyshev Polynomial Based unified model neural network can be represented as a functional link network that are based on Chebyshev polynomial. We also derived a new learning algorithm for the proposed network. It turns out that the complex Chebyshev Polynomial Based unified model neural network not only has the same capability of universal approximator, but also has faster learning speed than conventional complex feedforward/recurrent neural network.

  5. Discontinuous Galerkin method based on non-polynomial approximation spaces

    SciTech Connect

    Yuan Ling . E-mail: lyuan@dam.brown.edu; Shu Chiwang . E-mail: shu@dam.brown.edu

    2006-10-10

    In this paper, we develop discontinuous Galerkin (DG) methods based on non-polynomial approximation spaces for numerically solving time dependent hyperbolic and parabolic and steady state hyperbolic and elliptic partial differential equations (PDEs). The algorithm is based on approximation spaces consisting of non-polynomial elementary functions such as exponential functions, trigonometric functions, etc., with the objective of obtaining better approximations for specific types of PDEs and initial and boundary conditions. It is shown that L {sup 2} stability and error estimates can be obtained when the approximation space is suitably selected. It is also shown with numerical examples that a careful selection of the approximation space to fit individual PDE and initial and boundary conditions often provides more accurate results than the DG methods based on the polynomial approximation spaces of the same order of accuracy.

  6. Generalized Gegenbauer Koornwinder's type polynomials change of bases

    NASA Astrophysics Data System (ADS)

    AlQudah, Mohammad; AlMheidat, Maalee

    2017-07-01

    In this paper we characterize the generalized Gegenbauer polynomials using Bernstein basis, and derive the matrix of transformation of the generalized Gegenbauer polynomial basis form into the Bernstein polynomial basis and vice versa.

  7. SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

    NASA Astrophysics Data System (ADS)

    Ahlfeld, R.; Belkouchi, B.; Montomoli, F.

    2016-09-01

    A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5 and 10

  8. SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

    SciTech Connect

    Ahlfeld, R. Belkouchi, B.; Montomoli, F.

    2016-09-01

    A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5 and 10

  9. Fast complex memory polynomial-based adaptive digital predistorter

    NASA Astrophysics Data System (ADS)

    Singh Sappal, Amandeep; Singh Patterh, Manjeet; Sharma, Sanjay

    2011-07-01

    Today's 3G wireless systems require both high linearity and high power amplifier (PA) efficiency. The high peak-to-average ratios of the digital modulation schemes used in 3G wireless systems require that the RF PA maintain high linearity over a large range while maintaining this high efficiency; these two requirements are often at odds with each other with many of the traditional amplifier architectures. In this article, a fast and easy-to-implement adaptive digital predistorter has been presented for Wideband Code Division Multiplexed signals using complex memory polynomial work function. The proposed algorithm has been implemented to test a Motorola LDMOSFET PA. The proposed technique also takes care of the memory effects of the PA, which have been ignored in many proposed techniques in the literature. The results show that the new complex memory polynomial-based adaptive digital predistorter has better linearisation performance than conventional predistortion techniques.

  10. Estimation of the entropy based on its polynomial representation.

    PubMed

    Vinck, Martin; Battaglia, Francesco P; Balakirsky, Vladimir B; Vinck, A J Han; Pennartz, Cyriel M A

    2012-05-01

    Estimating entropy from empirical samples of finite size is of central importance for information theory as well as the analysis of complex statistical systems. Yet, this delicate task is marred by intrinsic statistical bias. Here we decompose the entropy function into a polynomial approximation function and a remainder function. The approximation function is based on a Taylor expansion of the logarithm. Given n observations, we give an unbiased, linear estimate of the first n power series terms based on counting sets of k coincidences. For the remainder function we use nonlinear Bayesian estimation with a nearly flat prior distribution on the entropy that was developed by Nemenman, Shafee, and Bialek. Our simulations show that the combined entropy estimator has reduced bias in comparison to other available estimators.

  11. Estimation of the entropy based on its polynomial representation

    NASA Astrophysics Data System (ADS)

    Vinck, Martin; Battaglia, Francesco P.; Balakirsky, Vladimir B.; Vinck, A. J. Han; Pennartz, Cyriel M. A.

    2012-05-01

    Estimating entropy from empirical samples of finite size is of central importance for information theory as well as the analysis of complex statistical systems. Yet, this delicate task is marred by intrinsic statistical bias. Here we decompose the entropy function into a polynomial approximation function and a remainder function. The approximation function is based on a Taylor expansion of the logarithm. Given n observations, we give an unbiased, linear estimate of the first n power series terms based on counting sets of k coincidences. For the remainder function we use nonlinear Bayesian estimation with a nearly flat prior distribution on the entropy that was developed by Nemenman, Shafee, and Bialek. Our simulations show that the combined entropy estimator has reduced bias in comparison to other available estimators.

  12. Enhanced Access Polynomial Based Self-healing Key Distribution

    NASA Astrophysics Data System (ADS)

    Dutta, Ratna; Mukhopadhyay, Sourav; Dowling, Tom

    A fundamental concern of any secure group communication system is that of key management. Wireless environments create new key management problems and requirements to solve these problems. One such core requirement in these emerging networks is that of self-healing. In systems where users can be offline and miss updates self healing allows a user to recover lost keys and get back into the secure communication without putting extra burden on the group manager. Clearly self healing must be only available to authorized users and this creates more challenges in that we must ensure unauthorized or revoked users cannot, themselves or by means of collusion, avail of self healing. To this end we enhance the one-way key chain based self-healing key distribution of Dutta et al. by introducing a collusion resistance property between the revoked users and the newly joined users. Our scheme is based on the concept of access polynomials. These can be loosely thought of as white lists of authorized users as opposed to the more widely used revocation polynomials or black lists of revoked users. We also allow each user a pre-arranged life cycle distributed by the group manager. Our scheme provides better efficiency in terms of storage, and the communication and computation costs do not increase as the number of sessions grows as compared to most current schemes. We analyze our scheme in an appropriate security model and prove that the proposed scheme is computationally secure and not only achieving forward and backward secrecy, but also resisting collusion between the new joined users and the revoked users. Unlike most existing schemes the new scheme allows temporary revocation. Also unlike existing schemes, our construction does not collapse if the number of revoked users crosses a threshold value. This feature increases resilience against revocation based denial of service (DOS) attacks and thus improves availability of communication channel.

  13. Luminance-Chrominance Gain Equalizer Based on Bernstein Polynomials

    NASA Astrophysics Data System (ADS)

    Chutchavong, Vanvisa; Sangaroon, Ornlarp; Benjangkaprasert, Chawalit; Janchitrapongvej, Kanok

    This paper presents a linear luminance-chrominance gain equalizer for correcting the linear chrominance gain distortion in the color TV transmission system. The proposed gain equalizer was implemented based on Bernstein polynomials. As it is known that the Bernstein filter has flexible parameters to adjust the circuit performance for the best results. In addition, the modulated 20T sine-squared pulse test signal is generated for testing the performance of the proposed gain equalizer, which can be measured all three types of the linear chrominance distortions. As the results, the proposed gain equalizer is also proved to be efficient in equalizing both the low gain and the high gain chrominance distortions without degrading its phase characteristics.

  14. Fast Minimum Variance Beamforming Based on Legendre Polynomials.

    PubMed

    Bae, MooHo; Park, Sung Bae; Kwon, Sung Jae

    2016-09-01

    Currently, minimum variance beamforming (MV) is actively investigated as a method that can improve the performance of an ultrasound beamformer, in terms of the lateral and contrast resolution. However, this method has the disadvantage of excessive computational complexity since the inverse spatial covariance matrix must be calculated. Some noteworthy methods among various attempts to solve this problem include beam space adaptive beamforming methods and the fast MV method based on principal component analysis, which are similar in that the original signal in the element space is transformed to another domain using an orthonormal basis matrix and the dimension of the covariance matrix is reduced by approximating the matrix only with important components of the matrix, hence making the inversion of the matrix very simple. Recently, we proposed a new method with further reduced computational demand that uses Legendre polynomials as the basis matrix for such a transformation. In this paper, we verify the efficacy of the proposed method through Field II simulations as well as in vitro and in vivo experiments. The results show that the approximation error of this method is less than or similar to those of the above-mentioned methods and that the lateral response of point targets and the contrast-to-speckle noise in anechoic cysts are also better than or similar to those methods when the dimensionality of the covariance matrices is reduced to the same dimension.

  15. Auto-focused panoramic dental tomosynthesis imaging with exponential polynomial based sharpness indicators

    NASA Astrophysics Data System (ADS)

    Lee, Taewon; Lee, Yeon Ju; Cho, Seungryong

    2017-02-01

    In this paper, we develop an improved auto-focusing capability of a panoramic dental tomosynthesis imager. We propose an auto-focusing algorithm with an efficient sharpness indicator based on exponential polynomials which provides better quantitation of steep gradients than the conventional one based on algebraic polynomials. With its accurate estimation of the sharpness of the reconstructed slices, the proposed method resulted in a better performance of automatically extracting in-focus slices in the dental panoramic tomosynthesis.

  16. A lattice Boltzmann method based on generalized polynomials and its application for electrons in metals

    NASA Astrophysics Data System (ADS)

    Coelho, Rodrigo C. V.; Ilha, Anderson S.; Doria, Mauro M.

    2016-10-01

    A lattice Boltzmann method is proposed based on the expansion of the equilibrium distribution function in powers of a new set of generalized orthonormal polynomials which are here presented. The new polynomials are orthonormal under the weight defined by the equilibrium distribution function itself. The D-dimensional Hermite polynomials is a sub-case of the present ones, associated to the particular weight of a Gaussian function. The proposed lattice Boltzmann method allows for the treatment of semi-classical fluids, such as electrons in metals under the Drude-Sommerfeld model, which is a particular case that we develop and validate by the Riemann problem.

  17. Gabor-based kernel PCA with fractional power polynomial models for face recognition.

    PubMed

    Liu, Chengjun

    2004-05-01

    This paper presents a novel Gabor-based kernel Principal Component Analysis (PCA) method by integrating the Gabor wavelet representation of face images and the kernel PCA method for face recognition. Gabor wavelets first derive desirable facial features characterized by spatial frequency, spatial locality, and orientation selectivity to cope with the variations due to illumination and facial expression changes. The kernel PCA method is then extended to include fractional power polynomial models for enhanced face recognition performance. A fractional power polynomial, however, does not necessarily define a kernel function, as it might not define a positive semidefinite Gram matrix. Note that the sigmoid kernels, one of the three classes of widely used kernel functions (polynomial kernels, Gaussian kernels, and sigmoid kernels), do not actually define a positive semidefinite Gram matrix either. Nevertheless, the sigmoid kernels have been successfully used in practice, such as in building support vector machines. In order to derive real kernel PCA features, we apply only those kernel PCA eigenvectors that are associated with positive eigenvalues. The feasibility of the Gabor-based kernel PCA method with fractional power polynomial models has been successfully tested on both frontal and pose-angled face recognition, using two data sets from the FERET database and the CMU PIE database, respectively. The FERET data set contains 600 frontal face images of 200 subjects, while the PIE data set consists of 680 images across five poses (left and right profiles, left and right half profiles, and frontal view) with two different facial expressions (neutral and smiling) of 68 subjects. The effectiveness of the Gabor-based kernel PCA method with fractional power polynomial models is shown in terms of both absolute performance indices and comparative performance against the PCA method, the kernel PCA method with polynomial kernels, the kernel PCA method with fractional power

  18. RK and RK* beyond the standard model

    NASA Astrophysics Data System (ADS)

    Hiller, Gudrun; Nišandžić, Ivan

    2017-08-01

    Measurements of the ratio of B →K*μ μ to B →K*e e branching fractions, RK*, by the LHCb Collaboration strengthen the hints from previous studies with pseudoscalar kaons, RK, for the breakdown of lepton universality, and therefore the Standard Model (SM), to ˜3.5 σ . Complementarity between RK and RK* allows us to pin down the Dirac structure of the new contributions to be predominantly SM-like chiral, with possible admixture of chirality-flipped contributions of up to O (few 10 %). Scalar and vector leptoquark representations (S3,V1,V3) plus possible (S˜2,V2) admixture can explain RK ,K* via tree-level exchange. Flavor models naturally predict leptoquark masses not exceeding a few TeV, with couplings to third-generation quarks at O (0.1 ), implying that this scenario can be directly tested at the LHC.

  19. Novel Threshold Changeable Secret Sharing Schemes Based on Polynomial Interpolation.

    PubMed

    Yuan, Lifeng; Li, Mingchu; Guo, Cheng; Choo, Kim-Kwang Raymond; Ren, Yizhi

    2016-01-01

    After any distribution of secret sharing shadows in a threshold changeable secret sharing scheme, the threshold may need to be adjusted to deal with changes in the security policy and adversary structure. For example, when employees leave the organization, it is not realistic to expect departing employees to ensure the security of their secret shadows. Therefore, in 2012, Zhang et al. proposed (t → t', n) and ({t1, t2,⋯, tN}, n) threshold changeable secret sharing schemes. However, their schemes suffer from a number of limitations such as strict limit on the threshold values, large storage space requirement for secret shadows, and significant computation for constructing and recovering polynomials. To address these limitations, we propose two improved dealer-free threshold changeable secret sharing schemes. In our schemes, we construct polynomials to update secret shadows, and use two-variable one-way function to resist collusion attacks and secure the information stored by the combiner. We then demonstrate our schemes can adjust the threshold safely.

  20. Novel Threshold Changeable Secret Sharing Schemes Based on Polynomial Interpolation

    PubMed Central

    Li, Mingchu; Guo, Cheng; Choo, Kim-Kwang Raymond; Ren, Yizhi

    2016-01-01

    After any distribution of secret sharing shadows in a threshold changeable secret sharing scheme, the threshold may need to be adjusted to deal with changes in the security policy and adversary structure. For example, when employees leave the organization, it is not realistic to expect departing employees to ensure the security of their secret shadows. Therefore, in 2012, Zhang et al. proposed (t → t′, n) and ({t1, t2,⋯, tN}, n) threshold changeable secret sharing schemes. However, their schemes suffer from a number of limitations such as strict limit on the threshold values, large storage space requirement for secret shadows, and significant computation for constructing and recovering polynomials. To address these limitations, we propose two improved dealer-free threshold changeable secret sharing schemes. In our schemes, we construct polynomials to update secret shadows, and use two-variable one-way function to resist collusion attacks and secure the information stored by the combiner. We then demonstrate our schemes can adjust the threshold safely. PMID:27792784

  1. A general U-block model-based design procedure for nonlinear polynomial control systems

    NASA Astrophysics Data System (ADS)

    Zhu, Q. M.; Zhao, D. Y.; Zhang, Jianhua

    2016-10-01

    The proposition of U-model concept (in terms of 'providing concise and applicable solutions for complex problems') and a corresponding basic U-control design algorithm was originated in the first author's PhD thesis. The term of U-model appeared (not rigorously defined) for the first time in the first author's other journal paper, which established a framework for using linear polynomial control system design approaches to design nonlinear polynomial control systems (in brief, linear polynomial approaches → nonlinear polynomial plants). This paper represents the next milestone work - using linear state-space approaches to design nonlinear polynomial control systems (in brief, linear state-space approaches → nonlinear polynomial plants). The overall aim of the study is to establish a framework, defined as the U-block model, which provides a generic prototype for using linear state-space-based approaches to design the control systems with smooth nonlinear plants/processes described by polynomial models. For analysing the feasibility and effectiveness, sliding mode control design approach is selected as an exemplary case study. Numerical simulation studies provide a user-friendly step-by-step procedure for the readers/users with interest in their ad hoc applications. In formality, this is the first paper to present the U-model-oriented control system design in a formal way and to study the associated properties and theorems. The previous publications, in the main, have been algorithm-based studies and simulation demonstrations. In some sense, this paper can be treated as a landmark for the U-model-based research from intuitive/heuristic stage to rigour/formal/comprehensive studies.

  2. An Accurate Projector Calibration Method Based on Polynomial Distortion Representation

    PubMed Central

    Liu, Miao; Sun, Changku; Huang, Shujun; Zhang, Zonghua

    2015-01-01

    In structure light measurement systems or 3D printing systems, the errors caused by optical distortion of a digital projector always affect the precision performance and cannot be ignored. Existing methods to calibrate the projection distortion rely on calibration plate and photogrammetry, so the calibration performance is largely affected by the quality of the plate and the imaging system. This paper proposes a new projector calibration approach that makes use of photodiodes to directly detect the light emitted from a digital projector. By analyzing the output sequence of the photoelectric module, the pixel coordinates can be accurately obtained by the curve fitting method. A polynomial distortion representation is employed to reduce the residuals of the traditional distortion representation model. Experimental results and performance evaluation show that the proposed calibration method is able to avoid most of the disadvantages in traditional methods and achieves a higher accuracy. This proposed method is also practically applicable to evaluate the geometric optical performance of other optical projection system. PMID:26492247

  3. An accurate projector calibration method based on polynomial distortion representation.

    PubMed

    Liu, Miao; Sun, Changku; Huang, Shujun; Zhang, Zonghua

    2015-10-20

    In structure light measurement systems or 3D printing systems, the errors caused by optical distortion of a digital projector always affect the precision performance and cannot be ignored. Existing methods to calibrate the projection distortion rely on calibration plate and photogrammetry, so the calibration performance is largely affected by the quality of the plate and the imaging system. This paper proposes a new projector calibration approach that makes use of photodiodes to directly detect the light emitted from a digital projector. By analyzing the output sequence of the photoelectric module, the pixel coordinates can be accurately obtained by the curve fitting method. A polynomial distortion representation is employed to reduce the residuals of the traditional distortion representation model. Experimental results and performance evaluation show that the proposed calibration method is able to avoid most of the disadvantages in traditional methods and achieves a higher accuracy. This proposed method is also practically applicable to evaluate the geometric optical performance of other optical projection system.

  4. A Polynomial Subset-Based Efficient Multi-Party Key Management System for Lightweight Device Networks.

    PubMed

    Mahmood, Zahid; Ning, Huansheng; Ghafoor, AtaUllah

    2017-03-24

    Wireless Sensor Networks (WSNs) consist of lightweight devices to measure sensitive data that are highly vulnerable to security attacks due to their constrained resources. In a similar manner, the internet-based lightweight devices used in the Internet of Things (IoT) are facing severe security and privacy issues because of the direct accessibility of devices due to their connection to the internet. Complex and resource-intensive security schemes are infeasible and reduce the network lifetime. In this regard, we have explored the polynomial distribution-based key establishment schemes and identified an issue that the resultant polynomial value is either storage intensive or infeasible when large values are multiplied. It becomes more costly when these polynomials are regenerated dynamically after each node join or leave operation and whenever key is refreshed. To reduce the computation, we have proposed an Efficient Key Management (EKM) scheme for multiparty communication-based scenarios. The proposed session key management protocol is established by applying a symmetric polynomial for group members, and the group head acts as a responsible node. The polynomial generation method uses security credentials and secure hash function. Symmetric cryptographic parameters are efficient in computation, communication, and the storage required. The security justification of the proposed scheme has been completed by using Rubin logic, which guarantees that the protocol attains mutual validation and session key agreement property strongly among the participating entities. Simulation scenarios are performed using NS 2.35 to validate the results for storage, communication, latency, energy, and polynomial calculation costs during authentication, session key generation, node migration, secure joining, and leaving phases. EKM is efficient regarding storage, computation, and communication overhead and can protect WSN-based IoT infrastructure.

  5. A Polynomial Subset-Based Efficient Multi-Party Key Management System for Lightweight Device Networks

    PubMed Central

    Mahmood, Zahid; Ning, Huansheng; Ghafoor, AtaUllah

    2017-01-01

    Wireless Sensor Networks (WSNs) consist of lightweight devices to measure sensitive data that are highly vulnerable to security attacks due to their constrained resources. In a similar manner, the internet-based lightweight devices used in the Internet of Things (IoT) are facing severe security and privacy issues because of the direct accessibility of devices due to their connection to the internet. Complex and resource-intensive security schemes are infeasible and reduce the network lifetime. In this regard, we have explored the polynomial distribution-based key establishment schemes and identified an issue that the resultant polynomial value is either storage intensive or infeasible when large values are multiplied. It becomes more costly when these polynomials are regenerated dynamically after each node join or leave operation and whenever key is refreshed. To reduce the computation, we have proposed an Efficient Key Management (EKM) scheme for multiparty communication-based scenarios. The proposed session key management protocol is established by applying a symmetric polynomial for group members, and the group head acts as a responsible node. The polynomial generation method uses security credentials and secure hash function. Symmetric cryptographic parameters are efficient in computation, communication, and the storage required. The security justification of the proposed scheme has been completed by using Rubin logic, which guarantees that the protocol attains mutual validation and session key agreement property strongly among the participating entities. Simulation scenarios are performed using NS 2.35 to validate the results for storage, communication, latency, energy, and polynomial calculation costs during authentication, session key generation, node migration, secure joining, and leaving phases. EKM is efficient regarding storage, computation, and communication overhead and can protect WSN-based IoT infrastructure. PMID:28338632

  6. Online segmentation of time series based on polynomial least-squares approximations.

    PubMed

    Fuchs, Erich; Gruber, Thiemo; Nitschke, Jiri; Sick, Bernhard

    2010-12-01

    The paper presents SwiftSeg, a novel technique for online time series segmentation and piecewise polynomial representation. The segmentation approach is based on a least-squares approximation of time series in sliding and/or growing time windows utilizing a basis of orthogonal polynomials. This allows the definition of fast update steps for the approximating polynomial, where the computational effort depends only on the degree of the approximating polynomial and not on the length of the time window. The coefficients of the orthogonal expansion of the approximating polynomial-obtained by means of the update steps-can be interpreted as optimal (in the least-squares sense) estimators for average, slope, curvature, change of curvature, etc., of the signal in the time window considered. These coefficients, as well as the approximation error, may be used in a very intuitive way to define segmentation criteria. The properties of SwiftSeg are evaluated by means of some artificial and real benchmark time series. It is compared to three different offline and online techniques to assess its accuracy and runtime. It is shown that SwiftSeg-which is suitable for many data streaming applications-offers high accuracy at very low computational costs.

  7. Security analysis of an encryption scheme based on nonpositional polynomial notations

    NASA Astrophysics Data System (ADS)

    Kapalova, Nursulu; Dyusenbayev, Dilmukhanbet

    2016-01-01

    The aim of the research was to conduct a cryptographic analysis of an encryption scheme developed on the basis of nonpositional polynomial notations to estimate the algorithm strength. Nonpositional polynomial notations (NPNs) are residue number systems (RNSs) based on irreducible polynomials over GF(2). To evaluate if the algorithms developed on the basis of NPNs are secure, mathematical models of cryptanalysis involving algebraic, linear and differential methods have been designed. The cryptanalysis is as follows. A system of nonlinear equations is obtained from a function transforming plaintext into ciphertext with a key. Next, a possibility of transition of the nonlinear system to a linear one is considered. The cryptanalysis was conducted for the cases with known: 1) ciphertext; 2) plaintext and the related ciphertext; 3) plaintext file format; and 4) ASCII-encoded plaintext.

  8. Aspherical surface profile fitting based on the relationship between polynomial and inner products

    NASA Astrophysics Data System (ADS)

    Cheng, Xuemin; Yang, Yikang; Hao, Qun

    2016-01-01

    High-precision aspherical polynomial fitting is essential to image quality evaluation in optical design and optimization. However, conventional fitting methods cannot reach optimal fitting precision and may somehow induce numerical ill-conditioning, such as excessively high coefficients. For this reason, a projection from polynomial equations to vector space was here proposed such that polynomial solutions could be obtained based on matrix and vector operation, so avoiding the problem of excessive coefficients. The Newton-Raphson iteration method was used to search for optimal fitting of the spherical surface. The profile fitting test showed that the proposed approach was able to obtain results with high precision and small value, which solved the numerical ill-conditioning phenomenon effectively.

  9. Ambient temperature normalization for infrared face recognition based on the second-order polynomial model

    NASA Astrophysics Data System (ADS)

    Wang, Zhengzi

    2015-08-01

    The influence of ambient temperature is a big challenge to robust infrared face recognition. This paper proposes a new ambient temperature normalization algorithm to improve the performance of infrared face recognition under variable ambient temperatures. Based on statistical regression theory, a second order polynomial model is learned to describe the ambient temperature's impact on infrared face image. Then, infrared image was normalized to reference ambient temperature by the second order polynomial model. Finally, this normalization method is applied to infrared face recognition to verify its efficiency. The experiments demonstrate that the proposed temperature normalization method is feasible and can significantly improve the robustness of infrared face recognition.

  10. A New and Improved Host-Independent Plasmid System for RK2-Based Conjugal Transfer

    PubMed Central

    Strand, Trine Aakvik; Lale, Rahmi; Degnes, Kristin Fløgstad; Lando, Malin; Valla, Svein

    2014-01-01

    Bacterial conjugation is a process that is mediated either by a direct cell-to-cell junction or by formation of a bridge between the cells. It is often used to transfer DNA constructs designed in Escherichia coli to recipient bacteria, yeast, plants and mammalian cells. Plasmids bearing the RK2/RP4 origin of transfer (oriT) are mostly mobilized using the E. coli S17-1/SM10 donor strains, in which transfer helper functions are provided from a chromosomally integrated RP4::Mu. We have observed that large plasmids were occasionally modified after conjugal transfer when using E. coli S17-1 as a donor. All modified plasmids had increased in size, which most probably was a result of co-transfer of DNA from the chromosomally located oriT. It has earlier also been demonstrated that the bacteriophage Mu is silently transferred to recipient cells by these donor strains, and both occurrences are very likely to lead to mutations within the recipient DNA. Here we report the construction of a new biological system addressing both the above mentioned problems in which the transfer helper functions are provided by a plasmid lacking a functional oriT. This system is compatible with all other replicons commonly used in conjugation experiments and further enables the use of diverse bacterial strains as donors. Plasmids containing large inserts were successfully conjugated and the plasmid modifications observed when E. coli S17-1 was used as donor were eliminated by the use of the new host-independent vector system. PMID:24595202

  11. A new and improved host-independent plasmid system for RK2-based conjugal transfer.

    PubMed

    Strand, Trine Aakvik; Lale, Rahmi; Degnes, Kristin Fløgstad; Lando, Malin; Valla, Svein

    2014-01-01

    Bacterial conjugation is a process that is mediated either by a direct cell-to-cell junction or by formation of a bridge between the cells. It is often used to transfer DNA constructs designed in Escherichia coli to recipient bacteria, yeast, plants and mammalian cells. Plasmids bearing the RK2/RP4 origin of transfer (oriT) are mostly mobilized using the E. coli S17-1/SM10 donor strains, in which transfer helper functions are provided from a chromosomally integrated RP4::Mu. We have observed that large plasmids were occasionally modified after conjugal transfer when using E. coli S17-1 as a donor. All modified plasmids had increased in size, which most probably was a result of co-transfer of DNA from the chromosomally located oriT. It has earlier also been demonstrated that the bacteriophage Mu is silently transferred to recipient cells by these donor strains, and both occurrences are very likely to lead to mutations within the recipient DNA. Here we report the construction of a new biological system addressing both the above mentioned problems in which the transfer helper functions are provided by a plasmid lacking a functional oriT. This system is compatible with all other replicons commonly used in conjugation experiments and further enables the use of diverse bacterial strains as donors. Plasmids containing large inserts were successfully conjugated and the plasmid modifications observed when E. coli S17-1 was used as donor were eliminated by the use of the new host-independent vector system.

  12. A comparison of high-order polynomial and wave-based methods for Helmholtz problems

    NASA Astrophysics Data System (ADS)

    Lieu, Alice; Gabard, Gwénaël; Bériot, Hadrien

    2016-09-01

    The application of computational modelling to wave propagation problems is hindered by the dispersion error introduced by the discretisation. Two common strategies to address this issue are to use high-order polynomial shape functions (e.g. hp-FEM), or to use physics-based, or Trefftz, methods where the shape functions are local solutions of the problem (typically plane waves). Both strategies have been actively developed over the past decades and both have demonstrated their benefits compared to conventional finite-element methods, but they have yet to be compared. In this paper a high-order polynomial method (p-FEM with Lobatto polynomials) and the wave-based discontinuous Galerkin method are compared for two-dimensional Helmholtz problems. A number of different benchmark problems are used to perform a detailed and systematic assessment of the relative merits of these two methods in terms of interpolation properties, performance and conditioning. It is generally assumed that a wave-based method naturally provides better accuracy compared to polynomial methods since the plane waves or Bessel functions used in these methods are exact solutions of the Helmholtz equation. Results indicate that this expectation does not necessarily translate into a clear benefit, and that the differences in performance, accuracy and conditioning are more nuanced than generally assumed. The high-order polynomial method can in fact deliver comparable, and in some cases superior, performance compared to the wave-based DGM. In addition to benchmarking the intrinsic computational performance of these methods, a number of practical issues associated with realistic applications are also discussed.

  13. Coherent orthogonal polynomials

    SciTech Connect

    Celeghini, E.; Olmo, M.A. del

    2013-08-15

    We discuss a fundamental characteristic of orthogonal polynomials, like the existence of a Lie algebra behind them, which can be added to their other relevant aspects. At the basis of the complete framework for orthogonal polynomials we include thus–in addition to differential equations, recurrence relations, Hilbert spaces and square integrable functions–Lie algebra theory. We start here from the square integrable functions on the open connected subset of the real line whose bases are related to orthogonal polynomials. All these one-dimensional continuous spaces allow, besides the standard uncountable basis (|x〉), for an alternative countable basis (|n〉). The matrix elements that relate these two bases are essentially the orthogonal polynomials: Hermite polynomials for the line and Laguerre and Legendre polynomials for the half-line and the line interval, respectively. Differential recurrence relations of orthogonal polynomials allow us to realize that they determine an infinite-dimensional irreducible representation of a non-compact Lie algebra, whose second order Casimir C gives rise to the second order differential equation that defines the corresponding family of orthogonal polynomials. Thus, the Weyl–Heisenberg algebra h(1) with C=0 for Hermite polynomials and su(1,1) with C=−1/4 for Laguerre and Legendre polynomials are obtained. Starting from the orthogonal polynomials the Lie algebra is extended both to the whole space of the L{sup 2} functions and to the corresponding Universal Enveloping Algebra and transformation group. Generalized coherent states from each vector in the space L{sup 2} and, in particular, generalized coherent polynomials are thus obtained. -- Highlights: •Fundamental characteristic of orthogonal polynomials (OP): existence of a Lie algebra. •Differential recurrence relations of OP determine a unitary representation of a non-compact Lie group. •2nd order Casimir originates a 2nd order differential equation that defines

  14. Discrimination Power of Polynomial-Based Descriptors for Graphs by Using Functional Matrices.

    PubMed

    Dehmer, Matthias; Emmert-Streib, Frank; Shi, Yongtang; Stefu, Monica; Tripathi, Shailesh

    2015-01-01

    In this paper, we study the discrimination power of graph measures that are based on graph-theoretical matrices. The paper generalizes the work of [M. Dehmer, M. Moosbrugger. Y. Shi, Encoding structural information uniquely with polynomial-based descriptors by employing the Randić matrix, Applied Mathematics and Computation, 268(2015), 164-168]. We demonstrate that by using the new functional matrix approach, exhaustively generated graphs can be discriminated more uniquely than shown in the mentioned previous work.

  15. Charge-based MOSFET model based on the Hermite interpolation polynomial

    NASA Astrophysics Data System (ADS)

    Colalongo, Luigi; Richelli, Anna; Kovacs, Zsolt

    2017-04-01

    An accurate charge-based compact MOSFET model is developed using the third order Hermite interpolation polynomial to approximate the relation between surface potential and inversion charge in the channel. This new formulation of the drain current retains the same simplicity of the most advanced charge-based compact MOSFET models such as BSIM, ACM and EKV, but it is developed without requiring the crude linearization of the inversion charge. Hence, the asymmetry and the non-linearity in the channel are accurately accounted for. Nevertheless, the expression of the drain current can be worked out to be analytically equivalent to BSIM, ACM and EKV. Furthermore, thanks to this new mathematical approach the slope factor is rigorously defined in all regions of operation and no empirical assumption is required.

  16. Distance-based topological polynomials and indices of friendship graphs.

    PubMed

    Gao, Wei; Farahani, Mohammad Reza; Imran, Muhammad; Rajesh Kanna, M R

    2016-01-01

    Drugs and chemical compounds are often modeled as graphs in which the each vertex of the graph expresses an atom of molecule and covalent bounds between atoms are represented by the edges between their corresponding vertices. The topological indicators defined over this molecular graph have been shown to be strongly correlated to various chemical properties of the compounds. In this article, by means of graph structure analysis, we determine several distance based topological indices of friendship graph [Formula: see text] which is widely appeared in various classes of new nanomaterials, drugs and chemical compounds.

  17. ISAR Imaging of Maneuvering Targets Based on the Modified Discrete Polynomial-Phase Transform

    PubMed Central

    Wang, Yong; Abdelkader, Ali Cherif; Zhao, Bin; Wang, Jinxiang

    2015-01-01

    Inverse synthetic aperture radar (ISAR) imaging of a maneuvering target is a challenging task in the field of radar signal processing. The azimuth echo can be characterized as a multi-component polynomial phase signal (PPS) after the translational compensation, and the high quality ISAR images can be obtained by the parameters estimation of it combined with the Range-Instantaneous-Doppler (RID) technique. In this paper, a novel parameters estimation algorithm of the multi-component PPS with order three (cubic phase signal-CPS) based on the modified discrete polynomial-phase transform (MDPT) is proposed, and the corresponding new ISAR imaging algorithm is presented consequently. This algorithm is efficient and accurate to generate a focused ISAR image, and the results of real data demonstrate the effectiveness of it. PMID:26404299

  18. Polynomial regularization for robust MRI-based estimation of blood flow velocities and pressure gradients.

    PubMed

    Delles, Michael; Rengier, Fabian; Ley, Sebastian; von Tengg-Kobligk, Hendrik; Kauczor, Hans-Ulrich; Dillmann, Rüdiger; Unterhinninghofen, Roland

    2011-01-01

    In cardiovascular diagnostics, phase-contrast MRI is a valuable technique for measuring blood flow velocities and computing blood pressure values. Unfortunately, both velocity and pressure data typically suffer from the strong image noise of velocity-encoded MRI. In the past, separate approaches of regularization with physical a-priori knowledge and data representation with continuous functions have been proposed to overcome these drawbacks. In this article, we investigate polynomial regularization as an exemplary specification of combining these two techniques. We perform time-resolved three-dimensional velocity measurements and pressure gradient computations on MRI acquisitions of steady flow in a physical phantom. Results based on the higher quality temporal mean data are used as a reference. Thereby, we investigate the performance of our approach of polynomial regularization, which reduces the root mean squared errors to the reference data by 45% for velocities and 60% for pressure gradients.

  19. ISAR Imaging of Maneuvering Targets Based on the Modified Discrete Polynomial-Phase Transform.

    PubMed

    Wang, Yong; Abdelkader, Ali Cherif; Zhao, Bin; Wang, Jinxiang

    2015-09-03

    Inverse synthetic aperture radar (ISAR) imaging of a maneuvering target is a challenging task in the field of radar signal processing. The azimuth echo can be characterized as a multi-component polynomial phase signal (PPS) after the translational compensation, and the high quality ISAR images can be obtained by the parameters estimation of it combined with the Range-Instantaneous-Doppler (RID) technique. In this paper, a novel parameters estimation algorithm of the multi-component PPS with order three (cubic phase signal-CPS) based on the modified discrete polynomial-phase transform (MDPT) is proposed, and the corresponding new ISAR imaging algorithm is presented consequently. This algorithm is efficient and accurate to generate a focused ISAR image, and the results of real data demonstrate the effectiveness of it.

  20. Polynomial-based approximate solutions to the Boussinesq equation near a well

    NASA Astrophysics Data System (ADS)

    Telyakovskiy, Aleksey S.; Kurita, Satoko; Allen, Myron B.

    2016-10-01

    This paper presents a method for constructing polynomial-based approximate solutions to the Boussinesq equation with cylindrical symmetry. This equation models water injection at a single well in an unconfined aquifer; as a sample problem we examine recharge of an initially empty aquifer. For certain injection regimes it is possible to introduce similarity variables, reducing the original problem to a boundary-value problem for an ordinary differential equation. The approximate solutions introduced here incorporate both a singular part to model the behavior near the well and a polynomial part to model the behavior in the far field. Although the nonlinearity of the problem prevents decoupling of the singular and polynomial parts, the paper presents an approach for calculating the solution based on its spatial moments. This approach yields closed-form expressions for the position of the wetting front and for the form of the phreatic surface. Comparison with a highly accurate numerical solution verifies the accuracy of the newly derived approximate solutions.

  1. A gradient-based model parametrization using Bernstein polynomials in Bayesian inversion of surface wave dispersion

    NASA Astrophysics Data System (ADS)

    Gosselin, Jeremy M.; Dosso, Stan E.; Cassidy, John F.; Quijano, Jorge E.; Molnar, Sheri; Dettmer, Jan

    2017-10-01

    This paper develops and applies a Bernstein-polynomial parametrization to efficiently represent general, gradient-based profiles in nonlinear geophysical inversion, with application to ambient-noise Rayleigh-wave dispersion data. Bernstein polynomials provide a stable parametrization in that small perturbations to the model parameters (basis-function coefficients) result in only small perturbations to the geophysical parameter profile. A fully nonlinear Bayesian inversion methodology is applied to estimate shear wave velocity (VS) profiles and uncertainties from surface wave dispersion data extracted from ambient seismic noise. The Bayesian information criterion is used to determine the appropriate polynomial order consistent with the resolving power of the data. Data error correlations are accounted for in the inversion using a parametric autoregressive model. The inversion solution is defined in terms of marginal posterior probability profiles for VS as a function of depth, estimated using Metropolis-Hastings sampling with parallel tempering. This methodology is applied to synthetic dispersion data as well as data processed from passive array recordings collected on the Fraser River Delta in British Columbia, Canada. Results from this work are in good agreement with previous studies, as well as with co-located invasive measurements. The approach considered here is better suited than `layered' modelling approaches in applications where smooth gradients in geophysical parameters are expected, such as soil/sediment profiles. Further, the Bernstein polynomial representation is more general than smooth models based on a fixed choice of gradient type (e.g. power-law gradient) because the form of the gradient is determined objectively by the data, rather than by a subjective parametrization choice.

  2. Novel Image Encryption Scheme Based on Chebyshev Polynomial and Duffing Map

    PubMed Central

    2014-01-01

    We present a novel image encryption algorithm using Chebyshev polynomial based on permutation and substitution and Duffing map based on substitution. Comprehensive security analysis has been performed on the designed scheme using key space analysis, visual testing, histogram analysis, information entropy calculation, correlation coefficient analysis, differential analysis, key sensitivity test, and speed test. The study demonstrates that the proposed image encryption algorithm shows advantages of more than 10113 key space and desirable level of security based on the good statistical results and theoretical arguments. PMID:25143970

  3. Multimode-oriented polynomial transformation-based defuzzification strategy and parameter learning procedure.

    PubMed

    Jiang, T; Li, Y

    1997-01-01

    In an earlier paper (1996), we proposed a set of generalized defuzzification strategies which can be characterized as single-mode-oriented strategies. A single-mode-oriented defuzzification strategy, although useful in many research projects and real world applications, cannot be applied to a multimode situation where two or more distinct possibility peaks exist in its membership function distribution. In this paper, for multimode-oriented generalized defuzzification applications, a multimode-oriented polynomial transformation based defuzzification strategy (M-PTD) is introduced. The new M-PTD strategy, which uses the Kalman filter in parameter learning procedure, offers a constraint-free and self-renewal defuzzification solution.

  4. Enhanced Cortical Thickness Measurements for Rodent Brains via Lagrangian-based RK4 Streamline Computation

    PubMed Central

    Lee, Joohwi; Kim, Sun Hyung; Oguz, Ipek; Styner, Martin

    2016-01-01

    The cortical thickness of the mammalian brain is an important morphological characteristic that can be used to investigate and observe the brain’s developmental changes that might be caused by biologically toxic substances such as ethanol or cocaine. Although various cortical thickness analysis methods have been proposed that are applicable for human brain and have developed into well-validated open-source software packages, cortical thickness analysis methods for rodent brains have not yet become as robust and accurate as those designed for human brains. Based on a previously proposed cortical thickness measurement pipeline for rodent brain analysis,1 we present an enhanced cortical thickness pipeline in terms of accuracy and anatomical consistency. First, we propose a Lagrangian-based computational approach in the thickness measurement step in order to minimize local truncation error using the fourth-order Runge-Kutta method. Second, by constructing a line object for each streamline of the thickness measurement, we can visualize the way the thickness is measured and achieve sub-voxel accuracy by performing geometric post-processing. Last, with emphasis on the importance of an anatomically consistent partial differential equation (PDE) boundary map, we propose an automatic PDE boundary map generation algorithm that is specific to rodent brain anatomy, which does not require manual labeling. The results show that the proposed cortical thickness pipeline can produce statistically significant regions that are not observed in the the previous cortical thickness analysis pipeline. PMID:27065047

  5. Enhanced Cortical Thickness Measurements for Rodent Brains via Lagrangian-based RK4 Streamline Computation.

    PubMed

    Lee, Joohwi; Kim, Sun Hyung; Oguz, Ipek; Styner, Martin

    2016-02-27

    The cortical thickness of the mammalian brain is an important morphological characteristic that can be used to investigate and observe the brain's developmental changes that might be caused by biologically toxic substances such as ethanol or cocaine. Although various cortical thickness analysis methods have been proposed that are applicable for human brain and have developed into well-validated open-source software packages, cortical thickness analysis methods for rodent brains have not yet become as robust and accurate as those designed for human brains. Based on a previously proposed cortical thickness measurement pipeline for rodent brain analysis,(1) we present an enhanced cortical thickness pipeline in terms of accuracy and anatomical consistency. First, we propose a Lagrangian-based computational approach in the thickness measurement step in order to minimize local truncation error using the fourth-order Runge-Kutta method. Second, by constructing a line object for each streamline of the thickness measurement, we can visualize the way the thickness is measured and achieve sub-voxel accuracy by performing geometric post-processing. Last, with emphasis on the importance of an anatomically consistent partial differential equation (PDE) boundary map, we propose an automatic PDE boundary map generation algorithm that is specific to rodent brain anatomy, which does not require manual labeling. The results show that the proposed cortical thickness pipeline can produce statistically significant regions that are not observed in the the previous cortical thickness analysis pipeline.

  6. Enhanced cortical thickness measurements for rodent brains via Lagrangian-based RK4 streamline computation

    NASA Astrophysics Data System (ADS)

    Lee, Joohwi; Kim, Sun Hyung; Oguz, Ipek; Styner, Martin

    2016-03-01

    The cortical thickness of the mammalian brain is an important morphological characteristic that can be used to investigate and observe the brain's developmental changes that might be caused by biologically toxic substances such as ethanol or cocaine. Although various cortical thickness analysis methods have been proposed that are applicable for human brain and have developed into well-validated open-source software packages, cortical thickness analysis methods for rodent brains have not yet become as robust and accurate as those designed for human brains. Based on a previously proposed cortical thickness measurement pipeline for rodent brain analysis,1 we present an enhanced cortical thickness pipeline in terms of accuracy and anatomical consistency. First, we propose a Lagrangian-based computational approach in the thickness measurement step in order to minimize local truncation error using the fourth-order Runge-Kutta method. Second, by constructing a line object for each streamline of the thickness measurement, we can visualize the way the thickness is measured and achieve sub-voxel accuracy by performing geometric post-processing. Last, with emphasis on the importance of an anatomically consistent partial differential equation (PDE) boundary map, we propose an automatic PDE boundary map generation algorithm that is specific to rodent brain anatomy, which does not require manual labeling. The results show that the proposed cortical thickness pipeline can produce statistically significant regions that are not observed in the previous cortical thickness analysis pipeline.

  7. Polynomial Asymptotes

    ERIC Educational Resources Information Center

    Dobbs, David E.

    2010-01-01

    This note develops and implements the theory of polynomial asymptotes to (graphs of) rational functions, as a generalization of the classical topics of horizontal asymptotes and oblique/slant asymptotes. Applications are given to hyperbolic asymptotes. Prerequisites include the division algorithm for polynomials with coefficients in the field of…

  8. Polynomial Asymptotes

    ERIC Educational Resources Information Center

    Dobbs, David E.

    2010-01-01

    This note develops and implements the theory of polynomial asymptotes to (graphs of) rational functions, as a generalization of the classical topics of horizontal asymptotes and oblique/slant asymptotes. Applications are given to hyperbolic asymptotes. Prerequisites include the division algorithm for polynomials with coefficients in the field of…

  9. A trans-dimensional polynomial-spline parameterization for gradient-based geoacoustic inversion.

    PubMed

    Steininger, Gavin; Dosso, Stan E; Holland, Charles W; Dettmer, Jan

    2014-10-01

    This paper presents a polynomial spline-based parameterization for trans-dimensional geoacoustic inversion. The parameterization is demonstrated for both simulated and measured data and shown to be an effective method of representing sediment geoacoustic profiles dominated by gradients, as typically occur, for example, in muddy seabeds. Specifically, the spline parameterization is compared using the deviance information criterion (DIC) to the standard stack-of-homogeneous layers parameterization for the inversion of bottom-loss data measured at a muddy seabed experiment site on the Malta Plateau. The DIC is an information criterion that is well suited to trans-D Bayesian inversion and is introduced to geoacoustics in this paper. Inversion results for both parameterizations are in good agreement with measurements on a sediment core extracted at the site. However, the spline parameterization more accurately resolves the power-law like structure of the core density profile and provides smaller overall uncertainties in geoacoustic parameters. In addition, the spline parameterization is found to be more parsimonious, and hence preferred, according to the DIC. The trans-dimensional polynomial spline approach is general, and applicable to any inverse problem for gradient-based profiles. [Work supported by ONR.].

  10. Spline-based high-accuracy piecewise-polynomial phase-to-sinusoid amplitude converters.

    PubMed

    Petrinović, Davor; Brezović, Marko

    2011-04-01

    We propose a method for direct digital frequency synthesis (DDS) using a cubic spline piecewise-polynomial model for a phase-to-sinusoid amplitude converter (PSAC). This method offers maximum smoothness of the output signal. Closed-form expressions for the cubic polynomial coefficients are derived in the spectral domain and the performance analysis of the model is given in the time and frequency domains. We derive the closed-form performance bounds of such DDS using conventional metrics: rms and maximum absolute errors (MAE) and maximum spurious free dynamic range (SFDR) measured in the discrete time domain. The main advantages of the proposed PSAC are its simplicity, analytical tractability, and inherent numerical stability for high table resolutions. Detailed guidelines for a fixed-point implementation are given, based on the algebraic analysis of all quantization effects. The results are verified on 81 PSAC configurations with the output resolutions from 5 to 41 bits by using a bit-exact simulation. The VHDL implementation of a high-accuracy DDS based on the proposed PSAC with 28-bit input phase word and 32-bit output value achieves SFDR of its digital output signal between 180 and 207 dB, with a signal-to-noise ratio of 192 dB. Its implementation requires only one 18 kB block RAM and three 18-bit embedded multipliers in a typical field-programmable gate array (FPGA) device. © 2011 IEEE

  11. Regression-based adaptive sparse polynomial dimensional decomposition for sensitivity analysis

    NASA Astrophysics Data System (ADS)

    Tang, Kunkun; Congedo, Pietro; Abgrall, Remi

    2014-11-01

    Polynomial dimensional decomposition (PDD) is employed in this work for global sensitivity analysis and uncertainty quantification of stochastic systems subject to a large number of random input variables. Due to the intimate structure between PDD and Analysis-of-Variance, PDD is able to provide simpler and more direct evaluation of the Sobol' sensitivity indices, when compared to polynomial chaos (PC). Unfortunately, the number of PDD terms grows exponentially with respect to the size of the input random vector, which makes the computational cost of the standard method unaffordable for real engineering applications. In order to address this problem of curse of dimensionality, this work proposes a variance-based adaptive strategy aiming to build a cheap meta-model by sparse-PDD with PDD coefficients computed by regression. During this adaptive procedure, the model representation by PDD only contains few terms, so that the cost to resolve repeatedly the linear system of the least-square regression problem is negligible. The size of the final sparse-PDD representation is much smaller than the full PDD, since only significant terms are eventually retained. Consequently, a much less number of calls to the deterministic model is required to compute the final PDD coefficients.

  12. Dynamic load identification for stochastic structures based on Gegenbauer polynomial approximation and regularization method

    NASA Astrophysics Data System (ADS)

    Liu, Jie; Sun, Xingsheng; Han, Xu; Jiang, Chao; Yu, Dejie

    2015-05-01

    Based on the Gegenbauer polynomial expansion theory and regularization method, an analytical method is proposed to identify dynamic loads acting on stochastic structures. Dynamic loads are expressed as functions of time and random parameters in time domain and the forward model of dynamic load identification is established through the discretized convolution integral of loads and the corresponding unit-pulse response functions of system. Random parameters are approximated through the random variables with λ-probability density function (PDFs) or their derivative PDFs. For this kind of random variables, Gegenbauer polynomial expansion is the unique correct choice to transform the problem of load identification for a stochastic structure into its equivalent deterministic system. Just via its equivalent deterministic system, the load identification problem of a stochastic structure can be solved by any available deterministic methods. With measured responses containing noise, the improved regularization operator is adopted to overcome the ill-posedness of load reconstruction and to obtain the stable and approximate solutions of certain inverse problems and the valid assessments of the statistics of identified loads. Numerical simulations demonstrate that with regard to stochastic structures, the identification and assessment of dynamic loads are achieved steadily and effectively by the presented method.

  13. Gabor filter based optical image recognition using Fractional Power Polynomial model based common discriminant locality preserving projection with kernels

    NASA Astrophysics Data System (ADS)

    Li, Jun-Bao

    2012-09-01

    This paper presents Gabor filter based optical image recognition using Fractional Power Polynomial model based Common Kernel Discriminant Locality Preserving Projection. This method tends to solve the nonlinear classification problem endured by optical image recognition owing to the complex illumination condition in practical applications, such as face recognition. The first step is to apply Gabor filter to extract desirable textural features characterized by spatial frequency, spatial locality and orientation selectivity to cope with the variations in illumination. In the second step we propose Class-wise Locality Preserving Projection through creating the nearest neighbor graph guided by the class labels for the textural features reduction. Finally we present Common Kernel Discriminant Vector with Fractional Power Polynomial model to reduce the dimensions of the textural features for recognition. For the performance evaluation on optical image recognition, we test the proposed method on a challenging optical image recognition problem, face recognition.

  14. Efficient polynomials based method for a temporal stability investigation in a swirling flow stability problem

    NASA Astrophysics Data System (ADS)

    Dragomirescu, Florica Ioana

    2012-11-01

    The main motivation for a temporal stability investigation of initially localized perturbations in a swirling flow stability problem consists in pointing out the critical frequencies at which instability can sets in, an important key in predicting and understanding the flow particularities. The linearized disturbance equations define a second order ordinary differential equation with non-constant coefficients which we solve in order to determine the critical frequency in different physical parameters spaces. A non-classical polynomials based spectral method is proposed for the numerical treatment of the resulting generalized eigenvalue problem governing the stability of the flow. Numerical investigation are performed in the inviscid case for a moderate level of swirl and dominant temporal instability modes are retrieved for each Fourier component pair. The obtained values of the growth rate associated with the most amplified wavenumber are compared with existing inviscid temporal instability evaluations and good agreements are found.

  15. Trade off between variable and fixed size normalization in orthogonal polynomials based iris recognition system.

    PubMed

    Krishnamoorthi, R; Anna Poorani, G

    2016-01-01

    Iris normalization is an important stage in any iris biometric, as it has a propensity to trim down the consequences of iris distortion. To indemnify the variation in size of the iris owing to the action of stretching or enlarging the pupil in iris acquisition process and camera to eyeball distance, two normalization schemes has been proposed in this work. In the first method, the iris region of interest is normalized by converting the iris into the variable size rectangular model in order to avoid the under samples near the limbus border. In the second method, the iris region of interest is normalized by converting the iris region into a fixed size rectangular model in order to avoid the dimensional discrepancies between the eye images. The performance of the proposed normalization methods is evaluated with orthogonal polynomials based iris recognition in terms of FAR, FRR, GAR, CRR and EER.

  16. A unified framework based on the binding polynomial for characterizing biological systems by isothermal titration calorimetry.

    PubMed

    Vega, Sonia; Abian, Olga; Velazquez-Campoy, Adrian

    2015-04-01

    Isothermal titration calorimetry (ITC) has become the gold-standard technique for studying binding processes due to its high precision and sensitivity, as well as its capability for the simultaneous determination of the association equilibrium constant, the binding enthalpy and the binding stoichiometry. The current widespread use of ITC for biological systems has been facilitated by technical advances and the availability of commercial calorimeters. However, the complexity of data analysis for non-standard models is one of the most significant drawbacks in ITC. Many models for studying macromolecular interactions can be found in the literature, but it looks like each biological system requires specific modeling and data analysis approaches. The aim of this article is to solve this lack of unity and provide a unified methodological framework for studying binding interactions by ITC that can be applied to any experimental system. The apparent complexity of this methodology, based on the binding polynomial, is overcome by its easy generalization to complex systems.

  17. Orthogonal polynomial Schauder bases in C[-1,1] with optimal growth of degrees

    SciTech Connect

    Skopina, M A

    2001-04-30

    For each {epsilon}>0 an orthogonal Schauder basis of algebraic polynomials P{sub n} in C[-1,1] is constructed such that the degrees of the polynomials have the estimate n(1+{epsilon}). This growth rate is the lowest possible.

  18. An rK28-Based Immunoenzymatic Assay for the Diagnosis of Canine Visceral Leishmaniasis in Latin America.

    PubMed

    Lauricella, Marta Alicia; Maidana, Cristina Graciela; Frias, Victoria Fragueiro; Romagosa, Carlo M; Negri, Vanesa; Benedetti, Ruben; Sinagra, Angel J; Luna, Concepcion; Tartaglino, Lilian; Laucella, Susana; Reed, Steven G; Riarte, Adelina R

    2016-07-06

    Direct observation of Leishmania parasites in tissue aspirates has shown low sensitivity for the detection of canine visceral leishmaniasis (VL). Therefore in the last quarter century immunoenzymatic tests have been developed to improve diagnosis. The purpose of this study was to develop a fast recombinant K28 antigen, naked-eye qualitative enzyme-linked immunosorbent assay (VL Ql-ELISA) and a quantitative version (VL Qt-ELISA), and to display it in a kit format, whose cutoff value (0.156) was selected as the most adequate one to differentiate reactive from nonreactive samples. Considering 167 cases and 300 controls, sensitivity was 91% for both assays and specificity was 100% and 98.7% in Ql-ELISA and Qt-ELISA, respectively. Positive predictive values were 100% and 97.4% for Ql-ELISA and Qt-ELISA, respectively, and negative predictive values were 95.2% for both ELISAs. Reagent stability, reliability studies, including periodic repetitions and retest of samples, cutoff selection, and comparison of rK28 ELISAs with rK39 immunochromatographic test, were the international criteria that supported the quality in both kits. The performance of both ELISA kits in this work confirmed their validity and emphasized their usefulness for low-to-medium complexity laboratories.

  19. An rK28-Based Immunoenzymatic Assay for the Diagnosis of Canine Visceral Leishmaniasis in Latin America

    PubMed Central

    Lauricella, Marta Alicia; Maidana, Cristina Graciela; Frias, Victoria Fragueiro; Romagosa, Carlo M.; Negri, Vanesa; Benedetti, Ruben; Sinagra, Angel J.; Luna, Concepcion; Tartaglino, Lilian; Laucella, Susana; Reed, Steven G.; Riarte, Adelina R.

    2016-01-01

    Direct observation of Leishmania parasites in tissue aspirates has shown low sensitivity for the detection of canine visceral leishmaniasis (VL). Therefore in the last quarter century immunoenzymatic tests have been developed to improve diagnosis. The purpose of this study was to develop a fast recombinant K28 antigen, naked-eye qualitative enzyme-linked immunosorbent assay (VL Ql-ELISA) and a quantitative version (VL Qt-ELISA), and to display it in a kit format, whose cutoff value (0.156) was selected as the most adequate one to differentiate reactive from nonreactive samples. Considering 167 cases and 300 controls, sensitivity was 91% for both assays and specificity was 100% and 98.7% in Ql-ELISA and Qt-ELISA, respectively. Positive predictive values were 100% and 97.4% for Ql-ELISA and Qt-ELISA, respectively, and negative predictive values were 95.2% for both ELISAs. Reagent stability, reliability studies, including periodic repetitions and retest of samples, cutoff selection, and comparison of rK28 ELISAs with rK39 immunochromatographic test, were the international criteria that supported the quality in both kits. The performance of both ELISA kits in this work confirmed their validity and emphasized their usefulness for low-to-medium complexity laboratories. PMID:27162270

  20. Chebyshev-polynomial-based (CPB) unified model neural network for the worst-case identification of nonlinear systems H∞ problem

    NASA Astrophysics Data System (ADS)

    Jeng, Jin-Tsong; Lee, Tsu-Tian

    1998-03-01

    In this paper, we propose a neural network model with a faster learning speed and a good approximate capability in the function approximation for solving worst-case identification of nonlinear systems H(infinity ) problems. Specifically, via the approximate transformable technique, we develop a Chebyshev Polynomials Based unified model neural network for solving the worst-case identification of nonlinear systems H(infinity ) problems. Based on this approximate transformable technique, the relationship between the single-layered neural network and multi-layered perceptron neural network is derived. It is shown that the Chebyshev Polynomials Based unified model neural network can be represented as a functional link network that is based on Chebyshev polynomials. We also derive a new learning algorithm such that the infinity norm of the transfer function from the input to the output is under a prescribed level. It turns out that the Chebyshev Polynomials Based unified model neural network not only has the same capability of universal approximator, but also has a faster learning speed than multi-layered perceptron or the recurrent neural network in the deterministic worst-case identification of nonlinear systems H(infinity ) problems.

  1. Phase demodulation method from a single fringe pattern based on correlation with a polynomial form.

    PubMed

    Robin, Eric; Valle, Valéry; Brémand, Fabrice

    2005-12-01

    The method presented extracts the demodulated phase from only one fringe pattern. Locally, this method approaches the fringe pattern morphology with the help of a mathematical model. The degree of similarity between the mathematical model and the real fringe is estimated by minimizing a correlation function. To use an optimization process, we have chosen a polynomial form such as a mathematical model. However, the use of a polynomial form induces an identification procedure with the purpose of retrieving the demodulated phase. This method, polynomial modulated phase correlation, is tested on several examples. Its performance, in terms of speed and precision, is presented on very noised fringe patterns.

  2. Station Based Polynomial Modeling of the local ionospheric Vertical Total Electron Content (VTEC) using Particle Filter

    NASA Astrophysics Data System (ADS)

    Erdogan, Eren; Onur Karslioglu, Mahmut; Durmaz, Murat; Aghakarimi, Armin

    2014-05-01

    In this study, particle filter (PF) which is mainly based on the Monte Carlo simulation technique has been carried out for polynomial modeling of the local ionospheric conditions above the selected ground based stations. Less sensitivity to the errors caused by linearization of models and the effect of unknown or unmodeled components in the system model is one of the advantages of the particle filter as compared to the Kalman filter which is commonly used as a recursive filtering method in VTEC modeling. Besides, probability distribution of the system models is not necessarily required to be Gaussian. In this work third order polynomial function has been incorporated into the particle filter implementation to represent the local VTEC distribution. Coefficients of the polynomial model presenting the ionospheric parameters and the receiver inter frequency biases are the unknowns forming the state vector which has been estimated epoch-wise for each ground station. To consider the time varying characteristics of the regional VTEC distribution, dynamics of the state vector parameters changing permanently have been modeled using the first order Gauss-Markov process. In the processing of the particle filtering, multi-variety probability distribution of the state vector through the time has been approximated by means of randomly selected samples and their associated weights. A known drawback of the particle filtering is that the increasing number of the state vector parameters results in an inefficient filter performance and requires more samples to represent the probability distribution of the state vector. Considering the total number of unknown parameters for all ground stations, estimation of these parameters which were inserted into a single state vector has caused the particle filter to produce inefficient results. To solve this problem, the PF implementation has been carried out separately for each ground station at current time epochs. After estimation of unknown

  3. Nested polynomial trends for the improvement of Gaussian process-based predictors

    NASA Astrophysics Data System (ADS)

    Perrin, G.; Soize, C.; Marque-Pucheu, S.; Garnier, J.

    2017-10-01

    The role of simulation keeps increasing for the sensitivity analysis and the uncertainty quantification of complex systems. Such numerical procedures are generally based on the processing of a huge amount of code evaluations. When the computational cost associated with one particular evaluation of the code is high, such direct approaches based on the computer code only, are not affordable. Surrogate models have therefore to be introduced to interpolate the information given by a fixed set of code evaluations to the whole input space. When confronted to deterministic mappings, the Gaussian process regression (GPR), or kriging, presents a good compromise between complexity, efficiency and error control. Such a method considers the quantity of interest of the system as a particular realization of a Gaussian stochastic process, whose mean and covariance functions have to be identified from the available code evaluations. In this context, this work proposes an innovative parametrization of this mean function, which is based on the composition of two polynomials. This approach is particularly relevant for the approximation of strongly non linear quantities of interest from very little information. After presenting the theoretical basis of this method, this work compares its efficiency to alternative approaches on a series of examples.

  4. Role of tensor operators in RK and RK*

    NASA Astrophysics Data System (ADS)

    Bardhan, Debjyoti; Byakti, Pritibhajan; Ghosh, Diptimoy

    2017-10-01

    The recent LHCb measurement of RK* in two q2 bins, when combined with the earlier measurement of RK, strongly suggests lepton flavour non-universal new physics in semi-leptonic B meson decays. Motivated by these intriguing hints of new physics, several authors have considered vector, axial vector, scalar and pseudo scalar operators as possible explanations of these measurements. However, tensor operators have widely been neglected in this context. In this paper, we consider the effect of tensor operators in RK and RK*. We find that, unlike other local operators, tensor operators can comfortably produce both of RK*low and RK*central close to their experimental central values. However, a simultaneous explanation of RK is not possible with only Tensor operators, and other vector or axial vector operators are needed. In fact, we find that combination of vector and tensor operators can provide simultaneous explanations of all the anomalies comfortably at the 1σ level, a scenario which is hard to achieve with only vector or axial vector operators. We also comment on the compatibility of the various new physics solutions with the measurements of the inclusive decay Bd →Xsℓ+ℓ-.

  5. Hydrodynamics-Based Functional Forms of Activity Metabolism: A Case for the Power-Law Polynomial Function in Animal Swimming Energetics

    PubMed Central

    Papadopoulos, Anthony

    2009-01-01

    The first-degree power-law polynomial function is frequently used to describe activity metabolism for steady swimming animals. This function has been used in hydrodynamics-based metabolic studies to evaluate important parameters of energetic costs, such as the standard metabolic rate and the drag power indices. In theory, however, the power-law polynomial function of any degree greater than one can be used to describe activity metabolism for steady swimming animals. In fact, activity metabolism has been described by the conventional exponential function and the cubic polynomial function, although only the power-law polynomial function models drag power since it conforms to hydrodynamic laws. Consequently, the first-degree power-law polynomial function yields incorrect parameter values of energetic costs if activity metabolism is governed by the power-law polynomial function of any degree greater than one. This issue is important in bioenergetics because correct comparisons of energetic costs among different steady swimming animals cannot be made unless the degree of the power-law polynomial function derives from activity metabolism. In other words, a hydrodynamics-based functional form of activity metabolism is a power-law polynomial function of any degree greater than or equal to one. Therefore, the degree of the power-law polynomial function should be treated as a parameter, not as a constant. This new treatment not only conforms to hydrodynamic laws, but also ensures correct comparisons of energetic costs among different steady swimming animals. Furthermore, the exponential power-law function, which is a new hydrodynamics-based functional form of activity metabolism, is a special case of the power-law polynomial function. Hence, the link between the hydrodynamics of steady swimming and the exponential-based metabolic model is defined. PMID:19333397

  6. Multivariate Polynomials Estimation Based on GradientBoost in Multimodal Biometrics

    NASA Astrophysics Data System (ADS)

    Parviz, Mehdi; Moin, M. Shahram

    One of the traditional criteria to estimate the value of coefficients of multivariate polynomials in regression applications is MSE, which is known as OWM in classifier combination literature. In this paper, we address the use of GradientBoost algorithm to estimate coefficients of multivariate polynomials for score fusion level in multimodal biometric systems. Our experiments on NIST-bssr1 score database showed an improvement in verification accuracy and also reduction of number of coefficients, which increased the memory efficiency. In addition, we examined combination of OWM, and GradientBoost which showed better ROC performance and lower model order compared to OWM alone.

  7. On the Standard Model prediction for RK and RK*

    NASA Astrophysics Data System (ADS)

    Pattori, A.

    2016-11-01

    In this article a recent work is reviewed, where we evaluated the impact of radiative corrections in RK and RK * . We find that, employing the cuts presently applied by the LHCb Collaboration, such corrections do not exceed a few percent. Moreover, their effect is well described (and corrected) by existing Monte Carlo codes. Our analysis reinforces the interest of these observables as clean probe of physics beyond the Standard Model.

  8. A Formally-Verified Decision Procedure for Univariate Polynomial Computation Based on Sturm's Theorem

    NASA Technical Reports Server (NTRS)

    Narkawicz, Anthony J.; Munoz, Cesar A.

    2014-01-01

    Sturm's Theorem is a well-known result in real algebraic geometry that provides a function that computes the number of roots of a univariate polynomial in a semiopen interval. This paper presents a formalization of this theorem in the PVS theorem prover, as well as a decision procedure that checks whether a polynomial is always positive, nonnegative, nonzero, negative, or nonpositive on any input interval. The soundness and completeness of the decision procedure is proven in PVS. The procedure and its correctness properties enable the implementation of a PVS strategy for automatically proving existential and universal univariate polynomial inequalities. Since the decision procedure is formally verified in PVS, the soundness of the strategy depends solely on the internal logic of PVS rather than on an external oracle. The procedure itself uses a combination of Sturm's Theorem, an interval bisection procedure, and the fact that a polynomial with exactly one root in a bounded interval is always nonnegative on that interval if and only if it is nonnegative at both endpoints.

  9. Vector quantizer based on brightness maps for image compression with the polynomial transform

    NASA Astrophysics Data System (ADS)

    Escalante-Ramirez, Boris; Moreno-Gutierrez, Mauricio; Silvan-Cardenas, Jose L.

    2002-11-01

    We present a vector quantization scheme acting on brightness fields based on distance/distortion criteria correspondent with psycho-visual aspects. These criteria quantify sensorial distortion between vectors that represent either portions of a digital image or alternatively, coefficients of a transform-based coding system. In the latter case, we use an image representation model, namely the Hermite transform, that is based on some of the main perceptual characteristics of the human vision system (HVS) and in their response to light stimulus. Energy coding in the brightness domain, determination of local structure, code-book training and local orientation analysis are all obtained by means of the Hermite transform. This paper, for thematic reasons, is divided in four sections. The first one will shortly highlight the importance of having newer and better compression algorithms. This section will also serve to explain briefly the most relevant characteristics of the HVS, advantages and disadvantages related with the behavior of our vision in front of ocular stimulus. The second section shall go through a quick review of vector quantization techniques, focusing their performance on image treatment, as a preview for the image vector quantizer compressor actually constructed in section 5. Third chapter was chosen to concentrate the most important data gathered on brightness models. The building of this so-called brightness maps (quantification of the human perception on the visible objects reflectance), in a bi-dimensional model, will be addressed here. The Hermite transform, a special case of polynomial transforms, and its usefulness, will be treated, in an applicable discrete form, in the fourth chapter. As we have learned from previous works 1, Hermite transform has showed to be a useful and practical solution to efficiently code the energy within an image block, deciding which kind of quantization is to be used upon them (whether scalar or vector). It will also be

  10. Linear precoding based on polynomial expansion: reducing complexity in massive MIMO.

    PubMed

    Mueller, Axel; Kammoun, Abla; Björnson, Emil; Debbah, Mérouane

    Massive multiple-input multiple-output (MIMO) techniques have the potential to bring tremendous improvements in spectral efficiency to future communication systems. Counterintuitively, the practical issues of having uncertain channel knowledge, high propagation losses, and implementing optimal non-linear precoding are solved more or less automatically by enlarging system dimensions. However, the computational precoding complexity grows with the system dimensions. For example, the close-to-optimal and relatively "antenna-efficient" regularized zero-forcing (RZF) precoding is very complicated to implement in practice, since it requires fast inversions of large matrices in every coherence period. Motivated by the high performance of RZF, we propose to replace the matrix inversion and multiplication by a truncated polynomial expansion (TPE), thereby obtaining the new TPE precoding scheme which is more suitable for real-time hardware implementation and significantly reduces the delay to the first transmitted symbol. The degree of the matrix polynomial can be adapted to the available hardware resources and enables smooth transition between simple maximum ratio transmission and more advanced RZF. By deriving new random matrix results, we obtain a deterministic expression for the asymptotic signal-to-interference-and-noise ratio (SINR) achieved by TPE precoding in massive MIMO systems. Furthermore, we provide a closed-form expression for the polynomial coefficients that maximizes this SINR. To maintain a fixed per-user rate loss as compared to RZF, the polynomial degree does not need to scale with the system, but it should be increased with the quality of the channel knowledge and the signal-to-noise ratio.

  11. Towards top-hat spatial shaping of ultrafast laser beam based on Zernike polynomials

    NASA Astrophysics Data System (ADS)

    Mauclair, Cyril; Faure, Nicolas; Houzet, Julien

    2016-04-01

    Femtosecond laser micro machining of surfaces knows a gain of interest as it demonstrates efficient and precise processing with reduced side effects around the irradiated zone, and also because of the remarkable costs reduction and reliability improvements of nowadays commercially available sources. Controlling the intensity distribution spatially can offer a supplementary degree of flexibility and precision in achieving user-defined ablation spatial profile, drilling, cutting of materials or in-volume laser-induced modifications. In this scope, the possibility to generate a top-hat intensity distribution by spatially shaping the beam wavefront is studied in this work. An optimization of Zernike polynomials coefficients is conducted to numerically determine an adequate phase mask that shapes the laser intensity distribution following a targeted top hat distribution in the processing plane, usually at the focal length of a converging lens. The efficiency of the method is numerically investigated in the optimization by evaluation of the root mean square error (RMS) between the top-hat target and the calculated laser distribution in the far field. We numerically verify that acceptable top-hat beam shaping of various size can be achieved with a sufficient number of Zernike polynomials, opening the way to phase mask calculations adapted to the wavefront modulator ability to reproduce Zernike polynomials.

  12. The stability of the Boubaker polynomials expansion scheme (BPES)-based solution to Lotka-Volterra problem.

    PubMed

    Milgram, A

    2011-02-21

    This comment addresses critics on the claimed stability of solution to the accelerated-predator-satiety Lotka-Volterra predator-prey problem, proposed by Dubey al. (2010. A solution to the accelerated-predator-satiety Lotka-Volterra predator-prey problem using Boubaker polynomial expansion scheme. Journal of Theoretical Biology 264, 154-160). Critics are based on incompatibilities between the claimed asymptotic behavior and the presumed Malthusian growth of prey population in absence of predator. Copyright © 2010 Elsevier Ltd. All rights reserved.

  13. Fast fluorescent imaging-based Thai jasmine rice identification with polynomial fitting function and neural network analysis.

    PubMed

    Suwansukho, Kajpanya; Sumriddetchkajorn, Sarun; Buranasiri, Prathan

    2014-04-01

    With our single-wavelength spectral-imaging-based Thai jasmine rice identification system, we emphasize here that a combination of an appropriate polynomial fitting function on the determined chain code and a well-trained neural network configuration is highly sufficient in achieving a low false acceptance rate (FAR) and a low false rejection rate (FRR). Experimental demonstration shows promising results in identifying our desired Thai jasmine rice from six unwanted rice varieties with FAR and FRR values of 6.2% and 7.1%, respectively. Additional key performances include a much faster identification time of 30.5 s, chemical-free analysis, robustness, and adaptive learning.

  14. A ROM-less direct digital frequency synthesizer based on hybrid polynomial approximation.

    PubMed

    Omran, Qahtan Khalaf; Islam, Mohammad Tariqul; Misran, Norbahiah; Faruque, Mohammad Rashed Iqbal

    2014-01-01

    In this paper, a novel design approach for a phase to sinusoid amplitude converter (PSAC) has been investigated. Two segments have been used to approximate the first sine quadrant. A first linear segment is used to fit the region near the zero point, while a second fourth-order parabolic segment is used to approximate the rest of the sine curve. The phase sample, where the polynomial changed, was chosen in such a way as to achieve the maximum spurious free dynamic range (SFDR). The invented direct digital frequency synthesizer (DDFS) has been encoded in VHDL and post simulation was carried out. The synthesized architecture exhibits a promising result of 90 dBc SFDR. The targeted structure is expected to show advantages for perceptible reduction of hardware resources and power consumption as well as high clock speeds.

  15. Single-wavelength based Thai jasmine rice identification with polynomial fitting function and neural network analysis

    NASA Astrophysics Data System (ADS)

    Suwansukho, Kajpanya; Sumriddetchkajorn, Sarun; Buranasiri, Prathan

    2013-06-01

    We previously showed that a combination of image thresholding, chain coding, elliptic Fourier descriptors, and artificial neural network analysis provided a low false acceptance rate (FAR) and a false rejection rate (FRR) of 11.0% and 19.0%, respectively, in identify Thai jasmine rice from three unwanted rice varieties. In this work, we highlight that only a polynomial function fitting on the determined chain code and the neural network analysis are highly sufficient in obtaining a very low FAR of < 3.0% and a very low 0.3% FRR for the separation of Thai jasmine rice from Chainat 1 (CNT1), Prathumtani 1 (PTT1), and Hom-Pitsanulok (HPSL) rice varieties. With this proposed approach, the analytical time is tremendously suppressed from 4,250 seconds down to 2 seconds, implying extremely high potential in practical deployment.

  16. A ROM-Less Direct Digital Frequency Synthesizer Based on Hybrid Polynomial Approximation

    PubMed Central

    Omran, Qahtan Khalaf; Islam, Mohammad Tariqul; Misran, Norbahiah; Faruque, Mohammad Rashed Iqbal

    2014-01-01

    In this paper, a novel design approach for a phase to sinusoid amplitude converter (PSAC) has been investigated. Two segments have been used to approximate the first sine quadrant. A first linear segment is used to fit the region near the zero point, while a second fourth-order parabolic segment is used to approximate the rest of the sine curve. The phase sample, where the polynomial changed, was chosen in such a way as to achieve the maximum spurious free dynamic range (SFDR). The invented direct digital frequency synthesizer (DDFS) has been encoded in VHDL and post simulation was carried out. The synthesized architecture exhibits a promising result of 90 dBc SFDR. The targeted structure is expected to show advantages for perceptible reduction of hardware resources and power consumption as well as high clock speeds. PMID:24892092

  17. A New Method to Estimate Changes in Glacier Surface Elevation Based on Polynomial Fitting of Sparse ICESat—GLAS Footprints

    PubMed Central

    Huang, Tianjin; Jia, Li; Menenti, Massimo; Lu, Jing

    2017-01-01

    We present in this paper a polynomial fitting method applicable to segments of footprints measured by the Geoscience Laser Altimeter System (GLAS) to estimate glacier thickness change. Our modification makes the method applicable to complex topography, such as a large mountain glacier. After a full analysis of the planar fitting method to characterize errors of estimates due to complex topography, we developed an improved fitting method by adjusting a binary polynomial surface to local topography. The improved method and the planar fitting method were tested on the accumulation areas of the Naimona’nyi glacier and Yanong glacier on along-track facets with lengths of 1000 m, 1500 m, 2000 m, and 2500 m, respectively. The results show that the improved method gives more reliable estimates of changes in elevation than planar fitting. The improved method was also tested on Guliya glacier with a large and relatively flat area and the Chasku Muba glacier with very complex topography. The results in these test sites demonstrate that the improved method can give estimates of glacier thickness change on glaciers with a large area and a complex topography. Additionally, the improved method based on GLAS Data and Shuttle Radar Topography Mission-Digital Elevation Model (SRTM-DEM) can give estimates of glacier thickness change from 2000 to 2008/2009, since it takes the 2000 SRTM-DEM as a reference, which is a longer period than 2004 to 2008/2009, when using the GLAS data only and the planar fitting method. PMID:28783059

  18. A New Method to Estimate Changes in Glacier Surface Elevation Based on Polynomial Fitting of Sparse ICESat-GLAS Footprints.

    PubMed

    Huang, Tianjin; Jia, Li; Menenti, Massimo; Lu, Jing; Zhou, Jie; Hu, Guangcheng

    2017-08-05

    We present in this paper a polynomial fitting method applicable to segments of footprints measured by the Geoscience Laser Altimeter System (GLAS) to estimate glacier thickness change. Our modification makes the method applicable to complex topography, such as a large mountain glacier. After a full analysis of the planar fitting method to characterize errors of estimates due to complex topography, we developed an improved fitting method by adjusting a binary polynomial surface to local topography. The improved method and the planar fitting method were tested on the accumulation areas of the Naimona'nyi glacier and Yanong glacier on along-track facets with lengths of 1000 m, 1500 m, 2000 m, and 2500 m, respectively. The results show that the improved method gives more reliable estimates of changes in elevation than planar fitting. The improved method was also tested on Guliya glacier with a large and relatively flat area and the Chasku Muba glacier with very complex topography. The results in these test sites demonstrate that the improved method can give estimates of glacier thickness change on glaciers with a large area and a complex topography. Additionally, the improved method based on GLAS Data and Shuttle Radar Topography Mission-Digital Elevation Model (SRTM-DEM) can give estimates of glacier thickness change from 2000 to 2008/2009, since it takes the 2000 SRTM-DEM as a reference, which is a longer period than 2004 to 2008/2009, when using the GLAS data only and the planar fitting method.

  19. A New Navigation Satellite Clock Bias Prediction Method Based on Modified Clock-bias Quadratic Polynomial Model

    NASA Astrophysics Data System (ADS)

    Wang, Y. P.; Lu, Z. P.; Sun, D. S.; Wang, N.

    2016-01-01

    In order to better express the characteristics of satellite clock bias (SCB) and improve SCB prediction precision, this paper proposed a new SCB prediction model which can take physical characteristics of space-borne atomic clock, the cyclic variation, and random part of SCB into consideration. First, the new model employs a quadratic polynomial model with periodic items to fit and extract the trend term and cyclic term of SCB; then based on the characteristics of fitting residuals, a time series ARIMA ~(Auto-Regressive Integrated Moving Average) model is used to model the residuals; eventually, the results from the two models are combined to obtain final SCB prediction values. At last, this paper uses precise SCB data from IGS (International GNSS Service) to conduct prediction tests, and the results show that the proposed model is effective and has better prediction performance compared with the quadratic polynomial model, grey model, and ARIMA model. In addition, the new method can also overcome the insufficiency of the ARIMA model in model recognition and order determination.

  20. Tutte polynomial of the Apollonian network

    NASA Astrophysics Data System (ADS)

    Liao, Yunhua; Hou, Yaoping; Shen, Xiaoling

    2014-10-01

    The Tutte polynomial of a graph, or equivalently the q-state Potts model partition function, is a two-variable polynomial graph invariant of considerable importance in both combinatorics and statistical physics. The computation of this invariant for a graph is, in general, NP-hard. The aim of this paper is to compute the Tutte polynomial of the Apollonian network. Based on the well-known duality property of the Tutte polynomial, we extend the subgraph-decomposition method. In particular, we do not calculate the Tutte polynomial of the Apollonian network directly, instead we calculate the Tutte polynomial of the Apollonian dual graph. By using the close relation between the Apollonian dual graph and the Hanoi graph, we express the Tutte polynomial of the Apollonian dual graph in terms of that of the Hanoi graph. As an application, we also give the number of spanning trees of the Apollonian network.

  1. RK-TBA prototype RF source

    SciTech Connect

    Houck, T.; Anderson, D.; Giordano, G.

    1996-04-11

    A prototype rf power source based on the Relativistic Klystron Two-Beam Accelerator (RK-TBA) concept is being constructed at the Lawrence Berkeley National Laboratory to study physics, engineering, and costing issues. The prototype is described and compared to a full scale design appropriate for driving the Next Linear Collider (NLC). Specific details of the induction core tests and pulsed power system are presented. The 1-MeV, 1.2-kA induction gun currently under construction is also described in detail.

  2. A computer-based ``laboratory`` course in mathematical methods for science and engineering: The Legendre Polynomials module. Final report

    SciTech Connect

    Silbar, R.R.

    1998-09-28

    WhistleSoft, Inc., proposed to convert a successful pedagogical experiment into multimedia software, making it accessible to a much broader audience. A colleague, Richard J. Jacob, has been teaching a workshop course in mathematical methods at Arizona State University (ASU) for lower undergraduate science majors. Students work at their own pace through paper-based tutorials containing many exercises, either with pencil and paper or with computer tools such as spreadsheets. These tutorial modules cry out for conversion into an interactive computer-based tutorial course that is suitable both for the classroom and for self-paced, independent learning. WhistleSoft has made a prototype of one such module, Legendre Polynomials, under Subcontract (No F97440018-35) with the Los Alamos Laboratory`s Technology Commercialization Office for demonstration and marketing purposes.

  3. Inverse synthetic aperture radar imaging of targets with complex motion based on the local polynomial ambiguity function

    NASA Astrophysics Data System (ADS)

    Lv, Qian; Su, Tao; Zheng, Jibin

    2016-01-01

    In inverse synthetic aperture radar (ISAR) imaging of targets with complex motion, the azimuth echoes have to be modeled as multicomponent cubic phase signals (CPSs) after motion compensation. For the CPS model, the chirp rate and the quadratic chirp rate deteriorate the ISAR image quality due to the Doppler frequency shift; thus, an effective parameter estimation algorithm is required. This paper focuses on a parameter estimation algorithm for multicomponent CPSs based on the local polynomial ambiguity function (LPAF), which is simple and can be easily implemented via the complex multiplication and fast Fourier transform. Compared with the existing parameter estimation algorithm for CPS, the proposed algorithm can achieve a better compromise between performance and computational complexity. Then, the high-quality ISAR image can be obtained by the proposed LPAF-based ISAR imaging algorithm. The results of the simulated data demonstrate the effectiveness of the proposed algorithm.

  4. Selection of polynomial chaos bases via Bayesian model uncertainty methods with applications to sparse approximation of PDEs with stochastic inputs

    SciTech Connect

    Karagiannis, Georgios Lin, Guang

    2014-02-15

    Generalized polynomial chaos (gPC) expansions allow us to represent the solution of a stochastic system using a series of polynomial chaos basis functions. The number of gPC terms increases dramatically as the dimension of the random input variables increases. When the number of the gPC terms is larger than that of the available samples, a scenario that often occurs when the corresponding deterministic solver is computationally expensive, evaluation of the gPC expansion can be inaccurate due to over-fitting. We propose a fully Bayesian approach that allows for global recovery of the stochastic solutions, in both spatial and random domains, by coupling Bayesian model uncertainty and regularization regression methods. It allows the evaluation of the PC coefficients on a grid of spatial points, via (1) the Bayesian model average (BMA) or (2) the median probability model, and their construction as spatial functions on the spatial domain via spline interpolation. The former accounts for the model uncertainty and provides Bayes-optimal predictions; while the latter provides a sparse representation of the stochastic solutions by evaluating the expansion on a subset of dominating gPC bases. Moreover, the proposed methods quantify the importance of the gPC bases in the probabilistic sense through inclusion probabilities. We design a Markov chain Monte Carlo (MCMC) sampler that evaluates all the unknown quantities without the need of ad-hoc techniques. The proposed methods are suitable for, but not restricted to, problems whose stochastic solutions are sparse in the stochastic space with respect to the gPC bases while the deterministic solver involved is expensive. We demonstrate the accuracy and performance of the proposed methods and make comparisons with other approaches on solving elliptic SPDEs with 1-, 14- and 40-random dimensions.

  5. Selection of Polynomial Chaos Bases via Bayesian Model Uncertainty Methods with Applications to Sparse Approximation of PDEs with Stochastic Inputs

    SciTech Connect

    Karagiannis, Georgios; Lin, Guang

    2014-02-15

    Generalized polynomial chaos (gPC) expansions allow the representation of the solution of a stochastic system as a series of polynomial terms. The number of gPC terms increases dramatically with the dimension of the random input variables. When the number of the gPC terms is larger than that of the available samples, a scenario that often occurs if the evaluations of the system are expensive, the evaluation of the gPC expansion can be inaccurate due to over-fitting. We propose a fully Bayesian approach that allows for global recovery of the stochastic solution, both in spacial and random domains, by coupling Bayesian model uncertainty and regularization regression methods. It allows the evaluation of the PC coefficients on a grid of spacial points via (1) Bayesian model average or (2) medial probability model, and their construction as functions on the spacial domain via spline interpolation. The former accounts the model uncertainty and provides Bayes-optimal predictions; while the latter, additionally, provides a sparse representation of the solution by evaluating the expansion on a subset of dominating gPC bases when represented as a gPC expansion. Moreover, the method quantifies the importance of the gPC bases through inclusion probabilities. We design an MCMC sampler that evaluates all the unknown quantities without the need of ad-hoc techniques. The proposed method is suitable for, but not restricted to, problems whose stochastic solution is sparse at the stochastic level with respect to the gPC bases while the deterministic solver involved is expensive. We demonstrate the good performance of the proposed method and make comparisons with others on 1D, 14D and 40D in random space elliptic stochastic partial differential equations.

  6. RK-TBA studies at the RTA test facility

    NASA Astrophysics Data System (ADS)

    Lidia, S.; Anderson, D.; Eylon, S.; Henestroza, E.; Houck, T.; Reginato, L.; Vanecek, D.; Westenskow, G.; Yu, S.

    1997-03-01

    Construction of a prototype RF power source based on the RK-TBA concept, called the RTA, has commenced at the Lawrence Berkeley National Laboratory. This prototype will be used to study physics, engineering, and costing issues involved in the application of the RK-TBA concept to linear colliders. The status of the prototype is presented, specifically the 1-MV, 1.2-kA induction electron gun and the pulsed power system that are in assembly. The RTA program theoretical effort, in addition to supporting the development of the prototype, has been studying optimization parameters for the application of the RK-TBA concept to higher-energy linear colliders. An overview of this work is presented.

  7. RK-TBA studies at the RTA test facility

    SciTech Connect

    Lidia, S.; Anderson, D.; Eylon, S.; Henestroza, E.; Houck, T.; Reginato, L.; Vanecek, D.; Westenskow, G.; Yu, S.

    1997-03-01

    Construction of a prototype RF power source based on the RK-TBA concept, called the RTA, has commenced at the Lawrence Berkeley National Laboratory. This prototype will be used to study physics, engineering, and costing issues involved in the application of the RK-TBA concept to linear colliders. The status of the prototype is presented, specifically the 1-MV, 1.2-kA induction electron gun and the pulsed power system that are in assembly. The RTA program theoretical effort, in addition to supporting the development of the prototype, has been studying optimization parameters for the application of the RK-TBA concept to higher-energy linear colliders. An overview of this work is presented. {copyright} {ital 1997 American Institute of Physics.}

  8. RK-TBA Studies at the RTA Test Facility

    SciTech Connect

    Lidia, S.; Anderson, D.; Eylon, S.; Reginato, L.; Vanecek, D.; Yu, S.; Henestroza, E.; Houck, T.; Westenskow, G.

    1997-01-01

    Construction of a prototype RF power source based on the RK-TBA concept, called the RTA, has commenced at the Lawrence Berkeley National Laboratory. This prototype will be used to study physics, engineering, and costing issues involved in the application of the RK-TBA concept to linear colliders. The status of the prototype is presented, specifically the 1-MV, 1.2-kA induction electron gun and the pulsed power system that are in assembly. The RTA program theoretical effort, in addition to supporting the development of the prototype, has been studying optimization parameters for the application of the RK-TBA concept to higher-energy linear colliders. An overview of this work is presented. 1 fig.

  9. Improved polynomial remainder sequences for Ore polynomials.

    PubMed

    Jaroschek, Maximilian

    2013-11-01

    Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when applied to (non-)commutative polynomials. The running time of the algorithm is dependent on the size of the coefficients of the remainders. Different ways have been studied to make these as small as possible. The subresultant sequence of two polynomials is a polynomial remainder sequence in which the size of the coefficients is optimal in the generic case, but when taking the input from applications, the coefficients are often larger than necessary. We generalize two improvements of the subresultant sequence to Ore polynomials and derive a new bound for the minimal coefficient size. Our approach also yields a new proof for the results in the commutative case, providing a new point of view on the origin of the extraneous factors of the coefficients.

  10. Chaos, Fractals, and Polynomials.

    ERIC Educational Resources Information Center

    Tylee, J. Louis; Tylee, Thomas B.

    1996-01-01

    Discusses chaos theory; linear algebraic equations and the numerical solution of polynomials, including the use of the Newton-Raphson technique to find polynomial roots; fractals; search region and coordinate systems; convergence; and generating color fractals on a computer. (LRW)

  11. Factoring Polynomials and Fibonacci.

    ERIC Educational Resources Information Center

    Schwartzman, Steven

    1986-01-01

    Discusses the factoring of polynomials and Fibonacci numbers, offering several challenges teachers can give students. For example, they can give students a polynomial containing large numbers and challenge them to factor it. (JN)

  12. Factoring Polynomials and Fibonacci.

    ERIC Educational Resources Information Center

    Schwartzman, Steven

    1986-01-01

    Discusses the factoring of polynomials and Fibonacci numbers, offering several challenges teachers can give students. For example, they can give students a polynomial containing large numbers and challenge them to factor it. (JN)

  13. Chaos, Fractals, and Polynomials.

    ERIC Educational Resources Information Center

    Tylee, J. Louis; Tylee, Thomas B.

    1996-01-01

    Discusses chaos theory; linear algebraic equations and the numerical solution of polynomials, including the use of the Newton-Raphson technique to find polynomial roots; fractals; search region and coordinate systems; convergence; and generating color fractals on a computer. (LRW)

  14. Generalised polynomial chaos-based uncertainty quantification for planning MRgLITT procedures.

    PubMed

    Fahrenholtz, Samuel J; Stafford, R Jason; Maier, Florian; Hazle, John D; Fuentes, David

    2013-06-01

    A generalised polynomial chaos (gPC) method is used to incorporate constitutive parameter uncertainties within the Pennes representation of bioheat transfer phenomena. The stochastic temperature predictions of the mathematical model are critically evaluated against MR thermometry data for planning MR-guided laser-induced thermal therapies (MRgLITT). The Pennes bioheat transfer model coupled with a diffusion theory approximation of laser tissue interaction was implemented as the underlying deterministic kernel. A probabilistic sensitivity study was used to identify parameters that provide the most variance in temperature output. Confidence intervals of the temperature predictions are compared to MR temperature imaging (MRTI) obtained during phantom and in vivo canine (n = 4) MRgLITT experiments. The gPC predictions were quantitatively compared to MRTI data using probabilistic linear and temporal profiles as well as 2-D 60 °C isotherms. Optical parameters provided the highest variance in the model output (peak standard deviation: anisotropy 3.51 °C, absorption 2.94 °C, scattering 1.84 °C, conductivity 1.43 °C, and perfusion 0.94 °C). Further, within the statistical sense considered, a non-linear model of the temperature and damage-dependent perfusion, absorption, and scattering is captured within the confidence intervals of the linear gPC method. Multivariate stochastic model predictions using parameters with the dominant sensitivities show good agreement with experimental MRTI data. Given parameter uncertainties and mathematical modelling approximations of the Pennes bioheat model, the statistical framework demonstrates conservative estimates of the therapeutic heating and has potential for use as a computational prediction tool for thermal therapy planning.

  15. Generalized Polynomial Chaos Based Uncertainty Quantification for Planning MRgLITT Procedures

    PubMed Central

    Fahrenholtz, S.; Stafford, R. J.; Maier, F.; Hazle, J. D.; Fuentes, D.

    2014-01-01

    Purpose A generalized polynomial chaos (gPC) method is used to incorporate constitutive parameter uncertainties within the Pennes representation of bioheat transfer phenomena. The stochastic temperature predictions of the mathematical model are critically evaluated against MR thermometry data for planning MR-guided Laser Induced Thermal Therapies (MRgLITT). Methods Pennes bioheat transfer model coupled with a diffusion theory approximation of laser tissue interaction was implemented as the underlying deterministic kernel. A probabilistic sensitivity study was used to identify parameters that provide the most variance in temperature output. Confidence intervals of the temperature predictions are compared to MR temperature imaging (MRTI) obtained during phantom and in vivo canine (n=4) MRgLITT experiments. The gPC predictions were quantitatively compared to MRTI data using probabilistic linear and temporal profiles as well as 2-D 60 °C isotherms. Results Within the range of physically meaningful constitutive values relevant to the ablative temperature regime of MRgLITT, the sensitivity study indicated that the optical parameters, particularly the anisotropy factor, created the most variance in the stochastic model's output temperature prediction. Further, within the statistical sense considered, a nonlinear model of the temperature and damage dependent perfusion, absorption, and scattering is captured within the confidence intervals of the linear gPC method. Multivariate stochastic model predictions using parameters with the dominant sensitivities show good agreement with experimental MRTI data. Conclusions Given parameter uncertainties and mathematical modeling approximations of the Pennes bioheat model, the statistical framework demonstrates conservative estimates of the therapeutic heating and has potential for use as a computational prediction tool for thermal therapy planning. PMID:23692295

  16. A New Standard-Based Polynomial Interpolation (SBPIn) Method to Address Gel-to-Gel Variability for the Comparison of Multiple Denaturing Gradient Gel Electrophoresis Profile Matrices

    PubMed Central

    Valentín-Vargas, Alexis; Chorover, Jon; Maier, Raina M.

    2013-01-01

    The Standard-Based Polynomial Interpolation (SBPIn) method is a new simple three-step protocol proposed to address common gel-to-gel variations for the comparison of sample profiles across multiple DGGE gels. The advantages of this method include no requirement for additional software or modification of the standard DGGE protocol. PMID:23234884

  17. A polynomial chaos expansion based molecular dynamics study for probabilistic strength analysis of nano-twinned copper

    NASA Astrophysics Data System (ADS)

    Mahata, Avik; Mukhopadhyay, Tanmoy; Adhikari, Sondipon

    2016-03-01

    Nano-twinned structures are mechanically stronger, ductile and stable than its non-twinned form. We have investigated the effect of varying twin spacing and twin boundary width (TBW) on the yield strength of the nano-twinned copper in a probabilistic framework. An efficient surrogate modelling approach based on polynomial chaos expansion has been proposed for the analysis. Effectively utilising 15 sets of expensive molecular dynamics simulations, thousands of outputs have been obtained corresponding to different sets of twin spacing and twin width using virtual experiments based on the surrogates. One of the major outcomes of this work is that there exists an optimal combination of twin boundary spacing and twin width until which the strength can be increased and after that critical point the nanowires weaken. This study also reveals that the yield strength of nano-twinned copper is more sensitive to TBW than twin spacing. Such robust inferences have been possible to be drawn only because of applying the surrogate modelling approach, which makes it feasible to obtain results corresponding to 40 000 combinations of different twin boundary spacing and twin width in a computationally efficient framework.

  18. Polynomial Chaos-based Bayesian Inference of K-Profile Parametrization in a General Circulation Model of the Torpical Pacific

    NASA Astrophysics Data System (ADS)

    Hoteit, I.; Sraj, I.; Zedler, S. E.; Jackson, C. S.; Knio, O. M.

    2016-02-01

    We present a Polynomial Chaos (PC)-based Bayesian inference method for quantifying the uncertainties of K-Profile Parametrization (KPP) model in MIT General Circulation Model (MITgcm). The inference of the uncertain parameters is based on a Markov Chain Monte Carlo (MCMC) scheme that utilizes a newly formulated test statistic taking into account the different components representing the structures of turbulent mixing on both daily and seasonal timescales in addition to the data quality, and filters for the effects of parameter perturbations over those due to changes in the wind. To avoid the prohibitive computational cost of integrating the MITgcm model at each MCMC iteration, we build a surrogate model for the test statistic using the PC method. The traditional spectral projection method for finding the PC coefficients suffered from convergence issues due to the internal noise in the model predictions. Instead, a Basis-Pursuit-DeNoising (BPDN) compressed sensing approach was employed that filtered out the noise and determined the PC coefficients of a representative surrogate model. The PC surrogate is then used to evaluate the test statistic in the MCMC step for sampling the posterior of the uncertain parameters. We present results of the posteriors that indicate a good agreement with the default values for two parameters of the KPP model namely the critical bulk and gradient Richardson; while the posteriors of the remaining parameters were hardly informative.

  19. Polynomial Chaos-Based Bayesian Inference of K-Profile Parameterization in a General Circulation Model of the Tropical Pacific

    NASA Astrophysics Data System (ADS)

    Sraj, Ihab; Zedler, Sarah E.; Knio, Omar M.; Jackson, Charles S.; Hoteit, Ibrahim

    2016-12-01

    The authors present a Polynomial Chaos (PC)-based Bayesian inference method for quantifying the uncertainties of the K-Profile Parametrization (KPP) within the MIT General Circulation Model (MITgcm) of the tropical pacific. The inference of the uncertain parameters is based on a Markov Chain Monte Carlo (MCMC) scheme that utilizes a newly formulated test statistic taking into account the different components representing the structures of turbulent mixing on both daily and seasonal timescales in addition to the data quality, and filters for the effects of parameter perturbations over those due to changes in the wind. To avoid the prohibitive computational cost of integrating the MITgcm model at each MCMC iteration, we build a surrogate model for the test statistic using the PC method. To filter out the noise in the model predictions and avoid related convergence issues, we resort to a Basis-Pursuit-DeNoising (BPDN) compressed sensing approach to determine the PC coefficients of a representative surrogate model. The PC surrogate is then used to evaluate the test statistic in the MCMC step for sampling the posterior of the uncertain parameters. Results of the posteriors indicate good agreement with the default values for two parameters of the KPP model namely the critical bulk and gradient Richardson numbers; while the posteriors of the remaining parameters were barely informative.

  20. On Polynomial Solutions of Linear Differential Equations with Polynomial Coefficients

    ERIC Educational Resources Information Center

    Si, Do Tan

    1977-01-01

    Demonstrates a method for solving linear differential equations with polynomial coefficients based on the fact that the operators z and D + d/dz are known to be Hermitian conjugates with respect to the Bargman and Louck-Galbraith scalar products. (MLH)

  1. Multiple zeros of polynomials

    NASA Technical Reports Server (NTRS)

    Wood, C. A.

    1974-01-01

    For polynomials of higher degree, iterative numerical methods must be used. Four iterative methods are presented for approximating the zeros of a polynomial using a digital computer. Newton's method and Muller's method are two well known iterative methods which are presented. They extract the zeros of a polynomial by generating a sequence of approximations converging to each zero. However, both of these methods are very unstable when used on a polynomial which has multiple zeros. That is, either they fail to converge to some or all of the zeros, or they converge to very bad approximations of the polynomial's zeros. This material introduces two new methods, the greatest common divisor (G.C.D.) method and the repeated greatest common divisor (repeated G.C.D.) method, which are superior methods for numerically approximating the zeros of a polynomial having multiple zeros. These methods were programmed in FORTRAN 4 and comparisons in time and accuracy are given.

  2. Notes on Schubert, Grothendieck and Key Polynomials

    NASA Astrophysics Data System (ADS)

    Kirillov, Anatol N.

    2016-03-01

    We introduce common generalization of (double) Schubert, Grothendieck, Demazure, dual and stable Grothendieck polynomials, and Di Francesco-Zinn-Justin polynomials. Our approach is based on the study of algebraic and combinatorial properties of the reduced rectangular plactic algebra and associated Cauchy kernels.

  3. Ubiquity of Kostka Polynomials

    NASA Astrophysics Data System (ADS)

    Kirillov, Anatol N.

    2001-04-01

    We report about results revolving around Kostka-Foulkes and parabolic Kostka polynomials and their connections with Representation Theory and Combinatorics. It appears that the set of all parabolic Kostka polynomials forms a semigroup, which we call Liskova semigroup. We show that polynomials frequently appearing in Representation Theory and Combinatorics belong to the Liskova semigroup. Among such polynomials we study rectangular q-Catalan numbers; generalized exponents polynomials; principal specializations of the internal product of Schur functions; generalized q-Gaussian polynomials; parabolic Kostant partition function and its q-analog certain generating functions on the set of transportation matrices. In each case we apply rigged configurations technique to obtain some interesting and new information about Kostka-Foulkes and parabolic Kostka polynomials, Kostant partition function, MacMahon, Gelfand-Tsetlin and Chan-Robbins polytopes. We describe certain connections between generalized saturation and Fulton's conjectures and parabolic Kostka polynomials; domino tableaux and rigged configurations. We study also some properties of l-restricted generalized exponents and the stable behaviour of certain Kostka-Foulkes polynomials.

  4. Polynomial Supertree Methods Revisited

    PubMed Central

    Brinkmeyer, Malte; Griebel, Thasso; Böcker, Sebastian

    2011-01-01

    Supertree methods allow to reconstruct large phylogenetic trees by combining smaller trees with overlapping leaf sets into one, more comprehensive supertree. The most commonly used supertree method, matrix representation with parsimony (MRP), produces accurate supertrees but is rather slow due to the underlying hard optimization problem. In this paper, we present an extensive simulation study comparing the performance of MRP and the polynomial supertree methods MinCut Supertree, Modified MinCut Supertree, Build-with-distances, PhySIC, PhySIC_IST, and super distance matrix. We consider both quality and resolution of the reconstructed supertrees. Our findings illustrate the tradeoff between accuracy and running time in supertree construction, as well as the pros and cons of voting- and veto-based supertree approaches. Based on our results, we make some general suggestions for supertree methods yet to come. PMID:22229028

  5. Entanglement conditions and polynomial identities

    SciTech Connect

    Shchukin, E.

    2011-11-15

    We develop a rather general approach to entanglement characterization based on convexity properties and polynomial identities. This approach is applied to obtain simple and efficient entanglement conditions that work equally well in both discrete as well as continuous-variable environments. Examples of violations of our conditions are presented.

  6. Stabilization of nonlinear systems using sampled-data output-feedback fuzzy controller based on polynomial-fuzzy-model-based control approach.

    PubMed

    Lam, H K

    2012-02-01

    This paper investigates the stability of sampled-data output-feedback (SDOF) polynomial-fuzzy-model-based control systems. Representing the nonlinear plant using a polynomial fuzzy model, an SDOF fuzzy controller is proposed to perform the control process using the system output information. As only the system output is available for feedback compensation, it is more challenging for the controller design and system analysis compared to the full-state-feedback case. Furthermore, because of the sampling activity, the control signal is kept constant by the zero-order hold during the sampling period, which complicates the system dynamics and makes the stability analysis more difficult. In this paper, two cases of SDOF fuzzy controllers, which either share the same number of fuzzy rules or not, are considered. The system stability is investigated based on the Lyapunov stability theory using the sum-of-squares (SOS) approach. SOS-based stability conditions are obtained to guarantee the system stability and synthesize the SDOF fuzzy controller. Simulation examples are given to demonstrate the merits of the proposed SDOF fuzzy control approach.

  7. POLYNOMIAL-BASED DISAGGREGATION OF HOURLY RAINFALL FOR CONTINUOUS HYDROLOGIC SIMULATION

    EPA Science Inventory

    Hydrologic modeling of urban watersheds for designs and analyses of stormwater conveyance facilities can be performed in either an event-based or continuous fashion. Continuous simulation requires, among other things, the use of a time series of rainfall amounts. However, for urb...

  8. POLYNOMIAL-BASED DISAGGREGATION OF HOURLY RAINFALL FOR CONTINUOUS HYDROLOGIC SIMULATION

    EPA Science Inventory

    Hydrologic modeling of urban watersheds for designs and analyses of stormwater conveyance facilities can be performed in either an event-based or continuous fashion. Continuous simulation requires, among other things, the use of a time series of rainfall amounts. However, for urb...

  9. Fault Estimation Observer Design for Discrete-Time Takagi-Sugeno Fuzzy Systems Based on Homogenous Polynomially Parameter-Dependent Lyapunov Functions.

    PubMed

    Xie, Xiangpeng; Yue, Dong; Zhang, Huaguang; Xue, Yusheng

    2017-09-01

    This paper investigates the problem of robust fault estimation (FE) observer design for discrete-time Takagi-Sugeno fuzzy systems via homogenous polynomially parameter-dependent Lyapunov functions. First, a novel framework of the fuzzy FE observer is established with the help of a maximum-minimum-priority-based switching mechanism. Then, for every activated switching case, a targeted result is achieved by the aid of exploring an important property of improved homogenous polynomials. Since the helpful information of the underlying system can be duly updated and effectively utilized at every sampled point, the conservatism of previous results is availably reduced. Furthermore, the proposed result is further improved by eliminating those redundant terms of the introduced matrix-valued variables. Simulation results based on a discrete-time nonlinear truck-trailer model are provided to show the advantages of the theoretic result that is developed in this paper.

  10. Polynomial Graphs and Symmetry

    ERIC Educational Resources Information Center

    Goehle, Geoff; Kobayashi, Mitsuo

    2013-01-01

    Most quadratic functions are not even, but every parabola has symmetry with respect to some vertical line. Similarly, every cubic has rotational symmetry with respect to some point, though most cubics are not odd. We show that every polynomial has at most one point of symmetry and give conditions under which the polynomial has rotational or…

  11. Polynomial Graphs and Symmetry

    ERIC Educational Resources Information Center

    Goehle, Geoff; Kobayashi, Mitsuo

    2013-01-01

    Most quadratic functions are not even, but every parabola has symmetry with respect to some vertical line. Similarly, every cubic has rotational symmetry with respect to some point, though most cubics are not odd. We show that every polynomial has at most one point of symmetry and give conditions under which the polynomial has rotational or…

  12. Polynomial Eigenvalue Solutions to Minimal Problems in Computer Vision.

    PubMed

    Kukelova, Zuzana; Bujnak, Martin; Pajdla, Tomas

    2012-07-01

    We present a method for solving systems of polynomial equations appearing in computer vision. This method is based on polynomial eigenvalue solvers and is more straightforward and easier to implement than the state-of-the-art Gröbner basis method since eigenvalue problems are well studied, easy to understand, and efficient and robust algorithms for solving these problems are available. We provide a characterization of problems that can be efficiently solved as polynomial eigenvalue problems (PEPs) and present a resultant-based method for transforming a system of polynomial equations to a polynomial eigenvalue problem. We propose techniques that can be used to reduce the size of the computed polynomial eigenvalue problems. To show the applicability of the proposed polynomial eigenvalue method, we present the polynomial eigenvalue solutions to several important minimal relative pose problems.

  13. An Analytic Formula for the A_2 Jack Polynomials

    NASA Astrophysics Data System (ADS)

    Mangazeev, Vladimir V.

    2007-01-01

    In this letter I shall review my joint results with Vadim Kuznetsov and Evgeny Sklyanin [Indag. Math. 14 (2003), 451-482] on separation of variables (SoV) for the An Jack polynomials. This approach originated from the work [RIMS Kokyuroku 919 (1995), 27-34] where the integral representations for the A2 Jack polynomials was derived. Using special polynomial bases I shall obtain a more explicit expression for the A2 Jack polynomials in terms of generalised hypergeometric functions.

  14. simEye: Computer-based simulation of visual perception under various eye defects using Zernike polynomials.

    PubMed

    Fink, Wolfgang; Micol, Daniel

    2006-01-01

    We describe a computer eye model that allows for aspheric surfaces and a three-dimensional computer-based ray-tracing technique to simulate optical properties of the human eye and visual perception under various eye defects. Eye surfaces, such as the cornea, eye lens, and retina, are modeled or approximated by a set of Zernike polynomials that are fitted to input data for the respective surfaces. A ray-tracing procedure propagates light rays using Snell's law of refraction from an input object (e.g., digital image) through the eye under investigation (i.e., eye with defects to be modeled) to form a retinal image that is upside down and left-right inverted. To obtain a first-order realistic visual perception without having to model or simulate the retina and the visual cortex, this retinal image is then back-propagated through an emmetropic eye (e.g., Gullstrand exact schematic eye model with no additional eye defects) to an output screen of the same dimensions and at the same distance from the eye as the input object. Visual perception under instances of emmetropia, regular astigmatism, irregular astigmatism, and (central symmetric) keratoconus is simulated and depicted. In addition to still images, the computer ray-tracing tool presented here (simEye) permits the production of animated movies. These developments may have scientific and educational value. This tool may facilitate the education and training of both the public, for example, patients before undergoing eye surgery, and those in the medical field, such as students and professionals. Moreover, simEye may be used as a scientific research tool to investigate optical lens systems in general and the visual perception under a variety of eye conditions and surgical procedures such as cataract surgery and laser assisted in situ keratomileusis (LASIK) in particular.

  15. On the absolute accuracy of Zernike polynomials to characterize the corneal surface and the optical aberrations of the human eye

    NASA Astrophysics Data System (ADS)

    Carvalho, Luis A.

    2005-06-01

    Zernike Polynomials have been successfully used for many years in optics. Nevertheless there are some recent discussions regarding their accuracy when applied to surfaces such as the human cornea. A set of synthetic surfaces resembling several common corneal anomalies was sampled and was also used to compute the optical path difference using a simple ray-tracing procedure. The Root Mean Square Error between the Zernike Polynomials fit and the theoretical elevation and WF error surface was computed for both surfaces and for all number of Zernike terms. We have found that RMSE for the simplest, most symmetric corneal surface (spherical shape) and for the most complex shape (post-radial keratotomy) both the optical path difference and surface elevation, for 1 through 36 Zernike terms, range from: 421.4 to 0.8 microns, and 421.4 to 8.2 microns, respectively; mean RMSE for maximum Zernike terms for both surfaces were 4.5 microns. Computations in this work suggest that, for surfaces such as post-RK, keratoconus or post-keratoplasty, even more than 36 terms may be necessary in order to obtain minimum precision requirements. We suggest that the number of Zernike Polynomial should not be a global fixed conventional value but rather based on specific surface properties.

  16. Flat bases of invariant polynomials and P-matrices of E{sub 7} and E{sub 8}

    SciTech Connect

    Talamini, Vittorino

    2010-02-15

    Let G be a compact group of linear transformations of a Euclidean space V. The G-invariant C{sup {infinity}} functions can be expressed as C{sup {infinity}} functions of a finite basic set of G-invariant homogeneous polynomials, sometimes called an integrity basis. The mathematical description of the orbit space V/G depends on the integrity basis too: it is realized through polynomial equations and inequalities expressing rank and positive semidefiniteness conditions of the P-matrix, a real symmetric matrix determined by the integrity basis. The choice of the basic set of G-invariant homogeneous polynomials forming an integrity basis is not unique, so it is not unique the mathematical description of the orbit space too. If G is an irreducible finite reflection group, Saito et al. [Commun. Algebra 8, 373 (1980)] characterized some special basic sets of G-invariant homogeneous polynomials that they called flat. They also found explicitly the flat basic sets of invariant homogeneous polynomials of all the irreducible finite reflection groups except of the two largest groups E{sub 7} and E{sub 8}. In this paper the flat basic sets of invariant homogeneous polynomials of E{sub 7} and E{sub 8} and the corresponding P-matrices are determined explicitly. Using the results here reported one is able to determine easily the P-matrices corresponding to any other integrity basis of E{sub 7} or E{sub 8}. From the P-matrices one may then write down the equations and inequalities defining the orbit spaces of E{sub 7} and E{sub 8} relatively to a flat basis or to any other integrity basis. The results here obtained may be employed concretely to study analytically the symmetry breaking in all theories where the symmetry group is one of the finite reflection groups E{sub 7} and E{sub 8} or one of the Lie groups E{sub 7} and E{sub 8} in their adjoint representations.

  17. Analytical and numerical construction of vertical periodic orbits about triangular libration points based on polynomial expansion relations among directions

    NASA Astrophysics Data System (ADS)

    Qian, Ying-Jing; Yang, Xiao-Dong; Zhai, Guan-Qiao; Zhang, Wei

    2017-08-01

    Innovated by the nonlinear modes concept in the vibrational dynamics, the vertical periodic orbits around the triangular libration points are revisited for the Circular Restricted Three-body Problem. The ζ -component motion is treated as the dominant motion and the ξ and η -component motions are treated as the slave motions. The slave motions are in nature related to the dominant motion through the approximate nonlinear polynomial expansions with respect to the ζ -position and ζ -velocity during the one of the periodic orbital motions. By employing the relations among the three directions, the three-dimensional system can be transferred into one-dimensional problem. Then the approximate three-dimensional vertical periodic solution can be analytically obtained by solving the dominant motion only on ζ -direction. To demonstrate the effectiveness of the proposed method, an accuracy study was carried out to validate the polynomial expansion (PE) method. As one of the applications, the invariant nonlinear relations in polynomial expansion form are used as constraints to obtain numerical solutions by differential correction. The nonlinear relations among the directions provide an alternative point of view to explore the overall dynamics of periodic orbits around libration points with general rules.

  18. Automatic bone outer contour extraction from B-modes ultrasound images based on local phase symmetry and quadratic polynomial fitting

    NASA Astrophysics Data System (ADS)

    Karlita, Tita; Yuniarno, Eko Mulyanto; Purnama, I. Ketut Eddy; Purnomo, Mauridhi Hery

    2017-06-01

    Analyzing ultrasound (US) images to get the shapes and structures of particular anatomical regions is an interesting field of study since US imaging is a non-invasive method to capture internal structures of a human body. However, bone segmentation of US images is still challenging because it is strongly influenced by speckle noises and it has poor image quality. This paper proposes a combination of local phase symmetry and quadratic polynomial fitting methods to extract bone outer contour (BOC) from two dimensional (2D) B-modes US image as initial steps of three-dimensional (3D) bone surface reconstruction. By using local phase symmetry, the bone is initially extracted from US images. BOC is then extracted by scanning one pixel on the bone boundary in each column of the US images using first phase features searching method. Quadratic polynomial fitting is utilized to refine and estimate the pixel location that fails to be detected during the extraction process. Hole filling method is then applied by utilize the polynomial coefficients to fill the gaps with new pixel. The proposed method is able to estimate the new pixel position and ensures smoothness and continuity of the contour path. Evaluations are done using cow and goat bones by comparing the resulted BOCs with the contours produced by manual segmentation and contours produced by canny edge detection. The evaluation shows that our proposed methods produces an excellent result with average MSE before and after hole filling at the value of 0.65.

  19. ECG data compression using Jacobi polynomials.

    PubMed

    Tchiotsop, Daniel; Wolf, Didier; Louis-Dorr, Valérie; Husson, René

    2007-01-01

    Data compression is a frequent signal processing operation applied to ECG. We present here a method of ECG data compression utilizing Jacobi polynomials. ECG signals are first divided into blocks that match with cardiac cycles before being decomposed in Jacobi polynomials bases. Gauss quadratures mechanism for numerical integration is used to compute Jacobi transforms coefficients. Coefficients of small values are discarded in the reconstruction stage. For experimental purposes, we chose height families of Jacobi polynomials. Various segmentation approaches were considered. We elaborated an efficient strategy to cancel boundary effects. We obtained interesting results compared with ECG compression by wavelet decomposition methods. Some propositions are suggested to improve the results.

  20. Modelling Trends in Ordered Correspondence Analysis Using Orthogonal Polynomials.

    PubMed

    Lombardo, Rosaria; Beh, Eric J; Kroonenberg, Pieter M

    2016-06-01

    The core of the paper consists of the treatment of two special decompositions for correspondence analysis of two-way ordered contingency tables: the bivariate moment decomposition and the hybrid decomposition, both using orthogonal polynomials rather than the commonly used singular vectors. To this end, we will detail and explain the basic characteristics of a particular set of orthogonal polynomials, called Emerson polynomials. It is shown that such polynomials, when used as bases for the row and/or column spaces, can enhance the interpretations via linear, quadratic and higher-order moments of the ordered categories. To aid such interpretations, we propose a new type of graphical display-the polynomial biplot.

  1. Uniform Asymptotics of Orthogonal Polynomials Arising from Coherent States

    NASA Astrophysics Data System (ADS)

    Dai, Dan; Hu, Weiying; Wang, Xiang-Sheng

    2015-08-01

    In this paper, we study a family of orthogonal polynomials {φ_n(z)} arising from nonlinear coherent states in quantum optics. Based on the three-term recurrence relation only, we obtain a uniform asymptotic expansion of φ_n(z) as the polynomial degree n tends to infinity. Our asymptotic results suggest that the weight function associated with the polynomials has an unusual singularity, which has never appeared for orthogonal polynomials in the Askey scheme. Our main technique is the Wang and Wong's difference equation method. In addition, the limiting zero distribution of the polynomials φ_n(z) is provided.

  2. Distortion theorems for polynomials on a circle

    SciTech Connect

    Dubinin, V N

    2000-12-31

    Inequalities for the derivatives with respect to {phi}=arg z the functions ReP(z), |P(z)|{sup 2} and arg P(z) are established for an algebraic polynomial P(z) at points on the circle |z|=1. These estimates depend, in particular, on the constant term and the leading coefficient of the polynomial P(z) and improve the classical Bernstein and Turan inequalities. The method of proof is based on the techniques of generalized reduced moduli.

  3. Genome-wide identification and characterization of SnRK2 gene family in cotton (Gossypium hirsutum L.).

    PubMed

    Liu, Zhao; Ge, Xiaoyang; Yang, Zuoren; Zhang, Chaojun; Zhao, Ge; Chen, Eryong; Liu, Ji; Zhang, Xueyan; Li, Fuguang

    2017-06-12

    Sucrose non-fermenting-1-related protein kinase 2 (SnRK2) is a plant-specific serine/threonine kinase family involved in the abscisic acid (ABA) signaling pathway and responds to osmotic stress. A genome-wide analysis of this protein family has been conducted previously in some plant species, but little is known about SnRK2 genes in upland cotton (Gossypium hirsutum L.). The recent release of the G. hirsutum genome sequence provides an opportunity to identify and characterize the SnRK2 kinase family in upland cotton. We identified 20 putative SnRK2 sequences in the G. hirsutum genome, designated as GhSnRK2.1 to GhSnRK2.20. All of the sequences encoded hydrophilic proteins. Phylogenetic analysis showed that the GhSnRK2 genes were classifiable into three groups. The chromosomal location and phylogenetic analysis of the cotton SnRK2 genes indicated that segmental duplication likely contributed to the diversification and evolution of the genes. The gene structure and motif composition of the cotton SnRK2 genes were analyzed. Nine exons were conserved in length among all members of the GhSnRK2 family. Although the C-terminus was divergent, seven conserved motifs were present. All GhSnRK2s genes showed expression patterns under abiotic stress based on transcriptome data. The expression profiles of five selected genes were verified in various tissues by quantitative real-time RT-PCR (qRT-PCR). Transcript levels of some family members were up-regulated in response to drought, salinity or ABA treatments, consistent with potential roles in response to abiotic stress. This study is the first comprehensive analysis of SnRK2 genes in upland cotton. Our results provide the fundamental information for the functional dissection of GhSnRK2s and vital availability for the improvement of plant stress tolerance using GhSnRK2s.

  4. Application of the Polynomial-Based Least Squares and Total Least Squares Models for the Attenuated Total Reflection Fourier Transform Infrared Spectra of Binary Mixtures of Hydroxyl Compounds.

    PubMed

    Shan, Peng; Peng, Silong; Zhao, Yuhui; Tang, Liang

    2016-03-01

    An analysis of binary mixtures of hydroxyl compound by Attenuated Total Reflection Fourier transform infrared spectroscopy (ATR FT-IR) and classical least squares (CLS) yield large model error due to the presence of unmodeled components such as H-bonded components. To accommodate these spectral variations, polynomial-based least squares (LSP) and polynomial-based total least squares (TLSP) are proposed to capture the nonlinear absorbance-concentration relationship. LSP is based on assuming that only absorbance noise exists; while TLSP takes both absorbance noise and concentration noise into consideration. In addition, based on different solving strategy, two optimization algorithms (limited-memory Broyden-Fletcher-Goldfarb-Shanno (LBFGS) algorithm and Levenberg-Marquardt (LM) algorithm) are combined with TLSP and then two different TLSP versions (termed as TLSP-LBFGS and TLSP-LM) are formed. The optimum order of each nonlinear model is determined by cross-validation. Comparison and analyses of the four models are made from two aspects: absorbance prediction and concentration prediction. The results for water-ethanol solution and ethanol-ethyl lactate solution show that LSP, TLSP-LBFGS, and TLSP-LM can, for both absorbance prediction and concentration prediction, obtain smaller root mean square error of prediction than CLS. Additionally, they can also greatly enhance the accuracy of estimated pure component spectra. However, from the view of concentration prediction, the Wilcoxon signed rank test shows that there is no statistically significant difference between each nonlinear model and CLS.

  5. Hybrid Fuzzy Wavelet Neural Networks Architecture Based on Polynomial Neural Networks and Fuzzy Set/Relation Inference-Based Wavelet Neurons.

    PubMed

    Huang, Wei; Oh, Sung-Kwun; Pedrycz, Witold

    2017-08-11

    This paper presents a hybrid fuzzy wavelet neural network (HFWNN) realized with the aid of polynomial neural networks (PNNs) and fuzzy inference-based wavelet neurons (FIWNs). Two types of FIWNs including fuzzy set inference-based wavelet neurons (FSIWNs) and fuzzy relation inference-based wavelet neurons (FRIWNs) are proposed. In particular, a FIWN without any fuzzy set component (viz., a premise part of fuzzy rule) becomes a wavelet neuron (WN). To alleviate the limitations of the conventional wavelet neural networks or fuzzy wavelet neural networks whose parameters are determined based on a purely random basis, the parameters of wavelet functions standing in FIWNs or WNs are initialized by using the C-Means clustering method. The overall architecture of the HFWNN is similar to the one of the typical PNNs. The main strategies in the design of HFWNN are developed as follows. First, the first layer of the network consists of FIWNs (e.g., FSIWN or FRIWN) that are used to reflect the uncertainty of data, while the second and higher layers consist of WNs, which exhibit a high level of flexibility and realize a linear combination of wavelet functions. Second, the parameters used in the design of the HFWNN are adjusted through genetic optimization. To evaluate the performance of the proposed HFWNN, several publicly available data are considered. Furthermore a thorough comparative analysis is covered.

  6. Efficient isolation of polynomial's real roots

    NASA Astrophysics Data System (ADS)

    Rouillier, Fabrice; Zimmermann, Paul

    2004-01-01

    This paper revisits an algorithm isolating the real roots of a univariate polynomial using Descartes' rule of signs. It follows work of Vincent, Uspensky, Collins and Akritas, Johnson, Krandick. Our first contribution is a generic algorithm which enables one to describe all the known algorithms based on Descartes' rule of sign and the bisection strategy in a unified framework. Using that framework, a new algorithm is presented, which is optimal in terms of memory usage and as fast as both Collins and Akritas' algorithm and Krandick's variant, independently of the input polynomial. From this new algorithm, we derive an adaptive semi-numerical version, using multi-precision interval arithmetic. We finally show that these critical optimizations have important consequences since our new algorithm still works with huge polynomials, including orthogonal polynomials of degree 1000 and more, which were out of reach of previous methods.

  7. Tutte Polynomial of Scale-Free Networks

    NASA Astrophysics Data System (ADS)

    Chen, Hanlin; Deng, Hanyuan

    2016-05-01

    The Tutte polynomial of a graph, or equivalently the q-state Potts model partition function, is a two-variable polynomial graph invariant of considerable importance in both statistical physics and combinatorics. The computation of this invariant for a graph is NP-hard in general. In this paper, we focus on two iteratively growing scale-free networks, which are ubiquitous in real-life systems. Based on their self-similar structures, we mainly obtain recursive formulas for the Tutte polynomials of two scale-free networks (lattices), one is fractal and "large world", while the other is non-fractal but possess the small-world property. Furthermore, we give some exact analytical expressions of the Tutte polynomial for several special points at ( x, y)-plane, such as, the number of spanning trees, the number of acyclic orientations, etc.

  8. Bases in coset conformal field theory from AGT correspondence and Macdonald polynomials at the roots of unity

    NASA Astrophysics Data System (ADS)

    Belavin, A. A.; Bershtein, M. A.; Tarnopolsky, G. M.

    2013-03-01

    We continue our study of the AGT correspondence between instanton counting on {{{{{{C}}^2}}} / {{{{{Z}}_p}}} .} and Conformal field theories with the symmetry algebra {A}( {r,p} ) . In the cases r = 1, p = 2 and r = 2, p = 2 this algebra specialized to: {A}( {1,2} )={H}oplus widehat{{sl}}{(2)_1} and {A}( {2,2} )={H}oplus widehat{{sl}}{(2)_2}oplus NSR . As the main tool we use a new construction of the algebra A( r, 2) as the limit of the toroidal {g}{l}(1) algebra for q, t tend to -1. We claim that the basis of the representation of the algebra {A}( {r,2} ) (or equivalently, of the space of the local fields of the corresponding CFT) can be expressed through Macdonald polynomials with the parameters q, t go to -1. The vertex operator which naturally arises in this construction has factorized matrix elements in this basis. We also argue that the singular vectors of the {N}=1 Super Virasoro algebra can be realized in terms of Macdonald polynomials for a rectangular Young diagram and parameters q, t tend to -1.

  9. On polynomial preconditioning for indefinite Hermitian matrices

    NASA Technical Reports Server (NTRS)

    Freund, Roland W.

    1989-01-01

    The minimal residual method is studied combined with polynomial preconditioning for solving large linear systems (Ax = b) with indefinite Hermitian coefficient matrices (A). The standard approach for choosing the polynomial preconditioners leads to preconditioned systems which are positive definite. Here, a different strategy is studied which leaves the preconditioned coefficient matrix indefinite. More precisely, the polynomial preconditioner is designed to cluster the positive, resp. negative eigenvalues of A around 1, resp. around some negative constant. In particular, it is shown that such indefinite polynomial preconditioners can be obtained as the optimal solutions of a certain two parameter family of Chebyshev approximation problems. Some basic results are established for these approximation problems and a Remez type algorithm is sketched for their numerical solution. The problem of selecting the parameters such that the resulting indefinite polynomial preconditioners speeds up the convergence of minimal residual method optimally is also addressed. An approach is proposed based on the concept of asymptotic convergence factors. Finally, some numerical examples of indefinite polynomial preconditioners are given.

  10. Improved One-Way Hash Chain and Revocation Polynomial-Based Self-Healing Group Key Distribution Schemes in Resource-Constrained Wireless Networks

    PubMed Central

    Chen, Huifang; Xie, Lei

    2014-01-01

    Self-healing group key distribution (SGKD) aims to deal with the key distribution problem over an unreliable wireless network. In this paper, we investigate the SGKD issue in resource-constrained wireless networks. We propose two improved SGKD schemes using the one-way hash chain (OHC) and the revocation polynomial (RP), the OHC&RP-SGKD schemes. In the proposed OHC&RP-SGKD schemes, by introducing the unique session identifier and binding the joining time with the capability of recovering previous session keys, the problem of the collusion attack between revoked users and new joined users in existing hash chain-based SGKD schemes is resolved. Moreover, novel methods for utilizing the one-way hash chain and constructing the personal secret, the revocation polynomial and the key updating broadcast packet are presented. Hence, the proposed OHC&RP-SGKD schemes eliminate the limitation of the maximum allowed number of revoked users on the maximum allowed number of sessions, increase the maximum allowed number of revoked/colluding users, and reduce the redundancy in the key updating broadcast packet. Performance analysis and simulation results show that the proposed OHC&RP-SGKD schemes are practical for resource-constrained wireless networks in bad environments, where a strong collusion attack resistance is required and many users could be revoked. PMID:25529204

  11. An inline surface measurement method for membrane mirror fabrication using two-stage trained Zernike polynomials and elitist teaching-learning-based optimization

    NASA Astrophysics Data System (ADS)

    Liu, Yang; Chen, Zhenyu; Yang, Zhile; Li, Kang; Tan, Jiubin

    2016-12-01

    The accuracy of surface measurement determines the manufacturing quality of membrane mirrors. Thus, an efficient and accurate measuring method is critical in membrane mirror fabrication. This paper formulates this measurement issue as a surface reconstruction problem and employs two-stage trained Zernike polynomials as an inline measuring tool to solve the optical surface measurement problem in the membrane mirror manufacturing process. First, all terms of the Zernike polynomial are generated and projected to a non-circular region as the candidate model pool. The training data are calculated according to the measured values of distance sensors and the geometrical relationship between the ideal surface and the installed sensors. Then the terms are selected by minimizing the cost function each time successively. To avoid the problem of ill-conditioned matrix inversion by the least squares method, the coefficient of each model term is achieved by modified elitist teaching-learning-based optimization. Subsequently, the measurement precision is further improved by a second stage of model refinement. Finally, every point on the membrane surface can be measured according to this model, providing more the subtle feedback information needed for the precise control of membrane mirror fabrication. Experimental results confirm that the proposed method is effective in a membrane mirror manufacturing system driven by negative pressure, and the measurement accuracy can achieve 15 µm.

  12. Improved one-way hash chain and revocation polynomial-based self-healing group key distribution schemes in resource-constrained wireless networks.

    PubMed

    Chen, Huifang; Xie, Lei

    2014-12-18

    Self-healing group key distribution (SGKD) aims to deal with the key distribution problem over an unreliable wireless network. In this paper, we investigate the SGKD issue in resource-constrained wireless networks. We propose two improved SGKD schemes using the one-way hash chain (OHC) and the revocation polynomial (RP), the OHC&RP-SGKD schemes. In the proposed OHC&RP-SGKD schemes, by introducing the unique session identifier and binding the joining time with the capability of recovering previous session keys, the problem of the collusion attack between revoked users and new joined users in existing hash chain-based SGKD schemes is resolved. Moreover, novel methods for utilizing the one-way hash chain and constructing the personal secret, the revocation polynomial and the key updating broadcast packet are presented. Hence, the proposed OHC&RP-SGKD schemes eliminate the limitation of the maximum allowed number of revoked users on the maximum allowed number of sessions, increase the maximum allowed number of revoked/colluding users, and reduce the redundancy in the key updating broadcast packet. Performance analysis and simulation results show that the proposed OHC&RP-SGKD schemes are practical for resource-constrained wireless networks in bad environments, where a strong collusion attack resistance is required and many users could be revoked.

  13. Interpolation and Polynomial Curve Fitting

    ERIC Educational Resources Information Center

    Yang, Yajun; Gordon, Sheldon P.

    2014-01-01

    Two points determine a line. Three noncollinear points determine a quadratic function. Four points that do not lie on a lower-degree polynomial curve determine a cubic function. In general, n + 1 points uniquely determine a polynomial of degree n, presuming that they do not fall onto a polynomial of lower degree. The process of finding such a…

  14. Interpolation and Polynomial Curve Fitting

    ERIC Educational Resources Information Center

    Yang, Yajun; Gordon, Sheldon P.

    2014-01-01

    Two points determine a line. Three noncollinear points determine a quadratic function. Four points that do not lie on a lower-degree polynomial curve determine a cubic function. In general, n + 1 points uniquely determine a polynomial of degree n, presuming that they do not fall onto a polynomial of lower degree. The process of finding such a…

  15. Computing the roots of complex orthogonal and kernel polynomials

    SciTech Connect

    Saylor, P.E.; Smolarski, D.C.

    1988-01-01

    A method is presented to compute the roots of complex orthogonal and kernel polynomials. An important application of complex kernel polynomials is the acceleration of iterative methods for the solution of nonsymmetric linear equations. In the real case, the roots of orthogonal polynomials coincide with the eigenvalues of the Jacobi matrix, a symmetric tridiagonal matrix obtained from the defining three-term recurrence relationship for the orthogonal polynomials. In the real case kernel polynomials are orthogonal. The Stieltjes procedure is an algorithm to compute the roots of orthogonal and kernel polynomials bases on these facts. In the complex case, the Jacobi matrix generalizes to a Hessenberg matrix, the eigenvalues of which are roots of either orthogonal or kernel polynomials. The resulting algorithm generalizes the Stieljes procedure. It may not be defined in the case of kernel polynomials, a consequence of the fact that they are orthogonal with respect to a nonpositive bilinear form. (Another consequence is that kernel polynomials need not be of exact degree.) A second algorithm that is always defined is presented for kernel polynomials. Numerical examples are described.

  16. Rotating restricted Schur polynomials

    NASA Astrophysics Data System (ADS)

    Bornman, Nicholas; de Mello Koch, Robert; Tribelhorn, Laila

    2017-09-01

    Large N but nonplanar limits of 𝒩 = 4 super-Yang-Mills theory can be described using restricted Schur polynomials. Previous investigations demonstrate that the action of the one loop dilatation operator on restricted Schur operators, with classical dimension of order N and belonging to the su(2) sector, is largely determined by the su(2) ℛ symmetry algebra as well as structural features of perturbative field theory. Studies presented so far have used the form of ℛ symmetry generators when acting on small perturbations of half-BPS operators. In this paper as a first step towards going beyond small perturbations of the half-BPS operators, we explain how the exact action of symmetry generators on restricted Schur polynomials can be determined.

  17. The plant RWP-RK transcription factors: key regulators of nitrogen responses and of gametophyte development.

    PubMed

    Chardin, Camille; Girin, Thomas; Roudier, François; Meyer, Christian; Krapp, Anne

    2014-10-01

    The plant specific RWP-RK family of transcription factors, initially identified in legumes and Chlamydomonas, are found in all vascular plants, green algae, and slime molds. These proteins possess a characteristic RWP-RK motif, which mediates DNA binding. Based on phylogenetic and domain analyses, we classified the RWP-RK proteins of six different species in two subfamilies: the NIN-like proteins (NLPs), which carry an additional PB1 domain at their C-terminus, and the RWP-RK domain proteins (RKDs), which are divided into three subgroups. Although, the functional analysis of this family is still in its infancy, several RWP-RK proteins have a key role in regulating responses to nitrogen availability. The nodulation-specific NIN proteins are involved in nodule organogenesis and rhizobial infection under nitrogen starvation conditions. Arabidopsis NLP7 in particular is a major player in the primary nitrate response. Several RKDs act as transcription factors involved in egg cell specification and differentiation or gametogenesis in algae, the latter modulated by nitrogen availability. Further studies are required to extend the general picture of the functional role of these exciting transcription factors.

  18. Independence polynomial and matching polynomial of the Koch network

    NASA Astrophysics Data System (ADS)

    Liao, Yunhua; Xie, Xiaoliang

    2015-11-01

    The lattice gas model and the monomer-dimer model are two classical models in statistical mechanics. It is well known that the partition functions of these two models are associated with the independence polynomial and the matching polynomial in graph theory, respectively. Both polynomials have been shown to belong to the “#P-complete” class, which indicate the problems are computationally “intractable”. We consider these two polynomials of the Koch networks which are scale-free with small-world effects. Explicit recurrences are derived, and explicit formulae are presented for the number of independent sets of a certain type.

  19. The Arabidopsis lectin receptor kinase LecRK-I.9 enhances resistance to Phytophthora infestans in Solanaceous plants.

    PubMed

    Bouwmeester, Klaas; Han, Miao; Blanco-Portales, Rosario; Song, Wei; Weide, Rob; Guo, Li-Yun; van der Vossen, Edwin A G; Govers, Francine

    2014-01-01

    Late blight caused by the plant pathogenic oomycete Phytophthora infestans is known as one of the most destructive potato diseases. Plant breeders tend to employ NB-LRR-based resistance for introducing genetically controlled late blight resistance in their breeding lines. However, P. infestans is able to rapidly escape this type of resistance, and hence, NB-LRR-based resistance in potato cultivars is often not durable. Previously, we identified a novel type of Phytophthora resistance in Arabidopsis. This resistance is mediated by the cell surface receptor LecRK-I.9, which belongs to the family of L-type lectin receptor kinases. In this study, we report that expression of the Arabidopsis LecRK-I.9 gene in potato and Nicotiana benthamiana results in significantly enhanced late blight resistance. Transcriptional profiling showed strong reduction in salicylic acid (SA)-mediated defence gene expression in LecRK-I.9 transgenic potato lines (TPLs). In contrast, transcripts of two protease inhibitor genes accumulated to extreme high levels, suggesting that LecRK-I.9-mediated late blight resistance is relying on a defence response that includes activation of protease inhibitors. These results demonstrate that the functionality of LecRK-I.9 in Phytophthora resistance is maintained after interfamily transfer to potato and N. benthamiana and suggest that this novel type of LecRK-based resistance can be exploited in breeding strategies to improve durable late blight resistance in Solanaceous crops.

  20. Smooth polynomial approximation of spiral arcs

    NASA Astrophysics Data System (ADS)

    Cripps, R. J.; Hussain, M. Z.; Zhu, S.

    2010-03-01

    Constructing fair curve segments using parametric polynomials is difficult due to the oscillatory nature of polynomials. Even NURBS curves can exhibit unsatisfactory curvature profiles. Curve segments with monotonic curvature profiles, for example spiral arcs, exist but are intrinsically non-polynomial in nature and thus difficult to integrate into existing CAD systems. A method of constructing an approximation to a generalised Cornu spiral (GCS) arc using non-rational quintic Bézier curves matching end points, end slopes and end curvatures is presented. By defining an objective function based on the relative error between the curvature profiles of the GCS and its Bézier approximation, a curve segment is constructed that has a monotonic curvature profile within a specified tolerance.

  1. Factoring Polynomials Modulo Composites,

    DTIC Science & Technology

    2007-11-02

    xA. This is an appropriate time to introduce the Sylvester Matrix . Definition 3.9 Given polynomials f,g as above, the Sylvester matrix off and g is...the coefficient matrix of the above system of equations. We denote this Sylvester matrix as S(f, g) by the following (1 + m) x (1 + m) matrix a, bm a11...bin-i bm S(f,g) = ao at : b- C R(l+m)x(l+m) aq-1 bo ao b0 the empty spaces are filled by zeros. The Sylvester matrix is the coefficient matrix of

  2. Decidability of classes of algebraic systems in polynomial time

    SciTech Connect

    Anokhin, M I

    2002-02-28

    For some classes of algebraic systems several kinds of polynomial-time decidability are considered, which use an oracle performing signature operations and computing predicates. Relationships between various kinds of decidability are studied. Several results on decidability and undecidability in polynomial time are proved for some finitely based varieties of universal algebras.

  3. Reproduction of Meloidogyne incognita Race 3 on Flue-cured Tobacco Homozygous for Rk1 and/or Rk2 Resistance Genes

    PubMed Central

    Pollok, Jill R.; Johnson, Charles S.; Eisenback, J. D.; Reed, T. David

    2016-01-01

    Most commercial tobacco cultivars possess the Rk1 resistance gene to races 1 and 3 of Meloidogyne incognita and race 1 of Meloidogyne arenaria, which has caused a shift in population prevalence in Virginia tobacco fields toward other species and races. A number of cultivars now also possess the Rk2 gene for root-knot resistance. Experiments were conducted in 2013 to 2014 to examine whether possessing both Rk1 and Rk2 increases resistance to a variant of M. incognita race 3 compared to either gene alone. Greenhouse trials were arranged in a completely randomized design with Coker 371-Gold (C371G; susceptible), NC 95 and SC 72 (Rk1Rk1), T-15-1-1 (Rk2Rk2), and STNCB-2-28 and NOD 8 (Rk1Rk1 and Rk2Rk2). Each plant was inoculated with 5,000 root-knot nematode eggs; data were collected 60 d postinoculation. Percent galling and numbers of egg masses and eggs were counted, the latter being used to calculate the reproductive index on each host. Despite variability, entries with both Rk1 and Rk2 conferred greater resistance to a variant of M. incognita race 3 than plants with Rk1 or Rk2 alone. Entries with Rk1 alone were successful in reducing root galling and nematode reproduction compared to the susceptible control. Entry T-15-1-1 did not reduce galling compared to the susceptible control but often suppressed reproduction. PMID:27418700

  4. Superoscillations with arbitrary polynomial shape

    NASA Astrophysics Data System (ADS)

    Chremmos, Ioannis; Fikioris, George

    2015-07-01

    We present a method for constructing superoscillatory functions the superoscillatory part of which approximates a given polynomial with arbitrarily small error in a fixed interval. These functions are obtained as the product of the polynomial with a sufficiently flat, bandlimited envelope function whose Fourier transform has at least N-1 continuous derivatives and an Nth derivative of bounded variation, N being the order of the polynomial. Polynomials of arbitrarily high order can be approximated if the Fourier transform of the envelope is smooth, i.e. a bump function.

  5. Polynomial Bell Inequalities.

    PubMed

    Chaves, Rafael

    2016-01-08

    It is a recent realization that many of the concepts and tools of causal discovery in machine learning are highly relevant to problems in quantum information, in particular quantum nonlocality. The crucial ingredient in the connection between both fields is the mathematical theory of causality, allowing for the representation of arbitrary causal structures and providing a rigorous tool to reason about probabilistic causation. Indeed, Bell's theorem concerns a very particular kind of causal structure and Bell inequalities are a special case of linear constraints following from such models. It is thus natural to look for generalizations involving more complex Bell scenarios. The problem, however, relies on the fact that such generalized scenarios are characterized by polynomial Bell inequalities and no current method is available to derive them beyond very simple cases. In this work, we make a significant step in that direction, providing a new, general, and conceptually clear method for the derivation of polynomial Bell inequalities in a wide class of scenarios. We also show how our construction can be used to allow for relaxations of causal constraints and naturally gives rise to a notion of nonsignaling in generalized Bell networks.

  6. Polynomial Bell Inequalities

    NASA Astrophysics Data System (ADS)

    Chaves, Rafael

    2016-01-01

    It is a recent realization that many of the concepts and tools of causal discovery in machine learning are highly relevant to problems in quantum information, in particular quantum nonlocality. The crucial ingredient in the connection between both fields is the mathematical theory of causality, allowing for the representation of arbitrary causal structures and providing a rigorous tool to reason about probabilistic causation. Indeed, Bell's theorem concerns a very particular kind of causal structure and Bell inequalities are a special case of linear constraints following from such models. It is thus natural to look for generalizations involving more complex Bell scenarios. The problem, however, relies on the fact that such generalized scenarios are characterized by polynomial Bell inequalities and no current method is available to derive them beyond very simple cases. In this work, we make a significant step in that direction, providing a new, general, and conceptually clear method for the derivation of polynomial Bell inequalities in a wide class of scenarios. We also show how our construction can be used to allow for relaxations of causal constraints and naturally gives rise to a notion of nonsignaling in generalized Bell networks.

  7. Evaluation of diagnostic performance of rK28 ELISA using urine for diagnosis of visceral leishmaniasis.

    PubMed

    Ghosh, Prakash; Bhaskar, Khondaker R H; Hossain, Faria; Khan, Md Anik Ashfaq; Vallur, Aarthy C; Duthie, Malcolm S; Hamano, Shinjiro; Salam, Md Abdus; Huda, M Mamun; Khan, Md Gulam Musawwir; Coler, Rhea N; Reed, Steven G; Mondal, Dinesh

    2016-07-04

    Recombinant fusion proteins are now commonly used to detect circulating antibodies for the serodiagnosis of visceral leishmaniasis (VL) in Asia, Africa and the Americas. Although simple, these tests still require blood collection and their use in remote settings can be limited due to the need of collection devices, serum fractionation instrument and generation of biohazardous waste. The development of an accurate and non-invasive diagnostic algorithm for VL, such as could be achieved with urine, is desirable. We enrolled 87 VL patients and 81 non-VL individuals, including 33 healthy endemic controls, 16 healthy non-endemic controls, 16 disease controls and 16 tuberculosis (TB) patients. We compared the efficacy of recombinant antigens rK28, rK39 and rKRP42 for the diagnosis of VL when either serum or urine were used to develop antibody-detection ELISA. As expected, each of the antigens readily detected antibodies in the serum of VL patients. rK28 ELISA showed the highest sensitivity (98.9 %), followed by rK39 and rKRP42 ELISA (97.7 and 94.4 %, respectively); overall specificity was > 96 %. When urine was used as the test analyte, only a marginal drop in sensitivity was observed, with rK28 ELISA again demonstrating the greatest sensitivity (95.4 %), followed by rK39 and rKRP42 ELISA, respectively. Again, the overall specificity was > 96 %. Our data indicate the potential for using urine in the diagnosis of VL. Detection of antibodies against rK28 demonstrated the greatest sensitivity. Together, our results indicate that rK28-based antibody detection tests using urine could provide a completely non-invasive tool amenable for diagnosis of VL in remote locations.

  8. Graphical Solution of Polynomial Equations

    ERIC Educational Resources Information Center

    Grishin, Anatole

    2009-01-01

    Graphing utilities, such as the ubiquitous graphing calculator, are often used in finding the approximate real roots of polynomial equations. In this paper the author offers a simple graphing technique that allows one to find all solutions of a polynomial equation (1) of arbitrary degree; (2) with real or complex coefficients; and (3) possessing…

  9. Estrada index and Chebyshev polynomials

    NASA Astrophysics Data System (ADS)

    Ginosar, Yuval; Gutman, Ivan; Mansour, Toufik; Schork, Matthias

    2008-03-01

    Let G be a graph whose eigenvalues are λ1, λ2,…, λn. The Estrada index of G is equal to ∑i=1ne. We point out certain classes of graphs whose characteristic polynomials are closely connected to the Chebyshev polynomials of the second kind. Various relations, in particular approximations, for the Estrada index of these graphs are obtained.

  10. On a Perplexing Polynomial Puzzle

    ERIC Educational Resources Information Center

    Richmond, Bettina

    2010-01-01

    It seems rather surprising that any given polynomial p(x) with nonnegative integer coefficients can be determined by just the two values p(1) and p(a), where a is any integer greater than p(1). This result has become known as the "perplexing polynomial puzzle." Here, we address the natural question of what might be required to determine a…

  11. Controlling General Polynomial Networks

    NASA Astrophysics Data System (ADS)

    Cuneo, N.; Eckmann, J.-P.

    2014-06-01

    We consider networks of massive particles connected by non-linear springs. Some particles interact with heat baths at different temperatures, which are modeled as stochastic driving forces. The structure of the network is arbitrary, but the motion of each particle is 1D. For polynomial interactions, we give sufficient conditions for Hörmander's "bracket condition" to hold, which implies the uniqueness of the steady state (if it exists), as well as the controllability of the associated system in control theory. These conditions are constructive; they are formulated in terms of inequivalence of the forces (modulo translations) and/or conditions on the topology of the connections. We illustrate our results with examples, including "conducting chains" of variable cross-section. This then extends the results for a simple chain obtained in Eckmann et al. in (Commun Math Phys 201:657-697, 1999).

  12. Inverse polynomial reconstruction method in DCT domain

    NASA Astrophysics Data System (ADS)

    Dadkhahi, Hamid; Gotchev, Atanas; Egiazarian, Karen

    2012-12-01

    The discrete cosine transform (DCT) offers superior energy compaction properties for a large class of functions and has been employed as a standard tool in many signal and image processing applications. However, it suffers from spurious behavior in the vicinity of edge discontinuities in piecewise smooth signals. To leverage the sparse representation provided by the DCT, in this article, we derive a framework for the inverse polynomial reconstruction in the DCT expansion. It yields the expansion of a piecewise smooth signal in terms of polynomial coefficients, obtained from the DCT representation of the same signal. Taking advantage of this framework, we show that it is feasible to recover piecewise smooth signals from a relatively small number of DCT coefficients with high accuracy. Furthermore, automatic methods based on minimum description length principle and cross-validation are devised to select the polynomial orders, as a requirement of the inverse polynomial reconstruction method in practical applications. The developed framework can considerably enhance the performance of the DCT in sparse representation of piecewise smooth signals. Numerical results show that denoising and image approximation algorithms based on the proposed framework indicate significant improvements over wavelet counterparts for this class of signals.

  13. The number of polynomial solutions of polynomial Riccati equations

    NASA Astrophysics Data System (ADS)

    Gasull, Armengol; Torregrosa, Joan; Zhang, Xiang

    2016-11-01

    Consider real or complex polynomial Riccati differential equations a (x) y ˙ =b0 (x) +b1 (x) y +b2 (x)y2 with all the involved functions being polynomials of degree at most η. We prove that the maximum number of polynomial solutions is η + 1 (resp. 2) when η ≥ 1 (resp. η = 0) and that these bounds are sharp. For real trigonometric polynomial Riccati differential equations with all the functions being trigonometric polynomials of degree at most η ≥ 1 we prove a similar result. In this case, the maximum number of trigonometric polynomial solutions is 2η (resp. 3) when η ≥ 2 (resp. η = 1) and, again, these bounds are sharp. Although the proof of both results has the same starting point, the classical result that asserts that the cross ratio of four different solutions of a Riccati differential equation is constant, the trigonometric case is much more involved. The main reason is that the ring of trigonometric polynomials is not a unique factorization domain.

  14. Euler’s Theorem for Polynomials

    DTIC Science & Technology

    1990-02-09

    especially wants to find polynomials over the two element field, GF(2), which are irre- ducible of prime degree p such that L = 2p - 1 is a Mersenne ...relatively prime polynomial, and of the exponent of a polynomial, are investigated. Finally, examples are given which show how to apply these ideas to the...relatively prime polynomial m, and the exponent exp(m) of the polynomial m. We end with some applications of these ideas to the factorization of polynomials

  15. Thermodynamic characterization of networks using graph polynomials

    NASA Astrophysics Data System (ADS)

    Ye, Cheng; Comin, César H.; Peron, Thomas K. DM.; Silva, Filipi N.; Rodrigues, Francisco A.; Costa, Luciano da F.; Torsello, Andrea; Hancock, Edwin R.

    2015-09-01

    In this paper, we present a method for characterizing the evolution of time-varying complex networks by adopting a thermodynamic representation of network structure computed from a polynomial (or algebraic) characterization of graph structure. Commencing from a representation of graph structure based on a characteristic polynomial computed from the normalized Laplacian matrix, we show how the polynomial is linked to the Boltzmann partition function of a network. This allows us to compute a number of thermodynamic quantities for the network, including the average energy and entropy. Assuming that the system does not change volume, we can also compute the temperature, defined as the rate of change of entropy with energy. All three thermodynamic variables can be approximated using low-order Taylor series that can be computed using the traces of powers of the Laplacian matrix, avoiding explicit computation of the normalized Laplacian spectrum. These polynomial approximations allow a smoothed representation of the evolution of networks to be constructed in the thermodynamic space spanned by entropy, energy, and temperature. We show how these thermodynamic variables can be computed in terms of simple network characteristics, e.g., the total number of nodes and node degree statistics for nodes connected by edges. We apply the resulting thermodynamic characterization to real-world time-varying networks representing complex systems in the financial and biological domains. The study demonstrates that the method provides an efficient tool for detecting abrupt changes and characterizing different stages in network evolution.

  16. RPM-WEBBSYS: A web-based computer system to apply the rational polynomial method for estimating static formation temperatures of petroleum and geothermal wells

    NASA Astrophysics Data System (ADS)

    Wong-Loya, J. A.; Santoyo, E.; Andaverde, J. A.; Quiroz-Ruiz, A.

    2015-12-01

    A Web-Based Computer System (RPM-WEBBSYS) has been developed for the application of the Rational Polynomial Method (RPM) to estimate static formation temperatures (SFT) of geothermal and petroleum wells. The system is also capable to reproduce the full thermal recovery processes occurred during the well completion. RPM-WEBBSYS has been programmed using advances of the information technology to perform more efficiently computations of SFT. RPM-WEBBSYS may be friendly and rapidly executed by using any computing device (e.g., personal computers and portable computing devices such as tablets or smartphones) with Internet access and a web browser. The computer system was validated using bottomhole temperature (BHT) measurements logged in a synthetic heat transfer experiment, where a good matching between predicted and true SFT was achieved. RPM-WEBBSYS was finally applied to BHT logs collected from well drilling and shut-in operations, where the typical problems of the under- and over-estimation of the SFT (exhibited by most of the existing analytical methods) were effectively corrected.

  17. Assessing an ensemble Kalman filter inference of Manning's n coefficient of an idealized tidal inlet against a polynomial chaos-based MCMC

    NASA Astrophysics Data System (ADS)

    Siripatana, Adil; Mayo, Talea; Sraj, Ihab; Knio, Omar; Dawson, Clint; Le Maitre, Olivier; Hoteit, Ibrahim

    2017-08-01

    Bayesian estimation/inversion is commonly used to quantify and reduce modeling uncertainties in coastal ocean model, especially in the framework of parameter estimation. Based on Bayes rule, the posterior probability distribution function (pdf) of the estimated quantities is obtained conditioned on available data. It can be computed either directly, using a Markov chain Monte Carlo (MCMC) approach, or by sequentially processing the data following a data assimilation approach, which is heavily exploited in large dimensional state estimation problems. The advantage of data assimilation schemes over MCMC-type methods arises from the ability to algorithmically accommodate a large number of uncertain quantities without significant increase in the computational requirements. However, only approximate estimates are generally obtained by this approach due to the restricted Gaussian prior and noise assumptions that are generally imposed in these methods. This contribution aims at evaluating the effectiveness of utilizing an ensemble Kalman-based data assimilation method for parameter estimation of a coastal ocean model against an MCMC polynomial chaos (PC)-based scheme. We focus on quantifying the uncertainties of a coastal ocean ADvanced CIRCulation (ADCIRC) model with respect to the Manning's n coefficients. Based on a realistic framework of observation system simulation experiments (OSSEs), we apply an ensemble Kalman filter and the MCMC method employing a surrogate of ADCIRC constructed by a non-intrusive PC expansion for evaluating the likelihood, and test both approaches under identical scenarios. We study the sensitivity of the estimated posteriors with respect to the parameters of the inference methods, including ensemble size, inflation factor, and PC order. A full analysis of both methods, in the context of coastal ocean model, suggests that an ensemble Kalman filter with appropriate ensemble size and well-tuned inflation provides reliable mean estimates and

  18. Orthogonal polynomials and deformed oscillators

    NASA Astrophysics Data System (ADS)

    Borzov, V. V.; Damaskinsky, E. V.

    2015-10-01

    In the example of the Fibonacci oscillator, we discuss the construction of oscillator-like systems associated with orthogonal polynomials. We also consider the question of the dimensions of the corresponding Lie algebras.

  19. Numerical constructions involving Chebyshev polynomials

    NASA Astrophysics Data System (ADS)

    Lyakhovsky, V. D.

    2017-02-01

    We propose a new algorithm for the character expansion of tensor products of finite-dimensional irreducible representations of simple Lie algebras. The algorithm produces valid results for the algebras B 3, C 3, and D 3. We use the direct correspondence between Weyl anti-invariant functions and multivariate second-kind Chebyshev polynomials. We construct the triangular trigonometric polynomials for the algebra D 3.

  20. Bernstein polynomials for evolutionary algebraic prediction of short time series

    NASA Astrophysics Data System (ADS)

    Lukoseviciute, Kristina; Howard, Daniel; Ragulskis, Minvydas

    2017-07-01

    Short time series prediction technique based on Bernstein polynomials is presented in this paper. Firstly, the straightforward Bernstein polynomial extrapolation scheme is improved by extending the interval of approximation. Secondly, the forecasting scheme is designed in the evolutionary computational setup which is based on the conciliation between the coarseness of the algebraic prediction and the smoothness of the time average prediction. Computational experiments with the test time series suggest that this time series prediction technique could be applicable for various forecasting applications.

  1. Polynomial force approximations and multifrequency atomic force microscopy.

    PubMed

    Platz, Daniel; Forchheimer, Daniel; Tholén, Erik A; Haviland, David B

    2013-01-01

    We present polynomial force reconstruction from experimental intermodulation atomic force microscopy (ImAFM) data. We study the tip-surface force during a slow surface approach and compare the results with amplitude-dependence force spectroscopy (ADFS). Based on polynomial force reconstruction we generate high-resolution surface-property maps of polymer blend samples. The polynomial method is described as a special example of a more general approximative force reconstruction, where the aim is to determine model parameters that best approximate the measured force spectrum. This approximative approach is not limited to spectral data, and we demonstrate how it can be adapted to a force quadrature picture.

  2. Properties of Leach-Flessas-Gorringe polynomials

    NASA Astrophysics Data System (ADS)

    Pursey, D. L.

    1990-09-01

    A generating function is obtained for the polynomials recently introduced by Leach, Flessas, and Gorringe [J. Math. Phys. 30, 406 (1989)], and is then used to relate the Leach-Flessas-Gorringe (or LFG) polynomials to Hermite polynomials. The generating function is also used to express a number of integrals involving the LFG polynomials as finite sums of parabolic cylinder functions.

  3. Constructing general partial differential equations using polynomial and neural networks.

    PubMed

    Zjavka, Ladislav; Pedrycz, Witold

    2016-01-01

    Sum fraction terms can approximate multi-variable functions on the basis of discrete observations, replacing a partial differential equation definition with polynomial elementary data relation descriptions. Artificial neural networks commonly transform the weighted sum of inputs to describe overall similarity relationships of trained and new testing input patterns. Differential polynomial neural networks form a new class of neural networks, which construct and solve an unknown general partial differential equation of a function of interest with selected substitution relative terms using non-linear multi-variable composite polynomials. The layers of the network generate simple and composite relative substitution terms whose convergent series combinations can describe partial dependent derivative changes of the input variables. This regression is based on trained generalized partial derivative data relations, decomposed into a multi-layer polynomial network structure. The sigmoidal function, commonly used as a nonlinear activation of artificial neurons, may transform some polynomial items together with the parameters with the aim to improve the polynomial derivative term series ability to approximate complicated periodic functions, as simple low order polynomials are not able to fully make up for the complete cycles. The similarity analysis facilitates substitutions for differential equations or can form dimensional units from data samples to describe real-world problems.

  4. Quantum Hurwitz numbers and Macdonald polynomials

    NASA Astrophysics Data System (ADS)

    Harnad, J.

    2016-11-01

    Parametric families in the center Z(C[Sn]) of the group algebra of the symmetric group are obtained by identifying the indeterminates in the generating function for Macdonald polynomials as commuting Jucys-Murphy elements. Their eigenvalues provide coefficients in the double Schur function expansion of 2D Toda τ-functions of hypergeometric type. Expressing these in the basis of products of power sum symmetric functions, the coefficients may be interpreted geometrically as parametric families of quantum Hurwitz numbers, enumerating weighted branched coverings of the Riemann sphere. Combinatorially, they give quantum weighted sums over paths in the Cayley graph of Sn generated by transpositions. Dual pairs of bases for the algebra of symmetric functions with respect to the scalar product in which the Macdonald polynomials are orthogonal provide both the geometrical and combinatorial significance of these quantum weighted enumerative invariants.

  5. The bivariate Rogers Szegö polynomials

    NASA Astrophysics Data System (ADS)

    Chen, William Y. C.; Saad, Husam L.; Sun, Lisa H.

    2007-06-01

    We present an operator approach to deriving Mehler's formula and the Rogers formula for the bivariate Rogers-Szegö polynomials hn(x, y|q). The proof of Mehler's formula can be considered as a new approach to the nonsymmetric Poisson kernel formula for the continuous big q-Hermite polynomials Hn(x; a|q) due to Askey, Rahman and Suslov. Mehler's formula for hn(x, y|q) involves a 3phi2 sum and the Rogers formula involves a 2phi1 sum. The proofs of these results are based on parameter augmentation with respect to the q-exponential operator and the homogeneous q-shift operator in two variables. By extending recent results on the Rogers-Szegö polynomials hn(x|q) due to Hou, Lascoux and Mu, we obtain another Rogers-type formula for hn(x, y|q). Finally, we give a change of base formula for Hn(x; a|q) which can be used to evaluate some integrals by using the Askey-Wilson integral.

  6. Chromatic polynomials of random graphs

    NASA Astrophysics Data System (ADS)

    Van Bussel, Frank; Ehrlich, Christoph; Fliegner, Denny; Stolzenberg, Sebastian; Timme, Marc

    2010-04-01

    Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge density. We specifically focus on the locations of the zeros of the polynomial in the complex plane. The results indicate that the chromatic zeros of random graphs have a very consistent layout. In particular, the crossing point, the point at which the chromatic zeros with non-zero imaginary part approach the real axis, scales linearly with the average degree over most of the density range. While the scaling laws obtained are purely empirical, if they continue to hold in general there are significant implications: the crossing points of chromatic zeros in the thermodynamic limit separate systems with zero ground state entropy from systems with positive ground state entropy, the latter an exception to the third law of thermodynamics.

  7. Polynomial fuzzy observer designs: a sum-of-squares approach.

    PubMed

    Tanaka, Kazuo; Ohtake, Hiroshi; Seo, Toshiaki; Tanaka, Motoyasu; Wang, Hua O

    2012-10-01

    This paper presents a sum-of-squares (SOS) approach to polynomial fuzzy observer designs for three classes of polynomial fuzzy systems. The proposed SOS-based framework provides a number of innovations and improvements over the existing linear matrix inequality (LMI)-based approaches to Takagi-Sugeno (T-S) fuzzy controller and observer designs. First, we briefly summarize previous results with respect to a polynomial fuzzy system that is a more general representation of the well-known T-S fuzzy system. Next, we propose polynomial fuzzy observers to estimate states in three classes of polynomial fuzzy systems and derive SOS conditions to design polynomial fuzzy controllers and observers. A remarkable feature of the SOS design conditions for the first two classes (Classes I and II) is that they realize the so-called separation principle, i.e., the polynomial fuzzy controller and observer for each class can be separately designed without lack of guaranteeing the stability of the overall control system in addition to converging state-estimation error (via the observer) to zero. Although, for the last class (Class III), the separation principle does not hold, we propose an algorithm to design polynomial fuzzy controller and observer satisfying the stability of the overall control system in addition to converging state-estimation error (via the observer) to zero. All the design conditions in the proposed approach can be represented in terms of SOS and are symbolically and numerically solved via the recently developed SOSTOOLS and a semidefinite-program solver, respectively. To illustrate the validity and applicability of the proposed approach, three design examples are provided. The examples demonstrate the advantages of the SOS-based approaches for the existing LMI approaches to T-S fuzzy observer designs.

  8. Using Tutte polynomials to analyze the structure of the benzodiazepines

    NASA Astrophysics Data System (ADS)

    Cadavid Muñoz, Juan José

    2014-05-01

    Graph theory in general and Tutte polynomials in particular, are implemented for analyzing the chemical structure of the benzodiazepines. Similarity analysis are used with the Tutte polynomials for finding other molecules that are similar to the benzodiazepines and therefore that might show similar psycho-active actions for medical purpose, in order to evade the drawbacks associated to the benzodiazepines based medicine. For each type of benzodiazepines, Tutte polynomials are computed and some numeric characteristics are obtained, such as the number of spanning trees and the number of spanning forests. Computations are done using the computer algebra Maple's GraphTheory package. The obtained analytical results are of great importance in pharmaceutical engineering. As a future research line, the usage of the chemistry computational program named Spartan, will be used to extent and compare it with the obtained results from the Tutte polynomials of benzodiazepines.

  9. The multivariate Hahn polynomials and the singular oscillator

    NASA Astrophysics Data System (ADS)

    Genest, Vincent X.; Vinet, Luc

    2014-11-01

    Karlin and McGregor's d-variable Hahn polynomials are shown to arise in the (d+1)-dimensional singular oscillator model as the overlap coefficients between bases associated with the separation of variables in Cartesian and hyperspherical coordinates. These polynomials in d discrete variables depend on d+1 real parameters and are orthogonal with respect to the multidimensional hypergeometric distribution. The focus is put on the d = 2 case for which the connection with the three-dimensional singular oscillator is used to derive the main properties of the polynomials: forward/backward shift operators, orthogonality relation, generating function, recurrence relations, bispectrality (difference equations) and explicit expression in terms of the univariate Hahn polynomials. The extension of these results to an arbitrary number of variables is presented at the end of the paper.

  10. Abelian avalanches and Tutte polynomials

    NASA Astrophysics Data System (ADS)

    Gabrielov, Andrei

    1993-04-01

    We introduce a class of deterministic lattice models of failure, Abelian avalanche (AA) models, with continuous phase variables, similar to discrete Abelian sandpile (ASP) models. We investigate analytically the structure of the phase space and statistical properties of avalanches in these models. We show that the distributions of avalanches in AA and ASP models with the same redistribution matrix and loading rate are identical. For an AA model on a graph, statistics of avalanches is linked to Tutte polynomials associated with this graph and its subgraphs. In the general case, statistics of avalanches is linked to an analog of a Tutte polynomial defined for any symmetric matrix.

  11. Macdonald Polynomials in Superspace: Conjectural Definition and Positivity Conjectures

    NASA Astrophysics Data System (ADS)

    Blondeau-Fournier, Olivier; Desrosiers, Patrick; Lapointe, Luc; Mathieu, Pierre

    2012-07-01

    We introduce a conjectural construction for an extension to superspace of the Macdonald polynomials. The construction, which depends on certain orthogonality and triangularity relations, is tested for high degrees. We conjecture a simple form for the norm of the Macdonald polynomials in superspace and a rather non-trivial expression for their evaluation. We study the limiting cases q = 0 and q = ∞, which lead to two families of Hall-Littlewood polynomials in superspace. We also find that the Macdonald polynomials in superspace evaluated at q = t = 0 or q = t = ∞ seem to generalize naturally the Schur functions. In particular, their expansion coefficients in the corresponding Hall-Littlewood bases appear to be polynomials in t with nonnegative integer coefficients. More strikingly, we formulate a generalization of the Macdonald positivity conjecture to superspace: the expansion coefficients of the Macdonald superpolynomials expanded into a modified version of the Schur superpolynomial basis (the q = t = 0 family) are polynomials in q and t with nonnegative integer coefficients.

  12. Polynomial Beam Element Analysis Module

    SciTech Connect

    Ning, S. Andrew

    2013-05-01

    pBEAM (Polynomial Beam Element Analysis Module) is a finite element code for beam-like structures. The methodology uses Euler? Bernoulli beam elements with 12 degrees of freedom (3 translation and 3 rotational at each end of the element).

  13. Optical homodyne tomography with polynomial series expansion

    SciTech Connect

    Benichi, Hugo; Furusawa, Akira

    2011-09-15

    We present and demonstrate a method for optical homodyne tomography based on the inverse Radon transform. Different from the usual filtered back-projection algorithm, this method uses an appropriate polynomial series to expand the Wigner function and the marginal distribution, and discretize Fourier space. We show that this technique solves most technical difficulties encountered with kernel deconvolution-based methods and reconstructs overall better and smoother Wigner functions. We also give estimators of the reconstruction errors for both methods and show improvement in noise handling properties and resilience to statistical errors.

  14. Isolation and characterization of the TaSnRK2.10 gene and its association with agronomic traits in wheat (Triticum aestivum L.).

    PubMed

    Zhang, Zhao-Gui; Lv, Guang-de; Li, Bing; Wang, Jia-Jia; Zhao, Yan; Kong, Fan-Mei; Guo, Ying; Li, Si-Shen

    2017-01-01

    Sucrose non-fermenting 1-related protein kinases (SnRKs) comprise a major family of signaling genes in plants and are associated with metabolic regulation, nutrient utilization and stress responses. This gene family has been proposed to be involved in sucrose signaling. In the present study, we cloned three copies of the TaSnRK2.10 gene from bread wheat on chromosomes 4A, 4B and 4D. The coding sequence (CDS) is 1086 bp in length and encodes a protein of 361 amino acids that exhibits functional domains shared with SnRK2s. Based on the haplotypes of TaSnRK2.10-4A (Hap-4A-H and Hap-4A-L), a cleaved amplified polymorphic sequence (CAPS) marker designated TaSnRK2.10-4A-CAPS was developed and mapped between the markers D-1092101 and D-100014232 using a set of recombinant inbred lines (RILs). The TaSnRK2.10-4B alleles (Hap-4B-G and Hap-4B-A) were transformed into allele-specific PCR (AS-PCR) markers TaSnRK2.10-4B-AS1 and TaSnRK2.10-4B-AS2, which were located between the markers D-1281577 and S-1862758. No diversity was found for TaSnRK2.10-4D. An association analysis using a natural population consisting of 128 winter wheat varieties in multiple environments showed that the thousand grain weight (TGW) and spike length (SL) of Hap-4A-H were significantly higher than those of Hap-4A-L, but pant height (PH) was significantly lower.

  15. Isolation and characterization of the TaSnRK2.10 gene and its association with agronomic traits in wheat (Triticum aestivum L.)

    PubMed Central

    Li, Bing; Wang, Jia-Jia; Zhao, Yan; Kong, Fan-Mei; Guo, Ying

    2017-01-01

    Sucrose non-fermenting 1-related protein kinases (SnRKs) comprise a major family of signaling genes in plants and are associated with metabolic regulation, nutrient utilization and stress responses. This gene family has been proposed to be involved in sucrose signaling. In the present study, we cloned three copies of the TaSnRK2.10 gene from bread wheat on chromosomes 4A, 4B and 4D. The coding sequence (CDS) is 1086 bp in length and encodes a protein of 361 amino acids that exhibits functional domains shared with SnRK2s. Based on the haplotypes of TaSnRK2.10-4A (Hap-4A-H and Hap-4A-L), a cleaved amplified polymorphic sequence (CAPS) marker designated TaSnRK2.10-4A-CAPS was developed and mapped between the markers D-1092101 and D-100014232 using a set of recombinant inbred lines (RILs). The TaSnRK2.10-4B alleles (Hap-4B-G and Hap-4B-A) were transformed into allele-specific PCR (AS-PCR) markers TaSnRK2.10-4B-AS1 and TaSnRK2.10-4B-AS2, which were located between the markers D-1281577 and S-1862758. No diversity was found for TaSnRK2.10-4D. An association analysis using a natural population consisting of 128 winter wheat varieties in multiple environments showed that the thousand grain weight (TGW) and spike length (SL) of Hap-4A-H were significantly higher than those of Hap-4A-L, but pant height (PH) was significantly lower. PMID:28355304

  16. Tables of properties of airfoil polynomials

    NASA Technical Reports Server (NTRS)

    Desmarais, Robert N.; Bland, Samuel R.

    1995-01-01

    This monograph provides an extensive list of formulas for airfoil polynomials. These polynomials provide convenient expansion functions for the description of the downwash and pressure distributions of linear theory for airfoils in both steady and unsteady subsonic flow.

  17. The Chebyshev Polynomials: Patterns and Derivation

    ERIC Educational Resources Information Center

    Sinwell, Benjamin

    2004-01-01

    The Chebyshev polynomials named after a Russian mathematician, Pafnuty Lvovich Chebyshev, have various mathematical applications. A process for obtaining Chebyshev polynomials, and a mathematical inquiry into the patterns they generate, is presented.

  18. Korobov polynomials of the first kind

    NASA Astrophysics Data System (ADS)

    Dolgy, D. V.; Kim, D. S.; Kim, T.

    2017-01-01

    In this paper, we study Korobov polynomials of the first kind from the viewpoint of umbral calculus and give new identities for them, associated with special polynomials which are derived from umbral calculus. Bibliography: 12 titles.

  19. Synthetic Division, Taylor Polynomials, Partial Fractions.

    ERIC Educational Resources Information Center

    Lambert, Howard B.

    1989-01-01

    Reviews the underpinnings of synthetic division. Shows how to quickly obtain the coefficients of the Taylor expansion of a polynomial about a point, and a partial fraction decomposition of a polynomial. (MVL)

  20. A New Generalisation of Macdonald Polynomials

    NASA Astrophysics Data System (ADS)

    Garbali, Alexandr; de Gier, Jan; Wheeler, Michael

    2017-01-01

    We introduce a new family of symmetric multivariate polynomials, whose coefficients are meromorphic functions of two parameters (q, t) and polynomial in a further two parameters (u, v). We evaluate these polynomials explicitly as a matrix product. At u = v = 0 they reduce to Macdonald polynomials, while at q = 0, u = v = s they recover a family of inhomogeneous symmetric functions originally introduced by Borodin.

  1. A New Generalisation of Macdonald Polynomials

    NASA Astrophysics Data System (ADS)

    Garbali, Alexandr; de Gier, Jan; Wheeler, Michael

    2017-06-01

    We introduce a new family of symmetric multivariate polynomials, whose coefficients are meromorphic functions of two parameters ( q, t) and polynomial in a further two parameters ( u, v). We evaluate these polynomials explicitly as a matrix product. At u = v = 0 they reduce to Macdonald polynomials, while at q = 0, u = v = s they recover a family of inhomogeneous symmetric functions originally introduced by Borodin.

  2. Nodal Statistics for the Van Vleck Polynomials

    NASA Astrophysics Data System (ADS)

    Bourget, Alain

    The Van Vleck polynomials naturally arise from the generalized Lamé equation as the polynomials of degree for which Eq. (1) has a polynomial solution of some degree k. In this paper, we compute the limiting distribution, as well as the limiting mean level spacings distribution of the zeros of any Van Vleck polynomial as N --> ∞.

  3. A Summation Formula for Macdonald Polynomials

    NASA Astrophysics Data System (ADS)

    de Gier, Jan; Wheeler, Michael

    2016-03-01

    We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases {t = 1} and {q = 0}, we recover known expressions for the monomial symmetric and Hall-Littlewood polynomials, respectively. Other specializations of our formula give new expressions for the Jack and q-Whittaker polynomials.

  4. Modular polynomial arithmetic in partial fraction decomposition

    NASA Technical Reports Server (NTRS)

    Abdali, S. K.; Caviness, B. F.; Pridor, A.

    1977-01-01

    Algorithms for general partial fraction decomposition are obtained by using modular polynomial arithmetic. An algorithm is presented to compute inverses modulo a power of a polynomial in terms of inverses modulo that polynomial. This algorithm is used to make an improvement in the Kung-Tong partial fraction decomposition algorithm.

  5. Restricted Schur polynomials and finite N counting

    SciTech Connect

    Collins, Storm

    2009-01-15

    Restricted Schur polynomials have been posited as orthonormal operators for the change of basis from N=4 SYM to type IIB string theory. In this paper we briefly expound the relationship between the restricted Schur polynomials and the operators forwarded by Brown, Heslop, and Ramgoolam. We then briefly examine the finite N counting of the restricted Schur polynomials.

  6. Modal wavefront reconstruction over general shaped aperture by numerical orthogonal polynomials

    NASA Astrophysics Data System (ADS)

    Ye, Jingfei; Li, Xinhua; Gao, Zhishan; Wang, Shuai; Sun, Wenqing; Wang, Wei; Yuan, Qun

    2015-03-01

    In practical optical measurements, the wavefront data are recorded by pixelated imaging sensors. The closed-form analytical base polynomial will lose its orthogonality in the discrete wavefront database. For a wavefront with an irregularly shaped aperture, the corresponding analytical base polynomials are laboriously derived. The use of numerical orthogonal polynomials for reconstructing a wavefront with a general shaped aperture over the discrete data points is presented. Numerical polynomials are orthogonal over the discrete data points regardless of the boundary shape of the aperture. The performance of numerical orthogonal polynomials is confirmed by theoretical analysis and experiments. The results demonstrate the adaptability, validity, and accuracy of numerical orthogonal polynomials for estimating the wavefront over a general shaped aperture from regular boundary to an irregular boundary.

  7. A general polynomial solution to convection-dispersion equation using boundary layer theory

    NASA Astrophysics Data System (ADS)

    Wang, Jiao; Shao, Ming'an; Huang, Laiming; Jia, Xiaoxu

    2017-04-01

    A number of models have been established to simulate the behaviour of solute transport due to chemical pollution, both in croplands and groundwater systems. An approximate polynomial solution to convection-dispersion equation (CDE) based on boundary layer theory has been verified for the use to describe solute transport in semi-infinite systems such as soil column. However, previous studies have only proposed low order polynomial solutions such as parabolic and cubic polynomials. This paper presents a general polynomial boundary layer solution to CDE. Comparison with exact solution suggests the prediction accuracy of the boundary layer solution varies with the order of polynomial expression and soil transport parameters. The results show that prediction accuracy increases with increasing order up to parabolic or cubic polynomial function and with no distinct relationship between accuracy and order for higher order polynomials (n≥slant 3). Comparison of two critical solute transport parameters (i.e., dispersion coefficient and retardation factor), estimated by the boundary layer solution and obtained by CXTFIT curve-fitting, shows a good agreement. The study shows that the general solution can determine the appropriate orders of polynomials for approximate CDE solutions that best describe solute concentration profiles and optimal solute transport parameters. Furthermore, the general polynomial solution to CDE provides a simple approach to solute transport problems, a criterion for choosing the right orders of polynomials for soils with different transport parameters. It is also a potential approach for estimating solute transport parameters of soils in the field.

  8. Some issues concerning a version of the theory of thin solids based on expansions in a system of Chebyshev polynomials of the second kind

    NASA Astrophysics Data System (ADS)

    Nikabadze, M. U.

    2007-06-01

    We consider various forms of equations of motion and heat influx for deformable solids as well as various forms of Hooke's law and Fourier's heat conduction law under the nonclassical parametrization [1-5] of the domain occupied by a thin solid, where the transverse coordinate ranges in the interval [0, 1]. We write out several characteristics inherent in this parametrization. We use the above-mentioned equations and laws to derive the corresponding equations and laws, as well as statements of problems, for thin bodies in moments with respect to Chebyshev polynomials of the second kind. Here the interval [0, 1] is used as the orthogonality interval for the systems of Chebyshev polynomials. For this interval, we write out the basic recursion relations and, in turn, use them to obtain several additional recursion relations, which play an important role in constructing other versions of the theory of thin solids. In particular, we use the recursion relations to obtain the moments of the first and second derivatives of a scalar function, of rank one and two tensors and their components, and of some differential operators of these variables. Moreover, we give the statements of coupled and uncoupled dynamic problems in moments of the ( r, N)th approximation in moment thermomechanics of thin deformable solids. We also state the nonstable temperature problem in moments of the ( r, N)th approximation.

  9. [An epidemiological index to assess the nutritional status of children based in a polynomial model of values from Z punctuation for the age in Mexico].

    PubMed

    Avila-Curiel, A; Shamah, T; Barragán, L; Chávez, A; Avila, Maria; Juárez, L

    2004-03-01

    A nutritional status index was built by modeling the mathematical function of the mean Z scores of weight for age, from 60,079 children under five years of age, selected in a probabilistic fashion from the Mexican population. The most precise mathematical model was a fifth degree polynomial. The correlation coefficient was between .937polynomial function, which represents the nutritional gap between the observed and the reference population. This model is used to analyze the characteristics of the different study populations. The index shows an improvement of -39.6 to -16.8 at the national level, between the years 1988 and 1999. This improvement is greater in urban (-36-4 to -8.4) than in rural areas (-48.8 in 1989, to -37.7 in 1999). The indigenous rural population of the country showed the highest levels of malnutrition (-54.4), as compared to the non-indigenous rural population (-37.1). In Mexico, City, the index was -5.9 in 1995, which represents an average of extreme nutritional values: -17.3 in the lower socioeconomic strata and 18.0 in the higher strata, the latter suggesting the presence of childhood obesity. This index is useful to estimate the epidemiological burden and the characteristics of malnutrition at early ages, as well as to assess the impact of interventions, without being altered by common biases related to the utilization of malnutrition prevalence values.

  10. On pseudo-Boolean polynomials

    NASA Astrophysics Data System (ADS)

    Leont'ev, V. K.

    2015-11-01

    A pseudo-Boolean function is an arbitrary mapping of the set of binary n-tuples to the real line. Such functions are a natural generalization of classical Boolean functions and find numerous applications in various applied studies. Specifically, the Fourier transform of a Boolean function is a pseudo-Boolean function. A number of facts associated with pseudo-Boolean polynomials are presented, and their applications to well-known discrete optimization problems are described.

  11. Weak lensing tomography with orthogonal polynomials

    NASA Astrophysics Data System (ADS)

    Schäfer, Björn Malte; Heisenberg, Lavinia

    2012-07-01

    The topic of this paper is weak cosmic shear tomography where the line-of-sight weighting is carried out with a set of specifically constructed orthogonal polynomials, dubbed Tomography with Orthogonal Radial Distance Polynomial Systems (TaRDiS). We investigate the properties of these polynomials and employ weak convergence spectra, which have been obtained by weighting with these polynomials, for the estimation of cosmological parameters. We quantify their power in constraining parameters in a Fisher matrix technique and demonstrate how each polynomial projects out statistically independent information, and how the combination of multiple polynomials lifts degeneracies. The assumption of a reference cosmology is needed for the construction of the polynomials, and as a last point we investigate how errors in the construction with a wrong cosmological model propagate to misestimates in cosmological parameters. TaRDiS performs on a similar level as traditional tomographic methods and some key features of tomography are made easier to understand.

  12. On adaptive weighted polynomial preconditioning for Hermitian positive definite matrices

    NASA Technical Reports Server (NTRS)

    Fischer, Bernd; Freund, Roland W.

    1992-01-01

    The conjugate gradient algorithm for solving Hermitian positive definite linear systems is usually combined with preconditioning in order to speed up convergence. In recent years, there has been a revival of polynomial preconditioning, motivated by the attractive features of the method on modern architectures. Standard techniques for choosing the preconditioning polynomial are based only on bounds for the extreme eigenvalues. Here a different approach is proposed, which aims at adapting the preconditioner to the eigenvalue distribution of the coefficient matrix. The technique is based on the observation that good estimates for the eigenvalue distribution can be derived after only a few steps of the Lanczos process. This information is then used to construct a weight function for a suitable Chebyshev approximation problem. The solution of this problem yields the polynomial preconditioner. In particular, we investigate the use of Bernstein-Szego weights.

  13. Stieltjes polynomials and Gauss-Kronrod quadrature formulae for measures induced by Chebyshev polynomials

    NASA Astrophysics Data System (ADS)

    Notaris, Sotirios

    1995-03-01

    Given a fixed n≥1, and a (monic) orthogonal polynomial πn(·)Dπn(·;dσ) relative to a positive measuredσ on the interval [a, b], one can define the nonnegative measure , to which correspond the (monic) orthogonal polynomials . The coefficients in the three-term recurrence relation for , whendσ is a Chebyshev measure of any of the four kinds, were obtained analytically in closed form by Gautschi and Li. Here, we give explicit formulae for the Stieltjes polynomials whendσ is any of the four Chebyshev measures. In addition, we show that the corresponding Gauss-Kronrod quadrature formulae for each of these , based on the zeros of and , have all the desirable properties of the interlacing of nodes, their inclusion in [-1, 1], and the positivity of all quadrature weights. Exceptions occur only for the Chebyshev measuredσ of the third or fourth kind andn even, in which case the inclusion property fails. The precise degree of exactness for each of these formulae is also determined.

  14. Heterologous Overexpression of Poplar SnRK2 Genes Enhanced Salt Stress Tolerance in Arabidopsis thaliana

    PubMed Central

    Song, Xueqing; Yu, Xiang; Hori, Chiaki; Demura, Taku; Ohtani, Misato; Zhuge, Qiang

    2016-01-01

    Subfamily 2 of SNF1-related protein kinase (SnRK2) plays important roles in plant abiotic stress responses as a global positive regulator of abscisic acid signaling. In the genome of the model tree Populus trichocarpa, 12 SnRK2 genes have been identified, and some are upregulated by abiotic stresses. In this study, we heterologously overexpressed the PtSnRK2 genes in Arabidopsis thaliana and found that overexpression of PtSnRK2.5 and PtSnRK2.7 genes enhanced stress tolerance. In the PtSnRK2.5 and PtSnRK2.7 overexpressors, chlorophyll content, and root elongation were maintained under salt stress conditions, leading to higher survival rates under salt stress compared with those in the wild type. Transcriptomic analysis revealed that PtSnRK2.7 overexpression affected stress-related metabolic genes, including lipid metabolism and flavonoid metabolism, even under normal growth conditions. However, the stress response genes reported to be upregulated in Arabidopsis SRK2C/SnRK2.6 and wheat SnRK2.8 overexpressors were not changed by PtSnRK2.7 overexpression. Furthermore, PtSnRK2.7 overexpression widely and largely influenced the transcriptome in response to salt stress; genes related to transport activity, including anion transport-related genes, were characteristically upregulated, and a variety of metabolic genes were specifically downregulated. We also found that the salt stress response genes were greatly upregulated in the PtSnRK2.7 overexpressor. Taken together, poplar subclass 2 PtSnRK2 genes can modulate salt stress tolerance in Arabidopsis, through the activation of cellular signaling pathways in a different manner from that by herbal subclass 2 SnRK2 genes. PMID:27242819

  15. Freeform surface of progressive addition lens represented by Zernike polynomials

    NASA Astrophysics Data System (ADS)

    Li, Yiyu; Xia, Risheng; Chen, Jiaojie; Feng, Haihua; Yuan, Yimin; Zhu, Dexi; Li, Chaohong

    2016-10-01

    We used the explicit expression of Zernike polynomials in Cartesian coordinates to fit and describe the freeform surface of progressive addition lens (PAL). The derivatives of Zernike polynomials can easily be calculated from the explicit expression and used to calculate the principal curvatures of freeform surface based on differential geometry. The surface spherical power and surface astigmatism of the freeform surface were successfully derived from the principal curvatures. By comparing with the traditional analytical method, Zernike polynomials with order of 20 is sufficient to represent the freeform surface with nanometer accuracy if dense sampling of the original surface is achieved. Therefore, the data files which contain the massive sampling points of the freeform surface for the generation of the trajectory of diamond tool tip required by diamond machine for PAL manufacture can be simplified by using a few Zernike coefficients.

  16. A Formally Verified Conflict Detection Algorithm for Polynomial Trajectories

    NASA Technical Reports Server (NTRS)

    Narkawicz, Anthony; Munoz, Cesar

    2015-01-01

    In air traffic management, conflict detection algorithms are used to determine whether or not aircraft are predicted to lose horizontal and vertical separation minima within a time interval assuming a trajectory model. In the case of linear trajectories, conflict detection algorithms have been proposed that are both sound, i.e., they detect all conflicts, and complete, i.e., they do not present false alarms. In general, for arbitrary nonlinear trajectory models, it is possible to define detection algorithms that are either sound or complete, but not both. This paper considers the case of nonlinear aircraft trajectory models based on polynomial functions. In particular, it proposes a conflict detection algorithm that precisely determines whether, given a lookahead time, two aircraft flying polynomial trajectories are in conflict. That is, it has been formally verified that, assuming that the aircraft trajectories are modeled as polynomial functions, the proposed algorithm is both sound and complete.

  17. The stable computation of formal orthogonal polynomials

    NASA Astrophysics Data System (ADS)

    Beckermann, Bernhard

    1996-12-01

    For many applications - such as the look-ahead variants of the Lanczos algorithm - a sequence of formal (block-)orthogonal polynomials is required. Usually, one generates such a sequence by taking suitable polynomial combinations of a pair of basis polynomials. These basis polynomials are determined by a look-ahead generalization of the classical three term recurrence, where the polynomial coefficients are obtained by solving a small system of linear equations. In finite precision arithmetic, the numerical orthogonality of the polynomials depends on a good choice of the size of the small systems; this size is usually controlled by a heuristic argument such as the condition number of the small matrix of coefficients. However, quite often it happens that orthogonality gets lost.

  18. Genome-wide analysis of SnRK gene family in Brachypodium distachyon and functional characterization of BdSnRK2.9.

    PubMed

    Wang, Lianzhe; Hu, Wei; Sun, Jiutong; Liang, Xiaoyu; Yang, Xiaoyue; Wei, Shuya; Wang, Xiatian; Zhou, Yi; Xiao, Qiang; Yang, Guangxiao; He, Guangyuan

    2015-08-01

    The sucrose non-fermenting 1 (SNF1)-related protein kinases (SnRKs) play key roles in plant signaling pathways including responses to biotic and abiotic stresses. Although SnRKs have been systematically studied in Arabidopsis and rice, there is no information concerning SnRKs in the new Poaceae model plant Brachypodium distachyon. In the present study, a total of 44 BdSnRKs were identified and classified into three subfamilies, including three members of BdSnRK1, 10 of BdSnRK2 and 31 of BdSnRK3 (CIPK) subfamilies. Phylogenetic reconstruction, chromosome distribution and synteny analyses suggested that BdSnRK family had been established before the dicot-monocot lineage parted, and had experienced rapid expansion during the process of plant evolution since then. Expression analysis of the BdSnRK2 subfamily showed that the majority of them could respond to abiotic stress and related signal molecules treatments. Protein-protein interaction and co-expression analyses of BdSnRK2s network showed that SnRK2s might be involved in biological pathway different from that of dicot model plant Arabidopsis. Expression of BdSnRK2.9 in tobacco resulted in increased tolerance to drought and salt stresses through activation of NtABF2. Taken together, comprehensive analyses of BdSnRKs would provide a basis for understanding of evolution and function of BdSnRK family.

  19. A new Arnoldi approach for polynomial eigenproblems

    SciTech Connect

    Raeven, F.A.

    1996-12-31

    In this paper we introduce a new generalization of the method of Arnoldi for matrix polynomials. The new approach is compared with the approach of rewriting the polynomial problem into a linear eigenproblem and applying the standard method of Arnoldi to the linearised problem. The algorithm that can be applied directly to the polynomial eigenproblem turns out to be more efficient, both in storage and in computation.

  20. Relative risk regression models with inverse polynomials.

    PubMed

    Ning, Yang; Woodward, Mark

    2013-08-30

    The proportional hazards model assumes that the log hazard ratio is a linear function of parameters. In the current paper, we model the log relative risk as an inverse polynomial, which is particularly suitable for modeling bounded and asymmetric functions. The parameters estimated by maximizing the partial likelihood are consistent and asymptotically normal. The advantages of the inverse polynomial model over the ordinary polynomial model and the fractional polynomial model for fitting various asymmetric log relative risk functions are shown by simulation. The utility of the method is further supported by analyzing two real data sets, addressing the specific question of the location of the minimum risk threshold.

  1. The q-Laguerre matrix polynomials.

    PubMed

    Salem, Ahmed

    2016-01-01

    The Laguerre polynomials have been extended to Laguerre matrix polynomials by means of studying certain second-order matrix differential equation. In this paper, certain second-order matrix q-difference equation is investigated and solved. Its solution gives a generalized of the q-Laguerre polynomials in matrix variable. Four generating functions of this matrix polynomials are investigated. Two slightly different explicit forms are introduced. Three-term recurrence relation, Rodrigues-type formula and the q-orthogonality property are given.

  2. Tsallis p, q-deformed Touchard polynomials and Stirling numbers

    NASA Astrophysics Data System (ADS)

    Herscovici, O.; Mansour, T.

    2017-01-01

    In this paper, we develop and investigate a new two-parametrized deformation of the Touchard polynomials, based on the definition of the NEXT q-exponential function of Tsallis. We obtain new generalizations of the Stirling numbers of the second kind and of the binomial coefficients and represent two new statistics for the set partitions.

  3. Mathematical modeling reveals that metabolic feedback regulation of SnRK1 and hexokinase is sufficient to control sugar homeostasis from energy depletion to full recovery

    PubMed Central

    Nägele, Thomas; Weckwerth, Wolfram

    2014-01-01

    Sucrose and trehalose-6-phosphate (T6P) are central compounds in the regulation and orchestration of whole plant metabolism, growth, development, and flowering. To evaluate their highly complex and regulatory interaction with the two conserved sugar and energy sensors Snf1-related protein kinase 1 (SnRK1), an AMPK-related protein kinase, and hexokinase (Hxk), we developed a kinetic model which demonstrates the subtle metabolic control of sugar homeostasis in a wide range of concentrations without the need for changes in gene expression or protein concentrations. Our model approach is based on a comprehensive set of published metabolite concentrations under various conditions and coupled enzyme kinetics accounting for the role of SnRK1 and Hxk in the sugar and energy homeostasis. This allowed us to investigate interactions between sugar phosphates, such as T6P, which are metabolic inhibitors of SnRK1 and Hxk, and sucrose synthesis during the transition from carbon deficiency to availability. Model simulations and sensitivity analyses indicated that slight changes in SnRK1 activity induced by allosteric effectors may be sufficient to explain a dramatic readjustment of metabolic homeostasis. This may comprise up to 10-fold changes in metabolite concentrations. Further, the Hxk/T6P/SnRK1 interaction implemented in the model supports the interpretation of phenotypic and transcriptomic changes observed in Hxk overexpressing plants. Finally, our approach presents a theoretical framework to kinetically link metabolic networks to underlying regulatory instances. PMID:25120550

  4. Mathematical modeling reveals that metabolic feedback regulation of SnRK1 and hexokinase is sufficient to control sugar homeostasis from energy depletion to full recovery.

    PubMed

    Nägele, Thomas; Weckwerth, Wolfram

    2014-01-01

    Sucrose and trehalose-6-phosphate (T6P) are central compounds in the regulation and orchestration of whole plant metabolism, growth, development, and flowering. To evaluate their highly complex and regulatory interaction with the two conserved sugar and energy sensors Snf1-related protein kinase 1 (SnRK1), an AMPK-related protein kinase, and hexokinase (Hxk), we developed a kinetic model which demonstrates the subtle metabolic control of sugar homeostasis in a wide range of concentrations without the need for changes in gene expression or protein concentrations. Our model approach is based on a comprehensive set of published metabolite concentrations under various conditions and coupled enzyme kinetics accounting for the role of SnRK1 and Hxk in the sugar and energy homeostasis. This allowed us to investigate interactions between sugar phosphates, such as T6P, which are metabolic inhibitors of SnRK1 and Hxk, and sucrose synthesis during the transition from carbon deficiency to availability. Model simulations and sensitivity analyses indicated that slight changes in SnRK1 activity induced by allosteric effectors may be sufficient to explain a dramatic readjustment of metabolic homeostasis. This may comprise up to 10-fold changes in metabolite concentrations. Further, the Hxk/T6P/SnRK1 interaction implemented in the model supports the interpretation of phenotypic and transcriptomic changes observed in Hxk overexpressing plants. Finally, our approach presents a theoretical framework to kinetically link metabolic networks to underlying regulatory instances.

  5. A new proposal for multivariable modelling of time-varying effects in survival data based on fractional polynomial time-transformation.

    PubMed

    Sauerbrei, Willi; Royston, Patrick; Look, Maxime

    2007-06-01

    The Cox proportional hazards model has become the standard for the analysis of survival time data in cancer and other chronic diseases. In most studies, proportional hazards (PH) are assumed for covariate effects. With long-term follow-up, the PH assumption may be violated, leading to poor model fit. To accommodate non-PH effects, we introduce a new procedure, MFPT, an extension of the multivariable fractional polynomial (MFP) approach, to do the following: (1) select influential variables; (2) determine a sensible dose-response function for continuous variables; (3) investigate time-varying effects; (4) model such time-varying effects on a continuous scale. Assuming PH initially, we start with a detailed model-building step, including a search for possible non-linear functions for continuous covariates. Sometimes a variable with a strong short-term effect may appear weak or non-influential if 'averaged' over time under the PH assumption. To protect against omitting such variables, we repeat the analysis over a restricted time-interval. Any additional prognostic variables identified by this second analysis are added to create our final time-fixed multivariable model. Using a forward-selection algorithm we search for possible improvements in fit by adding time-varying covariates. The first part to create a final time-fixed model does not require the use of MFP. A model may be given from 'outside' or a different strategy may be preferred for this part. This broadens the scope of the time-varying part. To motivate and illustrate the methodology, we create prognostic models from a large database of patients with primary breast cancer. Non-linear time-fixed effects are found for progesterone receptor status and number of positive lymph nodes. Highly statistically significant time-varying effects are present for progesterone receptor status and tumour size.

  6. Explaining the RK and RD(*) anomalies with vector leptoquarks

    NASA Astrophysics Data System (ADS)

    Sahoo, Suchismita; Mohanta, Rukmani; Giri, Anjan K.

    2017-02-01

    Recently, the B factories BABAR and Belle as well as the LHCb experiment have reported several anomalies in the semileptonic B meson decays, such as the RK and RD(*) etc. We investigate these deviations by considering the vector leptoquarks relevant for both b →s l+l- and b →c l ν¯ l transitions. The leptoquark parameter space is constrained by using the experimentally measured branching ratios of Bs→l+l- , B ¯ →Xsl+l-(ν ν ¯ ) , and Bu+→l+νl processes. Using the constrained leptoquark couplings, we compute the branching ratios, forward-backward asymmetries, τ , and D* polarization parameters in the B ¯ →D(*)l ν¯ l processes. We find that the vector leptoquarks can explain both the RD(*) and RK anomalies, simultaneously. Furthermore, we study the rare leptonic Bu,c *→l ν ¯ decay processes in this model.

  7. Continuous delay estimation with polynomial splines.

    PubMed

    Pinton, Gianmarco F; Trahey, Gregg E

    2006-11-01

    Delay estimation is used in ultrasonic imaging to estimate blood flow, determine phase aberration corrections, and to calculate elastographic images. Several algorithms have been developed to determine these delays. The accuracy of these methods depends in differing ways on noise, bandwidth, and delay range. In most cases relevant to delay estimation in ultrasonics, a subsample estimate of the delay is required. We introduce two new delay algorithms that use cubic polynomial splines to continuously represent the delay. These algorithms are compared to conventional delay estimators, such as normalized cross correlation and autocorrelation, and to another spline-based method. We present simulations that compare the algorithms' performance for varying amounts of noise, delay, and bandwidth. The proposed algorithms have better performance, in terms of bias and jitter, in a realistic ultrasonic imaging environment. The computational requirements of the new algorithms also are considered.

  8. New pole placement algorithm - Polynomial matrix approach

    NASA Technical Reports Server (NTRS)

    Shafai, B.; Keel, L. H.

    1990-01-01

    A simple and direct pole-placement algorithm is introduced for dynamical systems having a block companion matrix A. The algorithm utilizes well-established properties of matrix polynomials. Pole placement is achieved by appropriately assigning coefficient matrices of the corresponding matrix polynomial. This involves only matrix additions and multiplications without requiring matrix inversion. A numerical example is given for the purpose of illustration.

  9. Fractal Trigonometric Polynomials for Restricted Range Approximation

    NASA Astrophysics Data System (ADS)

    Chand, A. K. B.; Navascués, M. A.; Viswanathan, P.; Katiyar, S. K.

    2016-05-01

    One-sided approximation tackles the problem of approximation of a prescribed function by simple traditional functions such as polynomials or trigonometric functions that lie completely above or below it. In this paper, we use the concept of fractal interpolation function (FIF), precisely of fractal trigonometric polynomials, to construct one-sided uniform approximants for some classes of continuous functions.

  10. On the Waring problem for polynomial rings

    PubMed Central

    Fröberg, Ralf; Ottaviani, Giorgio; Shapiro, Boris

    2012-01-01

    In this note we discuss an analog of the classical Waring problem for . Namely, we show that a general homogeneous polynomial of degree divisible by k≥2 can be represented as a sum of at most kn k-th powers of homogeneous polynomials in . Noticeably, kn coincides with the number obtained by naive dimension count. PMID:22460787

  11. Percolation critical polynomial as a graph invariant.

    PubMed

    Scullard, Christian R

    2012-10-01

    Every lattice for which the bond percolation critical probability can be found exactly possesses a critical polynomial, with the root in [0,1] providing the threshold. Recent work has demonstrated that this polynomial may be generalized through a definition that can be applied on any periodic lattice. The polynomial depends on the lattice and on its decomposition into identical finite subgraphs, but once these are specified, the polynomial is essentially unique. On lattices for which the exact percolation threshold is unknown, the polynomials provide approximations for the critical probability with the estimates appearing to converge to the exact answer with increasing subgraph size. In this paper, I show how this generalized critical polynomial can be viewed as a graph invariant, similar to the Tutte polynomial. In particular, the critical polynomial is computed on a finite graph and may be found using the recursive deletion-contraction algorithm. This allows calculation on a computer, and I present such results for the kagome lattice using subgraphs of up to 36 bonds. For one of these, I find the prediction p(c)=0.52440572..., which differs from the numerical value, p(c)=0.52440503(5), by only 6.9×10(-7).

  12. Percolation critical polynomial as a graph invariant

    NASA Astrophysics Data System (ADS)

    Scullard, Christian R.

    2012-10-01

    Every lattice for which the bond percolation critical probability can be found exactly possesses a critical polynomial, with the root in [0,1] providing the threshold. Recent work has demonstrated that this polynomial may be generalized through a definition that can be applied on any periodic lattice. The polynomial depends on the lattice and on its decomposition into identical finite subgraphs, but once these are specified, the polynomial is essentially unique. On lattices for which the exact percolation threshold is unknown, the polynomials provide approximations for the critical probability with the estimates appearing to converge to the exact answer with increasing subgraph size. In this paper, I show how this generalized critical polynomial can be viewed as a graph invariant, similar to the Tutte polynomial. In particular, the critical polynomial is computed on a finite graph and may be found using the recursive deletion-contraction algorithm. This allows calculation on a computer, and I present such results for the kagome lattice using subgraphs of up to 36 bonds. For one of these, I find the prediction pc=0.52440572⋯, which differs from the numerical value, pc=0.52440503(5), by only 6.9×10-7.

  13. Polynomial solutions of nonlinear integral equations

    NASA Astrophysics Data System (ADS)

    Dominici, Diego

    2009-05-01

    We analyze the polynomial solutions of a nonlinear integral equation, generalizing the work of Bender and Ben-Naim (2007 J. Phys. A: Math. Theor. 40 F9, 2008 J. Nonlinear Math. Phys. 15 (Suppl. 3) 73). We show that, in some cases, an orthogonal solution exists and we give its general form in terms of kernel polynomials.

  14. Some Recent Advances in Multivariate Polynomial Interpolation

    NASA Astrophysics Data System (ADS)

    Carnicer, J. M.; Gasca, M.

    2007-09-01

    Multivariate polynomial interpolation has received much attention in the last part of the 20th century. In this talk we comment on some recent advances in the last decade, with special emphasis in distributions of points which give rise to unisolvent (or poised) problems in the space of polynomials of a given total degree and simple interpolation formulae.

  15. Polynomial probability distribution estimation using the method of moments

    PubMed Central

    Mattsson, Lars; Rydén, Jesper

    2017-01-01

    We suggest a procedure for estimating Nth degree polynomial approximations to unknown (or known) probability density functions (PDFs) based on N statistical moments from each distribution. The procedure is based on the method of moments and is setup algorithmically to aid applicability and to ensure rigor in use. In order to show applicability, polynomial PDF approximations are obtained for the distribution families Normal, Log-Normal, Weibull as well as for a bimodal Weibull distribution and a data set of anonymized household electricity use. The results are compared with results for traditional PDF series expansion methods of Gram–Charlier type. It is concluded that this procedure is a comparatively simple procedure that could be used when traditional distribution families are not applicable or when polynomial expansions of probability distributions might be considered useful approximations. In particular this approach is practical for calculating convolutions of distributions, since such operations become integrals of polynomial expressions. Finally, in order to show an advanced applicability of the method, it is shown to be useful for approximating solutions to the Smoluchowski equation. PMID:28394949

  16. Genome-Wide Identification and Characterization of the GmSnRK2 Family in Soybean.

    PubMed

    Zhao, Wei; Cheng, Yi-Hui; Zhang, Chi; Shen, Xin-Jie; You, Qing-Bo; Guo, Wei; Li, Xiang; Song, Xue-Jiao; Zhou, Xin-An; Jiao, Yong-Qing

    2017-08-23

    Sucrose non-fermenting-1 (SNF1)-related protein kinase 2s (SnRK2s) that were reported to be involved in the transduction of abscisic acid (ABA) signaling, play important roles in response to biotic and abiotic stresses in plants. Compared to the systemic investigation of SnRK2s in Arabidopsisthaliana and Oryza sativa, little is known regarding SnRK2s in soybean, which is one of the most important oil and protein crops. In the present study, we performed genome-wide identification and characterization of GmSnRK2s in soybean. In summary, 22 GmSnRK2s were identified and clustered into four groups. Phylogenetic analysis indicated the expansion of SnRK2 gene family during the evolution of soybean. Various cis-acting elements such as ABA Response Elements (ABREs) were identified and analyzed in the promoter regions of GmSnRK2s. The results of RNA sequencing (RNA-Seq) data for different soybean tissues showed that GmSnRK2s exhibited spatio-temporally specific expression patterns during soybean growth and development. Certain GmSnRK2s could respond to the treatments including salinity, ABA and strigolactones. Our results provide a foundation for the further elucidation of the function of GmSnRK2 genes in soybean.

  17. Tutte polynomial in functional magnetic resonance imaging

    NASA Astrophysics Data System (ADS)

    García-Castillón, Marlly V.

    2015-09-01

    Methods of graph theory are applied to the processing of functional magnetic resonance images. Specifically the Tutte polynomial is used to analyze such kind of images. Functional Magnetic Resonance Imaging provide us connectivity networks in the brain which are represented by graphs and the Tutte polynomial will be applied. The problem of computing the Tutte polynomial for a given graph is #P-hard even for planar graphs. For a practical application the maple packages "GraphTheory" and "SpecialGraphs" will be used. We will consider certain diagram which is depicting functional connectivity, specifically between frontal and posterior areas, in autism during an inferential text comprehension task. The Tutte polynomial for the resulting neural networks will be computed and some numerical invariants for such network will be obtained. Our results show that the Tutte polynomial is a powerful tool to analyze and characterize the networks obtained from functional magnetic resonance imaging.

  18. DIFFERENTIAL CROSS SECTION ANALYSIS IN KAON PHOTOPRODUCTION USING ASSOCIATED LEGENDRE POLYNOMIALS

    SciTech Connect

    P. T. P. HUTAURUK, D. G. IRELAND, G. ROSNER

    2009-04-01

    Angular distributions of differential cross sections from the latest CLAS data sets,6 for the reaction γ + p→K+ + Λ have been analyzed using associated Legendre polynomials. This analysis is based upon theoretical calculations in Ref. 1 where all sixteen observables in kaon photoproduction can be classified into four Legendre classes. Each observable can be described by an expansion of associated Legendre polynomial functions. One of the questions to be addressed is how many associated Legendre polynomials are required to describe the data. In this preliminary analysis, we used data models with different numbers of associated Legendre polynomials. We then compared these models by calculating posterior probabilities of the models. We found that the CLAS data set needs no more than four associated Legendre polynomials to describe the differential cross section data. In addition, we also show the extracted coefficients of the best model.

  19. On properties of bi-periodic Fibonacci and Lucas polynomials

    NASA Astrophysics Data System (ADS)

    Yilmaz, Nazmiye; Coskun, Arzu; Taskara, Necati

    2017-07-01

    In this paper, we define bi-periodic Fibonacci and Lucas polynomials and investigate properties of these polynomials which generalized of bi-periodic Fibonacci and Lucas numbers. We also obtain some new algebraic properties on these numbers and polynomials.

  20. M-Interval Orthogonal Polynomial Estimators with Applications

    NASA Astrophysics Data System (ADS)

    Jaroszewicz, Boguslaw Emanuel

    In this dissertation, adaptive estimators of various statistical nonlinearities are constructed and evaluated. The estimators are based on classical orthogonal polynomials which allows an exact computation of convergence rates. The first part of the dissertation is devoted to the estimation of one- and multi-dimensional probability density functions. The most attractive computationally is the Legendre estimator, which corresponds to the mean square segmented polynomial approximation of a pdf. Exact bounds for two components of the estimation error--deterministic bias and random error--are derived for all the polynomial estimators. The bounds on the bias are functions of the "smoothness" of the estimated pdf as measured by the number of continuous derivatives the pdf possesses. Adaptively estimated the optimum number of orthonormal polynomials minimizes the total error. In the second part, the theory of polynomial estimators is applied to the estimation of derivatives of pdf and regression functions. The optimum detectors for small signals in nongaussian noise, as well as any kind of statistical filtering involving likelihood function, are based on the nonlinearity which is a ratio of the derivative of the pdf and the pdf itself. Several different polynomial estimators of this nonlinearity are developed and compared. The theory of estimation is then extended to the multivariable case. The partial derivative nonlinearity is used for detection of signals in dependent noise. When the dimensionality of the nonlinearity is very large, the transformed Hermite estimators are particularly useful. The estimators can be viewed as two-stage filters: the first stage is a pre -whitening filter optimum in gaussian noise and the second stage is a nonlinear filter, which improves performance in nongaussian noise. Filtering of this type can be applied to predictive coding, nonlinear identification and other estimation problems involving a conditional expected value. In the third

  1. Central suboptimal H ∞ control design for nonlinear polynomial systems

    NASA Astrophysics Data System (ADS)

    Basin, Michael V.; Shi, Peng; Calderon-Alvarez, Dario

    2011-05-01

    This article presents the central finite-dimensional H ∞ regulator for nonlinear polynomial systems, which is suboptimal for a given threshold γ with respect to a modified Bolza-Meyer quadratic criterion including the attenuation control term with the opposite sign. In contrast to the previously obtained results, the article reduces the original H ∞ control problem to the corresponding optimal H 2 control problem, using this technique proposed in Doyle et al. [Doyle, J.C., Glover, K., Khargonekar, P.P., and Francis, B.A. (1989), 'State-space Solutions to Standard H 2 and H ∞ Control Problems', IEEE Transactions on Automatic Control, 34, 831-847]. This article yields the central suboptimal H ∞ regulator for nonlinear polynomial systems in a closed finite-dimensional form, based on the optimal H 2 regulator obtained in Basin and Calderon-Alvarez [Basin, M.V., and Calderon-Alvarez, D. (2008b), 'Optimal Controller for Uncertain Stochastic Polynomial Systems', Journal of the Franklin Institute, 345, 293-302]. Numerical simulations are conducted to verify performance of the designed central suboptimal regulator for nonlinear polynomial systems against the central suboptimal H ∞ regulator available for the corresponding linearised system.

  2. Transfer matrix computation of generalized critical polynomials in percolation

    NASA Astrophysics Data System (ADS)

    Scullard, Christian R.; Lykke Jacobsen, Jesper

    2012-12-01

    Percolation thresholds have recently been studied by means of a graph polynomial PB(p), henceforth referred to as the critical polynomial, that may be defined on any periodic lattice. The polynomial depends on a finite subgraph B, called the basis, and the way in which the basis is tiled to form the lattice. The unique root of PB(p) in [0, 1] either gives the exact percolation threshold for the lattice, or provides an approximation that becomes more accurate with appropriately increasing size of B. Initially PB(p) was defined by a contraction-deletion identity, similar to that satisfied by the Tutte polynomial. Here, we give an alternative probabilistic definition of PB(p), which allows for much more efficient computations, by using the transfer matrix, than was previously possible with contraction-deletion. We present bond percolation polynomials for the (4, 82), kagome, and (3, 122) lattices for bases of up to respectively 96, 162 and 243 edges, much larger than the previous limit of 36 edges using contraction-deletion. We discuss in detail the role of the symmetries and the embedding of B. For the largest bases, we obtain the thresholds pc(4, 82) = 0.676 803 329…, pc(kagome) = 0.524 404 998…, pc(3, 122) = 0.740 420 798…, comparable to the best simulation results. We also show that the alternative definition of PB(p) can be applied to study site percolation problems. This article is part of ‘Lattice models and integrability’, a special issue of Journal of Physics A: Mathematical and Theoretical in honour of F Y Wu's 80th birthday.

  3. Sequences of versatile, broad-host-range vectors of the RK2 family.

    SciTech Connect

    Scott, H. N.; Laible, P. D.; Hanson, D. K.; Biosciences Division

    2003-07-01

    Plasmid pRK404-a smaller derivative of RK2-is a tetracycline-resistant broad-host-range vector that carries a multiple cloning site and the lacZ(alpha) peptide that enables blue/white selection for cloned inserts in Escherichia coli. We present herein the complete and annotated sequence of pRK404 and three related vectors-pRK437, pRK442, and pRK442(H). These derivatives have proven to be valuable tools for genetic manipulation in Gram-negative bacteria. The knowledge of their complete sequences will facilitate efficient future engineering of them and will enhance their general applicability to the design of genetic systems for use in organisms for which new genomic sequence data are becoming available.

  4. Polynomial meta-models with canonical low-rank approximations: Numerical insights and comparison to sparse polynomial chaos expansions

    NASA Astrophysics Data System (ADS)

    Konakli, Katerina; Sudret, Bruno

    2016-09-01

    The growing need for uncertainty analysis of complex computational models has led to an expanding use of meta-models across engineering and sciences. The efficiency of meta-modeling techniques relies on their ability to provide statistically-equivalent analytical representations based on relatively few evaluations of the original model. Polynomial chaos expansions (PCE) have proven a powerful tool for developing meta-models in a wide range of applications; the key idea thereof is to expand the model response onto a basis made of multivariate polynomials obtained as tensor products of appropriate univariate polynomials. The classical PCE approach nevertheless faces the "curse of dimensionality", namely the exponential increase of the basis size with increasing input dimension. To address this limitation, the sparse PCE technique has been proposed, in which the expansion is carried out on only a few relevant basis terms that are automatically selected by a suitable algorithm. An alternative for developing meta-models with polynomial functions in high-dimensional problems is offered by the newly emerged low-rank approximations (LRA) approach. By exploiting the tensor-product structure of the multivariate basis, LRA can provide polynomial representations in highly compressed formats. Through extensive numerical investigations, we herein first shed light on issues relating to the construction of canonical LRA with a particular greedy algorithm involving a sequential updating of the polynomial coefficients along separate dimensions. Specifically, we examine the selection of optimal rank, stopping criteria in the updating of the polynomial coefficients and error estimation. In the sequel, we confront canonical LRA to sparse PCE in structural-mechanics and heat-conduction applications based on finite-element solutions. Canonical LRA exhibit smaller errors than sparse PCE in cases when the number of available model evaluations is small with respect to the input dimension, a

  5. Polynomial meta-models with canonical low-rank approximations: Numerical insights and comparison to sparse polynomial chaos expansions

    SciTech Connect

    Konakli, Katerina Sudret, Bruno

    2016-09-15

    The growing need for uncertainty analysis of complex computational models has led to an expanding use of meta-models across engineering and sciences. The efficiency of meta-modeling techniques relies on their ability to provide statistically-equivalent analytical representations based on relatively few evaluations of the original model. Polynomial chaos expansions (PCE) have proven a powerful tool for developing meta-models in a wide range of applications; the key idea thereof is to expand the model response onto a basis made of multivariate polynomials obtained as tensor products of appropriate univariate polynomials. The classical PCE approach nevertheless faces the “curse of dimensionality”, namely the exponential increase of the basis size with increasing input dimension. To address this limitation, the sparse PCE technique has been proposed, in which the expansion is carried out on only a few relevant basis terms that are automatically selected by a suitable algorithm. An alternative for developing meta-models with polynomial functions in high-dimensional problems is offered by the newly emerged low-rank approximations (LRA) approach. By exploiting the tensor–product structure of the multivariate basis, LRA can provide polynomial representations in highly compressed formats. Through extensive numerical investigations, we herein first shed light on issues relating to the construction of canonical LRA with a particular greedy algorithm involving a sequential updating of the polynomial coefficients along separate dimensions. Specifically, we examine the selection of optimal rank, stopping criteria in the updating of the polynomial coefficients and error estimation. In the sequel, we confront canonical LRA to sparse PCE in structural-mechanics and heat-conduction applications based on finite-element solutions. Canonical LRA exhibit smaller errors than sparse PCE in cases when the number of available model evaluations is small with respect to the input

  6. More on rotations as spin matrix polynomials

    SciTech Connect

    Curtright, Thomas L.

    2015-09-15

    Any nonsingular function of spin j matrices always reduces to a matrix polynomial of order 2j. The challenge is to find a convenient form for the coefficients of the matrix polynomial. The theory of biorthogonal systems is a useful framework to meet this challenge. Central factorial numbers play a key role in the theoretical development. Explicit polynomial coefficients for rotations expressed either as exponentials or as rational Cayley transforms are considered here. Structural features of the results are discussed and compared, and large j limits of the coefficients are examined.

  7. The Translated Dowling Polynomials and Numbers

    PubMed Central

    Mangontarum, Mahid M.; Macodi-Ringia, Amila P.; Abdulcarim, Normalah S.

    2014-01-01

    More properties for the translated Whitney numbers of the second kind such as horizontal generating function, explicit formula, and exponential generating function are proposed. Using the translated Whitney numbers of the second kind, we will define the translated Dowling polynomials and numbers. Basic properties such as exponential generating functions and explicit formula for the translated Dowling polynomials and numbers are obtained. Convexity, integral representation, and other interesting identities are also investigated and presented. We show that the properties obtained are generalizations of some of the known results involving the classical Bell polynomials and numbers. Lastly, we established the Hankel transform of the translated Dowling numbers. PMID:27433494

  8. The Translated Dowling Polynomials and Numbers.

    PubMed

    Mangontarum, Mahid M; Macodi-Ringia, Amila P; Abdulcarim, Normalah S

    2014-01-01

    More properties for the translated Whitney numbers of the second kind such as horizontal generating function, explicit formula, and exponential generating function are proposed. Using the translated Whitney numbers of the second kind, we will define the translated Dowling polynomials and numbers. Basic properties such as exponential generating functions and explicit formula for the translated Dowling polynomials and numbers are obtained. Convexity, integral representation, and other interesting identities are also investigated and presented. We show that the properties obtained are generalizations of some of the known results involving the classical Bell polynomials and numbers. Lastly, we established the Hankel transform of the translated Dowling numbers.

  9. Expression of recombinant SnRK1 in E. coli. Characterization of adenine nucleotide binding to the SnRK1.1/AKINβγ-β3 complex.

    PubMed

    Maya-Bernal, José Luis; Ávila, Alejandra; Ruiz-Gayosso, Ana; Trejo-Fregoso, Ricardo; Pulido, Nancy; Sosa-Peinado, Alejandro; Zúñiga-Sánchez, Esther; Martínez-Barajas, Eleazar; Rodríguez-Sotres, Rogelio; Coello, Patricia

    2017-10-01

    The SnRK1 complexes in plants belong to the family of AMPK/SNF1 kinases, which have been associated with the control of energy balance, in addition to being involved in the regulation of other aspects of plant growth and development. Analysis of complex formation indicates that increased activity is achieved when the catalytic subunit is phosphorylated and bound to regulatory subunits. SnRK1.1 subunit activity is higher than that of SnRK1.2, which also exhibits reduced activation due to the regulatory subunits. The catalytic phosphomimetic subunits (T175/176D) do not exhibit high activity levels, which indicate that the amino acid change does not produce the same effect as phosphorylation. Based on the mammalian AMPK X-ray structure, the plant SnRK1.1/AKINβγ-β3 was modeled by homology modeling and Molecular Dynamics simulations (MD). The model predicted an intimate and extensive contact between a hydrophobic region of AKINβγ and the β3 subunit. While the AKINβγ prediction retains the 4 CBS domain organization of the mammalian enzyme, significant differences are found in the putative nucleotide binding pockets. Docking and MD studies identified two sites between CBS 3 and 4 which may bind adenine nucleotides, but only one appears to be functional, as judging from the predicted binding energies. The recombinant AKINβγ-βs complexes were found to bind adenine nucleotides with dissociation constant (Kd) in the range of the AMP low affinity site in AMPK. The saturation binding data was consistent with a one-site model, in agreement with the in silico calculations. As has been suggested previously, the effect of AMP was found to slow down dephosphorylation but did not influence activity. Copyright © 2017 Elsevier B.V. All rights reserved.

  10. Polynomial time blackbox identity testers for depth-3 circuits : the field doesn't matter.

    SciTech Connect

    Seshadhri, Comandur; Saxena, Nitin

    2010-11-01

    Let C be a depth-3 circuit with n variables, degree d and top fanin k (called {Sigma}{Pi}{Sigma}(k, d, n) circuits) over base field F. It is a major open problem to design a deterministic polynomial time blackbox algorithm that tests if C is identically zero. Klivans & Spielman (STOC 2001) observed that the problem is open even when k is a constant. This case has been subjected to a serious study over the past few years, starting from the work of Dvir & Shpilka (STOC 2005). We give the first polynomial time blackbox algorithm for this problem. Our algorithm runs in time poly(n)d{sup k}, regardless of the base field. The only field for which polynomial time algorithms were previously known is F = Q (Kayal & Saraf, FOCS 2009, and Saxena & Seshadhri, FOCS 2010). This is the first blackbox algorithm for depth-3 circuits that does not use the rank based approaches of Karnin & Shpilka (CCC 2008). We prove an important tool for the study of depth-3 identities. We design a blackbox polynomial time transformation that reduces the number of variables in a {Sigma}{Pi}{Sigma}(k, d, n) circuit to k variables, but preserves the identity structure. Polynomial identity testing (PIT) is a major open problem in theoretical computer science. The input is an arithmetic circuit that computes a polynomial p(x{sub 1}, x{sub 2},..., x{sub n}) over a base field F. We wish to check if p is the zero polynomial, or in other words, is identically zero. We may be provided with an explicit circuit, or may only have blackbox access. In the latter case, we can only evaluate the polynomial p at various domain points. The main goal is to devise a deterministic blackbox polynomial time algorithm for PIT.

  11. Uncertainty Quantification in Simulations of Epidemics Using Polynomial Chaos

    PubMed Central

    Santonja, F.; Chen-Charpentier, B.

    2012-01-01

    Mathematical models based on ordinary differential equations are a useful tool to study the processes involved in epidemiology. Many models consider that the parameters are deterministic variables. But in practice, the transmission parameters present large variability and it is not possible to determine them exactly, and it is necessary to introduce randomness. In this paper, we present an application of the polynomial chaos approach to epidemiological mathematical models based on ordinary differential equations with random coefficients. Taking into account the variability of the transmission parameters of the model, this approach allows us to obtain an auxiliary system of differential equations, which is then integrated numerically to obtain the first-and the second-order moments of the output stochastic processes. A sensitivity analysis based on the polynomial chaos approach is also performed to determine which parameters have the greatest influence on the results. As an example, we will apply the approach to an obesity epidemic model. PMID:22927889

  12. Temperature 3D profiling in cryogenic cylindrical devices using Boubaker polynomials expansion scheme (BPES)

    NASA Astrophysics Data System (ADS)

    Ben Mahmoud, B. Karem

    2009-05-01

    In this paper, a temperature dynamical profiling inside vacuum-insulated Hydrogen cryogenic vessels is yielded. The theoretical investigations are based on the similarity between the convective heat equation and the characteristic differential equation of the Boubaker polynomials.

  13. A Least Squares Approximate Solution To Polynomial Equations Over the Real Numbers

    ERIC Educational Resources Information Center

    Poole, George

    1977-01-01

    A geometric approach to the solution of quadratic equations and more general polynomials is based on finding points with minimum distance from the x-axis. The approach is useful in motivating the definition of complex numbers. (SD)

  14. Schur Stability Regions for Complex Quadratic Polynomials

    ERIC Educational Resources Information Center

    Cheng, Sui Sun; Huang, Shao Yuan

    2010-01-01

    Given a quadratic polynomial with complex coefficients, necessary and sufficient conditions are found in terms of the coefficients such that all its roots have absolute values less than 1. (Contains 3 figures.)

  15. Gaussian quadrature for multiple orthogonal polynomials

    NASA Astrophysics Data System (ADS)

    Coussement, Jonathan; van Assche, Walter

    2005-06-01

    We study multiple orthogonal polynomials of type I and type II, which have orthogonality conditions with respect to r measures. These polynomials are connected by their recurrence relation of order r+1. First we show a relation with the eigenvalue problem of a banded lower Hessenberg matrix Ln, containing the recurrence coefficients. As a consequence, we easily find that the multiple orthogonal polynomials of type I and type II satisfy a generalized Christoffel-Darboux identity. Furthermore, we explain the notion of multiple Gaussian quadrature (for proper multi-indices), which is an extension of the theory of Gaussian quadrature for orthogonal polynomials and was introduced by Borges. In particular, we show that the quadrature points and quadrature weights can be expressed in terms of the eigenvalue problem of Ln.

  16. Chromatic polynomials, Potts models and all that

    NASA Astrophysics Data System (ADS)

    Sokal, Alan D.

    2000-04-01

    The q-state Potts model can be defined on an arbitrary finite graph, and its partition function encodes much important information about that graph, including its chromatic polynomial, flow polynomial and reliability polynomial. The complex zeros of the Potts partition function are of interest both to statistical mechanicians and to combinatorists. I give a pedagogical introduction to all these problems, and then sketch two recent results: (a) Construction of a countable family of planar graphs whose chromatic zeros are dense in the whole complex q-plane except possibly for the disc | q-1|<1. (b) Proof of a universal upper bound on the q-plane zeros of the chromatic polynomial (or antiferromagnetic Potts-model partition function) in terms of the graph's maximum degree.

  17. Quantum Communication and Quantum Multivariate Polynomial Interpolation

    NASA Astrophysics Data System (ADS)

    Diep, Do Ngoc; Giang, Do Hoang

    2017-09-01

    The paper is devoted to the problem of multivariate polynomial interpolation and its application to quantum secret sharing. We show that using quantum Fourier transform one can produce the protocol for quantum secret sharing distribution.

  18. Schur Stability Regions for Complex Quadratic Polynomials

    ERIC Educational Resources Information Center

    Cheng, Sui Sun; Huang, Shao Yuan

    2010-01-01

    Given a quadratic polynomial with complex coefficients, necessary and sufficient conditions are found in terms of the coefficients such that all its roots have absolute values less than 1. (Contains 3 figures.)

  19. On the linearization problem for ultraspherical polynomials

    NASA Astrophysics Data System (ADS)

    Bassetti, B.; Montaldi, E.; Raciti, M.

    1986-03-01

    A direct proof of a formula established by Bressoud in 1981 [D. M. Bressoud, SIAM J. Math. Anal. 12, 161 (1981)], equivalent to the linearization formula for the ultraspherical polynomials, is given. Some related results are briefly discussed.

  20. Adapted polynomial chaos expansion for failure detection

    SciTech Connect

    Paffrath, M. Wever, U.

    2007-09-10

    In this paper, we consider two methods of computation of failure probabilities by adapted polynomial chaos expansions. The performance of the two methods is demonstrated by a predator-prey model and a chemical reaction problem.

  1. Adapted polynomial chaos expansion for failure detection

    NASA Astrophysics Data System (ADS)

    Paffrath, M.; Wever, U.

    2007-09-01

    In this paper, we consider two methods of computation of failure probabilities by adapted polynomial chaos expansions. The performance of the two methods is demonstrated by a predator-prey model and a chemical reaction problem.

  2. The Fixed-Links Model in Combination with the Polynomial Function as a Tool for Investigating Choice Reaction Time Data

    ERIC Educational Resources Information Center

    Schweizer, Karl

    2006-01-01

    A model with fixed relations between manifest and latent variables is presented for investigating choice reaction time data. The numbers for fixation originate from the polynomial function. Two options are considered: the component-based (1 latent variable for each component of the polynomial function) and composite-based options (1 latent…

  3. The Chinese Remainder Problem and Polynomial Interpolation.

    DTIC Science & Technology

    1986-08-01

    27709 86a 10 7 16 UNIVERSITY OF WISCONSIN-MADISON MATEMATICS RESEARCH CENTER THE CHINESE REMAINDER PROBLEM AND POLYNOMIAL INTERPOLATION Isaac J...Classifications: lOA10, 41A10 Key Words: Chinese Remainder Theorem, Polynomial Interpolation Work Unit Number 3 (Numerical Analysis and Scientific...Street Wisconsin Numerical Analysis and Madison, Wisconsin 53705 Scientific Computing " 11. CONTROLLING OFFICE NAME AND ADDRESS 12. REPORT DATE U. S

  4. Gauss-Lobatto to Bernstein polynomials transformation

    NASA Astrophysics Data System (ADS)

    Coluccio, Loredana; Eisinberg, Alfredo; Fedele, Giuseppe

    2008-12-01

    The aim of this paper is to transform a polynomial expressed as a weighted sum of discrete orthogonal polynomials on Gauss-Lobatto nodes into Bernstein form and vice versa. Explicit formulas and recursion expressions are derived. Moreover, an efficient algorithm for the transformation from Gauss-Lobatto to Bernstein is proposed. Finally, in order to show the robustness of the proposed algorithm, experimental results are reported.

  5. Extending Romanovski polynomials in quantum mechanics

    NASA Astrophysics Data System (ADS)

    Quesne, C.

    2013-12-01

    Some extensions of the (third-class) Romanovski polynomials (also called Romanovski/pseudo-Jacobi polynomials), which appear in bound-state wavefunctions of rationally extended Scarf II and Rosen-Morse I potentials, are considered. For the former potentials, the generalized polynomials satisfy a finite orthogonality relation, while for the latter an infinite set of relations among polynomials with degree-dependent parameters is obtained. Both types of relations are counterparts of those known for conventional polynomials. In the absence of any direct information on the zeros of the Romanovski polynomials present in denominators, the regularity of the constructed potentials is checked by taking advantage of the disconjugacy properties of second-order differential equations of Schrödinger type. It is also shown that on going from Scarf I to Scarf II or from Rosen-Morse II to Rosen-Morse I potentials, the variety of rational extensions is narrowed down from types I, II, and III to type III only.

  6. Baxter Operator Formalism for Macdonald Polynomials

    NASA Astrophysics Data System (ADS)

    Gerasimov, Anton; Lebedev, Dimitri; Oblezin, Sergey

    2013-11-01

    We develop basic constructions of the Baxter operator formalism for the Macdonald polynomials associated with root systems of type A. Precisely, we construct a bispectral pair of mutually commuting Baxter operators such that the Macdonald polynomials are their common eigenfunctions. The bispectral pair of Baxter operators is closely related to the bispectral pair of recursive operators for Macdonald polynomials leading to various families of their integral representations. We also construct the Baxter operator formalism for the q-deformed {{gl}_{ell+1}} -Whittaker functions and the Jack polynomials obtained by degenerations of the Macdonald polynomials associated with the type A ℓ root system. This note provides a generalization of our previous results on the Baxter operator formalism for the Whittaker functions. It was demonstrated previously that Baxter operator formalism for the Whittaker functions has deep connections with representation theory. In particular, the Baxter operators should be considered as elements of appropriate spherical Hecke algebras and their eigenvalues are identified with local Archimedean L-factors associated with admissible representations of reductive groups over {{R}}. We expect that the Baxter operator formalism for the Macdonald polynomials has an interpretation in representation theory over higher-dimensional local/global fields.

  7. Tensor calculus in polar coordinates using Jacobi polynomials

    NASA Astrophysics Data System (ADS)

    Vasil, Geoffrey M.; Burns, Keaton J.; Lecoanet, Daniel; Olver, Sheehan; Brown, Benjamin P.; Oishi, Jeffrey S.

    2016-11-01

    Spectral methods are an efficient way to solve partial differential equations on domains possessing certain symmetries. The utility of a method depends strongly on the choice of spectral basis. In this paper we describe a set of bases built out of Jacobi polynomials, and associated operators for solving scalar, vector, and tensor partial differential equations in polar coordinates on a unit disk. By construction, the bases satisfy regularity conditions at r = 0 for any tensorial field. The coordinate singularity in a disk is a prototypical case for many coordinate singularities. The work presented here extends to other geometries. The operators represent covariant derivatives, multiplication by azimuthally symmetric functions, and the tensorial relationship between fields. These arise naturally from relations between classical orthogonal polynomials, and form a Heisenberg algebra. Other past work uses more specific polynomial bases for solving equations in polar coordinates. The main innovation in this paper is to use a larger set of possible bases to achieve maximum bandedness of linear operations. We provide a series of applications of the methods, illustrating their ease-of-use and accuracy.

  8. On λ-Bell polynomials associated with umbral calculus

    NASA Astrophysics Data System (ADS)

    Kim, T.; Kim, D. S.

    2017-01-01

    In this paper, we introduce some new λ-Bell polynomials and Bell polynomials of the second kind and investigate properties of these polynomials. Using our investigation, we derive some new identities for the two kinds of λ-Bell polynomials arising from umbral calculus.

  9. Using a parity-sensitive sieve to count prime values of a polynomial.

    PubMed

    Friedlander, J; Iwaniec, H

    1997-02-18

    It is expected that any irreducible polynomial with integer coefficients assumes infinitely many prime values provided that it satisfies some obvious local conditions. Moreover, it is expected that the frequency of these primes obeys a simple asymptotic law. This has however been proven for only a few special classes of polynomials. In the most famous unsolved cases the sequence of values is "thin" in the sense that it contains fewer than N(theta) integers up to N for some constant theta < 1. Quite generally it seems to be difficult to show the infinitude of primes in a given thin integer sequence and there is no polynomial for which this has hitherto been done. The polynomial x(2) + y(4) is an example of such a thin sequence; here, specifically, theta = 3/4. We report here the development of new methods that rigorously demonstrate the asymptotic formula in the case of this polynomial and that are applicable to an infinite class of polynomials to which this one belongs. The proof is based partly on a new sieve method that breaks the well-known parity problem of sieve theory and partly on a careful harmonic analysis of the special properties of biquadratic polynomial sequences.

  10. Modeling a Temporally Evolving Atmosphere with Zernike Polynomials

    DTIC Science & Technology

    2012-09-01

    Systems, SPIE Press, 2010 5. J.W. Goodman , Statistical Optics , John Wiley & Sons, Inc., New York, NY, 1985 6. R. J. Noll, "Zernike Polynomials and...temporal model of phase screen generation. The long standing Fourier transform (FT) based method assumes the frozen flow hypothesis holds, where... optical tilt. 1. INTRODUCTION For conventional imaging systems, Geosynchronous Earth Orbit (GEO) space objects cannot be resolved due to

  11. Zeros of Jones polynomials for families of knots and links

    NASA Astrophysics Data System (ADS)

    Chang, S.-C.; Shrock, R.

    2001-12-01

    We calculate Jones polynomials VL( t) for several families of alternating knots and links by computing the Tutte polynomials T( G, x, y) for the associated graphs G and then obtaining VL( t) as a special case of the Tutte polynomial. For each of these families we determine the zeros of the Jones polynomial, including the accumulation set in the limit of infinitely many crossings. A discussion is also given of the calculation of Jones polynomials for non-alternating links.

  12. Quasi-kernel polynomials and convergence results for quasi-minimal residual iterations

    NASA Technical Reports Server (NTRS)

    Freund, Roland W.

    1992-01-01

    Recently, Freund and Nachtigal have proposed a novel polynominal-based iteration, the quasi-minimal residual algorithm (QMR), for solving general nonsingular non-Hermitian linear systems. Motivated by the QMR method, we have introduced the general concept of quasi-kernel polynomials, and we have shown that the QMR algorithm is based on a particular instance of quasi-kernel polynomials. In this paper, we continue our study of quasi-kernel polynomials. In particular, we derive bounds for the norms of quasi-kernel polynomials. These results are then applied to obtain convergence theorems both for the QMR method and for a transpose-free variant of QMR, the TFQMR algorithm.

  13. Quantum circuits and low-degree polynomials over {{{F}}_\\mathsf{2}}

    NASA Astrophysics Data System (ADS)

    Montanaro, Ashley

    2017-02-01

    In this work we explore a correspondence between quantum circuits and low-degree polynomials over the finite field {{{F}}2} . Any quantum circuit made up of Hadamard, Z, controlled-Z and controlled-controlled-Z gates gives rise to a degree-3 polynomial over {{{F}}2} such that calculating quantum circuit amplitudes is equivalent to counting zeroes of the corresponding polynomial. We exploit this connection, which is especially clean and simple for this particular gate set, in two directions. First, we give proofs of classical hardness results based on quantum circuit concepts. Second, we find efficient classical simulation algorithms for certain classes of quantum circuits based on efficient algorithms for classes of polynomials.

  14. WalRK two component system of Bacillus anthracis responds to temperature and antibiotic stress.

    PubMed

    Dhiman, Alisha; Gopalani, Monisha; Bhatnagar, Rakesh

    2015-04-17

    WalRK Two Component System (TCS) of Bacillus anthracis forms a functional TCS. This report elaborates upon the WalRK genomic architecture, promoter structure, promoter activity and expression under various stress conditions in B. anthracis. 5' RACE located the WalRK functional promoter within 317 bp region upstream of WalR. Reporter gene assays demonstrated maximal promoter activity during early growth phases indicating utility in exponential stages of growth. qRT-PCR showed upregulation of WalRK transcripts during temperature and antibiotic stress. However, WalR overexpression did not affect the tested antibiotic MIC values in B. anthracis. Collectively, these results confirm that WalRK responds to cell envelope stress in B. anthracis.

  15. Knot polynomials in the first non-symmetric representation

    NASA Astrophysics Data System (ADS)

    Anokhina, A.; Mironov, A.; Morozov, A.; Morozov, And.

    2014-05-01

    We describe the explicit form and the hidden structure of the answer for the HOMFLY polynomial for the figure-8 and some other 3-strand knots in representation [21]. This is the first result for non-torus knots beyond (anti)symmetric representations, and its evaluation is far more complicated. We provide a whole variety of different arguments, allowing one to guess the answer for the figure-8 knot, which can be also partly used in more complicated situations. Finally we report the result of exact calculation for figure-8 and some other 3-strand knots based on the previously developed sophisticated technique of multi-strand calculations. We also discuss a formula for the superpolynomial in representation [21] for the figure-8 knot, which heavily relies on the conjectural form of superpolynomial expansion nearby the special polynomial point. Generalizations and details will be presented elsewhere.

  16. Extending a Property of Cubic Polynomials to Higher-Degree Polynomials

    ERIC Educational Resources Information Center

    Miller, David A.; Moseley, James

    2012-01-01

    In this paper, the authors examine a property that holds for all cubic polynomials given two zeros. This property is discovered after reviewing a variety of ways to determine the equation of a cubic polynomial given specific conditions through algebra and calculus. At the end of the article, they will connect the property to a very famous method…

  17. Extending a Property of Cubic Polynomials to Higher-Degree Polynomials

    ERIC Educational Resources Information Center

    Miller, David A.; Moseley, James

    2012-01-01

    In this paper, the authors examine a property that holds for all cubic polynomials given two zeros. This property is discovered after reviewing a variety of ways to determine the equation of a cubic polynomial given specific conditions through algebra and calculus. At the end of the article, they will connect the property to a very famous method…

  18. Quantum models with energy-dependent potentials solvable in terms of exceptional orthogonal polynomials

    NASA Astrophysics Data System (ADS)

    Schulze-Halberg, Axel; Roy, Pinaki

    2017-03-01

    We construct energy-dependent potentials for which the Schrödinger equations admit solutions in terms of exceptional orthogonal polynomials. Our method of construction is based on certain point transformations, applied to the equations of exceptional Hermite, Jacobi and Laguerre polynomials. We present several examples of boundary-value problems with energy-dependent potentials that admit a discrete spectrum and the corresponding normalizable solutions in closed form.

  19. New separated polynomial solutions to the Zernike system on the unit disk and interbasis expansion

    NASA Astrophysics Data System (ADS)

    Pogosyan, George S.; Wolf, Kurt Bernardo; Yakhno, Alexander

    2017-10-01

    The differential equation proposed by Frits Zernike to obtain a basis of polynomial orthogonal solutions on the the unit disk to classify wavefront aberrations in circular pupils, is shown to have a set of new orthonormal solution bases, involving Legendre and Gegenbauer polynomials, in non-orthogonal coordinates close to Cartesian ones. We find the overlaps between the original Zernike basis and a representative of the new set, which turn out to be Clebsch-Gordan coefficients.

  20. Recognition of Arabic Sign Language Alphabet Using Polynomial Classifiers

    NASA Astrophysics Data System (ADS)

    Assaleh, Khaled; Al-Rousan, M.

    2005-12-01

    Building an accurate automatic sign language recognition system is of great importance in facilitating efficient communication with deaf people. In this paper, we propose the use of polynomial classifiers as a classification engine for the recognition of Arabic sign language (ArSL) alphabet. Polynomial classifiers have several advantages over other classifiers in that they do not require iterative training, and that they are highly computationally scalable with the number of classes. Based on polynomial classifiers, we have built an ArSL system and measured its performance using real ArSL data collected from deaf people. We show that the proposed system provides superior recognition results when compared with previously published results using ANFIS-based classification on the same dataset and feature extraction methodology. The comparison is shown in terms of the number of misclassified test patterns. The reduction in the rate of misclassified patterns was very significant. In particular, we have achieved a 36% reduction of misclassifications on the training data and 57% on the test data.

  1. Cusp Catastrophe Polynomial Model: Power and Sample Size Estimation

    PubMed Central

    Chen, Ding-Geng(Din); Chen, Xinguang(Jim); Lin, Feng; Tang, Wan; Lio, Y. L.; Guo, (Tammy) Yuanyuan

    2016-01-01

    Guastello’s polynomial regression method for solving cusp catastrophe model has been widely applied to analyze nonlinear behavior outcomes. However, no statistical power analysis for this modeling approach has been reported probably due to the complex nature of the cusp catastrophe model. Since statistical power analysis is essential for research design, we propose a novel method in this paper to fill in the gap. The method is simulation-based and can be used to calculate statistical power and sample size when Guastello’s polynomial regression method is used to cusp catastrophe modeling analysis. With this novel approach, a power curve is produced first to depict the relationship between statistical power and samples size under different model specifications. This power curve is then used to determine sample size required for specified statistical power. We verify the method first through four scenarios generated through Monte Carlo simulations, and followed by an application of the method with real published data in modeling early sexual initiation among young adolescents. Findings of our study suggest that this simulation-based power analysis method can be used to estimate sample size and statistical power for Guastello’s polynomial regression method in cusp catastrophe modeling. PMID:27158562

  2. Cusp Catastrophe Polynomial Model: Power and Sample Size Estimation.

    PubMed

    Chen, Ding-Geng Din; Chen, Xinguang Jim; Lin, Feng; Tang, Wan; Lio, Y L; Guo, Tammy Yuanyuan

    2014-12-01

    Guastello's polynomial regression method for solving cusp catastrophe model has been widely applied to analyze nonlinear behavior outcomes. However, no statistical power analysis for this modeling approach has been reported probably due to the complex nature of the cusp catastrophe model. Since statistical power analysis is essential for research design, we propose a novel method in this paper to fill in the gap. The method is simulation-based and can be used to calculate statistical power and sample size when Guastello's polynomial regression method is used to cusp catastrophe modeling analysis. With this novel approach, a power curve is produced first to depict the relationship between statistical power and samples size under different model specifications. This power curve is then used to determine sample size required for specified statistical power. We verify the method first through four scenarios generated through Monte Carlo simulations, and followed by an application of the method with real published data in modeling early sexual initiation among young adolescents. Findings of our study suggest that this simulation-based power analysis method can be used to estimate sample size and statistical power for Guastello's polynomial regression method in cusp catastrophe modeling.

  3. Chemical Reaction Networks for Computing Polynomials.

    PubMed

    Salehi, Sayed Ahmad; Parhi, Keshab K; Riedel, Marc D

    2017-01-20

    Chemical reaction networks (CRNs) provide a fundamental model in the study of molecular systems. Widely used as formalism for the analysis of chemical and biochemical systems, CRNs have received renewed attention as a model for molecular computation. This paper demonstrates that, with a new encoding, CRNs can compute any set of polynomial functions subject only to the limitation that these functions must map the unit interval to itself. These polynomials can be expressed as linear combinations of Bernstein basis polynomials with positive coefficients less than or equal to 1. In the proposed encoding approach, each variable is represented using two molecular types: a type-0 and a type-1. The value is the ratio of the concentration of type-1 molecules to the sum of the concentrations of type-0 and type-1 molecules. The proposed encoding naturally exploits the expansion of a power-form polynomial into a Bernstein polynomial. Molecular encoders for converting any input in a standard representation to the fractional representation as well as decoders for converting the computed output from the fractional to a standard representation are presented. The method is illustrated first for generic CRNs; then chemical reactions designed for an example are mapped to DNA strand-displacement reactions.

  4. Transcriptional regulation of SlPYL, SlPP2C, and SlSnRK2 gene families encoding ABA signal core components during tomato fruit development and drought stress

    PubMed Central

    Sun, Liang; Wang, Yan-Ping; Chen, Pei; Ren, Jie; Ji, Kai; Li, Qian; Li, Ping; Dai, Sheng-Jie; Leng, Ping

    2011-01-01

    In order to characterize the potential transcriptional regulation of core components of abscisic acid (ABA) signal transduction in tomato fruit development and drought stress, eight SlPYL (ABA receptor), seven SlPP2C (type 2C protein phosphatase), and eight SlSnRK2 (subfamily 2 of SNF1-related kinases) full-length cDNA sequences were isolated from the tomato nucleotide database of NCBI GenBank. All SlPYL, SlPP2C, and SlSnRK2 genes obtained are homologous to Arabidopsis AtPYL, AtPP2C, and AtSnRK2 genes, respectively. Based on phylogenetic analysis, SlPYLs and SlSnRK2s were clustered into three subfamilies/subclasses, and all SlPP2Cs belonged to PP2C group A. Within the SlPYL gene family, SlPYL1, SlPYL2, SlPYL3, and SlPYL6 were the major genes involved in the regulation of fruit development. Among them, SlPYL1 and SlPYL2 were expressed at high levels throughout the process of fruit development and ripening; SlPYL3 was strongly expressed at the immature green (IM) and mature green (MG) stages, while SlPYL6 was expressed strongly at the IM and red ripe (RR) stages. Within the SlPP2C gene family, the expression of SlPP2C, SlPP2C3, and SlPP2C4 increased after the MG stage; SlPP2C1 and SlPP2C5 peaked at the B3 stage, while SlPP2C2 and SlPP2C6 changed little during fruit development. Within the SlSnRK2 gene family, the expression of SlSnRK2.2, SlSnRK2.3, SlSnRK2.4, and SlSnRK2C was higher than that of other members during fruit development. Additionally, most SlPYL genes were down-regulated, while most SlPP2C and SlSnRK2 genes were up-regulated by dehydration in tomato leaf. PMID:21873532

  5. Transcriptional regulation of SlPYL, SlPP2C, and SlSnRK2 gene families encoding ABA signal core components during tomato fruit development and drought stress.

    PubMed

    Sun, Liang; Wang, Yan-Ping; Chen, Pei; Ren, Jie; Ji, Kai; Li, Qian; Li, Ping; Dai, Sheng-Jie; Leng, Ping

    2011-11-01

    In order to characterize the potential transcriptional regulation of core components of abscisic acid (ABA) signal transduction in tomato fruit development and drought stress, eight SlPYL (ABA receptor), seven SlPP2C (type 2C protein phosphatase), and eight SlSnRK2 (subfamily 2 of SNF1-related kinases) full-length cDNA sequences were isolated from the tomato nucleotide database of NCBI GenBank. All SlPYL, SlPP2C, and SlSnRK2 genes obtained are homologous to Arabidopsis AtPYL, AtPP2C, and AtSnRK2 genes, respectively. Based on phylogenetic analysis, SlPYLs and SlSnRK2s were clustered into three subfamilies/subclasses, and all SlPP2Cs belonged to PP2C group A. Within the SlPYL gene family, SlPYL1, SlPYL2, SlPYL3, and SlPYL6 were the major genes involved in the regulation of fruit development. Among them, SlPYL1 and SlPYL2 were expressed at high levels throughout the process of fruit development and ripening; SlPYL3 was strongly expressed at the immature green (IM) and mature green (MG) stages, while SlPYL6 was expressed strongly at the IM and red ripe (RR) stages. Within the SlPP2C gene family, the expression of SlPP2C, SlPP2C3, and SlPP2C4 increased after the MG stage; SlPP2C1 and SlPP2C5 peaked at the B3 stage, while SlPP2C2 and SlPP2C6 changed little during fruit development. Within the SlSnRK2 gene family, the expression of SlSnRK2.2, SlSnRK2.3, SlSnRK2.4, and SlSnRK2C was higher than that of other members during fruit development. Additionally, most SlPYL genes were down-regulated, while most SlPP2C and SlSnRK2 genes were up-regulated by dehydration in tomato leaf.

  6. Local polynomial estimation of heteroscedasticity in a multivariate linear regression model and its applications in economics.

    PubMed

    Su, Liyun; Zhao, Yanyong; Yan, Tianshun; Li, Fenglan

    2012-01-01

    Multivariate local polynomial fitting is applied to the multivariate linear heteroscedastic regression model. Firstly, the local polynomial fitting is applied to estimate heteroscedastic function, then the coefficients of regression model are obtained by using generalized least squares method. One noteworthy feature of our approach is that we avoid the testing for heteroscedasticity by improving the traditional two-stage method. Due to non-parametric technique of local polynomial estimation, it is unnecessary to know the form of heteroscedastic function. Therefore, we can improve the estimation precision, when the heteroscedastic function is unknown. Furthermore, we verify that the regression coefficients is asymptotic normal based on numerical simulations and normal Q-Q plots of residuals. Finally, the simulation results and the local polynomial estimation of real data indicate that our approach is surely effective in finite-sample situations.

  7. Combining freeform optics and curved detectors for wide field imaging: a polynomial approach over squared aperture.

    PubMed

    Muslimov, Eduard; Hugot, Emmanuel; Jahn, Wilfried; Vives, Sebastien; Ferrari, Marc; Chambion, Bertrand; Henry, David; Gaschet, Christophe

    2017-06-26

    In the recent years a significant progress was achieved in the field of design and fabrication of optical systems based on freeform optical surfaces. They provide a possibility to build fast, wide-angle and high-resolution systems, which are very compact and free of obscuration. However, the field of freeform surfaces design techniques still remains underexplored. In the present paper we use the mathematical apparatus of orthogonal polynomials defined over a square aperture, which was developed before for the tasks of wavefront reconstruction, to describe shape of a mirror surface. Two cases, namely Legendre polynomials and generalization of the Zernike polynomials on a square, are considered. The potential advantages of these polynomials sets are demonstrated on example of a three-mirror unobscured telescope with F/# = 2.5 and FoV = 7.2x7.2°. In addition, we discuss possibility of use of curved detectors in such a design.

  8. Minimal residual method stronger than polynomial preconditioning

    SciTech Connect

    Faber, V.; Joubert, W.; Knill, E.

    1994-12-31

    Two popular methods for solving symmetric and nonsymmetric systems of equations are the minimal residual method, implemented by algorithms such as GMRES, and polynomial preconditioning methods. In this study results are given on the convergence rates of these methods for various classes of matrices. It is shown that for some matrices, such as normal matrices, the convergence rates for GMRES and for the optimal polynomial preconditioning are the same, and for other matrices such as the upper triangular Toeplitz matrices, it is at least assured that if one method converges then the other must converge. On the other hand, it is shown that matrices exist for which restarted GMRES always converges but any polynomial preconditioning of corresponding degree makes no progress toward the solution for some initial error. The implications of these results for these and other iterative methods are discussed.

  9. Fitting parametrized polynomials with scattered surface data.

    PubMed

    van Ruijven, L J; Beek, M; van Eijden, T M

    1999-07-01

    Currently used joint-surface models require the measurements to be structured according to a grid. With the currently available tracking devices a large quantity of unstructured surface points can be measured in a relatively short time. In this paper a method is presented to fit polynomial functions to three-dimensional unstructured data points. To test the method spherical, cylindrical, parabolic, hyperbolic, exponential, logarithmic, and sellar surfaces with different undulations were used. The resulting polynomials were compared with the original shapes. The results show that even complex joint surfaces can be modelled with polynomial functions. In addition, the influence of noise and the number of data points was also analyzed. From a surface (diam: 20 mm) which is measured with a precision of 0.2 mm a model can be constructed with a precision of 0.02 mm.

  10. Supersymmetric pairing of kinks for polynomial nonlinearities

    SciTech Connect

    Rosu, H.C.; Cornejo-Perez, O.

    2005-04-01

    We show how one can obtain kink solutions of ordinary differential equations with polynomial nonlinearities by an efficient factorization procedure directly related to the factorization of their nonlinear polynomial part. We focus on reaction-diffusion equations in the traveling frame and damped-anharmonic-oscillator equations. We also report an interesting pairing of the kink solutions, a result obtained by reversing the factorization brackets in the supersymmetric quantum-mechanical style. In this way, one gets ordinary differential equations with a different polynomial nonlinearity possessing kink solutions of different width but propagating at the same velocity as the kinks of the original equation. This pairing of kinks could have many applications. We illustrate the mathematical procedure with several important cases, among which are the generalized Fisher equation, the FitzHugh-Nagumo equation, and the polymerization fronts of microtubules.

  11. Polynomial solution of quantum Grassmann matrices

    NASA Astrophysics Data System (ADS)

    Tierz, Miguel

    2017-05-01

    We study a model of quantum mechanical fermions with matrix-like index structure (with indices N and L) and quartic interactions, recently introduced by Anninos and Silva. We compute the partition function exactly with q-deformed orthogonal polynomials (Stieltjes-Wigert polynomials), for different values of L and arbitrary N. From the explicit evaluation of the thermal partition function, the energy levels and degeneracies are determined. For a given L, the number of states of different energy is quadratic in N, which implies an exponential degeneracy of the energy levels. We also show that at high-temperature we have a Gaussian matrix model, which implies a symmetry that swaps N and L, together with a Wick rotation of the spectral parameter. In this limit, we also write the partition function, for generic L and N, in terms of a single generalized Hermite polynomial.

  12. A robust polynomial principal component analysis for seismic noise attenuation

    NASA Astrophysics Data System (ADS)

    Wang, Yuchen; Lu, Wenkai; Wang, Benfeng; Liu, Lei

    2016-12-01

    Random and coherent noise attenuation is a significant aspect of seismic data processing, especially for pre-stack seismic data flattened by normal moveout correction or migration. Signal extraction is widely used for pre-stack seismic noise attenuation. Principle component analysis (PCA), one of the multi-channel filters, is a common tool to extract seismic signals, which can be realized by singular value decomposition (SVD). However, when applying the traditional PCA filter to seismic signal extraction, the result is unsatisfactory with some artifacts when the seismic data is contaminated by random and coherent noise. In order to directly extract the desired signal and fix those artifacts at the same time, we take into consideration the amplitude variation with offset (AVO) property and thus propose a robust polynomial PCA algorithm. In this algorithm, a polynomial constraint is used to optimize the coefficient matrix. In order to simplify this complicated problem, a series of sub-optimal problems are designed and solved iteratively. After that, the random and coherent noise can be effectively attenuated simultaneously. Applications on synthetic and real data sets note that our proposed algorithm can better suppress random and coherent noise and have a better performance on protecting the desired signals, compared with the local polynomial fitting, conventional PCA and a L1-norm based PCA method.

  13. Partitioned RK-type methods for computational fluid dynamics

    NASA Astrophysics Data System (ADS)

    Wensch, Jörg; Naumann, Andreas

    2017-07-01

    The simulation of atmospheric motion requires to deal with phenomena on different time scales. This is inherent for systems of hyperbolic type where waves travel each with its own characteristic wave speed. Here, the crucial phenomena are advective waves vs. sound waves. We propose a splitting approach where the terms responsible for fast and slow waves are easily identified in the governing equations. Partitioned RK-Type methods are taylored to this situation. We have developed methods where the fast waves are treated by a variable number of micro steps where the micro step size is taylored to the stability requirements. Order conditions are derived for the overall integration procedure. This requires the discussion of two cases: Order conditions for arbitrary numbers of micro steps and order conditions for a fixed number of micro steps. We present a first collection of methods which extend our MIS methods where order is established for an infinite number of small steps.

  14. Enhancing sparsity of Hermite polynomial expansions by iterative rotations

    SciTech Connect

    Yang, Xiu; Lei, Huan; Baker, Nathan A.; Lin, Guang

    2016-02-01

    Compressive sensing has become a powerful addition to uncertainty quantification in recent years. This paper identifies new bases for random variables through linear mappings such that the representation of the quantity of interest is more sparse with new basis functions associated with the new random variables. This sparsity increases both the efficiency and accuracy of the compressive sensing-based uncertainty quantification method. Specifically, we consider rotation- based linear mappings which are determined iteratively for Hermite polynomial expansions. We demonstrate the effectiveness of the new method with applications in solving stochastic partial differential equations and high-dimensional (O(100)) problems.

  15. Source emission-pattern polynomial representation

    NASA Astrophysics Data System (ADS)

    Flores-Hernandez, Ricardo; De Villa, Francisco

    1990-12-01

    A method to obtain accurate thickness data to characterize the emission patterns of evaporation sources is described. Thickness data is obtained through digital image processing algorithms applied to the monochromatic transmission bands digitized from a set of multilayer Fabry-Perot filters deposited on large flat circular substrates. These computer image-processed taper-thickness patterns are reduced to orthonormal polynomial series expansions in two steps, using Tschebyshev and associated Legendre polynomials. The circular glass substrates employed to characterize each type of evaporation source are kept stationary during the evaporation process of evaporation of each layer to obtain the specific thickness distribution for each type of source.

  16. Parabolic Refined Invariants and Macdonald Polynomials

    NASA Astrophysics Data System (ADS)

    Chuang, Wu-yen; Diaconescu, Duiliu-Emanuel; Donagi, Ron; Pantev, Tony

    2015-05-01

    A string theoretic derivation is given for the conjecture of Hausel, Letellier and Rodriguez-Villegas on the cohomology of character varieties with marked points. Their formula is identified with a refined BPS expansion in the stable pair theory of a local root stack, generalizing previous work of the first two authors in collaboration with Pan. Haiman's geometric construction for Macdonald polynomials is shown to emerge naturally in this context via geometric engineering. In particular this yields a new conjectural relation between Macdonald polynomials and refined local orbifold curve counting invariants. The string theoretic approach also leads to a new spectral cover construction for parabolic Higgs bundles in terms of holomorphic symplectic orbifolds.

  17. The Potts model and the Tutte polynomial

    NASA Astrophysics Data System (ADS)

    Welsh, D. J. A.; Merino, C.

    2000-03-01

    This is an invited survey on the relation between the partition function of the Potts model and the Tutte polynomial. On the assumption that the Potts model is more familiar we have concentrated on the latter and its interpretations. In particular we highlight the connections with Abelian sandpiles, counting problems on random graphs, error correcting codes, and the Ehrhart polynomial of a zonotope. Where possible we use the mean field and square lattice as illustrations. We also discuss in some detail the complexity issues involved.

  18. High degree interpolation polynomial in Newton form

    NASA Technical Reports Server (NTRS)

    Tal-Ezer, Hillel

    1988-01-01

    Polynomial interpolation is an essential subject in numerical analysis. Dealing with a real interval, it is well known that even if f(x) is an analytic function, interpolating at equally spaced points can diverge. On the other hand, interpolating at the zeroes of the corresponding Chebyshev polynomial will converge. Using the Newton formula, this result of convergence is true only on the theoretical level. It is shown that the algorithm which computes the divided differences is numerically stable only if: (1) the interpolating points are arranged in a different order, and (2) the size of the interval is 4.

  19. Location of Zeros of Wiener and Distance Polynomials

    PubMed Central

    Dehmer, Matthias; Ilić, Aleksandar

    2012-01-01

    The geometry of polynomials explores geometrical relationships between the zeros and the coefficients of a polynomial. A classical problem in this theory is to locate the zeros of a given polynomial by determining disks in the complex plane in which all its zeros are situated. In this paper, we infer bounds for general polynomials and apply classical and new results to graph polynomials namely Wiener and distance polynomials whose zeros have not been yet investigated. Also, we examine the quality of such bounds by considering four graph classes and interpret the results. PMID:22438861

  20. RK-33 Radiosensitizes Prostate Cancer Cells by Blocking the RNA Helicase DDX3

    PubMed Central

    Xie, Min; Vesuna, Farhad; Tantravedi, Saritha; Bol, Guus M.; Heerma van Voss, Marise R.; Nugent, Katriana; Malek, Reem; Gabrielson, Kathleen; van Diest, Paul J.; Tran, Phuoc T.; Raman, Venu

    2017-01-01

    Despite advances in diagnosis and treatment, prostate cancer is the most prevalent cancer in males and the second highest cause of cancer-related mortality. We identified an RNA helicase gene, DDX3 (DDX3X), which is overexpressed in prostate cancers, and whose expression is directly correlated with high Gleason scores. Knockdown of DDX3 in the aggressive prostate cancer cell lines DU145 and 22Rv1 resulted in significantly reduced clonogenicity. To target DDX3, we rationally designed a small molecule, RK-33, which docks into the ATP-binding domain of DDX3. Functional studies indicated that RK-33 preferentially bound to DDX3 and perturbed its activity. RK-33 treatment of prostate cancer cell lines DU145, 22Rv1, and LNCaP (which have high DDX3 levels) decreased proliferation and induced a G1 phase cell-cycle arrest. Conversely, the low DDX3–expressing cell line, PC3, exhibited few changes following RK-33 treatment. Importantly, combination studies using RK-33 and radiation exhibited synergistic effects both in vitro and in a xenograft model of prostate cancer demonstrating the role of RK-33 as a radiosensitizer. Taken together, these results indicate that blocking DDX3 by RK-33 in combination with radiation treatment is a viable option for treating locally advanced prostate cancer. PMID:27634756

  1. Real-time task recognition in cataract surgery videos using adaptive spatiotemporal polynomials.

    PubMed

    Quellec, Gwénolé; Lamard, Mathieu; Cochener, Béatrice; Cazuguel, Guy

    2015-04-01

    This paper introduces a new algorithm for recognizing surgical tasks in real-time in a video stream. The goal is to communicate information to the surgeon in due time during a video-monitored surgery. The proposed algorithm is applied to cataract surgery, which is the most common eye surgery. To compensate for eye motion and zoom level variations, cataract surgery videos are first normalized. Then, the motion content of short video subsequences is characterized with spatiotemporal polynomials: a multiscale motion characterization based on adaptive spatiotemporal polynomials is presented. The proposed solution is particularly suited to characterize deformable moving objects with fuzzy borders, which are typically found in surgical videos. Given a target surgical task, the system is trained to identify which spatiotemporal polynomials are usually extracted from videos when and only when this task is being performed. These key spatiotemporal polynomials are then searched in new videos to recognize the target surgical task. For improved performances, the system jointly adapts the spatiotemporal polynomial basis and identifies the key spatiotemporal polynomials using the multiple-instance learning paradigm. The proposed system runs in real-time and outperforms the previous solution from our group, both for surgical task recognition ( Az = 0.851 on average, as opposed to Az = 0.794 previously) and for the joint segmentation and recognition of surgical tasks ( Az = 0.856 on average, as opposed to Az = 0.832 previously).

  2. Classroom Aids for Mathematics, Volume 1: Polynomials.

    ERIC Educational Resources Information Center

    Holden, Herbert L.

    The goal of this pamphlet is to provide instructors of various scientific disciplines with mathematically accurate graphs of elementary polynomial functions. The figures in this pamphlet are intended to provide suitable material for the preparation of classroom handouts and overhead transparencies. In addition, sample sets of exercises are…

  3. A recursive algorithm for Zernike polynomials

    NASA Technical Reports Server (NTRS)

    Davenport, J. W.

    1982-01-01

    The analysis of a function defined on a rotationally symmetric system, with either a circular or annular pupil is discussed. In order to numerically analyze such systems it is typical to expand the given function in terms of a class of orthogonal polynomials. Because of their particular properties, the Zernike polynomials are especially suited for numerical calculations. Developed is a recursive algorithm that can be used to generate the Zernike polynomials up to a given order. The algorithm is recursively defined over J where R(J,N) is the Zernike polynomial of degree N obtained by orthogonalizing the sequence R(J), R(J+2), ..., R(J+2N) over (epsilon, 1). The terms in the preceding row - the (J-1) row - up to the N+1 term is needed for generating the (J,N)th term. Thus, the algorith generates an upper left-triangular table. This algorithm was placed in the computer with the necessary support program also included.

  4. On solvable Dirac equation with polynomial potentials

    SciTech Connect

    Stachowiak, Tomasz

    2011-01-15

    One-dimensional Dirac equation is analyzed with regard to the existence of exact (or closed-form) solutions for polynomial potentials. The notion of Liouvillian functions is used to define solvability, and it is shown that except for the linear potentials the equation in question is not solvable.

  5. Simulating Nonequilibrium Radiation via Orthogonal Polynomial Refinement

    DTIC Science & Technology

    2015-01-07

    resolution orthogonal polynomial refinement technique for this multi-disciplinary science. Through the computational mathematics basic research, a...thus the phenomenon must be modeled [1-4]. In addition, the chemical species concentrations and its associated thermodynamic states of an inhomogeneous... thermodynamic state and compositions of the flow medium. The required optical parameters for the nonequilibrium phenomena simulation need to be determined

  6. Optimization of Cubic Polynomial Functions without Calculus

    ERIC Educational Resources Information Center

    Taylor, Ronald D., Jr.; Hansen, Ryan

    2008-01-01

    In algebra and precalculus courses, students are often asked to find extreme values of polynomial functions in the context of solving an applied problem; but without the notion of derivative, something is lost. Either the functions are reduced to quadratics, since students know the formula for the vertex of a parabola, or solutions are…

  7. Polynomial Asymptotes of the Second Kind

    ERIC Educational Resources Information Center

    Dobbs, David E.

    2011-01-01

    This note uses the analytic notion of asymptotic functions to study when a function is asymptotic to a polynomial function. Along with associated existence and uniqueness results, this kind of asymptotic behaviour is related to the type of asymptote that was recently defined in a more geometric way. Applications are given to rational functions and…

  8. Polynomial Asymptotes of the Second Kind

    ERIC Educational Resources Information Center

    Dobbs, David E.

    2011-01-01

    This note uses the analytic notion of asymptotic functions to study when a function is asymptotic to a polynomial function. Along with associated existence and uniqueness results, this kind of asymptotic behaviour is related to the type of asymptote that was recently defined in a more geometric way. Applications are given to rational functions and…

  9. Least squares polynomial fits and their accuracy

    NASA Technical Reports Server (NTRS)

    Lear, W. M.

    1977-01-01

    Equations are presented which attempt to fit least squares polynomials to tables of date. It is concluded that much data are needed to reduce the measurement error standard deviation by a significant amount, however at certain points great accuracy is attained.

  10. On Arithmetic-Geometric-Mean Polynomials

    ERIC Educational Resources Information Center

    Griffiths, Martin; MacHale, Des

    2017-01-01

    We study here an aspect of an infinite set "P" of multivariate polynomials, the elements of which are associated with the arithmetic-geometric-mean inequality. In particular, we show in this article that there exist infinite subsets of probability "P" for which every element may be expressed as a finite sum of squares of real…

  11. Quantum chaotic dynamics and random polynomials

    SciTech Connect

    Bogomolny, E.; Bohigas, O.; Leboeuf, P.

    1996-12-01

    We investigate the distribution of roots of polynomials of high degree with random coefficients which, among others, appear naturally in the context of {open_quotes}quantum chaotic dynamics.{close_quotes} It is shown that under quite general conditions their roots tend to concentrate near the unit circle in the complex plane. In order to further increase this tendency, we study in detail the particular case of self-inversive random polynomials and show that for them a finite portion of all roots lies exactly on the unit circle. Correlation functions of these roots are also computed analytically, and compared to the correlations of eigenvalues of random matrices. The problem of ergodicity of chaotic wavefunctions is also considered. For that purpose we introduce a family of random polynomials whose roots spread uniformly over phase space. While these results are consistent with random matrix theory predictions, they provide a new and different insight into the problem of quantum ergodicity Special attention is devoted to the role of symmetries in the distribution of roots of random polynomials.

  12. On Arithmetic-Geometric-Mean Polynomials

    ERIC Educational Resources Information Center

    Griffiths, Martin; MacHale, Des

    2017-01-01

    We study here an aspect of an infinite set "P" of multivariate polynomials, the elements of which are associated with the arithmetic-geometric-mean inequality. In particular, we show in this article that there exist infinite subsets of probability "P" for which every element may be expressed as a finite sum of squares of real…

  13. Polynomials Generated by the Fibonacci Sequence

    NASA Astrophysics Data System (ADS)

    Garth, David; Mills, Donald; Mitchell, Patrick

    2007-06-01

    The Fibonacci sequence's initial terms are F_0=0 and F_1=1, with F_n=F_{n-1}+F_{n-2} for n>=2. We define the polynomial sequence p by setting p_0(x)=1 and p_{n}(x)=x*p_{n-1}(x)+F_{n+1} for n>=1, with p_{n}(x)= sum_{k=0}^{n} F_{k+1}x^{n-k}. We call p_n(x) the Fibonacci-coefficient polynomial (FCP) of order n. The FCP sequence is distinct from the well-known Fibonacci polynomial sequence. We answer several questions regarding these polynomials. Specifically, we show that each even-degree FCP has no real zeros, while each odd-degree FCP has a unique, and (for degree at least 3) irrational, real zero. Further, we show that this sequence of unique real zeros converges monotonically to the negative of the golden ratio. Using Rouche's theorem, we prove that the zeros of the FCP's approach the golden ratio in modulus. We also prove a general result that gives the Mahler measures of an infinite subsequence of the FCP sequence whose coefficients are reduced modulo an integer m>=2. We then apply this to the case that m=L_n, the nth Lucas number, showing that the Mahler measure of the subsequence is phi^{n-1}, where phi=(1+sqrt 5)/2.

  14. Multivariate polynomial interpolation under projectivities part I

    NASA Astrophysics Data System (ADS)

    Mühlbach, G.; Gasca, M.

    1991-10-01

    In this note interpolation by real polynomials of several real variables is treated. Existence and unicity of the interpolant for knot systems being the perspective images of certain regular knot systems is discussed. Moreover, for such systems a Newton interpolation formula is derived allowing a recursive computation of the interpolant via multivariate divided differences. A numerical example is given.

  15. On the history of multivariate polynomial interpolation

    NASA Astrophysics Data System (ADS)

    Gasca, Mariano; Sauer, Thomas

    2000-10-01

    Multivariate polynomial interpolation is a basic and fundamental subject in Approximation Theory and Numerical Analysis, which has received and continues receiving not deep but constant attention. In this short survey, we review its development in the first 75 years of this century, including a pioneering paper by Kronecker in the 19th century.

  16. Evaluation of multivariate polynomials and their derivatives

    NASA Astrophysics Data System (ADS)

    Carnicer, J.; Gasca, M.

    1990-01-01

    An extension of Horner's algorithm to the evaluation of m-variate polynomials and their derivatives is obtained. The schemes of computation are represented by trees because this type of graph describes exactly in which order the computations must be done. Some examples of algorithms for one and two variables are given.

  17. Quadratically Convergent Method for Simultaneously Approaching the Roots of Polynomial Solutions of a Class of Differential Equations

    NASA Astrophysics Data System (ADS)

    Recchioni, Maria Cristina

    2001-12-01

    This paper investigates the application of the method introduced by L. Pasquini (1989) for simultaneously approaching the zeros of polynomial solutions to a class of second-order linear homogeneous ordinary differential equations with polynomial coefficients to a particular case in which these polynomial solutions have zeros symmetrically arranged with respect to the origin. The method is based on a family of nonlinear equations which is associated with a given class of differential equations. The roots of the nonlinear equations are related to the roots of the polynomial solutions of differential equations considered. Newton's method is applied to find the roots of these nonlinear equations. In (Pasquini, 1994) the nonsingularity of the roots of these nonlinear equations is studied. In this paper, following the lines in (Pasquini, 1994), the nonsingularity of the roots of these nonlinear equations is studied. More favourable results than the ones in (Pasquini, 1994) are proven in the particular case of polynomial solutions with symmetrical zeros. The method is applied to approximate the roots of Hermite-Sobolev type polynomials and Freud polynomials. A lower bound for the smallest positive root of Hermite-Sobolev type polynomials is given via the nonlinear equation. The quadratic convergence of the method is proven. A comparison with a classical method that uses the Jacobi matrices is carried out. We show that the algorithm derived by the proposed method is sometimes preferable to the classical QR type algorithms for computing the eigenvalues of the Jacobi matrices even if these matrices are real and symmetric.

  18. Absolute Radiometric Calibration of the GÖKTÜRK-2 Satellite Sensor Using Tuz GÖLÜ (landnet Site) from Ndvi Perspective

    NASA Astrophysics Data System (ADS)

    Sakarya, Ufuk; Hakkı Demirhan, İsmail; Seda Deveci, Hüsne; Teke, Mustafa; Demirkesen, Can; Küpçü, Ramazan; Feray Öztoprak, A.; Efendioğlu, Mehmet; Fehmi Şimşek, F.; Berke, Erdinç; Zübeyde Gürbüz, Sevgi

    2016-06-01

    TÜBİTAK UZAY has conducted a research study on the use of space-based satellite resources for several aspects of agriculture. Especially, there are two precision agriculture related projects: HASSAS (Widespread application of sustainable precision agriculture practices in Southeastern Anatolia Project Region (GAP) Project) and AKTAR (Smart Agriculture Feasibility Project). The HASSAS project aims to study development of precision agriculture practice in GAP region. Multi-spectral satellite imagery and aerial hyperspectral data along with ground measurements was collected to analyze data in an information system. AKTAR aims to develop models for irrigation, fertilization and spectral signatures of crops in Inner Anatolia. By the end of the project precision agriculture practices to control irrigation, fertilization, pesticide and estimation of crop yield will be developed. Analyzing the phenology of crops using NDVI is critical for the projects. For this reason, absolute radiometric calibration of the Red and NIR bands in space-based satellite sensors is an important issue. The Göktürk-2 satellite is an earth observation satellite which was designed and built in Turkey and was launched in 2012. The Göktürk-2 satellite sensor has a resolution 2.5 meters in panchromatic and 5 meters in R/G/B/NIR bands. The absolute radiometric calibration of the Göktürk-2 satellite sensor was performed via the ground-based measurements - spectra-radiometer, sun photometer, and meteorological station- in Tuz Gölü cal/val site in 2015. In this paper, the first ground-based absolute radiometric calibration results of the Göktürk-2 satellite sensor using Tuz Gölü is demonstrated. The absolute radiometric calibration results of this paper are compared with the published cross-calibration results of the Göktürk-2 satellite sensor utilizing Landsat 8 imagery. According to the experimental comparison results, the Göktürk-2 satellite sensor coefficients for red and NIR bands

  19. Some symmetric identities for the generalized Bernoulli, Euler and Genocchi polynomials associated with Hermite polynomials.

    PubMed

    Khan, Waseem A; Haroon, Hiba

    2016-01-01

    In 2008, Liu and Wang established various symmetric identities for Bernoulli, Euler and Genocchi polynomials. In this paper, we extend these identities in a unified and generalized form to families of Hermite-Bernoulli, Euler and Genocchi polynomials. The procedure followed is that of generating functions. Some relevant connections of the general theory developed here with the results obtained earlier by Pathan and Khan are also pointed out.

  20. From sequences to polynomials and back, via operator orderings

    NASA Astrophysics Data System (ADS)

    Amdeberhan, Tewodros; De Angelis, Valerio; Dixit, Atul; Moll, Victor H.; Vignat, Christophe

    2013-12-01

    Bender and Dunne ["Polynomials and operator orderings," J. Math. Phys. 29, 1727-1731 (1988)] showed that linear combinations of words qkpnqn-k, where p and q are subject to the relation qp - pq = ı, may be expressed as a polynomial in the symbol z = 1/2(qp+pq). Relations between such polynomials and linear combinations of the transformed coefficients are explored. In particular, examples yielding orthogonal polynomials are provided.

  1. Molecular mimicry regulates ABA signaling by SnRK2 kinases and PP2C phosphatases.

    PubMed

    Soon, Fen-Fen; Ng, Ley-Moy; Zhou, X Edward; West, Graham M; Kovach, Amanda; Tan, M H Eileen; Suino-Powell, Kelly M; He, Yuanzheng; Xu, Yong; Chalmers, Michael J; Brunzelle, Joseph S; Zhang, Huiming; Yang, Huaiyu; Jiang, Hualiang; Li, Jun; Yong, Eu-Leong; Cutler, Sean; Zhu, Jian-Kang; Griffin, Patrick R; Melcher, Karsten; Xu, H Eric

    2012-01-06

    Abscisic acid (ABA) is an essential hormone for plants to survive environmental stresses. At the center of the ABA signaling network is a subfamily of type 2C protein phosphatases (PP2Cs), which form exclusive interactions with ABA receptors and subfamily 2 Snfl-related kinase (SnRK2s). Here, we report a SnRK2-PP2C complex structure, which reveals marked similarity in PP2C recognition by SnRK2 and ABA receptors. In the complex, the kinase activation loop docks into the active site of PP2C, while the conserved ABA-sensing tryptophan of PP2C inserts into the kinase catalytic cleft, thus mimicking receptor-PP2C interactions. These structural results provide a simple mechanism that directly couples ABA binding to SnRK2 kinase activation and highlight a new paradigm of kinase-phosphatase regulation through mutual packing of their catalytic sites.

  2. Molecular Mimicry Regulates ABA Signaling by SnRK2 Kinases and PP2C Phosphatases

    PubMed Central

    Soon, Fen-Fen; Ng, Ley-Moy; Zhou, X. Edward; West, Graham M.; Kovach, Amanda; Tan, M. H. Eileen; Suino-Powell, Kelly M.; He, Yuanzheng; Xu, Yong; Chalmers, Michael J.; Brunzelle, Joseph S.; Zhang, Huiming; Yang, Huaiyu; Jiang, Hualiang; Li, Jun; Yong, Eu-Leong; Cutler, Sean; Zhu, Jian-Kang; Griffin, Patrick R.; Melcher, Karsten; Xu, H. Eric

    2013-01-01

    Abscisic acid (ABA) is an essential hormone for plants to survive environmental stresses. At the center of the ABA signaling network is a subfamily of type 2C protein phosphatases (PP2Cs), which form exclusive interactions with ABA receptors and subfamily 2 Snfl-related kinase (SnRK2s). Here, we report a SnRK2-PP2C complex structure, which reveals marked similarity in PP2C recognition by SnRK2 and ABA receptors. In the complex, the kinase activation loop docks into the active site of PP2C, while the conserved ABA-sensing tryptophan of PP2C inserts into the kinase catalytic cleft, thus mimicking receptor-PP2C interactions. These structural results provide a simple mechanism that directly couples ABA binding to SnRK2 kinase activation and highlight a new paradigm of kinase-phosphatase regulation through mutual packing of their catalytic sites. PMID:22116026

  3. Molecular Mimicry Regulates ABA Signaling by SnRK2 Kinases and PP2C Phosphatases

    SciTech Connect

    Soon, Fen-Fen; Ng, Ley-Moy; Zhou, X. Edward; West, Graham M.; Kovach, Amanda; Tan, M.H. Eileen; Suino-Powell, Kelly M.; He, Yuanzheng; Xu, Yong; Chalmers, Michael J.; Brunzelle, Joseph S.; Zhang, Huiming; Yang, Huaiyu; Jiang, Hualiang; Li, Jun; Yong, Eu-Leong; Cutler, Sean; Zhu, Jian-Kang; Griffin, Patrick R.; Melcher, Karsten; Xu, H. Eric

    2014-10-02

    Abscisic acid (ABA) is an essential hormone for plants to survive environmental stresses. At the center of the ABA signaling network is a subfamily of type 2C protein phosphatases (PP2Cs), which form exclusive interactions with ABA receptors and subfamily 2 Snfl-related kinase (SnRK2s). Here, we report a SnRK2-PP2C complex structure, which reveals marked similarity in PP2C recognition by SnRK2 and ABA receptors. In the complex, the kinase activation loop docks into the active site of PP2C, while the conserved ABA-sensing tryptophan of PP2C inserts into the kinase catalytic cleft, thus mimicking receptor-PP2C interactions. These structural results provide a simple mechanism that directly couples ABA binding to SnRK2 kinase activation and highlight a new paradigm of kinase-phosphatase regulation through mutual packing of their catalytic sites.

  4. Approximating Exponential and Logarithmic Functions Using Polynomial Interpolation

    ERIC Educational Resources Information Center

    Gordon, Sheldon P.; Yang, Yajun

    2017-01-01

    This article takes a closer look at the problem of approximating the exponential and logarithmic functions using polynomials. Either as an alternative to or a precursor to Taylor polynomial approximations at the precalculus level, interpolating polynomials are considered. A measure of error is given and the behaviour of the error function is…

  5. Approximating Exponential and Logarithmic Functions Using Polynomial Interpolation

    ERIC Educational Resources Information Center

    Gordon, Sheldon P.; Yang, Yajun

    2017-01-01

    This article takes a closer look at the problem of approximating the exponential and logarithmic functions using polynomials. Either as an alternative to or a precursor to Taylor polynomial approximations at the precalculus level, interpolating polynomials are considered. A measure of error is given and the behaviour of the error function is…

  6. Inverse of polynomial matrices in the irreducible form

    NASA Technical Reports Server (NTRS)

    Chang, Fan R.; Shieh, Leang S.; Mcinnis, Bayliss C.

    1987-01-01

    An algorithm is developed for finding the inverse of polynomial matrices in the irreducible form. The computational method involves the use of the left (right) matrix division method and the determination of linearly dependent vectors of the remainders. The obtained transfer function matrix has no nontrivial common factor between the elements of the numerator polynomial matrix and the denominator polynomial.

  7. Tutte polynomial of a small-world Farey graph

    NASA Astrophysics Data System (ADS)

    Liao, Yunhua; Hou, Yaoping; Shen, Xiaoling

    2013-11-01

    In this paper, we find recursive formulas for the Tutte polynomials of a family of small-world Farey graphs, which are modular, and has an exponential degree hierarchy. As applications of the recursive formula, the exact expressions for the chromatic polynomial and the reliability polynomial of Fare graphs are derived and the number of connected spanning subgraphs is also obtained.

  8. Exact Potts/Tutte polynomials for polygon chain graphs

    NASA Astrophysics Data System (ADS)

    Shrock, Robert

    2011-04-01

    We present exact calculations of Potts model partition functions and the equivalent Tutte polynomials for polygon chain graphs with open and cyclic boundary conditions. Special cases of the results that yield flow and reliability polynomials are discussed. We also analyze special cases of the Tutte polynomials that determine various quantities of graph-theoretic interest.

  9. Multiple Representations and the Understanding of Taylor Polynomials

    ERIC Educational Resources Information Center

    Habre, Samer

    2009-01-01

    The study of Maclaurin and Taylor polynomials entails the comprehension of various new mathematical ideas. Those polynomials are initially discussed at the college level in a calculus class and then again in a course on numerical methods. This article investigates the understanding of these polynomials by students taking a numerical methods class…

  10. The Gibbs Phenomenon for Series of Orthogonal Polynomials

    ERIC Educational Resources Information Center

    Fay, T. H.; Kloppers, P. Hendrik

    2006-01-01

    This note considers the four classes of orthogonal polynomials--Chebyshev, Hermite, Laguerre, Legendre--and investigates the Gibbs phenomenon at a jump discontinuity for the corresponding orthogonal polynomial series expansions. The perhaps unexpected thing is that the Gibbs constant that arises for each class of polynomials appears to be the same…

  11. Herman's Condition and Siegel Disks of Bi-Critical Polynomials

    NASA Astrophysics Data System (ADS)

    Chéritat, Arnaud; Roesch, Pascale

    2016-06-01

    We extend a theorem of Herman from the case of unicritical polynomials to the case of polynomials with two finite critical values. This theorem states that Siegel disks of such polynomials, under a diophantine condition (called Herman's condition) on the rotation number, must have a critical point on their boundaries.

  12. Production of a conjugate between the rK346 antigen from Leishmania infantum and the horseradish peroxidase C for the detection of rK346 antibodies.

    PubMed

    Rengifo-González, Juan; Medina-Mora, Yollyseth; Silva-Barrios, Sasha; Márquez-Contreras, María Elizabeth; Tibisay Ruiz, María; Cáceres, Ana J; Concepción, Juan Luis; Quiñones, Wilfredo

    2016-06-01

    It was designed and characterized a reporter system to be captured by an- tibodies bound to ELISA plates. The system was designed with the rK346 from Leishmania infantum, a highly antigenic and specific protein. The rK346 was coupled to the horseradish peroxidase C (HRPc) from Armoracia rusticana using glutaraldehyde or sulfo-SMCC. Gluta- raldehyde conjugation was performed in two steps. Separation of conjugates was carried out using a Sepharose S-200 in size exclusion chromatography (SEC); fractions were analyzed via HRPc activity and through ELISA plates sensitized with polyclonal anti-rK346 IgG puri- fied from rabbit serum. A heterogeneous population of conjugates rK346-HRPc was obtained with molecular weights ranging between 109.7 ± 16.5 to 67.6 ± 10.1 kDa; with rK346-HRPe stoichiometries of 1:2; 2:1; 3:1; and 2:2. Conjugation using sulfo-SMCC was carried out first by introducing -SH groups onto the HRPc using the SATA reagent and the antigen was modi- fied with sulfo-SMCC during 45 min. Separation and analysis of conjugates was performed similarly as with glutaraldehyde, resulting in a heterogeneous population of conjugates rK346- HRPc with molecular weights between 150.5 ± 22.6 to 80.0 ± 12.0 kDa; with rK346-HRPC stoichiometries of 2:1; 1:2; 2:2; and 1:3, with an increased conjugation efficiency in compari- son with glutaraldehyde. This enables sulfo-SMCC to be used as a potential reagent for cou- pling the antigen to the HRPc, to design an economic, specific and easy method to apply as a reporter system, available to assess individuals at risk and/or at early and late stages of visceral leishmaniasis.

  13. Global Monte Carlo Simulation with High Order Polynomial Expansions

    SciTech Connect

    William R. Martin; James Paul Holloway; Kaushik Banerjee; Jesse Cheatham; Jeremy Conlin

    2007-12-13

    The functional expansion technique (FET) was recently developed for Monte Carlo simulation. The basic idea of the FET is to expand a Monte Carlo tally in terms of a high order expansion, the coefficients of which can be estimated via the usual random walk process in a conventional Monte Carlo code. If the expansion basis is chosen carefully, the lowest order coefficient is simply the conventional histogram tally, corresponding to a flat mode. This research project studied the applicability of using the FET to estimate the fission source, from which fission sites can be sampled for the next generation. The idea is that individual fission sites contribute to expansion modes that may span the geometry being considered, possibly increasing the communication across a loosely coupled system and thereby improving convergence over the conventional fission bank approach used in most production Monte Carlo codes. The project examined a number of basis functions, including global Legendre polynomials as well as “local” piecewise polynomials such as finite element hat functions and higher order versions. The global FET showed an improvement in convergence over the conventional fission bank approach. The local FET methods showed some advantages versus global polynomials in handling geometries with discontinuous material properties. The conventional finite element hat functions had the disadvantage that the expansion coefficients could not be estimated directly but had to be obtained by solving a linear system whose matrix elements were estimated. An alternative fission matrix-based response matrix algorithm was formulated. Studies were made of two alternative applications of the FET, one based on the kernel density estimator and one based on Arnoldi’s method of minimized iterations. Preliminary results for both methods indicate improvements in fission source convergence. These developments indicate that the FET has promise for speeding up Monte Carlo fission source

  14. Polynomial search and global modeling: Two algorithms for modeling chaos.

    PubMed

    Mangiarotti, S; Coudret, R; Drapeau, L; Jarlan, L

    2012-10-01

    Global modeling aims to build mathematical models of concise description. Polynomial Model Search (PoMoS) and Global Modeling (GloMo) are two complementary algorithms (freely downloadable at the following address: http://www.cesbio.ups-tlse.fr/us/pomos_et_glomo.html) designed for the modeling of observed dynamical systems based on a small set of time series. Models considered in these algorithms are based on ordinary differential equations built on a polynomial formulation. More specifically, PoMoS aims at finding polynomial formulations from a given set of 1 to N time series, whereas GloMo is designed for single time series and aims to identify the parameters for a selected structure. GloMo also provides basic features to visualize integrated trajectories and to characterize their structure when it is simple enough: One allows for drawing the first return map for a chosen Poincaré section in the reconstructed space; another one computes the Lyapunov exponent along the trajectory. In the present paper, global modeling from single time series is considered. A description of the algorithms is given and three examples are provided. The first example is based on the three variables of the Rössler attractor. The second one comes from an experimental analysis of the copper electrodissolution in phosphoric acid for which a less parsimonious global model was obtained in a previous study. The third example is an exploratory case and concerns the cycle of rainfed wheat under semiarid climatic conditions as observed through a vegetation index derived from a spatial sensor.

  15. Possible quantum algorithms for the Bollobas-Riordan-Tutte polynomial of a ribbon graph

    NASA Astrophysics Data System (ADS)

    Vélez, Mario; Ospina, Juan

    2008-04-01

    Three possible quantum algorithms, for the computation of the Bollobás-Riordan-Tutte polynomial of a given ribbon graph, are presented and discussed. The first possible algorithm is based on the spanning quasi-trees expansion for generalized Tutte polynomials of generalized graphs and on a quantum version of the Binary Decision Diagram (BDD) for quasi-trees . The second possible algorithm is based on the relation between the Kauffman bracket and the Tutte polynomial; and with an application of the recently introduced Aharonov-Arad-Eban-Landau quantum algorithm. The third possible algorithm is based on the relation between the HOMFLY polynomial and the Tutte polynomial; and with an application of the Wocjan-Yard quantum algorithm. It is claimed that these possible algorithms may be more efficient that the best known classical algorithms. These three algorithms may have interesting applications in computer science at general or in computational biology and bio-informatics in particular. A line for future research based on the categorification project is mentioned.

  16. SnRK1 activates autophagy via the TOR signaling pathway in Arabidopsis thaliana

    PubMed Central

    Soto-Burgos, Junmarie

    2017-01-01

    Autophagy is a degradation process in which cells break down and recycle their cytoplasmic contents when subjected to environmental stress or during cellular remodeling. The Arabidopsis thaliana SnRK1 complex is a protein kinase that senses changes in energy levels and triggers downstream responses to enable survival. Its mammalian ortholog, AMPK, and yeast ortholog, Snf-1, activate autophagy in response to low energy conditions. We therefore hypothesized that SnRK1 may play a role in the regulation of autophagy in response to nutrient or energy deficiency in Arabidopsis. To test this hypothesis, we determined the effect of overexpression or knockout of the SnRK1 catalytic subunit KIN10 on autophagy activation by abiotic stresses, including nutrient deficiency, salt, osmotic, oxidative, and ER stress. While wild-type plants had low basal autophagy activity in control conditions, KIN10 overexpression lines had increased autophagy under these conditions, indicating activation of autophagy by SnRK1. A kin10 mutant had a basal level of autophagy under control conditions similar to wild-type plants, but activation of autophagy by most abiotic stresses was blocked, indicating that SnRK1 is required for autophagy induction by a wide variety of stress conditions. In mammals, TOR is a negative regulator of autophagy, and AMPK acts to activate autophagy both upstream of TOR, by inhibiting its activity, and in a parallel pathway. Inhibition of Arabidopsis TOR leads to activation of autophagy; inhibition of SnRK1 did not block this activation. Furthermore, an increase in SnRK1 activity was unable to induce autophagy when TOR was also activated. These results demonstrate that SnRK1 acts upstream of TOR in the activation of autophagy in Arabidopsis. PMID:28783755

  17. SnRK1 activates autophagy via the TOR signaling pathway in Arabidopsis thaliana.

    PubMed

    Soto-Burgos, Junmarie; Bassham, Diane C

    2017-01-01

    Autophagy is a degradation process in which cells break down and recycle their cytoplasmic contents when subjected to environmental stress or during cellular remodeling. The Arabidopsis thaliana SnRK1 complex is a protein kinase that senses changes in energy levels and triggers downstream responses to enable survival. Its mammalian ortholog, AMPK, and yeast ortholog, Snf-1, activate autophagy in response to low energy conditions. We therefore hypothesized that SnRK1 may play a role in the regulation of autophagy in response to nutrient or energy deficiency in Arabidopsis. To test this hypothesis, we determined the effect of overexpression or knockout of the SnRK1 catalytic subunit KIN10 on autophagy activation by abiotic stresses, including nutrient deficiency, salt, osmotic, oxidative, and ER stress. While wild-type plants had low basal autophagy activity in control conditions, KIN10 overexpression lines had increased autophagy under these conditions, indicating activation of autophagy by SnRK1. A kin10 mutant had a basal level of autophagy under control conditions similar to wild-type plants, but activation of autophagy by most abiotic stresses was blocked, indicating that SnRK1 is required for autophagy induction by a wide variety of stress conditions. In mammals, TOR is a negative regulator of autophagy, and AMPK acts to activate autophagy both upstream of TOR, by inhibiting its activity, and in a parallel pathway. Inhibition of Arabidopsis TOR leads to activation of autophagy; inhibition of SnRK1 did not block this activation. Furthermore, an increase in SnRK1 activity was unable to induce autophagy when TOR was also activated. These results demonstrate that SnRK1 acts upstream of TOR in the activation of autophagy in Arabidopsis.

  18. Polynomial integral for square and inverse-square potential systems

    NASA Astrophysics Data System (ADS)

    Virdi, Jasvinder Singh; Srivastava, A. K.; Ahmad, Muneer

    2017-07-01

    Classification and possibility of fourth order dynamical integral for some square and inverse-square potential in two-dimensional dynamical systems is searched out. It is based on the study of the quadratic algebras of the integrals of motion and on the equivalence of different systems under coupling constant metamorphosis. The determining equations for the existence of integrals of motion of arbitrary order are presented and partially solved for the case of fourth-order integrals. A systematic calculation is given of systems in two and higher dimensional pace that allow integrals of fourth order. The algebras of integrals of motions are not necessarily quadratic but close polynomially or rationally.

  19. A polynomial texture extraction with application in dynamic texture classification

    NASA Astrophysics Data System (ADS)

    El Moubtahij, R.; Augereau, B.; Fernandez-Maloigne, C.; Tairi, H.

    2015-04-01

    Geometry and texture image decomposition is an important paradigm in image processing. Following to Yves Meyer works based on Total Variation (VT), the decomposition model has known a renewed interest. In this paper, we propose an algorithm which decomposes color image into geometry and texture component by projecting the image in a bivariate polynomial basis and considering the geometry component as the partial reconstruction and the texture component as the remaining part. The experimental results show the adequacy of using our method as a texture extraction tool. Furthermore, we integrate it into a dynamic texture classification process.

  20. Optimal approximation of harmonic growth clusters by orthogonal polynomials

    SciTech Connect

    Teodorescu, Razvan

    2008-01-01

    Interface dynamics in two-dimensional systems with a maximal number of conservation laws gives an accurate theoreticaI model for many physical processes, from the hydrodynamics of immiscible, viscous flows (zero surface-tension limit of Hele-Shaw flows), to the granular dynamics of hard spheres, and even diffusion-limited aggregation. Although a complete solution for the continuum case exists, efficient approximations of the boundary evolution are very useful due to their practical applications. In this article, the approximation scheme based on orthogonal polynomials with a deformed Gaussian kernel is discussed, as well as relations to potential theory.

  1. Isolation, phylogeny and evolution of the SymRK gene in the legume genus Lupinus L.

    PubMed

    Mahé, Frédéric; Markova, Dragomira; Pasquet, Rémy; Misset, Marie-Thérèse; Aïnouche, Abdelkader

    2011-07-01

    SymRK is one of the key genes involved in initial steps of legume symbiotic association with fungi (mycorrhization) and nitrogen-fixing bacteria (nodulation). A large portion of the sequence encoding the extracellular domain of SYMRK was obtained for 38 lupine accessions and 2 outgroups in order to characterize this region, to evaluate its phylogenetic utility, and to examine whether its molecular evolutionary pattern is correlated with rhizobial diversity and specificity in Lupinus. The data suggested that, in Lupinus, SymRK is a single copy gene that shows good phylogenetic potential. Accordingly, SymRK provided additional support to previous molecular phylogenies, and shed additional light on relationships within the Old World group of Lupinus, especially among the African species. Similar to results of other studies, analyses of SymRK sequences were unable to resolve placement of the Florida unifoliolate lineage, whose relationship was weakly supported to either the Old or the New World lupines. Our data are consistent with strong purifying selection operating on SymRK in Lupinus, preserving rather than diversifying its function. Thus, although SymRK was demonstrated to be a vital gene in the early stages of the root-bacterial symbiotic associations, no evidence from present analyses indicate that this gene is involved in changes in rhizobial specificity in Lupinus. Copyright © 2011 Elsevier Inc. All rights reserved.

  2. Compressive sampling of polynomial chaos expansions: Convergence analysis and sampling strategies

    SciTech Connect

    Hampton, Jerrad; Doostan, Alireza

    2015-01-01

    Sampling orthogonal polynomial bases via Monte Carlo is of interest for uncertainty quantification of models with random inputs, using Polynomial Chaos (PC) expansions. It is known that bounding a probabilistic parameter, referred to as coherence, yields a bound on the number of samples necessary to identify coefficients in a sparse PC expansion via solution to an ℓ{sub 1}-minimization problem. Utilizing results for orthogonal polynomials, we bound the coherence parameter for polynomials of Hermite and Legendre type under their respective natural sampling distribution. In both polynomial bases we identify an importance sampling distribution which yields a bound with weaker dependence on the order of the approximation. For more general orthonormal bases, we propose the coherence-optimal sampling: a Markov Chain Monte Carlo sampling, which directly uses the basis functions under consideration to achieve a statistical optimality among all sampling schemes with identical support. We demonstrate these different sampling strategies numerically in both high-order and high-dimensional, manufactured PC expansions. In addition, the quality of each sampling method is compared in the identification of solutions to two differential equations, one with a high-dimensional random input and the other with a high-order PC expansion. In both cases, the coherence-optimal sampling scheme leads to similar or considerably improved accuracy.

  3. Jack polynomial fractional quantum Hall states and their generalizations

    NASA Astrophysics Data System (ADS)

    Baratta, Wendy; Forrester, Peter J.

    2011-02-01

    In the study of fractional quantum Hall states, a certain clustering condition involving up to four integers has been identified. We give a simple proof that particular Jack polynomials with α=-(r-1)/(k+1), (r-1) and (k+1) relatively prime, and with partition given in terms of its frequencies by [n0k0k0k⋯0m] satisfy this clustering condition. Our proof makes essential use of the fact that these Jack polynomials are translationally invariant. We also consider nonsymmetric Jack polynomials, symmetric and nonsymmetric generalized Hermite and Laguerre polynomials, and Macdonald polynomials from the viewpoint of the clustering.

  4. Polynomial interpolation methods for viscous flow calculations

    NASA Technical Reports Server (NTRS)

    Rubin, S. G.; Khosla, P. K.

    1977-01-01

    Higher-order collocation procedures which result in block-tridiagonal matrix systems are derived from (1) Taylor series expansions and from (2) polynomial interpolation, and the relationships between the two formulations, called respectively Hermite and spline collocation, are investigated. A Hermite block-tridiagonal system for a nonuniform mesh is derived, and the Hermite approach is extended in order to develop a variable-mesh sixth-order block-tridiagonal procedure. It is shown that all results obtained by Hermite development can be recovered by appropriate spline polynomial interpolation. The additional boundary conditions required for these higher-order procedures are also given. Comparative solutions using second-order accurate finite difference and spline and Hermite formulations are presented for the boundary layer on a flat plate, boundary layers with uniform and variable mass transfer, and the viscous incompressible Navier-Stokes equations describing flow in a driven cavity.

  5. A polynomial function of gait performance.

    PubMed

    Giaquinto, Salvatore; Galli, Manuela; Nolfe, Giuseppe

    2007-01-01

    A mathematical data processing method is presented that represents a further step in gait analysis. The proposed polynomial regression analysis is reliable in assessing differences in the same patient and even on the same day. The program also calculates the confidence interval of the whole curve. The procedure was applied to normal subjects in order to collect normative data. When a new subject is tested, the polynomial function obtained is graphically superimposed on control data. Should the new curve fall within the limits described by normative data, it is considered to be equivalent. The procedure can be applied to the same subject, either normal or pathological, for retesting kinematic characteristics. The gait cycle is analyzed as a whole, not point-by-point. Ten normal subjects and two patients, one with recent- and the other with late-onset hemiplegia, were tested. Multiple baseline evaluation is recommended before the start of a rehabilitation program.

  6. Polynomial chaos representation of databases on manifolds

    NASA Astrophysics Data System (ADS)

    Soize, C.; Ghanem, R.

    2017-04-01

    Characterizing the polynomial chaos expansion (PCE) of a vector-valued random variable with probability distribution concentrated on a manifold is a relevant problem in data-driven settings. The probability distribution of such random vectors is multimodal in general, leading to potentially very slow convergence of the PCE. In this paper, we build on a recent development for estimating and sampling from probabilities concentrated on a diffusion manifold. The proposed methodology constructs a PCE of the random vector together with an associated generator that samples from the target probability distribution which is estimated from data concentrated in the neighborhood of the manifold. The method is robust and remains efficient for high dimension and large datasets. The resulting polynomial chaos construction on manifolds permits the adaptation of many uncertainty quantification and statistical tools to emerging questions motivated by data-driven queries.

  7. The basic function scheme of polynomial type

    SciTech Connect

    WU, Wang-yi; Lin, Guang

    2009-12-01

    A new numerical method---Basic Function Method is proposed. This method can directly discrete differential operator on unstructured grids. By using the expansion of basic function to approach the exact function, the central and upwind schemes of derivative are constructed. By using the second-order polynomial as basic function and applying the technique of flux splitting method and the combination of central and upwind schemes to suppress the non-physical fluctuation near the shock wave, the second-order basic function scheme of polynomial type for solving inviscid compressible flow numerically is constructed in this paper. Several numerical results of many typical examples for two dimensional inviscid compressible transonic and supersonic steady flow illustrate that it is a new scheme with high accuracy and high resolution for shock wave. Especially, combining with the adaptive remeshing technique, the satisfactory results can be obtained by these schemes.

  8. On computing factors of cyclotomic polynomials

    NASA Astrophysics Data System (ADS)

    Brent, Richard P.

    1993-07-01

    For odd square-free n > 1 the cyclotomic polynomial {Φ_n}(x) satisfies the identity of Gauss, 4{Φ_n}(x) = A_n^2 - {( - 1)^{(n - 1)/2}}nB_n^2. A similar identity of Aurifeuille, Le Lasseur, and Lucas is {Φ_n}({( - 1)^{(n - 1)/2}}x) = C_n^2 - nxD_n^2 or, in the case that n is even and square-free, ± {Φ_{n/2}}( - {x^2}) = C_n^2 - nxD_n^2. Here, {A_n}(x), ldots ,{D_n}(x) are polynomials with integer coefficients. We show how these coefficients can be computed by simple algorithms which require O({n^2}) arithmetic operations and work over the integers. We also give explicit formulae and generating functions for {A_n}(x), ldots ,{D_n}(x) , and illustrate the application to integer factorization with some numerical examples.

  9. Trigonometric Polynomials For Estimation Of Spectra

    NASA Technical Reports Server (NTRS)

    Greenhall, Charles A.

    1990-01-01

    Orthogonal sets of trigonometric polynomials used as suboptimal substitutes for discrete prolate-spheroidal "windows" of Thomson method of estimation of spectra. As used here, "windows" denotes weighting functions used in sampling time series to obtain their power spectra within specified frequency bands. Simplified windows designed to require less computation than do discrete prolate-spheroidal windows, albeit at price of some loss of accuracy.

  10. Detecting Prime Numbers via Roots of Polynomials

    ERIC Educational Resources Information Center

    Dobbs, David E.

    2012-01-01

    It is proved that an integer n [greater than or equal] 2 is a prime (resp., composite) number if and only if there exists exactly one (resp., more than one) nth-degree monic polynomial f with coefficients in Z[subscript n], the ring of integers modulo n, such that each element of Z[subscript n] is a root of f. This classroom note could find use in…

  11. Polynomial approximation of functions in Sobolev spaces

    NASA Technical Reports Server (NTRS)

    Dupont, T.; Scott, R.

    1980-01-01

    Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are presented. Using an averaged Taylor series, we represent a function as a polynomial plus a remainder. The remainder can be manipulated in many ways to give different types of bounds. Approximation of functions in fractional order Sobolev spaces is treated as well as the usual integer order spaces and several nonstandard Sobolev-like spaces.

  12. Polynomial approximation of functions in Sobolev spaces

    NASA Technical Reports Server (NTRS)

    Dupont, T.; Scott, R.

    1980-01-01

    Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are presented. Using an averaged Taylor series, we represent a function as a polynomial plus a remainder. The remainder can be manipulated in many ways to give different types of bounds. Approximation of functions in fractional order Sobolev spaces is treated as well as the usual integer order spaces and several nonstandard Sobolev-like spaces.

  13. Detecting prime numbers via roots of polynomials

    NASA Astrophysics Data System (ADS)

    Dobbs, David E.

    2012-04-01

    It is proved that an integer n ≥ 2 is a prime (resp., composite) number if and only if there exists exactly one (resp., more than one) nth-degree monic polynomial f with coefficients in Z n , the ring of integers modulo n, such that each element of Z n is a root of f. This classroom note could find use in any introductory course on abstract algebra or elementary number theory.

  14. Polynomials with Restricted Coefficients and Their Applications

    DTIC Science & Technology

    1987-01-01

    JAMES S . BYRNES, PRINCIPAL INVESTIGATOR DONALD. J. NEWMAN, PRINCIPAL SCIENTIST MARTIN GOLDSTEIN, SENIOR SCIENTIST AIR FORCE OFFICE OF SCIENTIFIC...lacludd SecuntrY ClaaIflcationJ Polynomials with Restricted Coefficienks a@,d Thei• Applic tions 12. PERSONAL AUTHOR( S ) JAI.MES S . Byrnes 13a, TYPE OF...COEFFICIENTS AND THEIR APPLICATIONS PREPARED BY: JAMES S . BYRNES, PRINCIPAL INVESTIGATOR DONALD J. NEWMAN, PRINCIPAL SCIENTIST S " MARTIN GOLDSTEIN

  15. Polynomial complexity despite the fermionic sign

    NASA Astrophysics Data System (ADS)

    Rossi, R.; Prokof'ev, N.; Svistunov, B.; Van Houcke, K.; Werner, F.

    2017-04-01

    It is commonly believed that in unbiased quantum Monte Carlo approaches to fermionic many-body problems, the infamous sign problem generically implies prohibitively large computational times for obtaining thermodynamic-limit quantities. We point out that for convergent Feynman diagrammatic series evaluated with a recently introduced Monte Carlo algorithm (see Rossi R., arXiv:1612.05184), the computational time increases only polynomially with the inverse error on thermodynamic-limit quantities.

  16. Multivariate polynomial interpolation under projectivities II

    NASA Astrophysics Data System (ADS)

    Gasca, M.; Mühlbach, G.

    1992-10-01

    This is the second part of a note on interpolation by real polynomials of several real variables. For certain regular knot systems (geometric or regular meshes, tensor product grids), Neville-Aitken algorithms are derived explicitly. By application of a projectivity they can be extended in a simple way to arbitrary (k+1)-pencil lattices as recently introduced by Lee and Phillips. A numerical example is given.

  17. Detecting Prime Numbers via Roots of Polynomials

    ERIC Educational Resources Information Center

    Dobbs, David E.

    2012-01-01

    It is proved that an integer n [greater than or equal] 2 is a prime (resp., composite) number if and only if there exists exactly one (resp., more than one) nth-degree monic polynomial f with coefficients in Z[subscript n], the ring of integers modulo n, such that each element of Z[subscript n] is a root of f. This classroom note could find use in…

  18. Nested Canalyzing, Unate Cascade, and Polynomial Functions.

    PubMed

    Jarrah, Abdul Salam; Raposa, Blessilda; Laubenbacher, Reinhard

    2007-09-15

    This paper focuses on the study of certain classes of Boolean functions that have appeared in several different contexts. Nested canalyzing functions have been studied recently in the context of Boolean network models of gene regulatory networks. In the same context, polynomial functions over finite fields have been used to develop network inference methods for gene regulatory networks. Finally, unate cascade functions have been studied in the design of logic circuits and binary decision diagrams. This paper shows that the class of nested canalyzing functions is equal to that of unate cascade functions. Furthermore, it provides a description of nested canalyzing functions as a certain type of Boolean polynomial function. Using the polynomial framework one can show that the class of nested canalyzing functions, or, equivalently, the class of unate cascade functions, forms an algebraic variety which makes their analysis amenable to the use of techniques from algebraic geometry and computational algebra. As a corollary of the functional equivalence derived here, a formula in the literature for the number of unate cascade functions provides such a formula for the number of nested canalyzing functions.

  19. Simplified Storm Surge Simulations Using Bernstein Polynomials

    NASA Astrophysics Data System (ADS)

    Beisiegel, Nicole; Behrens, Jörn

    2016-04-01

    Storm surge simulations are vital for forecasting, hazard assessment and eventually improving our understanding of Earth system processes. Discontinuous Galerkin (DG) methods have recently been explored in that context, because they are locally mass-conservative and in combination with suitable robust nodal filtering techniques (slope limiters) positivity-preserving and well-balanced for the still water state at rest. These filters manipulate interpolation point values in every time step in order to retain the desirable properties of the scheme. In particular, DG methods are able to represent prognostic variables such as the fluid height at high-order accuracy inside each element (triangle). For simulations that include wetting and drying, however, the high-order accuracy will destabilize the numerical model because point values on quadrature points may become negative during the computation if they do not coincide with interpolation points. This is why the model that we are presenting utilizes Bernstein polynomials as basis functions to model the wetting and drying. This has the advantage that negative pointvalues away from interpolation points are prevented, the model is stabilized and no additional time step restriction is introduced. Numerical tests show that the model is capable of simulating simplified storm surges. Furthermore, a comparison of model results with third-order Bernstein polynomials with results using traditional nodal Lagrange polynomials reveals an improvement in numerical convergence.

  20. Maximal aggregation of polynomial dynamical systems.

    PubMed

    Cardelli, Luca; Tribastone, Mirco; Tschaikowski, Max; Vandin, Andrea

    2017-09-19

    Ordinary differential equations (ODEs) with polynomial derivatives are a fundamental tool for understanding the dynamics of systems across many branches of science, but our ability to gain mechanistic insight and effectively conduct numerical evaluations is critically hindered when dealing with large models. Here we propose an aggregation technique that rests on two notions of equivalence relating ODE variables whenever they have the same solution (backward criterion) or if a self-consistent system can be written for describing the evolution of sums of variables in the same equivalence class (forward criterion). A key feature of our proposal is to encode a polynomial ODE system into a finitary structure akin to a formal chemical reaction network. This enables the development of a discrete algorithm to efficiently compute the largest equivalence, building on approaches rooted in computer science to minimize basic models of computation through iterative partition refinements. The physical interpretability of the aggregation is shown on polynomial ODE systems for biochemical reaction networks, gene regulatory networks, and evolutionary game theory.

  1. Polynomials and Neural Networks for Gas Turbine Monitoring: a Comparative Study

    NASA Astrophysics Data System (ADS)

    Loboda, Igor; Feldshteyn, Yakov

    2011-09-01

    Gas turbine health monitoring includes the common stages of problem detection, fault identification, and prognostics. To extract useful diagnostic information from raw recorded data, these stages require a preliminary operation of computing differences between measurements and an engine baseline, which is a function of engine operating conditions. These deviations of measured values from the baseline data can be good indicators of engine health. However, their quality and the success of all diagnostic stages strongly depend on the adequacy of the baseline model employed and, in particular, on the mathematical techniques applied to create it. To create a baseline model, we have applied polynomials and the least squares method for computing the coefficients over a long period of time. Methods were proposed to enhance such a polynomial-based model. The resulting accuracy was sufficient for reliable monitoring of gas turbine deterioration effects. The polynomials previously investigated thus far are used in the present study as a standard for evaluating artificial neural networks, a very popular technique in gas turbine diagnostics. The focus of this comparative study is to verify whether the use of networks results in a better description of the engine baseline. Extensive field data for two different industrial gas turbines were used to compare these two techniques under various conditions. The deviations were computed for all available data, and the quality of the resulting deviation plots was compared visually. The mean error of the baseline model was used as an additional criterion for comparing the techniques. To find the best network configurations, many network variations were realised and compared with the polynomials. Although the neural networks studied were found to be close to the polynomials in accuracy, they did not exceed the polynomials in any variation. In this way, it seems that polynomials can be successfully used for engine monitoring, at least for

  2. Long-time uncertainty propagation using generalized polynomial chaos and flow map composition

    SciTech Connect

    Luchtenburg, Dirk M.; Brunton, Steven L.; Rowley, Clarence W.

    2014-10-01

    We present an efficient and accurate method for long-time uncertainty propagation in dynamical systems. Uncertain initial conditions and parameters are both addressed. The method approximates the intermediate short-time flow maps by spectral polynomial bases, as in the generalized polynomial chaos (gPC) method, and uses flow map composition to construct the long-time flow map. In contrast to the gPC method, this approach has spectral error convergence for both short and long integration times. The short-time flow map is characterized by small stretching and folding of the associated trajectories and hence can be well represented by a relatively low-degree basis. The composition of these low-degree polynomial bases then accurately describes the uncertainty behavior for long integration times. The key to the method is that the degree of the resulting polynomial approximation increases exponentially in the number of time intervals, while the number of polynomial coefficients either remains constant (for an autonomous system) or increases linearly in the number of time intervals (for a non-autonomous system). The findings are illustrated on several numerical examples including a nonlinear ordinary differential equation (ODE) with an uncertain initial condition, a linear ODE with an uncertain model parameter, and a two-dimensional, non-autonomous double gyre flow.

  3. The Corolla Polynomial for Spontaneously Broken Gauge Theories

    NASA Astrophysics Data System (ADS)

    Prinz, David

    2016-09-01

    In Kreimer and Yeats (Electr. J. Comb. 41-41, 2013), Kreimer et al. (Annals Phys. 336, 180-222, 2013) and Sars (2015) the Corolla Polynomial C ({Γ }) in C [a_{h1}, ldots , a_{h_{ \\vert {Γ }^{[1/2]} \\vert }}] was introduced as a graph polynomial in half-edge variables {ah}_{h in {Γ }^{[1/2]}} over a 3-regular scalar quantum field theory (QFT) Feynman graph Γ. It allows for a covariant quantization of pure Yang-Mills theory without the need for introducing ghost fields, clarifies the relation between quantum gauge theory and scalar QFT with cubic interaction and translates back the problem of renormalizing quantum gauge theory to the problem of renormalizing scalar QFT with cubic interaction (which is super renormalizable in 4 dimensions of spacetime). Furthermore, it is, as we believe, useful for computer calculations. In Prinz (2015) on which this paper is based the formulation of Kreimer and Yeats (Electr. J. Comb. 41-41, 2013), Kreimer et al. (Annals Phys. 336, 180-222, 2013) and Sars (2015) gets slightly altered in a fashion specialized in the case of the Feynman gauge. It is then formulated as a graph polynomial C ({Γ } ) in C [a_{h_{1 ± }}, ldots , a_{h_{ \\vert {Γ }^{[1/2]} \\vert } {h}_{± }}, b_{h1}, ldots , b_{h_{ \\vert {Γ }^{[1/2]} \\vert }}] in three different types of half-edge variables {a_{h+} , a_{h-} , bh}_{h in {Γ }^{[1/2]}} . This formulation is also suitable for the generalization to the case of spontaneously broken gauge theories (in particular all bosons from the Standard Model), as was first worked out in Prinz (2015) and gets reviewed here.

  4. SnRK1A-Interacting Negative Regulators Modulate the Nutrient Starvation Signaling Sensor SnRK1 in Source-Sink Communication in Cereal Seedlings under Abiotic Stress[C][W

    PubMed Central

    Lin, Chien-Ru; Lee, Kuo-Wei; Chen, Chih-Yu; Hong, Ya-Fang; Chen, Jyh-Long; Lu, Chung-An; Chen, Ku-Ting; Ho, Tuan-Hua David; Yu, Su-May

    2014-01-01

    In plants, source-sink communication plays a pivotal role in crop productivity, yet the underlying regulatory mechanisms are largely unknown. The SnRK1A protein kinase and transcription factor MYBS1 regulate the sugar starvation signaling pathway during seedling growth in cereals. Here, we identified plant-specific SnRK1A-interacting negative regulators (SKINs). SKINs antagonize the function of SnRK1A, and the highly conserved GKSKSF domain is essential for SKINs to function as repressors. Overexpression of SKINs inhibits the expression of MYBS1 and hydrolases essential for mobilization of nutrient reserves in the endosperm, leading to inhibition of seedling growth. The expression of SKINs is highly inducible by drought and moderately by various stresses, which is likely related to the abscisic acid (ABA)–mediated repression of SnRK1A under stress. Overexpression of SKINs enhances ABA sensitivity for inhibition of seedling growth. ABA promotes the interaction between SnRK1A and SKINs and shifts the localization of SKINs from the nucleus to the cytoplasm, where it binds SnRK1A and prevents SnRK1A and MYBS1 from entering the nucleus. Our findings demonstrate that SnRK1A plays a key role regulating source-sink communication during seedling growth. Under abiotic stress, SKINs antagonize the function of SnRK1A, which is likely a key factor restricting seedling vigor. PMID:24569770

  5. A connection between orthogonal polynomials on the unit circle and matrix orthogonal polynomials on the real line

    NASA Astrophysics Data System (ADS)

    Cantero, M. J.; Ferrer, M. P.; Moral, L.; Velázquez, L.

    2003-05-01

    Szego's procedure to connect orthogonal polynomials on the unit circle and orthogonal polynomials on [-1,1] is generalized to nonsymmetric measures. It generates the so-called semi-orthogonal functions on the linear space of Laurent polynomials [Lambda], and leads to a new orthogonality structure in the module [Lambda]×[Lambda]. This structure can be interpreted in terms of a 2×2 matrix measure on [-1,1], and semi-orthogonal functions provide the corresponding sequence of orthogonal matrix polynomials. This gives a connection between orthogonal polynomials on the unit circle and certain classes of matrix orthogonal polynomials on [-1,1]. As an application, the strong asymptotics of these matrix orthogonal polynomials is derived, obtaining an explicit expression for the corresponding Szego's matrix function.

  6. Combining fractional polynomial model building with multiple imputation.

    PubMed

    Morris, Tim P; White, Ian R; Carpenter, James R; Stanworth, Simon J; Royston, Patrick

    2015-11-10

    Multivariable fractional polynomial (MFP) models are commonly used in medical research. The datasets in which MFP models are applied often contain covariates with missing values. To handle the missing values, we describe methods for combining multiple imputation with MFP modelling, considering in turn three issues: first, how to impute so that the imputation model does not favour certain fractional polynomial (FP) models over others; second, how to estimate the FP exponents in multiply imputed data; and third, how to choose between models of differing complexity. Two imputation methods are outlined for different settings. For model selection, methods based on Wald-type statistics and weighted likelihood-ratio tests are proposed and evaluated in simulation studies. The Wald-based method is very slightly better at estimating FP exponents. Type I error rates are very similar for both methods, although slightly less well controlled than analysis of complete records; however, there is potential for substantial gains in power over the analysis of complete records. We illustrate the two methods in a dataset from five trauma registries for which a prognostic model has previously been published, contrasting the selected models with that obtained by analysing the complete records only. © 2015 The Authors. Statistics in Medicine Published by John Wiley & Sons Ltd.

  7. Uncertainty Quantification for Polynomial Systems via Bernstein Expansions

    NASA Technical Reports Server (NTRS)

    Crespo, Luis G.; Kenny, Sean P.; Giesy, Daniel P.

    2012-01-01

    This paper presents a unifying framework to uncertainty quantification for systems having polynomial response metrics that depend on both aleatory and epistemic uncertainties. The approach proposed, which is based on the Bernstein expansions of polynomials, enables bounding the range of moments and failure probabilities of response metrics as well as finding supersets of the extreme epistemic realizations where the limits of such ranges occur. These bounds and supersets, whose analytical structure renders them free of approximation error, can be made arbitrarily tight with additional computational effort. Furthermore, this framework enables determining the importance of particular uncertain parameters according to the extent to which they affect the first two moments of response metrics and failure probabilities. This analysis enables determining the parameters that should be considered uncertain as well as those that can be assumed to be constants without incurring significant error. The analytical nature of the approach eliminates the numerical error that characterizes the sampling-based techniques commonly used to propagate aleatory uncertainties as well as the possibility of under predicting the range of the statistic of interest that may result from searching for the best- and worstcase epistemic values via nonlinear optimization or sampling.

  8. Modeling of noise pollution and estimated human exposure around İstanbul Atatürk Airport in Turkey.

    PubMed

    Ozkurt, Nesimi; Sari, Deniz; Akdag, Ali; Kutukoglu, Murat; Gurarslan, Aliye

    2014-06-01

    The level of aircraft noise exposure around İstanbul Atatürk Airport was calculated according to the European Noise Directive. These calculations were based on the actual flight data for each flight in the year 2011. The study area was selected to cover of 25km radius centered on the Aerodrome Reference Point of the airport. The geographical data around İstanbul Atatürk Airport was used to prepare elevation, residential building, auxiliary building, hospital and school layers in SoundPlan software. It was found that 1.2% of the land area of İstanbul City exceeds the threshold of 55dB(A) during daytime. However, when the exceedance of threshold of 65dB(A)is investigated, the affected area is found quite small (0.2% of land area of city). About 0.3% of the land area of İstanbul City has noise levels exceeding 55dB(A) during night-time. Our results show that about 4% of the resident population was exposed to 55dB(A) or higher noises during daytime in İstanbul. When applying the second threshhold criteria, nearly 1% of the population is exposed to noise levels greater than 65dB(A). At night-time, 1.3% of the population is exposed to 55dB(A) or higher noise levels.

  9. High order overlay modeling and APC simulation with Zernike-Legendre polynomials

    NASA Astrophysics Data System (ADS)

    Ju, JawWuk; Kim, MinGyu; Lee, JuHan; Sherwin, Stuart; Hoo, George; Choi, DongSub; Lee, Dohwa; Jeon, Sanghuck; Lee, Kangsan; Tien, David; Pierson, Bill; Robinson, John C.; Levy, Ady; Smith, Mark D.

    2015-03-01

    Feedback control of overlay errors to the scanner is a well-established technique in semiconductor manufacturing [1]. Typically, overlay errors are measured, and then modeled by least-squares fitting to an overlay model. Overlay models are typically Cartesian polynomial functions of position within the wafer (Xw, Yw), and of position within the field (Xf, Yf). The coefficients from the data fit can then be fed back to the scanner to reduce overlay errors in future wafer exposures, usually via a historically weighted moving average. In this study, rather than using the standard Cartesian formulation, we examine overlay models using Zernike polynomials to represent the wafer-level terms, and Legendre polynomials to represent the field-level terms. Zernike and Legendre polynomials can be selected to have the same fitting capability as standard polynomials (e.g., second order in X and Y, or third order in X and Y). However, Zernike polynomials have the additional property of being orthogonal over the unit disk, which makes them appropriate for the wafer-level model, and Legendre polynomials are orthogonal over the unit square, which makes them appropriate for the field-level model. We show several benefits of Zernike/Legendre-based models in this investigation in an Advanced Process Control (APC) simulation using highly-sampled fab data. First, the orthogonality property leads to less interaction between the terms, which makes the lot-to-lot variation in the fitted coefficients smaller than when standard polynomials are used. Second, the fitting process itself is less coupled - fitting to a lower-order model, and then fitting the residuals to a higher order model gives very similar results as fitting all of the terms at once. This property makes fitting techniques such as dual pass or cascading [2] unnecessary, and greatly simplifies the options available for the model recipe. The Zernike/Legendre basis gives overlay performance (mean plus 3 sigma of the residuals

  10. SrSymRK, a plant receptor essential for symbiosome formation.

    PubMed

    Capoen, Ward; Goormachtig, Sofie; De Rycke, Riet; Schroeyers, Katrien; Holsters, Marcelle

    2005-07-19

    The symbiosis between legumes and rhizobia is essential for the nitrogen input into the life cycle on our planet. New root organs, the nodules, are established, which house N2-fixing bacteria internalized into the host cell cytoplasm as horizontally acquired organelles, the symbiosomes. The interaction is initiated by bacterial invasion via epidermal root hair curling and cell division in the cortex, both triggered by bacterial nodulation factors. Of the several genes involved in nodule initiation that have been identified, one encodes the leucine-rich repeat-type receptor kinase SymRK. In SymRK mutants of Lotus japonicus or its orthologs in Medicago sp. and Pisum sativum, nodule initiation is arrested at the level of the root hair interaction. Because of the epidermal block, the role of SymRK at later stages of nodule development remained enigmatic. To analyze the role of SymRK downstream of the epidermis, the water-tolerant legume Sesbania rostrata was used that has developed a nodulation strategy to circumvent root hair responses for bacterial invasion. Evidence is provided that SymRK plays an essential role during endosymbiotic uptake in plant cells.

  11. CAD techniques applied to diesel engine design. Extension of the RK range. [Ruston diesels

    SciTech Connect

    Sinha, S.K.; Buckthorpe, D.E.

    1980-01-01

    Rustion Diesels Ltd. produce three ranges of engines, the AP range covering engine powers from 500 to 1400 bhp (350 to 1000 kW electrical), the RK range covering 1410 to 4200 bhp (1 to 3 MW electrical), and the AT range covering 1650 to 4950 bhp (1-2 to 3-5 MW electrical). The AT engine range is available at speeds up to 600 rev/min, whereas the AP and RK ranges cover engine speeds from 600 to 1000 rev/min. The design philosophy and extension of the RK range of engines are investigated. This is a 251 mm (ten inch) bore by 305mm (twelve inch) stroke engine and is available in 6-cylinder in-line form and 8-, 12-, and 16-cylinder vee form. The RK engine features a cast-iron crankcase and bedplate design with a forged alloy-steel crankshaft. Combustion-chamber components consist of a cast-iron cylinder head and liner, steel exhaust and inlet valves, and a single-piece aluminium piston. The durability and reliability of RK engines have been fully proven in service with over 30 years' experience in numerous applications for power generation, reaction, and marine propulsion.

  12. Classification by using Prony's method with a polynomial model

    NASA Astrophysics Data System (ADS)

    Mueller, R.; Lee, W.; Okamitsu, J.

    2012-06-01

    Prony's Method with a Polynomial Model (PMPM) is a novel way of doing classification. Given a number of training samples with features and labels, it assumes a Gaussian mixture model for each feature, and uses Prony's method to determine a method of moments solution for the means and priors of the Gaussian distributions in the Gaussian mixture model. The features are then sorted in descending order by their relative performance. Based on the Gaussian mixture model of the first feature, training samples are partitioned into clusters by determining which Gaussian distribution each training sample is most likely from. Then with the training samples in each cluster, a new Gaussian mixture model is built for the next most powerful feature. This process repeats until a Gaussian mixture model is built for each feature, and a tree is thus grown with the training data partitioned into several final clusters. A "leaf" model for each final cluster is the weighted least squares solution (regression) for approximating a polynomial function of the features to the truth labels. Testing consists of determining for each testing sample a likelihood that the testing sample belongs to each cluster, and then regressions are weighted by their likelihoods and averaged to produce the test confidence. Evaluation of PMPM is done by extracting features from data collected by both Ground Penetrating Radar and Metal Detector of a robot-mounted land-mine detection system, training PMPM models, and testing in a cross-validation fashion.

  13. Maximum of the Characteristic Polynomial of Random Unitary Matrices

    NASA Astrophysics Data System (ADS)

    Arguin, Louis-Pierre; Belius, David; Bourgade, Paul

    2017-01-01

    It was recently conjectured by Fyodorov, Hiary and Keating that the maximum of the characteristic polynomial on the unit circle of a {N× N} random unitary matrix sampled from the Haar measure grows like {CN/(log N)^{3/4}} for some random variable C. In this paper, we verify the leading order of this conjecture, that is, we prove that with high probability the maximum lies in the range {[N^{1 - ɛ},N^{1 + ɛ}]}, for arbitrarily small ɛ. The method is based on identifying an approximate branching random walk in the Fourier decomposition of the characteristic polynomial, and uses techniques developed to describe the extremes of branching random walks and of other log-correlated random fields. A key technical input is the asymptotic analysis of Toeplitz determinants with dimension-dependent symbols. The original argument for these asymptotics followed the general idea that the statistical mechanics of 1/ f-noise random energy models is governed by a freezing transition. We also prove the conjectured freezing of the free energy for random unitary matrices.

  14. Hermite polynomial smoothing in beam-to-beam frictional contact

    NASA Astrophysics Data System (ADS)

    Musolff, A.; Leschik, S.; Reinstorf, F.; Strauch, G.; Schirmer, M.; Möder, M.

    2007-10-01

    In this paper a smoothing procedure is suggested for the 3D beam-to-beam contact. A smooth segment is defined basing on current position vectors of three nodes limiting two adjacent finite elements. The approximated fragment of a beam axis as a 3D curve spans between the centre points of these elements. The curve is described parametrically using three Hermite polynomials. The four boundary conditions necessary to determine the coefficients for each of these polynomials involve co-ordinates and slopes at the curve ends. The slopes are defined in terms of the element nodal co-ordinates, too. There is no dependence on nodal rotations so this formulation can be embedded in a beam analysis using any type of beam finite element. This geometric representation of the curve is incorporated into the 3D beam-to-beam frictional contact model with the penalty method used to enforce contact constraints. The residual vector and the corresponding tangent stiffness matrix are determined for the normal part of contact and for the stick or slip state of friction. A few numerical examples are presented to show the performance of the suggested smoothing procedure in the cases featuring large frictional sliding.

  15. Cubic spline functions and polynomials for calculation of absorption rate.

    PubMed

    Popović, J

    1998-01-01

    A model-independent method for calculation of the absorption rate based on an exact mathematical solution to the deconvolution problem of systems with linear pharmacokinetics and a polyexponential impulse responses has been examined. Theoretical analysis shows how a noninteracting primary input can be precisely evaluated when data on blood levels from a known source such as an i.v. bolus or zero-order infusion are available. This work compares the use of a Lagrange 3rd degree polynomial with that of a cubic spline function (special 3rd degree polynomial) for calculation of the absorption rate. The method is compared to another using simulated data (12 data points) containing various degrees of random noise.The accuracy of the methods is determined by how well the estimates represent the true values. It was found that the accuracy of the two methods was not significantly different, and that it was of the same order of magnitude as the noise level of the data.

  16. A multiple-scale Pascal polynomial for 2D Stokes and inverse Cauchy-Stokes problems

    NASA Astrophysics Data System (ADS)

    Liu, Chein-Shan; Young, D. L.

    2016-05-01

    The polynomial expansion method is a useful tool for solving both the direct and inverse Stokes problems, which together with the pointwise collocation technique is easy to derive the algebraic equations for satisfying the Stokes differential equations and the specified boundary conditions. In this paper we propose two novel numerical algorithms, based on a third-first order system and a third-third order system, to solve the direct and the inverse Cauchy problems in Stokes flows by developing a multiple-scale Pascal polynomial method, of which the scales are determined a priori by the collocation points. To assess the performance through numerical experiments, we find that the multiple-scale Pascal polynomial expansion method (MSPEM) is accurate and stable against large noise.

  17. Polynomial invariants for discrimination and classification of four-qubit entanglement

    SciTech Connect

    Viehmann, Oliver; Eltschka, Christopher; Siewert, Jens

    2011-05-15

    The number of entanglement classes in stochastic local operations and classical communication (SLOCC) classifications increases with the number of qubits and is already infinite for four qubits. Criteria for explicitly discriminating and classifying pure states of four and more qubits are highly desirable and therefore at the focus of intense theoretical research. We develop a general criterion for the discrimination of pure N-partite entangled states in terms of polynomial SL(d,C){sup xN} invariants. By means of this criterion, existing SLOCC classifications of four-qubit entanglement are reproduced. Based on this we propose a polynomial classification scheme in which entanglement types are identified through 'tangle patterns'. This scheme provides a practicable way to classify states of arbitrary multipartite systems. Moreover, the use of polynomials induces a corresponding quantification of the different types of entanglement.

  18. Generic expansion of the Jastrow correlation factor in polynomials satisfying symmetry and cusp conditions

    SciTech Connect

    Lüchow, Arne; Sturm, Alexander; Schulte, Christoph; Haghighi Mood, Kaveh

    2015-02-28

    Jastrow correlation factors play an important role in quantum Monte Carlo calculations. Together with an orbital based antisymmetric function, they allow the construction of highly accurate correlation wave functions. In this paper, a generic expansion of the Jastrow correlation function in terms of polynomials that satisfy both the electron exchange symmetry constraint and the cusp conditions is presented. In particular, an expansion of the three-body electron-electron-nucleus contribution in terms of cuspless homogeneous symmetric polynomials is proposed. The polynomials can be expressed in fairly arbitrary scaling function allowing a generic implementation of the Jastrow factor. It is demonstrated with a few examples that the new Jastrow factor achieves 85%–90% of the total correlation energy in a variational quantum Monte Carlo calculation and more than 90% of the diffusion Monte Carlo correlation energy.

  19. An iterative method for the solution of nonlinear systems using the Faber polynomials for annular sectors

    SciTech Connect

    Myers, N.J.

    1994-12-31

    The author gives a hybrid method for the iterative solution of linear systems of equations Ax = b, where the matrix (A) is nonsingular, sparse and nonsymmetric. As in a method developed by Starke and Varga the method begins with a number of steps of the Arnoldi method to produce some information on the location of the spectrum of A. This method then switches to an iterative method based on the Faber polynomials for an annular sector placed around these eigenvalue estimates. The Faber polynomials for an annular sector are used because, firstly an annular sector can easily be placed around any eigenvalue estimates bounded away from zero, and secondly the Faber polynomials are known analytically for an annular sector. Finally the author gives three numerical examples, two of which allow comparison with Starke and Varga`s results. The third is an example of a matrix for which many iterative methods would fall, but this method converges.

  20. Probabilistic neural networks and the polynomial Adaline as complementary techniques for classification.

    PubMed

    Specht, D F

    1990-01-01

    Two methods for classification based on the Bayes strategy and nonparametric estimators for probability density functions are reviewed. The two methods are named the probabilistic neural network (PNN) and the polynomial Adaline. Both methods involve one-pass learning algorithms that can be implemented directly in parallel neural network architectures. The performances of the two methods are compared with multipass backpropagation networks, and relative advantages and disadvantages are discussed. PNN and the polynomial Adaline are complementary techniques because they implement the same decision boundaries but have different advantages for applications. PNN is easy to use and is extremely fast for moderate-sized databases. For very large databases and for mature applications in which classification speed is more important than training speed, the polynomial equivalent can be found.

  1. Polynomial Local Improvement Algorithms in Combinatorial Optimization.

    DTIC Science & Technology

    1981-11-01

    NUMBER SOL 81- 21 IIS -J O 15 14. TITLE (am#Su&Utl & YEO RPR ERO OEE Polynomial Local Improvement Algorithms in TcnclRpr Combinatorial Optimization 6...Stanford, CA 94305 II . CONTROLLING OFFICE NAME AND ADDRESS It. REPORT DATE Office of Naval Research - Dept. of the Navy November 1981 800 N. Qu~incy Street...corresponds to a node of the tree. ii ) The father of a vertex is its optimal adjacent vertex; if a vertex is a local optimum, it has no father. The tree is

  2. A polynomial f(R) inflation model

    SciTech Connect

    Huang, Qing-Guo

    2014-02-01

    Motivated by the ultraviolet complete theory of quantum gravity, for example the string theory, we investigate a polynomial f(R) inflation model in detail. We calculate the spectral index and tensor-to-scalar ratio in the f(R) inflation model with the form of f(R) = R + (R{sup 2})/6M{sup 2} + (λn)/2n (R{sup n})/(3M{sup 2}){sup n-1}. Compared to Planck 2013, we find that R{sup n} term should be exponentially suppressed, i.e. |λ{sub n}|∼<10{sup −2n+2.6}.

  3. Tetromino tilings and the Tutte polynomial

    NASA Astrophysics Data System (ADS)

    Lykke Jacobsen, Jesper

    2007-02-01

    We consider tiling rectangles of size 4m × 4n by T-shaped tetrominoes. Each tile is assigned a weight that depends on its orientation and position on the lattice. For a particular choice of the weights, the generating function of tilings is shown to be the evaluation of the multivariate Tutte polynomial ZG(Q, v) (known also to physicists as the partition function of the Q-state Potts model) on an (m - 1) × (n - 1) rectangle G, where the parameter Q and the edge weights v can take arbitrary values depending on the tile weights.

  4. A polynomial f(R) inflation model

    SciTech Connect

    Huang, Qing-Guo

    2014-02-19

    Motivated by the ultraviolet complete theory of quantum gravity, for example the string theory, we investigate a polynomial f(R) inflation model in detail. We calculate the spectral index and tensor-to-scalar ratio in the f(R) inflation model with the form of f(R)=R+((R{sup 2})/(6M{sup 2}))+((λ{sub n})/(2n))((R{sup n})/((3M{sup 2}){sup n−1})). Compared to Planck 2013, we find that R{sup n} term should be exponentially suppressed, i.e. |λ{sub n}|≲10{sup −2n+2.6}.

  5. Piecewise polynomial control in mechanical systems

    NASA Astrophysics Data System (ADS)

    Alesova, Irina M.; Babadzanjanz, Levon K.; Pototskaya, Irina Yu.; Pupysheva, Yulia Yu.; Saakyan, Artur T.

    2017-07-01

    The controlled motion of a mechanical system is represented by the linear ODE system with constant coefficients. The admissible control is a piecewise polynomial function that blanks selected frequency components of the solution of linear equations at the moment T. As "the expenditure" functional we use the integral of the sum of the modules of coordinates of the control along the interval [0, T]. The problem under consideration is to construct an admissible control which minimizes the Expenditure. To solve this problem the method that consists of analytical and numerical parts is proposed. All results of research are formulated as the theorem.

  6. The Use of Generalized Laguerre Polynomials in Spectral Methods for Solving Fractional Delay Differential Equations.

    PubMed

    Khader, M M

    2013-10-01

    In this paper, an efficient numerical method for solving the fractional delay differential equations (FDDEs) is considered. The fractional derivative is described in the Caputo sense. The proposed method is based on the derived approximate formula of the Laguerre polynomials. The properties of Laguerre polynomials are utilized to reduce FDDEs to a linear or nonlinear system of algebraic equations. Special attention is given to study the error and the convergence analysis of the proposed method. Several numerical examples are provided to confirm that the proposed method is in excellent agreement with the exact solution.

  7. Polynomial solutions of the Monge-Ampère equation

    SciTech Connect

    Aminov, Yu A

    2014-11-30

    The question of the existence of polynomial solutions to the Monge-Ampère equation z{sub xx}z{sub yy}−z{sub xy}{sup 2}=f(x,y) is considered in the case when f(x,y) is a polynomial. It is proved that if f is a polynomial of the second degree, which is positive for all values of its arguments and has a positive squared part, then no polynomial solution exists. On the other hand, a solution which is not polynomial but is analytic in the whole of the x, y-plane is produced. Necessary and sufficient conditions for the existence of polynomial solutions of degree up to 4 are found and methods for the construction of such solutions are indicated. An approximation theorem is proved. Bibliography: 10 titles.

  8. Parallel multigrid smoothing: polynomial versus Gauss-Seidel

    NASA Astrophysics Data System (ADS)

    Adams, Mark; Brezina, Marian; Hu, Jonathan; Tuminaro, Ray

    2003-07-01

    Gauss-Seidel is often the smoother of choice within multigrid applications. In the context of unstructured meshes, however, maintaining good parallel efficiency is difficult with multiplicative iterative methods such as Gauss-Seidel. This leads us to consider alternative smoothers. We discuss the computational advantages of polynomial smoothers within parallel multigrid algorithms for positive definite symmetric systems. Two particular polynomials are considered: Chebyshev and a multilevel specific polynomial. The advantages of polynomial smoothing over traditional smoothers such as Gauss-Seidel are illustrated on several applications: Poisson's equation, thin-body elasticity, and eddy current approximations to Maxwell's equations. While parallelizing the Gauss-Seidel method typically involves a compromise between a scalable convergence rate and maintaining high flop rates, polynomial smoothers achieve parallel scalable multigrid convergence rates without sacrificing flop rates. We show that, although parallel computers are the main motivation, polynomial smoothers are often surprisingly competitive with Gauss-Seidel smoothers on serial machines.

  9. Comprehensive Analysis of the CDPK-SnRK Superfamily Genes in Chinese Cabbage and Its Evolutionary Implications in Plants

    PubMed Central

    Wu, Peng; Wang, Wenli; Duan, Weike; Li, Ying; Hou, Xilin

    2017-01-01

    The CDPK-SnRK (calcium-dependent protein kinase/Snf1-related protein kinase) gene superfamily plays important roles in signaling pathways for disease resistance and various stress responses, as indicated by emerging evidence. In this study, we constructed comparative analyses of gene structure, retention, expansion, whole-genome duplication (WGD) and expression patterns of CDPK-SnRK genes in Brassica rapa and their evolution in plants. A total of 49 BrCPKs, 14 BrCRKs, 3 BrPPCKs, 5 BrPEPRKs, and 56 BrSnRKs were identified in B. rapa. All BrCDPK-SnRK proteins had highly conserved kinase domains. By statistical analysis of the number of CDPK-SnRK genes in each species, we found that the expansion of the CDPK-SnRK gene family started from angiosperms. Segmental duplication played a predominant role in CDPK-SnRK gene expansion. The analysis showed that PEPRK was more preferentially retained than other subfamilies and that CPK was retained similarly to SnRK. Among the CPKs and SnRKs, CPKIII and SnRK1 genes were more preferentially retained than other groups. CRK was closest to CPK, which may share a common evolutionary origin. In addition, we identified 196 CPK genes and 252 SnRK genes in 6 species, and their different expansion and evolution types were discovered. Furthermore, the expression of BrCDPK-SnRK genes is dynamic in different tissues as well as in response to abiotic stresses, demonstrating their important roles in development in B. rapa. In summary, this study provides genome-wide insight into the evolutionary history and mechanisms of CDPK-SnRK genes following whole-genome triplication in B. rapa. PMID:28239387

  10. Need for higher order polynomial basis for polynomial nodal methods employed in LWR calculations

    SciTech Connect

    Taiwo, T.A.; Palmiotti, G.

    1997-08-01

    The paper evaluates the accuracy and efficiency of sixth order polynomial solutions and the use of one radial node per core assembly for pressurized water reactor (PWR) core power distributions and reactivities. The computer code VARIANT was modified to calculate sixth order polynomial solutions for a hot zero power benchmark problem in which a control assembly along a core axis is assumed to be out of the core. Results are presented for the VARIANT, DIF3D-NODAL, and DIF3D-finite difference codes. The VARIANT results indicate that second order expansion of the within-node source and linear representation of the node surface currents are adequate for this problem. The results also demonstrate the improvement in the VARIANT solution when the order of the polynomial expansion of the within-node flux is increased from fourth to sixth order. There is a substantial saving in computational time for using one radial node per assembly with the sixth order expansion compared to using four or more nodes per assembly and fourth order polynomial solutions. 11 refs., 1 tab.

  11. Polynomial compensation, inversion, and approximation of discrete time linear systems

    NASA Technical Reports Server (NTRS)

    Baram, Yoram

    1987-01-01

    The least-squares transformation of a discrete-time multivariable linear system into a desired one by convolving the first with a polynomial system yields optimal polynomial solutions to the problems of system compensation, inversion, and approximation. The polynomial coefficients are obtained from the solution to a so-called normal linear matrix equation, whose coefficients are shown to be the weighting patterns of certain linear systems. These, in turn, can be used in the recursive solution of the normal equation.

  12. Conventional modeling of the multilayer perceptron using polynomial basis functions

    NASA Technical Reports Server (NTRS)

    Chen, Mu-Song; Manry, Michael T.

    1993-01-01

    A technique for modeling the multilayer perceptron (MLP) neural network, in which input and hidden units are represented by polynomial basis functions (PBFs), is presented. The MLP output is expressed as a linear combination of the PBFs and can therefore be expressed as a polynomial function of its inputs. Thus, the MLP is isomorphic to conventional polynomial discriminant classifiers or Volterra filters. The modeling technique was successfully applied to several trained MLP networks.

  13. Shaping plant development through the SnRK1-TOR metabolic regulators.

    PubMed

    Baena-González, Elena; Hanson, Johannes

    2017-02-01

    SnRK1 (Snf1-related protein kinase 1) and TOR (target of rapamycin) are evolutionarily conserved protein kinases that lie at the heart of energy sensing, playing central and antagonistic roles in the regulation of metabolism and gene expression. Increasing evidence links these metabolic regulators to numerous aspects of plant development, from germination to flowering and senescence. This prompts the hypothesis that SnRK1 and TOR modify developmental programs according to the metabolic status to adjust plant growth to a specific environment. The aim of this review is to provide support to this hypothesis and to incentivize further studies on this topic by summarizing the work that establishes a genetic connection between SnRK1-TOR and plant development.

  14. Tutte Polynomial of Pseudofractal Scale-Free Web

    NASA Astrophysics Data System (ADS)

    Peng, Junhao; Xiong, Jian; Xu, Guoai

    2015-06-01

    The Tutte polynomial of a graph is a 2-variable polynomial which is quite important in both Combinatorics and Statistical physics. It contains various numerical invariants and polynomial invariants, such as the number of spanning trees, the number of spanning forests, the number of acyclic orientations, the reliability polynomial, chromatic polynomial and flow polynomial. In this paper, we study and obtain a recursive formula for the Tutte polynomial of pseudofractal scale-free web (PSFW), and thus logarithmic complexity algorithm to calculate the Tutte polynomial of the PSFW is obtained, although it is NP-hard for general graph. By solving the recurrence relations derived from the Tutte polynomial, the rigorous solution for the number of spanning trees of the PSFW is obtained. Therefore, an alternative approach to determine explicitly the number of spanning trees of the PSFW is given. Furthermore, we analyze the all-terminal reliability of the PSFW and compare the results with those of the Sierpinski gasket which has the same number of nodes and edges as the PSFW. In contrast with the well-known conclusion that inhomogeneous networks (e.g., scale-free networks) are more robust than homogeneous networks (i.e., networks in which each node has approximately the same number of links) with respect to random deletion of nodes, the Sierpinski gasket (which is a homogeneous network), as our results show, is more robust than the PSFW (which is an inhomogeneous network) with respect to random edge failures.

  15. Some properties of multiple orthogonal polynomials associated with Macdonald functions

    NASA Astrophysics Data System (ADS)

    Coussement, Els; van Assche, Walter

    2001-08-01

    Multiple orthogonal polynomials corresponding to two weights on [0,[infinity]) associated with modified Bessel functions (Macdonald functions) K[nu] and K[nu]+1 were introduced in Van Assche, Yakubovich (Integral Transforms Special Funct. 9 (2000) 229-244) and recently also studied by Ben Cheikh, Douak (Meth. Appl. Anal., to appear). We obtain explicit formulas for type I vector polynomials (An,n,Bn,n) and (An+1,n,Bn+1,n) and for type II polynomials Pn,n and Pn+1,n. We also obtain generating functions for types I and II polynomials.

  16. Quantum algorithms for virtual Jones polynomials via Thistlethwaite theorems

    NASA Astrophysics Data System (ADS)

    Vélez, Mario; Ospina, Juan

    2010-04-01

    Recently a quantum algorithm for the Jones polynomial of virtual links was proposed by Kauffman and Dye via the implementation of the virtual braid group in anyonic topological quantum computation when the virtual crossings are considered as generalized swap gates. Also recently, a mathematical method for the computation of the Jones polynomial of a given virtual link in terms of the relative Tuttle polynomial of its face (Tait) graph with some suitable variable substitutions was proposed by Diao and Hetyei. The method of Diao and Hetyei is offered as an alternative to the ribbon graph approach according to which the Tutte polynomial of a given virtual link is computed in terms of the Bollobás- Riordan polynomial of the corresponding ribbon graph. The method of Diao and Hetyei can be considered as an extension of the celebrated Thistlethwaite theorem according to which invariant polynomials for knots and links are derived from invariant polynomials for graphs. Starting from these ideas we propose a quantum algorithm for the Jones polynomial of a given virtual link in terms of the generalized Tutte polynomials by exploiting the Thistlethwaite theorem and the Kauffman algorithm . Our method is claimed as the quantum version of the Diao-Hetyei method. Possible supersymmetric implementations of our algortihm are discussed jointly with its formulations using topological quantum lambda calculus.

  17. Using Tutte polynomials to characterize sexual contact networks

    NASA Astrophysics Data System (ADS)

    Cadavid Muñoz, Juan José

    2014-06-01

    Tutte polynomials are used to characterize the dynamic and topology of the sexual contact networks, in which pathogens are transmitted as an epidemic. Tutte polynomials provide an algebraic characterization of the sexual contact networks and allow the projection of spread control strategies for sexual transmission diseases. With the usage of Tutte polynomials, it allows obtaining algebraic expressions for the basic reproductive number of different pathogenic agents. Computations are done using the computer algebra software Maple, and it's GraphTheory Package. The topological complexity of a contact network is represented by the algebraic complexity of the correspondent polynomial. The change in the topology of the contact network is represented as a change in the algebraic form of the associated polynomial. With the usage of the Tutte polynomials, the number of spanning trees for each contact network can be obtained. From the obtained results in the polynomial form, it can be said that Tutte polynomials are of great importance for designing and implementing control measures for slowing down the propagation of sexual transmitted pathologies. As a future research line, the analysis of weighted sexual contact networks using weighted Tutte polynomials is considered.

  18. Return times of polynomials as meta-Fibonacci numbers

    NASA Astrophysics Data System (ADS)

    Emerson, Nathaniel D.

    We consider generalized closest return times of a complex polynomial of degree at least two. Most previous studies on this subject have focused on the properties of polynomials with particular return times, especially the Fibonacci numbers. We study the general form of these closest return times. The main result of this paper is that these closest return times are meta-Fibonacci numbers. In particular, this result applies to the return times of a principal nest of a polynomial. Furthermore, we show that an analogous result holds in a tree with dynamics that is associated with a polynomial.

  19. Chern-Simons matrix models and Stieltjes-Wigert polynomials

    SciTech Connect

    Dolivet, Yacine; Tierz, Miguel

    2007-02-15

    Employing the random matrix formulation of Chern-Simons theory on Seifert manifolds, we show how the Stieltjes-Wigert orthogonal polynomials are useful in exact computations in Chern-Simons matrix models. We construct a biorthogonal extension of the Stieltjes-Wigert polynomials, not available in the literature, necessary to study Chern-Simons matrix models when the geometry is a lens space. We also study the relationship between Stieltjes-Wigert and Rogers-Szegoe polynomials and the corresponding equivalence with a unitary matrix model. Finally, we give a detailed proof of a result that relates quantum dimensions with averages of Schur polynomials in the Stieltjes-Wigert ensemble.

  20. Multi-indexed Jacobi polynomials and Maya diagrams

    NASA Astrophysics Data System (ADS)

    Takemura, Kouichi

    2014-11-01

    Multi-indexed Jacobi polynomials are defined by the Wronskian of four types of eigenfunctions of the Pöschl-Teller Hamiltonian. We give a correspondence between multi-indexed Jacobi polynomials and pairs of Maya diagrams, and we show that any multi-indexed Jacobi polynomial is essentially equal to some multi-indexed Jacobi polynomial of two types of eigenfunction. As an application, we show a Wronskian-type formula of some special eigenstates of the deformed Pöschl-Teller Hamiltonian.

  1. Application of field dependent polynomial model

    NASA Astrophysics Data System (ADS)

    Janout, Petr; Páta, Petr; Skala, Petr; Fliegel, Karel; Vítek, Stanislav; Bednář, Jan

    2016-09-01

    Extremely wide-field imaging systems have many advantages regarding large display scenes whether for use in microscopy, all sky cameras, or in security technologies. The Large viewing angle is paid by the amount of aberrations, which are included with these imaging systems. Modeling wavefront aberrations using the Zernike polynomials is known a longer time and is widely used. Our method does not model system aberrations in a way of modeling wavefront, but directly modeling of aberration Point Spread Function of used imaging system. This is a very complicated task, and with conventional methods, it was difficult to achieve the desired accuracy. Our optimization techniques of searching coefficients space-variant Zernike polynomials can be described as a comprehensive model for ultra-wide-field imaging systems. The advantage of this model is that the model describes the whole space-variant system, unlike the majority models which are partly invariant systems. The issue that this model is the attempt to equalize the size of the modeled Point Spread Function, which is comparable to the pixel size. Issues associated with sampling, pixel size, pixel sensitivity profile must be taken into account in the design. The model was verified in a series of laboratory test patterns, test images of laboratory light sources and consequently on real images obtained by an extremely wide-field imaging system WILLIAM. Results of modeling of this system are listed in this article.

  2. Tabulating knot polynomials for arborescent knots

    NASA Astrophysics Data System (ADS)

    Mironov, A.; Morozov, A.; Morozov, A.; Ramadevi, P.; Singh, Vivek Kumar; Sleptsov, A.

    2017-02-01

    Arborescent knots are those which can be represented in terms of double fat graphs or equivalently as tree Feynman diagrams. This is the class of knots for which the present knowledge is sufficient for lifting topological description to the level of effective analytical formulas. The paper describes the origin and structure of the new tables of colored knot polynomials, which will be posted at the dedicated site (http://knotebook.org). Even if formal expressions are known in terms of modular transformation matrices, the computation in finite time requires additional ideas. We use the ‘family’ approach, suggested in Mironov and Morozov (2015 Nucl. Phys. B 899 395–413), and apply it to arborescent knots in the Rolfsen table by developing a Feynman diagram technique, associated with an auxiliary matrix model field theory. Gauge invariance in this theory helps to provide meaning to Racah matrices in the case of non-trivial multiplicities and explains the need for peculiar sign prescriptions in the calculation of [21]-colored HOMFLY-PT polynomials.

  3. On factorization of generalized Macdonald polynomials

    NASA Astrophysics Data System (ADS)

    Kononov, Ya.; Morozov, A.

    2016-08-01

    A remarkable feature of Schur functions—the common eigenfunctions of cut-and-join operators from W_∞ —is that they factorize at the peculiar two-parametric topological locus in the space of time variables, which is known as the hook formula for quantum dimensions of representations of U_q(SL_N) and which plays a big role in various applications. This factorization survives at the level of Macdonald polynomials. We look for its further generalization to generalized Macdonald polynomials (GMPs), associated in the same way with the toroidal Ding-Iohara-Miki algebras, which play the central role in modern studies in Seiberg-Witten-Nekrasov theory. In the simplest case of the first-coproduct eigenfunctions, where GMP depend on just two sets of time variables, we discover a weak factorization—on a one- (rather than four-) parametric slice of the topological locus, which is already a very non-trivial property, calling for proof and better understanding.

  4. Seizure prediction using polynomial SVM classification.

    PubMed

    Zisheng Zhang; Parhi, Keshab K

    2015-08-01

    This paper presents a novel patient-specific algorithm for prediction of seizures in epileptic patients with low hardware complexity and low power consumption. In the proposed approach, we first compute the spectrogram of the input fragmented EEG signals from a few electrodes. Each fragmented data clip is ten minutes in duration. Band powers, relative spectral powers and ratios of spectral powers are extracted as features. The features are then subjected to electrode selection and feature selection using classification and regression tree. The baseline experiment uses all features from selected electrodes and these features are then subjected to a radial basis function kernel support vector machine (RBF-SVM) classifier. The proposed method further selects a small number features from the selected electrodes and train a polynomial support vector machine (SVM) classifier with degree of 2 on these features. Prediction performances are compared between the baseline experiment and the proposed method. The algorithm is tested using intra-cranial EEG (iEEG) from the American Epilepsy Society Seizure Prediction Challenge database. The baseline experiment using a large number of features and RBF-SVM achieves a 100% sensitivity and an average AUC of 0.9985, while the proposed algorithm using only a small number of features and polynomial SVM with degree of 2 can achieve a sensitivity of 100.0%, an average area under curve (AUC) of 0.9795. For both experiments, only 10% of the available training data are used for training.

  5. Simulation of Experimental Parameters of RC Beams by Employing the Polynomial Regression Method

    NASA Astrophysics Data System (ADS)

    Sayin, B.; Sevgen, S.; Samli, R.

    2016-07-01

    A numerical model based on the method polynomial regression is developed to simulate the mechanical behavior of reinforced concrete beams strengthened with a carbon-fiber-reinforced polymer and subjected to four-point bending. The results obtained are in good agreement with data of laboratory tests.

  6. Cloning and characterization of a SnRK1-encoding gene from Malus hupehensis Rehd. and heterologous expression in tomato.

    PubMed

    Li, Guangjie; Peng, Futian; Zhang, Lin; Shi, Xingzheng; Wang, Zhaoyan

    2010-02-01

    Sucrose non-fermenting-1-related protein kinase-1 (SnRK1) plays an important role in metabolic regulation in plant. To understand the molecular mechanism of amino acids and carbohydrate metabolism in Malus hupehensis Rehd. var. pinyiensis Jiang (Pingyi Tiancha, PYTC), a full-length cDNA clone encoding homologue of SnRK1 was isolated from PYTC by Rapid Amplification of cDNA Ends (RACE). The clone, designated as MhSnRK1, contains 2063 nucleotides with an open reading frame of 1548 nucleotides. The deduced 515 amino acids showed high identities with other plant SnRK1 genes. Quantitative real-time PCR analysis revealed this gene was expressed in roots, stems and leaves. Exposing seedlings to nitrate caused and initial decrease in expression of the MhSnRK1 gene in roots, leaves and stems in short term. Ectopic expression of MhSnRK1 in tomato mainly resulted in higher starch content in leaf and red-ripening fruit than wild-type plants. This result supports the hypothesis that overexpression of SnRK1 causes the accumulation of starch in plant cells. All the results suggest that MhSnRK1 may play important roles in carbohydrate and amino acid metabolisms.

  7. Structural basis for basal activity and autoactivation of abscisic acid (ABA) signaling SnRK2 kinases

    PubMed Central

    Ng, Ley-Moy; Soon, Fen-Fen; Zhou, X. Edward; West, Graham M.; Kovach, Amanda; Suino-Powell, Kelly M.; Chalmers, Michael J.; Li, Jun; Yong, Eu-Leong; Zhu, Jian-Kang; Griffin, Patrick R.; Melcher, Karsten; Xu, H. Eric

    2011-01-01

    Abscisic acid (ABA) is an essential hormone that controls plant growth, development, and responses to abiotic stresses. Central for ABA signaling is the ABA-mediated autoactivation of three monomeric Snf1-related kinases (SnRK2.2, -2.3, and -2.6). In the absence of ABA, SnRK2s are kept in an inactive state by forming physical complexes with type 2C protein phosphatases (PP2Cs). Upon relief of this inhibition, SnRK2 kinases can autoactivate through unknown mechanisms. Here, we report the crystal structures of full-length Arabidopsis thaliana SnRK2.3 and SnRK2.6 at 1.9- and 2.3-Å resolution, respectively. The structures, in combination with biochemical studies, reveal a two-step mechanism of intramolecular kinase activation that resembles the intermolecular activation of cyclin-dependent kinases. First, release of inhibition by PP2C allows the SnRK2s to become partially active because of an intramolecular stabilization of the catalytic domain by a conserved helix in the kinase regulatory domain. This stabilization enables SnRK2s to gain full activity by activation loop autophosphorylation. Autophosphorylation is more efficient in SnRK2.6, which has higher stability than SnRK2.3 and has well-structured activation loop phosphate acceptor sites that are positioned next to the catalytic site. Together, these data provide a structural framework that links ABA-mediated release of PP2C inhibition to activation of SnRK2 kinases. PMID:22160701

  8. Structural basis for basal activity and autoactivation of abscisic acid (ABA) signaling SnRK2 kinases

    SciTech Connect

    Ng, Ley-Moy; Soon, Fen-Fen; Zhou, X. Edward; West, Graham M.; Kovach, Amanda; Suino-Powell, Kelly M.; Chalmers, Michael J.; Li, Jun; Yong, Eu-Leong; Zhu, Jian-Kang; Griffin, Patrick R.; Melcher, Karsten; Xu, H. Eric

    2014-10-02

    Abscisic acid (ABA) is an essential hormone that controls plant growth, development, and responses to abiotic stresses. Central for ABA signaling is the ABA-mediated autoactivation of three monomeric Snf1-related kinases (SnRK2.2, -2.3, and -2.6). In the absence of ABA, SnRK2s are kept in an inactive state by forming physical complexes with type 2C protein phosphatases (PP2Cs). Upon relief of this inhibition, SnRK2 kinases can autoactivate through unknown mechanisms. Here, we report the crystal structures of full-length Arabidopsis thaliana SnRK2.3 and SnRK2.6 at 1.9- and 2.3-{angstrom} resolution, respectively. The structures, in combination with biochemical studies, reveal a two-step mechanism of intramolecular kinase activation that resembles the intermolecular activation of cyclin-dependent kinases. First, release of inhibition by PP2C allows the SnRK2s to become partially active because of an intramolecular stabilization of the catalytic domain by a conserved helix in the kinase regulatory domain. This stabilization enables SnRK2s to gain full activity by activation loop autophosphorylation. Autophosphorylation is more efficient in SnRK2.6, which has higher stability than SnRK2.3 and has well-structured activation loop phosphate acceptor sites that are positioned next to the catalytic site. Together, these data provide a structural framework that links ABA-mediated release of PP2C inhibition to activation of SnRK2 kinases.

  9. Uncertainty Analysis via Failure Domain Characterization: Polynomial Requirement Functions

    NASA Technical Reports Server (NTRS)

    Crespo, Luis G.; Munoz, Cesar A.; Narkawicz, Anthony J.; Kenny, Sean P.; Giesy, Daniel P.

    2011-01-01

    This paper proposes an uncertainty analysis framework based on the characterization of the uncertain parameter space. This characterization enables the identification of worst-case uncertainty combinations and the approximation of the failure and safe domains with a high level of accuracy. Because these approximations are comprised of subsets of readily computable probability, they enable the calculation of arbitrarily tight upper and lower bounds to the failure probability. A Bernstein expansion approach is used to size hyper-rectangular subsets while a sum of squares programming approach is used to size quasi-ellipsoidal subsets. These methods are applicable to requirement functions whose functional dependency on the uncertainty is a known polynomial. Some of the most prominent features of the methodology are the substantial desensitization of the calculations from the uncertainty model assumed (i.e., the probability distribution describing the uncertainty) as well as the accommodation for changes in such a model with a practically insignificant amount of computational effort.

  10. TreeCmp: Comparison of Trees in Polynomial Time

    PubMed Central

    Bogdanowicz, Damian; Giaro, Krzysztof; Wróbel, Borys

    2012-01-01

    When a phylogenetic reconstruction does not result in one tree but in several, tree metrics permit finding out how far the reconstructed trees are from one another. They also permit to assess the accuracy of a reconstruction if a true tree is known. TreeCmp implements eight metrics that can be calculated in polynomial time for arbitrary (not only bifurcating) trees: four for unrooted (Matching Split metric, which we have recently proposed, Robinson-Foulds, Path Difference, Quartet) and four for rooted trees (Matching Cluster, Robinson-Foulds cluster, Nodal Splitted and Triple). TreeCmp is the first implementation of Matching Split/Cluster metrics and the first efficient and convenient implementation of Nodal Splitted. It allows to compare relatively large trees. We provide an example of the application of TreeCmp to compare the accuracy of ten approaches to phylogenetic reconstruction with trees up to 5000 external nodes, using a measure of accuracy based on normalized similarity between trees.

  11. Experimental evaluation of chromatic dispersion estimation method using polynomial fitting

    NASA Astrophysics Data System (ADS)

    Jiang, Xin; Wang, Junyi; Pan, Zhongqi

    2014-11-01

    We experimentally validate a non-data-aided, modulation-format independent chromatic dispersion (CD) estimation method based on polynomial fitting algorithm in single-carrier coherent optical system with a 40 Gb/s polarization-division-multiplexed quadrature-phase-shift-keying (PDM-QPSK) system. The non-data-aided CD estimation for arbitrary modulation formats is achieved by measuring the differential phase between frequency f±fs/2 (fs is the symbol rate) in digital coherent receivers. The estimation range for a 40 Gb/s PDM-QPSK signal can be up to 20,000 ps/nm with a measurement accuracy of ±200 ps/nm. The maximum CD measurement is 25,000 ps/nm with a measurement error of 2%.

  12. D-Pseudo-Bosons, Complex Hermite Polynomials, and Integral Quantization

    NASA Astrophysics Data System (ADS)

    Ali, S. Twareque; Bagarello, Fabio; Gazeau, Jean Pierre

    2015-10-01

    The D-pseudo-boson formalism is illustrated with two examples. The first one involves deformed complex Hermite polynomials built using finite-dimensional irreducible representations of the group GL(2,C) of invertible 2 × 2 matrices with complex entries. It reveals interesting aspects of these representations. The second example is based on a pseudo-bosonic generalization of operator-valued functions of a complex variable which resolves the identity. We show that such a generalization allows one to obtain a quantum pseudo-bosonic version of the complex plane viewed as the canonical phase space and to understand functions of the pseudo-bosonic operators as the quantized versions of functions of a complex variable.

  13. Lagrange-Lobatto interpolating polynomials in the discrete variable representation.

    PubMed

    Rayson, M J

    2007-08-01

    The discrete variable representation (DVR) is a well known and widely used computational technique in many areas of physics. Recently, the Lagrange-Lobatto basis has attracted increasing attention, especially for radial Hamiltonians with a singular potential at the origin and finite element DVR constructions. However, unlike standard DVR functions, the Lagrange-Lobatto basis functions are not orthogonal. The overlap matrix is usually approximated as the identity using the same quadrature approximation as for the potential. Based on the special properties of overlap matrix of Lagrange-Lobatto polynomials, an explanation of the success of the identity approximation, including error bounds, is presented. Results for hydrogen and the more nontrivial potentials of self-consistent all-electron density functional atomic calculations are also given.

  14. Animating Nested Taylor Polynomials to Approximate a Function

    ERIC Educational Resources Information Center

    Mazzone, Eric F.; Piper, Bruce R.

    2010-01-01

    The way that Taylor polynomials approximate functions can be demonstrated by moving the center point while keeping the degree fixed. These animations are particularly nice when the Taylor polynomials do not intersect and form a nested family. We prove a result that shows when this nesting occurs. The animations can be shown in class or…

  15. Animating Nested Taylor Polynomials to Approximate a Function

    ERIC Educational Resources Information Center

    Mazzone, Eric F.; Piper, Bruce R.

    2010-01-01

    The way that Taylor polynomials approximate functions can be demonstrated by moving the center point while keeping the degree fixed. These animations are particularly nice when the Taylor polynomials do not intersect and form a nested family. We prove a result that shows when this nesting occurs. The animations can be shown in class or…

  16. Current advances on polynomial resultant formulations

    NASA Astrophysics Data System (ADS)

    Sulaiman, Surajo; Aris, Nor'aini; Ahmad, Shamsatun Nahar

    2017-08-01

    Availability of computer algebra systems (CAS) lead to the resurrection of the resultant method for eliminating one or more variables from the polynomials system. The resultant matrix method has advantages over the Groebner basis and Ritt-Wu method due to their high complexity and storage requirement. This paper focuses on the current resultant matrix formulations and investigates their ability or otherwise towards producing optimal resultant matrices. A determinantal formula that gives exact resultant or a formulation that can minimize the presence of extraneous factors in the resultant formulation is often sought for when certain conditions that it exists can be determined. We present some applications of elimination theory via resultant formulations and examples are given to explain each of the presented settings.

  17. The evolution of piecewise polynomial wave functions

    NASA Astrophysics Data System (ADS)

    Andrews, Mark

    2017-01-01

    For a non-relativistic particle, we consider the evolution of wave functions that consist of polynomial segments, usually joined smoothly together. These spline wave functions are compact (that is, they are initially zero outside a finite region), but they immediately extend over all available space as they evolve. The simplest splines are the square and triangular wave functions in one dimension, but very complicated splines have been used in physics. In general the evolution of such spline wave functions can be expressed in terms of antiderivatives of the propagator; in the case of a free particle or an oscillator, all the evolutions are expressed exactly in terms of Fresnel integrals. Some extensions of these methods to two and three dimensions are discussed.

  18. Polynomial Monogamy Relations for Entanglement Negativity

    NASA Astrophysics Data System (ADS)

    Allen, Grant W.; Meyer, David A.

    2017-02-01

    The notion of nonclassical correlations is a powerful contrivance for explaining phenomena exhibited in quantum systems. It is well known, however, that quantum systems are not free to explore arbitrary correlations—the church of the smaller Hilbert space only accepts monogamous congregants. We demonstrate how to characterize the limits of what is quantum mechanically possible with a computable measure, entanglement negativity. We show that negativity only saturates the standard linear monogamy inequality in trivial cases implied by its monotonicity under local operations and classical communication, and derive a necessary and sufficient inequality which, for the first time, is a nonlinear higher degree polynomial. For very large quantum systems, we prove that the negativity can be distributed at least linearly for the tightest constraint and conjecture that it is at most linear.

  19. Schur polynomials and biorthogonal random matrix ensembles

    NASA Astrophysics Data System (ADS)

    Tierz, Miguel

    2010-06-01

    The study of the average of Schur polynomials over a Stieltjes-Wigert ensemble has been carried out by Dolivet and Tierz [J. Math. Phys. 48, 023507 (2007); e-print arXiv:hep-th/0609167], where it was shown that it is equal to quantum dimensions. Using the same approach, we extend the result to the biorthogonal case. We also study, using the Littlewood-Richardson rule, some particular cases of the quantum dimension result. Finally, we show that the notion of Giambelli compatibility of Schur averages, introduced by Borodin et al. [Adv. Appl. Math. 37, 209 (2006); e-print arXiv:math-ph/0505021], also holds in the biorthogonal setting.

  20. Approximate protein structural alignment in polynomial time

    PubMed Central

    Kolodny, Rachel; Linial, Nathan

    2004-01-01

    Alignment of protein structures is a fundamental task in computational molecular biology. Good structural alignments can help detect distant evolutionary relationships that are hard or impossible to discern from protein sequences alone. Here, we study the structural alignment problem as a family of optimization problems and develop an approximate polynomial-time algorithm to solve them. For a commonly used scoring function, the algorithm runs in O(n10/ε6) time, for globular protein of length n, and it detects alignments that score within an additive error of ε from all optima. Thus, we prove that this task is computationally feasible, although the method that we introduce is too slow to be a useful everyday tool. We argue that such approximate solutions are, in fact, of greater interest than exact ones because of the noisy nature of experimentally determined protein coordinates. The measurement of similarity between a pair of protein structures used by our algorithm involves the Euclidean distance between the structures (appropriately rigidly transformed). We show that an alternative approach, which relies on internal distance matrices, must incorporate sophisticated geometric ingredients if it is to guarantee optimality and run in polynomial time. We use these observations to visualize the scoring function for several real instances of the problem. Our investigations yield insights on the computational complexity of protein alignment under various scoring functions. These insights can be used in the design of scoring functions for which the optimum can be approximated efficiently and perhaps in the development of efficient algorithms for the multiple structural alignment problem. PMID:15304646

  1. Multiple Meixner polynomials and non-Hermitian oscillator Hamiltonians

    NASA Astrophysics Data System (ADS)

    Ndayiragije, F.; Van Assche, W.

    2013-12-01

    Multiple Meixner polynomials are polynomials in one variable which satisfy orthogonality relations with respect to r > 1 different negative binomial distributions (Pascal distributions). There are two kinds of multiple Meixner polynomials, depending on the selection of the parameters in the negative binomial distribution. We recall their definition and some formulas and give generating functions and explicit expressions for the coefficients in the nearest neighbor recurrence relation. Following a recent construction of Miki, Tsujimoto, Vinet and Zhedanov (for multiple Meixner polynomials of the first kind), we construct r > 1 non-Hermitian oscillator Hamiltonians in r dimensions which are simultaneously diagonalizable and for which the common eigenstates are expressed in terms of multiple Meixner polynomials of the second kind.

  2. Approximating smooth functions using algebraic-trigonometric polynomials

    NASA Astrophysics Data System (ADS)

    Sharapudinov, Idris I.

    2011-01-01

    The problem under consideration is that of approximating classes of smooth functions by algebraic-trigonometric polynomials of the form p_n(t)+\\tau_m(t), where p_n(t) is an algebraic polynomial of degree n and \\tau_m(t)=a_0+\\sum_{k=1}^ma_k\\cos k\\pi t+b_k\\sin k\\pi t is a trigonometric polynomial of order m. The precise order of approximation by such polynomials in the classes W^r_\\infty(M) and an upper bound for similar approximations in the class W^r_p(M) with \\frac43 are found. The proof of these estimates uses mixed series in Legendre polynomials which the author has introduced and investigated previously. Bibliography: 13 titles.

  3. Properties of the zeros of generalized basic hypergeometric polynomials

    NASA Astrophysics Data System (ADS)

    Bihun, Oksana; Calogero, Francesco

    2015-11-01

    We define the generalized basic hypergeometric polynomial of degree N in terms of the generalized basic hypergeometric function, by choosing one of its parameters to allow the termination of the series after a finite number of summands. In this paper, we obtain a set of nonlinear algebraic equations satisfied by the N zeros of the polynomial. Moreover, we obtain an N × N matrix M defined in terms of the zeros of the polynomial, which, in turn, depend on the parameters of the polynomial. The eigenvalues of this remarkable matrix M are given by neat expressions that depend only on some of the parameters of the polynomial; that is, the matrix M is isospectral. Moreover, in case the parameters that appear in the expressions for the eigenvalues of M are rational, the matrix M has rational eigenvalues, a Diophantine property.

  4. Robust stability of diamond families of polynomials with complex coefficients

    NASA Technical Reports Server (NTRS)

    Xu, Zhong Ling

    1993-01-01

    Like the interval model of Kharitonov, the diamond model proves to be an alternative powerful device for taking into account the variation of parameters in prescribed ranges. The robust stability of some kinds of diamond polynomial families with complex coefficients are discussed. By exploiting the geometric characterizations of their value sets, we show that, for the family of polynomials with complex coefficients and both their real and imaginary parts lying in a diamond, the stability of eight specially selected extreme point polynomials is necessary as well as sufficient for the stability of the whole family. For the so-called simplex family of polynomials, four extreme point and four exposed edge polynomials of this family need to be checked for the stability of the entire family. The relations between the stability of various diamonds are also discussed.

  5. Approximating smooth functions using algebraic-trigonometric polynomials

    SciTech Connect

    Sharapudinov, Idris I

    2011-01-14

    The problem under consideration is that of approximating classes of smooth functions by algebraic-trigonometric polynomials of the form p{sub n}(t)+{tau}{sub m}(t), where p{sub n}(t) is an algebraic polynomial of degree n and {tau}{sub m}(t)=a{sub 0}+{Sigma}{sub k=1}{sup m}a{sub k} cos k{pi}t + b{sub k} sin k{pi}t is a trigonometric polynomial of order m. The precise order of approximation by such polynomials in the classes W{sup r}{sub {infinity}(}M) and an upper bound for similar approximations in the class W{sup r}{sub p}(M) with 4/3polynomials which the author has introduced and investigated previously. Bibliography: 13 titles.

  6. Impact of the ATATÜRK DAM Lake on Agro-Meteorological Aspects of the Southeastern Anatolia Region Using Remote Sensing and GIS Analysis

    NASA Astrophysics Data System (ADS)

    Ozcan, O.; Bookhagen, B.; Musaoglu, N.

    2012-07-01

    meteorological time series. For all images, geometric corrections including digital elevation information and Tasseled Cap transformations were carried out to attain changes in surface reflectance and denoting disturbance of Landsat reflectance data. Consequently, thematic maps of the affected areas were created by using appropriate visualization and classification techniques in conjunction with geographical information system. The resulting dataset was used in a linear trend analysis to characterize spatiotemporal patterns of vegetation-cover development. Analysis has been conducted in ecological units that have been determined by climate and land cover/use. Based on the results of the trend analysis and the primary factor analysis, selected parts of South-eastern Anatolia region are analyzed. The results showed that approximately 368 km2 of agricultural fields have been affected because of inundation due to the Atatürk Dam Lake. However, irrigated agricultural fields have been increased by 56.3% of the total area (1552 km2 of 2756km2) on Harran Plain within the period of 1984 - 2011. This study presents an effective method for time-series analysis that can be used to regularly monitor irrigated fields in the Southeastern Anatolia region.

  7. The VicRK system of Streptococcus mutans responds to oxidative stress.

    PubMed

    Deng, D M; Liu, M J; ten Cate, J M; Crielaard, W

    2007-07-01

    In Streptococcus mutans, virulence and cariogenicity may be modulated via the two-component regulatory system VicRK. Environmental signals, sensed by VicK, inducing this modulation are still unclear, however, and were investigated in the present study. We found that VicRK displays homology with protein-domains that, in other bacteria, are involved in redox-sensing. After constructing a VicRK-promoter GFP-reporter strain, we showed increased fluorescence intensity under oxidative stress. Potential interference of alternative signals and experimental conditions on GFP expression was excluded by the use of negative and positive control strains. Finally, we constructed a clean vicK knockout mutant, which proved to be more sensitive to H(2)O(2) than the wild-type. In conclusion, this study showed that the VicRK system responds to and protects against oxidative stress. As a result, a link between oxidative/redox stress and the cariogenic nature of S. mutans can be hypothesized.

  8. A light Z' for the RK puzzle and nonstandard neutrino interactions

    DOE PAGES

    Datta, Alakabha; Liao, Jiajun; Marfatia, Danny

    2017-03-01

    We show that the RK puzzle in LHCb data and the discrepancy in the anomalous magnetic moment of the muon can be simultaneously explained if a 10 MeV mass Z' boson couples to the muon but not the electron, and that clear evidence of the nonstandard matter interactions of neutrinos induced by this coupling may be found at DUNE.

  9. Lotus japonicus symRK-14 uncouples the cortical and epidermal symbiotic program.

    PubMed

    Kosuta, Sonja; Held, Mark; Hossain, Md Shakhawat; Morieri, Giulia; Macgillivary, Amanda; Johansen, Christopher; Antolín-Llovera, Meritxell; Parniske, Martin; Oldroyd, Giles E D; Downie, Allan J; Karas, Bogumil; Szczyglowski, Krzysztof

    2011-09-01

    SYMRK is a leucine-rich-repeat (LRR)-receptor kinase that mediates intracellular symbioses of legumes with rhizobia and arbuscular mycorrhizal fungi. It participates in signalling events that lead to epidermal calcium spiking, an early cellular response that is typically considered as central for intracellular accommodation and nodule organogenesis. Here, we describe the Lotus japonicus symRK-14 mutation that alters a conserved GDPC amino-acid sequence in the SYMRK extracellular domain. Normal infection of the epidermis by fungal or bacterial symbionts was aborted in symRK-14. Likewise, epidermal responses of symRK-14 to bacterial signalling, including calcium spiking, NIN gene expression and infection thread formation, were significantly reduced. In contrast, no major negative effects on the formation of nodule primordia and cortical infection were detected. Cumulatively, our data show that the symRK-14 mutation uncouples the epidermal and cortical symbiotic program, while indicating that the SYMRK extracellular domain participates in transduction of non-equivalent signalling events. The GDPC sequence was found to be highly conserved in LRR-receptor kinases in legumes and non-legumes, including the evolutionarily distant bryophytes. Conservation of the GDPC sequence in nearly one-fourth of LRR-receptor-like kinases in the genome of Arabidopsis thaliana suggests, however, that this sequence might also play an important non-symbiotic function in this plant.

  10. RK2 plasmid dynamics in Caulobacter crescentus cells--two modes of DNA replication initiation.

    PubMed

    Wegrzyn, Katarzyna; Witosinska, Monika; Schweiger, Pawel; Bury, Katarzyna; Jenal, Urs; Konieczny, Igor

    2013-06-01

    Undisturbed plasmid dynamics is required for the stable maintenance of plasmid DNA in bacterial cells. In this work, we analysed subcellular localization, DNA synthesis and nucleoprotein complex formation of plasmid RK2 during the cell cycle of Caulobacter crescentus. Our microscopic observations showed asymmetrical distribution of plasmid RK2 foci between the two compartments of Caulobacter predivisional cells, resulting in asymmetrical allocation of plasmids to progeny cells. Moreover, using a quantitative PCR (qPCR) method, we estimated that multiple plasmid particles form a single fluorescent focus and that the number of plasmids per focus is approximately equal in both swarmer and predivisional Caulobacter cells. Analysis of the dynamics of TrfA-oriV complex formation during the Caulobacter cell cycle revealed that TrfA binds oriV primarily during the G1 phase, however, plasmid DNA synthesis occurs during the S and G2 phases of the Caulobacter cell cycle. Both in vitro and in vivo analysis of RK2 replication initiation in C. crescentus cells demonstrated that it is independent of the Caulobacter DnaA protein in the presence of the longer version of TrfA protein, TrfA-44. However, in vivo stability tests of plasmid RK2 derivatives suggested that a DnaA-dependent mode of plasmid replication initiation is also possible.

  11. The complex becomes more complex: protein-protein interactions of SnRK1 with DUF581 family proteins provide a framework for cell- and stimulus type-specific SnRK1 signaling in plants

    PubMed Central

    Nietzsche, Madlen; Schießl, Ingrid; Börnke, Frederik

    2014-01-01

    In plants, SNF1-related kinase (SnRK1) responds to the availability of carbohydrates as well as to environmental stresses by down-regulating ATP consuming biosynthetic processes, while stimulating energy-generating catabolic reactions through gene expression and post-transcriptional regulation. The functional SnRK1 complex is a heterotrimer where the catalytic α subunit associates with a regulatory β subunit and an activating γ subunit. Several different metabolites as well as the hormone abscisic acid (ABA) have been shown to modulate SnRK1 activity in a cell- and stimulus-type specific manner. It has been proposed that tissue- or stimulus-specific expression of adapter proteins mediating SnRK1 regulation can at least partly explain the differences observed in SnRK1 signaling. By using yeast two-hybrid and in planta bi-molecular fluorescence complementation assays we were able to demonstrate that proteins containing the domain of unknown function (DUF) 581 could interact with both isoforms of the SnRK1α subunit (AKIN10/11) of Arabidopsis. A structure/function analysis suggests that the DUF581 is a generic SnRK1 interaction module and co-expression with DUF581 proteins in plant cells leads to reallocation of the kinase to specific regions within the nucleus. Yeast two-hybrid analyses suggest that SnRK1 and DUF581 proteins share common interaction partners inside the nucleus. The analysis of available microarray data implies that expression of the 19 members of the DUF581 encoding gene family in Arabidopsis is differentially regulated by hormones and environmental cues, indicating specialized functions of individual family members. We hypothesize that DUF581 proteins could act as mediators conferring tissue- and stimulus-type specific differences in SnRK1 regulation. PMID:24600465

  12. The complex becomes more complex: protein-protein interactions of SnRK1 with DUF581 family proteins provide a framework for cell- and stimulus type-specific SnRK1 signaling in plants.

    PubMed

    Nietzsche, Madlen; Schießl, Ingrid; Börnke, Frederik

    2014-01-01

    In plants, SNF1-related kinase (SnRK1) responds to the availability of carbohydrates as well as to environmental stresses by down-regulating ATP consuming biosynthetic processes, while stimulating energy-generating catabolic reactions through gene expression and post-transcriptional regulation. The functional SnRK1 complex is a heterotrimer where the catalytic α subunit associates with a regulatory β subunit and an activating γ subunit. Several different metabolites as well as the hormone abscisic acid (ABA) have been shown to modulate SnRK1 activity in a cell- and stimulus-type specific manner. It has been proposed that tissue- or stimulus-specific expression of adapter proteins mediating SnRK1 regulation can at least partly explain the differences observed in SnRK1 signaling. By using yeast two-hybrid and in planta bi-molecular fluorescence complementation assays we were able to demonstrate that proteins containing the domain of unknown function (DUF) 581 could interact with both isoforms of the SnRK1α subunit (AKIN10/11) of Arabidopsis. A structure/function analysis suggests that the DUF581 is a generic SnRK1 interaction module and co-expression with DUF581 proteins in plant cells leads to reallocation of the kinase to specific regions within the nucleus. Yeast two-hybrid analyses suggest that SnRK1 and DUF581 proteins share common interaction partners inside the nucleus. The analysis of available microarray data implies that expression of the 19 members of the DUF581 encoding gene family in Arabidopsis is differentially regulated by hormones and environmental cues, indicating specialized functions of individual family members. We hypothesize that DUF581 proteins could act as mediators conferring tissue- and stimulus-type specific differences in SnRK1 regulation.

  13. Detergent-Like Activity and α-Helical Structure of Warnericin RK, an Anti-Legionella Peptide

    PubMed Central

    Verdon, Julien; Falge, Mirjam; Maier, Elke; Bruhn, Heike; Steinert, Michael; Faber, Cornelius; Benz, Roland; Héchard, Yann

    2009-01-01

    Abstract Warnericin RK is the first antimicrobial peptide known to be active against Legionella pneumophila, a pathogen bacterium that is responsible for severe pneumonia. Strikingly, this peptide displays a very narrow range of antimicrobial activity, almost limited to the Legionella genus, and a hemolytic activity. A similar activity has been described for δ-lysin, a well-known hemolytic peptide of Staphylococci that has not been described as antimicrobial. In this study we aimed to understand the mode of action of warnericin RK and to explain its particular target specificity. We found that warnericin RK permeabilizes artificial membranes in a voltage-independent manner. Osmotic protection experiments on erythrocytes showed that warnericin RK does not form well-defined pores, suggesting a detergent-like mode of action, as previously described for δ-lysin at high concentrations. Warnericin RK also permeabilized Legionella cells, and these cells displayed a high sensitivity to detergents. Depending on the detergent used, Legionella was from 10- to 1000-fold more sensitive than the other bacteria tested. Finally, the structure of warnericin RK was investigated by means of circular dichroism and NMR spectroscopy. The peptide adopted an amphiphilic α-helical structure, consistent with the proposed mode of action. We conclude that the specificity of warnericin RK toward Legionella results from both the detergent-like mode of action of the peptide and the high sensitivity of these bacteria to detergents. PMID:19804724

  14. A MAP Kinase Kinase Interacts with SymRK and Regulates Nodule Organogenesis in Lotus japonicus[C][W

    PubMed Central

    Chen, Tao; Zhu, Hui; Ke, Danxia; Cai, Kai; Wang, Chao; Gou, Honglan; Hong, Zonglie; Zhang, Zhongming

    2012-01-01

    The symbiosis receptor kinase, SymRK, is required for root nodule development. A SymRK-interacting protein (SIP2) was found to form protein complex with SymRK in vitro and in planta. The interaction between SymRK and SIP2 is conserved in legumes. The SIP2 gene was expressed in all Lotus japonicus tissues examined. SIP2 represents a typical plant mitogen-activated protein kinase kinase (MAPKK) and exhibited autophosphorylation and transphosphorylation activities. Recombinant SIP2 protein could phosphorylate casein and the Arabidopsis thaliana MAP kinase MPK6. SymRK and SIP2 could not use one another as a substrate for phosphorylation. Instead, SymRK acted as an inhibitor of SIP2 kinase when MPK6 was used as a substrate, suggesting that SymRK may serve as a negative regulator of the SIP2 signaling pathway. Knockdown expression of SIP2 via RNA interference (RNAi) resulted in drastic reduction of nodules formed in transgenic hairy roots. A significant portion of SIP2 RNAi hairy roots failed to form a nodule. In these roots, the expression levels of SIP2 and three marker genes for infection thread and nodule primordium formation were downregulated drastically, while the expression of two other MAPKK genes were not altered. These observations demonstrate an essential role of SIP2 in the early symbiosis signaling and nodule organogenesis. PMID:22353370

  15. Earthquake imprints on a lacustrine deltaic system: Example of the Kürk Delta along the East Anatolian Fault (Turkey)

    NASA Astrophysics Data System (ADS)

    Hubert-Ferrari, Aurélia; El-Ouahabi, Meriam; Garcia Moreno, David; Avsar, Ulaş; Altınok, Sevgi; Fagel, Nathalie; Çaǧatay, Namık

    2017-04-01

    Deltas contain sedimentary records that are not only indicative of water level changes, but also particularly sensitive to earthquake shaking typically resulting in soft-sediment-deformation structures. The Kürk lacustrine delta lies at the south-western extremity of Lake Hazar in eastern Turkey and is adjacent to the seismogenic East Anatolian Fault (EAF), which has generated earthquakes of magnitude 7. In this paper we have reevaluated water level changes and earthquake shaking that have affected the Kürk Delta combining geophysical data (seismic-reflection profiles and side-scan sonar), remote sensing images, historical data, onland outcrops and offshore coring. The history of water level changes provides a temporal framework for the depositional record. In addition to the common soft-sediment-deformation documented previously, onland outcrops reveal a record of deformation (fracturing, tilt and clastic dykes) linked to large earthquake-induced liquefactions and lateral spreading. The recurrent liquefaction structures can be used to obtain a paleoseismological record. Five event horizons were identified that could be linked to historical earthquakes occurring in the last 1000 years along the EAF. Sedimentary cores sampling the most recent subaqueous sedimentation revealed the occurrence of another type of earthquake indicator. Based on radionuclide dating (137Cs and 210Pb), two major sedimentary events were attributed to the AD 1874-1875 EAF earthquake sequence. Their sedimentological characteristics were determined by X-ray imagery, XRD, LOI, grain-size distribution and geophysical measurements. The events are interpreted to be hyperpycnal deposits linked to post-seismic sediment reworking of earthquake-triggered landslides.

  16. Comparative Performance of Complex-Valued B-Spline and Polynomial Models Applied to Iterative Frequency-Domain Decision Feedback Equalization of Hammerstein Channels.

    PubMed

    Chen, Sheng; Hong, Xia; Khalaf, Emad F; Alsaadi, Fuad E; Harris, Chris J

    2016-09-23

    Complex-valued (CV) B-spline neural network approach offers a highly effective means for identifying and inverting practical Hammerstein systems. Compared with its conventional CV polynomial-based counterpart, a CV B-spline neural network has superior performance in identifying and inverting CV Hammerstein systems, while imposing a similar complexity. This paper reviews the optimality of the CV B-spline neural network approach. Advantages of B-spline neural network approach as compared with the polynomial based modeling approach are extensively discussed, and the effectiveness of the CV neural network-based approach is demonstrated in a real-world application. More specifically, we evaluate the comparative performance of the CV B-spline and polynomial-based approaches for the nonlinear iterative frequency-domain decision feedback equalization (NIFDDFE) of single-carrier Hammerstein channels. Our results confirm the superior performance of the CV B-spline-based NIFDDFE over its CV polynomial-based counterpart.

  17. Conformal Laplace superintegrable systems in 2D: polynomial invariant subspaces

    NASA Astrophysics Data System (ADS)

    Escobar-Ruiz, M. A.; Miller, Willard, Jr.

    2016-07-01

    2nd-order conformal superintegrable systems in n dimensions are Laplace equations on a manifold with an added scalar potential and 2n-1 independent 2nd order conformal symmetry operators. They encode all the information about Helmholtz (eigenvalue) superintegrable systems in an efficient manner: there is a 1-1 correspondence between Laplace superintegrable systems and Stäckel equivalence classes of Helmholtz superintegrable systems. In this paper we focus on superintegrable systems in two-dimensions, n = 2, where there are 44 Helmholtz systems, corresponding to 12 Laplace systems. For each Laplace equation we determine the possible two-variate polynomial subspaces that are invariant under the action of the Laplace operator, thus leading to families of polynomial eigenfunctions. We also study the behavior of the polynomial invariant subspaces under a Stäckel transform. The principal new results are the details of the polynomial variables and the conditions on parameters of the potential corresponding to polynomial solutions. The hidden gl 3-algebraic structure is exhibited for the exact and quasi-exact systems. For physically meaningful solutions, the orthogonality properties and normalizability of the polynomials are presented as well. Finally, for all Helmholtz superintegrable solvable systems we give a unified construction of one-dimensional (1D) and two-dimensional (2D) quasi-exactly solvable potentials possessing polynomial solutions, and a construction of new 2D PT-symmetric potentials is established.

  18. Stability properties of autonomous homogeneous polynomial differential systems

    NASA Astrophysics Data System (ADS)

    Samardzija, Nikola

    A geometrical approach is used to derive a generalized characteristic value problem for dynamic systems described by homogeneous polynomials. It is shown that a nonlinear homogeneous polynomial system possesses eigenvectors and eigenvalues, quantities normally associated with a linear system. These quantities are then employed in studying stability properties. The necessary and sufficient conditions for all forms of stabilities characteristic of a two-dimensional system are provided. This result, together with the classical theorem of Frommer, completes a stability analysis for a two-dimensional homogeneous polynomial system.

  19. Generalized Freud's equation and level densities with polynomial potential

    NASA Astrophysics Data System (ADS)

    Boobna, Akshat; Ghosh, Saugata

    2013-08-01

    We study orthogonal polynomials with weight $\\exp[-NV(x)]$, where $V(x)=\\sum_{k=1}^{d}a_{2k}x^{2k}/2k$ is a polynomial of order 2d. We derive the generalised Freud's equations for $d=3$, 4 and 5 and using this obtain $R_{\\mu}=h_{\\mu}/h_{\\mu -1}$, where $h_{\\mu}$ is the normalization constant for the corresponding orthogonal polynomials. Moments of the density functions, expressed in terms of $R_{\\mu}$, are obtained using Freud's equation and using this, explicit results of level densities as $N\\rightarrow\\infty$ are derived.

  20. Zeros of the Jones polynomials for families of pretzel links

    NASA Astrophysics Data System (ADS)

    Jin, Xian'an; Zhang, Fuji

    2003-10-01

    In this paper, a general method for computing the Tutte polynomial of the subdivision of a graph is explained. As an application to the subdivision of sheaf graph which consists of two vertices joined by some parallel edges, we obtain the explicit expressions of the Jones polynomials for some families of the pretzel links. Motivated by the work of Chang and Shrock, we investigate the zeros distribution of its Jones polynomial for each family when the number of crossings goes to infinity, and generalize some of their results.

  1. On an Ordering-Dependent Generalization of the Tutte Polynomial

    NASA Astrophysics Data System (ADS)

    Geloun, Joseph Ben; Caravelli, Francesco

    2017-07-01

    A generalization of the Tutte polynomial involved in the evaluation of the moments of the integrated geometric Brownian in the Itô formalism is discussed. The new combinatorial invariant depends on the order in which the sequence of contraction-deletions have been performed on the graph. Thus, this work provides a motivation for studying an order-dependent Tutte polynomial in the context of stochastic differential equations. We show that in the limit of the control parameters encoding the ordering going to zero, the multivariate Tutte-Fortuin-Kasteleyn polynomial is recovered.

  2. Shell Polynomials and Dual Birth-Death Processes

    NASA Astrophysics Data System (ADS)

    van Doorn, Erik A.

    2016-05-01

    This paper aims to clarify certain aspects of the relations between birth-death processes, measures solving a Stieltjes moment problem, and sets of parameters defining polynomial sequences that are orthogonal with respect to such a measure. Besides giving an overview of the basic features of these relations, revealed to a large extent by Karlin and McGregor, we investigate a duality concept for birth-death processes introduced by Karlin and McGregor and its interpretation in the context of shell polynomials and the corresponding orthogonal polynomials. This interpretation leads to increased insight in duality, while it suggests a modification of the concept of similarity for birth-death processes.

  3. Evaluation of more general integrals involving universal associated Legendre polynomials

    NASA Astrophysics Data System (ADS)

    You, Yuan; Chen, Chang-Yuan; Tahir, Farida; Dong, Shi-Hai

    2017-05-01

    We find that the solution of the polar angular differential equation can be written as the universal associated Legendre polynomials. We present a popular integral formula which includes universal associated Legendre polynomials and we also evaluate some important integrals involving the product of two universal associated Legendre polynomials Pl' m'(x ) , Pk' n'(x ) and x2 a(1-x2 ) -p -1, xb(1±x2 ) -p, and xc(1-x2 ) -p(1±x ) -1, where l'≠k' and m'≠n'. Their selection rules are also mentioned.

  4. On an Ordering-Dependent Generalization of the Tutte Polynomial

    NASA Astrophysics Data System (ADS)

    Geloun, Joseph Ben; Caravelli, Francesco

    2017-09-01

    A generalization of the Tutte polynomial involved in the evaluation of the moments of the integrated geometric Brownian in the Itô formalism is discussed. The new combinatorial invariant depends on the order in which the sequence of contraction-deletions have been performed on the graph. Thus, this work provides a motivation for studying an order-dependent Tutte polynomial in the context of stochastic differential equations. We show that in the limit of the control parameters encoding the ordering going to zero, the multivariate Tutte-Fortuin-Kasteleyn polynomial is recovered.

  5. Transfer matrix computation of critical polynomials for two-dimensional Potts models

    DOE PAGES

    Jacobsen, Jesper Lykke; Scullard, Christian R.

    2013-02-04

    We showed, In our previous work, that critical manifolds of the q-state Potts model can be studied by means of a graph polynomial PB(q, v), henceforth referred to as the critical polynomial. This polynomial may be defined on any periodic two-dimensional lattice. It depends on a finite subgraph B, called the basis, and the manner in which B is tiled to construct the lattice. The real roots v = eK — 1 of PB(q, v) either give the exact critical points for the lattice, or provide approximations that, in principle, can be made arbitrarily accurate by increasing the size ofmore » B in an appropriate way. In earlier work, PB(q, v) was defined by a contraction-deletion identity, similar to that satisfied by the Tutte polynomial. Here, we give a probabilistic definition of PB(q, v), which facilitates its computation, using the transfer matrix, on much larger B than was previously possible.We present results for the critical polynomial on the (4, 82), kagome, and (3, 122) lattices for bases of up to respectively 96, 162, and 243 edges, compared to the limit of 36 edges with contraction-deletion. We discuss in detail the role of the symmetries and the embedding of B. The critical temperatures vc obtained for ferromagnetic (v > 0) Potts models are at least as precise as the best available results from Monte Carlo simulations or series expansions. For instance, with q = 3 we obtain vc(4, 82) = 3.742 489 (4), vc(kagome) = 1.876 459 7 (2), and vc(3, 122) = 5.033 078 49 (4), the precision being comparable or superior to the best simulation results. More generally, we trace the critical manifolds in the real (q, v) plane and discuss the intricate structure of the phase diagram in the antiferromagnetic (v < 0) region.« less

  6. Transfer matrix computation of critical polynomials for two-dimensional Potts models

    NASA Astrophysics Data System (ADS)

    Lykke Jacobsen, Jesper; Scullard, Christian R.

    2013-02-01

    In our previous work [1] we have shown that critical manifolds of the q-state Potts model can be studied by means of a graph polynomial PB(q, v), henceforth referred to as the critical polynomial. This polynomial may be defined on any periodic two-dimensional lattice. It depends on a finite subgraph B, called the basis, and the manner in which B is tiled to construct the lattice. The real roots v = eK - 1 of PB(q, v) either give the exact critical points for the lattice, or provide approximations that, in principle, can be made arbitrarily accurate by increasing the size of B in an appropriate way. In earlier work, PB(q, v) was defined by a contraction-deletion identity, similar to that satisfied by the Tutte polynomial. Here, we give a probabilistic definition of PB(q, v), which facilitates its computation, using the transfer matrix, on much larger B than was previously possible. We present results for the critical polynomial on the (4, 82), kagome, and (3, 122) lattices for bases of up to respectively 96, 162, and 243 edges, compared to the limit of 36 edges with contraction-deletion. We discuss in detail the role of the symmetries and the embedding of B. The critical temperatures vc obtained for ferromagnetic (v > 0) Potts models are at least as precise as the best available results from Monte Carlo simulations or series expansions. For instance, with q = 3 we obtain vc(4, 82) = 3.742 489 (4), vc(kagome) = 1.876 459 7 (2), and vc(3, 122) = 5.033 078 49 (4), the precision being comparable or superior to the best simulation results. More generally, we trace the critical manifolds in the real (q, v) plane and discuss the intricate structure of the phase diagram in the antiferromagnetic (v < 0) region.

  7. Polynomial method for PLL controller optimization.

    PubMed

    Wang, Ta-Chung; Lall, Sanjay; Chiou, Tsung-Yu

    2011-01-01

    The Phase-Locked Loop (PLL) is a key component of modern electronic communication and control systems. PLL is designed to extract signals from transmission channels. It plays an important role in systems where it is required to estimate the phase of a received signal, such as carrier tracking from global positioning system satellites. In order to robustly provide centimeter-level accuracy, it is crucial for the PLL to estimate the instantaneous phase of an incoming signal which is usually buried in random noise or some type of interference. This paper presents an approach that utilizes the recent development in the semi-definite programming and sum-of-squares field. A Lyapunov function will be searched as the certificate of the pull-in range of the PLL system. Moreover, a polynomial design procedure is proposed to further refine the controller parameters for system response away from the equilibrium point. Several simulation results as well as an experiment result are provided to show the effectiveness of this approach.

  8. Polynomial Method for PLL Controller Optimization†

    PubMed Central

    Wang, Ta-Chung; Lall, Sanjay; Chiou, Tsung-Yu

    2011-01-01

    The Phase-Locked Loop (PLL) is a key component of modern electronic communication and control systems. PLL is designed to extract signals from transmission channels. It plays an important role in systems where it is required to estimate the phase of a received signal, such as carrier tracking from global positioning system satellites. In order to robustly provide centimeter-level accuracy, it is crucial for the PLL to estimate the instantaneous phase of an incoming signal which is usually buried in random noise or some type of interference. This paper presents an approach that utilizes the recent development in the semi-definite programming and sum-of-squares field. A Lyapunov function will be searched as the certificate of the pull-in range of the PLL system. Moreover, a polynomial design procedure is proposed to further refine the controller parameters for system response away from the equilibrium point. Several simulation results as well as an experiment result are provided to show the effectiveness of this approach. PMID:22163973

  9. SO(N) restricted Schur polynomials

    SciTech Connect

    Kemp, Garreth

    2015-02-15

    We focus on the 1/4-BPS sector of free super Yang-Mills theory with an SO(N) gauge group. This theory has an AdS/CFT (an equivalence between a conformal field theory in d-1 dimensions and type II string theory defined on an AdS space in d-dimensions) dual in the form of type IIB string theory with AdS{sub 5}×RP{sup 5} geometry. With the aim of studying excited giant graviton dynamics, we construct an orthogonal basis for this sector of the gauge theory in this work. First, we demonstrate that the counting of states, as given by the partition function, and the counting of restricted Schur polynomials match by restricting to a particular class of Young diagram labels. We then give an explicit construction of these gauge invariant operators and evaluate their two-point function exactly. This paves the way to studying the spectral problem of these operators and their D-brane duals.

  10. Symmetric polynomials in information theory: Entropy and subentropy

    SciTech Connect

    Jozsa, Richard; Mitchison, Graeme

    2015-06-15

    Entropy and other fundamental quantities of information theory are customarily expressed and manipulated as functions of probabilities. Here we study the entropy H and subentropy Q as functions of the elementary symmetric polynomials in the probabilities and reveal a series of remarkable properties. Derivatives of all orders are shown to satisfy a complete monotonicity property. H and Q themselves become multivariate Bernstein functions and we derive the density functions of their Levy-Khintchine representations. We also show that H and Q are Pick functions in each symmetric polynomial variable separately. Furthermore, we see that H and the intrinsically quantum informational quantity Q become surprisingly closely related in functional form, suggesting a special significance for the symmetric polynomials in quantum information theory. Using the symmetric polynomials, we also derive a series of further properties of H and Q.

  11. Gravity Anomaly of Polyhedral Bodies Having a Polynomial Density Contrast

    NASA Astrophysics Data System (ADS)

    D'Urso, M. G.; Trotta, S.

    2017-07-01

    We analytically evaluate the gravity anomaly associated with a polyhedral body having an arbitrary geometrical shape and a polynomial density contrast in both the horizontal and vertical directions. The gravity anomaly is evaluated at an arbitrary point that does not necessarily coincide with the origin of the reference frame in which the density function is assigned. Density contrast is assumed to be a third-order polynomial as a maximum but the general approach exploited in the paper can be easily extended to higher-order polynomial functions. Invoking recent results of potential theory, the solution derived in the paper is shown to be singularity-free and is expressed as a sum of algebraic quantities that only depend upon the 3D coordinates of the polyhedron vertices and upon the polynomial density function. The accuracy, robustness and effectiveness of the proposed approach are illustrated by numerical comparisons with examples derived from the existing literature.

  12. Orthogonal sets of data windows constructed from trigonometric polynomials

    NASA Technical Reports Server (NTRS)

    Greenhall, C. A.

    1989-01-01

    Suboptimal, easily computable substitutes for the discrete prolate-spheroidal windows used by Thomson for spectral estimation are given. Trigonometric coefficients and energy leakages of the window polynomials are tabulated.

  13. Quantization of gauge fields, graph polynomials and graph homology

    SciTech Connect

    Kreimer, Dirk; Sars, Matthias; Suijlekom, Walter D. van

    2013-09-15

    We review quantization of gauge fields using algebraic properties of 3-regular graphs. We derive the Feynman integrand at n loops for a non-abelian gauge theory quantized in a covariant gauge from scalar integrands for connected 3-regular graphs, obtained from the two Symanzik polynomials. The transition to the full gauge theory amplitude is obtained by the use of a third, new, graph polynomial, the corolla polynomial. This implies effectively a covariant quantization without ghosts, where all the relevant signs of the ghost sector are incorporated in a double complex furnished by the corolla polynomial–we call it cycle homology–and by graph homology. -- Highlights: •We derive gauge theory Feynman from scalar field theory with 3-valent vertices. •We clarify the role of graph homology and cycle homology. •We use parametric renormalization and the new corolla polynomial.

  14. Design of robust differential microphone arrays with orthogonal polynomials.

    PubMed

    Pan, Chao; Benesty, Jacob; Chen, Jingdong

    2015-08-01

    Differential microphone arrays have the potential to be widely deployed in hands-free communication systems thanks to their frequency-invariant beampatterns, high directivity factors, and small apertures. Traditionally, they are designed and implemented in a multistage way with uniform linear geometries. This paper presents an approach to the design of differential microphone arrays with orthogonal polynomials, more specifically with Jacobi polynomials. It first shows how to express the beampatterns as a function of orthogonal polynomials. Then several differential beamformers are derived and their performance depends on the parameters of the Jacobi polynomials. Simulations show the great flexibility of the proposed method in terms of designing any order differential microphone arrays with different beampatterns and controlling white noise gain.

  15. Fitting discrete aspherical surface sag data using orthonormal polynomials.

    PubMed

    Hilbig, David; Ceyhan, Ufuk; Henning, Thomas; Fleischmann, Friedrich; Knipp, Dietmar

    2015-08-24

    Characterizing real-life optical surfaces usually involves finding the best-fit of an appropriate surface model to a set of discrete measurement data. This process can be greatly simplified by choosing orthonormal polynomials for the surface description. In case of rotationally symmetric aspherical surfaces, new sets of orthogonal polynomials were introduced by Forbes to replace the numerical unstable standard description. From these, for the application of surface retrieval using experimental ray tracing, the sag orthogonal Q(con)-polynomials are of particular interest. However, these are by definition orthogonal over continuous data and may not be orthogonal for discrete data. In this case, the simplified solution is not valid. Hence, a Gram-Schmidt orthonormalization of these polynomials over the discrete data set is proposed to solve this problem. The resulting difference will be presented by a performance analysis and comparison to the direct matrix inversion method.

  16. Cubic Polynomials with Rational Roots and Critical Points

    ERIC Educational Resources Information Center

    Gupta, Shiv K.; Szymanski, Waclaw

    2010-01-01

    If you want your students to graph a cubic polynomial, it is best to give them one with rational roots and critical points. In this paper, we describe completely all such cubics and explain how to generate them.

  17. On polynomial integrability of the Euler equations on so(4)

    NASA Astrophysics Data System (ADS)

    Llibre, Jaume; Yu, Jiang; Zhang, Xiang

    2015-10-01

    In this paper we prove that the Euler equations on the Lie algebra so(4) with a diagonal quadratic Hamiltonian either satisfy the Manakov condition, or have at most four functionally independent polynomial first integrals.

  18. Asymptotic expansions of Feynman integrals of exponentials with polynomial exponent

    NASA Astrophysics Data System (ADS)

    Kravtseva, A. K.; Smolyanov, O. G.; Shavgulidze, E. T.

    2016-10-01

    In the paper, an asymptotic expansion of path integrals of functionals having exponential form with polynomials in the exponent is constructed. The definition of the path integral in the sense of analytic continuation is considered.

  19. Quantum random walk polynomial and quantum random walk measure

    NASA Astrophysics Data System (ADS)

    Kang, Yuanbao; Wang, Caishi

    2014-05-01

    In the paper, we introduce a quantum random walk polynomial (QRWP) that can be defined as a polynomial , which is orthogonal with respect to a quantum random walk measure (QRWM) on , such that the parameters are in the recurrence relations and satisfy . We firstly obtain some results of QRWP and QRWM, in which case the correspondence between measures and orthogonal polynomial sequences is one-to-one. It shows that any measure with respect to which a quantum random walk polynomial sequence is orthogonal is a quantum random walk measure. We next collect some properties of QRWM; moreover, we extend Karlin and McGregor's representation formula for the transition probabilities of a quantum random walk (QRW) in the interacting Fock space, which is a parallel result with the CGMV method. Using these findings, we finally obtain some applications for QRWM, which are of interest in the study of quantum random walk, highlighting the role played by QRWP and QRWM.

  20. Generalized Rayleigh and Jacobi Processes and Exceptional Orthogonal Polynomials

    NASA Astrophysics Data System (ADS)

    Chou, C.-I.; Ho, C.-L.

    2013-09-01

    We present four types of infinitely many exactly solvable Fokker-Planck equations, which are related to the newly discovered exceptional orthogonal polynomials. They represent the deformed versions of the Rayleigh process and the Jacobi process.

  1. Cubic Polynomials with Rational Roots and Critical Points

    ERIC Educational Resources Information Center

    Gupta, Shiv K.; Szymanski, Waclaw

    2010-01-01

    If you want your students to graph a cubic polynomial, it is best to give them one with rational roots and critical points. In this paper, we describe completely all such cubics and explain how to generate them.

  2. A robust polynomial fitting approach for contact angle measurements.

    PubMed

    Atefi, Ehsan; Mann, J Adin; Tavana, Hossein

    2013-05-14

    Polynomial fitting to drop profile offers an alternative to well-established drop shape techniques for contact angle measurements from sessile drops without a need for liquid physical properties. Here, we evaluate the accuracy of contact angles resulting from fitting polynomials of various orders to drop profiles in a Cartesian coordinate system, over a wide range of contact angles. We develop a differentiator mask to automatically find a range of required number of pixels from a drop profile over which a stable contact angle is obtained. The polynomial order that results in the longest stable regime and returns the lowest standard error and the highest correlation coefficient is selected to determine drop contact angles. We find that, unlike previous reports, a single polynomial order cannot be used to accurately estimate a wide range of contact angles and that a larger order polynomial is needed for drops with larger contact angles. Our method returns contact angles with an accuracy of <0.4° for solid-liquid systems with θ < ~60°. This compares well with the axisymmetric drop shape analysis-profile (ADSA-P) methodology results. Above about 60°, we observe significant deviations from ADSA-P results, most likely because a polynomial cannot trace the profile of drops with close-to-vertical and vertical segments. To overcome this limitation, we implement a new polynomial fitting scheme by transforming drop profiles into polar coordinate system. This eliminates the well-known problem with high curvature drops and enables estimating contact angles in a wide range with a fourth-order polynomial. We show that this approach returns dynamic contact angles with less than 0.7° error as compared to ADSA-P, for the solid-liquid systems tested. This new approach is a powerful alternative to drop shape techniques for estimating contact angles of drops regardless of drop symmetry and without a need for liquid properties.

  3. Performance comparison of polynomial representations for optimizing optical freeform systems

    NASA Astrophysics Data System (ADS)

    Brömel, A.; Gross, H.; Ochse, D.; Lippmann, U.; Ma, C.; Zhong, Y.; Oleszko, M.

    2015-09-01

    Optical systems can benefit strongly from freeform surfaces, however the choice of the right representation isn`t an easy one. Classical representations like X-Y-polynomials, as well as Zernike-polynomials are often used for such systems, but should have some disadvantage regarding their orthogonality, resulting in worse convergence and reduced quality in final results compared to newer representations like the Q-polynomials by Forbes. Additionally the supported aperture is a circle, which can be a huge drawback in case of optical systems with rectangular aperture. In this case other representations like Chebyshev-or Legendre-polynomials come into focus. There are a larger number of possibilities; however the experience with these newer representations is rather limited. Therefore in this work the focus is on investigating the performance of four widely used representations in optimizing two ambitious systems with very different properties: Three-Mirror-Anastigmat and an anamorphic System. The chosen surface descriptions offer support for circular or rectangular aperture, as well as different grades of departure from rotational symmetry. The basic shapes are for example a conic or best-fit-sphere and the polynomial set is non-, spatial or slope-orthogonal. These surface representations were chosen to evaluate the impact of these aspects on the performance optimization of the two example systems. Freeform descriptions investigated here were XY-polynomials, Zernike in Fringe representation, Q-polynomials by Forbes, as well as 2-dimensional Chebyshev-polynomials. As a result recommendations for the right choice of freeform surface representations for practical issues in the optimization of optical systems can be given.

  4. Polynomial Interpolation and Sums of Powers of Integers

    ERIC Educational Resources Information Center

    Cereceda, José Luis

    2017-01-01

    In this note, we revisit the problem of polynomial interpolation and explicitly construct two polynomials in n of degree k + 1, P[subscript k](n) and Q[subscript k](n), such that P[subscript k](n) = Q[subscript k](n) = f[subscript k](n) for n = 1, 2,… , k, where f[subscript k](1), f[subscript k](2),… , f[subscript k](k) are k arbitrarily chosen…

  5. Polynomial Interpolation and Sums of Powers of Integers

    ERIC Educational Resources Information Center

    Cereceda, José Luis

    2017-01-01

    In this note, we revisit the problem of polynomial interpolation and explicitly construct two polynomials in n of degree k + 1, P[subscript k](n) and Q[subscript k](n), such that P[subscript k](n) = Q[subscript k](n) = f[subscript k](n) for n = 1, 2,… , k, where f[subscript k](1), f[subscript k](2),… , f[subscript k](k) are k arbitrarily chosen…

  6. Factorization of colored knot polynomials at roots of unity

    NASA Astrophysics Data System (ADS)

    Kononov, Ya.; Morozov, A.

    2015-07-01

    HOMFLY polynomials are the Wilson-loop averages in Chern-Simons theory and depend on four variables: the closed line (knot) in 3d space-time, representation R of the gauge group SU (N) and exponentiated coupling constant q. From analysis of a big variety of different knots we conclude that at q, which is a 2m-th root of unity, q2m = 1, HOMFLY polynomials in symmetric representations [ r ] satisfy recursion identity: Hr+m =Hr ṡHm for any A =qN, which is a generalization of the property Hr = H1r for special polynomials at m = 1. We conjecture a further generalization to arbitrary representation R, which, however, is checked only for torus knots. Next, Kashaev polynomial, which arises from HR at q2 = e 2 πi / | R |, turns equal to the special polynomial with A substituted by A| R |, provided R is a single-hook representations (including arbitrary symmetric) - what provides a q - A dual to the similar property of Alexander polynomial. All this implies non-trivial relations for the coefficients of the differential expansions, which are believed to provide reasonable coordinates in the space of knots - existence of such universal relations means that these variables are still not unconstrained.

  7. Accurate estimation of solvation free energy using polynomial fitting techniques.

    PubMed

    Shyu, Conrad; Ytreberg, F Marty

    2011-01-15

    This report details an approach to improve the accuracy of free energy difference estimates using thermodynamic integration data (slope of the free energy with respect to the switching variable λ) and its application to calculating solvation free energy. The central idea is to utilize polynomial fitting schemes to approximate the thermodynamic integration data to improve the accuracy of the free energy difference estimates. Previously, we introduced the use of polynomial regression technique to fit thermodynamic integration data (Shyu and Ytreberg, J Comput Chem, 2009, 30, 2297). In this report we introduce polynomial and spline interpolation techniques. Two systems with analytically solvable relative free energies are used to test the accuracy of the interpolation approach. We also use both interpolation and regression methods to determine a small molecule solvation free energy. Our simulations show that, using such polynomial techniques and nonequidistant λ values, the solvation free energy can be estimated with high accuracy without using soft-core scaling and separate simulations for Lennard-Jones and partial charges. The results from our study suggest that these polynomial techniques, especially with use of nonequidistant λ values, improve the accuracy for ΔF estimates without demanding additional simulations. We also provide general guidelines for use of polynomial fitting to estimate free energy. To allow researchers to immediately utilize these methods, free software and documentation is provided via http://www.phys.uidaho.edu/ytreberg/software. Copyright © 2010 Wiley Periodicals, Inc.

  8. Universal Racah matrices and adjoint knot polynomials: Arborescent knots

    NASA Astrophysics Data System (ADS)

    Mironov, A.; Morozov, A.

    2016-04-01

    By now it is well established that the quantum dimensions of descendants of the adjoint representation can be described in a universal form, independent of a particular family of simple Lie algebras. The Rosso-Jones formula then implies a universal description of the adjoint knot polynomials for torus knots, which in particular unifies the HOMFLY (SUN) and Kauffman (SON) polynomials. For E8 the adjoint representation is also fundamental. We suggest to extend the universality from the dimensions to the Racah matrices and this immediately produces a unified description of the adjoint knot polynomials for all arborescent (double-fat) knots, including twist, 2-bridge and pretzel. Technically we develop together the universality and the ;eigenvalue conjecture;, which expresses the Racah and mixing matrices through the eigenvalues of the quantum R-matrix, and for dealing with the adjoint polynomials one has to extend it to the previously unknown 6 × 6 case. The adjoint polynomials do not distinguish between mutants and therefore are not very efficient in knot theory, however, universal polynomials in higher representations can probably be better in this respect.

  9. Constructing Polynomial Spectral Models for Stars

    NASA Astrophysics Data System (ADS)

    Rix, Hans-Walter; Ting, Yuan-Sen; Conroy, Charlie; Hogg, David W.

    2016-08-01

    Stellar spectra depend on the stellar parameters and on dozens of photospheric elemental abundances. Simultaneous fitting of these { N } ˜ 10-40 model labels to observed spectra has been deemed unfeasible because the number of ab initio spectral model grid calculations scales exponentially with { N }. We suggest instead the construction of a polynomial spectral model (PSM) of order { O } for the model flux at each wavelength. Building this approximation requires a minimum of only ≤ft(≥nfrac{}{}{0em}{}{{ N }+{ O }}{{ O }}\\right) calculations: e.g., a quadratic spectral model ({ O }=2) to fit { N }=20 labels simultaneously can be constructed from as few as 231 ab initio spectral model calculations; in practice, a somewhat larger number (˜300-1000) of randomly chosen models lead to a better performing PSM. Such a PSM can be a good approximation only over a portion of label space, which will vary case-by-case. Yet, taking the APOGEE survey as an example, a single quadratic PSM provides a remarkably good approximation to the exact ab initio spectral models across much of this survey: for random labels within that survey the PSM approximates the flux to within 10-3 and recovers the abundances to within ˜0.02 dex rms of the exact models. This enormous speed-up enables the simultaneous many-label fitting of spectra with computationally expensive ab initio models for stellar spectra, such as non-LTE models. A PSM also enables the simultaneous fitting of observational parameters, such as the spectrum’s continuum or line-spread function.

  10. Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states.

    PubMed

    Traversa, Fabio Lorenzo; Ramella, Chiara; Bonani, Fabrizio; Di Ventra, Massimiliano

    2015-07-01

    Memcomputing is a novel non-Turing paradigm of computation that uses interacting memory cells (memprocessors for short) to store and process information on the same physical platform. It was recently proven mathematically that memcomputing machines have the same computational power of nondeterministic Turing machines. Therefore, they can solve NP-complete problems in polynomial time and, using the appropriate architecture, with resources that only grow polynomially with the input size. The reason for this computational power stems from properties inspired by the brain and shared by any universal memcomputing machine, in particular intrinsic parallelism and information overhead, namely, the capability of compressing information in the collective state of the memprocessor network. We show an experimental demonstration of an actual memcomputing architecture that solves the NP-complete version of the subset sum problem in only one step and is composed of a number of memprocessors that scales linearly with the size of the problem. We have fabricated this architecture using standard microelectronic technology so that it can be easily realized in any laboratory setting. Although the particular machine presented here is eventually limited by noise-and will thus require error-correcting codes to scale to an arbitrary number of memprocessors-it represents the first proof of concept of a machine capable of working with the collective state of interacting memory cells, unlike the present-day single-state machines built using the von Neumann architecture.

  11. Quantitative phosphoproteomics identifies SnRK2 protein kinase substrates and reveals the effectors of abscisic acid action

    PubMed Central

    Wang, Pengcheng; Xue, Liang; Batelli, Giorgia; Lee, Shinyoung; Hou, Yueh-Ju; Van Oosten, Michael J.; Zhang, Huiming; Tao, W. Andy; Zhu, Jian-Kang

    2013-01-01

    Sucrose nonfermenting 1 (SNF1)-related protein kinase 2s (SnRK2s) are central components of abscisic acid (ABA) signaling pathways. The snrk2.2/2.3/2.6 triple-mutant plants are nearly completely insensitive to ABA, suggesting that most of the molecular actions of ABA are triggered by the SnRK2s-mediated phosphorylation of substrate proteins. Only a few substrate proteins of the SnRK2s are known. To identify additional substrate proteins of the SnRK2s and provide insight into the molecular actions of ABA, we used quantitative phosphoproteomics to compare the global changes in phosphopeptides in WT and snrk2.2/2.3/2.6 triple mutant seedlings in response to ABA treatment. Among the 5,386 unique phosphorylated peptides identified in this study, we found that ABA can increase the phosphorylation of 166 peptides and decrease the phosphorylation of 117 peptides in WT seedlings. In the snrk2.2/2.3/2.6 triple mutant, 84 of the 166 peptides, representing 58 proteins, could not be phosphorylated, or phosphorylation was not increased under ABA treatment. In vitro kinase assays suggest that most of the 58 proteins can serve as substrates of the SnRK2s. The SnRK2 substrates include proteins involved in flowering time regulation, RNA and DNA binding, miRNA and epigenetic regulation, signal transduction, chloroplast function, and many other cellular processes. Consistent with the SnRK2 phosphorylation of flowering time regulators, the snrk2.2/2.3/2.6 triple mutant flowered significantly earlier than WT. These results shed new light on the role of the SnRK2 protein kinases and on the downstream effectors of ABA action, and improve our understanding of plant responses to adverse environments. PMID:23776212

  12. On the Numerical Formulation of Parametric Linear Fractional Transformation (LFT) Uncertainty Models for Multivariate Matrix Polynomial Problems

    NASA Technical Reports Server (NTRS)

    Belcastro, Christine M.

    1998-01-01

    Robust control system analysis and design is based on an uncertainty description, called a linear fractional transformation (LFT), which separates the uncertain (or varying) part of the system from the nominal system. These models are also useful in the design of gain-scheduled control systems based on Linear Parameter Varying (LPV) methods. Low-order LFT models are difficult to form for problems involving nonlinear parameter variations. This paper presents a numerical computational method for constructing and LFT model for a given LPV model. The method is developed for multivariate polynomial problems, and uses simple matrix computations to obtain an exact low-order LFT representation of the given LPV system without the use of model reduction. Although the method is developed for multivariate polynomial problems, multivariate rational problems can also be solved using this method by reformulating the rational problem into a polynomial form.

  13. Strut fracture in the new Bjørk-Shiley mitral valve prosthesis.

    PubMed

    Brubakk, O; Simonsen, S; Källman, L; Fredriksen, A

    1981-04-01

    The case of a patient with the new type Bjørk-Shiley aortic and mitral valve prosthesis is described. Three months after implant she suffered acute heart failure and died. Post-mortem examination revealed a fractured outlet strut in the mitral valve prosthesis with dislocation of the disc. The fracture was regarded as due to excessive brittleness caused by demonstrated deposition of chromium-tungsten-carbide.

  14. Some identities of the q-Laguerre polynomials on q-Umbral calculus

    NASA Astrophysics Data System (ADS)

    Dere, Rahime

    2017-07-01

    Some interesting identities of Sheffer polynomials was given by Roman [11], [12]. In this paper, we study a q-analogue of Laguerre polynomials which are also q-Sheffer polynomials. Furthermore, we give some new properties and formulas of these q-Laguerre polynomials of higher order by using the theory of the umbral algebra and umbral calculus.

  15. One-parameter extension of the Doi-Peliti formalism and its relation with orthogonal polynomials.

    PubMed

    Ohkubo, Jun

    2012-10-01

    An extension of the Doi-Peliti formalism for stochastic chemical kinetics is proposed. Using the extension, path-integral expressions consistent with previous studies are obtained. In addition, the extended formalism is naturally connected to orthogonal polynomials. We show that two different orthogonal polynomials, i.e., Charlier polynomials and Hermite polynomials, can be used to express the Doi-Peliti formalism explicitly.

  16. Regulatory functions of SnRK1 in stress-responsive gene expression and in plant growth and development.

    PubMed

    Cho, Young-Hee; Hong, Jung-Woo; Kim, Eun-Chul; Yoo, Sang-Dong

    2012-04-01

    Sucrose-nonfermentation1-related protein kinase1 (SnRK1) is an evolutionarily conserved energy sensor protein that regulates gene expression in response to energy depletion in plants. Efforts to elucidate the functions and mechanisms of this protein kinase are hampered, however, by inherent growth defects of snrk1-null mutant plants. To overcome these limitations and study SnRK1 functions in vivo, we applied a method combining transient expression in leaf mesophyll protoplasts and stable expression in transgenic plants. We found that both rice (Oryza sativa) and Arabidopsis (Arabidopsis thaliana) SnRK1 activities critically influence stress-inducible gene expression and the induction of stress tolerance. Genetic, molecular, and chromatin immunoprecipitation analyses further revealed that the nuclear SnRK1 modulated target gene transcription in a submergence-dependent manner. From early seedling development through late senescence, SnRK1 activities appeared to modulate developmental processes in the plants. Our findings offer insight into the regulatory functions of plant SnRK1 in stress-responsive gene regulation and in plant growth and development throughout the life cycle.

  17. Functional interplay between the RK motif and linker segment dictates Oct4–DNA recognition

    PubMed Central

    Kong, Xiangqian; Liu, Jian; Li, Lianchun; Yue, Liyan; Zhang, Lihong; Jiang, Hualiang; Xie, Xin; Luo, Cheng

    2015-01-01

    The POU family transcription factor Oct4 plays pivotal roles in regulating pluripotency and somatic cell reprogramming. Previous studies have indicated an important role for major groove contacts in Oct4–DNA recognition; however, the contributions of the RK motif in the POUh domain and the linker segment joining the two DNA-binding domains remain poorly understood. Here, by combining molecular modelling and functional assays, we find that the RK motif is essential for Oct4–DNA association by recognizing the narrowed DNA minor groove. Intriguingly, computational simulations reveal that the function of the RK motif may be finely tuned by H-bond interactions with the partially disordered linker segment and that breaking these interactions significantly enhances the DNA binding and reprogramming activities of Oct4. These findings uncover a self-regulatory mechanism for specific Oct4–DNA recognition and provide insights into the functional crosstalk at the molecular level that may illuminate mechanistic studies of the Oct protein family and possibly transcription factors in the POU family. Our gain-of-function Oct4 mutants might also be useful tools for use in reprogramming and regenerative medicine. PMID:25870414

  18. Mechanisms of regulation of SNF1/AMPK/SnRK1 protein kinases

    PubMed Central

    Crozet, Pierre; Margalha, Leonor; Confraria, Ana; Rodrigues, Américo; Martinho, Cláudia; Adamo, Mattia; Elias, Carlos A.; Baena-González, Elena

    2014-01-01

    The SNF1 (sucrose non-fermenting 1)-related protein kinases 1 (SnRKs1) are the plant orthologs of the budding yeast SNF1 and mammalian AMPK (AMP-activated protein kinase). These evolutionarily conserved kinases are metabolic sensors that undergo activation in response to declining energy levels. Upon activation, SNF1/AMPK/SnRK1 kinases trigger a vast transcriptional and metabolic reprograming that restores energy homeostasis and promotes tolerance to adverse conditions, partly through an induction of catabolic processes and a general repression of anabolism. These kinases typically function as a heterotrimeric complex composed of two regulatory subunits, β and γ, and an α-catalytic subunit, which requires phosphorylation of a conserved activation loop residue for activity. Additionally, SNF1/AMPK/SnRK1 kinases are controlled by multiple mechanisms that have an impact on kinase activity, stability, and/or subcellular localization. Here we will review current knowledge on the regulation of SNF1/AMPK/SnRK1 by upstream components, post-translational modifications, various metabolites, hormones, and others, in an attempt to highlight both the commonalities of these essential eukaryotic kinases and the divergences that have evolved to cope with the particularities of each one of these systems. PMID:24904600

  19. Mechanisms of regulation of SNF1/AMPK/SnRK1 protein kinases.

    PubMed

    Crozet, Pierre; Margalha, Leonor; Confraria, Ana; Rodrigues, Américo; Martinho, Cláudia; Adamo, Mattia; Elias, Carlos A; Baena-González, Elena

    2014-01-01

    The SNF1 (sucrose non-fermenting 1)-related protein kinases 1 (SnRKs1) are the plant orthologs of the budding yeast SNF1 and mammalian AMPK (AMP-activated protein kinase). These evolutionarily conserved kinases are metabolic sensors that undergo activation in response to declining energy levels. Upon activation, SNF1/AMPK/SnRK1 kinases trigger a vast transcriptional and metabolic reprograming that restores energy homeostasis and promotes tolerance to adverse conditions, partly through an induction of catabolic processes and a general repression of anabolism. These kinases typically function as a heterotrimeric complex composed of two regulatory subunits, β and γ, and an α-catalytic subunit, which requires phosphorylation of a conserved activation loop residue for activity. Additionally, SNF1/AMPK/SnRK1 kinases are controlled by multiple mechanisms that have an impact on kinase activity, stability, and/or subcellular localization. Here we will review current knowledge on the regulation of SNF1/AMPK/SnRK1 by upstream components, post-translational modifications, various metabolites, hormones, and others, in an attempt to highlight both the commonalities of these essential eukaryotic kinases and the divergences that have evolved to cope with the particularities of each one of these systems.

  20. Output feedback stabilization for time-delay nonholonomic systems with polynomial conditions.

    PubMed

    Wu, Yu-Qiang; Liu, Zhen-Guo

    2015-09-01

    This paper addresses the problem of output feedback stabilization for a class of time-delay nonholonomic systems. One distinct characteristic or difficulty of this paper is that time-delay exists in polynomial nonlinear growing conditions. Based on input-state-scaling technique, homogeneous domination approach and Lyapunov-Krasovskii theorem, a new output feedback control law which guarantees all the system states converge to the origin is designed. Examples are provided to demonstrate the validness of the proposed approach.

  1. Polynomial-style region incremental multisecret image sharing

    NASA Astrophysics Data System (ADS)

    Wang, Ran-Zan; Lin, Yung-Yi

    2011-03-01

    This paper proposes a polynomial-style region incremental multisecret image sharing (PBRIMSIS), for sharing multiple secrets in an image among n participants. The method enables the dealer to distribute the content of an image S to multiple regions, where each region is associated with a certain level of secrecy. In the proposed n-level PBRIMSIS scheme, input image S is encoded to n+1 shadow images that exhibit the following features: a. each shadow image cannot reveal any region in S, b. any t (2 <= t <= n + 1) shadow images can be used to reveal these regions associated with up to t - 1 secret levels, and c. S can be completely reconstructed when all of the n+1 shadow images are available. A discrete cosine transform-based PBRIMSIS with a smaller shadow image scheme is designed to improve the transmission and storage of the generated shadow images. The property of incremental disclosure to the region-based secrets in an image is applicable to image sharing in diverse applications that require the sharing of multiple secrets with different secrecy priorities, such as in cooperative working or in military secrets.

  2. Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network

    PubMed Central

    Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N.

    2015-01-01

    Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN) presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD) technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow) into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead. PMID:26426701

  3. Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network.

    PubMed

    Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N

    2015-01-01

    Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN) presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD) technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow) into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead.

  4. Sutherland-Type Trigonometric Models, Trigonometric Invariants and Multivariate Polynomials Iii:. E8 Case

    NASA Astrophysics Data System (ADS)

    Boreskov, K. G.; Turbiner, A. V.; López Vieyra, J. C.; García, M. A. G.

    It is shown that the E8 trigonometric Olshanetsky-Perelomov Hamiltonian, when written in terms of the fundamental trigonometric invariants, is in algebraic form, i.e. it has polynomial coefficients, and preserves two infinite flags of polynomial spaces marked by the Weyl (co)-vector and E8 highest root (both in the basis of simple roots) as characteristic vectors. The explicit form of the Hamiltonian in new variables has been obtained both by direct calculation and by means of the orbit function technique. It is shown the triangularity of the Hamiltonian in the bases of orbit functions and of algebraic monomials ordered through Weyl heights. Examples of first eigenfunctions are presented.

  5. Dynamic Harmony Search with Polynomial Mutation Algorithm for Valve-Point Economic Load Dispatch.

    PubMed

    Karthikeyan, M; Raja, T Sree Ranga

    2015-01-01

    Economic load dispatch (ELD) problem is an important issue in the operation and control of modern control system. The ELD problem is complex and nonlinear with equality and inequality constraints which makes it hard to be efficiently solved. This paper presents a new modification of harmony search (HS) algorithm named as dynamic harmony search with polynomial mutation (DHSPM) algorithm to solve ORPD problem. In DHSPM algorithm the key parameters of HS algorithm like harmony memory considering rate (HMCR) and pitch adjusting rate (PAR) are changed dynamically and there is no need to predefine these parameters. Additionally polynomial mutation is inserted in the updating step of HS algorithm to favor exploration and exploitation of the search space. The DHSPM algorithm is tested with three power system cases consisting of 3, 13, and 40 thermal units. The computational results show that the DHSPM algorithm is more effective in finding better solutions than other computational intelligence based methods.

  6. A Topological Framework for the Computation of the HOMFLY Polynomial and Its Application to Proteins

    PubMed Central

    Comoglio, Federico; Rinaldi, Maurizio

    2011-01-01

    Polymers can be modeled as open polygonal paths and their closure generates knots. Knotted proteins detection is currently achieved via high-throughput methods based on a common framework insensitive to the handedness of knots. Here we propose a topological framework for the computation of the HOMFLY polynomial, an handedness-sensitive invariant. Our approach couples a multi-component reduction scheme with the polynomial computation. After validation on tabulated knots and links the framework was applied to the entire Protein Data Bank along with a set of selected topological checks that allowed to discard artificially entangled structures. This led to an up-to-date table of knotted proteins that also includes two newly detected right-handed trefoil knots in recently deposited protein structures. The application range of our framework is not limited to proteins and it can be extended to the topological analysis of biological and synthetic polymers and more generally to arbitrary polygonal paths. PMID:21533239

  7. Bounding the Failure Probability Range of Polynomial Systems Subject to P-box Uncertainties

    NASA Technical Reports Server (NTRS)

    Crespo, Luis G.; Kenny, Sean P.; Giesy, Daniel P.

    2012-01-01

    This paper proposes a reliability analysis framework for systems subject to multiple design requirements that depend polynomially on the uncertainty. Uncertainty is prescribed by probability boxes, also known as p-boxes, whose distribution functions have free or fixed functional forms. An approach based on the Bernstein expansion of polynomials and optimization is proposed. In particular, we search for the elements of a multi-dimensional p-box that minimize (i.e., the best-case) and maximize (i.e., the worst-case) the probability of inner and outer bounding sets of the failure domain. This technique yields intervals that bound the range of failure probabilities. The offset between this bounding interval and the actual failure probability range can be made arbitrarily tight with additional computational effort.

  8. Estimation of Ordinary Differential Equation Parameters Using Constrained Local Polynomial Regression.

    PubMed

    Ding, A Adam; Wu, Hulin

    2014-10-01

    We propose a new method to use a constrained local polynomial regression to estimate the unknown parameters in ordinary differential equation models with a goal of improving the smoothing-based two-stage pseudo-least squares estimate. The equation constraints are derived from the differential equation model and are incorporated into the local polynomial regression in order to estimate the unknown parameters in the differential equation model. We also derive the asymptotic bias and variance of the proposed estimator. Our simulation studies show that our new estimator is clearly better than the pseudo-least squares estimator in estimation accuracy with a small price of computational cost. An application example on immune cell kinetics and trafficking for influenza infection further illustrates the benefits of the proposed new method.

  9. Dynamic Harmony Search with Polynomial Mutation Algorithm for Valve-Point Economic Load Dispatch

    PubMed Central

    Karthikeyan, M.; Sree Ranga Raja, T.

    2015-01-01

    Economic load dispatch (ELD) problem is an important issue in the operation and control of modern control system. The ELD problem is complex and nonlinear with equality and inequality constraints which makes it hard to be efficiently solved. This paper presents a new modification of harmony search (HS) algorithm named as dynamic harmony search with polynomial mutation (DHSPM) algorithm to solve ORPD problem. In DHSPM algorithm the key parameters of HS algorithm like harmony memory considering rate (HMCR) and pitch adjusting rate (PAR) are changed dynamically and there is no need to predefine these parameters. Additionally polynomial mutation is inserted in the updating step of HS algorithm to favor exploration and exploitation of the search space. The DHSPM algorithm is tested with three power system cases consisting of 3, 13, and 40 thermal units. The computational results show that the DHSPM algorithm is more effective in finding better solutions than other computational intelligence based methods. PMID:26491710

  10. On modeling of tool wear using sensor fusion and polynomial classifiers

    NASA Astrophysics Data System (ADS)

    Deiab, Ibrahim; Assaleh, Khaled; Hammad, Firas

    2009-07-01

    With increased global competition, the manufacturing sector is vigorously working on enhancing the efficiency of manufacturing processes in terms of cost, quality, and environmental impact. This work presents a novel approach to model and predict cutting tool wear using statistical signal analysis, pattern recognition, and sensor fusion. The data are acquired from two sources: an acoustic emission sensor (AE) and a tool post dynamometer. The pattern recognition used here is based on two methods: Artificial Neural Networks (ANN) and Polynomial Classifiers (PC). Cutting tool wear values predicted by neural network (ANN) and polynomial classifiers (PC) are compared. For the case study presented, PC proved to significantly reduce the required training time compared to that required by an ANN without compromising the prediction accuracy. The predicted results compared well with the measured tool wear values.

  11. Gaussian beam radius measurement with a knife-edge: a polynomial approximation to the inverse error function.

    PubMed

    González-Cardel, Mario; Arguijo, Pedro; Díaz-Uribe, Rufino

    2013-06-01

    A method for approximating the inverse error function involved in the determination of the radius of a Gaussian beam is proposed. It is based on a polynomial inversion that can be developed to any desired degree, according to an a priori defined error budget. Analytic expressions are obtained and used to determine the radius of a TEM(oo) He-Ne laser beam from intensity measurements experimentally obtained by using the knife edge method. The error and the interval of validity of the approximation are determined for polynomials of different degrees. The analysis of the theoretical and experimental errors is also presented.

  12. Legendre wavelet operational matrix of fractional derivative through wavelet-polynomial transformation and its applications on non-linear system of fractional order differential equations

    NASA Astrophysics Data System (ADS)

    Isah, Abdulnasir; Chang, Phang

    2016-06-01

    In this article we propose the wavelet operational method based on shifted Legendre polynomial to obtain the numerical solutions of non-linear systems of fractional order differential equations (NSFDEs). The operational matrix of fractional derivative derived through wavelet-polynomial transformation are used together with the collocation method to turn the NSFDEs to a system of non-linear algebraic equations. Illustrative examples are given in order to demonstrate the accuracy and simplicity of the proposed techniques.

  13. Uncertainty Quantification in CO 2 Sequestration Using Surrogate Models from Polynomial Chaos Expansion

    SciTech Connect

    Zhang, Yan; Sahinidis, Nikolaos V.

    2013-03-06

    In this paper, surrogate models are iteratively built using polynomial chaos expansion (PCE) and detailed numerical simulations of a carbon sequestration system. Output variables from a numerical simulator are approximated as polynomial functions of uncertain parameters. Once generated, PCE representations can be used in place of the numerical simulator and often decrease simulation times by several orders of magnitude. However, PCE models are expensive to derive unless the number of terms in the expansion is moderate, which requires a relatively small number of uncertain variables and a low degree of expansion. To cope with this limitation, instead of using a classical full expansion at each step of an iterative PCE construction method, we introduce a mixed-integer programming (MIP) formulation to identify the best subset of basis terms in the expansion. This approach makes it possible to keep the number of terms small in the expansion. Monte Carlo (MC) simulation is then performed by substituting the values of the uncertain parameters into the closed-form polynomial functions. Based on the results of MC simulation, the uncertainties of injecting CO{sub 2} underground are quantified for a saline aquifer. Moreover, based on the PCE model, we formulate an optimization problem to determine the optimal CO{sub 2} injection rate so as to maximize the gas saturation (residual trapping) during injection, and thereby minimize the chance of leakage.

  14. A harmonic polynomial cell (HPC) method for 3D Laplace equation with application in marine hydrodynamics

    SciTech Connect

    Shao, Yan-Lin Faltinsen, Odd M.

    2014-10-01

    We propose a new efficient and accurate numerical method based on harmonic polynomials to solve boundary value problems governed by 3D Laplace equation. The computational domain is discretized by overlapping cells. Within each cell, the velocity potential is represented by the linear superposition of a complete set of harmonic polynomials, which are the elementary solutions of Laplace equation. By its definition, the method is named as Harmonic Polynomial Cell (HPC) method. The characteristics of the accuracy and efficiency of the HPC method are demonstrated by studying analytical cases. Comparisons will be made with some other existing boundary element based methods, e.g. Quadratic Boundary Element Method (QBEM) and the Fast Multipole Accelerated QBEM (FMA-QBEM) and a fourth order Finite Difference Method (FDM). To demonstrate the applications of the method, it is applied to some studies relevant for marine hydrodynamics. Sloshing in 3D rectangular tanks, a fully-nonlinear numerical wave tank, fully-nonlinear wave focusing on a semi-circular shoal, and the nonlinear wave diffraction of a bottom-mounted cylinder in regular waves are studied. The comparisons with the experimental results and other numerical results are all in satisfactory agreement, indicating that the present HPC method is a promising method in solving potential-flow problems. The underlying procedure of the HPC method could also be useful in other fields than marine hydrodynamics involved with solving Laplace equation.

  15. Convergent series for lattice models with polynomial interactions

    NASA Astrophysics Data System (ADS)

    Ivanov, Aleksandr S.; Sazonov, Vasily K.

    2017-01-01

    The standard perturbative weak-coupling expansions in lattice models are asymptotic. The reason for this is hidden in the incorrect interchange of the summation and integration. However, substituting the Gaussian initial approximation of the perturbative expansions by a certain interacting model or regularizing original lattice integrals, one can construct desired convergent series. In this paper we develop methods, which are based on the joint and separate utilization of the regularization and new initial approximation. We prove, that the convergent series exist and can be expressed as re-summed standard perturbation theory for any model on the finite lattice with the polynomial interaction of even degree. We discuss properties of such series and study their applicability to practical computations on the example of the lattice ϕ4-model. We calculate <ϕn2 > expectation value using the convergent series, the comparison of the results with the Borel re-summation and Monte Carlo simulations shows a good agreement between all these methods.

  16. Generalized coherent states for polynomial Weyl-Heisenberg algebras

    NASA Astrophysics Data System (ADS)

    Kibler, Maurice R.; Daoud, Mohammed

    2012-08-01

    It is the aim of this paper to show how to construct á la Perelomov and á la Barut-Girardello coherent states for a polynomial Weyl-Heisenberg algebra. This algebra depends on r parameters. For some special values of the parameter corresponding to r = 1, the algebra covers the cases of the su(1,1) algebra, the su(2) algebra and the ordinary Weyl-Heisenberg or oscillator algebra. For r arbitrary, the generalized Weyl-Heisenberg algebra admits finite or infinite-dimensional representations depending on the values of the parameters. Coherent states of the Perelomov type are derived in finite and infinite dimensions through a Fock-Bargmann approach based on the use of complex variables. The same approach is applied for deriving coherent states of the Barut-Girardello type in infinite dimension. In contrast, the construction of á la Barut-Girardello coherent states in finite dimension can be achieved solely at the price to replace complex variables by generalized Grassmann variables. Finally, some preliminary developments are given for the study of Bargmann functions associated with some of the coherent states obtained in this work.

  17. Polynomial chaos theory for performance evaluation of ATR systems

    NASA Astrophysics Data System (ADS)

    DeVore, Michael D.; Bateman, Alec J.

    2010-04-01

    The development of a more unified theory of automatic target recognition (ATR) has received considerable attention over the last several years from individual researchers, working groups, and workshops. One of the major benefits expected to accrue from such a theory is an ability to analytically derive performance metrics that accurately predict real-world behavior. Numerous sources of uncertainty affect the actual performance of an ATR system, so direct calculation has been limited in practice to a few special cases because of the practical difficulties of manipulating arbitrary probability distributions over high dimensional spaces. This paper introduces an alternative approach for evaluating ATR performance based on a generalization of NorbertWiener's polynomial chaos theory. Through this theory, random quantities are expressed not in terms of joint distribution functions but as convergent orthogonal series over a shared random basis. This form can be used to represent any finite-variance distribution and can greatly simplify the propagation of uncertainties through complex systems and algorithms. The paper presents an overview of the relevant theory and, as an example application, a discussion of how it can be applied to model the distribution of position errors from target tracking algorithms.

  18. Numerical Polynomial Homotopy Continuation Method and String Vacua

    DOE PAGES

    Mehta, Dhagash

    2011-01-01

    Finding vmore » acua for the four-dimensional effective theories for supergravity which descend from flux compactifications and analyzing them according to their stability is one of the central problems in string phenomenology. Except for some simple toy models, it is, however, difficult to find all the vacua analytically. Recently developed algorithmic methods based on symbolic computer algebra can be of great help in the more realistic models. However, they suffer from serious algorithmic complexities and are limited to small system sizes. In this paper, we review a numerical method called the numerical polynomial homotopy continuation (NPHC) method, first used in the areas of lattice field theories, which by construction finds all of the vacua of a given potential that is known to have only isolated solutions. The NPHC method is known to suffer from no major algorithmic complexities and is embarrassingly parallelizable , and hence its applicability goes way beyond the existing symbolic methods. We first solve a simple toy model as a warm-up example to demonstrate the NPHC method at work. We then show that all the vacua of a more complicated model of a compactified M theory model, which has an S U ( 3 ) structure, can be obtained by using a desktop machine in just about an hour, a feat which was reported to be prohibitively difficult by the existing symbolic methods. Finally, we compare the various technicalities between the two methods.« less

  19. Efficient computer algebra algorithms for polynomial matrices in control design

    NASA Technical Reports Server (NTRS)

    Baras, J. S.; Macenany, D. C.; Munach, R.

    1989-01-01

    The theory of polynomial matrices plays a key role in the design and analysis of multi-input multi-output control and communications systems using frequency domain methods. Examples include coprime factorizations of transfer functions, cannonical realizations from matrix fraction descriptions, and the transfer function design of feedback compensators. Typically, such problems abstract in a natural way to the need to solve systems of Diophantine equations or systems of linear equations over polynomials. These and other problems involving polynomial matrices can in turn be reduced to polynomial matrix triangularization procedures, a result which is not surprising given the importance of matrix triangularization techniques in numerical linear algebra. Matrices with entries from a field and Gaussian elimination play a fundamental role in understanding the triangularization process. In the case of polynomial matrices, matrices with entries from a ring for which Gaussian elimination is not defined and triangularization is accomplished by what is quite properly called Euclidean elimination. Unfortunately, the numerical stability and sensitivity issues which accompany floating point approaches to Euclidean elimination are not very well understood. New algorithms are presented which circumvent entirely such numerical issues through the use of exact, symbolic methods in computer algebra. The use of such error-free algorithms guarantees that the results are accurate to within the precision of the model data--the best that can be hoped for. Care must be taken in the design of such algorithms due to the phenomenon of intermediate expressions swell.

  20. Isothermal titration calorimetry: general formalism using binding polynomials.

    PubMed

    Freire, Ernesto; Schön, Arne; Velazquez-Campoy, Adrian

    2009-01-01

    The theory of the binding polynomial constitutes a very powerful formalism by which many experimental biological systems involving ligand binding can be analyzed under a unified framework. The analysis of isothermal titration calorimetry (ITC) data for systems possessing more than one binding site has been cumbersome because it required the user to develop a binding model to fit the data. Furthermore, in many instances, different binding models give rise to identical binding isotherms, making it impossible to discriminate binding mechanisms using binding data alone. One of the main advantages of the binding polynomials is that experimental data can be analyzed by employing a general model-free methodology that provides essential information about the system behavior (e.g., whether there exists binding cooperativity, whether the cooperativity is positive or negative, and the magnitude of the cooperative energy). Data analysis utilizing binding polynomials yields a set of binding association constants and enthalpy values that conserve their validity after the correct model has been determined. In fact, once the correct model is validated, the binding polynomial parameters can be immediately translated into the model specific constants. In this chapter, we describe the general binding polynomial formalism and provide specific theoretical and experimental examples of its application to isothermal titration calorimetry.

  1. Trajectory Optimization Using Adjoint Method and Chebyshev Polynomial Approximation for Minimizing Fuel Consumption During Climb

    NASA Technical Reports Server (NTRS)

    Nguyen, Nhan T.; Hornby, Gregory; Ishihara, Abe

    2013-01-01

    This paper describes two methods of trajectory optimization to obtain an optimal trajectory of minimum-fuel- to-climb for an aircraft. The first method is based on the adjoint method, and the second method is based on a direct trajectory optimization method using a Chebyshev polynomial approximation and cubic spine approximation. The approximate optimal trajectory will be compared with the adjoint-based optimal trajectory which is considered as the true optimal solution of the trajectory optimization problem. The adjoint-based optimization problem leads to a singular optimal control solution which results in a bang-singular-bang optimal control.

  2. A study on the susceptibility of minipig kidney (MPK) and rabbit kidney (RK13) cell line cultures to the lapinized Chinese strain of hog cholera virus.

    PubMed

    Rivero, V B; Gualandi, G L; Buonavoglia, C; Mortarino, P

    1988-10-01

    The susceptibility of two established cell lines of pig (MPK = minipig kidney) and rabbit (RK13 = rabbit kidney) origin to the lapinized Chinese (LC) strain of hog cholera virus (HCV) was studied. Spleen cells from rabbits infected with the virus under study were inoculated to cell cultures of either MPK and RK13 cells and subsequent passages were made by culturing the trypsinized infected cells with the normal cells. Only the MPK cell line appeared to be susceptible to virus replication. Since no cytopathic effects (CPE) were observed, the presence of the viral antigen in the inoculated cultures was detected by immunofluorescence tests. The virulence of the virus for rabbits was enhanced after its cultivation in MPK cell cultures. When the MPK cell culture system adapted virus was tested in neutralization trials in the presence of an HCV reference immune serum it was found that the virus did not modify its antigenic structure in any extent. Finally, the culture adapted virus appeared to be more immunogenic for rabbits than the original rabbits adapted virus. Based on these results, it seems reasonable to suggest the use of MPK cell line for the propagation of the LC strain of HCV as an alternative to the use of rabbits for the preparation of HCV vaccine.

  3. A major QTL corresponding to the Rk locus for resistance to root-knot nematodes in cowpea (Vigna unguiculata L. Walp.).

    PubMed

    Huynh, Bao-Lam; Matthews, William C; Ehlers, Jeffrey D; Lucas, Mitchell R; Santos, Jansen R P; Ndeve, Arsenio; Close, Timothy J; Roberts, Philip A

    2016-01-01

    Genome resolution of a major QTL associated with the Rk locus in cowpea for resistance to root-knot nematodes has significance for plant breeding programs and R gene characterization. Cowpea (Vigna unguiculata L. Walp.) is a susceptible host of root-knot nematodes (Meloidogyne spp.) (RKN), major plant-parasitic pests in global agriculture. To date, breeding for host resistance in cowpea has relied on phenotypic selection which requires time-consuming and expensive controlled infection assays. To facilitate marker-based selection, we aimed to identify and map quantitative trait loci (QTL) conferring the resistance trait. One recombinant inbred line (RIL) and two F2:3 populations, each derived from a cross between a susceptible and a resistant parent, were genotyped with genome-wide single nucleotide polymorphism (SNP) markers. The populations were screened in the field for root-galling symptoms and/or under growth-chamber conditions for nematode reproduction levels using M. incognita and M. javanica biotypes. One major QTL was mapped consistently on linkage group VuLG11 of each population. By genotyping additional cowpea lines and near-isogenic lines derived from conventional backcrossing, we confirmed that the detected QTL co-localized with the genome region associated with the Rk locus for RKN resistance that has been used in conventional breeding for many decades. This chromosomal location defined with flanking markers will be a valuable target in marker-assisted breeding and for positional cloning of genes controlling RKN resistance.

  4. Cross gramian approximation with Laguerre polynomials for model order reduction

    NASA Astrophysics Data System (ADS)

    Perev, Kamen

    2015-11-01

    This paper considers the problem of model order reduction by approximate balanced truncation with Laguerre polynomials approximation of the system cross gramian. The cross gramian contains information both for the reachability of the system as well as for its observability. The main property of the cross gramian for a square symmetric stable linear system is that its square is equal to the product of the reachability and observability gramians and therefore, the absolute values of its eigenvalues are equal to the Hankel singular values. This is the reason to use the cross gramian for computing balancing transformations for model reduction. Laguerre polynomial series representations are used to approximate the cross gramian of the system at infinity. The orthogonal polynomials of Laguerre possess good convergence properties and allow to reduce the computational complexity of the model reduction problem. Numerical experiments are performed confirming the effectiveness of the proposed method.

  5. Asymptotic formulae for the zeros of orthogonal polynomials

    NASA Astrophysics Data System (ADS)

    Badkov, V. M.

    2012-09-01

    Let p_n(t) be an algebraic polynomial that is orthonormal with weight p(t) on the interval \\lbrack -1, 1 \\rbrack . When p(t) is a perturbation (in certain limits) of the Chebyshev weight of the first kind, the zeros of the polynomial p_n(\\cos\\tau) and the differences between pairs of (not necessarily consecutive) zeros are shown to satisfy asymptotic formulae as n\\to\\infty, which hold uniformly with respect to the indices of the zeros. Similar results are also obtained for perturbations of the Chebyshev weight of the second kind. First, some preliminary results on the asymptotic behaviour of the difference between two zeros of an orthogonal trigonometric polynomial, which are needed, are established. Bibliography: 15 titles.

  6. Euler polynomials and identities for non-commutative operators

    NASA Astrophysics Data System (ADS)

    De Angelis, Valerio; Vignat, Christophe

    2015-12-01

    Three kinds of identities involving non-commutating operators and Euler and Bernoulli polynomials are studied. The first identity, as given by Bender and Bettencourt [Phys. Rev. D 54(12), 7710-7723 (1996)], expresses the nested commutator of the Hamiltonian and momentum operators as the commutator of the momentum and the shifted Euler polynomial of the Hamiltonian. The second one, by Pain [J. Phys. A: Math. Theor. 46, 035304 (2013)], links the commutators and anti-commutators of the monomials of the position and momentum operators. The third appears in a work by Figuieira de Morisson and Fring [J. Phys. A: Math. Gen. 39, 9269 (2006)] in the context of non-Hermitian Hamiltonian systems. In each case, we provide several proofs and extensions of these identities that highlight the role of Euler and Bernoulli polynomials.

  7. Nuclear-magnetic-resonance quantum calculations of the Jones polynomial

    PubMed Central

    Marx, Raimund; Fahmy, Amr; Kauffman, Louis; Lomonaco, Samuel; Spörl, Andreas; Pomplun, Nikolas; Schulte-Herbrüggen, Thomas; Myers, John M.; Glaser, Steffen J.

    2011-01-01

    The repertoire of problems theoretically solvable by a quantum computer recently expanded to include the approximate evaluation of knot invariants, specifically the Jones polynomial. The experimental implementation of this evaluation, however, involves many known experimental challenges. Here we present experimental results for small-scale approximate evaluation of the Jones polynomial by nuclear magnetic resonance (NMR); in addition, we show how to escape from the limitations of NMR approaches that employ pseudopure states. Specifically, we use two spin-1/2 nuclei of natural abundance chloroform and apply a sequence of unitary transforms representing the trefoil knot, the figure-eight knot, and the Borromean rings. After measuring the nuclear spin state of the molecule in each case, we are able to estimate the value of the Jones polynomial for each of the knots. PMID:21461143

  8. Polynomial algebra of discrete models in systems biology.

    PubMed

    Veliz-Cuba, Alan; Jarrah, Abdul Salam; Laubenbacher, Reinhard

    2010-07-01

    An increasing number of discrete mathematical models are being published in Systems Biology, ranging from Boolean network models to logical models and Petri nets. They are used to model a variety of biochemical networks, such as metabolic networks, gene regulatory networks and signal transduction networks. There is increasing evidence that such models can capture key dynamic features of biological networks and can be used successfully for hypothesis generation. This article provides a unified framework that can aid the mathematical analysis of Boolean network models, logical models and Petri nets. They can be represented as polynomial dynamical systems, which allows the use of a variety of mathematical tools from computer algebra for their analysis. Algorithms are presented for the translation into polynomial dynamical systems. Examples are given of how polynomial algebra can be used for the model analysis. alanavc@vt.edu Supplementary data are available at Bioinformatics online.

  9. Automatic differentiation for Fourier series and the radii polynomial approach

    NASA Astrophysics Data System (ADS)

    Lessard, Jean-Philippe; Mireles James, J. D.; Ransford, Julian

    2016-11-01

    In this work we develop a computer-assisted technique for proving existence of periodic solutions of nonlinear differential equations with non-polynomial nonlinearities. We exploit ideas from the theory of automatic differentiation in order to formulate an augmented polynomial system. We compute a numerical Fourier expansion of the periodic orbit for the augmented system, and prove the existence of a true solution nearby using an a-posteriori validation scheme (the radii polynomial approach). The problems considered here are given in terms of locally analytic vector fields (i.e. the field is analytic in a neighborhood of the periodic orbit) hence the computer-assisted proofs are formulated in a Banach space of sequences satisfying a geometric decay condition. In order to illustrate the use and utility of these ideas we implement a number of computer-assisted existence proofs for periodic orbits of the Planar Circular Restricted Three-Body Problem (PCRTBP).

  10. Model Fractional Quantum Hall States and Jack Polynomials

    SciTech Connect

    Bernevig, B. Andrei; Haldane, F. D. M.

    2008-06-20

    We describe an occupation-number-like picture of fractional quantum Hall states in terms of polynomial wave functions characterized by a dominant occupation-number configuration. The bosonic variants of single-component Abelian and non-Abelian fractional quantum Hall states are modeled by Jack symmetric polynomials (Jacks), characterized by dominant occupation-number configurations satisfying a generalized Pauli principle. In a series of well-known quantum Hall states, including the Laughlin, Read-Moore, and Read-Rezayi, the Jack polynomials naturally implement a ''squeezing rule'' that constrains allowed configurations to be restricted to those obtained by squeezing the dominant configuration. The Jacks presented in this Letter describe new trial uniform states, but it is yet to be determined to which actual experimental fractional quantum Hall effect states they apply.

  11. Prediction of zeolite-cement-sand unconfined compressive strength using polynomial neural network

    NASA Astrophysics Data System (ADS)

    MolaAbasi, H.; Shooshpasha, I.

    2016-04-01

    The improvement of local soils with cement and zeolite can provide great benefits, including strengthening slopes in slope stability problems, stabilizing problematic soils and preventing soil liquefaction. Recently, dosage methodologies are being developed for improved soils based on a rational criterion as it exists in concrete technology. There are numerous earlier studies showing the possibility of relating Unconfined Compressive Strength (UCS) and Cemented sand (CS) parameters (voids/cement ratio) as a power function fits. Taking into account the fact that the existing equations are incapable of estimating UCS for zeolite cemented sand mixture (ZCS) well, artificial intelligence methods are used for forecasting them. Polynomial-type neural network is applied to estimate the UCS from more simply determined index properties such as zeolite and cement content, porosity as well as curing time. In order to assess the merits of the proposed approach, a total number of 216 unconfined compressive tests have been done. A comparison is carried out between the experimentally measured UCS with the predictions in order to evaluate the performance of the current method. The results demonstrate that generalized polynomial-type neural network has a great ability for prediction of the UCS. At the end sensitivity analysis of the polynomial model is applied to study the influence of input parameters on model output. The sensitivity analysis reveals that cement and zeolite content have significant influence on predicting UCS.

  12. Fast and accurate sensitivity analysis of IMPT treatment plans using Polynomial Chaos Expansion

    NASA Astrophysics Data System (ADS)

    Perkó, Zoltán; van der Voort, Sebastian R.; van de Water, Steven; Hartman, Charlotte M. H.; Hoogeman, Mischa; Lathouwers, Danny

    2016-06-01

    The highly conformal planned dose distribution achievable in intensity modulated proton therapy (IMPT) can severely be compromised by uncertainties in patient setup and proton range. While several robust optimization approaches have been presented to address this issue, appropriate methods to accurately estimate the robustness of treatment plans are still lacking. To fill this gap we present Polynomial Chaos Expansion (PCE) techniques which are easily applicable and create a meta-model of the dose engine by approximating the dose in every voxel with multidimensional polynomials. This Polynomial Chaos (PC) model can be built in an automated fashion relatively cheaply and subsequently it can be used to perform comprehensive robustness analysis. We adapted PC to provide among others the expected dose, the dose variance, accurate probability distribution of dose-volume histogram (DVH) metrics (e.g. minimum tumor or maximum organ dose), exact bandwidths of DVHs, and to separate the effects of random and systematic errors. We present the outcome of our verification experiments based on 6 head-and-neck (HN) patients, and exemplify the usefulness of PCE by comparing a robust and a non-robust treatment plan for a selected HN case. The results suggest that PCE is highly valuable for both research and clinical applications.

  13. Fast and accurate sensitivity analysis of IMPT treatment plans using Polynomial Chaos Expansion.

    PubMed

    Perkó, Zoltán; van der Voort, Sebastian R; van de Water, Steven; Hartman, Charlotte M H; Hoogeman, Mischa; Lathouwers, Danny

    2016-06-21

    The highly conformal planned dose distribution achievable in intensity modulated proton therapy (IMPT) can severely be compromised by uncertainties in patient setup and proton range. While several robust optimization approaches have been presented to address this issue, appropriate methods to accurately estimate the robustness of treatment plans are still lacking. To fill this gap we present Polynomial Chaos Expansion (PCE) techniques which are easily applicable and create a meta-model of the dose engine by approximating the dose in every voxel with multidimensional polynomials. This Polynomial Chaos (PC) model can be built in an automated fashion relatively cheaply and subsequently it can be used to perform comprehensive robustness analysis. We adapted PC to provide among others the expected dose, the dose variance, accurate probability distribution of dose-volume histogram (DVH) metrics (e.g. minimum tumor or maximum organ dose), exact bandwidths of DVHs, and to separate the effects of random and systematic errors. We present the outcome of our verification experiments based on 6 head-and-neck (HN) patients, and exemplify the usefulness of PCE by comparing a robust and a non-robust treatment plan for a selected HN case. The results suggest that PCE is highly valuable for both research and clinical applications.

  14. A quasi-static polynomial nodal method for nuclear reactor analysis

    SciTech Connect

    Gehin, J.C.

    1992-09-01

    Modern nodal methods are currently available which can accurately and efficiently solve the static and transient neutron diffusion equations. Most of the methods, however, are limited to two energy groups for practical application. The objective of this research is the development of a static and transient, multidimensional nodal method which allows more than two energy groups and uses a non-linear iterative method for efficient solution of the nodal equations. For both the static and transient methods, finite-difference equations which are corrected by the use of discontinuity factors are derived. The discontinuity factors are computed from a polynomial nodal method using a non-linear iteration technique. The polynomial nodal method is based upon a quartic approximation and utilizes a quadratic transverse-leakage approximation. The solution of the time-dependent equations is performed by the use of a quasi-static method in which the node-averaged fluxes are factored into shape and amplitude functions. The application of the quasi-static polynomial method to several benchmark problems demonstrates that the accuracy is consistent with that of other nodal methods. The use of the quasi-static method is shown to substantially reduce the computation time over the traditional fully-implicit time-integration method. Problems involving thermal-hydraulic feedback are accurately, and efficiently, solved by performing several reactivity/thermal-hydraulic updates per shape calculation.

  15. Design and fabrication of an active polynomial grating for soft-X-ray monochromators and spectrometers

    NASA Astrophysics Data System (ADS)

    Chen, S.-J.; Chen, C. T.; Perng, S. Y.; Kuan, C. K.; Tseng, T. C.; Wang, D. J.

    2001-07-01

    An active polynomial grating has been designed for use in synchrotron radiation soft-X-ray monochromators and spectrometers. The grating can be dynamically adjusted to obtain the third-order-polynomial surface needed to eliminate the defocus and coma aberrations at any photon energy. Ray-tracing results confirm that a monochromator or spectrometer based on this active grating has nearly no aberration limit to the overall spectral resolution in the entire soft-X-ray region. The grating substrate is made of a precisely milled 17-4 PH stainless steel parallel plate, which is joined to a flexure-hinge bender shaped by wire electrical discharge machining. The substrate is grounded into a concave cylindrical shape with a nominal radius and then polished to achieve a roughness of 0.45 nm and a slope error of 1.2 μrad rms. The long trace profiler measurements show that the active grating can reach the desired third-order polynomial with a high degree of figure accuracy.

  16. Computationally efficient multidimensional analysis of complex flow cytometry data using second order polynomial histograms.

    PubMed

    Zaunders, John; Jing, Junmei; Leipold, Michael; Maecker, Holden; Kelleher, Anthony D; Koch, Inge

    2016-01-01

    Many methods have been described for automated clustering analysis of complex flow cytometry data, but so far the goal to efficiently estimate multivariate densities and their modes for a moderate number of dimensions and potentially millions of data points has not been attained. We have devised a novel approach to describing modes using second order polynomial histogram estimators (SOPHE). The method divides the data into multivariate bins and determines the shape of the data in each bin based on second order polynomials, which is an efficient computation. These calculations yield local maxima and allow joining of adjacent bins to identify clusters. The use of second order polynomials also optimally uses wide bins, such that in most cases each parameter (dimension) need only be divided into 4-8 bins, again reducing computational load. We have validated this method using defined mixtures of up to 17 fluorescent beads in 16 dimensions, correctly identifying all populations in data files of 100,000 beads in <10 s, on a standard laptop. The method also correctly clustered granulocytes, lymphocytes, including standard T, B, and NK cell subsets, and monocytes in 9-color stained peripheral blood, within seconds. SOPHE successfully clustered up to 36 subsets of memory CD4 T cells using differentiation and trafficking markers, in 14-color flow analysis, and up to 65 subpopulations of PBMC in 33-dimensional CyTOF data, showing its usefulness in discovery research. SOPHE has the potential to greatly increase efficiency of analysing complex mixtures of cells in higher dimensions.

  17. Polynomial approximation of Poincare maps for Hamiltonian system

    NASA Technical Reports Server (NTRS)

    Froeschle, Claude; Petit, Jean-Marc

    1992-01-01

    Different methods are proposed and tested for transforming a non-linear differential system, and more particularly a Hamiltonian one, into a map without integrating the whole orbit as in the well-known Poincare return map technique. We construct piecewise polynomial maps by coarse-graining the phase-space surface of section into parallelograms and using either only values of the Poincare maps at the vertices or also the gradient information at the nearest neighbors to define a polynomial approximation within each cell. The numerical experiments are in good agreement with both the real symplectic and Poincare maps.

  18. On solutions of polynomial growth of ordinary differential equations

    NASA Astrophysics Data System (ADS)

    van den Berg, I. P.

    We present a theorem on the existence of solutions of polynomial growth of ordinary differential equations of type E: {dY}/{dX} = F(X, Y) , where F is of class C1. We show that the asymptotic behaviour of these solutions and the variation of neighbouring solutions are obtained by solving an asymptotic functional equation related to E, and that this method has practical value. The theorem is standard; its nonstandard proof uses macroscope and microscope techniques. The result is an extension of results by F. and M. Diener and G. Reeb on solutions of polynomial growth of rational differential equations.

  19. Orthogonal polynomials, Laguerre Fock space, and quasi-classical asymptotics

    NASA Astrophysics Data System (ADS)

    Engliš, Miroslav; Ali, S. Twareque

    2015-07-01

    Continuing our earlier investigation of the Hermite case [S. T. Ali and M. Engliš, J. Math. Phys. 55, 042102 (2014)], we study an unorthodox variant of the Berezin-Toeplitz quantization scheme associated with Laguerre polynomials. In particular, we describe a "Laguerre analogue" of the classical Fock (Segal-Bargmann) space and the relevant semi-classical asymptotics of its Toeplitz operators; the former actually turns out to coincide with the Hilbert space appearing in the construction of the well-known Barut-Girardello coherent states. Further extension to the case of Legendre polynomials is likewise discussed.

  20. Tricomplex Dynamical Systems Generated by Polynomials of Odd Degree

    NASA Astrophysics Data System (ADS)

    Parisé, Pierre-Olivier; Rochon, Dominic

    In this paper, we give the exact interval of the cross section of the Multibrot sets generated by the polynomial zp + c where z and c are complex numbers and p > 2 is an odd integer. Furthermore, we show that the same Multibrots defined on the hyperbolic numbers are always squares. Moreover, we give a generalized 3D version of the hyperbolic Multibrot set and prove that our generalization is an octahedron for a specific 3D slice of the dynamical system generated by the tricomplex polynomial ηp + c where p > 2 is an odd integer.