Performance modeling and prediction for linear algebra algorithms
Iakymchuk, Roman
2012-01-01
This dissertation incorporates two research projects: performance modeling and prediction for dense linear algebra algorithms, and high-performance computing on clouds. The first project is focused on dense matrix computations, which are often used as computational kernels for numerous scientific applications. To solve a particular mathematical operation, linear algebra libraries provide a variety of algorithms. The algorithm of choice depends, obviously, on its performance. Performance of su...
Algorithms in Algebraic Geometry
Dickenstein, Alicia; Sommese, Andrew J
2008-01-01
In the last decade, there has been a burgeoning of activity in the design and implementation of algorithms for algebraic geometric computation. Some of these algorithms were originally designed for abstract algebraic geometry, but now are of interest for use in applications and some of these algorithms were originally designed for applications, but now are of interest for use in abstract algebraic geometry. The workshop on Algorithms in Algebraic Geometry that was held in the framework of the IMA Annual Program Year in Applications of Algebraic Geometry by the Institute for Mathematics and Its
Symplectic algebraic dynamics algorithm
Institute of Scientific and Technical Information of China (English)
2007-01-01
Based on the algebraic dynamics solution of ordinary differential equations andintegration of ,the symplectic algebraic dynamics algorithm sn is designed,which preserves the local symplectic geometric structure of a Hamiltonian systemand possesses the same precision of the na ve algebraic dynamics algorithm n.Computer experiments for the 4th order algorithms are made for five test modelsand the numerical results are compared with the conventional symplectic geometric algorithm,indicating that sn has higher precision,the algorithm-inducedphase shift of the conventional symplectic geometric algorithm can be reduced,and the dynamical fidelity can be improved by one order of magnitude.
Redesigning linear algebra algorithms
Energy Technology Data Exchange (ETDEWEB)
Dongarra, J.J.
1983-01-01
Many of the standard algorithms in linear algebra as implemented in FORTRAN do not achieve maximum performance on today's large-scale vector computers. The author examines the problem and constructs alternative formulations of algorithms that do not lose the clarity of the original algorithm or sacrifice the FORTRAN portable environment, but do gain the performance attainable on these supercomputers. The resulting implementation not only performs well on vector computers but also increases performance on conventional sequential computers. 13 references.
Redesigning linear algebra algorithms
Energy Technology Data Exchange (ETDEWEB)
Dongarra, J.J.
1983-01-01
Many of the standard algorithms in linear algebra as implemented in FORTRAN do not achieve maximum performance on today's large-scale vector computers. In this paper we examine the problem and construct alternative formulations of algorithms that do not lose the clarity of the original algorithm or sacrifice the Fortran portable environment, but do gain the performance attainable on these supercomputers. The resulting implementation not only performs well on vector computers but also increases performance on conventional sequential computers.
Global identifiability of linear compartmental models--a computer algebra algorithm.
Audoly, S; D'Angiò, L; Saccomani, M P; Cobelli, C
1998-01-01
A priori global identifiability deals with the uniqueness of the solution for the unknown parameters of a model and is, thus, a prerequisite for parameter estimation of biological dynamic models. Global identifiability is however difficult to test, since it requires solving a system of algebraic nonlinear equations which increases both in nonlinearity degree and number of terms and unknowns with increasing model order. In this paper, a computer algebra tool, GLOBI (GLOBal Identifiability) is presented, which combines the topological transfer function method with the Buchberger algorithm, to test global identifiability of linear compartmental models. GLOBI allows for the automatic testing of a priori global identifiability of general structure compartmental models from general multi input-multi output experiments. Examples of usage of GLOBI to analyze a priori global identifiability of some complex biological compartmental models are provided.
Energy Technology Data Exchange (ETDEWEB)
Littlefield, R.J.; Maschhoff, K.J.
1991-04-01
Many linear algebra algorithms utilize an array of processors across which matrices are distributed. Given a particular matrix size and a maximum number of processors, what configuration of processors, i.e., what size and shape array, will execute the fastest The answer to this question depends on tradeoffs between load balancing, communication startup and transfer costs, and computational overhead. In this paper we analyze in detail one algorithm: the blocked factored Jacobi method for solving dense eigensystems. A performance model is developed to predict execution time as a function of the processor array and matrix sizes, plus the basic computation and communication speeds of the underlying computer system. In experiments on a large hypercube (up to 512 processors), this model has been found to be highly accurate (mean error {approximately} 2%) over a wide range of matrix sizes (10 {times} 10 through 200 {times} 200) and processor counts (1 to 512). The model reveals, and direct experiment confirms, that the tradeoffs mentioned above can be surprisingly complex and counterintuitive. We propose decision procedures based directly on the performance model to choose configurations for fastest execution. The model-based decision procedures are compared to a heuristic strategy and shown to be significantly better. 7 refs., 8 figs., 1 tab.
Algebraic dynamics solution and algebraic dynamics algorithm of Burgers equations
Institute of Scientific and Technical Information of China (English)
2008-01-01
Algebraic dynamics solution and algebraic dynamics algorithm of nonlinear partial differential evolution equations in the functional space are applied to Burgers equation. The results indicate that the approach is effective for analytical solutions to Burgers equation, and the algorithm for numerical solutions of Burgers equation is more stable, with higher precision than other existing finite difference algo-rithms.
Institute of Scientific and Technical Information of China (English)
WANG ShunJin; ZHANG Hua
2007-01-01
Based on the exact analytical solution of ordinary differential equations,a truncation of the Taylor series of the exact solution to the Nth order leads to the Nth order algebraic dynamics algorithm.A detailed numerical comparison is presented with Runge-Kutta algorithm and symplectic geometric algorithm for 12 test models.The results show that the algebraic dynamics algorithm can better preserve both geometrical and dynamical fidelity of a dynamical system at a controllable precision,and it can solve the problem of algorithm-induced dissipation for the Runge-Kutta algorithm and the problem of algorithm-induced phase shift for the symplectic geometric algorithm.
Institute of Scientific and Technical Information of China (English)
2007-01-01
Based on the exact analytical solution of ordinary differential equations, a truncation of the Taylor series of the exact solution to the Nth order leads to the Nth order algebraic dynamics algorithm. A detailed numerical comparison is presented with Runge-Kutta algorithm and symplectic geometric algorithm for 12 test models. The results show that the algebraic dynamics algorithm can better preserve both geometrical and dynamical fidelity of a dynamical system at a controllable precision, and it can solve the problem of algorithm-induced dissipation for the Runge-Kutta algorithm and the problem of algorithm-induced phase shift for the symplectic geometric algorithm.
Directory of Open Access Journals (Sweden)
N. A. Vunder
2016-03-01
Full Text Available Subject of Research.The paper deals with the problem of required placement of state matrix modes in the system being designed.Methods.The problem has been solved with the use of vector matrix formalism of state space method with the dominant attention at the algebraic properties of the object control matrix. Main Results. Algebraic conditions have been obtained imposed on the matrix components of control plant and system models, which has helped to create the algorithms for solving the tasks without necessarily resorting to matrix Sylvester equation and Ackermann's formula. Practical Relevance. User’s base of algorithms for synthesis procedures of control systems with specified quality indices has been extended.
Parallel algorithms for numerical linear algebra
van der Vorst, H
1990-01-01
This is the first in a new series of books presenting research results and developments concerning the theory and applications of parallel computers, including vector, pipeline, array, fifth/future generation computers, and neural computers.All aspects of high-speed computing fall within the scope of the series, e.g. algorithm design, applications, software engineering, networking, taxonomy, models and architectural trends, performance, peripheral devices.Papers in Volume One cover the main streams of parallel linear algebra: systolic array algorithms, message-passing systems, algorithms for p
Optimal Algorithm for Algebraic Factoring
Institute of Scientific and Technical Information of China (English)
支丽红
1997-01-01
This paper presents on optimized method for factoring multivariate polynomials over algebraic extension fields defined by an irreducible ascending set. The basic idea is to convert multivariate polynomials to univariate polynomials and algebraic extension fields to algebraic number fields by suitable integer substituteions.Then factorize the univariate polynomials over the algebraic number fields.Finally,construct mulativariate factors of the original polynomial by Hensel lemma and TRUEFACTOR test.Some examples with timing are included.
Linear algebra algorithms for divisors on an algebraic curve
Khuri-Makdisi, Kamal
We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and matrices of size $O(g^2)\\times O(g)$. When the base field $k$ is finite, or if $C$ has a rational point over $k$, these give algorithms for working on the Jacobian of $C$ that require $O(g^4)$ field operations, arising from the Gaussian elimination. Our point of view is strongly geometric, and our representation of points on the Jacobian is fairly simple to work with; in particular, none of our algorithms involves arithmetic with polynomials. We note that our algorithms have the same asymptotic complexity for general curves as the more algebraic algorithms in Hess' 1999 Ph.D. thesis, which works with function fields as extensions of $k[x]$. However, for special classes of curves, Hess' algorithms are asymptotically more efficient than ours, generalizing other known efficient algorithms for special classes of curves, such as hyperelliptic curves (Cantor), superelliptic curves (Galbraith, Paulus, and Smart), and $C_{ab}$ curves (Harasawa and Suzuki); in all those cases, one can attain a complexity of $O(g^2)$.
Algebraic Algorithm Design and Local Search
1996-12-01
clearly illustrate that casting algorithm design into an algebraic framework brings a lot of theoretical and practical knowledge to bear on the problem ...makes defining a suitable crossover operator easier. In (47), however, the traveling salesman problem was solved using a genetic algorithm with a... Knapsack and other 0-1 integer programs can be approached with this neighborhood. Problems where a subset of a particular size is desired can be
Gonzalez-Vega, Laureano
1999-01-01
Using a Computer Algebra System (CAS) to help with the teaching of an elementary course in linear algebra can be one way to introduce computer algebra, numerical analysis, data structures, and algorithms. Highlights the advantages and disadvantages of this approach to the teaching of linear algebra. (Author/MM)
An Algebraic Hardware/Software Partitioning Algorithm
Institute of Scientific and Technical Information of China (English)
秦胜潮; 何积丰; 裘宗燕; 张乃孝
2002-01-01
Hardware and software co-design is a design technique which delivers computer systems comprising hardware and software components. A critical phase of the co-design process is to decompose a program into hardware and software. This paper proposes an algebraic partitioning algorithm whose correctness is verified in program algebra. The authors introduce a program analysis phase before program partitioning and develop a collection of syntax-based splitting rules. The former provides the information for moving operations from software to hardware and reducing the interaction between components, and the latter supports a compositional approach to program partitioning.
Frequency domain simultaneous algebraic reconstruction techniques: algorithm and convergence
Wang, Jiong; Zheng, Yibin
2005-03-01
We propose a simultaneous algebraic reconstruction technique (SART) in the frequency domain for linear imaging problems. This algorithm has the advantage of efficiently incorporating pixel correlations in an a priori image model. First it is shown that the generalized SART algorithm converges to the weighted minimum norm solution of a weighted least square problem. Then an implementation in the frequency domain is described. The performance of the new algorithm is demonstrated with fan beam computed tomography (CT) examples. Compared to the traditional SART and its major alternative ART, the new algorithm offers superior image quality and potential application to other modalities.
Homogeneous Buchberger algorithms and Sullivant's computational commutative algebra challenge
DEFF Research Database (Denmark)
Lauritzen, Niels
2005-01-01
We give a variant of the homogeneous Buchberger algorithm for positively graded lattice ideals. Using this algorithm we solve the Sullivant computational commutative algebra challenge.......We give a variant of the homogeneous Buchberger algorithm for positively graded lattice ideals. Using this algorithm we solve the Sullivant computational commutative algebra challenge....
Algebraic dynamics solution to and algebraic dynamics algorithm for nonlinear advection equation
Institute of Scientific and Technical Information of China (English)
2008-01-01
Algebraic dynamics approach and algebraic dynamics algorithm for the solution of nonlinear partial differential equations are applied to the nonlinear advection equa-tion. The results show that the approach is effective for the exact analytical solu-tion and the algorithm has higher precision than other existing algorithms in nu-merical computation for the nonlinear advection equation.
Exact linear modeling using Ore algebras
Schindelar, Kristina; Zerz, Eva
2010-01-01
Linear exact modeling is a problem coming from system identification: Given a set of observed trajectories, the goal is find a model (usually, a system of partial differential and/or difference equations) that explains the data as precisely as possible. The case of operators with constant coefficients is well studied and known in the systems theoretic literature, whereas the operators with varying coefficients were addressed only recently. This question can be tackled either using Gr\\"obner bases for modules over Ore algebras or by following the ideas from differential algebra and computing in commutative rings. In this paper, we present algorithmic methods to compute "most powerful unfalsified models" (MPUM) and their counterparts with variable coefficients (VMPUM) for polynomial and polynomial-exponential signals. We also study the structural properties of the resulting models, discuss computer algebraic techniques behind algorithms and provide several examples.
Optical linear algebra processors - Architectures and algorithms
Casasent, David
1986-01-01
Attention is given to the component design and optical configuration features of a generic optical linear algebra processor (OLAP) architecture, as well as the large number of OLAP architectures, number representations, algorithms and applications encountered in current literature. Number-representation issues associated with bipolar and complex-valued data representations, high-accuracy (including floating point) performance, and the base or radix to be employed, are discussed, together with case studies on a space-integrating frequency-multiplexed architecture and a hybrid space-integrating and time-integrating multichannel architecture.
Dimer models and Calabi-Yau algebras
Broomhead, Nathan
2008-01-01
In this thesis we study dimer models, as introduced in string theory, which give a way of writing down a class of non-commutative `superpotential' algebras. Some examples are 3-dimensional Calabi-Yau algebras, as defined by Ginzburg, and some are not. We consider two types of `consistency' condition on dimer models, and show that a `geometrically consistent' model is `algebraically consistent'. Finally we prove that the algebras obtained from algebraically consistent dimer models are 3-dimensional Calabi-Yau algebras.
Observable Algebra in Field Algebra of G-spin Models
Institute of Scientific and Technical Information of China (English)
蒋立宁
2003-01-01
Field algebra of G-spin models can provide the simplest examples of lattice field theory exhibiting quantum symmetry. Let D(G) be the double algebra of a finite group G and D(H), a sub-algebra of D(G) determined by subgroup H of G. This paper gives concrete generators and the structure of the observable algebra AH, which is a D(H)-invariant sub-algebra in the field algebra of G-spin models F, and shows that AH is a C*-algebra. The correspondence between H and AH is strictly monotonic. Finally, a duality between D(H) and AH is given via an irreducible vacuum C*-representation of F.
Algebraic Aspects of Orbifold Models
Bántay, P
1994-01-01
: Algebraic properties of orbifold models on arbitrary Riemann surfaces are investigated. The action of mapping class group transformations and of standard geometric operations is given explicitly. An infinite dimensional extension of the quantum group is presented.
Algebraic Statistics for Network Models
2014-02-19
AFRL-OSR-VA-TR-2014-0070 (DARPA) Algebraic Statistics for Network Models SONJA PETROVIC PENNSYLVANIA STATE UNIVERSITY 02/19/2014 Final Report...DARPA GRAPHS Phase I Algebraic Statistics for Network Models FA9550-12-1-0392 Sonja Petrović petrovic@psu.edu1 Department of Statistics Pennsylvania...Department of Statistics, Heinz College , Machine Learning Department, Cylab Carnegie Mellon University 1. Abstract This project focused on the family of
3D Object Recognition Based on Linear Lie Algebra Model
Institute of Scientific and Technical Information of China (English)
LI Fang-xing; WU Ping-dong; SUN Hua-fei; PENG Lin-yu
2009-01-01
A surface model called the fibre bundle model and a 3D object model based on linear Lie algebra model are proposed.Then an algorithm of 3D object recognition using the linear Lie algebra models is presented.It is a convenient recognition method for the objects which are symmetric about some axis.By using the presented algorithm,the representation matrices of the fibre or the base curve from only finite points of the linear Lie algebra model can be obtained.At last some recognition results of practicalities are given.
FOUNDATION OF NUCLEAR ALGEBRAIC MODELS
Institute of Scientific and Technical Information of China (English)
周孝谦
1990-01-01
Based upon Tomonoga-Rowe's many body theory, we find that the algebraic models, including IBM and FDSM are simplest extension of Rowe-Rosensteel's sp(3R).Dynkin-Gruber's subalgebra embedding method is applied to find an appropriate algebra and it's reduction chains conforming to physical requirement. The separated cases sp(6) and so(8) now appear as two branches stemming from the same root D6-O(12). Transitional ease between sp(6) and so(8) is inherently include.
Institute of Scientific and Technical Information of China (English)
WANG Shunjin; ZHANG Hua
2006-01-01
The problem of preserving fidelity in numerical computation of nonlinear ordinary differential equations is studied in terms of preserving local differential structure and approximating global integration structure of the dynamical system.The ordinary differential equations are lifted to the corresponding partial differential equations in the framework of algebraic dynamics,and a new algorithm-algebraic dynamics algorithm is proposed based on the exact analytical solutions of the ordinary differential equations by the algebraic dynamics method.In the new algorithm,the time evolution of the ordinary differential system is described locally by the time translation operator and globally by the time evolution operator.The exact analytical piece-like solution of the ordinary differential equations is expressd in terms of Taylor series with a local convergent radius,and its finite order truncation leads to the new numerical algorithm with a controllable precision better than Runge Kutta Algorithm and Symplectic Geometric Algorithm.
Performance Analysis of a Decoding Algorithm for Algebraic Geometry Codes
DEFF Research Database (Denmark)
Jensen, Helge Elbrønd; Nielsen, Rasmus Refslund; Høholdt, Tom
1998-01-01
We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is greater than or equal to [(dFR-1)/2]+1, where dFR is the Feng-Rao distance......We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is greater than or equal to [(dFR-1)/2]+1, where dFR is the Feng-Rao distance...
Impact of hierarchical memory systems on linear algebra algorithm design
Energy Technology Data Exchange (ETDEWEB)
Gallivan, K.; Jalby, W.; Meier, U.; Sameh, A.H.
1988-01-01
Linear algebra algorithms based on the BLAS or extended BLAS do not achieve high performance on multivector processors with a hierarchical memory system because of a lack of data locality. For such machines, block linear algebra algorithms must be implemented in terms of matrix-matrix primitives (BLAS3). Designing efficient linear algebra algorithms for these architectures requires analysis of the behavior of the matrix-matrix primitives and the resulting block algorithms as a function of certain system parameters. The analysis must identify the limits of performance improvement possible via blocking and any contradictory trends that require trade-off consideration. The authors propose a methodology that facilitates such an analysis and use it to analyze the performance of the BLAS3 primitives used in block methods. A similar analysis of the block size-performance relationship is also performed at the algorithm level for block versions of the LU decomposition and the Gram-Schmidt orthogonalization procedures.
Institute of Scientific and Technical Information of China (English)
WANG Shundin; ZHANG Hua
2008-01-01
Using functional derivative technique In quantum field theory,the algebraic dy-namics approach for solution of ordinary differential evolution equations was gen-eralized to treat partial differential evolution equations.The partial differential evo-lution equations were lifted to the corresponding functional partial differential equations in functional space by Introducing the time translation operator.The functional partial differential evolution equations were solved by algebraic dynam-ics.The algebraic dynamics solutions are analytical In Taylor series In terms of both initial functions and time.Based on the exact analytical solutions,a new nu-merical algorithm-algebraic dynamics algorithm was proposed for partial differ-ential evolution equations.The difficulty of and the way out for the algorithm were discussed.The application of the approach to and computer numerical experi-ments on the nonlinear Burgers equation and meteorological advection equation indicate that the algebraic dynamics approach and algebraic dynamics algorithm are effective to the solution of nonlinear partial differential evolution equations both analytically and numerically.
Institute of Scientific and Technical Information of China (English)
2008-01-01
Using functional derivative technique in quantum field theory, the algebraic dy-namics approach for solution of ordinary differential evolution equations was gen-eralized to treat partial differential evolution equations. The partial differential evo-lution equations were lifted to the corresponding functional partial differential equations in functional space by introducing the time translation operator. The functional partial differential evolution equations were solved by algebraic dynam-ics. The algebraic dynamics solutions are analytical in Taylor series in terms of both initial functions and time. Based on the exact analytical solutions, a new nu-merical algorithm—algebraic dynamics algorithm was proposed for partial differ-ential evolution equations. The difficulty of and the way out for the algorithm were discussed. The application of the approach to and computer numerical experi-ments on the nonlinear Burgers equation and meteorological advection equation indicate that the algebraic dynamics approach and algebraic dynamics algorithm are effective to the solution of nonlinear partial differential evolution equations both analytically and numerically.
Applied algebra codes, ciphers and discrete algorithms
Hardy, Darel W; Walker, Carol L
2009-01-01
This book attempts to show the power of algebra in a relatively simple setting.-Mathematical Reviews, 2010… The book supports learning by doing. In each section we can find many examples which clarify the mathematics introduced in the section and each section is followed by a series of exercises of which approximately half are solved in the end of the book. Additional the book comes with a CD-ROM containing an interactive version of the book powered by the computer algebra system Scientific Notebook. … the mathematics in the book are developed as needed and the focus of the book lies clearly o
High performance linear algebra algorithms: An introduction
DEFF Research Database (Denmark)
Gustavson, F.G.; Wasniewski, Jerzy
2006-01-01
his Mini-Symposium consisted of two back to back sessions, each consisting of five presentations, held on the afternoon of Monday, June 21, 2004. A major theme of both sessions was novel data structures for the matrices of dense linear algebra, DLA. Talks one to four of session one all centered...
An Improved Algorithm for Generating Database Transactions from Relational Algebra Specifications
Directory of Open Access Journals (Sweden)
Daniel J. Dougherty
2010-03-01
Full Text Available Alloy is a lightweight modeling formalism based on relational algebra. In prior work with Fisler, Giannakopoulos, Krishnamurthi, and Yoo, we have presented a tool, Alchemy, that compiles Alloy specifications into implementations that execute against persistent databases. The foundation of Alchemy is an algorithm for rewriting relational algebra formulas into code for database transactions. In this paper we report on recent progress in improving the robustness and efficiency of this transformation.
On the Model Properties of BCK Algebras
Institute of Scientific and Technical Information of China (English)
LIANGJun-qi
2004-01-01
This paper is devoted to the study of the logical properties of BCK algebras. For formalized BCK algebra theory T, it is proved that T is preserved under submodels and unions of chains; T is neither complete nor model complete, and hence there exist no builtin Skolem function. Moreover, the ultraproduct BCK algebras and the fuzzy ultraproduct of fuzzy subsets of BCK algebras were proposed by using the concept of ultrafilters with corresponding propertics of fuzzy ideals discussed.
MATRIX ALGEBRA ALGORITHM OF STRUCTURE RANDOM RESPONSE NUMERICAL CHARACTERISTICS
Institute of Scientific and Technical Information of China (English)
无
2003-01-01
A new algorithm of structure random response numerical characteristics, named as matrix algebra algorithm of structure analysis is presented.Using the algorithm, structure random response numerical characteristics can easily be got by directly solving linear matrix equations rather than structure motion differential equations.Moreover, in order to solve the corresponding linear matrix equations, the numerical integration fast algorithm is presented.Then according to the results, dynamic design and life-span estimation can be done.Besides, the new algorithm can solve non-proportion damp structure response.
Algebraic and algorithmic frameworks for optimized quantum measurements
DEFF Research Database (Denmark)
Laghaout, Amine; Andersen, Ulrik Lund
2015-01-01
von Neumann projections are the main operations by which information can be extracted from the quantum to the classical realm. They are, however, static processes that do not adapt to the states they measure. Advances in the field of adaptive measurement have shown that this limitation can...... for designing optimized measurements. Our approach is twofold: The first is algebraic and formulates the problem of measurement as a simple matrix diagonalization problem. The second is algorithmic and models the optimal interaction between measurement outcomes and measurement settings as a cascaded network...... of conditional probabilities. Finally, we demonstrate that several figures of merit, such as Bell factors, can be improved by optimized measurements. This leads us to the promising observation that measurement detectors which - taken individually - have a low quantum efficiency can be arranged into circuits...
MODEL IDENTIFICATION AND COMPUTER ALGEBRA.
Bollen, Kenneth A; Bauldry, Shawn
2010-10-07
Multiequation models that contain observed or latent variables are common in the social sciences. To determine whether unique parameter values exist for such models, one needs to assess model identification. In practice analysts rely on empirical checks that evaluate the singularity of the information matrix evaluated at sample estimates of parameters. The discrepancy between estimates and population values, the limitations of numerical assessments of ranks, and the difference between local and global identification make this practice less than perfect. In this paper we outline how to use computer algebra systems (CAS) to determine the local and global identification of multiequation models with or without latent variables. We demonstrate a symbolic CAS approach to local identification and develop a CAS approach to obtain explicit algebraic solutions for each of the model parameters. We illustrate the procedures with several examples, including a new proof of the identification of a model for handling missing data using auxiliary variables. We present an identification procedure for Structural Equation Models that makes use of CAS and that is a useful complement to current methods.
Overview of parallel algorithms in numerical linear algebra
Energy Technology Data Exchange (ETDEWEB)
Sameh, A.
1983-01-01
The author gives a brief survey of the development of multiprocessor algorithms for: (i) the direct solution of linear systems, (ii) the algebraic eigenvalue problem, and (iii) the direct and iterative methods for solving the finite-difference or finite-element linear systems of equations arising from the discretization of linear partial differential equations. 66 references.
An Algorithm for the Decomposition of Semisimple Lie Algebras
Graaf, W.A. de
2001-01-01
We consider the problem of decomposing a semisimple Lie algebra dened over a eld of characteristic zero as a direct sum of its simple ideals The method is based on the decomposition of the action of a Cartan subalgebra An implementation of the algorithm in the system ELIAS is discussed at the end of
Algorithmic Algebraic Combinatorics and Gröbner Bases
Klin, Mikhail; Jurisic, Aleksandar
2009-01-01
This collection of tutorial and research papers introduces readers to diverse areas of modern pure and applied algebraic combinatorics and finite geometries with a special emphasis on algorithmic aspects and the use of the theory of Grobner bases. Topics covered include coherent configurations, association schemes, permutation groups, Latin squares, the Jacobian conjecture, mathematical chemistry, extremal combinatorics, coding theory, designs, etc. Special attention is paid to the description of innovative practical algorithms and their implementation in software packages such as GAP and MAGM
Matrix algebra for linear models
Gruber, Marvin H J
2013-01-01
Matrix methods have evolved from a tool for expressing statistical problems to an indispensable part of the development, understanding, and use of various types of complex statistical analyses. This evolution has made matrix methods a vital part of statistical education. Traditionally, matrix methods are taught in courses on everything from regression analysis to stochastic processes, thus creating a fractured view of the topic. Matrix Algebra for Linear Models offers readers a unique, unified view of matrix analysis theory (where and when necessary), methods, and their applications. Written f
Algebraic Lens Distortion Model Estimation
Directory of Open Access Journals (Sweden)
Luis Alvarez
2010-07-01
Full Text Available A very important property of the usual pinhole model for camera projection is that 3D lines in the scene are projected to 2D lines. Unfortunately, wide-angle lenses (specially low-cost lenses may introduce a strong barrel distortion, which makes the usual pinhole model fail. Lens distortion models try to correct such distortion. We propose an algebraic approach to the estimation of the lens distortion parameters based on the rectification of lines in the image. Using the proposed method, the lens distortion parameters are obtained by minimizing a 4 total-degree polynomial in several variables. We perform numerical experiments using calibration patterns and real scenes to show the performance of the proposed method.
ALGEBRA: ALgorithm for the heterogeneous dosimetry based on GEANT4 for BRAchytherapy.
Afsharpour, H; Landry, G; D'Amours, M; Enger, S; Reniers, B; Poon, E; Carrier, J-F; Verhaegen, F; Beaulieu, L
2012-06-07
Task group 43 (TG43)-based dosimetry algorithms are efficient for brachytherapy dose calculation in water. However, human tissues have chemical compositions and densities different than water. Moreover, the mutual shielding effect of seeds on each other (interseed attenuation) is neglected in the TG43-based dosimetry platforms. The scientific community has expressed the need for an accurate dosimetry platform in brachytherapy. The purpose of this paper is to present ALGEBRA, a Monte Carlo platform for dosimetry in brachytherapy which is sufficiently fast and accurate for clinical and research purposes. ALGEBRA is based on the GEANT4 Monte Carlo code and is capable of handling the DICOM RT standard to recreate a virtual model of the treated site. Here, the performance of ALGEBRA is presented for the special case of LDR brachytherapy in permanent prostate and breast seed implants. However, the algorithm is also capable of handling other treatments such as HDR brachytherapy.
(Numerical algorithms for solving linear algebra problems). Final report
Energy Technology Data Exchange (ETDEWEB)
Golub, G.H.
1985-04-16
We have concentrated on developing and analyzing various numerical algorithms for solving problems arising in a linear algebra context. The papers and research fall into basically three categories: (1) iterative methods for solving linear equations arising from p.d.e.'s; (2) calculation of Gauss-type quadrature rules; and (3) solution of matrix and data problems arising in statistical computation. We summarize some of these results, highlighting those which are of most importance.
New parallel algorithms in linear algebra
Energy Technology Data Exchange (ETDEWEB)
Evans, D.J.
1983-01-01
The well-known and established techniques for deriving the numerical solution of linear systems of equations of the form ax=b are based on the following two basic strategies: (a) the factorisation of the coefficient matrix into easily inverted factors l and u leading to the class of direct methods, i.e. Gaussian elimination, Lu decomposition, Choleski, and (b) the splitting of the matrix a into convenient forms l and u which result in the iterative methods of Jacobi, Gauss Seidel and Sor. However, both these strategies essentially lead to algorithms more suitable for sequential computers and the question of a more convenient factorisation or splitting strategy for parallel processing is discussed leading to the formulation of new techniques based on the factorisation and splitting of the coefficient matrix a into components which are essentially interlocking matrix quadrants. It is shown that such a proposition leads to new parallel algorithms for both direct and iterative methods of solving linear equations and eigenvalue analysis. 15 references.
A spatial operator algebra for manipulator modeling and control
Rodriguez, G.; Kreutz, K.; Milman, M.
1988-01-01
A powerful new spatial operator algebra for modeling, control, and trajectory design of manipulators is discussed along with its implementation in the Ada programming language. Applications of this algebra to robotics include an operator representation of the manipulator Jacobian matrix; the robot dynamical equations formulated in terms of the spatial algebra, showing the complete equivalence between the recursive Newton-Euler formulations to robot dynamics; the operator factorization and inversion of the manipulator mass matrix which immediately results in O(N) recursive forward dynamics algorithms; the joint accelerations of a manipulator due to a tip contact force; the recursive computation of the equivalent mass matrix as seen at the tip of a manipulator; and recursive forward dynamics of a closed chain system. Finally, additional applications and current research involving the use of the spatial operator algebra are discussed in general terms.
A Review of Algebraic Link Analysis Algorithms
Directory of Open Access Journals (Sweden)
Mini Singh Ahuja
2012-08-01
Full Text Available The World Wide Web is a system of interlinked hypertext documents accessed via the Internet. With a web browser, one can view web pages that may contain text, images, videos, and other multimedia and navigate between them by using hyperlinks. Navigation is the process through which the users can achieve their purposes in using Web site, such as to find the information that they need or to complete the transactions that they want to do. Web mining is the application of data mining techniques to extract knowledge from Web data, where at least one of structure (hyperlink or usage (Web log data is used in the mining process (with or without other types of Web data. In this paper we have briefly discussed the web mining technique with major stress to the link analysis algorithms.
MultiAspect Graphs: Algebraic Representation and Algorithms
Directory of Open Access Journals (Sweden)
Klaus Wehmuth
2016-12-01
Full Text Available We present the algebraic representation and basic algorithms for MultiAspect Graphs (MAGs. A MAG is a structure capable of representing multilayer and time-varying networks, as well as higher-order networks, while also having the property of being isomorphic to a directed graph. In particular, we show that, as a consequence of the properties associated with the MAG structure, a MAG can be represented in matrix form. Moreover, we also show that any possible MAG function (algorithm can be obtained from this matrix-based representation. This is an important theoretical result since it paves the way for adapting well-known graph algorithms for application in MAGs. We present a set of basic MAG algorithms, constructed from well-known graph algorithms, such as degree computing, Breadth First Search (BFS, and Depth First Search (DFS. These algorithms adapted to the MAG context can be used as primitives for building other more sophisticated MAG algorithms. Therefore, such examples can be seen as guidelines on how to properly derive MAG algorithms from basic algorithms on directed graphs. We also make available Python implementations of all the algorithms presented in this paper.
Modeling digital switching circuits with linear algebra
Thornton, Mitchell A
2014-01-01
Modeling Digital Switching Circuits with Linear Algebra describes an approach for modeling digital information and circuitry that is an alternative to Boolean algebra. While the Boolean algebraic model has been wildly successful and is responsible for many advances in modern information technology, the approach described in this book offers new insight and different ways of solving problems. Modeling the bit as a vector instead of a scalar value in the set {0, 1} allows digital circuits to be characterized with transfer functions in the form of a linear transformation matrix. The use of transf
Acoustooptic linear algebra processors - Architectures, algorithms, and applications
Casasent, D.
1984-01-01
Architectures, algorithms, and applications for systolic processors are described with attention to the realization of parallel algorithms on various optical systolic array processors. Systolic processors for matrices with special structure and matrices of general structure, and the realization of matrix-vector, matrix-matrix, and triple-matrix products and such architectures are described. Parallel algorithms for direct and indirect solutions to systems of linear algebraic equations and their implementation on optical systolic processors are detailed with attention to the pipelining and flow of data and operations. Parallel algorithms and their optical realization for LU and QR matrix decomposition are specifically detailed. These represent the fundamental operations necessary in the implementation of least squares, eigenvalue, and SVD solutions. Specific applications (e.g., the solution of partial differential equations, adaptive noise cancellation, and optimal control) are described to typify the use of matrix processors in modern advanced signal processing.
Lagrangians for the W-Algebra Models
Gaite, J C
1994-01-01
The field algebra of the minimal models of W-algebras is amenable to a very simple description as a polynomial algebra generated by few elementary fields, corresponding to order parameters. Using this description, the complete Landau-Ginzburg lagrangians for these models are obtained. Perturbing these lagrangians we can explore their phase diagrams, which correspond to multicritical points with $D_n$ symmetry. In particular, it is shown that there is a perturbation for which the phase structure coincides with that of the IRF models of Jimbo et al.
Computer Algebra Algorithms for Special Functions in Particle Physics
Ablinger, Jakob
2013-01-01
This work deals with special nested objects arising in massive higher order perturbative calculations in renormalizable quantum field theories. On the one hand we work with nested sums such as harmonic sums and their generalizations (S-sums, cyclotomic harmonic sums, cyclotomic S-sums) and on the other hand we treat iterated integrals of the Poincar\\'e and Chen-type, such as harmonic polylogarithms and their generalizations (multiple polylogarithms, cyclotomic harmonic polylogarithms). The iterated integrals are connected to the nested sums via (generalizations of) the Mellin-transformation and we show how this transformation can be computed. We derive algebraic and structural relations between the nested sums as well as relations between the values of the sums at infinity and connected to it the values of the iterated integrals evaluated at special constants. In addition we state algorithms to compute asymptotic expansions of these nested objects and we state an algorithm which rewrites certain types of nest...
Parallelization for MIMD multiprocessors with applications to linear algebra algorithms
Energy Technology Data Exchange (ETDEWEB)
Nelken, I.H.
1989-01-01
In this thesis, the author considers the parallelization problem. Given a sequential algorithm and a target architecture, how can the sequential algorithm be converted into a parallel algorithm suitable for the target architecture The parallel algorithm must be correct and produce the same results as the sequential one. It must also utilize the resources of the target architecture efficiently. The parallelization problem can be divided into three main stages: identification of parallelism which includes dependency analysis, partitioning the statements into atomic tasks of granularity suitable to the target architecture and scheduling these tasks into the processors. The identification of parallelism is independent of the target architecture while the partitioning and scheduling stages are very dependent on it. For example, the partitioning for a machine with many small processors is very different than the partitioning for a machine with a few large ones. It is well known that the problems arising in the partitioning and scheduling stages are NP-complete. The thesis shows that for some algorithms arising in linear algebra, simple heuristics are sufficient to produce good solutions to the partitioning and scheduling problems. He considers the Gaussian elimination and Gauss-Jordan algorithms for general dense matrices and the Cholesky decomposition algorithms for symmetric positive definite matrices. In addition he studies algorithms for the solution of simultaneous triangular systems with the same coefficient matrix and different right hand sides and for the solution of the triangular Sylvester equation. Most of the results in this thesis are related to the more difficult problems of partitioning and scheduling for message passing architectures.
Computational algebraic geometry of epidemic models
Rodríguez Vega, Martín.
2014-06-01
Computational Algebraic Geometry is applied to the analysis of various epidemic models for Schistosomiasis and Dengue, both, for the case without control measures and for the case where control measures are applied. The models were analyzed using the mathematical software Maple. Explicitly the analysis is performed using Groebner basis, Hilbert dimension and Hilbert polynomials. These computational tools are included automatically in Maple. Each of these models is represented by a system of ordinary differential equations, and for each model the basic reproductive number (R0) is calculated. The effects of the control measures are observed by the changes in the algebraic structure of R0, the changes in Groebner basis, the changes in Hilbert dimension, and the changes in Hilbert polynomials. It is hoped that the results obtained in this paper become of importance for designing control measures against the epidemic diseases described. For future researches it is proposed the use of algebraic epidemiology to analyze models for airborne and waterborne diseases.
Standard model physics from an algebra?
Furey, C
2016-01-01
This thesis constitutes a first attempt to derive aspects of standard model particle physics from little more than an algebra. Here, we argue that physical concepts such as particles, causality, and irreversible time may result from the algebra acting on itself. We then focus on a special case by considering the algebra $\\mathbb{R}\\otimes\\mathbb{C}\\otimes\\mathbb{H}\\otimes\\mathbb{O}$. Using nothing more than $\\mathbb{R}\\otimes\\mathbb{C}\\otimes\\mathbb{H}\\otimes\\mathbb{O}$ acting on itself, we set out to find standard model particle representations. From the complex quaternionic portion of the algebra, we find generalized ideals, and show that they describe concisely all of the Lorentz representations of the standard model. From the complex octonionic portion of the algebra, we find minimal left ideals, and show that they mirror the behaviour of a generation of quarks and leptons under $su(3)_c$ and $u(1)_{em}$. We then demonstrate a rudimentary electroweak model which yields a straightforward explanation as to ...
ADAM: Analysis of Discrete Models of Biological Systems Using Computer Algebra
Hinkelmann, Franziska; Guang, Bonny; McNeill, Rustin; Blekherman, Grigoriy; Veliz-Cuba, Alan; Laubenbacher, Reinhard
2010-01-01
Motivation: Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, bounded Petri nets, and agent-based models. Simulation is a common practice for analyzing discrete models, but many systems are far too large to capture all the relevant dynamical features through simulation alone. Results: We convert discrete models into algebraic models and apply tools from computational algebra to analyze their dynamics. The key feature of biological systems that is exploited by our algorithms is their sparsity: while the number of nodes in a biological network may be quite large, each node is affected only by a small number of other nodes. In our experience with models arising in systems biology and random models, this structure leads to fast computations when using algebraic models, and thus efficient analysis. Availability: All algorithms and methods are available in our package Analysis of Dynamic Algebraic Models (ADAM), a user friendly web-interf...
Tomino, Dan
2010-01-01
1-loop vacuum energies of (fuzzy) spacetimes from a supersymmetric reduced model with Filippov 3-algebra are discussed. A_{2,2} algebra, Nambu-Poisson algebra in flat spacetime, and a Lorentzian 3-algebra are examined as 3-algebras.
Advanced computer algebra algorithms for the expansion of Feynman integrals
Energy Technology Data Exchange (ETDEWEB)
Ablinger, Jakob; Round, Mark; Schneider, Carsten [Johannes Kepler Univ., Linz (Austria). Research Inst. for Symbolic Computation; Bluemlein, Johannes [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany)
2012-10-15
Two-point Feynman parameter integrals, with at most one mass and containing local operator insertions in 4+{epsilon}-dimensional Minkowski space, can be transformed to multi-integrals or multi-sums over hyperexponential and/or hypergeometric functions depending on a discrete parameter n. Given such a specific representation, we utilize an enhanced version of the multivariate Almkvist-Zeilberger algorithm (for multi-integrals) and a common summation framework of the holonomic and difference field approach (for multi-sums) to calculate recurrence relations in n. Finally, solving the recurrence we can decide efficiently if the first coefficients of the Laurent series expansion of a given Feynman integral can be expressed in terms of indefinite nested sums and products; if yes, the all n solution is returned in compact representations, i.e., no algebraic relations exist among the occurring sums and products.
Advanced Computer Algebra Algorithms for the Expansion of Feynman Integrals
Ablinger, J; Round, M; Schneider, C
2012-01-01
Two-point Feynman parameter integrals, with at most one mass and containing local operator insertions in $4+\\ep$-dimensional Minkowski space, can be transformed to multi-integrals or multi-sums over hyperexponential and/or hypergeometric functions depending on a discrete parameter $n$. Given such a specific representation, we utilize an enhanced version of the multivariate Almkvist--Zeilberger algorithm (for multi-integrals) and a common summation framework of the holonomic and difference field approach (for multi-sums) to calculate recurrence relations in $n$. Finally, solving the recurrence we can decide efficiently if the first coefficients of the Laurent series expansion of a given Feynman integral can be expressed in terms of indefinite nested sums and products; if yes, the all $n$ solution is returned in compact representations, i.e., no algebraic relations exist among the occurring sums and products.
A process algebra model of QED
Sulis, William
2016-03-01
The process algebra approach to quantum mechanics posits a finite, discrete, determinate ontology of primitive events which are generated by processes (in the sense of Whitehead). In this ontology, primitive events serve as elements of an emergent space-time and of emergent fundamental particles and fields. Each process generates a set of primitive elements, using only local information, causally propagated as a discrete wave, forming a causal space termed a causal tapestry. Each causal tapestry forms a discrete and finite sampling of an emergent causal manifold (space-time) M and emergent wave function. Interactions between processes are described by a process algebra which possesses 8 commutative operations (sums and products) together with a non-commutative concatenation operator (transitions). The process algebra possesses a representation via nondeterministic combinatorial games. The process algebra connects to quantum mechanics through the set valued process and configuration space covering maps, which associate each causal tapestry with sets of wave functions over M. Probabilities emerge from interactions between processes. The process algebra model has been shown to reproduce many features of the theory of non-relativistic scalar particles to a high degree of accuracy, without paradox or divergences. This paper extends the approach to a semi-classical form of quantum electrodynamics.
Sigma-models and Homotopy Algebras
Zeitlin, Anton M
2015-01-01
We review the relation between homotopy algebras of conformal field theory and geometric structures arising in sigma models. In particular we formulate conformal invariance conditions, which in the quasi-classical limit are Einstein equations with extra fields, as generalized Maurer-Cartan equations.
An algebraic approach to the Hubbard model
de Leeuw, Marius
2015-01-01
We study the algebraic structure of an integrable Hubbard-Shastry type lattice model associated with the centrally extended su(2|2) superalgebra. This superalgebra underlies Beisert's AdS/CFT worldsheet R-matrix and Shastry's R-matrix. The considered model specializes to the one-dimensional Hubbard model in a certain limit. We demonstrate that Yangian symmetries of the R-matrix specialize to the Yangian symmetry of the Hubbard model found by Korepin and Uglov. Moreover, we show that the Hubbard model Hamiltonian has an algebraic interpretation as the so-called secret symmetry. We also discuss Yangian symmetries of the A and B models introduced by Frolov and Quinn.
Cox, David A; O'Shea, Donal
2015-01-01
This text covers topics in algebraic geometry and commutative algebra with a strong perspective toward practical and computational aspects. The first four chapters form the core of the book. A comprehensive chart in the preface illustrates a variety of ways to proceed with the material once these chapters are covered. In addition to the fundamentals of algebraic geometry—the elimination theorem, the extension theorem, the closure theorem, and the Nullstellensatz—this new edition incorporates several substantial changes, all of which are listed in the Preface. The largest revision incorporates a new chapter (ten), which presents some of the essentials of progress made over the last decades in computing Gröbner bases. The book also includes current computer algebra material in Appendix C and updated independent projects (Appendix D). The book may serve as a first or second course in undergraduate abstract algebra and, with some supplementation perhaps, for beginning graduate level courses in algebraic geom...
AR quivers,exceptional sequences and algorithms in derived Hall algebras
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
Consider the canonical isomorphism between the positive part U+ of the quantum group Uq(g) and the Hall algebra H(Λ),where the semisimple Lie algebra g and the finite-dimensional hereditary algebra Λ share a Dynkin diagram.Chen and Xiao have given two algorithms to decompose the root vectors into linear combinations of monomials of Chevalley generators of U+,respectively induced by the braid group action on the exceptional sequences of Λ-modules and the structure of the Auslander-Reiten quiver of Λ.In this paper,we obtain the corresponding algorithms for the derived Hall algebra DH(Λ),which was introduced by Toen.We show that both algorithms are applicable to the lattice algebra and Heisenberg double in the sense of Kapranov.All the new recursive formulae have the same flavor with the quantum Serre relations.
Design and Implementation of Numerical Linear Algebra Algorithms on Fixed Point DSPs
Nikolić, Zoran; Nguyen, Ha Thai; Frantz, Gene
2007-12-01
Numerical linear algebra algorithms use the inherent elegance of matrix formulations and are usually implemented using C/C++ floating point representation. The system implementation is faced with practical constraints because these algorithms usually need to run in real time on fixed point digital signal processors (DSPs) to reduce total hardware costs. Converting the simulation model to fixed point arithmetic and then porting it to a target DSP device is a difficult and time-consuming process. In this paper, we analyze the conversion process. We transformed selected linear algebra algorithms from floating point to fixed point arithmetic, and compared real-time requirements and performance between the fixed point DSP and floating point DSP algorithm implementations. We also introduce an advanced code optimization and an implementation by DSP-specific, fixed point C code generation. By using the techniques described in the paper, speed can be increased by a factor of up to 10 compared to floating point emulation on fixed point hardware.
Design and Implementation of Numerical Linear Algebra Algorithms on Fixed Point DSPs
Directory of Open Access Journals (Sweden)
Gene Frantz
2007-01-01
Full Text Available Numerical linear algebra algorithms use the inherent elegance of matrix formulations and are usually implemented using C/C++ floating point representation. The system implementation is faced with practical constraints because these algorithms usually need to run in real time on fixed point digital signal processors (DSPs to reduce total hardware costs. Converting the simulation model to fixed point arithmetic and then porting it to a target DSP device is a difficult and time-consuming process. In this paper, we analyze the conversion process. We transformed selected linear algebra algorithms from floating point to fixed point arithmetic, and compared real-time requirements and performance between the fixed point DSP and floating point DSP algorithm implementations. We also introduce an advanced code optimization and an implementation by DSP-specific, fixed point C code generation. By using the techniques described in the paper, speed can be increased by a factor of up to 10 compared to floating point emulation on fixed point hardware.
Map algebra and model algebra for integrated model building
Schmitz, O.; Karssenberg, D.J.; Jong, K. de; Kok, J.-L. de; Jong, S.M. de
2013-01-01
Computer models are important tools for the assessment of environmental systems. A seamless workflow of construction and coupling of model components is essential for environmental scientists. However, currently available software packages are often tailored either to the construction of model compo
Tabak, John
2004-01-01
Looking closely at algebra, its historical development, and its many useful applications, Algebra examines in detail the question of why this type of math is so important that it arose in different cultures at different times. The book also discusses the relationship between algebra and geometry, shows the progress of thought throughout the centuries, and offers biographical data on the key figures. Concise and comprehensive text accompanied by many illustrations presents the ideas and historical development of algebra, showcasing the relevance and evolution of this branch of mathematics.
Institute of Scientific and Technical Information of China (English)
无
2004-01-01
Through most of Greek history, mathematicians concentrated on geometry, although Euclid considered the theory of numbers. The Greek mathematician Diophantus (3rd century),however, presented problems that had to be solved by what we would today call algebra. His book is thus the first algebra text.
Operator algebra of orbifold models
Energy Technology Data Exchange (ETDEWEB)
Dijkgraaf, R.; Vafa, C.; Verlinde, E.; Verlinde, H.
1989-07-01
We analyze the chiral properties of (orbifold) conformal field theories which are obtained from a given conformal field theory by modding out by a finite symmetry group. For a class of orbifolds, we derive the fusion rules by studying the modular transformation properties of the one-loop characters. The results are illustrated with explicit calculations of toroidal and c=1 models.
Algebraic model of baryon resonances
Bijker, R
1997-01-01
We discuss recent calculations of electromagnetic form factors and strong decay widths of nucleon and delta resonances. The calculations are done in a collective constituent model of the nucleon, in which the baryons are interpreted as rotations and vibrations of an oblate top.
Algebraic model of baryon structure
Bijker, R
2000-01-01
We discuss properties of baryon resonances belonging to the Nucleon, Delta, Sigma, Lambda, Xi and Omega families in a collective string-like model for the nucleon, in which the radial excitations are interpreted as rotations and vibrations of the string configuration. We find good overall agreement with the available data. The main discrepancies are found for low lying S-wave states, in particular N(1535), N(1650), Sigma(1750), Lambda*(1405), Lambda(1670) and Lambda(1800).
The impact of hierarchical memory systems on linear algebra algorithm design
Energy Technology Data Exchange (ETDEWEB)
Gallivan, K.; Jalby, W.; Meier, U.; Sameh, A.
1987-09-14
Performing an extremely detailed performance optimization analysis is counterproductive when the concern is performance behavior on a class of architecture, since general trends are obscured by the overwhelming number of machine-specific considerations required. Instead, in this paper, a methodology is used which identifies the effects of a hierarchical memory system on the performance of linear algebra algorithms on multivector processors; provides a means of producing a set of algorithm parameters, i.e., blocksizes, as functions of system parameters which yield near-optimal performance; and provides guidelines for algorithm designers which reduce the influence of the hierarchical memory system on algorithm performance to negligible levels and thereby allow them to concentrate on machine-specific optimizations. The remainder of this paper comprises five major discussions. First, the methodology and the attendant architectural model are discussed. Next, an analysis of the basic BLAS3 matrix-matrix primitive is presented. This is followed by a discussion of three block algorithms: a block LU decomposition, a block LDL/sup T/ decomposition and a block Gram-Schmidt algorithm. 22 refs., 9 figs.
Norén, Patrik
2013-01-01
Algebraic statistics brings together ideas from algebraic geometry, commutative algebra, and combinatorics to address problems in statistics and its applications. Computer algebra provides powerful tools for the study of algorithms and software. However, these tools are rarely prepared to address statistical challenges and therefore new algebraic results need often be developed. This way of interplay between algebra and statistics fertilizes both disciplines. Algebraic statistics is a relativ...
Flanders, Harley
1975-01-01
Algebra presents the essentials of algebra with some applications. The emphasis is on practical skills, problem solving, and computational techniques. Topics covered range from equations and inequalities to functions and graphs, polynomial and rational functions, and exponentials and logarithms. Trigonometric functions and complex numbers are also considered, together with exponentials and logarithms.Comprised of eight chapters, this book begins with a discussion on the fundamentals of algebra, each topic explained, illustrated, and accompanied by an ample set of exercises. The proper use of a
Kimura, Yusuke
2015-07-01
It has been understood that correlation functions of multi-trace operators in SYM can be neatly computed using the group algebra of symmetric groups or walled Brauer algebras. On the other hand, such algebras have been known to construct 2D topological field theories (TFTs). After reviewing the construction of 2D TFTs based on symmetric groups, we construct 2D TFTs based on walled Brauer algebras. In the construction, the introduction of a dual basis manifests a similarity between the two theories. We next construct a class of 2D field theories whose physical operators have the same symmetry as multi-trace operators constructed from some matrices. Such field theories correspond to non-commutative Frobenius algebras. A matrix structure arises as a consequence of the noncommutativity. Correlation functions of the Gaussian complex multi-matrix models can be translated into correlation functions of the two-dimensional field theories.
Kimura, Yusuke
2014-01-01
It has been understood that correlation functions of multi-trace operators in N=4 SYM can be neatly computed using the group algebra of symmetric groups or walled Brauer algebras. On the other hand such algebras have been known to construct 2D topological field theories (TFTs). After reviewing the construction of 2D TFTs based on symmetric groups, we construct 2D TFTs based on walled Brauer algebras. In the construction, the introduction of a dual basis manifests a similarity between the two theories. We next construct a class of 2D field theories whose physical operators have the same symmetry as multi-trace operators constructed from some matrices. Such field theories correspond to non-commutative Frobenius algebras. A matrix structure arises as a consequence of the noncommutativity. Correlation functions of the Gaussian complex multi-matrix models can be translated into correlation functions of the two-dimensional field theories.
Inverse-free Berlekamp-Massey-Sakata Algorithm and Small Decoders for Algebraic-Geometric Codes
Matsui, Hajime
2007-01-01
This paper proposes a novel algorithm for finding error-locators of algebraic-geometric codes that can eliminate the division-calculations of finite fields from the Berlekamp-Massey-Sakata algorithm. This inverse-free algorithm provides full performance in correcting a certain class of errors, generic errors, which includes most errors, and can decode codes on algebraic curves without the determination of unknown syndromes. Moreover, we propose three different kinds of architectures that our algorithm can be applied to, and we represent the control operation of shift-registers and switches at each clock-timing with numerical simulations. We estimate the performance in comparison of the total running time and the numbers of multipliers and shift-registers in three architectures with those of the conventional ones for codes on algebraic curves.
The geometry of supersymmetric coset models and superconformal algebras
Papadopoulos, G
1993-01-01
An on-shell formulation of (p,q), 2\\leq p \\leq 4, 0\\leq q\\leq 4, supersymmetric coset models with target space the group G and gauge group a subgroup H of G is given. It is shown that there is a correspondence between the number of supersymmetries of a coset model and the geometry of the coset space G/H. The algebras of currents of supersymmetric coset models are superconformal algebras. In particular, the algebras of currents of (2,2) and (4,0) supersymmetric coset models are related to the N=2 Kazama-Suzuki and N=4 Van Proeyen superconformal algebras correspondingly.
Performance analysis of a decoding algorithm for algebraic-geometry codes
DEFF Research Database (Denmark)
Høholdt, Tom; Jensen, Helge Elbrønd; Nielsen, Rasmus Refslund
1999-01-01
The fast decoding algorithm for one point algebraic-geometry codes of Sakata, Elbrond Jensen, and Hoholdt corrects all error patterns of weight less than half the Feng-Rao minimum distance. In this correspondence we analyze the performance of the algorithm for heavier error patterns. It turns out...
Ghosh, A
1988-08-01
Lanczos and conjugate gradient algorithms are important in computational linear algebra. In this paper, a parallel pipelined realization of these algorithms on a ring of optical linear algebra processors is described. The flow of data is designed to minimize the idle times of the optical multiprocessor and the redundancy of computations. The effects of optical round-off errors on the solutions obtained by the optical Lanczos and conjugate gradient algorithms are analyzed, and it is shown that optical preconditioning can improve the accuracy of these algorithms substantially. Algorithms for optical preconditioning and results of numerical experiments on solving linear systems of equations arising from partial differential equations are discussed. Since the Lanczos algorithm is used mostly with sparse matrices, a folded storage scheme to represent sparse matrices on spatial light modulators is also described.
Application of Symplectic Algebraic Dynamics Algorithm to Circular Restricted Three-Body Problem
Institute of Scientific and Technical Information of China (English)
LU Wei-Tao; ZHANG Hua; WANG Shun-Jin
2008-01-01
Symplectic algebraic dynamics algorithm (SADA) for ordinary differential equations is applied to solve numerically the circular restricted three-body problem (CR3BP) in dynamical astronomy for both stable motion and chaotic motion. The result is compared with those of Runge-Kutta algorithm and symplectic algorithm under the fourth order, which shows that SADA has higher accuracy than the others in the long-term calculations of the CR3BP.
Dongarra, Jack
2012-11-01
We propose to study the impact on the energy footprint of two advanced algorithmic strategies in the context of high performance dense linear algebra libraries: (1) mixed precision algorithms with iterative refinement allow to run at the peak performance of single precision floating-point arithmetic while achieving double precision accuracy and (2) tree reduction technique exposes more parallelism when factorizing tall and skinny matrices for solving over determined systems of linear equations or calculating the singular value decomposition. Integrated within the PLASMA library using tile algorithms, which will eventually supersede the block algorithms from LAPACK, both strategies further excel in performance in the presence of a dynamic task scheduler while targeting multicore architecture. Energy consumption measurements are reported along with parallel performance numbers on a dual-socket quad-core Intel Xeon as well as a quad-socket quad-core Intel Sandy Bridge chip, both providing component-based energy monitoring at all levels of the system, through the Power Pack framework and the Running Average Power Limit model, respectively. © 2012 IEEE.
Monotonic Property in Field Algebra of G-Spin Model
Institute of Scientific and Technical Information of China (English)
蒋立宁
2003-01-01
Let F be the field algebra of G-spin model, D(G) the double algebra of a finite group G and D(H) the sub-Hopf algerba of D(G) determined by the subgroup H of G. The paper builds a correspondence between D(H) and the D(H)-invariant sub-C*-algebra AH in F, and proves that the correspondence is strictly monotonic.
Models of stochastic gene expression and Weyl algebra
Vidal, Samuel,; Petitot, Michel; Boulier, François; Lemaire, François; Kuttler, Celine
2010-01-01
International audience; This paper presents a symbolic algorithm for computing the ODE systems which describe the evolution of the moments associated to a chemical reaction system, considered from a stochastic point of view. The algorithm, which is formulated in the Weyl algebra, seems more efficient than the corresponding method, based on partial derivatives. In particular, an efficient method for handling conservation laws is presented. The output of the algorithm can be used for a further ...
Preparing Secondary Mathematics Teachers: A Focus on Modeling in Algebra
Jung, Hyunyi; Mintos, Alexia; Newton, Jill
2015-01-01
This study addressed the opportunities to learn (OTL) modeling in algebra provided to secondary mathematics pre-service teachers (PSTs). To investigate these OTL, we interviewed five instructors of required mathematics and mathematics education courses that had the potential to include opportunities for PSTs to learn algebra at three universities.…
Revisit to the THINC scheme: A simple algebraic VOF algorithm
Xiao, Feng; , Satoshi, Ii; Chen, Chungang
2011-08-01
This short note presents an improved multi-dimensional algebraic VOF method to capture moving interfaces. The interface jump in the THINC (tangent of hyperbola for INterface capturing) scheme is adaptively scaled to a proper thickness according to the interface orientation. The numerical accuracy in computing multi-dimensional moving interfaces is significantly improved. Without any geometrical reconstruction, the proposed method is extremely simple and easy to use, and its numerical accuracy is superior to other existing methods of its kind and comparable to the conventional PLIC (piecewise linear interface calculation) type VOF schemes.
Multiprocessing linear algebra algorithms on the CRAY X-MP-2: Experiences with small granularity
Energy Technology Data Exchange (ETDEWEB)
Chen, S.S.; Dongarra, J.J.; Hsiung, C.
1984-08-01
This paper gives a brief overview of the CRAY X-MP-2 general-purpose multiprocessor system and discusses how it can be used effectively to solve problems that have small granularity. An implementation is described for linear algebra algorithms that solve systems of linear equations when the matrix is general and when the matrix is symmetric and positive definite.
L∞-algebra models and higher Chern-Simons theories
Ritter, Patricia; Sämann, Christian
2016-10-01
We continue our study of zero-dimensional field theories in which the fields take values in a strong homotopy Lie algebra. In the first part, we review in detail how higher Chern-Simons theories arise in the AKSZ-formalism. These theories form a universal starting point for the construction of L∞-algebra models. We then show how to describe superconformal field theories and how to perform dimensional reductions in this context. In the second part, we demonstrate that Nambu-Poisson and multisymplectic manifolds are closely related via their Heisenberg algebras. As a byproduct of our discussion, we find central Lie p-algebra extensions of 𝔰𝔬(p + 2). Finally, we study a number of L∞-algebra models which are physically interesting and which exhibit quantized multisymplectic manifolds as vacuum solutions.
Topics in Randomized Algorithms for Numerical Linear Algebra
Holodnak, John T.
In this dissertation, we present results for three topics in randomized algorithms. Each topic is related to random sampling. We begin by studying a randomized algorithm for matrix multiplication that randomly samples outer products. We show that if a set of deterministic conditions is satisfied, then the algorithm can compute the exact product. In addition, we show probabilistic bounds on the two norm relative error of the algorithm. two norm relative error of the algorithm. In the second part, we discuss the sensitivity of leverage scores to perturbations. Leverage scores are scalar quantities that give a notion of importance to the rows of a matrix. They are used as sampling probabilities in many randomized algorithms. We show bounds on the difference between the leverage scores of a matrix and a perturbation of the matrix. In the last part, we approximate functions over an active subspace of parameters. To identify the active subspace, we apply an algorithm that relies on a random sampling scheme. We show bounds on the accuracy of the active subspace identification algorithm and construct an approximation to a function with 3556 parameters using a ten-dimensional active subspace.
Fermi resonance-algebraic model for molecular vibrational spectra
Institute of Scientific and Technical Information of China (English)
侯喜文; 董世海; 谢汨; 马中骐
1999-01-01
A Fermi resonance-algebraic model is proposed for molecular vibrations, where a U(2) algebra is used for describing the vibrations of each bond, and Fermi resonances between stretching and bending modes are taken into account. The model for a bent molecule XY2 and a molecule XY3 is successfully applied to fitting the recently observed vibrational spectrum of the water molecule and arsine (AsH3), respectively, and the results are compared with those of other models. Calculations show that algebraic approaches can be used as an effective method to describe molecular vibrations with small standard deviations.
Action Algebras and Model Algebras in Denotational Semantics
Guedes, Luiz Carlos Castro; Haeusler, Edward Hermann
This article describes some results concerning the conceptual separation of model dependent and language inherent aspects in a denotational semantics of a programming language. Before going into the technical explanation, the authors wish to relate a story that illustrates how correctly and precisely posed questions can influence the direction of research. By means of his questions, Professor Mosses aided the PhD research of one of the authors of this article and taught the other, who at the time was a novice supervisor, the real meaning of careful PhD supervision. The student’s research had been partially developed towards the implementation of programming languages through denotational semantics specification, and the student had developed a prototype [12] that compared relatively well to some industrial compilers of the PASCAL language. During a visit to the BRICS lab in Aarhus, the student’s supervisor gave Professor Mosses a draft of an article describing the prototype and its implementation experiments. The next day, Professor Mosses asked the supervisor, “Why is the generated code so efficient when compared to that generated by an industrial compiler?” and “You claim that the efficiency is simply a consequence of the Object- Orientation mechanisms used by the prototype programming language (C++); this should be better investigated. Pay more attention to the class of programs that might have this good comparison profile.” As a result of these aptly chosen questions and comments, the student and supervisor made great strides in the subsequent research; the advice provided by Professor Mosses made them perceive that the code generated for certain semantic domains was efficient because it mapped to the “right aspect” of the language semantics. (Certain functional types, used to represent mappings such as Stores and Environments, were pushed to the level of the object language (as in gcc). This had the side-effect of generating code for arrays in
Algebra model and security analysis for cryptographic protocols
Institute of Scientific and Technical Information of China (English)
HUAI Jinpeng; LI Xianxian
2004-01-01
More and more cryptographic protocols have been used to achieve various security requirements of distributed systems in the open network environment. However cryptographic protocols are very difficult to design and analyze due to the complexity of the cryptographic protocol execution, and a large number of problems are unsolved that range from the theory framework to the concrete analysis technique. In this paper, we build a new algebra called cryptographic protocol algebra (CPA) for describing the message operations with many cryptographic primitives, and proposed a new algebra model for cryptographic protocols based on the CPA. In the model, expanding processes of the participant's knowledge on the protocol runs are characterized with some algebraic notions such as subalgebra, free generator and polynomial algebra, and attack processes are modeled with a new notion similar to that of the exact sequence used in homological algebra. Then we develope a mathematical approach to the cryptographic protocol security analysis. By using algebraic techniques, we have shown that for those cryptographic protocols with some symmetric properties, the execution space generated by an arbitrary number of participants may boil down to a smaller space generated by several honest participants and attackers. Furthermore we discuss the composability problem of cryptographic protocols and give a sufficient condition under which the protocol composed of two correct cryptographic protocols is still correct, and we finally offer a counterexample to show that the statement may not be true when the condition is not met.
A note on probabilistic models over strings: the linear algebra approach.
Bouchard-Côté, Alexandre
2013-12-01
Probabilistic models over strings have played a key role in developing methods that take into consideration indels as phylogenetically informative events. There is an extensive literature on using automata and transducers on phylogenies to do inference on these probabilistic models, in which an important theoretical question is the complexity of computing the normalization of a class of string-valued graphical models. This question has been investigated using tools from combinatorics, dynamic programming, and graph theory, and has practical applications in Bayesian phylogenetics. In this work, we revisit this theoretical question from a different point of view, based on linear algebra. The main contribution is a set of results based on this linear algebra view that facilitate the analysis and design of inference algorithms on string-valued graphical models. As an illustration, we use this method to give a new elementary proof of a known result on the complexity of inference on the "TKF91" model, a well-known probabilistic model over strings. Compared to previous work, our proving method is easier to extend to other models, since it relies on a novel weak condition, triangular transducers, which is easy to establish in practice. The linear algebra view provides a concise way of describing transducer algorithms and their compositions, opens the possibility of transferring fast linear algebra libraries (for example, based on GPUs), as well as low rank matrix approximation methods, to string-valued inference problems.
Dynamical Algebraic Approach to the Modified Jaynes－Cummings Model
Institute of Scientific and Technical Information of China (English)
许晶波; 邹旭波
2001-01-01
The modified Jaynes-Cummings model of a single two-level atom placed in the common domain of two cavities or interacting with two quantized modes is studied by a dynamical algebraic method. With the help of an SU(2) algebraic structure, we then obtain the eigenvalues, eigenstates, time evolution operator and atomic inversion operator for the system. We proceed to investigate the modified Jaynes-Cummings model governed by the Milburn equation and present the exact solution of the Milburn equation.
The development of an algebraic multigrid algorithm for symmetric positive definite linear systems
Energy Technology Data Exchange (ETDEWEB)
Vanek, P.; Mandel, J.; Brezina, M. [Univ. of Colorado, Denver, CO (United States)
1996-12-31
An algebraic multigrid algorithm for symmetric, positive definite linear systems is developed based on the concept of prolongation by smoothed aggregation. Coarse levels are generated automatically. We present a set of requirements motivated heuristically by a convergence theory. The algorithm then attempts to satisfy the requirements. Input to the method are the coefficient matrix and zero energy modes, which are determined from nodal coordinates and knowledge of the differential equation. Efficiency of the resulting algorithm is demonstrated by computational results on real world problems from solid elasticity, plate blending, and shells.
Pavelle, Richard; And Others
1981-01-01
Describes the nature and use of computer algebra and its applications to various physical sciences. Includes diagrams illustrating, among others, a computer algebra system and flow chart of operation of the Euclidean algorithm. (SK)
Algebraic Modeling of Information Retrieval in XML Documents
Georgiev, Bozhidar; Georgieva, Adriana
2009-11-01
This paper presents an information retrieval approach in XML documents using tools, based on the linear algebra. The well-known transformation languages as XSLT (XPath) are grounded on the features of higher-order logic for manipulating hierarchical trees. The presented conception is compared to existing higher-order logic formalisms, where the queries are realized by both languages XSLT and XPath. The possibilities of the proposed linear algebraic model combined with hierarchy data models permit more efficient solutions for searching, extracting and manipulating semi-structured data with hierarchical structures avoiding the global navigation over the XML tree components. The main purpose of this algebraic model representation, applied to the hierarchical relationships in the XML data structures, is to make the implementation of linear algebra tools possible for XML data manipulations and to eliminate existing problems, related to regular grammars theory and also to avoid the difficulties, connected with higher -order logic (first-order logic, monadic second- order logic etc.).
Super Gelfand-Dickey Algebra And Integrable Models
Boukili, A El; Zemate, A
2007-01-01
The main task of this work concerns integrable models and supersymmetric extensions of the Gelfand-Dickey algebra of pseudo differential operators. The consistent and systematic study that we perform consists in describing in detail the relation existing between the algebra of (local and nonlocal) super differential operators on the ring of superfields $u_{\\frac{s}{2}}(z, \\theta), s\\in Z$ and the higher and lower spin extensions of the conformal algebra. In relation to integrable systems, the supersymmetric GD bracket play a pioneering role as it gives in some sense a guarantee of integrability of the associated non linear supersymmetric systems.
Quasi hope algebras, group cohomology and orbifold models
Dijkgraaf, R.; Pasquier, V.; Roche, P.
1991-01-01
We construct non trivial quasi Hopf algebras associated to any finite group G and any element of H3( G, U(1)). We analyze in details the set of representations of these algebras and show that we recover the main interesting datas attached to particular orbifolds of Rational Conformal Field Theory or equivalently to the topological field theories studied by R. Dijkgraaf and E. Witten. This leads us to the construction of the R-matrix structure in non abelian RCFT orbifold models.
Model Checking Processes Specified In Join-Calculus Algebra
Directory of Open Access Journals (Sweden)
Sławomir Piotr Maludziński
2014-01-01
Full Text Available This article presents a model checking tool used to verify concurrent systems specified in join-calculus algebra. The temporal properties of systems under verification are expressed in CTL logic. Join-calculus algebra with its operational semantics defined by the chemical abstract machine serves as the basic method for the specification of concurrent systems and their synchronization mechanisms, and allows the examination of more complex systems.
Implementing linear algebra algorithms for dense matrices on a vector pipeline machine
Energy Technology Data Exchange (ETDEWEB)
Dongarra, J.J.; Gustavson, F.G.; Karp, A.
1984-01-01
The authors examine common implementations of linear algebra algorithms, such as matrix-vector multiplication, matrix-matrix multiplication and the solution of linear equations. The different versions are examined for efficiency on a computer architecture which uses vector processing and has pipelined instruction execution. By using the advanced architectural features of such machines, one can usually achieve maximum performance, and tremendous improvements in terms of execution speed can be seen over conventional computers. 17 references.
Boundary algebras and Kac modules for logarithmic minimal models
Morin-Duchesne, Alexi; Ridout, David
2015-01-01
Virasoro Kac modules were initially introduced indirectly as representations whose characters arise in the continuum scaling limits of certain transfer matrices in logarithmic minimal models, described using Temperley-Lieb algebras. The lattice transfer operators include seams on the boundary that use Wenzl-Jones projectors. If the projectors are singular, the original prescription is to select a subspace of the Temperley-Lieb modules on which the action of the transfer operators is non-singular. However, this prescription does not, in general, yield representations of the Temperley-Lieb algebras and the Virasoro Kac modules have remained largely unidentified. Here, we introduce the appropriate algebraic framework for the lattice analysis as a quotient of the one-boundary Temperley-Lieb algebra. The corresponding standard modules are introduced and examined using invariant bilinear forms and their Gram determinants. The structures of the Virasoro Kac modules are inferred from these results and are found to be...
Novel parallel architectures and algorithms for linear algebra processing. Semiannual report
Energy Technology Data Exchange (ETDEWEB)
Casasent, D.
1986-10-01
Advanced problems in computational fluid dynamics, finite element structural analysis, and related areas require the solution of large partial differential equations and matrices of large size and dynamic range. This project considers an advanced parallel linear algebra processor and associated novel parallel algorithms for such applications. Research on system fabrication, quantitative performance evaluation and new parallel algorithms are described and considered. Case studies in structural mechanics, dynamics and nonlinear systems, finite element methods, computational fluid dynamics, and partial differential equations are included. The novel utilization of an optical processor for the processing of such problems is the major research given attention.
Algebraic model of an oblate top
Bijker, R
1996-01-01
We consider an algebraic treatment of a three-body system. In particular, we develop the formalism for a system of three identical objects and discuss an application to nonstrange baryon resonances which are interpreted as vibrational and rotational excitations of an oblate symmetric top. We derive closed expressions for a set of elementary form factors that appear in the calculation of both electromagnetic, strong and weak couplings of baryons.
A comparison between algebraic models of molecular spectroscopy
Bijker, R; Lemus, R; Arias, J M; Pérez-Bernal, F
1998-01-01
We discuss a symmetry-adapted algebraic (or vibron) model for molecular spectroscopy. The model is formulated in terms of tensor operators under the molecular point group. In this way, we have identified interactions that are absent in previous versions of the vibron model, in which the Hamiltonian is expressed in terms of Casimir operators and their products. The inclusion of these new interactions leads to reliable spectroscopic predictions. As an example we study the vibrational excitations of the methane molecule, and compare our results with those obtained in other algebraic models.
Affine bracket algebra theory and algorithms and their applications in mechanical theorem proving
Institute of Scientific and Technical Information of China (English)
2007-01-01
This paper discusses two problems:one is some important theories and algorithms of affine bracket algebra;the other is about their applications in mechanical theorem proving.First we give some efficient algorithms including the boundary expanding algorithm which is a key feature in application.We analyze the characteristics of the boundary operator and this is the base for the implementation of the system.We also give some new theories or methods about the exact division,the representations and structure of affine geometry and so on.In practice,we implement the mechanical auto-proving system in Maple 10 based on the above algorithms and theories.Also we test about more than 100 examples and compare the results with the methods before.
Affine bracket algebra theory and algorithms and their applications in mechanical theorem proving
Institute of Scientific and Technical Information of China (English)
Ning ZHANG; Hong-bo LI
2007-01-01
This paper discusses two problems: one is some important theories and algorithms of affine bracket algebra; the other is about their applications in mechanical theorem proving. First we give some efficient algorithms including the boundary expanding algorithm which is a key feature in application. We analyze the characteristics of the boundary operator and this is the base for the implementation of the system. We also give some new theories or methods about the exact division, the representations and structure of affine geometry and so on. In practice, we implement the mechanical auto-proving system in Maple 10 based on the above algorithms and theories. Also we test about more than 100 examples and compare the results with the methods before.
Calculus and design of discrete velocity models using computer algebra
Babovsky, Hans; Grabmeier, Johannes
2016-11-01
In [2, 3], a framework for a calculus with Discrete Velocity Models (DVM) has been derived. The rotatonal symmetry of the discrete velocities can be modelled algebraically by the action of the cyclic group C4 - or including reflections of the dihedral group D4. Taking this point of view, the linearized collision operator can be represented in a compact form as a matrix of elements in the group algebra. Or in other words, by choosing a special numbering it exhibits a certain block structure which lets it appear as a matrix with entries in a certain polynomial ring. A convenient way for approaching such a structure is the use of a computer algebra system able to treat these (predefined) algebraic structures. We used the computer algebra system FriCAS/AXIOM [4, 5] for the generation of the velocity and the collision sets and for the analysis of the structure of the collision operator. Concerning the fluid dynamic limit, the system provides the characterization of sets of collisions and their contribution to the flow parameters. It allows the design of rotationally invariant symmetric models for prescribed Prandtl numbers. The implementation in FriCAS/AXIOM is explained and its results for a 25-velocity model are presented.
Hopf Bifurcation of a Differential-Algebraic Bioeconomic Model with Time Delay
Directory of Open Access Journals (Sweden)
Xiaojian Zhou
2012-01-01
Full Text Available We investigate the dynamics of a differential-algebraic bioeconomic model with two time delays. Regarding time delay as a bifurcation parameter, we show that a sequence of Hopf bifurcations occur at the positive equilibrium as the delay increases. Using the theories of normal form and center manifold, we also give the explicit algorithm for determining the direction of the Hopf bifurcations and the stability of the bifurcating periodic solutions. Numerical tests are provided to verify our theoretical analysis.
The $BC_{1}$ Elliptic model: algebraic forms, hidden algebra $sl(2)$, polynomial eigenfunctions
Turbiner, Alexander V
2014-01-01
The potential of the $BC_1$ elliptic model is a superposition of two Weierstrass functions with doubling of both periods (two coupling constants), the model degenerates to $A_1$ elliptic model characterized by the Lame Hamiltonian. It is shown that in space of $BC_1$ elliptic invariant the potential becomes a rational function while the flat space metric is polynomial. The model possesses the hidden $sl_2$ algebra for arbitrary coupling constants: it is equivalent to $sl_2$-quantum top in three different magnetic fields. It is shown that there exist three one-parametric families of coupling constants for which a finite number of polynomial eigenfunctions (up to a factor) occur.
An Algebraic Solution for the Kermack-McKendrick Model
Carvalho, Alexsandro M
2016-01-01
We present an algebraic solution for the Susceptible-Infective-Removed (SIR) model originally presented by Kermack-McKendrick in 1927. Starting from the differential equation for the removed subjects presented by them in the original paper, we re-write it in a slightly different form in order to derive formally the solution, unless one integration. Then, using algebraic techniques and some well justified numerical assumptions we obtain an analytic solution for the integral. Finally, we compare the numerical solution of the differential equations of the SIR model with the analytically solution here proposed, showing an excellent agreement.
Laser modeling a numerical approach with algebra and calculus
Csele, Mark Steven
2014-01-01
Offering a fresh take on laser engineering, Laser Modeling: A Numerical Approach with Algebra and Calculus presents algebraic models and traditional calculus-based methods in tandem to make concepts easier to digest and apply in the real world. Each technique is introduced alongside a practical, solved example based on a commercial laser. Assuming some knowledge of the nature of light, emission of radiation, and basic atomic physics, the text:Explains how to formulate an accurate gain threshold equation as well as determine small-signal gainDiscusses gain saturation and introduces a novel pass
Algebraic models of hadron structure I. Nonstrange baryons
Bijker, R; Leviatan, A
1994-01-01
We introduce an algebraic framework for the description of baryons. Within this framework we study a collective string-like model and show that this model gives a good overall description of the presently available data. We discuss in particular masses and electromagnetic couplings, including the transition form factors that can be measured at new electron facilities.
Algebraic models of hadron structure. I. Nonstrange baryons
Energy Technology Data Exchange (ETDEWEB)
Bijker, R. [Univ. of Utrecht (Netherlands); Iachello, F. [Yale Univ., New Haven, CT (United States); Leviatan, A. [Hebrew Univ., Jerusalem (Israel)
1994-11-15
The authors introduce an algebraic framework for the description of baryons. Within this framework they study a collective string-like model and show that this model gives a good overall description of the presently available data. They discuss in particular masses and electromagnetic couplings, including the transition form factors that can be measured at new electron facilities. 44 refs., 15 figs., 11 tabs.
Inverse Modelling Problems in Linear Algebra Undergraduate Courses
Martinez-Luaces, Victor E.
2013-01-01
This paper will offer an analysis from a theoretical point of view of mathematical modelling, applications and inverse problems of both causation and specification types. Inverse modelling problems give the opportunity to establish connections between theory and practice and to show this fact, a simple linear algebra example in two different…
Optical linear algebra processors - Noise and error-source modeling
Casasent, D.; Ghosh, A.
1985-01-01
The modeling of system and component noise and error sources in optical linear algebra processors (OLAPs) are considered, with attention to the frequency-multiplexed OLAP. General expressions are obtained for the output produced as a function of various component errors and noise. A digital simulator for this model is discussed.
Optical linear algebra processors: noise and error-source modeling.
Casasent, D; Ghosh, A
1985-06-01
The modeling of system and component noise and error sources in optical linear algebra processors (OLAP's) are considered, with attention to the frequency-multiplexed OLAP. General expressions are obtained for the output produced as a function of various component errors and noise. A digital simulator for this model is discussed.
The Effects of the Content Enhancement Model in College Algebra
VanCleave, Janet Milleret
2010-01-01
The purpose of this study was to investigate The Content Enhancement Model in the field of college algebra in a mid-western community college. The Content Enhancement Model is a teaching technique that teachers use to help students acquire the content information by helping them identify, organize, comprehend, and memorize material. This study…
An algebraic approach to modeling in software engineering
Energy Technology Data Exchange (ETDEWEB)
Loegel, G.J. [Superconducting Super Collider Lab., Dallas, TX (United States)]|[Michigan Univ., Ann Arbor, MI (United States); Ravishankar, C.V. [Michigan Univ., Ann Arbor, MI (United States)
1993-09-01
Our work couples the formalism of universal algebras with the engineering techniques of mathematical modeling to develop a new approach to the software engineering process. Our purpose in using this combination is twofold. First, abstract data types and their specification using universal algebras can be considered a common point between the practical requirements of software engineering and the formal specification of software systems. Second, mathematical modeling principles provide us with a means for effectively analyzing real-world systems. We first use modeling techniques to analyze a system and then represent the analysis using universal algebras. The rest of the software engineering process exploits properties of universal algebras that preserve the structure of our original model. This paper describes our software engineering process and our experience using it on both research and commercial systems. We need a new approach because current software engineering practices often deliver software that is difficult to develop and maintain. Formal software engineering approaches use universal algebras to describe ``computer science`` objects like abstract data types, but in practice software errors are often caused because ``real-world`` objects are improperly modeled. There is a large semantic gap between the customer`s objects and abstract data types. In contrast, mathematical modeling uses engineering techniques to construct valid models for real-world systems, but these models are often implemented in an ad hoc manner. A combination of the best features of both approaches would enable software engineering to formally specify and develop software systems that better model real systems. Software engineering, like mathematical modeling, should concern itself first and foremost with understanding a real system and its behavior under given circumstances, and then with expressing this knowledge in an executable form.
2014-01-01
Background A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. Results This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. Conclusions The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate
Sandryhaila, Aliaksei; Pueschel, Markus
2010-01-01
A polynomial transform is the multiplication of an input vector $x\\in\\C^n$ by a matrix $\\PT_{b,\\alpha}\\in\\C^{n\\times n},$ whose $(k,\\ell)$-th element is defined as $p_\\ell(\\alpha_k)$ for polynomials $p_\\ell(x)\\in\\C[x]$ from a list $b=\\{p_0(x),\\dots,p_{n-1}(x)\\}$ and sample points $\\alpha_k\\in\\C$ from a list $\\alpha=\\{\\alpha_0,\\dots,\\alpha_{n-1}\\}$. Such transforms find applications in the areas of signal processing, data compression, and function interpolation. Important examples include the discrete Fourier and cosine transforms. In this paper we introduce a novel technique to derive fast algorithms for polynomial transforms. The technique uses the relationship between polynomial transforms and the representation theory of polynomial algebras. Specifically, we derive algorithms by decomposing the regular modules of these algebras as a stepwise induction. As an application, we derive novel $O(n\\log{n})$ general-radix algorithms for the discrete Fourier transform and the discrete cosine transform of type 4.
DEFF Research Database (Denmark)
Zimmermann, Ralf
2017-01-01
We derive a numerical algorithm for evaluating the Riemannian logarithm on the Stiefel manifold with respect to the canonical metric. In contrast to the optimization-based approach known from the literature, we work from a purely matrix-algebraic perspective. Moreover, we prove that the algorithm...... converges locally and exhibits a linear rate of convergence....
Fully Analyzing an Algebraic Polya Urn Model
Morcrette, Basile
2012-01-01
This paper introduces and analyzes a particular class of Polya urns: balls are of two colors, can only be added (the urns are said to be additive) and at every step the same constant number of balls is added, thus only the color compositions varies (the urns are said to be balanced). These properties make this class of urns ideally suited for analysis from an "analytic combinatorics" point-of-view, following in the footsteps of Flajolet-Dumas-Puyhaubert, 2006. Through an algebraic generating function to which we apply a multiple coalescing saddle-point method, we are able to give precise asymptotic results for the probability distribution of the composition of the urn, as well as local limit law and large deviation bounds.
Quasi Hopf algebras, group cohomology and orbifold models
Energy Technology Data Exchange (ETDEWEB)
Dijkgraaf, R. (Princeton Univ., NJ (USA). Joseph Henry Labs.); Pasquier, V. (CEA Centre d' Etudes Nucleaires de Saclay, 91 - Gif-sur-Yvette (France). Inst. de Recherche Fondamentale (IRF)); Roche, P. (Ecole Polytechnique, 91 - Palaiseau (France). Centre de Physique Theorique)
1991-01-01
We construct non trivial quasi Hopf algebras associated to any finite group G and any element of H{sup 3}(G,U)(1). We analyze in details the set of representations of these algebras and show that we recover the main interesting datas attached to particular orbifolds of Rational Conformal Field Theory or equivalently to the topological field theories studied by R. Dijkgraaf and E. Witten. This leads us to the construction of the R-matrix structure in non abelian RCFT orbifold models. (orig.).
Algebraic approach to small-world network models
Rudolph-Lilith, Michelle; Muller, Lyle E.
2014-01-01
We introduce an analytic model for directed Watts-Strogatz small-world graphs and deduce an algebraic expression of its defining adjacency matrix. The latter is then used to calculate the small-world digraph's asymmetry index and clustering coefficient in an analytically exact fashion, valid nonasymptotically for all graph sizes. The proposed approach is general and can be applied to all algebraically well-defined graph-theoretical measures, thus allowing for an analytical investigation of finite-size small-world graphs.
Indian Academy of Sciences (India)
Wen Debao; Liu Sanzhi
2010-08-01
For the limitation of the conventional multiplicative algebraic reconstruction technique (MART), a constrained MART (CMART) is proposed in this paper. In the new tomographic algorithm, a popular two-dimensional multi-point finite difference approximation of the second order Laplacian operator is used to smooth the electron density field. The feasibility and superiority of the new method are demonstrated by using the numerical simulation experiment. Finally, the CMART is used to reconstruct the regional electron density field by using the actual GNSS data under geomagnetic quiet and disturbed days. The available ionosonde data from Beijing station further validates the superiority of the new method.
Wen, Debao; Liu, Sanzhi
2010-08-01
For the limitation of the conventional multiplicative algebraic reconstruction technique (MART), a constrained MART (CMART) is proposed in this paper. In the new tomographic algorithm, a popular two-dimensional multi-point finite difference approximation of the second order Laplacian operator is used to smooth the electron density field. The feasibility and superiority of the new method are demonstrated by using the numerical simulation experiment. Finally, the CMART is used to reconstruct the regional electron density field by using the actual GNSS data under geomagnetic quiet and disturbed days. The available ionosonde data from Beijing station further validates the superiority of the new method.
ADAM: Analysis of Discrete Models of Biological Systems Using Computer Algebra
Directory of Open Access Journals (Sweden)
Blekherman Grigoriy
2011-07-01
Full Text Available Abstract Background Many biological systems are modeled qualitatively with discrete models, such as probabilistic Boolean networks, logical models, Petri nets, and agent-based models, to gain a better understanding of them. The computational complexity to analyze the complete dynamics of these models grows exponentially in the number of variables, which impedes working with complex models. There exist software tools to analyze discrete models, but they either lack the algorithmic functionality to analyze complex models deterministically or they are inaccessible to many users as they require understanding the underlying algorithm and implementation, do not have a graphical user interface, or are hard to install. Efficient analysis methods that are accessible to modelers and easy to use are needed. Results We propose a method for efficiently identifying attractors and introduce the web-based tool Analysis of Dynamic Algebraic Models (ADAM, which provides this and other analysis methods for discrete models. ADAM converts several discrete model types automatically into polynomial dynamical systems and analyzes their dynamics using tools from computer algebra. Specifically, we propose a method to identify attractors of a discrete model that is equivalent to solving a system of polynomial equations, a long-studied problem in computer algebra. Based on extensive experimentation with both discrete models arising in systems biology and randomly generated networks, we found that the algebraic algorithms presented in this manuscript are fast for systems with the structure maintained by most biological systems, namely sparseness and robustness. For a large set of published complex discrete models, ADAM identified the attractors in less than one second. Conclusions Discrete modeling techniques are a useful tool for analyzing complex biological systems and there is a need in the biological community for accessible efficient analysis tools. ADAM provides
Non-algebraic oscillations for predator-prey models
Ferragut, Antoni
2014-01-01
The authors are partially supported by grants MTM2008-03437 and 2009SGR-410. The first author is additionally partially supported by grants Juan de la Cierva and MTM2009-14163-C02-02. We prove that the limit cycle oscillations of the celebrated Rosenzweig-MacArthur differential system and other predator-prey models are non-algebraic.
Continual Lie algebras and noncommutative counterparts of exactly solvable models
Zuevsky, A.
2004-01-01
Noncommutative counterparts of exactly solvable models are introduced on the basis of a generalization of Saveliev-Vershik continual Lie algebras. Examples of noncommutative Liouville and sin/h-Gordon equations are given. The simplest soliton solution to the noncommutative sine-Gordon equation is found.
Algebraic Models of Hadron Structure; 2, Strange Baryons
Bijker, R; Leviatan, A
2000-01-01
The algebraic treatment of baryons is extended to strange resonances. Within this framework we study a collective string-like model in which the radial excitations are interpreted as rotations and vibrations of the strings. We derive a mass formula and closed expressions for strong and electromagnetic decay widths and use these to analyze the available experimental data.
Form factors in an algebraic model of the nucleon
Bijker, R
1995-01-01
We study the electromagnetic form factors of the nucleon in a collective model of baryons. In an algebraic approach to hadron structure, we derive closed expressions for both elastic and transition form factors, and consequently for the helicity amplitudes that can be measured in electro- and photoproduction.
How algebraic Bethe ansatz works for integrable model
Fadeev, L
1996-01-01
I study the technique of Algebraic Bethe Ansatz for solving integrable models and show how it works in detail on the simplest example of spin 1/2 XXX magnetic chain. Several other models are treated more superficially, only the specific details are given. Several parameters, appearing in these generalizations: spin s, anisotropy parameter \\ga, shift \\om in the alternating chain, allow to include in our treatment most known examples of soliton theory, including relativistic model of Quantum Field Theory.
Ltaief, Hatem
2011-08-31
This paper presents the power profile of two high performance dense linear algebra libraries i.e., LAPACK and PLASMA. The former is based on block algorithms that use the fork-join paradigm to achieve parallel performance. The latter uses fine-grained task parallelism that recasts the computation to operate on submatrices called tiles. In this way tile algorithms are formed. We show results from the power profiling of the most common routines, which permits us to clearly identify the different phases of the computations. This allows us to isolate the bottlenecks in terms of energy efficiency. Our results show that PLASMA surpasses LAPACK not only in terms of performance but also in terms of energy efficiency. © 2011 Springer-Verlag.
2D sigma models and differential Poisson algebras
Arias, Cesar; Boulanger, Nicolas; Sundell, Per; Torres-Gomez, Alexander
2015-08-01
We construct a two-dimensional topological sigma model whose target space is endowed with a Poisson algebra for differential forms. The model consists of an equal number of bosonic and fermionic fields of worldsheet form degrees zero and one. The action is built using exterior products and derivatives, without any reference to a worldsheet metric, and is of the covariant Hamiltonian form. The equations of motion define a universally Cartan integrable system. In addition to gauge symmetries, the model has one rigid nilpotent supersymmetry corresponding to the target space de Rham operator. The rigid and local symmetries of the action, respectively, are equivalent to the Poisson bracket being compatible with the de Rham operator and obeying graded Jacobi identities. We propose that perturbative quantization of the model yields a covariantized differential star product algebra of Kontsevich type. We comment on the resemblance to the topological A model.
2D sigma models and differential Poisson algebras
Arias, Cesar; Sundell, Per; Torres-Gomez, Alexander
2015-01-01
We construct a two-dimensional topological sigma model whose target space is endowed with a Poisson algebra for differential forms. The model consists of an equal number of bosonic and fermionic fields of worldsheet form degrees zero and one. The action is built using exterior products and derivatives, without any reference to any worldsheet metric, and is of the covariant Hamiltonian form. The equations of motion define a universally Cartan integrable system. In addition to gauge symmetries, the model has one rigid nilpotent supersymmetry corresponding to the target space de Rham operator. The rigid and local symmetries of the action, respectively, are equivalent to the Poisson bracket being compatible with the de Rham operator and obeying graded Jacobi identities. We propose that perturbative quantization of the model yields a covariantized differential star product algebra of Kontsevich type. We comment on the resemblance to the topological A model.
Clifford Algebra-Based Voronoi Algorithm%Voronoi生成的Clifford代数实现方法
Institute of Scientific and Technical Information of China (English)
易琳; 袁林旺; 俞肇元; 罗文; 闾国年
2011-01-01
引入具有维度融合、坐标无关等特性的Clifford几何代数,构建不同维度统一Voronoi生成框架及算法流程.定义了可支撑不同维度、不同对象间距离、相交及对偶关系的几何、拓扑运算,基于多重向量设计了可支撑不同维度地理对象的统一存储结构及关系表达机制,实现了基于Clifford代数的多维统一Voronoi生成算法.以中国城市气象数据为例进行了算法验证,并分析了算法复杂度.结果表明,该算法可根据输入数据维度自适应地实现相应维度的Voronoi分析,可为以维度统一为特征的GIS分析算法实现提供借鉴.%Based on the superiority of Clifford algebra in multi-dimensional diffusion and coordinate freeing, the unified multi-dimensional generation framework and the algorithm flow of Voronoi have been constructed. Geometric operations and topological operations are defined, which can calculate the distance, intersection and dual among different dimensions and different types of geometric objects. And the unified storage structure and expression mechanism for different dimensional objects are designed with multivector. Finally,2D & 3D experiments and comparison analysis of complexity and accuracy are given to validate the algorithm. The work proves that the designed algorithm is effective and feasible to multi-dimensional Voronoi analysis,and geometric algebra provides a new math tool to establish multi-dimensional unified spatial analysis algorithms.
An algorithm for identifying symmetric variables in the canonical OR-coincidence algebra system
Institute of Scientific and Technical Information of China (English)
Xiao-hua LI; Ji-zhong SHEN
2014-01-01
To simplify the process for identifying 12 types of symmetric variables in the canonical OR-coincidence (COC) algebra system, we propose a new symmetry detection algorithm based on OR-NXOR expansion. By analyzing the relationships between the coefficient matrices of sub-functions and the order coefficient subset matrices based on OR-NXOR expansion around two arbitrary logical variables, the constraint conditions of the order coefficient subset matrices are revealed for 12 types of symmetric variables. Based on the proposed constraints, the algorithm is realized by judging the order characteristic square value matrices. The proposed method avoids the transformation process from OR-NXOR expansion to AND-OR-NOT expansion, or to AND-XOR expansion, and solves the problem of completeness in the dj-map method. The application results show that, compared with traditional methods, the new algorithm is an optimal detection method in terms of applicability of the number of logical variables, detection type, and complexity of the identification process. The algorithm has been implemented in C language and tested on MCNC91 benchmarks. Experimental results show that the proposed algorithm is convenient and efficient.
Cognitive load and modelling of an algebra problem
Chinnappan, Mohan
2010-09-01
In the present study, I examine a modelling strategy as employed by a teacher in the context of an algebra lesson. The actions of this teacher suggest that a modelling approach will have a greater impact on enriching student learning if we do not lose sight of the need to manage associated cognitive loads that could either aid or hinder the integration of core concepts with processes that are at play. Results here also show that modelling a problem that is set within an authentic context helps learners develop a better appreciation of variables and relations that constitute the model. The teacher's scaffolding actions revealed the use of strategies that foster the development of connected, meaningful and more useable algebraic knowledge.
Developing ontological model of computational linear algebra - preliminary considerations
Wasielewska, K.; Ganzha, M.; Paprzycki, M.; Lirkov, I.
2013-10-01
The aim of this paper is to propose a method for application of ontologically represented domain knowledge to support Grid users. The work is presented in the context provided by the Agents in Grid system, which aims at development of an agent-semantic infrastructure for efficient resource management in the Grid. Decision support within the system should provide functionality beyond the existing Grid middleware, specifically, help the user to choose optimal algorithm and/or resource to solve a problem from a given domain. The system assists the user in at least two situations. First, for users without in-depth knowledge about the domain, it should help them to select the method and the resource that (together) would best fit the problem to be solved (and match the available resources). Second, if the user explicitly indicates the method and the resource configuration, it should "verify" if her choice is consistent with the expert recommendations (encapsulated in the knowledge base). Furthermore, one of the goals is to simplify the use of the selected resource to execute the job; i.e., provide a user-friendly method of submitting jobs, without required technical knowledge about the Grid middleware. To achieve the mentioned goals, an adaptable method of expert knowledge representation for the decision support system has to be implemented. The selected approach is to utilize ontologies and semantic data processing, supported by multicriterial decision making. As a starting point, an area of computational linear algebra was selected to be modeled, however, the paper presents a general approach that shall be easily extendable to other domains.
Zhang, Shufang; Wang, Fuyao; Zhang, Cong; Xie, Hui; Wan, Minggang
2016-09-01
The engine flame is an important representation of the combustion process in the cylinder, and the three-dimensional (3-D) shape reconstruction of the flame can provide more information for the quantitative analysis of the flame, so as to contribute to further research on the mechanism of the combustion flame. One important method of 3-D shape reconstruction is to reconstruct the two-dimensional (2-D) projection image of the flame, so the optimization problem of the flame 2-D slice reconstruction algorithm is studied in this paper. According to the gradient sparsity characteristics in the total variation (TV) domain and radial diffusion characteristics of the engine combustion flame, a flame 2-D slice algebraic reconstruction technique (ART) reconstruction algorithm based on radial TV (ART-R-TV) is proposed. Numerical simulation results show that the new proposed ART-R-TV algorithm can reconstruct flame slice images more stably and have a better robustness than the two traditional ART algorithms especially in a limited-angle situation.
An extended set of Fortran Basic Linear Algebra Subprograms: model implementation and test programs
Energy Technology Data Exchange (ETDEWEB)
Dongarra, J.J.; Du Croz, J.; Hammarling, S.; Hanson, R.J.
1987-01-01
This paper describes a model implementation and test software for the Level 2 Basic Linear Algebra Subprograms (Level 2 BLAS). The Level 2 BLAS are targeted at matrix-vector operations with the aim of providing more efficient, but portable, implementations of algorithms on high-performance computers. The model implementation provides a portable set of Fortran 77 Level 2 BLAS for machines where specialized implementations do not exist or are not required. The test software aims to verify that specialized implementations meet the specification of the Level 2 BLAS and that implementations are correctly installed.
Model Theory in Algebra, Analysis and Arithmetic
Dries, Lou; Macpherson, H Dugald; Pillay, Anand; Toffalori, Carlo; Wilkie, Alex J
2014-01-01
Presenting recent developments and applications, the book focuses on four main topics in current model theory: 1) the model theory of valued fields; 2) undecidability in arithmetic; 3) NIP theories; and 4) the model theory of real and complex exponentiation. Young researchers in model theory will particularly benefit from the book, as will more senior researchers in other branches of mathematics.
Correspondences between WZNW models and CFTs with W-algebra symmetry
Creutzig, Thomas; Ronne, Peter B
2015-01-01
We study theories with W-algebra symmetries and their relation to WZNW models on (super-)groups. Correlation functions of the WZNW models are expressed in terms of correlators of CFTs with W-algebra symmetry. The symmetries of the theories involved in these correspondences are related by the Drinfeld-Sokolov reduction of Lie algebras to W-algebras. The W-algebras considered in this paper are the Bershadsky-Polyakov algebra for sl(3) and the quasi-superconformal algebra for generic sl(N|M). The quantum W-algebras obtained from affine sl(N) are constructed using embeddings of sl(2) into sl(N), and these can in turn be characterized by partitions of N. The above cases correspond to \\underline{N+2} = \\underline{2} + N \\underline{1} and its supergroup extension. Finally, sl(2N) and the correspondence corresponding to \\underline{2N} = N \\underline{2} is also analyzed.
Free particles from Brauer algebras in complex matrix models
Kimura, Yusuke; Turton, David
2009-01-01
The gauge invariant degrees of freedom of matrix models based on an N x N complex matrix, with U(N) gauge symmetry, contain hidden free particle structures. These are exhibited using triangular matrix variables via the Schur decomposition. The Brauer algebra basis for complex matrix models developed earlier is useful in projecting to a sector which matches the state counting of N free fermions on a circle. The Brauer algebra projection is characterized by the vanishing of a scale invariant laplacian constructed from the complex matrix. The special case of N=2 is studied in detail: the ring of gauge invariant functions as well as a ring of scale and gauge invariant differential operators are characterized completely. The orthonormal basis of wavefunctions in this special case is completely characterized by a set of five commuting Hamiltonians, which display free particle structures. Applications to the reduced matrix quantum mechanics coming from radial quantization in N=4 SYM are described. We propose that th...
Geometric Model of Topological Insulators from the Maxwell Algebra
Palumbo, Giandomenico
2016-01-01
We propose a novel geometric model of three-dimensional topological insulators in presence of an external electromagnetic field. The gapped boundary of these systems supports relativistic quantum Hall states and is described by a Chern-Simons theory with a gauge connection that takes values in the Maxwell algebra. This represents a non-central extension of the Poincar\\'e algebra and takes into account both the Lorentz and magnetic-translation symmetries of the surface states. In this way, we derive a relativistic version of the Wen-Zee term, and we show that the non-minimal coupling between the background geometry and the electromagnetic field in the model is in agreement with the main properties of the relativistic quantum Hall states in the flat space.
The Hidden Quantum Group of the 8-vertex Free Fermion Model q-Clifford Algebras
Cuerno, R; López, E; Sierra, G
1993-01-01
We prove in this paper that the elliptic $R$--matrix of the eight vertex free fermion model is the intertwiner $R$--matrix of a quantum deformed Clifford--Hopf algebra. This algebra is constructed by affinization of a quantum Hopf deformation of the Clifford algebra.
Zhang, Shunli; Zhang, Dinghua; Gong, Hao; Ghasemalizadeh, Omid; Wang, Ge; Cao, Guohua
2014-11-01
Iterative algorithms, such as the algebraic reconstruction technique (ART), are popular for image reconstruction. For iterative reconstruction, the area integral model (AIM) is more accurate for better reconstruction quality than the line integral model (LIM). However, the computation of the system matrix for AIM is more complex and time-consuming than that for LIM. Here, we propose a fast and accurate method to compute the system matrix for AIM. First, we calculate the intersection of each boundary line of a narrow fan-beam with pixels in a recursive and efficient manner. Then, by grouping the beam-pixel intersection area into six types according to the slopes of the two boundary lines, we analytically compute the intersection area of the narrow fan-beam with the pixels in a simple algebraic fashion. Overall, experimental results show that our method is about three times faster than the Siddon algorithm and about two times faster than the distance-driven model (DDM) in computation of the system matrix. The reconstruction speed of our AIM-based ART is also faster than the LIM-based ART that uses the Siddon algorithm and DDM-based ART, for one iteration. The fast reconstruction speed of our method was accomplished without compromising the image quality.
Geometric Algebra Model of Distributed Representations
Patyk, Agnieszka
2010-01-01
Formalism based on GA is an alternative to distributed representation models developed so far --- Smolensky's tensor product, Holographic Reduced Representations (HRR) and Binary Spatter Code (BSC). Convolutions are replaced by geometric products, interpretable in terms of geometry which seems to be the most natural language for visualization of higher concepts. This paper recalls the main ideas behind the GA model and investigates recognition test results using both inner product and a clipped version of matrix representation. The influence of accidental blade equality on recognition is also studied. Finally, the efficiency of the GA model is compared to that of previously developed models.
Integrability in three dimensions: Algebraic Bethe ansatz for anyonic models
Directory of Open Access Journals (Sweden)
Sh. Khachatryan
2015-10-01
Full Text Available We extend basic properties of two dimensional integrable models within the Algebraic Bethe Ansatz approach to 2+1 dimensions and formulate the sufficient conditions for the commutativity of transfer matrices of different spectral parameters, in analogy with Yang–Baxter or tetrahedron equations. The basic ingredient of our models is the R-matrix, which describes the scattering of a pair of particles over another pair of particles, the quark-anti-quark (meson scattering on another quark-anti-quark state. We show that the Kitaev model belongs to this class of models and its R-matrix fulfills well-defined equations for integrability.
Energy Technology Data Exchange (ETDEWEB)
Bennett, Janine Camille [Sandia National Lab. (SNL-CA), Livermore, CA (United States). Visualization and Scientific Computing Dept.; Day, David Minot [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States). Applied Mathematics and Applications Dept.; Mitchell, Scott A. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States). Computer Science and Informatics Dept.
2009-11-20
This report summarizes the Combinatorial Algebraic Topology: software, applications & algorithms workshop (CAT Workshop). The workshop was sponsored by the Computer Science Research Institute of Sandia National Laboratories. It was organized by CSRI staff members Scott Mitchell and Shawn Martin. It was held in Santa Fe, New Mexico, August 29-30. The CAT Workshop website has links to some of the talk slides and other information, http://www.cs.sandia.gov/CSRI/Workshops/2009/CAT/index.html. The purpose of the report is to summarize the discussions and recap the sessions. There is a special emphasis on technical areas that are ripe for further exploration, and the plans for follow-up amongst the workshop participants. The intended audiences are the workshop participants, other researchers in the area, and the workshop sponsors.
Energy Technology Data Exchange (ETDEWEB)
Dongarra, J.J.; Hewitt, T.
1985-08-01
This note describes some experiments on simple, dense linear algebra algorithms. These experiments show that the CRAY X-MP is capable of small-grain multitasking arising from standard implementations of LU and Cholesky decomposition. The implementation described here provides the ''fastest'' execution rate for LU decomposition, 718 MFLOPS for a matrix of order 1000.
Energy Technology Data Exchange (ETDEWEB)
Lee, E.T.
1983-01-01
Algorithms for the construction of the Chomsky and Greibach normal forms for a fuzzy context-free grammar using the algebraic approach are presented and illustrated by examples. The results obtained in this paper may have useful applications in fuzzy languages, pattern recognition, information storage and retrieval, artificial intelligence, database and pictorial information systems. 16 references.
Algebraic Turbulence-Chemistry Interaction Model
Norris, Andrew T.
2012-01-01
The results of a series of Perfectly Stirred Reactor (PSR) and Partially Stirred Reactor (PaSR) simulations are compared to each other over a wide range of operating conditions. It is found that the PaSR results can be simulated by a PSR solution with just an adjusted chemical reaction rate. A simple expression has been developed that gives the required change in reaction rate for a PSR solution to simulate the PaSR results. This expression is the basis of a simple turbulence-chemistry interaction model. The interaction model that has been developed is intended for use with simple one-step global reaction mechanisms and for steady-state flow simulations. Due to the simplicity of the model there is very little additional computational cost in adding it to existing CFD codes.
The operator algebra of orbifold models
Dijkgraaf, Robbert; Vafa, Cumrun; Verlinde, Erik; Verlinde, Herman
1989-09-01
We analyze the chiral properties of (orbifold) conformal field theories which are obtained from a given conformal field theory by modding out by a finite symmetry group. For a class of orbifolds, we derive the fusion rules by studying the modular transformation properties of the one-loop characters. The results are illustrated with explicit calculations of toroidal and c=1 models.
A linear algebra model for quasispecies
García-Pelayo, Ricardo
2002-06-01
In the present work we present a simple model of the population genetics of quasispecies. We show that the error catastrophe arises because in Biology the mutation rates are almost zero and the mutations themselves are almost neutral. We obtain and discuss previously known results from the point of view of this model. New results are: the fitness of a sequence in terms of its abundance in the quasispecies, a formula for the stable distribution of a quasispecies in which the fitness depends only on the Hamming distance to the master sequence, the time it takes the master sequence to generate a stable quasispecies (such as in the infection by a virus) and the fitness of quasispecies.
An algebraic model of baryon spectroscopy
Bijker, R
1999-01-01
We discuss recent calculations of the mass spectrum, electromagnetic and strong couplings of baryon resonances. The calculations are done in a collective constituent model for the nucleon, in which the resonances are interpreted as rotations and vibrations of a symmetric top with a prescribed distribution of the charge and magnetization. We analyze recent data on eta-photo- and eta-electroproduction, and the tensor analyzing power in deuteron scattering.
A Multiple—Valued Algebra for Modeling MOS VLSI Circuits at Switch—Level
Institute of Scientific and Technical Information of China (English)
胡谋
1992-01-01
A multiple-valued algebra for modeling MOS VLSI circuits at switch-level is proposed in this paper,Its structure and properties are studied.This algebra can be used to transform a MOS digital circuit to a swith-level algebraic expression so as to generate the truth table for the circuit and to derive a Boolean expression for it.In the paper,methods to construct a switch-level algebraic expression for a circuit and methods to simplify expressions are given.This algebra provides a new tool for MOS VLSI circuit design and analysis.
Modeling and Simulation of Tandem Tollbooth Operations with Max-Algebra Approach
Hong, Young-Chae; Kim, Dong-Kyu; Kho, Seung-Young; Kim, Soo Wook; Yang, Hongsuk
This study proposes a new model to simulate tandem tollbooth system in order to enhance planning and management of toll plaza facilities. A discrete-event stochastic microscopic simulation model is presented and developed to evaluate the operational performance of tandem tollbooth. Traffic behavior is represented using a set of mathematical and logical algorithms. Modified versions of Max-algebra approach are integrated into this new algorithm to simulate traffic operation at toll plazas. Computational results show that the benefit of tandem tollbooth depends on the number of serial tollbooth, service time and reaction time of drivers. The capacity of tandem tollbooth increases when service time follows a normal distribution rather than negative exponential distribution. Specifically, the lower variance of service time is, the better capacity tollbooth has. In addition, the ratio of driver's reaction time to service time affects the increasing ratio of the capacity extended by tollbooth.
Proceedings Second International Workshop on Algebraic Methods in Model-based Software Engineering
Durán, Francisco
2011-01-01
Over the past years there has been quite a lot of activity in the algebraic community about using algebraic methods for providing support to model-driven software engineering. The aim of this workshop is to gather researchers working on the development and application of algebraic methods to provide rigorous support to model-based software engineering. The topics relevant to the workshop are all those related to the use of algebraic methods in software engineering, including but not limited to: formally specifying and verifying model-based software engineering concepts and related ones (MDE, UML, OCL, MOF, DSLs, ...); tool support for the above; integration of formal and informal methods; and theoretical frameworks (algebraic, rewriting-based, category theory-based, ...). The workshop's main goal is to examine, discuss, and relate the existing projects within the algebraic community that address common open-issues in model-driven software engineering.
An Algebraic Graphical Model for Decision with Uncertainties, Feasibilities, and Utilities
Pralet, C; Verfaillie, G; 10.1613/jair.2151
2011-01-01
Numerous formalisms and dedicated algorithms have been designed in the last decades to model and solve decision making problems. Some formalisms, such as constraint networks, can express "simple" decision problems, while others are designed to take into account uncertainties, unfeasible decisions, and utilities. Even in a single formalism, several variants are often proposed to model different types of uncertainty (probability, possibility...) or utility (additive or not). In this article, we introduce an algebraic graphical model that encompasses a large number of such formalisms: (1) we first adapt previous structures from Friedman, Chu and Halpern for representing uncertainty, utility, and expected utility in order to deal with generic forms of sequential decision making; (2) on these structures, we then introduce composite graphical models that express information via variables linked by "local" functions, thanks to conditional independence; (3) on these graphical models, we finally define a simple class ...
Mahé, Louis; Roy, Marie-Françoise
1992-01-01
Ten years after the first Rennes international meeting on real algebraic geometry, the second one looked at the developments in the subject during the intervening decade - see the 6 survey papers listed below. Further contributions from the participants on recent research covered real algebra and geometry, topology of real algebraic varieties and 16thHilbert problem, classical algebraic geometry, techniques in real algebraic geometry, algorithms in real algebraic geometry, semialgebraic geometry, real analytic geometry. CONTENTS: Survey papers: M. Knebusch: Semialgebraic topology in the last ten years.- R. Parimala: Algebraic and topological invariants of real algebraic varieties.- Polotovskii, G.M.: On the classification of decomposing plane algebraic curves.- Scheiderer, C.: Real algebra and its applications to geometry in the last ten years: some major developments and results.- Shustin, E.L.: Topology of real plane algebraic curves.- Silhol, R.: Moduli problems in real algebraic geometry. Further contribu...
Topological basis realization for BMW algebra and Heisenberg XXZ spin chain model
Liu, Bo; Xue, Kang; Wang, Gangcheng; Liu, Ying; Sun, Chunfang
2015-04-01
In this paper, we study three-dimensional (3D) reduced Birman-Murakami-Wenzl (BMW) algebra based on topological basis theory. Several examples of BMW algebra representations are reviewed. We also discuss a special solution of BMW algebra, which can be used to construct Heisenberg XXZ model. The theory of topological basis provides a useful method to solve quantum spin chain models. It is also shown that the ground state of XXZ spin chain is superposition state of topological basis.
A New Algebraic Modelling Approach to Distributed Problem-Solving in MAS
Institute of Scientific and Technical Information of China (English)
帅典勋; 邓志东
2002-01-01
This paper is devoted to a new algebraic modelling approach to distributed problem-solving in multi-agent systems (MAS), which is featured by a unified framework for describing and treating social behaviors, social dynamics and social intelligence. A conceptual architecture of algebraic modelling is presented. The algebraic modelling of typical social behaviors, social situation and social dynamics is discussed in the context of distributed problemsolving in MAS. The comparison and simulation on distributed task allocations and resource assignments in MAS show more advantages of the algebraic approach than other conventional methods.
Clifford algebras geometric modelling and chain geometries with application in kinematics
Klawitter, Daniel
2015-01-01
After revising known representations of the group of Euclidean displacements Daniel Klawitter gives a comprehensive introduction into Clifford algebras. The Clifford algebra calculus is used to construct new models that allow descriptions of the group of projective transformations and inversions with respect to hyperquadrics. Afterwards, chain geometries over Clifford algebras and their subchain geometries are examined. The author applies this theory and the developed methods to the homogeneous Clifford algebra model corresponding to Euclidean geometry. Moreover, kinematic mappings for special Cayley-Klein geometries are developed. These mappings allow a description of existing kinematic mappings in a unifying framework. Contents Models and representations of classical groups Clifford algebras, chain geometries over Clifford algebras Kinematic mappings for Pin and Spin groups Cayley-Klein geometries Target Groups Researchers and students in the field of mathematics, physics, and mechanical engineering About...
The Schwinger Dyson equations and the algebra of constraints of random tensor models at all orders
Energy Technology Data Exchange (ETDEWEB)
Gurau, Razvan, E-mail: rgurau@perimeterinstitute.ca [Perimeter Institute for Theoretical Physics, 31 Caroline St. N, ON N2L 2Y5, Waterloo (Canada)
2012-12-01
Random tensor models for a generic complex tensor generalize matrix models in arbitrary dimensions and yield a theory of random geometries. They support a 1/N expansion dominated by graphs of spherical topology. Their Schwinger Dyson equations, generalizing the loop equations of matrix models, translate into constraints satisfied by the partition function. The constraints have been shown, in the large N limit, to close a Lie algebra indexed by colored rooted D-ary trees yielding a first generalization of the Virasoro algebra in arbitrary dimensions. In this paper we complete the Schwinger Dyson equations and the associated algebra at all orders in 1/N. The full algebra of constraints is indexed by D-colored graphs, and the leading order D-ary tree algebra is a Lie subalgebra of the full constraints algebra.
Evolving MultiAlgebras unify all usual sequential computation models
Grigorieff, Serge
2010-01-01
It is well-known that Abstract State Machines (ASMs) can simulate "step-by-step" any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) simulation is not identification, 2) the ASMs simulating machines of some type do not constitute a natural class among all ASMs. We modify Gurevich's notion of ASM to that of EMA ("Evolving MultiAlgebra") by replacing the program (which is a syntactic object) by a semantic object: a functional which has to be very simply definable over the static part of the ASM. We prove that very natural classes of EMAs correspond via "literal identifications" to slight extensions of the usual machine models and also to grammar models. Though we modify these models, we keep their computation approach: only some contingencies are modified. Thus, EMAs appear as the mathematical model unifying all kinds of sequential computation paradigms.
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Ivanyos, Gábor; Rónyai, Lajos; Saxena, Nitin
2008-01-01
In this paper we develop techniques that eliminate the need of the Generalized Riemann Hypothesis (GRH) from various (almost all) known results about deterministic polynomial factoring over finite fields. Our main result shows that given a polynomial f(x) of degree n over a finite field k, we can find in deterministic poly(n^{\\log n},\\log |k|) time "either" a nontrivial factor of f(x) "or" a nontrivial automorphism of k[x]/(f(x)) of order n. This main tool leads to various new GRH-free results, most striking of which are: (1) Given a noncommutative algebra over a finite field, we can find a zero divisor in deterministic subexponential time. (2) Given a positive integer r>4 such that either 4|r or r has two distinct prime factors. There is a deterministic polynomial time algorithm to find a nontrivial factor of the r-th cyclotomic polynomial over a finite field. In this paper, following the seminal work of Lenstra (1991) on constructing isomorphisms between finite fields, we further generalize classical Galois...
Weatheritt, Jack; Sandberg, Richard
2016-11-01
This paper presents a novel and promising approach to turbulence model formulation, rather than putting forward a particular new model. Evolutionary computation has brought symbolic regression of scalar fields into the domain of algorithms and this paper describes a novel expansion of Gene Expression Programming for the purpose of tensor modeling. By utilizing high-fidelity data and uncertainty measures, mathematical models for tensors are created. The philosophy behind the framework is to give freedom to the algorithm to produce a constraint-free model; its own functional form that was not previously imposed. Turbulence modeling is the target application, specifically the improvement of separated flow prediction. Models are created by considering the anisotropy of the turbulent stress tensor and formulating non-linear constitutive stress-strain relationships. A previously unseen flow field is computed and compared to the baseline linear model and an established non-linear model of comparable complexity. The results are highly encouraging.
Tolar, Tammy Daun; Lederberg, Amy R.; Fletcher, Jack M.
2009-01-01
The goal of this study was to develop and evaluate a structural model of the relations among cognitive abilities and arithmetic skills and college students' algebra achievement. The model of algebra achievement was compared to a model of performance on the Scholastic Assessment in Mathematics (SAT-M) to determine whether the pattern of relations…
Fast algebra algorithm of shape-from-shading with specular reflectance
Institute of Scientific and Technical Information of China (English)
Lei Yang; Jiuqiang Han
2007-01-01
Shape-from-shading (SFS) is to reconstruct three-dimensional (3D) shape from a single gray image, which is an important problem in computer vision. We propose a novel SFS method based on hybrid reflection model which contains both diffuse reflectance and specular reflectance. The intensity gradient of image is in the direction that the shape of urface changes most, so we use directional derivative of the reflectance map as parts of objective function. When discrete characteristic of digital images is considered, finite difference approximates differential operator. So the reflectance map equation described by a partial differential equation (PDE) turns into an algebra equation about the nknown surface height correspondingly. Using iterative numeric computation, a new SFS method is gained. Experiments on synthesis and real images show that the proposed SFS method is accurate and fast.
Directory of Open Access Journals (Sweden)
A. A. Zolotin
2015-07-01
Full Text Available Posteriori inference is one of the three kinds of probabilistic-logic inferences in the probabilistic graphical models theory and the base for processing of knowledge patterns with probabilistic uncertainty using Bayesian networks. The paper deals with a task of local posteriori inference description in algebraic Bayesian networks that represent a class of probabilistic graphical models by means of matrix-vector equations. The latter are essentially based on the use of tensor product of matrices, Kronecker degree and Hadamard product. Matrix equations for calculating posteriori probabilities vectors within posteriori inference in knowledge patterns with quanta propositions are obtained. Similar equations of the same type have already been discussed within the confines of the theory of algebraic Bayesian networks, but they were built only for the case of posteriori inference in the knowledge patterns on the ideals of conjuncts. During synthesis and development of matrix-vector equations on quanta propositions probability vectors, a number of earlier results concerning normalizing factors in posteriori inference and assignment of linear projective operator with a selector vector was adapted. We consider all three types of incoming evidences - deterministic, stochastic and inaccurate - combined with scalar and interval estimation of probability truth of propositional formulas in the knowledge patterns. Linear programming problems are formed. Their solution gives the desired interval values of posterior probabilities in the case of inaccurate evidence or interval estimates in a knowledge pattern. That sort of description of a posteriori inference gives the possibility to extend the set of knowledge pattern types that we can use in the local and global posteriori inference, as well as simplify complex software implementation by use of existing third-party libraries, effectively supporting submission and processing of matrices and vectors when
Lie algebraic similarity transformed Hamiltonians for lattice model systems
Wahlen-Strothman, Jacob M.; Jiménez-Hoyos, Carlos A.; Henderson, Thomas M.; Scuseria, Gustavo E.
2015-01-01
We present a class of Lie algebraic similarity transformations generated by exponentials of two-body on-site Hermitian operators whose Hausdorff series can be summed exactly without truncation. The correlators are defined over the entire lattice and include the Gutzwiller factor ni ↑ni ↓ , and two-site products of density (ni ↑+ni ↓) and spin (ni ↑-ni ↓) operators. The resulting non-Hermitian many-body Hamiltonian can be solved in a biorthogonal mean-field approach with polynomial computational cost. The proposed similarity transformation generates locally weighted orbital transformations of the reference determinant. Although the energy of the model is unbound, projective equations in the spirit of coupled cluster theory lead to well-defined solutions. The theory is tested on the one- and two-dimensional repulsive Hubbard model where it yields accurate results for small and medium sized interaction strengths.
Correspondences between WZNW models and CFTs with W-algebra symmetry
Creutzig, Thomas; Hikida, Yasuaki; Rønne, Peter B.
2016-02-01
We study theories with W-algebra symmetries and their relation to WZNW-type models on (super-)groups generalizing the H 3 + WZNW to Liouville correspondence. Correlation functions of the WZNW models are expressed in terms of correlators of CFTs with W-algebra symmetry. The symmetries of the theories involved in these correspondences are related by the Drinfeld-Sokolov reduction of Lie algebras to W-algebras. The W-algebras considered in this paper are the Bershadsky-Polyakov algebra for sl(3) and the quasi-superconformal algebra for generic sl( N| M). The quantum W-algebras obtained from affine sl( N) are constructed using embeddings of sl(2) into sl( N), and these can in turn be characterized by partitions of N. The above cases correspond to N + 2 = 2 + N 1 and its supergroup extension. Finally, sl(2 N) and the correspondence corresponding to 2 N = N 2 is also analyzed. These are all W-algebras that are generated by fields of at most dimension two.
Phases and phase transitions in the algebraic microscopic shell model
Directory of Open Access Journals (Sweden)
Georgieva A. I.
2016-01-01
Full Text Available We explore the dynamical symmetries of the shell model number conserving algebra, which define three types of pairing and quadrupole phases, with the aim to obtain the prevailing phase or phase transition for the real nuclear systems in a single shell. This is achieved by establishing a correspondence between each of the pairing bases with the Elliott’s SU(3 basis that describes collective rotation of nuclear systems. This allows for a complete classification of the basis states of different number of particles in all the limiting cases. The probability distribution of the SU(3 basis states within theirs corresponding pairing states is also obtained. The relative strengths of dynamically symmetric quadrupole-quadrupole interaction in respect to the isoscalar, isovector and total pairing interactions define a control parameter, which estimates the importance of each term of the Hamiltonian in the correct reproduction of the experimental data for the considered nuclei.
CUDA加速的地图代数并行算法%CUDA-Accelerated Parallel Algorithms for Map Algebra
Institute of Scientific and Technical Information of China (English)
张剑波; 周斯波; 张帅
2011-01-01
针对传统地图代数实现方法应用于海量栅格数据计算时效率低下的问题,在一种全新的GPU并行编程模型CUDA上,利用地图代数算子体现出来的基于栅格点集、处理流程相对固定、数据处理具有内在的并行性等特点,将传统的串行算法映射到GPU并行处理架构上,旨在从串行算法的并行化映射、计算机图形处理器资源的自适应参数调整等多角度来研究地图代数空间并行算法的实现机制,为空间分析算法的优化研究提供一种新的解决思路.%To improve the efficiency in traditional method of map algebra calculation for gigantic raster data, arithmetic operators characteristics are applied, including relatively fixed process flow and inherently parallel specialty, and a new GPU parallel programming model named CUDA is selectsed as technique supports. The realization mechanism surrounding parallel mapping of serial algorithms is discussed in adaptive parameter adjustments on computer graphic processor resources, thus providing a new solution for optimized research of spatial analytic algorithms.
A C *-Algebraic Model for Locally Noncommutative Spacetimes
Heller, Jakob G.; Neumaier, Nikolai; Waldmann, Stefan
2007-06-01
Locally noncommutative spacetimes provide a refined notion of noncommutative spacetimes where the noncommutativity is present only for small distances. Here we discuss a non-perturbative approach based on Rieffel’s strict deformation quantization. To this end, we extend the usual C *-algebraic results to a pro-C *-algebraic framework.
Re"modeling" College Algebra: An Active Learning Approach
Pinzon, D.; Pinzon, K.; Stackpole, M.
2016-01-01
In this paper, we discuss active learning in College Algebra at Georgia Gwinnett College. This approach has been used in more than 20 sections of College Algebra taught by the authors in the past four semesters. Students work in small, structured groups on guided inquiry activities after watching 15-20 minutes of videos before class. We discuss a…
A set for relational reasoning: Facilitation of algebraic modeling by a fraction task.
DeWolf, Melissa; Bassok, Miriam; Holyoak, Keith J
2016-12-01
Recent work has identified correlations between early mastery of fractions and later math achievement, especially in algebra. However, causal connections between aspects of reasoning with fractions and improved algebra performance have yet to be established. The current study investigated whether relational reasoning with fractions facilitates subsequent algebraic reasoning using both pre-algebra students and adult college students. Participants were first given either a relational reasoning fractions task or a fraction algebra procedures control task. Then, all participants solved word problems and constructed algebraic equations in either multiplication or division format. The word problems and the equation construction tasks involved simple multiplicative comparison statements such as "There are 4 times as many students as teachers in a classroom." Performance on the algebraic equation construction task was enhanced for participants who had previously completed the relational fractions task compared with those who completed the fraction algebra procedures task. This finding suggests that relational reasoning with fractions can establish a relational set that promotes students' tendency to model relations using algebraic expressions.
A new algebraic transition model based on stress length function
Xiao, Meng-Juan; She, Zhen-Su
2016-11-01
Transition, as one of the two biggest challenges in turbulence research, is of critical importance for engineering application. For decades, the fundamental research seems to be unable to capture the quantitative details in real transition process. On the other hand, numerous empirical parameters in engineering transition models provide no unified description of the transition under varying physical conditions. Recently, we proposed a symmetry-based approach to canonical wall turbulence based on stress length function, which is here extended to describe the transition via a new algebraic transition model. With a multi-layer analytic form of the stress length function in both the streamwise and wall normal directions, the new model gives rise to accurate description of the mean field and friction coefficient, comparing with both the experimental and DNS results at different inlet conditions. Different types of transition process, such as the transition with varying incoming turbulence intensities or that with blow and suck disturbance, are described by only two or three model parameters, each of which has their own specific physical interpretation. Thus, the model enables one to extract physical information from both experimental and DNS data to reproduce the transition process, which may prelude to a new class of generalized transition model for engineering applications.
A Modeling-Based College Algebra Course and Its Effect on Student Achievement
Ellington, Aimee J.
2005-01-01
In Fall 2004, Virginia Commonwealth University (VCU) piloted a modeling-based approach to college algebra. This paper describes the course and an assessment that was conducted to determine the effect of this approach on student achievement in comparison to a traditional approach to college algebra. The results show that compared with their…
07071 Report on Dagstuhl Seminar -- Web Information Retrieval and Linear Algebra Algorithms
Frommer, Andreas; Mahoney, Michael W.; Szyld, Daniel B.
2007-01-01
A seminar concentrating on the intersection of the fields of information retrieval and other web-related aspects with numerical and applied linear algebra techniques was held with the attendance of scientists from industry and academia.
Sokolov, Vladimir V
2014-01-01
The potential of the $A_2$ quantum elliptic model (3-body Calogero elliptic model) is defined by the pairwise three-body interaction through Weierstrass $\\wp$-function and has a single coupling constant. A change of variables has been found, which are $A_2$ elliptic invariants. In those, the potential becomes a rational function, while the flat space metric as well as its associated vector are polynomials in two variables. It is shown the model possesses the hidden $sl_3$ algebra - the Hamiltonian is an element of the universal enveloping algebra $U_{sl_3}$ for arbitrary coupling constant - being equivalent to $sl_3$-quantum top. The integral in a form of the third order differential operator with polynomial coefficients is constructed explicitly, being also an element of the universal enveloping algebra $U_{sl_3}$. It is shown that there exists a discrete sequence of coupling constants for which a finite number of polynomial eigenfunctions up to a (non-singular) gauge factor occur.
Directory of Open Access Journals (Sweden)
M. A. Zotov
2016-01-01
Full Text Available An improved algorithm for the synthesis of the secondary structure of algebraic Bayesian networks represented by a minimal join graph is proposed in the paper. The algorithm differs from the previously offered one so that it relies on the incremental principle, uses specially selected edges and, finally, eliminates redundant edges by a greedy algorithm. The correct operation of the incremental algorithm is mathematically proved. Comparison of the computational complexity of the new (incremental algorithm implementation and two well-known (greedy and direct is made by means of statistical estimates of complexity, based on the sample values of the runtime ratio of software implementations of two compared algorithms. Theoretical complexity estimates of the greedy and direct algorithms have been obtained earlier, but are not suitable for comparative analysis, as they are based on the hidden characteristics of the secondary structure, which can be calculated only when it is built. To minimize the influence of random factors at calculating the ratio average program runtime is used obtained by N launches on the same set of workloads. The sample values of ratio is formed for M sets of equal power K. According to the sample values the median is calculated, as well as the other statistics that characterize the spread: borders of the 97% confidence interval along with the first and the third quartiles. Sets of loads are stochastically generated according to the specified parameters using the algorithm described in the paper. The stochastic algorithms generating a set of loads with given power, as well as collecting the statistical data and calculating of statistical estimates of the ratio of forward and greedy algorithm to the incremental algorithm runtimes is described in the paper. A series of experiments is carried out in which N is changed in the range 1, 2 ... 9, 10, 26, 42 ... 170.They have showed that the incremental algorithm speed exceeds the
Edwards, Harold M
1995-01-01
In his new undergraduate textbook, Harold M Edwards proposes a radically new and thoroughly algorithmic approach to linear algebra Originally inspired by the constructive philosophy of mathematics championed in the 19th century by Leopold Kronecker, the approach is well suited to students in the computer-dominated late 20th century Each proof is an algorithm described in English that can be translated into the computer language the class is using and put to work solving problems and generating new examples, making the study of linear algebra a truly interactive experience Designed for a one-semester course, this text adopts an algorithmic approach to linear algebra giving the student many examples to work through and copious exercises to test their skills and extend their knowledge of the subject Students at all levels will find much interactive instruction in this text while teachers will find stimulating examples and methods of approach to the subject
Index-aware model order reduction methods applications to differential-algebraic equations
Banagaaya, N; Schilders, W H A
2016-01-01
The main aim of this book is to discuss model order reduction (MOR) methods for differential-algebraic equations (DAEs) with linear coefficients that make use of splitting techniques before applying model order reduction. The splitting produces a system of ordinary differential equations (ODE) and a system of algebraic equations, which are then reduced separately. For the reduction of the ODE system, conventional MOR methods can be used, whereas for the reduction of the algebraic systems new methods are discussed. The discussion focuses on the index-aware model order reduction method (IMOR) and its variations, methods for which the so-called index of the original model is automatically preserved after reduction.
Liu, Jianzhou; Zhang, Juan
2011-08-01
In this article, applying the properties of M-matrix and non-negative matrix, utilising eigenvalue inequalities of matrix's sum and product, we firstly develop new upper and lower matrix bounds of the solution for discrete coupled algebraic Riccati equation (DCARE). Secondly, we discuss the solution existence uniqueness condition of the DCARE using the developed upper and lower matrix bounds and a fixed point theorem. Thirdly, a new fixed iterative algorithm of the solution for the DCARE is shown. Finally, the corresponding numerical examples are given to illustrate the effectiveness of the developed results.
Algebraic Statistical Model for Biochemical Network Dynamics Inference.
Linder, Daniel F; Rempala, Grzegorz A
2013-12-01
With modern molecular quantification methods, like, for instance, high throughput sequencing, biologists may perform multiple complex experiments and collect longitudinal data on RNA and DNA concentrations. Such data may be then used to infer cellular level interactions between the molecular entities of interest. One method which formalizes such inference is the stoichiometric algebraic statistical model (SASM) of [2] which allows to analyze the so-called conic (or single source) networks. Despite its intuitive appeal, up until now the SASM has been only heuristically studied on few simple examples. The current paper provides a more formal mathematical treatment of the SASM, expanding the original model to a wider class of reaction systems decomposable into multiple conic subnetworks. In particular, it is proved here that on such networks the SASM enjoys the so-called sparsistency property, that is, it asymptotically (with the number of observed network trajectories) discards the false interactions by setting their reaction rates to zero. For illustration, we apply the extended SASM to in silico data from a generic decomposable network as well as to biological data from an experimental search for a possible transcription factor for the heat shock protein 70 (Hsp70) in the zebrafish retina.
Analysis of DIRAC's behavior using model checking with process algebra
Remenska, Daniela; Templon, Jeff; Willemse, Tim; Bal, Henri; Verstoep, Kees; Fokkink, Wan; Charpentier, Philippe; Graciani Diaz, Ricardo; Lanciotti, Elisa; Roiser, Stefan; Ciba, Krzysztof
2012-12-01
DIRAC is the grid solution developed to support LHCb production activities as well as user data analysis. It consists of distributed services and agents delivering the workload to the grid resources. Services maintain database back-ends to store dynamic state information of entities such as jobs, queues, staging requests, etc. Agents use polling to check and possibly react to changes in the system state. Each agent's logic is relatively simple; the main complexity lies in their cooperation. Agents run concurrently, and collaborate using the databases as shared memory. The databases can be accessed directly by the agents if running locally or through a DIRAC service interface if necessary. This shared-memory model causes entities to occasionally get into inconsistent states. Tracing and fixing such problems becomes formidable due to the inherent parallelism present. We propose more rigorous methods to cope with this. Model checking is one such technique for analysis of an abstract model of a system. Unlike conventional testing, it allows full control over the parallel processes execution, and supports exhaustive state-space exploration. We used the mCRL2 language and toolset to model the behavior of two related DIRAC subsystems: the workload and storage management system. Based on process algebra, mCRL2 allows defining custom data types as well as functions over these. This makes it suitable for modeling the data manipulations made by DIRAC's agents. By visualizing the state space and replaying scenarios with the toolkit's simulator, we have detected race-conditions and deadlocks in these systems, which, in several cases, were confirmed to occur in the reality. Several properties of interest were formulated and verified with the tool. Our future direction is automating the translation from DIRAC to a formal model.
Mathematical modelling in engineering: A proposal to introduce linear algebra concepts
Andrea Dorila Cárcamo; Joan Vicenç Gómez; Josep María Fortuny
2016-01-01
The modern dynamic world requires that basic science courses for engineering, including linear algebra, emphasize the development of mathematical abilities primarily associated with modelling and interpreting, which aren´t limited only to calculus abilities. Considering this, an instructional design was elaborated based on mathematic modelling and emerging heuristic models for the construction of specific linear algebra concepts: span and spanning set. This was applied to first year e...
Mathematical modelling in engineering: a proposal to introduce linear algebra concepts
Cárcamo Bahamonde, Andrea Dorila; Gómez Urgellés, Joan Vicenç; Fortuny Aymeni, José María
2016-01-01
The modern dynamic world requires that basic science courses for engineering, including linear algebra, emphasize the development of mathematical abilities primarily associated with modelling and interpreting, which aren´t limited only to calculus abilities. Considering this, an instructional design was elaborated based on mathematic modelling and emerging heuristic models for the construction of specific linear algebra concepts: span and spanning set. This was applied to first year engineeri...
Mathematical modelling in engineering: a proposal to introduce linear algebra concepts
Cárcamo Bahamonde, Andrea; Gómez Urgellés, Joan Vicenç; Fortuny Aymemi, Josep Maria
2016-01-01
The modern dynamic world requires that basic science courses for engineering, including linear algebra, emphasize the development of mathematical abilities primarily associated with modelling and interpreting, which aren´t limited only to calculus abilities. Considering this, an instructional design was elaborated based on mathematic modelling and emerging heuristic models for the construction of specific linear algebra concepts: span and spanning set. This was applied to first year engineer...
The Standard Model as an extension of the noncommutative algebra of forms
Brouder, Christian; Besnard, Fabien
2015-01-01
The Standard Model of particle physics can be deduced from a small number of axioms within Connes' noncommutative geometry (NCG). Boyle and Farnsworth [New J. Phys. 16 (2014) 123027] proposed to interpret Connes' approach as an algebra extension in the sense of Eilenberg. By doing so, they could deduce three axioms of the NCG Standard Model (i.e. order zero, order one and massless photon) from the single requirement that the extended algebra be associative. However, their approach was only applied to the finite part of the model because it fails for the full model. By taking into account the differential graded structure of the algebra of noncommutative differential forms, we obtain a formulation where the same three axioms are deduced from the associativity of the extended differential graded algebra, but which is now compatible with the full Standard Model.
Marchuk, Nikolay
2011-01-01
Exterior algebras and differential forms are widely used in many fields of modern mathematics and theoretical physics. In this paper we define a notion of $N$-metric exterior algebra, which depends on $N$ matrices of structure constants. The usual exterior algebra (Grassmann algebra) can be considered as 0-metric exterior algebra. Clifford algebra can be considered as 1-metric exterior algebra. $N$-metric exterior algebras for $N\\geq2$ can be considered as generalizations of the Grassmann algebra and Clifford algebra. Specialists consider models of gravity that based on a mathematical formalism with two metric tensors. We hope that the considered in this paper 2-metric exterior algebra can be useful for development of this model in gravitation theory. Especially in description of fermions in presence of a gravity field.
3D Cadastral Data Model Based on Conformal Geometry Algebra
Directory of Open Access Journals (Sweden)
Ji-yi Zhang
2016-02-01
Full Text Available Three-dimensional (3D cadastral data models that are based on Euclidean geometry (EG are incapable of providing a unified representation of geometry and topological relations for 3D spatial units in a cadastral database. This lack of unification causes problems such as complex expression structure and inefficiency in the updating of 3D cadastral objects. The inability of current cadastral data models to express cadastral objects in a unified manner can be attributed to the different expressions of dimensional objects. Because the hierarchical Grassmann structure corresponds to the hierarchical structure of dimensions in conformal geometric algebra (CGA, geometric objects in different dimensions can be constructed by outer products in a unified expression form, which enables the direct extension of two-dimensional (2D spatial representations to 3D spatial representations. The multivector structure in CGA can be employed to organize and store different dimensional objects in a multidimensional and unified manner. With the advantages of CGA in multidimensional expressions, a new 3D cadastral data model that is based on CGA is proposed in this paper. The geometries and topological relations of 3D spatial units can be represented in a unified form within the multivector structure. Detailed methods for 3D cadastral data model design based on CGA and data organization in CGA are introduced. The new cadastral data model is tested and analyzed with experimental data. The results indicate that the geometry and topological relations of 3D cadastral objects can be represented in a multidimensional manner with an intuitive topological structure and a unified dimensional expression.
Quasi-exactly solvable models derived from the quasi-Gaudin algebra
Energy Technology Data Exchange (ETDEWEB)
Lee, Yuan-Harng; Links, Jon; Zhang Yaozhong, E-mail: jrl@uq.edu.au [School of Mathematics and Physics, The University of Queensland, Brisbane, Qld 4072 (Australia)
2011-12-02
The quasi-Gaudin algebra was introduced to construct integrable systems which are only quasi-exactly solvable. Using a suitable representation of the quasi-Gaudin algebra, we obtain a class of bosonic models which exhibit this curious property. These models have the notable feature that they do not preserve U(1) symmetry, which is typically associated with a non-conservation of particle number. An exact solution for the eigenvalues within the quasi-exactly solvable sector is obtained via the algebraic Bethe ansatz formalism. (fast track communication)
Solitons on Noncommutative Torus as Elliptic Algebras and Elliptic Models
Hou, B Y; Shi, K J; Yue, R H; Hou, Bo-Yu; Peng, Dan-tao; Shi, Kang-Jie; Yue, Rui-Hong
2001-01-01
For the noncommutative torus ${\\cal T}$, in case of the N.C. parameter $\\theta = \\frac{Z}{n}$ and the area of ${\\cal T}$ is an integer, we construct the basis of Hilbert space ${\\cal H}_n$ in terms of $\\theta$ functions of the positions of $n$ solitons. The Wilson loop wrapping the solitons around the torus generates the algebra ${\\cal A}_n$. We find that ${\\cal A}_n$ is isomorphic to the $Z_n \\times Z_n$ Heisenberg group on $\\theta$ functions. We find the explicit form for the solitons local translation operators, show that it is the generators $g$ of an elliptic $su(n)$, which transform covariantly by the global gauge transformation of the Wilson loop in ${\\cal A}_n$. Then by acting on ${\\cal H}_n$ we establish the isomorphism of ${\\cal A}_n$ and $g$. Then it is easy to give the projection operators corresponding to the solitons and the ABS construction for generating solitons. We embed this $g$ into elliptic Gaudin and C.M. models to give the dynamics. For $\\theta$ generic case, we introduce the crossing p...
On the Model Properties of BCK Algebras%关于BCK代数的模型论性质
Institute of Scientific and Technical Information of China (English)
梁俊奇
2004-01-01
This paper is devoted to the study of the logical properties of BCK algebras.For formalized BCK algebra theory T, it is proved that T is preserved under submodels and unions of chains; T is neither complete nor model complete, and hence there exist no builtin Skolem function. Moreover, the ultraproduct BCK algebras and the fuzzy ultraproduct of fuzzy subsets of BCK algebras were proposed by using the concept of ultrafilters with corresponding propertics of fuzzy ideals discussed.
Lie algebra solution of population models based on time-inhomogeneous Markov chains
House, Thomas
2011-01-01
Many natural populations are well modelled through time-inhomogeneous stochastic processes. Such processes have been analysed in the physical sciences using a method based on Lie algebras, but this methodology is not widely used for models with ecological, medical and social applications. This paper presents the Lie algebraic method, and applies it to three biologically well motivated examples. The result of this is a solution form that is often highly computationally advantageous.
Institute of Scientific and Technical Information of China (English)
李宝; 周林芳; 肖国镇
1999-01-01
For a class of algebraic-geometric codes, a type of recurring relation is introduced on the syndrome sequence of an error vector. Then, a new majority yoting scheme is developed. By applying the generalized Berlekamp-Massey algorithm, and incorporating the majority voting scheme, an efficient decoding algorithm up to half the Feng-Rao bound is developed for a class of algebraic-geometric codes, the complexity of which is O （ γo1n2）, where n is the code length, and γ is the genus of curve. On different algebraic curves, the complexity of the algorithm can be lowered by choosing base functions suitably. For example, on Hermitian curves the complexity is O(n7/3.
Fernández Núñez, José; García Fuertes, Wifredo; Perelomov, Askold M.
2008-01-01
[EN] We express the Hamiltonian of the quantum trigonometric Calogero-Sutherland model for the Lie algebra E8 and coupling constant k=1 by using the fundamental irreducible characters of the algebra as dynamical independent variables. Then, we compute the second order characters of the algebra and some higher order characters.[ES] Expresamos el hamiltoniano del modelo trigonométrico Calogero-Sutherland cuántico para el álgebra de Lie E8 y el acoplamiento constante k = 1 mediante el uso de los...
Algebraic Stress Model with RNG ε-Equation for Simulating Confined Strongly Swirling Turbulent Flows
Institute of Scientific and Technical Information of China (English)
Xu Jiangrong; Yao Qiang; Cao Xingyu; Cen Kefa
2001-01-01
Strongly swirl flow simulation are still under developing. In this paper, ε equation based on the Renormalization Group theory is used into algebraic stress model. Standard k-ε model, algebraic stress model by Jiang Zhang[5]and present model (RNG-ASM) are applied simultaneously to simulating the confined strongly swirling flow.The Simulating results by RNG-ASM model are compared to the results by other two model, it is shown that the predictions by this model display reasonable agreement with experimental data, and lead to greater improvement than Zhang's ASM turbulence model[5].
A novel hybrid optimization algorithm for diferential-algebraic control problems
Directory of Open Access Journals (Sweden)
F. S. Lobato
2007-09-01
Full Text Available Dynamic optimization problems can be numerically solved by direct, indirect and Hamilton-Jacobi-Bellman methods. In this paper, the differential-algebraic approach is incorporated into a hybrid method, extending the concepts of structural and differential indexes, consistent initialization analysis, index reduction and dynamic degrees of freedom to the optimal control problem. The resultant differential-algebraic optimal control problem is solved in the following steps: transformation of the original problem into a standard nonlinear programming problem that provides control and state variables, switching time estimates and costate variables profiles with the DIRCOL code; definition of the switching function and the automatically generated sequence of index-1 differential-algebraic boundary value problems from Pontryagin’s minimum principle by using the developed Otima code; and finally, application of the COLDAE code with the results of the direct method as an initial guess. The proposed hybrid method is illustrated with a pressure-constrained batch reactor optimization problem associated with the slack variable method.
su(1,2) Algebraic Structure of XYZ Antiferromagnetic Model in Linear Spin-Wave Frame
Institute of Scientific and Technical Information of China (English)
GUAN Yong; JIN Shuo; LIN Bing-Sheng; XIE Bing-Hao; JING Si-Cong; YU Zhao-Xian; HOU Jing-Min
2008-01-01
The XYZ antiferromagnetic model in linear spin-wave frame is shown explicitly to have an su(1,2) aigebraic structure: the Hamiltonian can be written as a linear function of the su(1,2) algebra generators. Based on it, the energy eigenvalues are obtained by making use of the similar transformations, and the algebraic diagonalization method is investigated. Some numerical solutions are given, and the results indicate that only one group solution could be accepted in physics.
Algorithmic Issues in Modeling Motion
DEFF Research Database (Denmark)
Agarwal, P. K; Guibas, L. J; Edelsbrunner, H.
2003-01-01
This article is a survey of research areas in which motion plays a pivotal role. The aim of the article is to review current approaches to modeling motion together with related data structures and algorithms, and to summarize the challenges that lie ahead in producing a more unified theory...
Excel Spreadsheets for Algebra: Improving Mental Modeling for Problem Solving
Engerman, Jason; Rusek, Matthew; Clariana, Roy
2014-01-01
This experiment investigates the effectiveness of Excel spreadsheets in a high school algebra class. Students in the experiment group convincingly outperformed the control group on a post lesson assessment. The student responses, teacher observations involving Excel spreadsheet revealed that it operated as a mindtool, which formed the users'…
Excel Spreadsheets for Algebra: Improving Mental Modeling for Problem Solving
Engerman, Jason; Rusek, Matthew; Clariana, Roy
2014-01-01
This experiment investigates the effectiveness of Excel spreadsheets in a high school algebra class. Students in the experiment group convincingly outperformed the control group on a post lesson assessment. The student responses, teacher observations involving Excel spreadsheet revealed that it operated as a mindtool, which formed the users'…
Symmetric structure of field algebra of G-spin models determined by a normal subgroup
Energy Technology Data Exchange (ETDEWEB)
Xin, Qiaoling, E-mail: xinqiaoling0923@163.com; Jiang, Lining, E-mail: jianglining@bit.edu.cn [School of Mathematics and Statistics, Beijing Institute of Technology, Beijing 100081 (China)
2014-09-15
Let G be a finite group and H a normal subgroup. D(H; G) is the crossed product of C(H) and CG which is only a subalgebra of D(G), the double algebra of G. One can construct a C*-subalgebra F{sub H} of the field algebra F of G-spin models, so that F{sub H} is a D(H; G)-module algebra, whereas F is not. Then the observable algebra A{sub (H,G)} is obtained as the D(H; G)-invariant subalgebra of F{sub H}, and there exists a unique C*-representation of D(H; G) such that D(H; G) and A{sub (H,G)} are commutants with each other.
Investigating modularity in the analysis of process algebra models of biochemical systems
Ciocchetta, Federica; Hillston, Jane; 10.4204/EPTCS.19.4
2010-01-01
Compositionality is a key feature of process algebras which is often cited as one of their advantages as a modelling technique. It is certainly true that in biochemical systems, as in many other systems, model construction is made easier in a formalism which allows the problem to be tackled compositionally. In this paper we consider the extent to which the compositional structure which is inherent in process algebra models of biochemical systems can be exploited during model solution. In essence this means using the compositional structure to guide decomposed solution and analysis. Unfortunately the dynamic behaviour of biochemical systems exhibits strong interdependencies between the components of the model making decomposed solution a difficult task. Nevertheless we believe that if such decomposition based on process algebras could be established it would demonstrate substantial benefits for systems biology modelling. In this paper we present our preliminary investigations based on a case study of the phero...
Rigidification of algebras over essentially algebraic theories
Rosicky, J
2012-01-01
Badzioch and Bergner proved a rigidification theorem saying that each homotopy simplicial algebra is weakly equivalent to a simplicial algebra. The question is whether this result can be extended from algebraic theories to finite limit theories and from simplicial sets to more general monoidal model categories. We will present some answers to this question.
Numerical algorithms in chemistry: algebraic methods. [Workshop, August 9-11, 1978
Energy Technology Data Exchange (ETDEWEB)
Moler, C.; Shavitt, I. (eds.)
1978-08-09
The National Resource for Computation in Chemistry was established to make information on existing and developing computational methodologies available to all segments of the chemistry community, to make state-of-the-art computation facilities accessible to the chemistry community, and to foster research and development of new computational methods for application to chemical problems. Attention was directed to algebraic methods because of their continuing importance in chemical applications. This volume contains digests of the contributions to the workshop of August 9--11, 1978. Presentations were given on eigenvalue problems, linear systems of equations, and integral transformations. One of the papers in this volume was abstracted and indexed separately. (RWR)
Saldarriaga Vargas, Clarita
When there are diseases affecting large populations where the social, economic and cultural diversity is significant within the same region, the biological parameters that determine the behavior of the dispersion disease analysis are affected by the selection of different individuals. Therefore and because of the variety and magnitude of the communities at risk of contracting dengue disease around all over the world, suggest defining differentiated populations with individual contributions in the results of the dispersion dengue disease analysis. In this paper those conditions were taken in account when several epidemiologic models were analyzed. Initially a stability analysis was done for a SEIR mathematical model of Dengue disease without differential susceptibility. Both free disease and endemic equilibrium states were found in terms of the basic reproduction number and were defined in the Theorem (3.1). Then a DSEIR model was solved when a new susceptible group was introduced to consider the effects of important biological parameters of non-homogeneous populations in the spreading analysis. The results were compiled in the Theorem (3.2). Finally Theorems (3.3) and (3.4) resumed the basic reproduction numbers for three and n different susceptible groups respectively, giving an idea of how differential susceptibility affects the equilibrium states. The computations were done using an algorithmic method implemented in Maple 11, a general-purpose computer algebra system.
Galois Correspondence in Field Algebra of G-spin Model
Institute of Scientific and Technical Information of China (English)
蒋立宁; 郭懋正
2003-01-01
@@ A C*-system is a pair (B, G) consisting of a unital C*-algebra B and a continuous group homomorphism α: G → Aut(B) where G is a compact group and Aut(B) the group of automor-phisms of B. If K is a normal subgroup of G and BK = {B∈ B: k(B) = B, k ∈ K}, then BK is a G-invariant C*-subalgebra of B. On the other hand, if A is a G-invariant C*-algebra with BG A B, set G (A) = {g ∈ G: g(A) = A, A ∈ A}, G (A) is a normal subgroup of G. Clearly K G(BK) and we call K Galois closed ifK = G(BK). Similarly, A BG(A) and we call A Galois closed if A = BG(A).
Institute of Scientific and Technical Information of China (English)
无
2010-01-01
We give an equivalent construction of the infinitesimal time translation operator for partial differential evolution equation in the algebraic dynamics algorithm proposed by Shun-Jin Wang and his students. Our construction involves only simple partial differentials and avoids the derivative terms of δ function which appear in the course of computation by means of Wang-Zhang operator. We prove Wang’s equivalent theorem which says that our construction and Wang-Zhang’s are equivalent. We use our construction to deal with several typical equations such as nonlinear advection equation, Burgers equation, nonlinear Schrodinger equation, KdV equation and sine-Gordon equation, and obtain at least second order approximate solutions to them. These equations include the cases of real and complex field variables and the cases of the first and the second order time derivatives.
Reachability for Finite-state Process Algebras Using Horn Clauses
DEFF Research Database (Denmark)
Skrypnyuk, Nataliya; Nielson, Flemming
2013-01-01
In this work we present an algorithm for solving the reachability problem in finite systems that are modelled with process algebras. Our method is based on Static Analysis, in particular, Data Flow Analysis, of the syntax of a process algebraic system with multi-way synchronisation. The results...
Directory of Open Access Journals (Sweden)
Naseem Cassim
2017-02-01
Full Text Available Introduction: CD4 testing in South Africa is based on an integrated tiered service delivery model that matches testing demand with capacity. The National Health Laboratory Service has predominantly implemented laboratory-based CD4 testing. Coverage gaps, over-/under-capacitation and optimal placement of point-of-care (POC testing sites need investigation.Objectives: We assessed the impact of relational algebraic capacitated location (RACL algorithm outcomes on the allocation of laboratory and POC testing sites.Methods: The RACL algorithm was developed to allocate laboratories and POC sites to ensure coverage using a set coverage approach for a defined travel time (T. The algorithm was repeated for three scenarios (A: T = 4; B: T = 3; C: T = 2 hours. Drive times for a representative sample of health facility clusters were used to approximate T. Outcomes included allocation of testing sites, Euclidian distances and test volumes. Additional analysis included platform distribution and space requirement assessment. Scenarios were reported as fusion table maps.Results: Scenario A would offer a fully-centralised approach with 15 CD4 laboratories without any POC testing. A significant increase in volumes would result in a four-fold increase at busier laboratories. CD4 laboratories would increase to 41 in scenario B and 61 in scenario C. POC testing would be offered at two sites in scenario B and 20 sites in scenario C.Conclusion: The RACL algorithm provides an objective methodology to address coverage gaps through the allocation of CD4 laboratories and POC sites for a given T. The algorithm outcomes need to be assessed in the context of local conditions.
Computer algebra and operators
Fateman, Richard; Grossman, Robert
1989-01-01
The symbolic computation of operator expansions is discussed. Some of the capabilities that prove useful when performing computer algebra computations involving operators are considered. These capabilities may be broadly divided into three areas: the algebraic manipulation of expressions from the algebra generated by operators; the algebraic manipulation of the actions of the operators upon other mathematical objects; and the development of appropriate normal forms and simplification algorithms for operators and their actions. Brief descriptions are given of the computer algebra computations that arise when working with various operators and their actions.
Mathematical Modelling and the Learning Trajectory: Tools to Support the Teaching of Linear Algebra
Cárcamo Bahamonde, Andrea Dorila; Fortuny Aymemí, Josep Maria; Gómez i Urgellés, Joan Vicenç
2017-01-01
In this article we present a didactic proposal for teaching linear algebra based on two compatible theoretical models: emergent models and mathematical modelling. This proposal begins with a problematic situation related to the creation and use of secure passwords, which leads students toward the construction of the concepts of spanning set and…
Designing Tasks for Math Modeling in College Algebra: A Critical Review
Staats, Susan; Robertson, Douglas
2014-01-01
Over the last decade, the pedagogical approach known as mathematical modeling has received increased interest in college algebra classes in the United States. Math modeling assignments ask students to develop their own problem-solving tools to address non-routine, realistic scenarios. The open-ended quality of modeling activities creates dilemmas…
Patenting mathematical algorithms : What's the harm? A thought experiment in algebra
de Laat, P.B.
2000-01-01
The patenting of software-related inventions is on the increase, especially in the United States. Mathematical formulas and algorithms, though, are still sacrosanct. Only under special conditions may algorithms qualify as statutory matter: if they are not solely a mathematical exercise, but if they
Institute of Scientific and Technical Information of China (English)
XIE Bing-Hao; ZHANG Hong-Biao; CHEN Jing-Ling
2002-01-01
An algebraic diagonalization method is proposed. As two examples, the Hamiltonians of BCS ground stateunder mean-field approximation and XXZ antiferromagnetic model in linear spin-wave frame have been diagonalized byusing SU(2), SU(1,1) Lie algebraic method, respectively. Meanwhile, the eigenstates of the above two models are revealedto be SU(2), SU(1,1) coherent states, respectively. The relation between the usual Bogoliubov Valatin transformationand the algebraic method in a special case is also discussed.
Direct Model Checking Matrix Algorithm
Institute of Scientific and Technical Information of China (English)
Zhi-Hong Tao; Hans Kleine Büning; Li-Fu Wang
2006-01-01
During the last decade, Model Checking has proven its efficacy and power in circuit design, network protocol analysis and bug hunting. Recent research on automatic verification has shown that no single model-checking technique has the edge over all others in all application areas. So, it is very difficult to determine which technique is the most suitable for a given model. It is thus sensible to apply different techniques to the same model. However, this is a very tedious and time-consuming task, for each algorithm uses its own description language. Applying Model Checking in software design and verification has been proved very difficult. Software architectures (SA) are engineering artifacts that provide high-level and abstract descriptions of complex software systems. In this paper a Direct Model Checking (DMC) method based on Kripke Structure and Matrix Algorithm is provided. Combined and integrated with domain specific software architecture description languages (ADLs), DMC can be used for computing consistency and other critical properties.
Complex fluids modeling and algorithms
Saramito, Pierre
2016-01-01
This book presents a comprehensive overview of the modeling of complex fluids, including many common substances, such as toothpaste, hair gel, mayonnaise, liquid foam, cement and blood, which cannot be described by Navier-Stokes equations. It also offers an up-to-date mathematical and numerical analysis of the corresponding equations, as well as several practical numerical algorithms and software solutions for the approximation of the solutions. It discusses industrial (molten plastics, forming process), geophysical (mud flows, volcanic lava, glaciers and snow avalanches), and biological (blood flows, tissues) modeling applications. This book is a valuable resource for undergraduate students and researchers in applied mathematics, mechanical engineering and physics.
Model Checking Process Algebra of Communicating Resources for Real-time Systems
DEFF Research Database (Denmark)
Boudjadar, Jalil; Kim, Jin Hyun; Larsen, Kim Guldstrand
2014-01-01
and resource usage over a dense-time model. The semantic interpretation of PACOR is defined in the form of a timed transition system expressing the timed behavior and dynamic creation of processes. We define a translation of PACOR systems to Parameterized Stopwatch Automata (PSA). The translation preserves......This paper presents a new process algebra, called PACOR, for real-time systems which deals with resource constrained timed behavior as an improved version of the ACSR algebra. We define PACOR as a Process Algebra of Communicating Resources which allows to express preemptiveness, urgent ness...... the original semantics of PACOR and enables the verification of PACOR systems using symbolic model checking in UPPAAL and statistical model checking UPPAAL SMC. Finally we provide an example to illustrate system specification in PACOR, translation and verification....
Model checking process algebra of communicating resources for real-time systems
DEFF Research Database (Denmark)
Boudjadar, Jalil; Kim, Jin Hyun; Larsen, Kim Guldstrand
2014-01-01
, urgentness and resource usage over a dense-time model. The semantic interpretation of PACoR is defined in the form of a timed transition system expressing the timed behavior and dynamic creation of processes. We define a translation of PACoR systems to Parameterized Stopwatch Automata (PSA). The translation......This paper presents a new process algebra, called PACoR, for real-time systems which deals with resource- constrained timed behavior as an improved version of the ACSR algebra. We define PACoR as a Process Algebra of Communicating Resources which allows to explicitly express preemptiveness...... preserves the original semantics of PACoR and enables the verification of PACoR systems using symbolic model checking in Uppaal and statistical model checking UppaalSMC. Finally we provide an example to illustrate system specification in PACoR, translation and verification....
Mathematical modelling in engineering: A proposal to introduce linear algebra concepts
Directory of Open Access Journals (Sweden)
Andrea Dorila Cárcamo
2016-03-01
Full Text Available The modern dynamic world requires that basic science courses for engineering, including linear algebra, emphasize the development of mathematical abilities primarily associated with modelling and interpreting, which aren´t limited only to calculus abilities. Considering this, an instructional design was elaborated based on mathematic modelling and emerging heuristic models for the construction of specific linear algebra concepts: span and spanning set. This was applied to first year engineering students. Results suggest that this type of instructional design contributes to the construction of these mathematical concepts and can also favour first year engineering students understanding of key linear algebra concepts and potentiate the development of higher order skills.
The algebraic Bethe ansatz for rational braid-monoid lattice models
Martins, M J
1997-01-01
In this paper we study isotropic integrable systems based on the braid-monoid algebra. These systems constitute a large family of rational multistate vertex models and are realized in terms of the B_n, C_n and D_n Lie algebra and by the superalgebra Osp(n|2m). We present a unified formulation of the quantum inverse scattering method for many of these lattice models. The appropriate fundamental commutation rules are found, allowing us to construct the eigenvectors and the eigenvalues of the transfer matrix associated to the B_n, C_n, D_n, Osp(2n-1|2), Osp(2|2n-2), Osp(2n-2|2) and Osp(1|2n) models. The corresponding Bethe Ansatz equations can be formulated in terms of the root structure of the underlying algebra.
AN ADA LINEAR ALGEBRA PACKAGE MODELED AFTER HAL/S
Klumpp, A. R.
1994-01-01
This package extends the Ada programming language to include linear algebra capabilities similar to those of the HAL/S programming language. The package is designed for avionics applications such as Space Station flight software. In addition to the HAL/S built-in functions, the package incorporates the quaternion functions used in the Shuttle and Galileo projects, and routines from LINPAK that solve systems of equations involving general square matrices. Language conventions in this package follow those of HAL/S to the maximum extent practical and minimize the effort required for writing new avionics software and translating existent software into Ada. Valid numeric types in this package include scalar, vector, matrix, and quaternion declarations. (Quaternions are fourcomponent vectors used in representing motion between two coordinate frames). Single precision and double precision floating point arithmetic is available in addition to the standard double precision integer manipulation. Infix operators are used instead of function calls to define dot products, cross products, quaternion products, and mixed scalar-vector, scalar-matrix, and vector-matrix products. The package contains two generic programs: one for floating point, and one for integer. The actual component type is passed as a formal parameter to the generic linear algebra package. The procedures for solving systems of linear equations defined by general matrices include GEFA, GECO, GESL, and GIDI. The HAL/S functions include ABVAL, UNIT, TRACE, DET, INVERSE, TRANSPOSE, GET, PUT, FETCH, PLACE, and IDENTITY. This package is written in Ada (Version 1.2) for batch execution and is machine independent. The linear algebra software depends on nothing outside the Ada language except for a call to a square root function for floating point scalars (such as SQRT in the DEC VAX MATHLIB library). This program was developed in 1989, and is a copyrighted work with all copyright vested in NASA.
An algebraic model of Coulomb scattering with spin
Energy Technology Data Exchange (ETDEWEB)
Levay, P. [School of Physics, University of Melbourne, Parkville (Australia); Department of Theoretical Physics, Institute of Physics, Technical University, Budapest (Hungary); Amos, K. [School of Physics, University of Melbourne, Parkville (Australia)
2001-05-11
A new matrix-valued realization for the so(3,1) algebra leads to a natural generalization of the Coulomb scattering problem of a particle with spin. The underlying su(2) gauge structure of this realization recasts the scattering problem into a familiar form, namely, the Coulomb scattering problem of a collection of dyons (particles having both electric and magnetic charges). Using this equivalent form and the results of Zwanziger for such systems, the scattering matrix can be calculated in the helicity formalism. (author)
The algebraic cluster model: Structure of 16O
Bijker, R.; Iachello, F.
2017-01-01
We discuss an algebraic treatment of four-body clusters which includes both continuous and discrete symmetries. In particular, tetrahedral configurations with Td symmetry are analyzed with respect to the energy spectrum, transition form factors and B (EL) values. It is concluded that the low-lying spectrum of 16O can be described by four α particles at the vertices of a regular tetrahedron, not as a rigid structure but rather a more floppy structure with relatively large rotation-vibration interactions and Coriolis forces.
The Algebraic Cluster Model: Structure of 16O
Bijker, R
2016-01-01
We discuss an algebraic treatment of four-body clusters which includes both continuous and discrete symmetries. In particular, tetrahedral configurations with T(d) symmetry are analyzed with respect to the energy spectrum, transition form factors and B(EL) values. It is concluded that the low-lying spectrum of 16O can be described by four alpha-particles at the vertices of a regular tetrahedron, not as a rigid structure but rather a more floppy structure with relatively large rotation-vibration interactions and Coriolis forces.
de Brito, G P; Gomes, Y M P; Junior, J T Guaitolini; Nikoofard, V
2016-01-01
In this paper we introduce a modified covariant quantum algebra based in the so-called Quesne-Tkachuk algebra. By means of a deformation procedure we arrive at a class of higher derivative models of gravity. The study of the particle spectra of these models reveals an equivalence with the physical content of the well-known renormalizable and super-renormalizable higher derivative gravities. The particle spectrum exhibits the presence of spurious complex ghosts and, in light of this problem, we suggest an interesting interpretation in the context of minimal length theories. Also, a discussion regarding the non-relativistic potential energy is proposed.
Algebraic Specifications, Higher-order Types and Set-theoretic Models
DEFF Research Database (Denmark)
Kirchner, Hélène; Mosses, Peter David
2001-01-01
, and power-sets. This paper presents a simple framework for algebraic specifications with higher-order types and set-theoretic models. It may be regarded as the basis for a Horn-clause approximation to the Z framework, and has the advantage of being amenable to prototyping and automated reasoning. Standard......In most algebraic specification frameworks, the type system is restricted to sorts, subsorts, and first-order function types. This is in marked contrast to the so-called model-oriented frameworks, which provide higer-order types, interpreted set-theoretically as Cartesian products, function spaces...
Shafarevich, I
1994-01-01
This book, the first printing of which was published as volume 38 of the Encyclopaedia of Mathematical Sciences, presents a modern approach to homological algebra, based on the systematic use of the terminology and ideas of derived categories and derived functors. The book contains applications of homological algebra to the theory of sheaves on topological spaces, to Hodge theory, and to the theory of modules over rings of algebraic differential operators (algebraic D-modules). The authors Gelfand and Manin explain all the main ideas of the theory of derived categories. Both authors are well-known researchers and the second, Manin, is famous for his work in algebraic geometry and mathematical physics. The book is an excellent reference for graduate students and researchers in mathematics and also for physicists who use methods from algebraic geometry and algebraic topology.
A Lie-Algebra model for a noncommutative space time geometry
Doerfel, B D
2002-01-01
We propose a Lie-algebra model for noncommutative coordinate and momentum space . Based on a rigid commutation relation for the commutators of space time operators the model is quite constrained if one tries to keep Lorentz invariance as much as possible. We discuss the question of invariants esp. the definition of a mass.
Algebraic Bethe Ansatz Solution to CN Vertex Model with Open Boundary Conditions
Institute of Scientific and Technical Information of China (English)
LI Guang-Liang; SHI Kang-Jie; YUE Rui-Hong
2005-01-01
We present three diagonal reflecting matrices for the CN vertex model with open boundary conditions and exactly solve the model by using the algebraic Bethe ansatz. The eigenvector is constructed and the eigenvalue and the associated Bethe equations are achieved. All the unwanted terms are cancelled out by three kinds of identities.
Construction of the Model of the Lambda Calculus System with Algebraic Operators
Institute of Scientific and Technical Information of China (English)
陆汝占; 张政; 等
1991-01-01
A lambda system with algebraic operators,Lambda-plus system,is introduced.After giving the definitions of the system,we present a sufficient condition for formulating a model of the system.Finally,a model of such system is constructed.
Mathematical modelling in engineering: an alternative way to teach Linear Algebra
Domínguez-García, S.; García-Planas, M. I.; Taberna, J.
2016-10-01
Technological advances require that basic science courses for engineering, including Linear Algebra, emphasize the development of mathematical strengths associated with modelling and interpretation of results, which are not limited only to calculus abilities. Based on this consideration, we have proposed a project-based learning, giving a dynamic classroom approach in which students modelled real-world problems and turn gain a deeper knowledge of the Linear Algebra subject. Considering that most students are digital natives, we use the e-portfolio as a tool of communication between students and teachers, besides being a good place making the work visible. In this article, we present an overview of the design and implementation of a project-based learning for a Linear Algebra course taught during the 2014-2015 at the 'ETSEIB'of Universitat Politècnica de Catalunya (UPC).
Hopf Algebra Structure of a Model Quantum Field Theory
Solomon, A I; Blasiak, P; Horzela, A; Penson, K A
2006-01-01
Recent elegant work on the structure of Perturbative Quantum Field Theory (PQFT) has revealed an astonishing interplay between analysis(Riemann Zeta functions), topology (Knot theory), combinatorial graph theory (Feynman Diagrams) and algebra (Hopf structure). The difficulty inherent in the complexities of a fully-fledged field theory such as PQFT means that the essential beauty of the relationships between these areas can be somewhat obscured. Our intention is to display some, although not all, of these structures in the context of a simple zero-dimensional field theory; i.e. a quantum theory of non-commuting operators which do not depend on spacetime. The combinatorial properties of these boson creation and annihilation operators, which is our chosen example, may be described by graphs, analogous to the Feynman diagrams of PQFT, which we show possess a Hopf algebra structure. Our approach is based on the partition function for a boson gas. In a subsequent note in these Proceedings we sketch the relationship...
Algorithms for computer algebra calculations in spacetime; 1, the calculation of curvature
Pollney, D; Santosuosso, K; Lake, K; Pollney, Denis; Musgrave, Peter; Santosuosso, Kevin; Lake, Kayll
1996-01-01
We examine the relative performance of algorithms for the calculation of curvature in spacetime. The classical coordinate component method is compared to two distinct versions of the Newman-Penrose tetrad approach for a variety of spacetimes, and distinct coordinates and tetrads for a given spacetime. Within the system GRTensorII, we find that there is no single preferred approach on the basis of speed. Rather, we find that the fastest algorithm is the one that minimizes the amount of time spent on simplification. This means that arguments concerning the theoretical superiority of an algorithm need not translate into superior performance when applied to a specific spacetime calculation. In all cases it is the global simplification strategy which is of paramount importance. An appropriate simplification strategy can change an untractable problem into one which can be solved essentially instantaneously.
Bizi, Nadir; Besnard, Fabien
2016-01-01
An analogy with real Clifford algebras on even-dimensional vector spaces suggests to assign a space dimension and a time dimension (modulo 8) to an algebra (represented over a complex Hilbert space) containing two self-adjoint involutions and an anti-unitary operator with specific commutation relations. It is shown that this assignment is compatible with the tensor product, in the sense that a tensor product of such algebras corresponds to the addition of the space and time dimensions. This could provide an interpretation of the presence of such algebras in PT-symmetric Hamiltonians or the description of topological matter. This construction is used to build the tensor product of Lorentzian (and more generally pseudo-Riemannian) spectral triples, defined over a Krein space. The application to the standard model of particles suggests the identity of the time and space dimensions of the total (manifold+finite algebra) spectral triple. It also suggests the emergence of the pseudo-orthogonal group SO(4,6) in a gr...
Forward error correction based on algebraic-geometric theory
A Alzubi, Jafar; M Chen, Thomas
2014-01-01
This book covers the design, construction, and implementation of algebraic-geometric codes from Hermitian curves. Matlab simulations of algebraic-geometric codes and Reed-Solomon codes compare their bit error rate using different modulation schemes over additive white Gaussian noise channel model. Simulation results of Algebraic-geometric codes bit error rate performance using quadrature amplitude modulation (16QAM and 64QAM) are presented for the first time and shown to outperform Reed-Solomon codes at various code rates and channel models. The book proposes algebraic-geometric block turbo codes. It also presents simulation results that show an improved bit error rate performance at the cost of high system complexity due to using algebraic-geometric codes and Chase-Pyndiah’s algorithm simultaneously. The book proposes algebraic-geometric irregular block turbo codes (AG-IBTC) to reduce system complexity. Simulation results for AG-IBTCs are presented for the first time.
Left Artinian Algebraic Algebras
Institute of Scientific and Technical Information of China (English)
S. Akbari; M. Arian-Nejad
2001-01-01
Let R be a left artinian central F-algebra, T(R) = J(R) + [R, R],and U(R) the group of units of R. As one of our results, we show that, if R is algebraic and char F = 0, then the number of simple components of -R = R/J(R)is greater than or equal to dimF R/T(R). We show that, when char F = 0 or F is uncountable, R is algebraic over F if and only if [R, R] is algebraic over F. As another approach, we prove that R is algebraic over F if and only if the derived subgroup of U(R) is algebraic over F. Also, we present an elementary proof for a special case of an old question due to Jacobson.
Using computer algebra and SMT-solvers to analyze a mathematical model of cholera propagation
Trujillo Arredondo, Mariana
2014-06-01
We analyze a mathematical model for the transmission of cholera. The model is already defined and involves variables such as the pathogen agent, which in this case is the bacterium Vibrio cholera, and the human population. The human population is divided into three classes: susceptible, infectious and removed. Using Computer Algebra, specifically Maple we obtain two equilibrium states: the disease free state and the endemic state. Using Maple it is possible to prove that the disease free state is locally asymptotically stable if and only if R0 1. Using the package Red-Log of the Computer algebra system Reduce and the SMT-Solver Z3Py it is possible to obtain numerical conditions for the model. The formula for the basic reproductive number makes a synthesis with all epidemic parameters in the model. Also it is possible to make numerical simulations which are very illustrative about the epidemic patters that are expected to be observed in real situations. We claim that these kinds of software are very useful in the analysis of epidemic models given that the symbolic computation provides algebraic formulas for the basic reproductive number and such algebraic formulas are very useful to derive control measures. For other side, computer algebra software is a powerful tool to make the stability analysis for epidemic models given that the all steps in the stability analysis can be made automatically: finding the equilibrium points, computing the jacobian, computing the characteristic polynomial for the jacobian, and applying the Routh-Hurwitz theorem to the characteristic polynomial. Finally, using SMT-Solvers is possible to make automatically checks of satisfiability, validity and quantifiers elimination being these computations very useful to analyse complicated epidemic models.
Algebraic partial Boolean algebras
Energy Technology Data Exchange (ETDEWEB)
Smith, Derek [Math Department, Lafayette College, Easton, PA 18042 (United States)
2003-04-04
Partial Boolean algebras, first studied by Kochen and Specker in the 1960s, provide the structure for Bell-Kochen-Specker theorems which deny the existence of non-contextual hidden variable theories. In this paper, we study partial Boolean algebras which are 'algebraic' in the sense that their elements have coordinates in an algebraic number field. Several of these algebras have been discussed recently in a debate on the validity of Bell-Kochen-Specker theorems in the context of finite precision measurements. The main result of this paper is that every algebraic finitely-generated partial Boolean algebra B(T) is finite when the underlying space H is three-dimensional, answering a question of Kochen and showing that Conway and Kochen's infinite algebraic partial Boolean algebra has minimum dimension. This result contrasts the existence of an infinite (non-algebraic) B(T) generated by eight elements in an abstract orthomodular lattice of height 3. We then initiate a study of higher-dimensional algebraic partial Boolean algebras. First, we describe a restriction on the determinants of the elements of B(T) that are generated by a given set T. We then show that when the generating set T consists of the rays spanning the minimal vectors in a real irreducible root lattice, B(T) is infinite just if that root lattice has an A{sub 5} sublattice. Finally, we characterize the rays of B(T) when T consists of the rays spanning the minimal vectors of the root lattice E{sub 8}.
Pramanik, Souvik; Ghosh, Subir
2013-10-01
We have developed a unified scheme for studying noncommutative algebras based on generalized uncertainty principle (GUP) and Snyder form in a relativistically covariant point particle Lagrangian (or symplectic) framework. Even though the GUP-based algebra and Snyder algebra are very distinct, the more involved latter algebra emerges from an approximation of the Lagrangian model of the former algebra. Deformed Poincaré generators for the systems that keep space-time symmetries of the relativistic particle models have been studied thoroughly. From a purely constrained dynamical analysis perspective the models studied here are very rich and provide insights on how to consistently construct approximate models from the exact ones when nonlinear constraints are present in the system. We also study dynamics of the GUP particle in presence of external electromagnetic field.
Elliptic Algebra and Integrable Models for Solitons on Noncommutative Torus ${\\cal T}$
Hou, B Y; Hou, Bo-Yu; Peng, Dan-Tao
2002-01-01
We study the algebra ${\\cal A}_n$ and the basis of the Hilbert space ${\\cal H}_n$ in terms of the $\\theta$ functions of the positions of $n$ solitons. Then we embed the Heisenberg group as the quantum operator factors in the representation of the transfer matrice of various integrable models. Finally we generalize our result to the generic $\\theta$ case.
Elliptic Algebra and Integrable Models for Solitons on Noncommutative Torus {T}
Hou, Bo-Yu; Peng, Dan-Tao
2002-11-01
We study the algebra {A}n, the basis of the Hilbert space {H}n in terms of θ functions of the positions of n solitons. Then we embed the Heisenberg group as the quantum operator factors in the representation of the transfer matrices of various integrable models. Finally we generalize our result to the generic θ case.
Elliptic Algebra and Integrable Models for Solitons on Noncommutative Torus T
Hou, Bo-Yu; Peng, Dan-Tao
We study the algebra An, the basis of the Hilbert space Hn in terms of θ functions of the positions of n solitons. Then we embed the Heisenberg group as the quantum operator factors in the representation of the transfer matrices of various integrable models. Finally we generalize our result to the generic θ case.
Mathematical Modelling in Engineering: An Alternative Way to Teach Linear Algebra
Domínguez-García, S.; García-Planas, M. I.; Taberna, J.
2016-01-01
Technological advances require that basic science courses for engineering, including Linear Algebra, emphasize the development of mathematical strengths associated with modelling and interpretation of results, which are not limited only to calculus abilities. Based on this consideration, we have proposed a project-based learning, giving a dynamic…
Implementing a Flipped Instructional Model in College Algebra: Profiles of Student Activity
Lesseig, Kristin; Krouss, Paul
2017-01-01
Flipped instruction is increasing in popularity, however research that moves beyond descriptions of its implementation in mathematics classes is lacking. We sought to better understand how students taking an introductory college algebra course used the resources provided within a flipped instructional model and how students viewed such resources…
Algebraic Bethe Ansatz for O(2N) sigma models with integrable diagonal boundaries
Gombor, Tamas
2015-01-01
The finite volume problem of O(2N) sigma models with integrable diagonal boundaries on a finite interval is investigated. The double row transfer matrix is diagonalized by Algebraic Bethe Ansatz. The boundary Bethe Yang equations for the particle rapidities and the accompanying Bethe Ansatz equations are derived.
Bergstra, J.A.; Fokkink, W.J.; Middelburg, C.A.
2008-01-01
Timed frames are introduced as objects that can form a basis of a model theory for discrete time process algebra. An algebraic setting for timed frames is proposed and results concerning its connection with discrete time process algebra are given. The presented theory of timed frames captures the ba
Mulligan, Jeffrey B.
2017-01-01
A color algebra refers to a system for computing sums and products of colors, analogous to additive and subtractive color mixtures. We would like it to match the well-defined algebra of spectral functions describing lights and surface reflectances, but an exact correspondence is impossible after the spectra have been projected to a three-dimensional color space, because of metamerism physically different spectra can produce the same color sensation. Metameric spectra are interchangeable for the purposes of addition, but not multiplication, so any color algebra is necessarily an approximation to physical reality. Nevertheless, because the majority of naturally-occurring spectra are well-behaved (e.g., continuous and slowly-varying), color algebras can be formulated that are largely accurate and agree well with human intuition. Here we explore the family of algebras that result from associating each color with a member of a three-dimensional manifold of spectra. This association can be used to construct a color product, defined as the color of the spectrum of the wavelength-wise product of the spectra associated with the two input colors. The choice of the spectral manifold determines the behavior of the resulting system, and certain special subspaces allow computational efficiencies. The resulting systems can be used to improve computer graphic rendering techniques, and to model various perceptual phenomena such as color constancy.
Combinatorics of solvable lattice models, and modular representations of Hecke algebras
Foda, O E; Okado, M; Thibon, J Y; Welsh, Trevor A; Foda, Omar; Leclerc, Bernard; Okado, Masato; Thibon, Jean-Yves; Welsh, Trevor A.
1997-01-01
We review and motivate recently-observed relationships between exactly solvable lattice models and modular representations of Hecke algebras. Firstly, we describe how the set of $n$-regular partitions label both of the following classes of objects: 1. The spectrum of unrestricted solid-on-solid lattice models based on level-1 representations of the affine algebras $\\sl_n$, 2. The irreducible representations of type-A Hecke algebras at roots of unity: $H_m(\\sqrt[n]{1})$. Secondly, we show that a certain subset of the $n$-regular partitions label both of the following classes of objects: 1. The spectrum of restricted solid-on-solid lattice models based on cosets of affine algebras $(sl(n)^_1 \\times sl(n)^_1)/ sl(n)^_2$. 2. Jantzen-Seitz (JS) representations of $H_m(\\sqrt[n]{1})$: irreducible representations that remain irreducible under restriction to $H_{m-1}(\\sqrt[n]{1})$. Using the above relationships, we characterise the JS representations of $H_m(\\sqrt[n]{1})$ and show that the generating series that count...
Singh, S; Modi, S; Bagga, D; Kaur, P; Shankar, L R; Khushu, S
2013-03-01
The present study aimed to investigate whether brain morphological differences exist between adult hypothyroid subjects and age-matched controls using voxel-based morphometry (VBM) with diffeomorphic anatomic registration via an exponentiated lie algebra algorithm (DARTEL) approach. High-resolution structural magnetic resonance images were taken in ten healthy controls and ten hypothyroid subjects. The analysis was conducted using statistical parametric mapping. The VBM study revealed a reduction in grey matter volume in the left postcentral gyrus and cerebellum of hypothyroid subjects compared to controls. A significant reduction in white matter volume was also found in the cerebellum, right inferior and middle frontal gyrus, right precentral gyrus, right inferior occipital gyrus and right temporal gyrus of hypothyroid patients compared to healthy controls. Moreover, no meaningful cluster for greater grey or white matter volume was obtained in hypothyroid subjects compared to controls. Our study is the first VBM study of hypothyroidism in an adult population and suggests that, compared to controls, this disorder is associated with differences in brain morphology in areas corresponding to known functional deficits in attention, language, motor speed, visuospatial processing and memory in hypothyroidism.
Performance of parallel linear algebra algorithms on an interleaved array processor
Energy Technology Data Exchange (ETDEWEB)
Wolf, G.
1986-01-01
This thesis investigates the performance of numerical algorithms that take advantage of the unique properties of a new type of array processor. This processor, called an Interleaved Array Processor (IAP), is characterized by its ability to use multiple Programmable Functional Units (PFU's) with local data and instruction memories. Unlike conventional array processors, which can only execute simple arithmetic vector operations such as addition and multiplication, the IAP can execute complex vector operations defined by the user. These operations are specified by small programs that can contain conditional branching as well as arithmetic and data movement instructions in each processor. The author calls these programs High-Level Vector Operations (HLVO's). Ways to partition the algorithms and the data among the processing units in the system are presented so that in such a way that the computation time in every processing unit is increased, and at the same time the data movement on the system bus, is reduced. In this way the bus can be timeshared among several functional units, allowing several operations on different vector components to be executed simultaneously and overlapped with the transfer of operands and results.
The bounded model property via step algebras and step frames
Bezhanishvili, N.; Ghilardi, S.
2014-01-01
The paper introduces semantic and algorithmic methods for establishing a variant of the analytic subformula property (called ‘the bounded proof property’, bpp) for modal propositional logics. The bpp is much weaker property than full cut-elimination, but it is nevertheless sufficient for establishin
Lopez, Cesar
2014-01-01
MATLAB is a high-level language and environment for numerical computation, visualization, and programming. Using MATLAB, you can analyze data, develop algorithms, and create models and applications. The language, tools, and built-in math functions enable you to explore multiple approaches and reach a solution faster than with spreadsheets or traditional programming languages, such as C/C++ or Java. MATLAB Linear Algebra introduces you to the MATLAB language with practical hands-on instructions and results, allowing you to quickly achieve your goals. In addition to giving an introduction to
Algebraic approach to electro-optic modulation of light: Exactly solvable multimode quantum model
Miroshnichenko, George P; Trifanov, Alexander I; Gleim, Artur V
2016-01-01
We theoretically study electro-optic light modulation based on the quantum model where the linear electro-optic effect and the externally applied microwave field result in the interaction between optical cavity modes. The model assumes that the number of interacting modes is finite and effects of the mode overlapping coefficient on the strength of the intermode interaction can be taken into account through dependence of the coupling coefficient on the mode characteristics. We show that, under certain conditions, the model is exactly solvable and, in the semiclassical approximation where the microwave field is treated as a classical mode, can be analyzed using the technique of the Jordan mappings for the su(2) Lie algebra. Analytical results are applied to study effects of light modulation on the frequency dependence of the photon counting rate. We also establish the conditions of validity of the semiclassical approximation by applying the methods of polynomially deformed Lie algebras for analysis of the model...
A computer code for calculations in the algebraic collective model of the atomic nucleus
Welsh, T A
2016-01-01
A Maple code is presented for algebraic collective model (ACM) calculations. The ACM is an algebraic version of the Bohr model of the atomic nucleus, in which all required matrix elements are derived by exploiting the model's SU(1,1) x SO(5) dynamical group. This, in particular, obviates the use of coefficients of fractional parentage. This paper reviews the mathematical formulation of the ACM, and serves as a manual for the code. The code makes use of expressions for matrix elements derived elsewhere and newly derived matrix elements of the operators [pi x q x pi]_0 and [pi x pi]_{LM}, where q_M are the model's quadrupole moments, and pi_N are corresponding conjugate momenta (-2>=M,N<=2). The code also provides ready access to SO(3)-reduced SO(5) Clebsch-Gordan coefficients through data files provided with the code.
Algorithms and Methods for High-Performance Model Predictive Control
DEFF Research Database (Denmark)
Frison, Gianluca
routines employed in the numerical tests. The main focus of this thesis is on linear MPC problems. In this thesis, both the algorithms and their implementation are equally important. About the implementation, a novel implementation strategy for the dense linear algebra routines in embedded optimization...... is proposed, aiming at improving the computational performance in case of small matrices. About the algorithms, they are built on top of the proposed linear algebra, and they are tailored to exploit the high-level structure of the MPC problems, with special care on reducing the computational complexity....
Aspects of U-duality in BLG models with Lorentzian metric 3-algebras
Kobo, Takayuki; Shiba, Shotaro
2009-01-01
In our previous paper, it was shown that BLG model based on a Lorentzian metric 3-algebra gives Dp-brane action whose worldvolume is compactified on torus T^d (d=p-2). Here the 3-algebra was a generalized one with d+1 pairs of Lorentzian metric generators and expressed in terms of a loop algebra with central extensions. In this paper, we derive the precise relation between the coupling constant of the super Yang-Mills, the moduli of T^d and some R-R flux with VEV's of ghost fields associated with Lorentzian metric generators. In particular, for d=1, we derive the Yang-Mills action with theta term and show that SL(2,Z) Montonen-Olive duality is realized as the rotation of two VEV's. Furthermore, some moduli parameters such as NS-NS 2-form flux are identified as the deformation parameters of the 3-algebras. By combining them, we recover most of the moduli parameters which are required by U-duality symmetry.
Zhang, Yi; Gabr, Refaat E; Schär, Michael; Weiss, Robert G; Bottomley, Paul A
2012-05-01
Speed and signal-to-noise ratio (SNR) are critical for localized magnetic resonance spectroscopy (MRS) of low-concentration metabolites. Matching voxels to anatomical compartments a priori yields better SNR than the spectra created by summing signals from constituent chemical-shift-imaging (CSI) voxels post-acquisition. Here, a new method of localized Spectroscopy using Linear Algebraic Modeling (SLAM) is presented, that can realize this additional SNR gain. Unlike prior methods, SLAM generates spectra from C signal-generating anatomic compartments utilizing a CSI sequence wherein essentially only the C central k-space phase-encoding gradient steps with highest SNR are retained. After MRI-based compartment segmentation, the spectra are reconstructed by solving a sub-set of linear simultaneous equations from the standard CSI algorithm. SLAM is demonstrated with one-dimensional CSI surface coil phosphorus MRS in phantoms, the human leg and the heart on a 3T clinical scanner. Its SNR performance, accuracy, sensitivity to registration errors and inhomogeneity, are evaluated. Compared to one-dimensional CSI, SLAM yielded quantitatively the same results 4-times faster in 24 cardiac patients and healthy subjects. SLAM is further extended with fractional phase-encoding gradients that optimize SNR and/or minimize both inter- and intra-compartmental contamination. In proactive cardiac phosphorus MRS of six healthy subjects, both SLAM and fractional-SLAM (fSLAM) produced results indistinguishable from CSI while preserving SNR gains of 36-45% in the same scan-time. Both SLAM and fSLAM are simple to implement and reduce the minimum scan-time for CSI, which otherwise limits the translation of higher SNR achievable at higher field strengths to faster scanning.
Zhang, Yi; Gabr, Refaat E.; Schär, Michael; Weiss, Robert G.; Bottomley, Paul A.
2012-05-01
Speed and signal-to-noise ratio (SNR) are critical for localized magnetic resonance spectroscopy (MRS) of low-concentration metabolites. Matching voxels to anatomical compartments a priori yields better SNR than the spectra created by summing signals from constituent chemical-shift-imaging (CSI) voxels post-acquisition. Here, a new method of localized Spectroscopy using Linear Algebraic Modeling (SLAM) is presented, that can realize this additional SNR gain. Unlike prior methods, SLAM generates spectra from C signal-generating anatomic compartments utilizing a CSI sequence wherein essentially only the C central k-space phase-encoding gradient steps with highest SNR are retained. After MRI-based compartment segmentation, the spectra are reconstructed by solving a sub-set of linear simultaneous equations from the standard CSI algorithm. SLAM is demonstrated with one-dimensional CSI surface coil phosphorus MRS in phantoms, the human leg and the heart on a 3T clinical scanner. Its SNR performance, accuracy, sensitivity to registration errors and inhomogeneity, are evaluated. Compared to one-dimensional CSI, SLAM yielded quantitatively the same results 4-times faster in 24 cardiac patients and healthy subjects. SLAM is further extended with fractional phase-encoding gradients that optimize SNR and/or minimize both inter- and intra-compartmental contamination. In proactive cardiac phosphorus MRS of six healthy subjects, both SLAM and fractional-SLAM (fSLAM) produced results indistinguishable from CSI while preserving SNR gains of 36-45% in the same scan-time. Both SLAM and fSLAM are simple to implement and reduce the minimum scan-time for CSI, which otherwise limits the translation of higher SNR achievable at higher field strengths to faster scanning.
Evaluation of global synchronization for iterative algebra algorithms on many-core
ul Hasan Khan, Ayaz
2015-06-01
© 2015 IEEE. Massively parallel computing is applied extensively in various scientific and engineering domains. With the growing interest in many-core architectures and due to the lack of explicit support for inter-block synchronization specifically in GPUs, synchronization becomes necessary to minimize inter-block communication time. In this paper, we have proposed two new inter-block synchronization techniques: 1) Relaxed Synchronization, and 2) Block-Query Synchronization. These schemes are used in implementing numerical iterative solvers where computation/communication overlapping is one used optimization to enhance application performance. We have evaluated and analyzed the performance of the proposed synchronization techniques using Jacobi Iterative Solver in comparison to the state of the art inter-block lock-free synchronization techniques. We have achieved about 1-8% performance improvement in terms of execution time over lock-free synchronization depending on the problem size and the number of thread blocks. We have also evaluated the proposed algorithm on GPU and MIC architectures and obtained about 8-26% performance improvement over the barrier synchronization available in OpenMP programming environment depending on the problem size and number of cores used.
Lectures on algebraic statistics
Drton, Mathias; Sullivant, Seth
2009-01-01
How does an algebraic geometer studying secant varieties further the understanding of hypothesis tests in statistics? Why would a statistician working on factor analysis raise open problems about determinantal varieties? Connections of this type are at the heart of the new field of "algebraic statistics". In this field, mathematicians and statisticians come together to solve statistical inference problems using concepts from algebraic geometry as well as related computational and combinatorial techniques. The goal of these lectures is to introduce newcomers from the different camps to algebraic statistics. The introduction will be centered around the following three observations: many important statistical models correspond to algebraic or semi-algebraic sets of parameters; the geometry of these parameter spaces determines the behaviour of widely used statistical inference procedures; computational algebraic geometry can be used to study parameter spaces and other features of statistical models.
Modeling and Engineering Algorithms for Mobile Data
DEFF Research Database (Denmark)
Blunck, Henrik; Hinrichs, Klaus; Sondern, Joëlle;
2006-01-01
In this paper, we present an object-oriented approach to modeling mobile data and algorithms operating on such data. Our model is general enough to capture any kind of continuous motion while at the same time allowing for encompassing algorithms optimized for specific types of motion. Such motion...
Lefschetz, Solomon
2005-01-01
An introduction to algebraic geometry and a bridge between its analytical-topological and algebraical aspects, this text for advanced undergraduate students is particularly relevant to those more familiar with analysis than algebra. 1953 edition.
Intrinsic and collective structure of an algebraic model of molecular rotation-vibration spectra
Energy Technology Data Exchange (ETDEWEB)
Leviatan, A.; Kirson, M.W.
1988-11-15
A geometrical framework is provided for a recently proposed interacting boson model of molecular rotation-vibration spectra. An intrinsic state is defined by way of a boson condensate parametrized in terms of shape variables and is used to generate an energy surface. The global minimum of the energy surface determines an equilibrium condensate which serves as the basis for an exact separation of the Hamiltonian into intrinsic and collective parts. A Bogoliubov treatment of the intrinsic part produces, in leading order, the normal modes of vibration and their frequencies, the collective degrees of freedom being represented by zero-frequency Goldstone modes associated with spontaneous symmetry breaking in the condensate. The method is very useful in interpreting numerical results of the algebraic model, in identifying the capabilities and inadequacies of the Hamiltonian, and in constructing appropriate algebraic Hamiltonians for specific molecules. copyright 1988 Academic Press, Inc.
Iachello, Francesco
2015-01-01
This course-based primer provides an introduction to Lie algebras and some of their applications to the spectroscopy of molecules, atoms, nuclei and hadrons. In the first part, it concisely presents the basic concepts of Lie algebras, their representations and their invariants. The second part includes a description of how Lie algebras are used in practice in the treatment of bosonic and fermionic systems. Physical applications considered include rotations and vibrations of molecules (vibron model), collective modes in nuclei (interacting boson model), the atomic shell model, the nuclear shell model, and the quark model of hadrons. One of the key concepts in the application of Lie algebraic methods in physics, that of spectrum generating algebras and their associated dynamic symmetries, is also discussed. The book highlights a number of examples that help to illustrate the abstract algebraic definitions and includes a summary of many formulas of practical interest, such as the eigenvalues of Casimir operators...
On the algebraic area of lattice walks and the Hofstadter model
Ouvry, Stéphane; Wagner, Stephan; Wu, Shuang
2016-12-01
We consider the generating function of the algebraic area of lattice walks, evaluated at a root of unity, and its relation to the Hofstadter model. In particular, we obtain an expression for the generating function of the nth moments of the Hofstadter Hamiltonian in terms of a complete elliptic integral, evaluated at a rational function. This, in turn, gives us both exact and asymptotic formulas for these moments.
The Wheeler-DeWitt Equation in Filćhenkov Model: The Lie Algebraic Approach
Panahi, H.; Zarrinkamar, S.; Baradaran, M.
2016-11-01
The Wheeler-DeWitt equation in Filćhenkov model with terms related to strings, dust, relativistic matter, bosons and fermions, and ultra stiff matter is solved in a quasi-exact analytical manner via the Lie algebraic approach. In the calculations, using the representation theory of sl(2), the general (N+1)-dimensional matrix equation is constructed whose determinant yields the solutions of the problem.
Another algebraic variational principle for the spectral curve of matrix models
Eynard, B
2014-01-01
We propose an alternative variational principle whose critical point is the algebraic plane curve associated to a matrix model (the spectral curve, i.e. the large $N$ limit of the resolvent). More generally, we consider a variational principle that is equivalent to the problem of finding a plane curve with given asymptotics and given cycle integrals. This variational principle is not given by extremization of the energy, but by the extremization of an "entropy".
Dynamics of vibrational chaos and entanglement in triatomic molecules: Lie algebraic model
Institute of Scientific and Technical Information of China (English)
Zhai Liang-Jun; Zheng Yu-Jun; Ding Shi-Liang
2012-01-01
In this paper,the dynamics of chaos and the entanglement in triatomic molecnlar vibrations are investigated.On the classical aspect,we study the chaotic trajectories in the phase space.We employ the linear entropy to examine the dynamical entanglement of the two bonds on the quantum aspect.The correspondence between the classical chaos and the quantum dynamical entanglement is also investigated.As an example,we apply our algebraic model to molecule H2O.
Mathematical-logical modeling of regulations on mining safety. [Boolean algebra analysis
Energy Technology Data Exchange (ETDEWEB)
Fajkos, A.; Suchan, L.
1979-09-01
Complexity of the logical structure of mine safety regulations results from the complexity of mining problems. This complexity sometimes makes it difficult to precisely formulate mining safety regulations and to monitor their observance by the miners. It is suggested that mathematical- logical modeling can be an efficient tool in analyzing mine safety regulations. A short description of the method based on Boolean algebra, and three examples of its use in the field of mine safety regulations are presented. (2 refs.) (In Czech)
Directory of Open Access Journals (Sweden)
Svetoslav Markov
2005-12-01
Full Text Available This survey paper aims to promote certain novel mathematical tools, such as computer algebra systems, enclosure methods and interval analysis, to the mathematical modelling and optimization of biotechnological processes.
Vibrational spectrum of CF4 isotopes in an algebraic model
Indian Academy of Sciences (India)
Joydeep Choudhury; Srinivasa Rao Karumuri; Nirmal Kumar Sarkar; Ramendu Bhattacharjee
2009-11-01
n this paper the stretching vibrational modes of CF4 isotopes are calculated up to first overtone using the one-dimensional vibron model for the first time. The model Hamiltonian so constructed seems to describe the C–F stretching modes accurately using a relatively small set of well-defined parameters.
Lighthouse: A User-Centered Web Service for Linear Algebra Software
Norris, Boyana; Bernstein, Sa-Lin; Nair, Ramya; Jessup, Elizabeth
2014-01-01
Various fields of science and engineering rely on linear algebra for large scale data analysis, modeling and simulation, machine learning, and other applied problems. Linear algebra computations often dominate the execution time of such applications. Meanwhile, experts in these domains typically lack the training or time required to develop efficient, high-performance implementations of linear algebra algorithms. In the Lighthouse project, we enable developers with varied backgrounds to readi...
From Clifford Algebra of Nonrelativistic Phase Space to Quarks and Leptons of the Standard Model
Żenczykowski, Piotr
2015-01-01
We review a recently proposed Clifford-algebra approach to elementary particles. We start with: (1) a philosophical background that motivates a maximally symmetric treatment of position and momentum variables, and: (2) an analysis of the minimal conceptual assumptions needed in quark mass extraction procedures. With these points in mind, a variation on Born's reciprocity argument provides us with an unorthodox view on the problem of mass. The idea of space quantization suggests then the linearization of the nonrelativistic quadratic form ${\\bf p}^2 +{\\bf x}^2$ with position and momentum satisfying standard commutation relations. This leads to the 64-dimensional Clifford algebra ${Cl}_{6,0}$ of nonrelativistic phase space within which one identifies the internal quantum numbers of a single Standard Model generation of elementary particles (i.e. weak isospin, hypercharge, and color). The relevant quantum numbers are naturally linked to the symmetries of macroscopic phase space. It is shown that the obtained pha...
A deformation of quantum affine algebra in squashed Wess-Zumino-Novikov-Witten models
Energy Technology Data Exchange (ETDEWEB)
Kawaguchi, Io; Yoshida, Kentaroh [Department of Physics, Kyoto University, Kyoto 606-8502 (Japan)
2014-06-01
We proceed to study infinite-dimensional symmetries in two-dimensional squashed Wess-Zumino-Novikov-Witten models at the classical level. The target space is given by squashed S³ and the isometry is SU(2){sub L}×U(1){sub R}. It is known that SU(2){sub L} is enhanced to a couple of Yangians. We reveal here that an infinite-dimensional extension of U(1){sub R} is a deformation of quantum affine algebra, where a new deformation parameter is provided with the coefficient of the Wess-Zumino term. Then we consider the relation between the deformed quantum affine algebra and the pair of Yangians from the viewpoint of the left-right duality of monodromy matrices. The integrable structure is also discussed by computing the r/s-matrices that satisfy the extended classical Yang-Baxter equation. Finally, two degenerate limits are discussed.
Heidergott, Bernd; van der Woude, Jacob
2014-01-01
Trains pull into a railroad station and must wait for each other before leaving again in order to let passengers change trains. How do mathematicians then calculate a railroad timetable that accurately reflects their comings and goings? One approach is to use max-plus algebra, a framework used to model Discrete Event Systems, which are well suited to describe the ordering and timing of events. This is the first textbook on max-plus algebra, providing a concise and self-contained introduction to the topic. Applications of max-plus algebra abound in the world around us. Traffic systems, compu
A new algebraic structure in the standard model of particle physics
Boyle, Latham
2016-01-01
We introduce a new formulation of non-commutative geometry (NCG): we explain its mathematical advantages and its success in capturing the structure of the standard model of particle physics. The idea, in brief, is to represent $A$ (the algebra of differential forms on some possibly-noncommutative space) on $H$ (the Hilbert space of spinors on that space); and to reinterpret this representation as a simple super-algebra $B=A\\oplus H$ with even part $A$ and odd part $H$. $B$ is the fundamental object in our approach: we show that (nearly) all of the basic axioms and assumptions of the traditional ("spectral triple") formulation of NCG are elegantly recovered from the simple requirement that $B$ should be a differential graded $\\ast$-algebra (or "$\\ast$-DGA"). But this requirement also yields other, new, geometrical constraints. When we apply our formalism to the NCG traditionally used to describe the standard model of particle physics, we find that these new constraints are physically meaningful and phenomenolo...
Cellular modelling using P systems and process algebra
Institute of Scientific and Technical Information of China (English)
Francisco J.Romero-Campero; Marian Gheorghe; Gabriel Ciobanu; John M. Auld; Mario J. Pérez-Jiménez
2007-01-01
In this paper various molecular chemical interactions are modelled under different computational paradigms. P systems and π-calculus are used to describe intra-cellular reactions like protein-protein interactions and gene regulation control.
Realizability algebras II : new models of ZF + DC
Krivine, Jean-Louis
2010-01-01
Using the proof-program (Curry-Howard) correspondence, we give a new method to obtain models of ZF and relative consistency results. We show the relative consistency of ZF + DC + some unusual properties for the power set of R.
Algebraic statistics computational commutative algebra in statistics
Pistone, Giovanni; Wynn, Henry P
2000-01-01
Written by pioneers in this exciting new field, Algebraic Statistics introduces the application of polynomial algebra to experimental design, discrete probability, and statistics. It begins with an introduction to Gröbner bases and a thorough description of their applications to experimental design. A special chapter covers the binary case with new application to coherent systems in reliability and two level factorial designs. The work paves the way, in the last two chapters, for the application of computer algebra to discrete probability and statistical modelling through the important concept of an algebraic statistical model.As the first book on the subject, Algebraic Statistics presents many opportunities for spin-off research and applications and should become a landmark work welcomed by both the statistical community and its relatives in mathematics and computer science.
Analysis of DIRAC's behavior using model checking with process algebra
Remenska, Daniela; Willemse, Tim; Bal, Henri; Verstoep, Kees; Fokkink, Wan; Charpentier, Philippe; Diaz, Ricardo Graciani; Lanciotti, Elisa; Roiser, Stefan; Ciba, Krzysztof
2012-01-01
DIRAC is the grid solution developed to support LHCb production activities as well as user data analysis. It consists of distributed services and agents delivering the workload to the grid resources. Services maintain database back-ends to store dynamic state information of entities such as jobs, queues, staging requests, etc. Agents use polling to check and possibly react to changes in the system state. Each agent's logic is relatively simple, the main complexity lies in their cooperation. Agents run concurrently, and collaborate using the databases as shared memory. The databases can be accessed directly by the agents if running locally or through a DIRAC service interface if necessary. This shared-memory model causes entities to occasionally get into inconsistent states. Tracing and fixing such problems becomes formidable due to the inherent parallelism present. We propose more rigorous methods to cope with this. Model checking is one such technique for analysis of an abstract model of a system. Unlike con...
River flow forecasting. Part 2. Algebraic development of linear modelling techniques
Kachroo, R. K.; Liang, G. C.
1992-04-01
The role of linear input-output models in hydrological forecasting is discussed. The algebraic analysis of linear systems with single or multiple input and single output is presented in outline. The least squares method of system identification is discussed in the context of recursive and off-line estimation, with and without volumetric and shape constraints. An alternative means of imposing shape constraints, via parametric modelling, is also discussed. A procedure for 'updating' is presented for models used in real-time forecasting.
Teaching Algebra and Geometry Concepts by Modeling Telescope Optics
Siegel, Lauren M.; Dickinson, Gail; Hooper, Eric J.; Daniels, Mark
2008-01-01
This article describes preparation and delivery of high school mathematics lessons that integrate mathematics and astronomy through The Geometer's Sketchpad models, traditional proof, and inquiry-based activities. The lessons were created by a University of Texas UTeach preservice teacher as part of a project-based field experience in which high…
Performance evaluation:= (process algebra + model checking) x Markov chains
Hermanns, H.; Katoen, J.P.; Larsen, Kim G.; Nielsen, Mogens
2001-01-01
Markov chains are widely used in practice to determine system performance and reliability characteristics. The vast majority of applications considers continuous-time Markov chains (CTMCs). This tutorial paper shows how successful model specification and analysis techniques from concurrency theory c
A branch-and-bound methodology within algebraic modelling systems
Bisschop, J.J.; Heerink, J.B.J.; Kloosterman, G.
1998-01-01
Through the use of application-specific branch-and-bound directives it is possible to find solutions to combinatorial models that would otherwise be difficult or impossible to find by just using generic branch-and-bound techniques within the framework of mathematical programming. {\\sc Minto} is an e
Optlang: An algebraic modeling language for mathematical optimization
DEFF Research Database (Denmark)
Jensen, Kristian; Cardoso, Joao; Sonnenschein, Nikolaus
2016-01-01
Optlang is a Python package implementing a modeling language for solving mathematical optimization problems, i.e., maximizing or minimizing an objective function over a set of variables subject to a number of constraints. It provides a common native Python interface to a series of optimization...
The standard model of quantum physics in Clifford algebra
Daviau, Claude
2016-01-01
We extend to gravitation our previous study of a quantum wave for all particles and antiparticles of each generation (electron + neutrino + u and d quarks for instance). This wave equation is form invariant under Cl3*, then relativistic invariant. It is gauge invariant under the gauge group of the standard model, with a mass term: this was impossible before, and the consequence was an impossibility to link gauge interactions and gravitation.
LCD motion blur: modeling, analysis, and algorithm.
Chan, Stanley H; Nguyen, Truong Q
2011-08-01
Liquid crystal display (LCD) devices are well known for their slow responses due to the physical limitations of liquid crystals. Therefore, fast moving objects in a scene are often perceived as blurred. This effect is known as the LCD motion blur. In order to reduce LCD motion blur, an accurate LCD model and an efficient deblurring algorithm are needed. However, existing LCD motion blur models are insufficient to reflect the limitation of human-eye-tracking system. Also, the spatiotemporal equivalence in LCD motion blur models has not been proven directly in the discrete 2-D spatial domain, although it is widely used. There are three main contributions of this paper: modeling, analysis, and algorithm. First, a comprehensive LCD motion blur model is presented, in which human-eye-tracking limits are taken into consideration. Second, a complete analysis of spatiotemporal equivalence is provided and verified using real video sequences. Third, an LCD motion blur reduction algorithm is proposed. The proposed algorithm solves an l(1)-norm regularized least-squares minimization problem using a subgradient projection method. Numerical results show that the proposed algorithm gives higher peak SNR, lower temporal error, and lower spatial error than motion-compensated inverse filtering and Lucy-Richardson deconvolution algorithm, which are two state-of-the-art LCD deblurring algorithms.
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
Additional equations were found based on experiments for an algebraic turbulence model to improve the prediction of the behavior of three dimensional turbulent boundary layers by taking account of the effects of pressure gradient and the historical variation of eddy viscosity, so the model is with memory. Numerical calculation by solving boundary layer equations was carried out for the five pressure driven three dimensional turbulent boundary layers developed on flat plates, swept-wing, and prolate spheroid in symmetrical plane. Comparing the computational results with the experimental data, it is obvious that the prediction will be more accurate if the proposed closure equations are used, especially for the turbulent shear stresses.
Generalized model of double random phase encoding based on linear algebra
Nakano, Kazuya; Takeda, Masafumi; Suzuki, Hiroyuki; Yamaguchi, Masahiro
2013-01-01
We propose a generalized model for double random phase encoding (DRPE) based on linear algebra. We defined the DRPE procedure in six steps. The first three steps form an encryption procedure, while the later three steps make up a decryption procedure. We noted that the first (mapping) and second (transform) steps can be generalized. As an example of this generalization, we used 3D mapping and a transform matrix, which is a combination of a discrete cosine transform and two permutation matrices. Finally, we investigated the sensitivity of the proposed model to errors in the decryption key.
A Topological Model for Parallel Algorithm Design
1991-09-01
New York, 1989. 108. J. Dugundji . Topology . Allen and Bacon, Rockleigh, NJ, 1966. 109. R. Duncan. A Survey of Parallel Computer Architectures. IEEE...Approved for public release; distribition unlimited 4N1f-e AFIT/DS/ENG/91-02 A TOPOLOGICAL MODEL FOR PARALLEL ALGORITHM DESIGN DISSERTATION Presented to...DC 20503. 4. TITLE AND SUBTITLE 5. FUNDING NUMBERS A Topological Model For Parallel Algorithm Design 6. AUTHOR(S) Jeffrey A Simmers, Captain, USAF 7
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
On the numerical simulation of active scalar,a new explicit algebraic expression on active scalar flux was derived based on Wikstrm,Wallin and Johansson model (aWWJ model). Reynolds stress algebraic expressions were added by a term to account for the buoyancy effect. The new explicit Reynolds stress and active scalar flux model was then established. Governing equations of this model were solved by finite volume method with unstructured grids. The thermal shear stratified cylinder wake flow was computed by this new model. The computational results are in good agreement with laboratorial measurements. This work is the development on modeling of explicit algebraic Reynolds stress and scalar flux,and is also a further modification of the aWWJ model for complex situations such as a shear stratified flow.
Using process algebra to develop predator-prey models of within-host parasite dynamics.
McCaig, Chris; Fenton, Andy; Graham, Andrea; Shankland, Carron; Norman, Rachel
2013-07-21
As a first approximation of immune-mediated within-host parasite dynamics we can consider the immune response as a predator, with the parasite as its prey. In the ecological literature of predator-prey interactions there are a number of different functional responses used to describe how a predator reproduces in response to consuming prey. Until recently most of the models of the immune system that have taken a predator-prey approach have used simple mass action dynamics to capture the interaction between the immune response and the parasite. More recently Fenton and Perkins (2010) employed three of the most commonly used prey-dependent functional response terms from the ecological literature. In this paper we make use of a technique from computing science, process algebra, to develop mathematical models. The novelty of the process algebra approach is to allow stochastic models of the population (parasite and immune cells) to be developed from rules of individual cell behaviour. By using this approach in which individual cellular behaviour is captured we have derived a ratio-dependent response similar to that seen in the previous models of immune-mediated parasite dynamics, confirming that, whilst this type of term is controversial in ecological predator-prey models, it is appropriate for models of the immune system.
Prediction of heat transfer to supercritical fluids by the use of Algebraic Heat Flux Models
Energy Technology Data Exchange (ETDEWEB)
Pucciarelli, Andrea, E-mail: andrea.pucciarelli@yahoo.it [Università di Pisa, Dipartimento di Ingegneria Civile e Industriale, Largo Lucio Lazzarino 2, 56126 Pisa (Italy); Sharabi, Medhat, E-mail: Medhat.Sharabi@psi.ch [Paul Scherrer Institut, 5232 Villigen PSI, Switzerland and Mechanical Power Engineering Department, Mansoura University, 35516 Mansoura (Egypt); Ambrosini, Walter, E-mail: walter.ambrosini@ing.unipi.it [Università di Pisa, Dipartimento di Ingegneria Civile e Industriale, Largo Lucio Lazzarino 2, 56126 Pisa (Italy)
2016-02-15
Highlights: • The Algebraic Heat Flux Model is considered for modelling the turbulence heat flux. • A relation based on AHFM for determining Pr{sub tur} is proposed. • Results are compared with heat transfer to supercritical fluids experimental data. - Abstract: The paper discusses capabilities and limitations of Algebraic Heat Flux Models in predicting heat transfer to supercritical fluids. The model was implemented in a commercial code and used as a basis for obtaining an advanced definition of the turbulent Prandtl number and an improved estimate of the buoyancy production of turbulence kinetic energy. A comparison between the obtained results and experimental data available in literature is performed highlighting promising features, in particular when dealing with trans-pseudo-critical conditions. Experimental conditions using different fluids where analysed showing improvements with respect to two-equation turbulence models; a reference DNS calculation is considered as well for comparison. Calculated wall temperature values are in general well reproduced by the methodology and sensitivity analyses show that improvements may be obtained in future works by selecting case-specific AHFM parameters in association with different turbulence models.
A computer code for calculations in the algebraic collective model of the atomic nucleus
Welsh, T. A.; Rowe, D. J.
2016-03-01
A Maple code is presented for algebraic collective model (ACM) calculations. The ACM is an algebraic version of the Bohr model of the atomic nucleus, in which all required matrix elements are derived by exploiting the model's SU(1 , 1) × SO(5) dynamical group. This paper reviews the mathematical formulation of the ACM, and serves as a manual for the code. The code enables a wide range of model Hamiltonians to be analysed. This range includes essentially all Hamiltonians that are rational functions of the model's quadrupole moments qˆM and are at most quadratic in the corresponding conjugate momenta πˆN (- 2 ≤ M , N ≤ 2). The code makes use of expressions for matrix elements derived elsewhere and newly derived matrix elements of the operators [ π ˆ ⊗ q ˆ ⊗ π ˆ ] 0 and [ π ˆ ⊗ π ˆ ] LM. The code is made efficient by use of an analytical expression for the needed SO(5)-reduced matrix elements, and use of SO(5) ⊃ SO(3) Clebsch-Gordan coefficients obtained from precomputed data files provided with the code.
Müller, Dirk K; Pampel, André; Möller, Harald E
2013-05-01
Quantification of magnetization-transfer (MT) experiments are typically based on the assumption of the binary spin-bath model. This model allows for the extraction of up to six parameters (relative pool sizes, relaxation times, and exchange rate constants) for the characterization of macromolecules, which are coupled via exchange processes to the water in tissues. Here, an approach is presented for estimating MT parameters acquired with arbitrary saturation schemes and imaging pulse sequences. It uses matrix algebra to solve the Bloch-McConnell equations without unwarranted simplifications, such as assuming steady-state conditions for pulsed saturation schemes or neglecting imaging pulses. The algorithm achieves sufficient efficiency for voxel-by-voxel MT parameter estimations by using a polynomial interpolation technique. Simulations, as well as experiments in agar gels with continuous-wave and pulsed MT preparation, were performed for validation and for assessing approximations in previous modeling approaches. In vivo experiments in the normal human brain yielded results that were consistent with published data.
微分代数系统的数值仿真算法%Numerical Algorithm for differential-algebraic equations
Institute of Scientific and Technical Information of China (English)
宋晓秋
2000-01-01
介绍了微分代数系统DAE的基本概念及仿真算法，特别指出了用BDF方法 求解高指标常系数线性DAE系统时的数值稳定性缺陷。最后，针对飞行器轨道约束 实时控制问题，给出了3阶收敛的代数约束算法。%In this paper, the basic concept of differential-algebraic equations is introduced and its numerical algorithm is discussed. The defect for numerical stability of BDF method is shown when it is applied to linear constant coefficient DAE's with high index. Finally, a new algorithm with three orders for aerospace real-time control problem is given out.
Algebraic arctic curves in the domain-wall six-vertex model
Colomo, F
2010-01-01
The arctic curve, i.e. the spatial curve separating ordered (or `frozen') and disordered (or `temperate) regions, of the six-vertex model with domain wall boundary conditions is discussed for the root-of-unity vertex weights. In these cases the curve is described by algebraic equations which can be worked out explicitly from the parametric solution for this curve. Some interesting examples are discussed in detail. The upper bound on the maximal degree of the equation in a generic root-of-unity case is obtained.
RSOS models and Jantzen-Seitz representations of Hecke algebras at roots of unity
Foda, O E; Okado, M; Thibon, J Y; Welsh, Trevor A; Foda, Omar; Leclerc, Bernard; Okado, Masato; Thibon, Jean-Yves; Welsh, Trevor A.
1997-01-01
A special family of partitions occurs in two apparently unrelated contexts: the evaluation of 1-dimensional configuration sums of certain RSOS models, and the modular representation theory of symmetric groups or their Hecke algebras $H_m$. We provide an explanation of this coincidence by showing how the irreducible $H_m$-modules which remain irreducible under restriction to $H_{m-1}$ (Jantzen-Seitz modules) can be determined from the decomposition of a tensor product of representations of affine $\\sl_n$.
Thermodiffusion in Multicomponent Mixtures Thermodynamic, Algebraic, and Neuro-Computing Models
Srinivasan, Seshasai
2013-01-01
Thermodiffusion in Multicomponent Mixtures presents the computational approaches that are employed in the study of thermodiffusion in various types of mixtures, namely, hydrocarbons, polymers, water-alcohol, molten metals, and so forth. We present a detailed formalism of these methods that are based on non-equilibrium thermodynamics or algebraic correlations or principles of the artificial neural network. The book will serve as single complete reference to understand the theoretical derivations of thermodiffusion models and its application to different types of multi-component mixtures. An exhaustive discussion of these is used to give a complete perspective of the principles and the key factors that govern the thermodiffusion process.
Directory of Open Access Journals (Sweden)
Mohammad Shahzad
2016-05-01
Full Text Available This study deals with the control of chaotic dynamics of tumor cells, healthy host cells, and effector immune cells in a chaotic Three Dimensional Cancer Model (TDCM by State Space Exact Linearization (SSEL technique based on Lie algebra. A non-linear feedback control law is designed which induces a coordinate transformation thereby changing the original chaotic TDCM system into a controlled one linear system. Numerical simulation has been carried using Mathematica that witness the robustness of the technique implemented on the chosen chaotic system.
Modeling boyciana-fish-human interaction with partial differential algebraic equations.
Jiang, Yushan; Zhang, Qingling; Wang, Haiyan
2016-07-01
Under the influence of human population distribution, the boyciana-fish ecological system is considered. First, the system can be described as a nonlinear partial differential algebraic equations system (PDAEs) with Neumann boundary conditions and ratio-dependent functional response. Second, we examine the system's persistence properties: the loacl stabilities of positive steady states, the absorbtion region and the global stability. And the proposed approach is illustrated by numerical simulation. Finally, by using the realistic data collected in the past fourteen years, the PDAEs parameter optimization model is built to predict the boyciana population.
Algebraic Bethe ansatz for the XXX chain with triangular boundaries and Gaudin model
Energy Technology Data Exchange (ETDEWEB)
Cirilo António, N., E-mail: nantonio@math.ist.utl.pt [Centro de Análise Funcional e Aplicações, Instituto Superior Técnico, Universidade de Lisboa, Av. Rovisco Pais, 1049-001 Lisboa (Portugal); Manojlović, N., E-mail: nmanoj@ualg.pt [Grupo de Física Matemática da Universidade de Lisboa, Av. Prof. Gama Pinto 2, PT-1649-003 Lisboa (Portugal); Departamento de Matemática, F.C.T., Universidade do Algarve, Campus de Gambelas, PT-8005-139 Faro (Portugal); Salom, I., E-mail: isalom@ipb.ac.rs [Institute of Physics, University of Belgrade, P.O. Box 57, 11080 Belgrade (Serbia)
2014-12-15
We implement fully the algebraic Bethe ansatz for the XXX Heisenberg spin chain in the case when both boundary matrices can be brought to the upper-triangular form. We define the Bethe vectors which yield the strikingly simple expression for the off shell action of the transfer matrix, deriving the spectrum and the relevant Bethe equations. We explore further these results by obtaining the off shell action of the generating function of the Gaudin Hamiltonians on the corresponding Bethe vectors through the so-called quasi-classical limit. Moreover, this action is as simple as it could possibly be, yielding the spectrum and the Bethe equations of the Gaudin model.
Algebraic Bethe ansatz for the XXX chain with triangular boundaries and Gaudin model
Cirilo António, N.; Manojlović, N.; Salom, I.
2014-12-01
We implement fully the algebraic Bethe ansatz for the XXX Heisenberg spin chain in the case when both boundary matrices can be brought to the upper-triangular form. We define the Bethe vectors which yield the strikingly simple expression for the off shell action of the transfer matrix, deriving the spectrum and the relevant Bethe equations. We explore further these results by obtaining the off shell action of the generating function of the Gaudin Hamiltonians on the corresponding Bethe vectors through the so-called quasi-classical limit. Moreover, this action is as simple as it could possibly be, yielding the spectrum and the Bethe equations of the Gaudin model.
Adaptive Genetic Algorithm Model for Intrusion Detection
Directory of Open Access Journals (Sweden)
K. S. Anil Kumar
2012-09-01
Full Text Available Intrusion detection systems are intelligent systems designed to identify and prevent the misuse of computer networks and systems. Various approaches to Intrusion Detection are currently being used, but they are relatively ineffective. Thus the emerging network security systems need be part of the life system and this ispossible only by embedding knowledge into the network. The Adaptive Genetic Algorithm Model - IDS comprising of K-Means clustering Algorithm, Genetic Algorithm and Neural Network techniques. Thetechnique is tested using multitude of background knowledge sets in DARPA network traffic datasets.
Numerical algebraic geometry for model selection and its application to the life sciences.
Gross, Elizabeth; Davis, Brent; Ho, Kenneth L; Bates, Daniel J; Harrington, Heather A
2016-10-01
Researchers working with mathematical models are often confronted by the related problems of parameter estimation, model validation and model selection. These are all optimization problems, well known to be challenging due to nonlinearity, non-convexity and multiple local optima. Furthermore, the challenges are compounded when only partial data are available. Here, we consider polynomial models (e.g. mass-action chemical reaction networks at steady state) and describe a framework for their analysis based on optimization using numerical algebraic geometry. Specifically, we use probability-one polynomial homotopy continuation methods to compute all critical points of the objective function, then filter to recover the global optima. Our approach exploits the geometrical structures relating models and data, and we demonstrate its utility on examples from cell signalling, synthetic biology and epidemiology.
Graphical model construction based on evolutionary algorithms
Institute of Scientific and Technical Information of China (English)
Youlong YANG; Yan WU; Sanyang LIU
2006-01-01
Using Bayesian networks to model promising solutions from the current population of the evolutionary algorithms can ensure efficiency and intelligence search for the optimum. However, to construct a Bayesian network that fits a given dataset is a NP-hard problem, and it also needs consuming mass computational resources. This paper develops a methodology for constructing a graphical model based on Bayesian Dirichlet metric. Our approach is derived from a set of propositions and theorems by researching the local metric relationship of networks matching dataset. This paper presents the algorithm to construct a tree model from a set of potential solutions using above approach. This method is important not only for evolutionary algorithms based on graphical models, but also for machine learning and data mining.The experimental results show that the exact theoretical results and the approximations match very well.
Genetic Algorithms for a Parameter Estimation of a Fermentation Process Model: A Comparison
Directory of Open Access Journals (Sweden)
Olympia Roeva
2005-12-01
Full Text Available In this paper the problem of a parameter estimation using genetic algorithms is examined. A case study considering the estimation of 6 parameters of a nonlinear dynamic model of E. coli fermentation is presented as a test problem. The parameter estimation problem is stated as a nonlinear programming problem subject to nonlinear differential-algebraic constraints. This problem is known to be frequently ill-conditioned and multimodal. Thus, traditional (gradient-based local optimization methods fail to arrive satisfied solutions. To overcome their limitations, the use of different genetic algorithms as stochastic global optimization methods is explored. These algorithms are proved to be very suitable for the optimization of highly non-linear problems with many variables. Genetic algorithms can guarantee global optimality and robustness. These facts make them advantageous in use for parameter identification of fermentation models. A comparison between simple, modified and multi-population genetic algorithms is presented. The best result is obtained using the modified genetic algorithm. The considered algorithms converged very closely to the cost value but the modified algorithm is in times faster than other two.
Model Checking Algorithms for CTMDPs
DEFF Research Database (Denmark)
Buchholz, Peter; Hahn, Ernst Moritz; Hermanns, Holger
2011-01-01
Continuous Stochastic Logic (CSL) can be interpreted over continuoustime Markov decision processes (CTMDPs) to specify quantitative properties of stochastic systems that allow some external control. Model checking CSL formulae over CTMDPs requires then the computation of optimal control strategie...
Models and Algorithm for Stochastic Network Designs
Institute of Scientific and Technical Information of China (English)
Anthony Chen; Juyoung Kim; Seungjae Lee; Jaisung Choi
2009-01-01
The network design problem (NDP) is one of the most difficult and challenging problems in trans-portation. Traditional NDP models are often posed as a deterministic bilevel program assuming that all rele-vant inputs are known with certainty. This paper presents three stochastic models for designing transporta-tion networks with demand uncertainty. These three stochastic NDP models were formulated as the ex-pected value model, chance-constrained model, and dependent-chance model in a bilevel programming framework using different criteria to hedge against demand uncertainty. Solution procedures based on the traffic assignment algorithm, genetic algorithm, and Monte-Cado simulations were developed to solve these stochastic NDP models. The nonlinear and nonconvex nature of the bilevel program was handled by the genetic algorithm and traffic assignment algorithm, whereas the stochastic nature was addressed through simulations. Numerical experiments were conducted to evaluate the applicability of the stochastic NDP models and the solution procedure. Results from the three experiments show that the solution procedures are quite robust to different parameter settings.
2013-01-01
The chapter provides an introduction to the basic concepts of Algebraic Topology with an emphasis on motivation from applications in the physical sciences. It finishes with a brief review of computational work in algebraic topology, including persistent homology.
A posteriori testing of algebraic flame surface density models for LES
Ma, T.; Stein, O. T.; Chakraborty, N.; Kempf, A. M.
2013-06-01
In the application of Large Eddy Simulation (LES) to premixed combustion, the unknown filtered chemical source term can be modelled by the generalised flame surface density (FSD) using algebraic models for the wrinkling factor Ξ. The present study compares the behaviour of the various models by first examining the effect of sub-grid turbulent velocity fluctuation on Ξ through a one-dimensional analysis and by the LES of the ORACLES burner (Nguyen, Bruel, and Reichstadt, Flow, Turbulence and Combustion Vol. 82 [2009], pp. 155-183) and the Volvo Rig (Sjunnesson, Nelsson, and Max, Laser Anemometry, Vol. 3 [1991], pp. 83-90; Sjunnesson, Henrikson, and Löfström, AIAA Journal, Vol. 28 [1992], pp. AIAA-92-3650). Several sensitivity studies on parameters such as the turbulent viscosity and the grid resolution are also carried out. A statistically 1-D analysis of turbulent flame propagation reveals that counter gradient transport of the progress variable needs to be accounted for to obtain a realistic flame thickness from the simulations using algebraic FSD based closure. The two burner setups are found to operate mainly within the wrinkling/corrugated flamelet regime based on the premixed combustion diagram for LES (Pitsch and Duchamp de Lageneste, Proceedings of the Combustion Institute, Vol. 29 [2002], pp. 2001-2008) and this suggests that the models are operating within their ideal range. The performance of the algebraic models are then assessed by comparing velocity statistics, followed by a detailed error analysis for the ORACLES burner. Four of the tested models were found to perform reasonably well against experiments, and one of these four further excels in being the most grid-independent. For the Volvo Rig, more focus is placed upon the comparison of temperature data and identifying changes in flame structure amongst the different models. It is found that the few models which largely over-predict velocities in the ORACLES case and volume averaged ? in a
Entanglement in a model for Hawking radiation: An Application of Quadratic Algebras
Bambah, Bindu A; Shreecharan, T; Prasad, K Siva
2012-01-01
Quadratic polynomially deformed $su(1,1)$ and $su(2)$ algebras are utilised in model Hamiltonians to show how the gravitational system consisting of a black hole, infalling radiation and outgoing (Hawking) radiation can be solved exactly. The models allow us to study the long-time behaviour of the black hole and its outgoing modes. In particular, we calculate the bipartite entanglement entropies of subsystems consisting of a) infalling plus outgoing modes and b) black hole modes plus the infalling modes,using the Janus-faced nature of the model.The long-time behaviour also gives us glimpses of modifications in the character of Hawking radiation. Lastly, we study the phenomenon of superradiance in our model in analogy with atomic Dicke superradiance.
A note on the "logarithmic-W_3" octuplet algebra and its Nichols algebra
Semikhatov, A M
2013-01-01
We describe a Nichols-algebra-motivated construction of an octuplet chiral algebra that is a "W_3-counterpart" of the triplet algebra of (p,1) logarithmic models of two-dimensional conformal field theory.
Tanaka, S
2004-01-01
Noncommutative field theory on Yang's quantized space-time algebra (YSTA) is studied. It gives a theoretical framework to reformulate the matrix model as quantum mechanics of $D_0$ branes in a Lorentz-covariant form. The so-called kinetic term ($\\sim {\\hat{P_i}}^2)$ and potential term ($\\sim {[\\hat{X_i},\\hat{X_j}]}^2)$ of $D_0$ branes in the matrix model are described now in terms of Casimir operator of $SO(D,1)$, a subalgebra of the primary algebra $SO(D+1,1)$ which underlies YSTA with two contraction- parameters, $\\lambda$ and $R$. $D$-dimensional noncommutative space-time and momentum operators $\\hat{X_\\mu}$ and $\\hat{P_\\mu}$ in YSTA show a distinctive spectral structure, that is, space-components $\\hat{X_i}$ and $\\hat{P_i}$ have discrete eigenvalues, and time-components $\\hat{X_0}$ and $\\hat{P_0}$ continuous eigenvalues, consistently with Lorentz-covariance. According to the method of Lorentz-covariant Moyal star product proper to YSTA, the field equation of $D_0$ brane on YSTA is derived in a nontrivial ...
Lorentz invariant noncommutative algebra for cosmological models coupled to a perfect fluid
Energy Technology Data Exchange (ETDEWEB)
Abreu, Everton M.C.; Marcial, Mateus V.; Mendes, Albert C.R.; Oliveira, Wilson [Universidade Federal Rural do Rio de Janeiro (UFRRJ), Seropedica, RJ (Brazil); Universidade Federal de Juiz de Fora, MG (Brazil)
2013-07-01
Full text: In current theoretical physics there is a relevant number of theoretical investigations that lead to believe that at the first moments of our Universe, the geometry was not commutative and the dominating physics at that time was ruled by the laws of noncommutative (NC) geometry. Therefore, the idea is that the physics of the early moments can be constructed based on these concepts. The first published work using the idea of a NC spacetime were carried out by Snyder who believed that NC principles could make the quantum field theory infinities disappear. However, it did not occur and Snyder's ideas were put to sleep for a long time. The main modern motivations that rekindle the investigation about NC field theories came from string theory and quantum gravity. In the context of quantum mechanics for example, R. Banerjee discussed how NC structures appear in planar quantum mechanics providing a useful way for obtaining them. The analysis was based on the NC algebra used in planar quantum mechanics that was originated from 't Hooft's analysis on dissipation and quantization. In this work we carry out a NC algebra analysis of the Friedmann-Robert-Walker model, coupled to a perfect fluid and in the presence of a cosmological constant. The classical field equations are modified, by the introduction of a shift operator, in order to introduce noncommutativity in these models. (author)
ηc elastic and transition form factors: Contact interaction and algebraic model
Bedolla, Marco A.; Raya, Khépani; Cobos-Martínez, J. J.; Bashir, Adnan
2016-05-01
For the flavor-singlet heavy-quark system of charmonia in the pseudoscalar [ηc(1 S ) ] channel, we calculate the elastic (EFF) and transition form factors (TFFs) [ηc(1 S )→γ γ* ] for a wide range of photon momentum transfer squared (Q2). The framework for this analysis is provided by a symmetry-preserving Schwinger-Dyson equation and Bethe-Salpeter equation treatment of a vector×vector contact interaction. We also employ an algebraic model, developed earlier to describe the light-quark systems. It correctly correlates infrared and ultraviolet dynamics of quantum chromodynamics (QCD). The contact interaction results agree with the lattice data for low Q2. For Q2≥Q02 , the results start deviating from the lattice results by more than 20%. Q02≈2.5 GeV2 for the EFF, and ≈25 GeV2 for the TFF. We also present the results for the EFF, TFF, and ηc(1 S ) parton distribution amplitude for the algebraic model. Wherever the comparison is possible, these results are in excellent agreement with the lattice, perturbative QCD, results obtained through a Schwinger-Dyson equation-Bethe-Salpeter equation study, employing refined truncations, and the experimental findings of the BABAR experiment.
Algebraic solutions for two-level pairing model in IBM-2 and IVBM
Jalili-Majarshin, A.; Jafarizadeh, M. A.; Fouladi, N.
2016-09-01
In this paper the affine SU(1,1) approach is applied to numerically solve two pairing problems. A dynamical symmetry limit of the two-fluid interacting boson model-2 (IBM-2) and of the interacting vector boson model (IVBM) defined through the chains U_{π}(6) ⊗ U_{ν}(6) supset SO_{π}(5)⊗ SO_{ν}(5) supset SO_{π}(3) ⊗ SO_{ν}(3) supset SO(3) and U(6) supset U_{π}(3) ⊗ U_{ν}(3) supset SO_{π}(3) ⊗ SO_{ν}(3) supset SO(3) are introduced, respectively. The quantum phase transition between spherical and γ-soft shapes in medium-mass nuclei is analyzed using U(5) leftrightarrow SO(6) transitional nuclei in IBM-2 and one case U_{π}(3) ⊗ U_{ν}(3) leftrightarrow SO(6) transitional nuclei in IVBM found by using an infinite dimensional algebraic method based on affine SU(1,1) Lie algebra. The calculated energy spectra, energy ratio and energy staggering of Mo isotopes are compared with experimental results. The interplay between phase transitions and configuration mixing of intruder excitations between spherical vibrations and the γ-soft shapes in Mo isotopes is succinctly addressed and displays fingerprints of the transitional dynamical symmetry E(5).
McCaig, Chris; Begon, Mike; Norman, Rachel; Shankland, Carron
2011-03-01
Changing scale, for example, the ability to move seamlessly from an individual-based model to a population-based model, is an important problem in many fields. In this paper, we introduce process algebra as a novel solution to this problem in the context of models of infectious disease spread. Process algebra allows us to describe a system in terms of the stochastic behaviour of individuals, and is a technique from computer science. We review the use of process algebra in biological systems, and the variety of quantitative and qualitative analysis techniques available. The analysis illustrated here solves the changing scale problem: from the individual behaviour we can rigorously derive equations to describe the mean behaviour of the system at the level of the population. The biological problem investigated is the transmission of infection, and how this relates to individual interactions.
Fuzzy audit risk modeling algorithm
Directory of Open Access Journals (Sweden)
Zohreh Hajihaa
2011-07-01
Full Text Available Fuzzy logic has created suitable mathematics for making decisions in uncertain environments including professional judgments. One of the situations is to assess auditee risks. During recent years, risk based audit (RBA has been regarded as one of the main tools to fight against fraud. The main issue in RBA is to determine the overall audit risk an auditor accepts, which impact the efficiency of an audit. The primary objective of this research is to redesign the audit risk model (ARM proposed by auditing standards. The proposed model of this paper uses fuzzy inference systems (FIS based on the judgments of audit experts. The implementation of proposed fuzzy technique uses triangular fuzzy numbers to express the inputs and Mamdani method along with center of gravity are incorporated for defuzzification. The proposed model uses three FISs for audit, inherent and control risks, and there are five levels of linguistic variables for outputs. FISs include 25, 25 and 81 rules of if-then respectively and officials of Iranian audit experts confirm all the rules.
Compatible Relaxation and Coarsening in Algebraic Multigrid
Energy Technology Data Exchange (ETDEWEB)
Brannick, J J; Falgout, R D
2009-09-22
We introduce a coarsening algorithm for algebraic multigrid (AMG) based on the concept of compatible relaxation (CR). The algorithm is significantly different from standard methods, most notably because it does not rely on any notion of strength of connection. We study its behavior on a number of model problems, and evaluate the performance of an AMG algorithm that incorporates the coarsening approach. Lastly, we introduce a variant of CR that provides a sharper metric of coarse-grid quality and demonstrate its potential with two simple examples.
Templates for Linear Algebra Problems
Bai, Z.; Day, D.; Demmel, J.; Dongarra, J.; Gu, M.; Ruhe, A.; Vorst, H.A. van der
2001-01-01
The increasing availability of advanced-architecture computers is having a very signicant eect on all spheres of scientic computation, including algorithm research and software development in numerical linear algebra. Linear algebra {in particular, the solution of linear systems of equations and eig
Dynamic exponents for potts model cluster algorithms
Coddington, Paul D.; Baillie, Clive F.
We have studied the Swendsen-Wang and Wolff cluster update algorithms for the Ising model in 2, 3 and 4 dimensions. The data indicate simple relations between the specific heat and the Wolff autocorrelations, and between the magnetization and the Swendsen-Wang autocorrelations. This implies that the dynamic critical exponents are related to the static exponents of the Ising model. We also investigate the possibility of similar relationships for the Q-state Potts model.
Tsue, Yasuhiko; Providência, Constança; Providência, João da; Yamamura, Masatoshi
2016-08-01
The minimum weight states of the Lipkin model consisting of n single-particle levels and obeying the SU(n) algebra are investigated systematically. The basic idea is to use the SU(2) algebra, which is independent of the SU(n) algebra. This idea has already been presented by the present authors in the case of the conventional Lipkin model consisting of two single-particle levels and obeying the SU(2) algebra. If this idea is followed, the minimum weight states are determined for any fermion number appropriately occupying n single-particle levels. Naturally, the conventional minimum weight state is included: all fermions occupy energetically the lowest single-particle level in the absence of interaction. The cases n=2, 3, 4, and 5 are discussed in some detail.
Xin, Yan Ping; Si, Luo; Hord, Casey; Zhang, Dake; Cetinas, Suleyman; Park, Joo Young
2012-01-01
The study explored the effects of a computer-assisted COnceptual Model-based Problem-Solving (COMPS) program on multiplicative word-problem-solving performance of students with learning disabilities or difficulties. The COMPS program emphasizes mathematical modeling with algebraic expressions of relations. Participants were eight fourth and fifth…
A Generic Design Model for Evolutionary Algorithms
Institute of Scientific and Technical Information of China (English)
He Feng; Kang Li-shan; Chen Yu-ping
2003-01-01
A generic design model for evolutionary algo rithms is proposed in this paper. The model, which was described by UML in details, focuses on the key concepts and mechanisms in evolutionary algorithms. The model not only achieves separation of concerns and encapsulation of implementations by classification and abstraction of those concepts,it also has a flexible architecture due to the application of design patterns. As a result, the model is reusable, extendible,easy to understand, easy to use, and easy to test. A large number of experiments applying the model to solve many different problems adequately illustrate the generality and effectivity of the model.
Lloris Ruiz, Antonio; Parrilla Roure, Luis; García Ríos, Antonio
2014-01-01
This book presents a complete and accurate study of algebraic circuits, digital circuits whose performance can be associated with any algebraic structure. The authors distinguish between basic algebraic circuits, such as Linear Feedback Shift Registers (LFSRs) and cellular automata, and algebraic circuits, such as finite fields or Galois fields. The book includes a comprehensive review of representation systems, of arithmetic circuits implementing basic and more complex operations, and of the residue number systems (RNS). It presents a study of basic algebraic circuits such as LFSRs and cellular automata as well as a study of circuits related to Galois fields, including two real cryptographic applications of Galois fields.
Nonlinear $\\hat{W}_{\\infty}$ Current Algebra in the SL(2,R)/U(1) Coset Model
Yu, F; Yu, Feng; Wu, Yong-Shi
1992-01-01
Previously we have established that the second Hamiltonian structure of the KP hierarchy is a nonlinear deformation, called $\\hat{W}_{\\infty}$, of the linear, centerless $W_{\\infty}$ algebra. In this letter we present a free-field realization for all generators of $\\hat{W}_{\\infty}$ in terms of two scalars as well as an elegant generating function for the $\\hat{W}_{\\infty}$ currents in the classical conformal $SL(2,R)/U(1)$ coset model. After quantization, a quantum deformation of $\\hat{W}_{\\infty}$ appears as the hidden current algebra in this model. The $\\hat{W}_{\\infty}$ current algebra results in an infinite set of commuting conserved charges, which might give rise to $W$-hair for the 2d black hole arising in the corresponding string theory at level $k=9/4$.
Computations in finite-dimensional Lie algebras
Cohen, A.M.; Graaf, W.A. de; Rónyai, L.
2001-01-01
This paper describes progress made in context with the construction of a general library of Lie algebra algorithms, called ELIAS (Eindhoven Lie Algebra System), within the computer algebra package GAP. A first sketch of the packagecan be found in Cohen and de Graaf[1]. Since then, in a collaborative
Algorithms and Models for the Web Graph
Gleich, David F.; Komjathy, Julia; Litvak, Nelly
2015-01-01
This volume contains the papers presented at WAW2015, the 12th Workshop on Algorithms and Models for the Web-Graph held during December 10–11, 2015, in Eindhoven. There were 24 submissions. Each submission was reviewed by at least one, and on average two, Program Committee members. The committee dec
Model based development of engine control algorithms
Dekker, H.J.; Sturm, W.L.
1996-01-01
Model based development of engine control systems has several advantages. The development time and costs are strongly reduced because much of the development and optimization work is carried out by simulating both engine and control system. After optimizing the control algorithm it can be executed b
Free Differential Algebras and Pure Spinor Action in IIB Superstring Sigma Models
Oda, Ichiro
2011-01-01
In this paper we extend to the case of IIB superstring sigma models the method proposed in hep-th/10023500 to derive the pure spinor approach for type IIA sigma models. In particular, starting from the (Free) Differential Algebra and superspace parametrization of type IIB supergravity, extended to include the BRST differential and all the ghosts, we derive the BRST transformations of fields and ghosts as well as the standard pure spinor constraints for the ghosts $\\lambda $ related to supersymmetry. Moreover, using the method first proposed by us, we derive the pure spinor action for type IIB superstrings in curved supergravity backgrounds (on shell), in full agreement with the action first obtained by Berkovits and Howe.
Free differential algebras and pure spinor action in IIB superstring sigma models
Oda, Ichiro; Tonin, Mario
2011-06-01
In this paper we extend to the case of IIB superstring sigma models the method proposed in hep-th/10023500 to derive the pure spinor approach for type IIA sigma models. In particular, starting from the (Free) Differential Algebra and superspace parametrization of type IIB supergravity, extended to include the BRST differential and all the ghosts, we derive the BRST transformations of fields and ghosts as well as the standard pure spinor constraints for the ghosts λ related to supersymmetry. Moreover, using the method first proposed by us, we derive the pure spinor action for type IIB superstrings in curved supergravity backgrounds (on shell), in full agreement with the action first obtained by Berkovits and Howe.
Conceptual Explanation for the Algebra in the Noncommutative Approach to the Standard Model
Chamseddine, Ali H.; Connes, Alain
2007-11-01
The purpose of this Letter is to remove the arbitrariness of the ad hoc choice of the algebra and its representation in the noncommutative approach to the standard model, which was begging for a conceptual explanation. We assume as before that space-time is the product of a four-dimensional manifold by a finite noncommmutative space F. The spectral action is the pure gravitational action for the product space. To remove the above arbitrariness, we classify the irreducible geometries F consistent with imposing reality and chiral conditions on spinors, to avoid the fermion doubling problem, which amounts to have total dimension 10 (in the K-theoretic sense). It gives, almost uniquely, the standard model with all its details, predicting the number of fermions per generation to be 16, their representations and the Higgs breaking mechanism, with very little input.
Conceptual explanation for the algebra in the noncommutative approach to the standard model.
Chamseddine, Ali H; Connes, Alain
2007-11-09
The purpose of this Letter is to remove the arbitrariness of the ad hoc choice of the algebra and its representation in the noncommutative approach to the standard model, which was begging for a conceptual explanation. We assume as before that space-time is the product of a four-dimensional manifold by a finite noncommmutative space F. The spectral action is the pure gravitational action for the product space. To remove the above arbitrariness, we classify the irreducible geometries F consistent with imposing reality and chiral conditions on spinors, to avoid the fermion doubling problem, which amounts to have total dimension 10 (in the K-theoretic sense). It gives, almost uniquely, the standard model with all its details, predicting the number of fermions per generation to be 16, their representations and the Higgs breaking mechanism, with very little input.
Anomaly in RTT relation for DIM algebra and network matrix models
Awata, H; Mironov, A; Morozov, A; Morozov, An; Ohkubo, Y; Zenkevich, Y
2016-01-01
We discuss the recent proposal of arXiv:1608.05351 about generalization of the RTT relation to network matrix models. We show that the RTT relation in these models is modified by a nontrivial, but essentially abelian anomaly cocycle, which we explicitly evaluate for the free field representations of the quantum toroidal algebra. This cocycle is responsible for the braiding, which permutes the external legs in the q-deformed conformal block and its 5d/6d gauge theory counterpart, i.e. the non-perturbative Nekrasov functions. Thus, it defines their modular properties and symmetry. We show how to cancel the anomaly using a construction somewhat similar to the anomaly matching condition in gauge theory. We also describe the singular limit to the affine Yangian (4d Nekrasov functions), which breaks the spectral duality.
Analysis of an algebraic model for the chromophore vibrations of CF$_3$CHFI
Jung, C; Taylor, H S
2004-01-01
We extract the dynamics implicit in an algebraic fitted model Hamiltonian for the hydrogen chromophore's vibrational motion in the molecule $CF_3CHFI$. The original model has 4 degrees of freedom, three positions and one representing interbond couplings. A conserved polyad allows the reduction to 3 degrees of freedom. For most quantum states we can identify the underlying motion that when quantized gives the said state. Most of the classifications, identifications and assignments are done by visual inspection of the already available wave function semiclassically transformed from the number representation to a representation on the reduced dimension toroidal configuration space corresponding to the classical action and angle variables. The concentration of the wave function density to lower dimensional subsets centered on idealized simple lower dimensional organizing structures and the behavior of the phase along such organizing centers already reveals the atomic motion. Extremely little computational work is...
Two types of loop algebras and their expanding Lax integrable models
Institute of Scientific and Technical Information of China (English)
Yue Chao; Zhang Yu-Feng; Wei Yuan
2007-01-01
Though various integrable hierarchies of evolution equations were obtained by choosing proper U in zero-curvature equation Ut-Vx+[U,V]=0,but in this paper,a new integrable hierarchy possessing bi-Hamiltonian structure is worked out by selecting V with spectral potentials.Then its expanding Lax integrable model of the hierarchy possessing a simple Hamiltonian operator (J) is presented by constructing a subalgebra (G) of the loop algebra (A)2.As linear expansions of the above-mentioned integrable hierarchy and its expanding Lax integrable model with respect to their dimensional numbers,their (2+1)-dimensional forms are derived from a (2+1)-dimensional zero-curvature equation.
Energy Technology Data Exchange (ETDEWEB)
Winker, S.; Wos, L.
1978-01-01
The purposes of this paper are to answer certain previously unanswered questions in the field of Ternary Boolean algebra; to describe the method, by use of an automated theorem-proving program as an invaluable aid, by which these answers were obtained; and to give informally the characteristics of those problems to which the method can be successfully applied. The approach under study begins with known facts in the form of axioms and lemmas of the field being investigated, finds by means of certain specified inference rules new facts, and continues to reason from the expanding set of facts until the problem at hand is solved or the procedure is interrupted. The solution often takes the form of a finite model or of a counter-example to the underlying conjecture. The model and/or counterexample is generated with the aid of an already existing automated theorem-proving procedure and without any recourse to any additional programing.
Zhang, Yi; Gabr, Refaat E.; Zhou, Jinyuan; Weiss, Robert G.; Bottomley, Paul A.
2013-12-01
Noninvasive magnetic resonance spectroscopy (MRS) with chemical shift imaging (CSI) provides valuable metabolic information for research and clinical studies, but is often limited by long scan times. Recently, spectroscopy with linear algebraic modeling (SLAM) was shown to provide compartment-averaged spectra resolved in one spatial dimension with many-fold reductions in scan-time. This was achieved using a small subset of the CSI phase-encoding steps from central image k-space that maximized the signal-to-noise ratio. Here, SLAM is extended to two- and three-dimensions (2D, 3D). In addition, SLAM is combined with sensitivity-encoded (SENSE) parallel imaging techniques, enabling the replacement of even more CSI phase-encoding steps to further accelerate scan-speed. A modified SLAM reconstruction algorithm is introduced that significantly reduces the effects of signal nonuniformity within compartments. Finally, main-field inhomogeneity corrections are provided, analogous to CSI. These methods are all tested on brain proton MRS data from a total of 24 patients with brain tumors, and in a human cardiac phosphorus 3D SLAM study at 3T. Acceleration factors of up to 120-fold versus CSI are demonstrated, including speed-up factors of 5-fold relative to already-accelerated SENSE CSI. Brain metabolites are quantified in SLAM and SENSE SLAM spectra and found to be indistinguishable from CSI measures from the same compartments. The modified reconstruction algorithm demonstrated immunity to maladjusted segmentation and errors from signal heterogeneity in brain data. In conclusion, SLAM demonstrates the potential to supplant CSI in studies requiring compartment-average spectra or large volume coverage, by dramatically reducing scan-time while providing essentially the same quantitative results.
Energy Technology Data Exchange (ETDEWEB)
Lashkevich, Michael; Pugai, Yaroslav [Landau Institute for Theoretical Physics, 142432 Chernogolovka, Moscow Region (Russian Federation); Moscow Institute of Physics and Technology, 141707 Dolgoprudny, Moscow Region (Russian Federation)
2013-12-11
We continue the study of form factors of descendant operators in the sinh- and sine-Gordon models in the framework of the algebraic construction proposed in [1]. We find the algebraic construction to be related to a particular limit of the tensor product of the deformed Virasoro algebra and a suitably chosen Heisenberg algebra. To analyze the space of local operators in the framework of the form factor formalism we introduce screening operators and construct singular and cosingular vectors in the Fock spaces related to the free field realization of the obtained algebra. We show that the singular vectors are expressed in terms of the degenerate Macdonald polynomials with rectangular partitions. We study the matrix elements that contain a singular vector in one chirality and a cosingular vector in the other chirality and find them to lead to the resonance identities already known in the conformal perturbation theory. Besides, we give a new derivation of the equation of motion in the sinh-Gordon theory, and a new representation for conserved currents.
Lashkevich, Michael
2013-01-01
We continue the study of form factors of descendant operators in the sinh- and sine-Gordon models in the framework of the algebraic construction proposed in [arXiv:0812.4776]. We find the algebraic construction to be related to a particular limit of the tensor product of the deformed Virasoro algebra and a suitably chosen Heisenberg algebra. To analyze the space of local operators in the framework of the form factor formalism we introduce screening operators and construct singular and cosingular vectors in the Fock spaces related to the free field realization of the obtained algebra. We show that the singular vectors are expressed in terms of the degenerate Macdonald polynomials with rectangular partitions. We study the matrix elements that contain a singular vector in one chirality and a cosingular vector in the other chirality and find them to lead to the resonance identities already known in the conformal perturbation theory. Besides, we give a new derivation of the equation of motion in the sinh-Gordon th...
Weekly Fleet Assignment Model and Algorithm
Institute of Scientific and Technical Information of China (English)
ZHU Xing-hui; ZHU Jin-fu; GONG Zai-wu
2007-01-01
A 0-1 integer programming model for weekly fleet assignment was put forward based on linear network and weekly flight scheduling in China. In this model, the objective function is to maximize the total profit of fleet assignment, subject to the constraints of coverage, aircraft flow balance, fleet size, aircraft availability, aircraft usage, flight restriction, aircraft seat capacity,and stopover. Then the branch-and-bound algorithm based on special ordered set was applied to solve the model. At last, a realworld case study on an airline with 5 fleets, 48 aircrafts and 1 786 flight legs indicated that the profit increase was $1591276 one week and the running time was no more than 4 min, which shows that the model and algorithm are fairly good for domestic airline.
Deriving algebraic specification of composite web service from BPMN model%从BPMN模型导出组合服务的代数规约
Institute of Scientific and Technical Information of China (English)
余波
2013-01-01
Aiming at the problem of deriving specifications from composite Web service defined by BPEL when testing the service automatically based on specification, an approach is presented for the sake of deriving algebraic specification defined by algebraic specification language CASOCC-WS of composite Web service defined by BPEL from BPMN model. Firstly, the rules for translating BPMN model into signature and translating BPMN structure into regular expressions are presented. Secondly, the algorithm for deriving the terms of axiom equation from the regular expression is proposed, and the heuristic rules for constructing axioms from the terms manually are proposed. At last, a prototype tool is implemented for deriving signature of composite web service from BPMN model. A case study shows that the presented approach is suitable to writing algebraic specification from the definition of BPEL service.%针对应用规约自动测试BPEL表示组合服务时需要解决BPEL服务的规约生成问题,提出了一种从BPMN模型导出BPEL规范定义的组合Web服务的由代数规约语言CASOCC-WS表示的代数规约方法.首先,定义从BPMN模型转换成基调的规则和从BPMN结构转换成正则表达式的规则,设计由正则表达式导出构成公理的项的算法；然后,提出根据所得的项人工书写公理的启发式规则；最后,实现一个从BPMN模型导出组合服务基调的工具原型.案例研究表明,该方法可以解决BPEL服务的代数规约生成问题.
Reachability for Finite-State Process Algebras Using Static Analysis
DEFF Research Database (Denmark)
Skrypnyuk, Nataliya; Nielson, Flemming
2011-01-01
In this work we present an algorithm for solving the reachability problem in finite systems that are modelled with process algebras. Our method uses Static Analysis, in particular, Data Flow Analysis, of the syntax of a process algebraic system with multi-way synchronisation. The results...... of the Data Flow Analysis are used in order to “cut off” some of the branches in the reachability analysis that are not important for determining, whether or not a state is reachable. In this way, it is possible for our reachability algorithm to avoid building large parts of the system altogether and still...
Computational Granular Dynamics Models and Algorithms
Pöschel, Thorsten
2005-01-01
Computer simulations not only belong to the most important methods for the theoretical investigation of granular materials, but also provide the tools that have enabled much of the expanding research by physicists and engineers. The present book is intended to serve as an introduction to the application of numerical methods to systems of granular particles. Accordingly, emphasis is placed on a general understanding of the subject rather than on the presentation of the latest advances in numerical algorithms. Although a basic knowledge of C++ is needed for the understanding of the numerical methods and algorithms in the book, it avoids usage of elegant but complicated algorithms to remain accessible for those who prefer to use a different programming language. While the book focuses more on models than on the physics of granular material, many applications to real systems are presented.
Efficient Algorithms for Parsing the DOP Model
Goodman, J
1996-01-01
Excellent results have been reported for Data-Oriented Parsing (DOP) of natural language texts (Bod, 1993). Unfortunately, existing algorithms are both computationally intensive and difficult to implement. Previous algorithms are expensive due to two factors: the exponential number of rules that must be generated and the use of a Monte Carlo parsing algorithm. In this paper we solve the first problem by a novel reduction of the DOP model to a small, equivalent probabilistic context-free grammar. We solve the second problem by a novel deterministic parsing strategy that maximizes the expected number of correct constituents, rather than the probability of a correct parse tree. Using the optimizations, experiments yield a 97% crossing brackets rate and 88% zero crossing brackets rate. This differs significantly from the results reported by Bod, and is comparable to results from a duplication of Pereira and Schabes's (1992) experiment on the same data. We show that Bod's results are at least partially due to an e...
Jorgensen, PET
1987-01-01
Historically, operator theory and representation theory both originated with the advent of quantum mechanics. The interplay between the subjects has been and still is active in a variety of areas.This volume focuses on representations of the universal enveloping algebra, covariant representations in general, and infinite-dimensional Lie algebras in particular. It also provides new applications of recent results on integrability of finite-dimensional Lie algebras. As a central theme, it is shown that a number of recent developments in operator algebras may be handled in a particularly e
Lie-Algebraic Approach for Pricing Zero-Coupon Bonds in Single-Factor Interest Rate Models
Directory of Open Access Journals (Sweden)
C. F. Lo
2013-01-01
Full Text Available The Lie-algebraic approach has been applied to solve the bond pricing problem in single-factor interest rate models. Four of the popular single-factor models, namely, the Vasicek model, Cox-Ingersoll-Ross model, double square-root model, and Ahn-Gao model, are investigated. By exploiting the dynamical symmetry of their bond pricing equations, analytical closed-form pricing formulae can be derived in a straightfoward manner. Time-varying model parameters could also be incorporated into the derivation of the bond price formulae, and this has the added advantage of allowing yield curves to be fitted. Furthermore, the Lie-algebraic approach can be easily extended to formulate new analytically tractable single-factor interest rate models.
Bernardi, G; Ord, S M; Greenhill, L J; Pindor, B; Wayth, R B; Wyithe, J S B
2010-01-01
We present a method for subtracting point sources from interferometric radio images via forward modeling of the instrument response and involving an algebraic nonlinear minimization. The method is applied to simulated maps of the Murchison Wide-field Array but is generally useful in cases where only image data are available. After source subtraction, the residual maps have no statistical difference to the expected thermal noise distribution at all angular scales, indicating high effectiveness in the subtraction. Simulations indicate that the errors in recovering the source parameters decrease with increasing signal-to-noise ratio, which is consistent with the theoretical measurement errors. In applying the technique to simulated snapshot observations with the Murchison Wide-field Array, we found that all 101 sources present in the simulation were recovered with an average position error of 10 arcsec and an average flux density error of 0.15%. This led to a dynamic range increase of approximately 3 orders of m...
Modelling and temporal performances evaluation of networked control systems using (max, +) algebra
Ammour, R.; Amari, S.
2015-01-01
In this paper, we address the problem of temporal performances evaluation of producer/consumer networked control systems. The aim is to develop a formal method for evaluating the response time of this type of control systems. Our approach consists on modelling, using Petri nets classes, the behaviour of the whole architecture including the switches that support multicast communications used by this protocol. (max, +) algebra formalism is then exploited to obtain analytical formulas of the response time and the maximal and minimal bounds. The main novelty is that our approach takes into account all delays experienced at the different stages of networked automation systems. Finally, we show how to apply the obtained results through an example of networked control system.
New insights in the standard model of quantum physics in Clifford algebra
Daviau, Claude
2013-01-01
Why Clifford algebra is the true mathematical frame of the standard model of quantum physics. Why the time is everywhere oriented and why the left side shall never become the right side. Why positrons have also a positive proper energy. Why there is a Planck constant. Why a mass is not a charge. Why a system of particles implies the existence of the inverse of the individual wave function. Why a fourth neutrino should be a good candidate for black matter. Why concepts as “parity” and “reverse” are essential. Why the electron of a H atom is in only one bound state. Plus 2 very remarkable identities, and the invariant wave equations that they imply. Plus 3 generations and 4 neutrinos. Plus 5 dimensions in the space and 6 dimensions in space-time…
Killing scalar of non-linear σ-model on G/H realizing the classical exchange algebra
Energy Technology Data Exchange (ETDEWEB)
Aoyama, Shogo, E-mail: spsaoya@ipc.shizuoka.ac.jp
2014-10-07
The Poisson brackets for non-linear σ-models on G/H are set up on the light-like plane. A quantity which transforms irreducibly by the Killing vectors, called Killing scalar, is constructed in an arbitrary representation of G. It is shown to satisfy the classical exchange algebra.
Study of Transitions in the Atmospheric Boundary Layer Using Explicit Algebraic Turbulence Models
Lazeroms, W. M. J.; Svensson, G.; Bazile, E.; Brethouwer, G.; Wallin, S.; Johansson, A. V.
2016-10-01
We test a recently developed engineering turbulence model, a so-called explicit algebraic Reynolds-stress (EARS) model, in the context of the atmospheric boundary layer. First of all, we consider a stable boundary layer used as the well-known first test case from the Global Energy and Water Cycle Experiment Atmospheric Boundary Layer Study (GABLS1). The model is shown to agree well with data from large-eddy simulations (LES), and this agreement is significantly better than for a standard operational scheme with a prognostic equation for turbulent kinetic energy. Furthermore, we apply the model to a case with a (idealized) diurnal cycle and make a qualitative comparison with a simpler first-order model. Some interesting features of the model are highlighted, pertaining to its stronger foundation on physical principles. In particular, the use of more prognostic equations in the model is shown to give a more realistic dynamical behaviour. This qualitative study is the first step towards a more detailed comparison, for which additional LES data are needed.
Issa, A Nourou
2010-01-01
Non-Hom-associative algebras and Hom-Akivis algebras are introduced. The commutator-Hom-associator algebra of a non-Hom-associative algebra is a Hom-Akivis algebra. It is shown that non-Hom-associative algebras can be obtained from nonassociative algebras by twisting along algebra automorphisms while Hom-Akivis algebras can be obtained from Akivis algebras by twisting along algebra endomorphisms.
Genetic Algorithm Based Microscale Vehicle Emissions Modelling
Directory of Open Access Journals (Sweden)
Sicong Zhu
2015-01-01
Full Text Available There is a need to match emission estimations accuracy with the outputs of transport models. The overall error rate in long-term traffic forecasts resulting from strategic transport models is likely to be significant. Microsimulation models, whilst high-resolution in nature, may have similar measurement errors if they use the outputs of strategic models to obtain traffic demand predictions. At the microlevel, this paper discusses the limitations of existing emissions estimation approaches. Emission models for predicting emission pollutants other than CO2 are proposed. A genetic algorithm approach is adopted to select the predicting variables for the black box model. The approach is capable of solving combinatorial optimization problems. Overall, the emission prediction results reveal that the proposed new models outperform conventional equations in terms of accuracy and robustness.
Markov chains models, algorithms and applications
Ching, Wai-Ki; Ng, Michael K; Siu, Tak-Kuen
2013-01-01
This new edition of Markov Chains: Models, Algorithms and Applications has been completely reformatted as a text, complete with end-of-chapter exercises, a new focus on management science, new applications of the models, and new examples with applications in financial risk management and modeling of financial data.This book consists of eight chapters. Chapter 1 gives a brief introduction to the classical theory on both discrete and continuous time Markov chains. The relationship between Markov chains of finite states and matrix theory will also be highlighted. Some classical iterative methods
The Moyal Momentum algebra applied to (theta)-deformed 2d conformal models and KdV-hierarchies
Boulahoual, A
2002-01-01
The properties of the Das-Popowicz Moyal momentum algebra that we introduce in hep-th/0207242 are reexamined in details and used to discuss some aspects of integrable models and 2d conformal field theories. Among the results presented, we setup some useful convention notations which lead to extract some non trivial properties of the Moyal momentum algebra. We use the particular sub-algebra sl(n)-{Sigma}_{n}^{(0,n)} to construct the sl(2)-Liouville conformal model and its sl(3)-Toda extension. We show also that the central charge, a la Feigin-Fuchs, associated to the spin-2 conformal current of the (theta)-Liouville model is given by c(theta)=1+24.theta^{2}. Moreover, the results obtained for the Das-Popowicz Mm algebra are applied to study systematically some properties of the Moyal KdV and Boussinesq hierarchies generalizing some known results. We discuss also the primarity condition of conformal $w_{\\theta}$-currents and interpret this condition as being a dressing gauge symmetry in the Moyal momentum space...
Energy Technology Data Exchange (ETDEWEB)
Odesskii, A V [L.D. Landau Institute for Theoretical Physics, Russian Academy of Sciences, Moscow (Russian Federation)
2002-12-31
This survey is devoted to associative Z{sub {>=}}{sub 0}-graded algebras presented by n generators and n(n-1)/2 quadratic relations and satisfying the so-called Poincare-Birkhoff-Witt condition (PBW-algebras). Examples are considered of such algebras, depending on two continuous parameters (namely, on an elliptic curve and a point on it), that are flat deformations of the polynomial ring in n variables. Diverse properties of these algebras are described, together with their relations to integrable systems, deformation quantization, moduli spaces, and other directions of modern investigations.
The algebra of the general Markov model on phylogenetic trees and networks.
Sumner, J G; Holland, B R; Jarvis, P D
2012-04-01
It is known that the Kimura 3ST model of sequence evolution on phylogenetic trees can be extended quite naturally to arbitrary split systems. However, this extension relies heavily on mathematical peculiarities of the associated Hadamard transformation, and providing an analogous augmentation of the general Markov model has thus far been elusive. In this paper, we rectify this shortcoming by showing how to extend the general Markov model on trees to include incompatible edges; and even further to more general network models. This is achieved by exploring the algebra of the generators of the continuous-time Markov chain together with the “splitting” operator that generates the branching process on phylogenetic trees. For simplicity, we proceed by discussing the two state case and then show that our results are easily extended to more states with little complication. Intriguingly, upon restriction of the two state general Markov model to the parameter space of the binary symmetric model, our extension is indistinguishable from the Hadamard approach only on trees; as soon as any incompatible splits are introduced the two approaches give rise to differing probability distributions with disparate structure. Through exploration of a simple example, we give an argument that our extension to more general networks has desirable properties that the previous approaches do not share. In particular, our construction allows for convergent evolution of previously divergent lineages; a property that is of significant interest for biological applications.
Splitting full matrix algebras over algebraic number fields
Ivanyos, Gábor; Schicho, Joseph
2011-01-01
Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is siomorphic to the algebra M_n(K) of n by n matrices over K for some positive integer n. Suppose that d, n and D are bounded. Then an isomorphism of A with M_n(K) can be constructed by a polynomial time ff-algorithm. (An ff-algorithm is a deterministic procedure which is allowed to call oracles for factoring integers and factoring univariate polynomials over finite fields.) As a consequence, we obtain a polynomial time ff-algorithm to compute isomorphisms of central simple algebras of bounded degree over K.
Load-balancing algorithms for climate models
Energy Technology Data Exchange (ETDEWEB)
Foster, I.T.; Toonen, B.R.
1994-06-01
Implementations of climate models on scalable parallel computer systems can suffer from load imbalances due to temporal and spatial variations in the amount of computation required for physical parameterizations such as solar radiation and convective adjustment. We have developed specialized techniques for correcting such imbalances. These techniques are incorporated in a general-purpose, programmable load-balancing library that allows the mapping of computation to processors to be specified as a series of maps generated by a programmer-supplied load-balancing module. The communication required to move from one map to another is performed automatically by the library, without programmer intervention. In this paper, we de scribe the load-balancing problem and the techniques that we have developed to solve it. We also describe specific load-balancing algorithms that we have developed for PCCM2, a scalable parallel implementation of the community Climate Model, and present experimental results that demonstrate the effectiveness of these algorithms on parallel computers.
Load-balancing algorithms for climate models
Foster, I. T.; Toonen, B. R.
Implementations of climate models on scalable parallel computer systems can suffer from load imbalances due to temporal and spatial variations in the amount of computation required for physical parameterizations such as solar radiation and convective adjustment. We have developed specialized techniques for correcting such imbalances. These techniques are incorporated in a general-purpose, programmable load-balancing library that allows the mapping of computation to processors to be specified as a series of maps generated by a programmer-supplied load-balancing module. The communication required to move from one map to another is performed automatically by the library, without programmer intervention. In this paper, we describe the load-balancing problem and the techniques that we have developed to solve it. We also describe specific load-balancing algorithms that we have developed for PCCM2, a scalable parallel implementation of the community climate model, and present experimental results that demonstrate the effectiveness of these algorithms on parallel computers.
Computational algebraic geometry for statistical modeling FY09Q2 progress.
Energy Technology Data Exchange (ETDEWEB)
Thompson, David C.; Rojas, Joseph Maurice; Pebay, Philippe Pierre
2009-03-01
This is a progress report on polynomial system solving for statistical modeling. This is a progress report on polynomial system solving for statistical modeling. This quarter we have developed our first model of shock response data and an algorithm for identifying the chamber cone containing a polynomial system in n variables with n+k terms within polynomial time - a significant improvement over previous algorithms, all having exponential worst-case complexity. We have implemented and verified the chamber cone algorithm for n+3 and are working to extend the implementation to handle arbitrary k. Later sections of this report explain chamber cones in more detail; the next section provides an overview of the project and how the current progress fits into it.
Linear Algebra and Smarandache Linear Algebra
Vasantha, Kandasamy
2003-01-01
The present book, on Smarandache linear algebra, not only studies the Smarandache analogues of linear algebra and its applications, it also aims to bridge the need for new research topics pertaining to linear algebra, purely in the algebraic sense. We have introduced Smarandache semilinear algebra, Smarandache bilinear algebra and Smarandache anti-linear algebra and their fuzzy equivalents. Moreover, in this book, we have brought out the study of linear algebra and ve...
Algebraic and group structure for bipartite anisotropic Ising model on a non-local basis
Delgado, Francisco
2015-01-01
Entanglement is considered a basic physical resource for modern quantum applications as Quantum Information and Quantum Computation. Interactions based on specific physical systems able to generate and sustain entanglement are subject to deep research to get understanding and control on it. Atoms, ions or quantum dots are considered key pieces in quantum applications because they are elements in the development toward a scalable spin-based quantum computer through universal and basic quantum operations. Ising model is a type of interaction generating entanglement in quantum systems based on matter. In this work, a general bipartite anisotropic Ising model including an inhomogeneous magnetic field is analyzed in a non-local basis. This model summarizes several particular models presented in literature. When evolution is expressed in the Bell basis, it shows a regular block structure suggesting a SU(2) decomposition. Then, their algebraic properties are analyzed in terms of a set of physical parameters which define their group structure. In particular, finite products of pulses in this interaction are analyzed in terms of SU(4) covering. Thus, evolution denotes remarkable properties, in particular those related potentially with entanglement and control, which give a fruitful arena for further quantum developments and generalization.
Sparse modeling theory, algorithms, and applications
Rish, Irina
2014-01-01
""A comprehensive, clear, and well-articulated book on sparse modeling. This book will stand as a prime reference to the research community for many years to come.""-Ricardo Vilalta, Department of Computer Science, University of Houston""This book provides a modern introduction to sparse methods for machine learning and signal processing, with a comprehensive treatment of both theory and algorithms. Sparse Modeling is an ideal book for a first-year graduate course.""-Francis Bach, INRIA - École Normale Supřieure, Paris
Evolutionary algorithms in genetic regulatory networks model
Raza, Khalid
2012-01-01
Genetic Regulatory Networks (GRNs) plays a vital role in the understanding of complex biological processes. Modeling GRNs is significantly important in order to reveal fundamental cellular processes, examine gene functions and understanding their complex relationships. Understanding the interactions between genes gives rise to develop better method for drug discovery and diagnosis of the disease since many diseases are characterized by abnormal behaviour of the genes. In this paper we have reviewed various evolutionary algorithms-based approach for modeling GRNs and discussed various opportunities and challenges.
Cavanagh, Sean
2009-01-01
As educators and policymakers search for ways to prepare students for the rigors of algebra, teachers in the Helena, Montana, school system are starting early by attempting to nurture students' algebraic-reasoning ability, as well as their basic number skills, in early elementary school, rather than waiting until middle or early high school.…
G/G gauged WZW-matter model, Bethe Ansatz for q-boson model and Commutative Frobenius algebra
Energy Technology Data Exchange (ETDEWEB)
Okuda, Satoshi [Department of Physics, Rikkyo University,Toshima, Tokyo 171-8501 (Japan); Yoshida, Yutaka [High Energy Accelerator Research Organization (KEK),Tsukuba, Ibaraki 305-0801 (Japan)
2014-03-03
We investigate the correspondence between two dimensional topological gauge theories and quantum integrable systems discovered by Moore, Nekrasov, Shatashvili. This correspondence means that the hidden quantum integrable structure exists in the topological gauge theories. We showed the correspondence between the G/G gauged WZW model and the phase model in JHEP 11 (2012) 146 (arXiv:1209.3800). In this paper, we study a one-parameter deformation for this correspondence and show that the G/G gauged WZW model coupled to additional matters corresponds to the q-boson model. Furthermore, we investigate this correspondence from the viewpoint of the commutative Frobenius algebra, the axiom of the two dimensional topological quantum field theory.
Institute of Scientific and Technical Information of China (English)
Xianbin Wen; Hua Zhang; Jianguang Zhang; Xu Jiao; Lei Wang
2009-01-01
A novel method that hybridizes genetic algorithm (GA) and expectation maximization (EM) algorithm for the classification of syn-thetic aperture radar (SAR) imagery is proposed by the finite Gaussian mixtures model (GMM) and multiscale autoregressive (MAR)model. This algorithm is capable of improving the global optimality and consistency of the classification performance. The experiments on the SAR images show that the proposed algorithm outperforms the standard EM method significantly in classification accuracy.
Algebra-Geometry of Piecewise Algebraic Varieties
Institute of Scientific and Technical Information of China (English)
Chun Gang ZHU; Ren Hong WANG
2012-01-01
Algebraic variety is the most important subject in classical algebraic geometry.As the zero set of multivariate splines,the piecewise algebraic variety is a kind generalization of the classical algebraic variety.This paper studies the correspondence between spline ideals and piecewise algebraic varieties based on the knowledge of algebraic geometry and multivariate splines.
Institute of Scientific and Technical Information of China (English)
SUNHaiyan; WANGWeijing; 等
2002-01-01
In accordance to the anisotropic feature of turbulent flow, an anisotropic algebraic stress model is adopted to predict the turbulent flow field and turbulent characteristics generated by a Rushton disc turbine with the improved inner-outer iterative procedure. The predicted turbulent flow is compared with experimental data and the simulation by the standard κ-ε turbulence model. The anisotropic algebraic stress model is found to give better prediction than the standard κ-ε turbulence model. The predicted turbulent flow field is in accordance to experimental data and the trend of the turbulence intensity can be effectively reflected in the simulation. The distribution of turbulent shear rate in the stirred tanks was simulated with the established numerical procedure.
Constrained WZWN models on G/{S⊗U(1)"n} and exchange algebra of G-primaries
Energy Technology Data Exchange (ETDEWEB)
Aoyama, Shogo, E-mail: spsaoya@ipc.shizuoka.ac.jp; Ishii, Katsuyuki
2013-11-11
Consistently constrained WZWN models on G/{S⊗U(1)"n} is given by constraining currents of the WZWN models with G. Poisson brackets are set up on the light-like plane. Using them we show the Virasoro algebra for the energy–momentum tensor of constrained WZWN models. We find a G-primary which satisfies a classical exchange algebra in an arbitrary representation of G. The G-primary and the constrained currents are also shown to obey the conformal transformation with respect to the energy–momentum tensor. It is checked that conformal weight of the constrained currents is 0. This is necessary for the consistency for our formulation of constrained WZWN models.
Living on the Edge: A Toy Model for Holographic Reconstruction of Algebras with Centers
Donnelly, William; Marolf, Donald; Wien, Jason
2016-01-01
We generalize the Pastawski-Yoshida-Harlow-Preskill (HaPPY) holographic quantum error-correcting code to provide a toy model for bulk gauge fields or linearized gravitons. The key new elements are the introduction of degrees of freedom on the links (edges) of the associated tensor network and their connection to further copies of the HaPPY code by an appropriate isometry. The result is a model in which boundary regions allow the reconstruction of bulk algebras with central elements living on the interior edges of the (greedy) entanglement wedge, and where these central elements can also be reconstructed from complementary boundary regions. In addition, the entropy of boundary regions receives both Ryu-Takayanagi-like contributions and further corrections that model the $\\frac{\\delta \\text{Area}}{4G_N}$ term of Faulkner, Lewkowycz, and Maldacena. Comparison with Yang-Mills theory then suggests that this $\\frac{\\delta \\text{Area}}{4G_N}$ term can be reinterpreted as a part of the bulk entropy of gravitons under...
Calculus domains modelled using an original bool algebra based on polygons
Oanta, E.; Panait, C.; Raicu, A.; Barhalescu, M.; Axinte, T.
2016-08-01
Analytical and numerical computer based models require analytical definitions of the calculus domains. The paper presents a method to model a calculus domain based on a bool algebra which uses solid and hollow polygons. The general calculus relations of the geometrical characteristics that are widely used in mechanical engineering are tested using several shapes of the calculus domain in order to draw conclusions regarding the most effective methods to discretize the domain. The paper also tests the results of several CAD commercial software applications which are able to compute the geometrical characteristics, being drawn interesting conclusions. The tests were also targeting the accuracy of the results vs. the number of nodes on the curved boundary of the cross section. The study required the development of an original software consisting of more than 1700 computer code lines. In comparison with other calculus methods, the discretization using convex polygons is a simpler approach. Moreover, this method doesn't lead to large numbers as the spline approximation did, in that case being required special software packages in order to offer multiple, arbitrary precision. The knowledge resulted from this study may be used to develop complex computer based models in engineering.
Zhang, Yue; Zheng, Yan; Liu, Xi; Zhang, Qingling; Li, Aihua
2016-11-01
This study considers a class of differential algebraic stage-structured bio-economic models with stochastic fluctuations. The stochastic bio-economic model is simplified to an Itô equation using the stochastic averaging method. The stochastic stability, Hopf bifurcation, and P-bifurcation are discussed based on the singular boundary theory of the diffusion process for the system and the invariant measure theory of dynamic systems. Numerical simulations are presented to illustrate our main results.
Robot Control Based On Spatial-Operator Algebra
Rodriguez, Guillermo; Kreutz, Kenneth K.; Jain, Abhinandan
1992-01-01
Method for mathematical modeling and control of robotic manipulators based on spatial-operator algebra providing concise representation and simple, high-level theoretical frame-work for solution of kinematical and dynamical problems involving complicated temporal and spatial relationships. Recursive algorithms derived immediately from abstract spatial-operator expressions by inspection. Transition from abstract formulation through abstract solution to detailed implementation of specific algorithms to compute solution greatly simplified. Complicated dynamical problems like two cooperating robot arms solved more easily.
Ilker, Efe; Berker, A Nihat
2014-12-01
Distinctive orderings and phase diagram structures are found, from renormalization-group theory, for odd q-state clock spin-glass models in d=3 dimensions. These models exhibit asymmetric phase diagrams, as is also the case for quantum Heisenberg spin-glass models. No finite-temperature spin-glass phase occurs. For all odd q≥5, algebraically ordered antiferromagnetic phases occur. One such phase is dominant and occurs for all q≥5. Other such phases occupy small low-temperature portions of the phase diagrams and occur for 5≤q≤15. All algebraically ordered phases have the same structure, determined by an attractive finite-temperature sink fixed point where a dominant and a subdominant pair states have the only nonzero Boltzmann weights. The phase transition critical exponents quickly saturate to the high q value.
C*-index of observable algebras in G-spin model
Institute of Scientific and Technical Information of China (English)
JIANG; Lining
2005-01-01
In two-dimensional lattice spin systems in which the spins take values in a finite group G,one can define a field algebra F which carries an action of a Hopf algebra D(G),the double algebra of G and moreover,an action of D(G; H),which is a subalgebra of D(G) determined by a subgroup H of G,so that F becomes a modular algebra.The concrete construction of D(G; H)-invariant subspace AH in F is given.By constructing the quasi-basis of conditional expectation γG of AH onto AG,the C*-index of γG is exactly the index of H in G.
Baldwin, B. S.; Maccormack, R. W.
1976-01-01
Various modifications of the conventional algebraic eddy viscosity turbulence model are investigated for application to separated flows. Friction velocity is defined in a way that avoids singular behavior at separation and reattachment but reverts to the conventional definition for flows with small pressure gradients. This leads to a modified law of the wall for separated flows. The effect on the calculated flow field of changes in the model that affect the eddy viscosity at various distances from the wall are determined by (1) switching from Prandtl's form to an inner layer formula due to Clauser at various distances from the wall, (2) varying the constant in the Van Driest damping factor, (3) using Clauser's inner layer formula all the way to the wall, and (4) applying a relaxation procedure in the evaluation of the constant in Clauser's inner layer formula. Numerical solutions of the compressible Navier-Stokes equations are used to determine the effects of the modifications. Experimental results from shock-induced separated flows at Mach numbers 2.93 and 8.45 are used for comparison. For these cases improved predictions of wall pressure distribution and positions of separation and reattachment are obtained from the relaxation version of the Clauser inner layer eddy viscosity formula.
Chisolm, Eric
2012-01-01
This is an introduction to geometric algebra, an alternative to traditional vector algebra that expands on it in two ways: 1. In addition to scalars and vectors, it defines new objects representing subspaces of any dimension. 2. It defines a product that's strongly motivated by geometry and can be taken between any two objects. For example, the product of two vectors taken in a certain way represents their common plane. This system was invented by William Clifford and is more commonly known as Clifford algebra. It's actually older than the vector algebra that we use today (due to Gibbs) and includes it as a subset. Over the years, various parts of Clifford algebra have been reinvented independently by many people who found they needed it, often not realizing that all those parts belonged in one system. This suggests that Clifford had the right idea, and that geometric algebra, not the reduced version we use today, deserves to be the standard "vector algebra." My goal in these notes is to describe geometric al...
Models and Algorithms for Tracking Target with Coordinated Turn Motion
Directory of Open Access Journals (Sweden)
Xianghui Yuan
2014-01-01
Full Text Available Tracking target with coordinated turn (CT motion is highly dependent on the models and algorithms. First, the widely used models are compared in this paper—coordinated turn (CT model with known turn rate, augmented coordinated turn (ACT model with Cartesian velocity, ACT model with polar velocity, CT model using a kinematic constraint, and maneuver centered circular motion model. Then, in the single model tracking framework, the tracking algorithms for the last four models are compared and the suggestions on the choice of models for different practical target tracking problems are given. Finally, in the multiple models (MM framework, the algorithm based on expectation maximization (EM algorithm is derived, including both the batch form and the recursive form. Compared with the widely used interacting multiple model (IMM algorithm, the EM algorithm shows its effectiveness.
Link mining models, algorithms, and applications
Yu, Philip S; Faloutsos, Christos
2010-01-01
This book presents in-depth surveys and systematic discussions on models, algorithms and applications for link mining. Link mining is an important field of data mining. Traditional data mining focuses on 'flat' data in which each data object is represented as a fixed-length attribute vector. However, many real-world data sets are much richer in structure, involving objects of multiple types that are related to each other. Hence, recently link mining has become an emerging field of data mining, which has a high impact in various important applications such as text mining, social network analysi
Genetic Algorithms Principles Towards Hidden Markov Model
Directory of Open Access Journals (Sweden)
Nabil M. Hewahi
2011-10-01
Full Text Available In this paper we propose a general approach based on Genetic Algorithms (GAs to evolve Hidden Markov Models (HMM. The problem appears when experts assign probability values for HMM, they use only some limited inputs. The assigned probability values might not be accurate to serve in other cases related to the same domain. We introduce an approach based on GAs to find
out the suitable probability values for the HMM to be mostly correct in more cases than what have been used to assign the probability values.
Elements of algebraic coding systems
Cardoso da Rocha, Jr, Valdemar
2014-01-01
Elements of Algebraic Coding Systems is an introductory textto algebraic coding theory. In the first chapter, you'll gain insideknowledge of coding fundamentals, which is essential for a deeperunderstanding of state-of-the-art coding systems.This book is a quick reference for those who are unfamiliar withthis topic, as well as for use with specific applications such as cryptographyand communication. Linear error-correcting block codesthrough elementary principles span eleven chapters of the text.Cyclic codes, some finite field algebra, Goppa codes, algebraic decodingalgorithms, and applications in public-key cryptography andsecret-key cryptography are discussed, including problems and solutionsat the end of each chapter. Three appendices cover the Gilbertbound and some related derivations, a derivation of the Mac-Williams' identities based on the probability of undetected error,and two important tools for algebraic decoding-namely, the finitefield Fourier transform and the Euclidean algorithm for polynomials.
Kolman, Bernard
1985-01-01
College Algebra, Second Edition is a comprehensive presentation of the fundamental concepts and techniques of algebra. The book incorporates some improvements from the previous edition to provide a better learning experience. It provides sufficient materials for use in the study of college algebra. It contains chapters that are devoted to various mathematical concepts, such as the real number system, the theory of polynomial equations, exponential and logarithmic functions, and the geometric definition of each conic section. Progress checks, warnings, and features are inserted. Every chapter c
Garrett, Paul B
2007-01-01
Designed for an advanced undergraduate- or graduate-level course, Abstract Algebra provides an example-oriented, less heavily symbolic approach to abstract algebra. The text emphasizes specifics such as basic number theory, polynomials, finite fields, as well as linear and multilinear algebra. This classroom-tested, how-to manual takes a more narrative approach than the stiff formalism of many other textbooks, presenting coherent storylines to convey crucial ideas in a student-friendly, accessible manner. An unusual feature of the text is the systematic characterization of objects by universal
几何模型在线性代数教学中的应用%Application of Geometric Model in Linear Algebra Teaching
Institute of Scientific and Technical Information of China (English)
席政军
2013-01-01
Through analyzing the relationship between geometric model and linear algebra, this article focuses on the application of geometric model in linear algebra, and discusses the classroom teaching of linear algebra.%本文通过几何模型与线性代数之间的关系，重点讨论几何模型在线性代数中的应用，并对线性代数课堂教学进行了初步探讨。
Institute of Scientific and Technical Information of China (English)
XIEBing_Hao; ZHANGHong－Biao; 等
2002-01-01
An algebraic diagonalization method is proposed.As two examples,the Hamiltonians of BCS ground state under mean-field approximation and XXZ antiferromagnetic model in linear spin-wave frame have been diagonalized by using SU(2),SU(1,1) Lie algebraic method,respectively.Meanwhile,the eignenstates of the above two models are revealed to be SU(2),SU(1,1) coherent states,respectively,The relation between the usual Bogoliubov-Valatin transformation and the algebraic method in a special case is also discussed.
A Multiple Model Approach to Modeling Based on LPF Algorithm
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
Input-output data fitting methods are often used for unknown-structure nonlinear system modeling. Based on model-on-demand tactics, a multiple model approach to modeling for nonlinear systems is presented. The basic idea is to find out, from vast historical system input-output data sets, some data sets matching with the current working point, then to develop a local model using Local Polynomial Fitting (LPF) algorithm. With the change of working points, multiple local models are built, which realize the exact modeling for the global system. By comparing to other methods, the simulation results show good performance for its simple, effective and reliable estimation.``
Super Lie n-algebra extensions, higher WZW models, and super p-branes with tensor multiplet fields
Fiorenza, Domenico; Schreiber, Urs
2013-01-01
We formalize higher dimensional and higher gauge WZW-type sigma-model local prequantum field theory, and discuss its rationalized/perturbative description in (super-)Lie n-algebra homotopy theory (the true home of the "FDA"-language used in the supergravity literature). We show generally how the intersection laws for such higher WZW-type sigma-model branes (open brane ending on background brane) are encoded precisely in (super-) L-infinity-extension theory and how the resulting "extended (super-)spacetimes" formalize spacetimes containing sigma model brane condensates. As an application we prove in Lie n-algebra homotopy theory that the complete super p-brane spectrum of superstring/M-theory is realized this way, including the pure sigma-model branes (the "old brane scan") but also the branes with tensor multiplet worldvolume fields, notably the D-branes and the M5-brane. For instance the degree-0 piece of the higher symmetry algebra of 11-dimensional spacetime with an M2-brane condensate turns out to be the ...
Institute of Scientific and Technical Information of China (English)
ZHAO xiao-Song; L(U) Jian-Qin
2009-01-01
Both the PIC(Particle-In-Cell) model and the Lie algebraic method can be used to simulate the transport of intense continuous beams.The PIC model is to calculate the space charge field,which is blended into the external field,and then simulate the trajectories of particles in the total field;the Lie algebraic method is to simulate the intense continuous beam transport with transport matrixes.Two simulation codes based on the two methods are developed respectively,and the simulated results of transport in a set of electrostatic lenses are compared.It is found that the results from the two codes are in agreement with each other.and both approaches have their own merits.
Martín, C P; Tamarit, C
2007-01-01
We discuss the renormalizability of the noncommutative U(1)Higgs-Kibble model formulated within the enveloping-algebra approach. We consider both the phase of the model with unbroken gauge symmetry and the phase with spontaneously broken gauge symmetry. We show that against all odds the gauge sector of the model is always one-loop renormalizable at first order in theta^{mu nu}, perhaps, hinting at the existence of a new symmetry of the gauge sector of the model. However, we also show that the matter sector of the model is non-renormalizable whatever the phase.
Martín, Carmelo P.; Sánchez-Ruiz, Domingo; Tamarit, Carlos
2007-02-01
We discuss the renormalizability of the noncommutative U(1) Higgs-Kibble model formulated within the enveloping-algebra approach. We consider both the phase of the model with unbroken gauge symmetry and the phase with spontaneously broken gauge symmetry. We show that against all odds the gauge sector of the model is always one-loop renormalizable at first order in θμν, perhaps, hinting at the existence of a new symmetry of the gauge sector of the model. However, we also show that the matter sector of the model is non-renormalizable whatever the phase.
Computer algebra in spacetime embedding
Roque, Waldir L
2014-01-01
In this paper we describe an algorithm to determine the vectors normal to a space-time V4 embedded in a pseudo-Euclidean manifold M4+n. An application of this algorithm is given considering the Schwarzchild space-time geometry embedded in a 6 dimensional pseudo-Euclidean manifold, using the algebraic computing system REDUCE.
On some spurious mode issues in shallow-water models using a linear algebra approach
Le Roux, D. Y.; Sène, A.; Rostand, V.; Hanert, E.
Numerical methods that are usually employed in ocean modelling are typically finite-difference, finite and spectral-element techniques. For most of these methods the coupling between the momentum and continuity equations is a delicate problem and it usually leads to spurious solutions in the representation of inertia-gravity waves. The spurious modes have a wide range of characteristics and may take the form of pressure (surface-elevation), velocity and/or Coriolis modes. The modes usually cause aliasing and an accumulation of energy in the smallest-resolvable scale, leading to noisy solutions. The Fourier analysis has proven practical and beneficial to describe the spurious solutions of several classical schemes. However it is restricted to uniform meshes on which the variables are regularly distributed. In this paper, a linear algebra approach is proposed to study the existence and the behaviour of stationary spurious modes associated with zero frequency, for some popular finite-difference and finite-element grids. The present approach is performed on uniform meshes but it applies equally well to regular as well as unstructured meshes with irregular geometry for the finite-element schemes.
"Generalized" algebraic Bethe ansatz, Gaudin-type models and Zp-graded classical r-matrices
Skrypnyk, T.
2016-12-01
We consider quantum integrable systems associated with reductive Lie algebra gl (n) and Cartan-invariant non-skew-symmetric classical r-matrices. We show that under certain restrictions on the form of classical r-matrices "nested" or "hierarchical" Bethe ansatz usually based on a chain of subalgebras gl (n) ⊃ gl (n - 1) ⊃ . . . ⊃ gl (1) is generalized onto the other chains or "hierarchies" of subalgebras. We show that among the r-matrices satisfying such the restrictions there are "twisted" or Zp-graded non-skew-symmetric classical r-matrices. We consider in detail example of the generalized Gaudin models with and without external magnetic field associated with Zp-graded non-skew-symmetric classical r-matrices and find the spectrum of the corresponding Gaudin-type hamiltonians using nested Bethe ansatz scheme and a chain of subalgebras gl (n) ⊃ gl (n -n1) ⊃ gl (n -n1 -n2) ⊃ gl (n - (n1 + . . . +np-1)), where n1 +n2 + . . . +np = n.
$\\eta_{c}$ Elastic and Transition Form Factors: Contact Interaction and Algebraic Model
Bedolla, Marco A; Cobos-Martínez, J J; Bashir, Adnan
2016-01-01
For the flavor-singlet heavy quark system of charmonia in the pseudoscalar ($\\eta_c(1S)$) channel, we calculate the elastic (EFF) and transition form factors (TFF) ($\\eta_c(1S) \\rightarrow \\gamma \\gamma^*$) for a wide range of photon momentum transfer squared ($Q^2$). The framework for this analysis is provided by a symmetry-preserving Schwinger-Dyson equation (SDE) and Bethe-Salpeter equation (BSE) treatment of a vector$\\times$vector contact interaction (CI). We also employ an algebraic model (AM), developed earlier to describe the light quark systems. It correctly correlates infrared and ultraviolet dynamics of quantum chromodynamics (QCD). The CI results agree with the lattice data for low $Q^2$. For $Q^2 \\geqslant Q_0^2$, the results start deviating from the lattice results by more than $20 \\%$. $Q_0^2 \\thickapprox 2.5 {\\rm GeV}^2$ for the EFF and $\\thickapprox 25 {\\rm GeV}^2$ for the TFF. We also present the results for the EFF, TFF as well as $\\eta_c(1S)$ parton distribution amplitude for the AM. Wherev...
Nonlinear model predictive control theory and algorithms
Grüne, Lars
2017-01-01
This book offers readers a thorough and rigorous introduction to nonlinear model predictive control (NMPC) for discrete-time and sampled-data systems. NMPC schemes with and without stabilizing terminal constraints are detailed, and intuitive examples illustrate the performance of different NMPC variants. NMPC is interpreted as an approximation of infinite-horizon optimal control so that important properties like closed-loop stability, inverse optimality and suboptimality can be derived in a uniform manner. These results are complemented by discussions of feasibility and robustness. An introduction to nonlinear optimal control algorithms yields essential insights into how the nonlinear optimization routine—the core of any nonlinear model predictive controller—works. Accompanying software in MATLAB® and C++ (downloadable from extras.springer.com/), together with an explanatory appendix in the book itself, enables readers to perform computer experiments exploring the possibilities and limitations of NMPC. T...
Warehouse Optimization Model Based on Genetic Algorithm
Directory of Open Access Journals (Sweden)
Guofeng Qin
2013-01-01
Full Text Available This paper takes Bao Steel logistics automated warehouse system as an example. The premise is to maintain the focus of the shelf below half of the height of the shelf. As a result, the cost time of getting or putting goods on the shelf is reduced, and the distance of the same kind of goods is also reduced. Construct a multiobjective optimization model, using genetic algorithm to optimize problem. At last, we get a local optimal solution. Before optimization, the average cost time of getting or putting goods is 4.52996 s, and the average distance of the same kinds of goods is 2.35318 m. After optimization, the average cost time is 4.28859 s, and the average distance is 1.97366 m. After analysis, we can draw the conclusion that this model can improve the efficiency of cargo storage.
Algebraic Reconstruction of Current Dipoles and Quadrupoles in Three-Dimensional Space
Directory of Open Access Journals (Sweden)
Takaaki Nara
2013-01-01
Full Text Available This paper presents an algebraic method for an inverse source problem for the Poisson equation where the source consists of dipoles and quadrupoles. This source model is significant in the magnetoencephalography inverse problem. The proposed method identifies the source parameters directly and algebraically using data without requiring an initial parameter estimate or iterative computation of the forward solution. The obtained parameters could be used for the initial solution in an optimization-based algorithm for further refinement.
McKeague, Charles P
1981-01-01
Elementary Algebra 2e, Second Edition focuses on the basic principles, operations, and approaches involved in elementary algebra. The book first tackles the basics, linear equations and inequalities, and graphing and linear systems. Discussions focus on the substitution method, solving linear systems by graphing, solutions to linear equations in two variables, multiplication property of equality, word problems, addition property of equality, and subtraction, addition, multiplication, and division of real numbers. The manuscript then examines exponents and polynomials, factoring, and rational e
McKeague, Charles P
1986-01-01
Elementary Algebra, Third Edition focuses on the basic principles, operations, and approaches involved in elementary algebra. The book first ponders on the basics, linear equations and inequalities, and graphing and linear systems. Discussions focus on the elimination method, solving linear systems by graphing, word problems, addition property of equality, solving linear equations, linear inequalities, addition and subtraction of real numbers, and properties of real numbers. The text then takes a look at exponents and polynomials, factoring, and rational expressions. Topics include reducing ra
Kleene Algebra and Bytecode Verification
2016-04-27
published in Electronic Notes in Theoretical Computer Science URL : www.elsevier.nl/locate/entcs Kot and Kozen The worklist algorithm for dataflow analysis...Technical Report 2004-1971, Computer Science Department, Cornell University (2004). URL http://www.cs.cornell.edu/kozen/papers/KADataflow.pdf [7] Kozen, D...A completeness theorem for Kleene algebras and the algebra of regular events, Infor. and Comput. 110 (1994), pp. 366–390. URL http
Dynamical behavior of the Niedermayer algorithm applied to Potts models
Girardi, D.; Penna, T. J. P.; Branco, N. S.
2012-01-01
In this work we make a numerical study of the dynamic universality class of the Niedermayer algorithm applied to the two-dimensional Potts model with 2, 3, and 4 states. This algorithm updates clusters of spins and has a free parameter, $E_0$, which controls the size of these clusters, such that $E_0=1$ is the Metropolis algorithm and $E_0=0$ regains the Wolff algorithm, for the Potts model. For $-1
A genetic algorithm for solving supply chain network design model
Firoozi, Z.; Ismail, N.; Ariafar, S. H.; Tang, S. H.; Ariffin, M. K. M. A.
2013-09-01
Network design is by nature costly and optimization models play significant role in reducing the unnecessary cost components of a distribution network. This study proposes a genetic algorithm to solve a distribution network design model. The structure of the chromosome in the proposed algorithm is defined in a novel way that in addition to producing feasible solutions, it also reduces the computational complexity of the algorithm. Computational results are presented to show the algorithm performance.
Computations in finite-dimensional Lie algebras
Directory of Open Access Journals (Sweden)
A. M. Cohen
1997-12-01
Full Text Available This paper describes progress made in context with the construction of a general library of Lie algebra algorithms, called ELIAS (Eindhoven Lie Algebra System, within the computer algebra package GAP. A first sketch of the package can be found in Cohen and de Graaf[1]. Since then, in a collaborative effort with G. Ivanyos, the authors have continued to develop algorithms which were implemented in ELIAS by the second author. These activities are part of a bigger project, called ACELA and financed by STW, the Dutch Technology Foundation, which aims at an interactive book on Lie algebras (cf. Cohen and Meertens [2]. This paper gives a global description of the main ways in which to present Lie algebras on a computer. We focus on the transition from a Lie algebra abstractly given by an array of structure constants to a Lie algebra presented as a subalgebra of the Lie algebra of n×n matrices. We describe an algorithm typical of the structure analysis of a finite-dimensional Lie algebra: finding a Levi subalgebra of a Lie algebra.
Directory of Open Access Journals (Sweden)
Yuan-Shyi Peter Chiu
2013-02-01
Full Text Available This study uses mathematical modeling along with an algebraic technique to resolve the production-distribution policy for a single-producer multi-retailer integrated inventory system with scrap in production. We assume that a product is manufactured through an imperfect production process where all nonconforming items will be picked up and scrapped in each production cycle. After the entire lot is quality assured, multiple shipments will be delivered synchronously to m different retailers in each cycle. The objective is to determine the optimal replenishment lot size and optimal number of shipments that minimizes total expected costs for such a specific supply chains system. Conventional method is by the use of differential calculus on system cost function to derive the optimal policy (Chiu et al al., 2012c, whereas the proposed algebraic approach is a straightforward method that enables practitioners who may not have sufficient knowledge of calculus to understand and manage more effectively the real-life systems.
Finite dimensional quotients of commutative operator algebras
Meyer, R
1997-01-01
The matrix normed structure of the unitization of a (non-selfadjoint) operator algebra is determined by that of the original operator algebra. This yields a classification up to completely isometric isomorphism of two-dimensional unital operator algebras. This allows to define invariant distances on the spectrum of commutative operator algebras analogous to the Caratheodory distance for complex manifolds. Moreover, unitizations of two-dimensional operator algebras with zero multiplication provide a rich class of counterexamples. Especially, several badly behaved quotients of function algebras are exhibited. Recently, Arveson has developed a model theory for d-contractions. Quotients of the operator algebra of the d-shift are much more well-behaved than quotients of function algebras. Completely isometric representations of these quotients are obtained explicitly. This provides a generalization of Nevanlinna-Pick theory. An important property of quotients of the d-shift algebra is that their quotients of finit...
The Calkin algebra is not countably homogeneous
Farah, Ilijas; Hirshberg, Ilan
2015-01-01
We show that the Calkin algebra is not countably homogeneous, in the sense of continuous model theory. We furthermore show that the connected component of the unitary group of the Calkin algebra is not countably homogeneous.
Zhang, Tian; Zhang, Daijun; Li, Zhenliang; Cai, Qing
2010-05-01
The calibration of ASMs is a prerequisite for their application to simulation of a wastewater treatment plant. This work should be made based on the evaluation of structural identifiability of model parameters. An EBPR sub-model including denitrification phosphorus removal has been incorporated in ASM2d. Yet no report is presented on the structural identifiability of the parameters in the EBPR sub-model. In this paper, the differential algebra approach was used to address this issue. The results showed that the structural identifiability of parameters in the EBPR sub-model could be improved by increasing the measured variables. The reduction factor eta(NO)(3) was identifiable when combined data of aerobic process and anoxic process were assumed. For K(PP), X(PAO) and q(PHA) of the anaerobic process to be uniquely identifiable, one of them is needed to be determined by other ways. Likewise, if prior information on one of the parameters, K(PHA), X(PAO) and q(PP) of the aerobic process, is known, all the parameters are identifiable. The above results could be of interest to the parameter estimation of the EBPR sub-model. The algorithm proposed in the paper is also suitable for other sub-models of ASMs.
Genetic Algorithm Approaches to Prebiobiotic Chemistry Modeling
Lohn, Jason; Colombano, Silvano
1997-01-01
We model an artificial chemistry comprised of interacting polymers by specifying two initial conditions: a distribution of polymers and a fixed set of reversible catalytic reactions. A genetic algorithm is used to find a set of reactions that exhibit a desired dynamical behavior. Such a technique is useful because it allows an investigator to determine whether a specific pattern of dynamics can be produced, and if it can, the reaction network found can be then analyzed. We present our results in the context of studying simplified chemical dynamics in theorized protocells - hypothesized precursors of the first living organisms. Our results show that given a small sample of plausible protocell reaction dynamics, catalytic reaction sets can be found. We present cases where this is not possible and also analyze the evolved reaction sets.
Algebraic totality, towards completeness
Tasson, Christine
2009-01-01
Finiteness spaces constitute a categorical model of Linear Logic (LL) whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefschetz in 1942) and morphisms as continuous linear maps. First, we recall definitions of finiteness spaces and describe their basic properties deduced from the general theory of linearly topologised spaces. Then we give an interpretation of LL based on linear algebra. Second, thanks to separation properties, we can introduce an algebraic notion of totality candidate in the framework of linearly topologised spaces: a totality candidate is a closed affine subspace which does not contain 0. We show that finiteness spaces with totality candidates constitute a model of classical LL. Finally, we give a barycentric simply typed lambda-calculus, with booleans ${\\mathcal{B}}$ and a conditional operator, which can be interpreted in this model. We prove completeness at type ${\\mathcal{B}}^n\\to{\\mathcal{B}}$ for every n by an algebraic metho...
Motion Model Employment using interacting Motion Model Algorithm
DEFF Research Database (Denmark)
Hussain, Dil Muhammad Akbar
2006-01-01
model being correct is computed through a likelihood function for each model. The study presented a simple technique to introduce additional models into the system using deterministic acceleration which basically defines the dynamics of the system. Therefore, based on this value more motion models can......The paper presents a simulation study to track a maneuvering target using a selective approach in choosing Interacting Multiple Models (IMM) algorithm to provide a wider coverage to track such targets. Initially, there are two motion models in the system to track a target. Probability of each...... be employed to increase the coverage. Finally, the combined estimate is obtained using posteriori probabilities from different filter models. The implemented approach provides an adaptive scheme for selecting various number of motion models. Motion model description is important as it defines the kind...
Energy Technology Data Exchange (ETDEWEB)
Casasent, D.; Ghosh, A.
1983-01-01
Many of the linear algebra operations and algorithms possible on optical matrix-vector processors are reviewed. Emphasis is given to the use of direct solutions and their realization on systolic optical processors. As an example, implicit and explicit solutions to partial differential equations are considered. The matrix-decomposition required is found to be the major operation recommended for optical realization. The pipelining and flow of data and operations are noted to be key issues in the realization of any algorithm on an optical systolic array processor. A realization of the direct solution by householder qr decomposition is provided as a specific case study. 19 references.
Bayesian online algorithms for learning in discrete Hidden Markov Models
Alamino, Roberto C.; Caticha, Nestor
2008-01-01
We propose and analyze two different Bayesian online algorithms for learning in discrete Hidden Markov Models and compare their performance with the already known Baldi-Chauvin Algorithm. Using the Kullback-Leibler divergence as a measure of generalization we draw learning curves in simplified situations for these algorithms and compare their performances.
Bouc–Wen hysteresis model identification using Modified Firefly Algorithm
Energy Technology Data Exchange (ETDEWEB)
Zaman, Mohammad Asif, E-mail: zaman@stanford.edu [Department of Electrical Engineering, Stanford University (United States); Sikder, Urmita [Department of Electrical Engineering and Computer Sciences, University of California, Berkeley (United States)
2015-12-01
The parameters of Bouc–Wen hysteresis model are identified using a Modified Firefly Algorithm. The proposed algorithm uses dynamic process control parameters to improve its performance. The algorithm is used to find the model parameter values that results in the least amount of error between a set of given data points and points obtained from the Bouc–Wen model. The performance of the algorithm is compared with the performance of conventional Firefly Algorithm, Genetic Algorithm and Differential Evolution algorithm in terms of convergence rate and accuracy. Compared to the other three optimization algorithms, the proposed algorithm is found to have good convergence rate with high degree of accuracy in identifying Bouc–Wen model parameters. Finally, the proposed method is used to find the Bouc–Wen model parameters from experimental data. The obtained model is found to be in good agreement with measured data. - Highlights: • We describe a new method to find the Bouc–Wen hysteresis model parameters. • We propose a Modified Firefly Algorithm. • We compare our method with existing methods to find that the proposed method performs better. • We use our model to fit experimental results. Good agreement is found.
Institute of Scientific and Technical Information of China (English)
WANG Renhong; ZHU Chungang
2004-01-01
The piecewise algebraic variety is a generalization of the classical algebraic variety. This paper discusses some properties of piecewise algebraic varieties and their coordinate rings based on the knowledge of algebraic geometry.
Djurfeldt, Mikael
2012-07-01
The connection-set algebra (CSA) is a novel and general formalism for the description of connectivity in neuronal network models, from small-scale to large-scale structure. The algebra provides operators to form more complex sets of connections from simpler ones and also provides parameterization of such sets. CSA is expressive enough to describe a wide range of connection patterns, including multiple types of random and/or geometrically dependent connectivity, and can serve as a concise notation for network structure in scientific writing. CSA implementations allow for scalable and efficient representation of connectivity in parallel neuronal network simulators and could even allow for avoiding explicit representation of connections in computer memory. The expressiveness of CSA makes prototyping of network structure easy. A C+ + version of the algebra has been implemented and used in a large-scale neuronal network simulation (Djurfeldt et al., IBM J Res Dev 52(1/2):31-42, 2008b) and an implementation in Python has been publicly released.
Marchuk, Nikolay
2011-01-01
Exterior algebras and differential forms are widely used in many fields of modern mathematics and theoretical physics. In this paper we define a notion of $N$-metric exterior algebra, which depends on $N$ matrices of structure constants. The usual exterior algebra (Grassmann algebra) can be considered as 0-metric exterior algebra. Clifford algebra can be considered as 1-metric exterior algebra. $N$-metric exterior algebras for $N\\geq2$ can be considered as generalizations of the Grassmann alg...
Meanings Generated while Using Algebraic-Like Formalism to Construct and Control Animated Models
Kynigos, Chronis; Psycharis, Giorgos; Moustaki, Foteini
2010-01-01
This paper reports on a design experiment conducted to explore the construction of meanings by 17 year old students, emerging from their interpretations and uses of algebraic like formalism. The students worked collaboratively in groups of two or three, using MoPiX, a constructionist computational environment with which they could create concrete…
Developing Pre-Algebraic Thinking in Generalizing Repeating Pattern Using SOLO Model
Lian, Lim Hooi; Yew, Wun Thiam
2011-01-01
In this paper, researchers discussed the application of the generalization perspective in helping the primary school pupils to develop their pre-algebraic thinking in generalizing repeating pattern. There are two main stages of the generalization perspective had been adapted, namely investigating and generalizing the pattern. Since the Biggs and…
Proposing and Testing a Model to Explain Traits of Algebra Preparedness
Venenciano, Linda; Heck, Ronald
2016-01-01
Early experiences with theoretical thinking and generalization in measurement are hypothesized to develop constructs we name here as logical reasoning and preparedness for algebra. Based on work of V. V. Davydov (1975), the Measure Up (MU) elementary grades experimental mathematics curriculum uses quantities of area, length, volume, and mass to…
DEFF Research Database (Denmark)
2007-01-01
of algebraic groups (in a broad sense) has seen important developments in several directions, also related to representation theory and algebraic geometry. The workshop aimed at presenting some of these developments in order to make them accessible to a "general audience" of algebraic group......-theorists, and to stimulate contacts between participants. Each of the first four days was dedicated to one area of research that has recently seen decisive progress: \\begin{itemize} \\item structure and classification of wonderful varieties, \\item finite reductive groups and character sheaves, \\item quantum cohomology...... of homogeneous varieties, \\item representation categories and their connections to orbits and flag varieties. \\end{itemize} The first three days started with survey talks that will help to make the subject accessible to the next generation. The talks on the last day introduced to several recent advances...
Liesen, Jörg
2015-01-01
This self-contained textbook takes a matrix-oriented approach to linear algebra and presents a complete theory, including all details and proofs, culminating in the Jordan canonical form and its proof. Throughout the development, the applicability of the results is highlighted. Additionally, the book presents special topics from applied linear algebra including matrix functions, the singular value decomposition, the Kronecker product and linear matrix equations. The matrix-oriented approach to linear algebra leads to a better intuition and a deeper understanding of the abstract concepts, and therefore simplifies their use in real world applications. Some of these applications are presented in detailed examples. In several ‘MATLAB-Minutes’ students can comprehend the concepts and results using computational experiments. Necessary basics for the use of MATLAB are presented in a short introduction. Students can also actively work with the material and practice their mathematical skills in more than 300 exerc...
Algorithm for Realistic Modeling of Graphitic Systems
Directory of Open Access Journals (Sweden)
A.V. Khomenko
2011-01-01
Full Text Available An algorithm for molecular dynamics simulations of graphitic systems using realistic semiempirical interaction potentials of carbon atoms taking into account both short-range and long-range contributions is proposed. Results of the use of the algorithm for a graphite sample are presented. The scalability of the algorithm depending on the system size and the number of processor cores involved in the calculations is analyzed.
Directory of Open Access Journals (Sweden)
G.C. Rao
2012-11-01
Full Text Available A C- algebra is the algebraic form of the 3-valued conditional logic, which was introduced by F. Guzman and C. C. Squier in 1990. In this paper, some equivalent conditions for a C- algebra to become a boolean algebra in terms of congruences are given. It is proved that the set of all central elements B(A is isomorphic to the Boolean algebra of all C-algebras Sa, where a B(A. It is also proved that B(A is isomorphic to the Boolean algebra of all C-algebras Aa, where a B(A.
Allenby, Reg
1995-01-01
As the basis of equations (and therefore problem-solving), linear algebra is the most widely taught sub-division of pure mathematics. Dr Allenby has used his experience of teaching linear algebra to write a lively book on the subject that includes historical information about the founders of the subject as well as giving a basic introduction to the mathematics undergraduate. The whole text has been written in a connected way with ideas introduced as they occur naturally. As with the other books in the series, there are many worked examples.Solutions to the exercises are available onlin
Jacobson, Nathan
2009-01-01
A classic text and standard reference for a generation, this volume and its companion are the work of an expert algebraist who taught at Yale for two decades. Nathan Jacobson's books possess a conceptual and theoretical orientation, and in addition to their value as classroom texts, they serve as valuable references.Volume I explores all of the topics typically covered in undergraduate courses, including the rudiments of set theory, group theory, rings, modules, Galois theory, polynomials, linear algebra, and associative algebra. Its comprehensive treatment extends to such rigorous topics as L
Jacobson, Nathan
1979-01-01
Lie group theory, developed by M. Sophus Lie in the 19th century, ranks among the more important developments in modern mathematics. Lie algebras comprise a significant part of Lie group theory and are being actively studied today. This book, by Professor Nathan Jacobson of Yale, is the definitive treatment of the subject and can be used as a textbook for graduate courses.Chapter I introduces basic concepts that are necessary for an understanding of structure theory, while the following three chapters present the theory itself: solvable and nilpotent Lie algebras, Carlan's criterion and its
Stoll, R R
1968-01-01
Linear Algebra is intended to be used as a text for a one-semester course in linear algebra at the undergraduate level. The treatment of the subject will be both useful to students of mathematics and those interested primarily in applications of the theory. The major prerequisite for mastering the material is the readiness of the student to reason abstractly. Specifically, this calls for an understanding of the fact that axioms are assumptions and that theorems are logical consequences of one or more axioms. Familiarity with calculus and linear differential equations is required for understand
RSA算法中Z*(φ)(n)的代数结构研究%Study on Algebraic Structure of Z*(φ)(n) in RSA Algorithm
Institute of Scientific and Technical Information of China (English)
裴东林; 胡建军; 李旭
2013-01-01
[Abstract] Based on the theory of quadratic residues, this paper considers the algebraic structure of Z*φ(n) in the two order strong RSA algorithm. It is proved that the element α of Z*φ(n) gets maximal order if and only if gcd(α±l,n1) = 1, and the numbers of quadratic residues in the group Z*φ(n) is φ(φ(n))/8 .Z*φ(n) is divided up by the group which is composed of all quadratic residues, and all cosets form a Klein eight-group. It proves that the group Z*φ(n) can be generated by seven elements of quadratic non-residues.%应用二次剩余理论,对二阶强RSA算法中Z*(φ)(n)的代数结构进行研究,证明Z*(φ)(n)中元素a取最大阶的充要条件为gcd(a±1,n1)=1,以及任意元素的阶Z*(φ)(n)中模(φ)(n)的二次剩余个数为(φ)(φ)(n))/8,以所有二次剩余构成的群对Z*(φ)(n)进行分割,利用所有陪集构成一个Klein八元群,在此基础上证明Z*(φ)(n)可由7个二次非剩余元素生成.
Directory of Open Access Journals (Sweden)
Najmeh Neysani Samany
2013-01-01
Full Text Available Space and time are two dominant factors in context-aware pervasive systems which determine whether an entity is related to the moving user or not. This paper specifically addresses the use of spatio-temporal relations for detecting spatio-temporally relevant contexts to the user. The main contribution of this work is that the proposed model is sensitive to the velocity and direction of the user and applies customized Multi Interval Algebra (MIA with Voronoi Continuous Range Query (VCRQ to introduce spatio-temporally relevant contexts according to their arrangement in space. In this implementation the Spatio-Temporal Relevancy Model for Context-Aware Systems (STRMCAS helps the tourist to find his/her preferred areas that are spatio-temporally relevant. The experimental results in a scenario of tourist navigation are evaluated with respect to the accuracy of the model, performance time and satisfaction of users in 30 iterations of the algorithm. The evaluation process demonstrated the efficiency of the model in real-world applications.
Evrendilek, Fatih
2007-01-01
This study aims at quantifying spatio-temporal dynamics of monthly mean daily incident photosynthetically active radiation (PAR) over a vast and complex terrain such as Turkey. The spatial interpolation method of universal kriging, and the combination of multiple linear regression (MLR) models and map algebra techniques were implemented to generate surface maps of PAR with a grid resolution of 500 × 500 m as a function of five geographical and 14 climatic variables. Performance of the geostatistical and MLR models was compared using mean prediction error (MPE), root-mean-square prediction error (RMSPE), average standard prediction error (ASE), mean standardized prediction error (MSPE), root-mean-square standardized prediction error (RMSSPE), and adjusted coefficient of determination (R2adj.). The best-fit MLR- and universal kriging-generated models of monthly mean daily PAR were validated against an independent 37-year observed dataset of 35 climate stations derived from 160 stations across Turkey by the Jackknifing method. The spatial variability patterns of monthly mean daily incident PAR were more accurately reflected in the surface maps created by the MLR-based models than in those created by the universal kriging method, in particular, for spring (May) and autumn (November). The MLR-based spatial interpolation algorithms of PAR described in this study indicated the significance of the multifactor approach to understanding and mapping spatio-temporal dynamics of PAR for a complex terrain over meso-scales.
Polynomial search and global modeling: Two algorithms for modeling chaos.
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.
The Das-Popowicz Moyal Momentum Algebra
Boulahoual, A
2002-01-01
We introduce in this short note some aspects of the Moyal momentum algebra that we call the Das-Popowicz Mm algebra. Our interest on this algebra is motivated by the central role that it can play in the formulation of integrable models and in higher conformal spin theories.
Quantum Algebras in Nuclear Structure
Bonatsos, Dennis; Daskaloyannis, C.; Kolokotronis, P.; Lenis, D.
1995-01-01
Quantum algebras are a mathematical tool which provides us with a class of symmetries wider than that of Lie algebras, which are contained in the former as a special case. After a self-contained introduction to the necessary mathematical tools ($q$-numbers, $q$-analysis, $q$-oscillators, $q$-algebras), the su$_q$(2) rotator model and its extensions, the construction of deformed exactly soluble models (Interacting Boson Model, Moszkowski model), the use of deformed bosons in the description of...
Computational linear and commutative algebra
Kreuzer, Martin
2016-01-01
This book combines, in a novel and general way, an extensive development of the theory of families of commuting matrices with applications to zero-dimensional commutative rings, primary decompositions and polynomial system solving. It integrates the Linear Algebra of the Third Millennium, developed exclusively here, with classical algorithmic and algebraic techniques. Even the experienced reader will be pleasantly surprised to discover new and unexpected aspects in a variety of subjects including eigenvalues and eigenspaces of linear maps, joint eigenspaces of commuting families of endomorphisms, multiplication maps of zero-dimensional affine algebras, computation of primary decompositions and maximal ideals, and solution of polynomial systems. This book completes a trilogy initiated by the uncharacteristically witty books Computational Commutative Algebra 1 and 2 by the same authors. The material treated here is not available in book form, and much of it is not available at all. The authors continue to prese...
Advanced Lukasiewicz calculus and MV-algebras
Mundici, Daniele
2011-01-01
This is a continuation of Vol. 7 of Trends in Logic. It wil cover the wealth of recent developments of Lukasiewicz Logic and their algebras (Chang MV-algebras), with particular reference to (de Finetti) coherent evaluation of continuously valued events, (Renyi) conditionals for such events, related algorithms.
An Algebraic Approach to the Scattering Equations
Huang, Rijun; Feng, Bo; He, Yang-Hui
2015-01-01
We employ the so-called companion matrix method from computational algebraic geometry, tailored for zero-dimensional ideals, to study the scattering equations. The method renders the CHY-integrand of scattering amplitudes computable using simple linear algebra and is amenable to an algorithmic approach. Certain identities in the amplitudes as well as rationality of the final integrand become immediate in this formalism.
Indian Academy of Sciences (India)
Tomás L Gómez
2001-02-01
This is an expository article on the theory of algebraic stacks. After introducing the general theory, we concentrate in the example of the moduli stack of vector bundles, giving a detailed comparison with the moduli scheme obtained via geometric invariant theory.
Oliver, Bob; Pawałowski, Krzystof
1991-01-01
As part of the scientific activity in connection with the 70th birthday of the Adam Mickiewicz University in Poznan, an international conference on algebraic topology was held. In the resulting proceedings volume, the emphasis is on substantial survey papers, some presented at the conference, some written subsequently.
Algebraic Topology, Rational Homotopy
1988-01-01
This proceedings volume centers on new developments in rational homotopy and on their influence on algebra and algebraic topology. Most of the papers are original research papers dealing with rational homotopy and tame homotopy, cyclic homology, Moore conjectures on the exponents of the homotopy groups of a finite CW-c-complex and homology of loop spaces. Of particular interest for specialists are papers on construction of the minimal model in tame theory and computation of the Lusternik-Schnirelmann category by means articles on Moore conjectures, on tame homotopy and on the properties of Poincaré series of loop spaces.
Energy Technology Data Exchange (ETDEWEB)
Christian, J M; McDonald, G S [Joule Physics Laboratory, School of Computing, Science and Engineering, Materials and Physics Research Centre, University of Salford, Salford M5 4WT (United Kingdom); Chamorro-Posada, P, E-mail: j.christian@salford.ac.u [Departamento de Teoria de la Senal y Comunicaciones e Ingenieria Telematica, Universidad de Valladolid, ETSI Telecomunicacion, Campus Miguel Delibes s/n, 47011 Valladolid (Spain)
2010-02-26
We report, to the best of our knowledge, the first exact analytical algebraic solitons of a generalized cubic-quintic Helmholtz equation. This class of governing equation plays a key role in photonics modelling, allowing a full description of the propagation and interaction of broad scalar beams. New conservation laws are presented, and the recovery of paraxial results is discussed in detail. The stability properties of the new solitons are investigated by combining semi-analytical methods and computer simulations. In particular, new general stability regimes are reported for algebraic bright solitons.
Sensitivity Analysis of Differential-Algebraic Equations and Partial Differential Equations
Energy Technology Data Exchange (ETDEWEB)
Petzold, L; Cao, Y; Li, S; Serban, R
2005-08-09
Sensitivity analysis generates essential information for model development, design optimization, parameter estimation, optimal control, model reduction and experimental design. In this paper we describe the forward and adjoint methods for sensitivity analysis, and outline some of our recent work on theory, algorithms and software for sensitivity analysis of differential-algebraic equation (DAE) and time-dependent partial differential equation (PDE) systems.
Testing algebraic geometric codes
Institute of Scientific and Technical Information of China (English)
无
2009-01-01
Property testing was initially studied from various motivations in 1990’s. A code C GF (r)n is locally testable if there is a randomized algorithm which can distinguish with high possibility the codewords from a vector essentially far from the code by only accessing a very small (typically constant) number of the vector’s coordinates. The problem of testing codes was firstly studied by Blum, Luby and Rubinfeld and closely related to probabilistically checkable proofs (PCPs). How to characterize locally testable codes is a complex and challenge problem. The local tests have been studied for Reed-Solomon (RS), Reed-Muller (RM), cyclic, dual of BCH and the trace subcode of algebraicgeometric codes. In this paper we give testers for algebraic geometric codes with linear parameters (as functions of dimensions). We also give a moderate condition under which the family of algebraic geometric codes cannot be locally testable.
Testing algebraic geometric codes
Institute of Scientific and Technical Information of China (English)
CHEN Hao
2009-01-01
Property testing was initially studied from various motivations in 1990's.A code C (∩)GF(r)n is locally testable if there is a randomized algorithm which can distinguish with high possibility the codewords from a vector essentially far from the code by only accessing a very small (typically constant) number of the vector's coordinates.The problem of testing codes was firstly studied by Blum,Luby and Rubinfeld and closely related to probabilistically checkable proofs (PCPs).How to characterize locally testable codes is a complex and challenge problem.The local tests have been studied for Reed-Solomon (RS),Reed-Muller (RM),cyclic,dual of BCH and the trace subcode of algebraicgeometric codes.In this paper we give testers for algebraic geometric codes with linear parameters (as functions of dimensions).We also give a moderate condition under which the family of algebraic geometric codes cannot be locally testable.
Homological Dimensions of the Extension Algebras of Monomial Algebras
Institute of Scientific and Technical Information of China (English)
Hong Bo SHI
2015-01-01
The main objective of this paper is to study the dimension trees and further the homo-logical dimensions of the extension algebras — dual and trivially twisted extensions — with a unified combinatorial approach using the two combinatorial algorithms — Topdown and Bottomup. We first present a more complete and clearer picture of a dimension tree, with which we are then able, on the one hand, to sharpen some results obtained before and furthermore reveal a few more hidden sub-tle homological phenomenons of or connections between the involved algebras; on the other hand, to provide two more eﬃ cient combinatorial algorithms for computing dimension trees, and consequently the homological dimensions as an application. We believe that the more refined complete structural information on dimension trees will be useful to study other homological properties of this class of extension algebras.
Institute of Scientific and Technical Information of China (English)
O.G.Martynenko; V.N.Korovkin
1992-01-01
An algebraic model of turbulence,involving buyancy forces,is used for calculating velocity and temperature fields in plane turbulent vertical jets in a non-homogeneous stagnant medium,A new approach to the solution of the governing system of partial differential differental equations (Continuity ,Conservation of momentum,heat (buoyancy),turbulent kinetic energy,dissipation rate and mean quadratic temperature fluctuation)is suggested which is based on the intrduction of mathematical variables.Comparison is made between the results of the present calculations with experimental and numerical data of ther authors.
Mukhamedov, Farrukh; Barhoumi, Abdessatar; Souissi, Abdessatar
2016-12-01
It is known that the disordered phase of the classical Ising model on the Caley tree is extreme in some region of the temperature. If one considers the Ising model with competing interactions on the same tree, then about the extremity of the disordered phase there is no any information. In the present paper, we first aiming to analyze the correspondence between Gibbs measures and QMC's on trees. Namely, we establish that states associated with translation invariant Gibbs measures of the model can be seen as diagonal quantum Markov chains on some quasi local algebra. Then as an application of the established correspondence, we study some algebraic property of the disordered phase of the Ising model with competing interactions on the Cayley tree of order two. More exactly, we prove that a state corresponding to the disordered phase is not quasi-equivalent to other states associated with translation invariant Gibbs measures. This result shows how the translation invariant states relate to each other, which is even a new phenomena in the classical setting. To establish the main result we basically employ methods of quantum Markov chains.
Critical dynamics of cluster algorithms in the dilute Ising model
Hennecke, M.; Heyken, U.
1993-08-01
Autocorrelation times for thermodynamic quantities at T C are calculated from Monte Carlo simulations of the site-diluted simple cubic Ising model, using the Swendsen-Wang and Wolff cluster algorithms. Our results show that for these algorithms the autocorrelation times decrease when reducing the concentration of magnetic sites from 100% down to 40%. This is of crucial importance when estimating static properties of the model, since the variances of these estimators increase with autocorrelation time. The dynamical critical exponents are calculated for both algorithms, observing pronounced finite-size effects in the energy autocorrelation data for the algorithm of Wolff. We conclude that, when applied to the dilute Ising model, cluster algorithms become even more effective than local algorithms, for which increasing autocorrelation times are expected.
O'Hanlon, Angela L.
2011-01-01
The purpose of the study was to determine the effect of pacing and scheduling of algebra coursework on assigned 9th-grade students who traditionally would qualify for pre-algebra instruction and same course 9th-grade students who traditionally would qualify for standard algebra instruction. Students were selected based on completion of first-year…
A Construction of the "2221" Planar Algebra
Han, Richard
2011-01-01
In this paper, we construct the "2221" subfactor planar algebra by finding it as a subalgebra of the graph planar algebra of its principal graph. In particular, we give a presentation of the "2221" subfactor planar algebra consisting of generators and relations. As a corollary, we have a planar algebra proof of the existence of a subfactor with principal graph "2221". To show the subfactor property, we use the jellyfish algorithm for evaluating closed diagrams. Lastly, we show uniqueness up to conjugation of "2221".
Computers in nonassociative rings and algebras
Beck, Robert E
1977-01-01
Computers in Nonassociative Rings and Algebras provides information pertinent to the computational aspects of nonassociative rings and algebras. This book describes the algorithmic approaches for solving problems using a computer.Organized into 10 chapters, this book begins with an overview of the concept of a symmetrized power of a group representation. This text then presents data structures and other computational methods that may be useful in the field of computational algebra. Other chapters consider several mathematical ideas, including identity processing in nonassociative algebras, str
Performance analysis of FXLMS algorithm with secondary path modeling error
Institute of Scientific and Technical Information of China (English)
SUN Xu; CHEN Duanshi
2003-01-01
Performance analysis of filtered-X LMS (FXLMS) algorithm with secondary path modeling error is carried out in both time and frequency domain. It is shown firstly that the effects of secondary path modeling error on the performance of FXLMS algorithm are determined by the distribution of the relative error of secondary path model along with frequency.In case of that the distribution of relative error is uniform the modeling error of secondary path will have no effects on the performance of the algorithm. In addition, a limitation property of FXLMS algorithm is proved, which implies that the negative effects of secondary path modeling error can be compensated by increasing the adaptive filter length. At last, some insights into the "spillover" phenomenon of FXLMS algorithm are given.
José, Marco V; Morgado, Eberto R; Govezensky, Tzipe
2011-07-01
Herein, we rigorously develop novel 3-dimensional algebraic models called Genetic Hotels of the Standard Genetic Code (SGC). We start by considering the primeval RNA genetic code which consists of the 16 codons of type RNY (purine-any base-pyrimidine). Using simple algebraic operations, we show how the RNA code could have evolved toward the current SGC via two different intermediate evolutionary stages called Extended RNA code type I and II. By rotations or translations of the subset RNY, we arrive at the SGC via the former (type I) or via the latter (type II), respectively. Biologically, the Extended RNA code type I, consists of all codons of the type RNY plus codons obtained by considering the RNA code but in the second (NYR type) and third (YRN type) reading frames. The Extended RNA code type II, comprises all codons of the type RNY plus codons that arise from transversions of the RNA code in the first (YNY type) and third (RNR) nucleotide bases. Since the dimensions of remarkable subsets of the Genetic Hotels are not necessarily integer numbers, we also introduce the concept of algebraic fractal dimension. A general decoding function which maps each codon to its corresponding amino acid or the stop signals is also derived. The Phenotypic Hotel of amino acids is also illustrated. The proposed evolutionary paths are discussed in terms of the existing theories of the evolution of the SGC. The adoption of 3-dimensional models of the Genetic and Phenotypic Hotels will facilitate the understanding of the biological properties of the SGC.
Classical Exchange Algebra of the Nonlinear Sigma Model on a Supercoset Target with Z2n Grading
Institute of Scientific and Technical Information of China (English)
KE San-Min; LI Xin-Ying; WANG Chun; YUE Rui-Hong
2011-01-01
The classical exchange algebra satisfied by the monodromy matrix of the nonlinear sigma model on a supercoset target with Z2n grading is derived using a first-order Hamiltonian formulation and by adding to the Lax connection terms proportional to constraints. This enables us to show that the conserved charges of the theory are in involution. When n = 2, our results coincide with the results given by Magro for the pure spinor description of AdS5 × S5 string theory (when the ghost terms are omitted).%The classical exchange algebra satisfied by the monodromy matrix of the nonlinear sigma model on a supercoset target with Z2n grading is derived using a first-order Hamiltonian formulation and by adding to the Lax connection terms proportional to constraints.This enables us to show that the conserved charges of the theory are in involution.When n =2,our results coincide with the results given by Magro for the pure spinor description of AdS5 × S5 string theory (when the ghost terms are omitted).Bena,Polchinski and Roiban[1] found an infinite number of non-local classically conserved charges for the Grecn-Schwarz superstring in AdS5 × S5 background.[2] Similar results were obtained for some other strings[3-9] that propagate in AdS space-time,as discussed in Refs.[7 9].Vallilo[10] showed that such charges also exist in the pure-spinor formalism of the superstring in AdS5 × S5.Bianchi and Klǔson[11] gave the current algebra of the pure-spinor superstring.Berkovits[12] proved that the nonlocal charges in the string theory are BRST-invariant and physical.
Central simple Poisson algebras
Institute of Scientific and Technical Information of China (English)
SU Yucai; XU Xiaoping
2004-01-01
Poisson algebras are fundamental algebraic structures in physics and symplectic geometry. However, the structure theory of Poisson algebras has not been well developed. In this paper, we determine the structure of the central simple Poisson algebras related to locally finite derivations, over an algebraically closed field of characteristic zero.The Lie algebra structures of these Poisson algebras are in general not finitely-graded.
Matching and Estimating Motion of Line Model Using Geometric Algebra%利用几何代数进行线段模型匹配和运动估计
Institute of Scientific and Technical Information of China (English)
黄良明; 彭立中; 程民德
2001-01-01
首先探讨了Clifford代数（几何代数）在计算机视觉中的应用，并得到了2D与3D旋转的统一表达公式；进而探讨了该公式在直线模型匹配和运动估计中的应用；在改进2D多角弧匹配算法的基础上，提出了一个同时进行线段模型的匹配和运动估计的算法.该算法通过最小化模型线段与被检测线段间的距离（距离函数定义为对应点间欧氏距离的积分）而求得的最佳运动估计中的旋转，可由一个矩阵的奇异值分解来表示，从而为首次同时解决这两个问题，进行了初步尝试，且该算法不受维数限制.最后的模拟实验结果表明，该算法效果良好.%Matching and estimating motion are basic problem of computer vision. Classical methods are first to find the matching point (or line etc.) and then estimating motion. This paper discussed the application of Clifford algebra (Geometric algebra) in the area of computer vision, presented the uniform formula of 2D and 3D rotation and their application in matching and estimation motion of the line segments model. Based on improving the algorithm of matching 2D polygonal arcs in reference ［4］, this paper provides an algorithm solve both of matching and estimating motion simultaneously using Clifford algebra. Via minimizing the distance between the model and the detected characteristic (the distance measure is defined as the integral of the Euclidean distance between corresponding points), The algorithm results with that the rotation of the best estimation can be represented by the SVD of a matrix. To our knowledge, this paper is the first investigation to solve both of them. And the algorithm is free from the dimension of the line segment model. Synthetic data has been used to test the algorithm, and excellent result has been obtained.
Limited-data computed tomography algorithms for the physical sciences.
Verhoeven, D
1993-07-10
Five limited-data computed tomography algorithms are compared. The algorithms used are adapted versions of the algebraic reconstruction technique, the multiplicative algebraic reconstruction technique, the Gerchberg-Papoulis algorithm, a spectral extrapolation algorithm descended from that of Harris [J. Opt. Soc. Am. 54, 931-936 (1964)], and an algorithm based on the singular value decomposition technique. These algorithms were used to reconstruct phantom data with realistic levels of noise from a number of different imaging geometries. The phantoms, the imaging geometries, and the noise were chosen to simulate the conditions encountered in typical computed tomography applications in the physical sciences, and the implementations of the algorithms were optimized for these applications. The multiplicative algebraic reconstruction technique algorithm gave the best results overall; the algebraic reconstruction technique gave the best results for very smooth objects or very noisy (20-dB signal-to-noise ratio) data. My implementations of both of these algorithms incorporate apriori knowledge of the sign of the object, its extent, and its smoothness. The smoothness of the reconstruction is enforced through the use of an appropriate object model (by use of cubic B-spline basis functions and a number of object coefficients appropriate to the object being reconstructed). The average reconstruction error was 1.7% of the maximum phantom value with the multiplicative algebraic reconstruction technique of a phantom with moderate-to-steep gradients by use of data from five viewing angles with a 30-dB signal-to-noise ratio.
Kriging-approximation simulated annealing algorithm for groundwater modeling
Shen, C. H.
2015-12-01
Optimization algorithms are often applied to search best parameters for complex groundwater models. Running the complex groundwater models to evaluate objective function might be time-consuming. This research proposes a Kriging-approximation simulated annealing algorithm. Kriging is a spatial statistics method used to interpolate unknown variables based on surrounding given data. In the algorithm, Kriging method is used to estimate complicate objective function and is incorporated with simulated annealing. The contribution of the Kriging-approximation simulated annealing algorithm is to reduce calculation time and increase efficiency.
Availability Allocation of Networked Systems Using Markov Model and Heuristics Algorithm
Directory of Open Access Journals (Sweden)
Ruiying Li
2014-01-01
Full Text Available It is a common practice to allocate the system availability goal to reliability and maintainability goals of components in the early design phase. However, the networked system availability is difficult to be allocated due to its complex topology and multiple down states. To solve these problems, a practical availability allocation method is proposed. Network reliability algebraic methods are used to derive the availability expression of the networked topology on the system level, and Markov model is introduced to determine that on the component level. A heuristic algorithm is proposed to obtain the reliability and maintainability allocation values of components. The principles applied in the AGREE reliability allocation method, proposed by the Advisory Group on Reliability of Electronic Equipment, and failure rate-based maintainability allocation method persist in our allocation method. A series system is used to verify the new algorithm, and the result shows that the allocation based on the heuristic algorithm is quite accurate compared to the traditional one. Moreover, our case study of a signaling system number 7 shows that the proposed allocation method is quite efficient for networked systems.
Decomposition of semigroup algebras
Boehm, Janko; Nitsche, Max Joachim
2011-01-01
Let A \\subseteq B be cancellative abelian semigroups, and let R be an integral domain. We show that the semigroup ring R[B] can be decomposed, as an R[A]-module, into a direct sum of R[A]-submodules of the quotient ring of R[A]. In the case of a finite extension of positive affine semigroup rings we obtain an algorithm computing the decomposition. When R[A] is a polynomial ring over a field we explain how to compute many ring-theoretic properties of R[B] in terms of this decomposition. In particular we obtain a fast algorithm to compute the Castelnuovo-Mumford regularity of homogeneous semigroup rings. As an application we confirm the Eisenbud-Goto conjecture in a range of new cases. Our algorithms are implemented in the Macaulay2 package MonomialAlgebras.
Heterogenous Acceleration for Linear Algebra in Multi-coprocessor Environments
Energy Technology Data Exchange (ETDEWEB)
Luszczek, Piotr R [ORNL; Tomov, Stanimire Z [ORNL; Dongarra, Jack J [ORNL
2015-01-01
We present an efficient and scalable programming model for the development of linear algebra in heterogeneous multi-coprocessor environments. The model incorporates some of the current best design and implementation practices for the heterogeneous acceleration of dense linear algebra (DLA). Examples are given as the basis for solving linear systems' algorithms - the LU, QR, and Cholesky factorizations. To generate the extreme level of parallelism needed for the efficient use of coprocessors, algorithms of interest are redesigned and then split into well-chosen computational tasks. The tasks execution is scheduled over the computational components of a hybrid system of multi-core CPUs and coprocessors using a light-weight runtime system. The use of lightweight runtime systems keeps scheduling overhead low, while enabling the expression of parallelism through otherwise sequential code. This simplifies the development efforts and allows the exploration of the unique strengths of the various hardware components.
Engineering of Algorithms for Hidden Markov models and Tree Distances
DEFF Research Database (Denmark)
Sand, Andreas
grown exponentially because of drastic improvements in the technology behind DNA and RNA sequencing, and focus on the research field has increased due to its potential to expand our knowledge about biological mechanisms and to improve public health. There has therefore been a continuously growing demand...... of the algorithms to exploit the parallel architecture of modern computers. In this PhD dissertation, I present my work with algorithmic optimizations and parallelizations in primarily two areas in algorithmic bioinformatics: algorithms for analyzing hidden Markov models and algorithms for computing distance...... measures between phylogenetic trees. Hidden Markov models is a class of probabilistic models that is used in a number of core applications in bioinformatics such as modeling of proteins, gene finding and reconstruction of species and population histories. I show how a relatively simple parallelization can...
Constructing semisimple subalgebras of semisimple Lie algebras
de Graaf, Willem A
2010-01-01
Algorithms are described that help with obtaining a classification of the semisimple subalgebras of a given semisimple Lie algebra, up to linear equivalence. The algorithms have been used to obtain classifications of the semisimple subalgebras of the simple Lie algebras of ranks <= 8. These have been made available as a database inside the SLA package of GAP4. The subalgebras in this database are explicitly given, as well as the inclusion relations among them.
Model-Free Adaptive Control Algorithm with Data Dropout Compensation
Xuhui Bu; Fashan Yu; Zhongsheng Hou; Hongwei Zhang
2012-01-01
The convergence of model-free adaptive control (MFAC) algorithm can be guaranteed when the system is subject to measurement data dropout. The system output convergent speed gets slower as dropout rate increases. This paper proposes a MFAC algorithm with data compensation. The missing data is first estimated using the dynamical linearization method, and then the estimated value is introduced to update control input. The convergence analysis of the proposed MFAC algorithm is given, and the effe...
Akbari, M. R.; Ganji, D. D.; Ahmadi, A. R.; Kachapi, Sayyid H. Hashemi
2014-03-01
In the current paper, a simplified model of Tower Cranes has been presented in order to investigate and analyze the nonlinear differential equation governing on the presented system in three different cases by Algebraic Method (AGM). Comparisons have been made between AGM and Numerical Solution, and these results have been indicated that this approach is very efficient and easy so it can be applied for other nonlinear equations. It is citable that there are some valuable advantages in this way of solving differential equations and also the answer of various sets of complicated differential equations can be achieved in this manner which in the other methods, so far, they have not had acceptable solutions. The simplification of the solution procedure in Algebraic Method and its application for solving a wide variety of differential equations not only in Vibrations but also in different fields of study such as fluid mechanics, chemical engineering, etc. make AGM be a powerful and useful role model for researchers in order to solve complicated nonlinear differential equations.
Nonmonotonic logics and algebras
Institute of Scientific and Technical Information of China (English)
CHAKRABORTY Mihir Kr; GHOSH Sujata
2008-01-01
Several nonmonotonie logic systems together with their algebraic semantics are discussed. NM-algebra is defined.An elegant construction of an NM-algebra starting from a Boolean algebra is described which gives rise to a few interesting algebraic issues.
Iachello, F
1995-01-01
1. The Wave Mechanics of Diatomic Molecules. 2. Summary of Elements of Algebraic Theory. 3. Mechanics of Molecules. 4. Three-Body Algebraic Theory. 5. Four-Body Algebraic Theory. 6. Classical Limit and Coordinate Representation. 8. Prologue to the Future. Appendices. Properties of Lie Algebras; Coupling of Algebras; Hamiltonian Parameters
DEVELOPMENT OF 2D HUMAN BODY MODELING USING THINNING ALGORITHM
Directory of Open Access Journals (Sweden)
K. Srinivasan
2010-11-01
Full Text Available Monitoring the behavior and activities of people in Video surveillance has gained more applications in Computer vision. This paper proposes a new approach to model the human body in 2D view for the activity analysis using Thinning algorithm. The first step of this work is Background subtraction which is achieved by the frame differencing algorithm. Thinning algorithm has been used to find the skeleton of the human body. After thinning, the thirteen feature points like terminating points, intersecting points, shoulder, elbow, and knee points have been extracted. Here, this research work attempts to represent the body model in three different ways such as Stick figure model, Patch model and Rectangle body model. The activities of humans have been analyzed with the help of 2D model for the pre-defined poses from the monocular video data. Finally, the time consumption and efficiency of our proposed algorithm have been evaluated.
Heisenberg XXX model with general boundaries: Eigenvectors from Algebraic Bethe ansatz
Belliard, S
2013-01-01
We propose a generalization of the algebraic Bethe ansatz to obtain the eigenvectors of the Heisenberg spin chain with general boundaries associated to the eigenvalues and the Bethe equations found recently by Cao et al. The ansatz takes the usual form of a product of operators acting on a particular vector except that the number of operators is equal to the length of the chain. We prove this result for the chains with small length. We obtain also an off-shell equation (i.e. satisfied without the Bethe equations) formally similar to the ones obtained in the periodic case or with diagonal boundaries.
Heisenberg XXX Model with General Boundaries: Eigenvectors from Algebraic Bethe Ansatz
Directory of Open Access Journals (Sweden)
Samuel Belliard
2013-11-01
Full Text Available We propose a generalization of the algebraic Bethe ansatz to obtain the eigenvectors of the Heisenberg spin chain with general boundaries associated to the eigenvalues and the Bethe equations found recently by Cao et al. The ansatz takes the usual form of a product of operators acting on a particular vector except that the number of operators is equal to the length of the chain. We prove this result for the chains with small length. We obtain also an off-shell equation (i.e. satisfied without the Bethe equations formally similar to the ones obtained in the periodic case or with diagonal boundaries.
Clifford algebra and the projective model of Minkowski (pseudo-Euclidean) spaces
Sokolov, Andrey
2013-01-01
I apply the algebraic framework introduced in arXiv:1101.4542v3[math.MG] to Minkowski (pseudo-Euclidean) spaces in 2, 3, and 4 dimensions. The exposition follows the template established in arXiv:1307.2917[math.MG] for Euclidean spaces. The emphasis is on geometric structures, but some contact with special relativity is made by considering relativistic addition of velocities and Lorentz transformations, both of which can be seen as rotation applied to points and to lines. The language used in...
Real Hamiltonian Forms of Affine Toda Models Related to Exceptional Lie Algebras
Directory of Open Access Journals (Sweden)
Vladimir S. Gerdjikov
2006-02-01
Full Text Available The construction of a family of real Hamiltonian forms (RHF for the special class of affine 1+1-dimensional Toda field theories (ATFT is reported. Thus the method, proposed in [1] for systems with finite number of degrees of freedom is generalized to infinite-dimensional Hamiltonian systems. The construction method is illustrated on the explicit nontrivial example of RHF of ATFT related to the exceptional algebras E_6 and E_7. The involutions of the local integrals of motion are proved by means of the classical R-matrix approach.
An Ada Linear-Algebra Software Package Modeled After HAL/S
Klumpp, Allan R.; Lawson, Charles L.
1990-01-01
New avionics software written more easily. Software package extends Ada programming language to include linear-algebra capabilities similar to those of HAL/S programming language. Designed for such avionics applications as Space Station flight software. In addition to built-in functions of HAL/S, package incorporates quaternion functions used in Space Shuttle and Galileo projects and routines from LINPAK solving systems of equations involving general square matrices. Contains two generic programs: one for floating-point computations and one for integer computations. Written on IBM/AT personal computer running under PC DOS, v.3.1.
Algebraic Bethe ansatz for the sl(2) Gaudin model with boundary
António, N Cirilo; Ragoucy, E; Salom, I
2015-01-01
Following Sklyanin's proposal in the periodic case, we derive the generating function of the Gaudin Hamiltonians with boundary terms. Our derivation is based on the quasi-classical expansion of the linear combination of the transfer matrix of the XXX Heisenberg spin chain and the central element, the so-called Sklyanin determinant. The corresponding Gaudin Hamiltonians with boundary terms are obtained as the residues of the generating function. By defining the appropriate Bethe vectors which yield strikingly simple off shell action of the generating function, we fully implement the algebraic Bethe ansatz, obtaining the spectrum of the generating function and the corresponding Bethe equations.
Algebraic Bethe ansatz for the XXX chain with triangular boundaries and Gaudin model
António, N Cirilo; Salom, I
2014-01-01
We implement fully the algebraic Bethe ansatz for the XXX Heisenberg spin chain in the case when both boundary matrices can be brought to the upper-triangular form. We define the Bethe vectors which yield the strikingly simple expression for the off shell action of the transfer matrix, deriving the spectrum and the corresponding Bethe equations. We explore further these results by obtaining the off shell action of the generating function of the Gaudin Hamiltonians on the Bethe vectors through the so-called quasi-classical limit.
Heisenberg XXX Model with General Boundaries: Eigenvectors from Algebraic Bethe Ansatz
Belliard, Samuel; Crampé, Nicolas
2013-11-01
We propose a generalization of the algebraic Bethe ansatz to obtain the eigenvectors of the Heisenberg spin chain with general boundaries associated to the eigenvalues and the Bethe equations found recently by Cao et al. The ansatz takes the usual form of a product of operators acting on a particular vector except that the number of operators is equal to the length of the chain. We prove this result for the chains with small length. We obtain also an off-shell equation (i.e. satisfied without the Bethe equations) formally similar to the ones obtained in the periodic case or with diagonal boundaries.
Methodology and basic algorithms of the Livermore Economic Modeling System
Energy Technology Data Exchange (ETDEWEB)
Bell, R.B.
1981-03-17
The methodology and the basic pricing algorithms used in the Livermore Economic Modeling System (EMS) are described. The report explains the derivations of the EMS equations in detail; however, it could also serve as a general introduction to the modeling system. A brief but comprehensive explanation of what EMS is and does, and how it does it is presented. The second part examines the basic pricing algorithms currently implemented in EMS. Each algorithm's function is analyzed and a detailed derivation of the actual mathematical expressions used to implement the algorithm is presented. EMS is an evolving modeling system; improvements in existing algorithms are constantly under development and new submodels are being introduced. A snapshot of the standard version of EMS is provided and areas currently under study and development are considered briefly.
Corrochano, Eduardo Bayro
2010-01-01
This book presents contributions from a global selection of experts in the field. This useful text offers new insights and solutions for the development of theorems, algorithms and advanced methods for real-time applications across a range of disciplines. Written in an accessible style, the discussion of all applications is enhanced by the inclusion of numerous examples, figures and experimental analysis. Features: provides a thorough discussion of several tasks for image processing, pattern recognition, computer vision, robotics and computer graphics using the geometric algebra framework; int
Models and algorithms for biomolecules and molecular networks
DasGupta, Bhaskar
2016-01-01
By providing expositions to modeling principles, theories, computational solutions, and open problems, this reference presents a full scope on relevant biological phenomena, modeling frameworks, technical challenges, and algorithms. * Up-to-date developments of structures of biomolecules, systems biology, advanced models, and algorithms * Sampling techniques for estimating evolutionary rates and generating molecular structures * Accurate computation of probability landscape of stochastic networks, solving discrete chemical master equations * End-of-chapter exercises
Quaternionen and Geometric Algebra (Quaternionen und Geometrische Algebra)
Horn, Martin Erik
2007-01-01
In the last one and a half centuries, the analysis of quaternions has not only led to further developments in mathematics but has also been and remains an important catalyst for the further development of theories in physics. At the same time, Hestenes geometric algebra provides a didactically promising instrument to model phenomena in physics mathematically and in a tangible manner. Quaternions particularly have a catchy interpretation in the context of geometric algebra which can be used didactically. The relation between quaternions and geometric algebra is presented with a view to analysing its didactical possibilities.
Surzhykov, Andrey; Koval, Peter; Fritzsche, Stephan
2005-01-01
Today, the 'hydrogen atom model' is known to play its role not only in teaching the basic elements of quantum mechanics but also for building up effective theories in atomic and molecular physics, quantum optics, plasma physics, or even in the design of semiconductor devices. Therefore, the analytical as well as numerical solutions of the hydrogen-like ions are frequently required both, for analyzing experimental data and for carrying out quite advanced theoretical studies. In order to support a fast and consistent access to these (Coulomb-field) solutions, here we present the DIRAC program which has been developed originally for studying the properties and dynamical behavior of the (hydrogen-like) ions. In the present version, a set of MAPLE procedures is provided for the Coulomb wave and Green's functions by applying the (wave) equations from both, the nonrelativistic and relativistic theory. Apart from the interactive access to these functions, moreover, a number of radial integrals are also implemented in the DIRAC program which may help the user to construct transition amplitudes and cross sections as they occur frequently in the theory of ion-atom and ion-photon collisions. Program summaryTitle of program:DIRAC Catalogue number: ADUQ Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADUQ Program obtainable from: CPC Program Library, Queen's University of Belfast, N. Ireland Licensing provisions: None Computer for which the program is designed and has been tested: All computers with a license of the computer algebra package MAPLE [1] Program language used: Maple 8 and 9 No. of lines in distributed program, including test data, etc.:2186 No. of bytes in distributed program, including test data, etc.: 162 591 Distribution format: tar gzip file CPC Program Library subprograms required: None Nature of the physical problem: Analytical solutions of the hydrogen atom are widely used in very different fields of physics [2,3]. Despite of the rather simple structure
Model-Free Adaptive Control Algorithm with Data Dropout Compensation
Directory of Open Access Journals (Sweden)
Xuhui Bu
2012-01-01
Full Text Available The convergence of model-free adaptive control (MFAC algorithm can be guaranteed when the system is subject to measurement data dropout. The system output convergent speed gets slower as dropout rate increases. This paper proposes a MFAC algorithm with data compensation. The missing data is first estimated using the dynamical linearization method, and then the estimated value is introduced to update control input. The convergence analysis of the proposed MFAC algorithm is given, and the effectiveness is also validated by simulations. It is shown that the proposed algorithm can compensate the effect of the data dropout, and the better output performance can be obtained.
A motion retargeting algorithm based on model simplification
Institute of Scientific and Technical Information of China (English)
无
2005-01-01
A new motion retargeting algorithm is presented, which adapts the motion capture data to a new character. To make the resulting motion realistic, the physically-based optimization method is adopted. However, the optimization process is difficult to converge to the optimal value because of high complexity of the physical human model. In order to address this problem, an appropriate simplified model automatically determined by a motion analysis technique is utilized, and then motion retargeting with this simplified model as an intermediate agent is implemented. The entire motion retargeting algorithm involves three steps of nonlinearly constrained optimization: forward retargeting, motion scaling and inverse retargeting. Experimental results show the validity of this algorithm.
Quantum Monte Carlo methods algorithms for lattice models
Gubernatis, James; Werner, Philipp
2016-01-01
Featuring detailed explanations of the major algorithms used in quantum Monte Carlo simulations, this is the first textbook of its kind to provide a pedagogical overview of the field and its applications. The book provides a comprehensive introduction to the Monte Carlo method, its use, and its foundations, and examines algorithms for the simulation of quantum many-body lattice problems at finite and zero temperature. These algorithms include continuous-time loop and cluster algorithms for quantum spins, determinant methods for simulating fermions, power methods for computing ground and excited states, and the variational Monte Carlo method. Also discussed are continuous-time algorithms for quantum impurity models and their use within dynamical mean-field theory, along with algorithms for analytically continuing imaginary-time quantum Monte Carlo data. The parallelization of Monte Carlo simulations is also addressed. This is an essential resource for graduate students, teachers, and researchers interested in ...
An Automatic Registration Algorithm for 3D Maxillofacial Model
Qiu, Luwen; Zhou, Zhongwei; Guo, Jixiang; Lv, Jiancheng
2016-09-01
3D image registration aims at aligning two 3D data sets in a common coordinate system, which has been widely used in computer vision, pattern recognition and computer assisted surgery. One challenging problem in 3D registration is that point-wise correspondences between two point sets are often unknown apriori. In this work, we develop an automatic algorithm for 3D maxillofacial models registration including facial surface model and skull model. Our proposed registration algorithm can achieve a good alignment result between partial and whole maxillofacial model in spite of ambiguous matching, which has a potential application in the oral and maxillofacial reparative and reconstructive surgery. The proposed algorithm includes three steps: (1) 3D-SIFT features extraction and FPFH descriptors construction; (2) feature matching using SAC-IA; (3) coarse rigid alignment and refinement by ICP. Experiments on facial surfaces and mandible skull models demonstrate the efficiency and robustness of our algorithm.
Twisted C⋆-algebra formulation of quantum cosmology with application to the Bianchi I model
Rosenbaum, Marcos; Vergara, J. David; Juárez, Román; Minzoni, A. A.
2014-04-01
A twisted C⋆-algebra of the extended (noncommutative) Heisenberg-Weyl group has been constructed which takes into account the uncertainty principle for coordinates in the Planck-length regime. This general construction is then used to generate an appropriate Hilbert space and observables for the noncommutative theory which, when applied to the Bianchi I cosmology, leads to a new set of equations that describe the quantum evolution of the Universe. We find that this formulation matches theories based on a reticular Heisenberg-Weyl algebra in the bouncing and expanding regions of a collapsing Bianchi universe. There is, however, an additional effect introduced by the dynamics generated by the noncommutativity. This is an oscillation in the spectrum of the volume operator of the Universe, within the bouncing region of the commutative theories. We show that this effect is generic and produced by the noncommutative momentum exchange between the degrees of freedom in the cosmology. We give asymptotic and numerical solutions which show the above mentioned effects of the noncommutativity.