Construction and decoding of a class of algebraic geometry codes

DEFF Research Database (Denmark)

Justesen, Jørn; Larsen, Knud J.; Jensen, Helge Elbrønd

1989-01-01

A class of codes derived from algebraic plane curves is constructed. The concepts and results from algebraic geometry that were used are explained in detail; no further knowledge of algebraic geometry is needed. Parameters, generator and parity-check matrices are given. The main result is a decod...... is a decoding algorithm which turns out to be a generalization of the Peterson algorithm for decoding BCH decoder codes......A class of codes derived from algebraic plane curves is constructed. The concepts and results from algebraic geometry that were used are explained in detail; no further knowledge of algebraic geometry is needed. Parameters, generator and parity-check matrices are given. The main result...

Using computer algebra and SMT-solvers to analyze a mathematical model of cholera propagation

Science.gov (United States)

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.

Toda theories, W-algebras, and minimal models

International Nuclear Information System (INIS)

Mansfield, P.; Spence, B.

1991-01-01

We discuss the classical W-algebra symmetries of Toda field theories in terms of the pseudo-differential Lax operator associated with the Toda Lax pair. We then show how the W-algebra transformations can be understood as the non-abelian gauge transformations which preserve the form of the Lax pair. This provides a new understanding of the W-algebras, and we discuss their closure and co-cycle structure using this approach. The quantum Lax operator is investigated, and we show that this operator, which generates the quantum W-algebra currents, is conserved in the conformally extended Toda theories. The W-algebra minimal model primary fields are shown to arise naturally in these theories, leading to the conjecture that the conformally extended Toda theories provide a lagrangian formulation of the W-algebra minimal models. (orig.)

Parallel Algorithms for Model Checking

NARCIS (Netherlands)

van de Pol, Jaco; Mousavi, Mohammad Reza; Sgall, Jiri

2017-01-01

Model checking is an automated verification procedure, which checks that a model of a system satisfies certain properties. These properties are typically expressed in some temporal logic, like LTL and CTL. Algorithms for LTL model checking (linear time logic) are based on automata theory and graph

Validation of Simulation Models without Knowledge of Parameters Using Differential Algebra

Directory of Open Access Journals (Sweden)

Björn Haffke

2015-01-01

Full Text Available This study deals with the external validation of simulation models using methods from differential algebra. Without any system identification or iterative numerical methods, this approach provides evidence that the equations of a model can represent measured and simulated sets of data. This is very useful to check if a model is, in general, suitable. In addition, the application of this approach to verification of the similarity between the identifiable parameters of two models with different sets of input and output measurements is demonstrated. We present a discussion on how the method can be used to find parameter deviations between any two models. The advantage of this method is its applicability to nonlinear systems as well as its algorithmic nature, which makes it easy to automate.

Modeling digital switching circuits with linear algebra

CERN Document Server

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

W algebra in the SU(3) parafermion model

International Nuclear Information System (INIS)

Ding, X.; Fan, H.; Shi, K.; Wang, P.; Zhu, C.

1993-01-01

A construction of W 3 algebra for the SU(3) parafermion model is proposed, in which a Z algebra technique is used instead of the popular free-field realization. The central charge of the underlying algebra is different from known W algebras

Algebraic formulation of collective models. I. The mass quadrupole collective model

International Nuclear Information System (INIS)

Rosensteel, G.; Rowe, D.J.

1979-01-01

This paper is the first in a series of three which together present a microscopic formulation of the Bohr--Mottelson (BM) collective model of the nucleus. In this article the mass quadrupole collective (MQC) model is defined and shown to be a generalization of the BM model. The MQC model eliminates the small oscillation assumption of BM and also yields the rotational and CM (3) submodels by holonomic constraints on the MQC configuration space. In addition, the MQC model is demonstrated to be an algebraic model, so that the state space of the MQC model carries an irrep of a Lie algebra of microscopic observables, the MQC algebra. An infinite class of new collective models is then given by the various inequivalent irreps of this algebra. A microscopic embedding of the BM model is achieved by decomposing the representation of the MQC algebra on many-particle state space into its irreducible components. In the second paper this decomposition is studied in detail. The third paper presents the symplectic model, which provides the realization of the collective model in the harmonic oscillator shell model

An algebraic model for three-cluster giant molecules

International Nuclear Information System (INIS)

Hess, P.O.; Bijker, R.; Misicu, S.

2001-01-01

After an introduction to the algebraic U(7) model for three bodies, we present a relation of a geometrical description of three-cluster molecule to the algebraic U(7) model. Stiffness parameters of oscillations between each of two clusters are calculated and translated to the model parameter values of the algebraic model. The model is applied to the trinuclear system l32 Sn+ α + ll6 Pd which occurs in the ternary cold fission of 252 Cf. (Author)

The large N=4 superconformal W∞ algebra

International Nuclear Information System (INIS)

Beccaria, Matteo; Candu, Constantin; Gaberdiel, Matthias R.

2014-01-01

The most general large N=4 superconformal W ∞ algebra, containing in addition to the superconformal algebra one supermultiplet for each integer spin, is analysed in detail. It is found that the W ∞ algebra is uniquely determined by the levels of the two su(2) algebras, a conclusion that holds both for the linear and the non-linear case. We also perform various cross-checks of our analysis, and exhibit two different types of truncations in some detail.

Category-theoretic models of algebraic computer systems

Science.gov (United States)

Kovalyov, S. P.

2016-01-01

A computer system is said to be algebraic if it contains nodes that implement unconventional computation paradigms based on universal algebra. A category-based approach to modeling such systems that provides a theoretical basis for mapping tasks to these systems' architecture is proposed. The construction of algebraic models of general-purpose computations involving conditional statements and overflow control is formally described by a reflector in an appropriate category of algebras. It is proved that this reflector takes the modulo ring whose operations are implemented in the conventional arithmetic processors to the Łukasiewicz logic matrix. Enrichments of the set of ring operations that form bases in the Łukasiewicz logic matrix are found.

Model Checking Structured Infinite Markov Chains

NARCIS (Netherlands)

Remke, Anne Katharina Ingrid

2008-01-01

In the past probabilistic model checking hast mostly been restricted to finite state models. This thesis explores the possibilities of model checking with continuous stochastic logic (CSL) on infinite-state Markov chains. We present an in-depth treatment of model checking algorithms for two special

Fusion algebras of logarithmic minimal models

International Nuclear Information System (INIS)

Rasmussen, Joergen; Pearce, Paul A

2007-01-01

We present explicit conjectures for the chiral fusion algebras of the logarithmic minimal models LM(p,p') considering Virasoro representations with no enlarged or extended symmetry algebra. The generators of fusion are countably infinite in number but the ensuing fusion rules are quasi-rational in the sense that the fusion of a finite number of representations decomposes into a finite direct sum of representations. The fusion rules are commutative, associative and exhibit an sl(2) structure but require so-called Kac representations which are typically reducible yet indecomposable representations of rank 1. In particular, the identity of the fundamental fusion algebra p ≠ 1 is a reducible yet indecomposable Kac representation of rank 1. We make detailed comparisons of our fusion rules with the results of Gaberdiel and Kausch for p = 1 and with Eberle and Flohr for (p, p') = (2, 5) corresponding to the logarithmic Yang-Lee model. In the latter case, we confirm the appearance of indecomposable representations of rank 3. We also find that closure of a fundamental fusion algebra is achieved without the introduction of indecomposable representations of rank higher than 3. The conjectured fusion rules are supported, within our lattice approach, by extensive numerical studies of the associated integrable lattice models. Details of our lattice findings and numerical results will be presented elsewhere. The agreement of our fusion rules with the previous fusion rules lends considerable support for the identification of the logarithmic minimal models LM(p,p') with the augmented c p,p' (minimal) models defined algebraically

Statistical Model Checking of Rich Models and Properties

DEFF Research Database (Denmark)

Poulsen, Danny Bøgsted

in undecidability issues for the traditional model checking approaches. Statistical model checking has proven itself a valuable supplement to model checking and this thesis is concerned with extending this software validation technique to stochastic hybrid systems. The thesis consists of two parts: the first part...... motivates why existing model checking technology should be supplemented by new techniques. It also contains a brief introduction to probability theory and concepts covered by the six papers making up the second part. The first two papers are concerned with developing online monitoring techniques...... systems. The fifth paper shows how stochastic hybrid automata are useful for modelling biological systems and the final paper is concerned with showing how statistical model checking is efficiently distributed. In parallel with developing the theory contained in the papers, a substantial part of this work...

Model Checking Markov Chains: Techniques and Tools

NARCIS (Netherlands)

Zapreev, I.S.

2008-01-01

This dissertation deals with four important aspects of model checking Markov chains: the development of efficient model-checking tools, the improvement of model-checking algorithms, the efficiency of the state-space reduction techniques, and the development of simulation-based model-checking

Computational algebraic geometry of epidemic models

Science.gov (United States)

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.

Logarithmic sℓ-hat (2) CFT models from Nichols algebras: I

International Nuclear Information System (INIS)

Semikhatov, A M; Tipunin, I Yu

2013-01-01

We construct chiral algebras that centralize rank-2 Nichols algebras with at least one fermionic generator. This gives ‘logarithmic’ W-algebra extensions of a fractional-level sℓ-hat (2) algebra. We discuss crucial aspects of the emerging general relation between Nichols algebras and logarithmic conformal field theory (CFT) models: (i) the extra input, beyond the Nichols algebra proper, needed to uniquely specify a conformal model; (ii) a relation between the CFT counterparts of Nichols algebras connected by Weyl groupoid maps; and (iii) the common double bosonization U(X) of such Nichols algebras. For an extended chiral algebra, candidates for its simple modules that are counterparts of the U(X) simple modules are proposed, as a first step toward a functorial relation between U(X) and W-algebra representation categories. (paper)

A new (in)finite-dimensional algebra for quantum integrable models

International Nuclear Information System (INIS)

Baseilhac, Pascal; Koizumi, Kozo

2005-01-01

A new (in)finite-dimensional algebra which is a fundamental dynamical symmetry of a large class of (continuum or lattice) quantum integrable models is introduced and studied in details. Finite-dimensional representations are constructed and mutually commuting quantities-which ensure the integrability of the system-are written in terms of the fundamental generators of the new algebra. Relation with the deformed Dolan-Grady integrable structure recently discovered by one of the authors and Terwilliger's tridiagonal algebras is described. Remarkably, this (in)finite-dimensional algebra is a 'q-deformed' analogue of the original Onsager's algebra arising in the planar Ising model. Consequently, it provides a new and alternative algebraic framework for studying massive, as well as conformal, quantum integrable models

Model Checking Real-Time Systems

DEFF Research Database (Denmark)

Bouyer, Patricia; Fahrenberg, Uli; Larsen, Kim Guldstrand

2018-01-01

This chapter surveys timed automata as a formalism for model checking real-time systems. We begin with introducing the model, as an extension of finite-state automata with real-valued variables for measuring time. We then present the main model-checking results in this framework, and give a hint...

Algebraic Verification Method for SEREs Properties via Groebner Bases Approaches

Directory of Open Access Journals (Sweden)

Ning Zhou

2013-01-01

Full Text Available This work presents an efficient solution using computer algebra system to perform linear temporal properties verification for synchronous digital systems. The method is essentially based on both Groebner bases approaches and symbolic simulation. A mechanism for constructing canonical polynomial set based symbolic representations for both circuit descriptions and assertions is studied. We then present a complete checking algorithm framework based on these algebraic representations by using Groebner bases. The computational experience result in this work shows that the algebraic approach is a quite competitive checking method and will be a useful supplement to the existent verification methods based on simulation.

Current algebra of WZNW models at and away from criticality

International Nuclear Information System (INIS)

Abdalla, E.; Forger, M.

1992-01-01

In this paper, the authors derive the current algebra of principal chiral models with a Wess-Zumino term. At the critical coupling where the model becomes conformally invariant (Wess-Zumino-Novikov-Witten theory), this algebra reduces to two commuting Kac-Moody algebras, while in the limit where the coupling constant is taken to zero (ordinary chiral model), we recover the current algebra of that model. In this way, the latter is explicitly realized as a deformation of the former, with the coupling constant as the deformation parameter

Algebraic computability and enumeration models recursion theory and descriptive complexity

CERN Document Server

Nourani, Cyrus F

2016-01-01

This book, Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the algebraic viewpoint. The reader is first introduced to categories and functorial models, with Kleene algebra examples for languages. Functorial models for Peano arithmetic are described toward important computational complexity areas on a Hilbert program, leading to computability with initial models. Infinite language categories are also introduced to explain descriptive complexity with recursive computability with admissible sets and urelements. Algebraic and categorical realizability is staged on several levels, addressing new computability questions with omitting types realizably. Further applications to computing with ultrafilters on sets and Turing degree computability are examined. Functorial models computability is presented with algebraic trees realizing intuitionistic type...

Compositional and Quantitative Model Checking

DEFF Research Database (Denmark)

Larsen, Kim Guldstrand

2010-01-01

This paper gives a survey of a composition model checking methodology and its succesfull instantiation to the model checking of networks of finite-state, timed, hybrid and probabilistic systems with respect; to suitable quantitative versions of the modal mu-calculus [Koz82]. The method is based...

Chiral algebras in Landau-Ginzburg models

Science.gov (United States)

Dedushenko, Mykola

2018-03-01

Chiral algebras in the cohomology of the {\\overline{Q}}+ supercharge of two-dimensional N=(0,2) theories on flat spacetime are discussed. Using the supercurrent multiplet, we show that the answer is renormalization group invariant for theories with an R-symmetry. For N=(0,2) Landau-Ginzburg models, the chiral algebra is determined by the operator equations of motion, which preserve their classical form, and quantum renormalization of composite operators. We study these theories and then specialize to the N=(2,2) models and consider some examples.

Tensor models, Kronecker coefficients and permutation centralizer algebras

Science.gov (United States)

Geloun, Joseph Ben; Ramgoolam, Sanjaye

2017-11-01

We show that the counting of observables and correlators for a 3-index tensor model are organized by the structure of a family of permutation centralizer algebras. These algebras are shown to be semi-simple and their Wedderburn-Artin decompositions into matrix blocks are given in terms of Clebsch-Gordan coefficients of symmetric groups. The matrix basis for the algebras also gives an orthogonal basis for the tensor observables which diagonalizes the Gaussian two-point functions. The centres of the algebras are associated with correlators which are expressible in terms of Kronecker coefficients (Clebsch-Gordan multiplicities of symmetric groups). The color-exchange symmetry present in the Gaussian model, as well as a large class of interacting models, is used to refine the description of the permutation centralizer algebras. This discussion is extended to a general number of colors d: it is used to prove the integrality of an infinite family of number sequences related to color-symmetrizations of colored graphs, and expressible in terms of symmetric group representation theory data. Generalizing a connection between matrix models and Belyi maps, correlators in Gaussian tensor models are interpreted in terms of covers of singular 2-complexes. There is an intriguing difference, between matrix and higher rank tensor models, in the computational complexity of superficially comparable correlators of observables parametrized by Young diagrams.

A Simple and Practical Linear Algebra Library Interface with Static Size Checking

Directory of Open Access Journals (Sweden)

Akinori Abe

2015-12-01

Full Text Available Linear algebra is a major field of numerical computation and is widely applied. Most linear algebra libraries (in most programming languages do not statically guarantee consistency of the dimensions of vectors and matrices, causing runtime errors. While advanced type systems—specifically, dependent types on natural numbers—can ensure consistency among the sizes of collections such as lists and arrays, such type systems generally require non-trivial changes to existing languages and application programs, or tricky type-level programming. We have developed a linear algebra library interface that verifies the consistency (with respect to dimensions of matrix operations by means of generative phantom types, implemented via fairly standard ML types and module system. To evaluate its usability, we ported to it a practical machine learning library from a traditional linear algebra library. We found that most of the changes required for the porting could be made mechanically, and changes that needed human thought are minor.

Model-Checking Discrete Duration Calculus

DEFF Research Database (Denmark)

Hansen, Michael Reichhardt

1994-01-01

can do model-checking. The subset we consider is expressive enough to formalize the requirements to the gas burner system given by A.P. Ravn (1993); but only for a discrete time domain. Model-checking is done by reducing the correctness problem ℳ|=𝒟 to the inclusion problem of regular...

Algebraic Modeling of Topological and Computational Structures and Applications

CERN Document Server

Theodorou, Doros; Stefaneas, Petros; Kauffman, Louis

2017-01-01

This interdisciplinary book covers a wide range of subjects, from pure mathematics (knots, braids, homotopy theory, number theory) to more applied mathematics (cryptography, algebraic specification of algorithms, dynamical systems) and concrete applications (modeling of polymers and ionic liquids, video, music and medical imaging). The main mathematical focus throughout the book is on algebraic modeling with particular emphasis on braid groups. The research methods include algebraic modeling using topological structures, such as knots, 3-manifolds, classical homotopy groups, and braid groups. The applications address the simulation of polymer chains and ionic liquids, as well as the modeling of natural phenomena via topological surgery. The treatment of computational structures, including finite fields and cryptography, focuses on the development of novel techniques. These techniques can be applied to the design of algebraic specifications for systems modeling and verification. This book is the outcome of a w...

Exchange algebra and exotic supersymmetry in the Chiral Potts model

International Nuclear Information System (INIS)

Bernard, D.; Pasquier, V.

1989-01-01

We obtain an exchange algebra for the Chiral Potts model, the elements of which are linear in the parameters defining the rapidity curve. This enables us to connect the Chiral Potts model to a U q (GL(2)) algebra. On the other hand, looking at the model from the S-matrix point of view relates it to a Z N generalisation of the supersymmetric algebra

The ABCDEFG of instantons and W-algebras

OpenAIRE

Keller, Christoph A.; Mekareeya, Noppadol; Song, Jaewon; Tachikawa, Yuji

2012-01-01

For arbitrary gauge groups, we check at the one-instanton level that the Nekrasov partition function of pure N = 2 super Yang-Mills is equal to the norm of a certain coherent state of the corresponding W-algebra. For non-simply-laced gauge groups, we confirm in particular that the coherent state is in the twisted sector of a simply-laced W-algebra.

Hyper-lattice algebraic model for data warehousing

CERN Document Server

Sen, Soumya; Chaki, Nabendu

2016-01-01

This book presents Hyper-lattice, a new algebraic model for partially ordered sets, and an alternative to lattice. The authors analyze some of the shortcomings of conventional lattice structure and propose a novel algebraic structure in the form of Hyper-lattice to overcome problems with lattice. They establish how Hyper-lattice supports dynamic insertion of elements in a partial order set with a partial hierarchy between the set members. The authors present the characteristics and the different properties, showing how propositions and lemmas formalize Hyper-lattice as a new algebraic structure.

Algebra for Enterprise Ontology: towards analysis and synthesis of enterprise models

Science.gov (United States)

Suga, Tetsuya; Iijima, Junichi

2018-03-01

Enterprise modeling methodologies have made enterprises more likely to be the object of systems engineering rather than craftsmanship. However, the current state of research in enterprise modeling methodologies lacks investigations of the mathematical background embedded in these methodologies. Abstract algebra, a broad subfield of mathematics, and the study of algebraic structures may provide interesting implications in both theory and practice. Therefore, this research gives an empirical challenge to establish an algebraic structure for one aspect model proposed in Design & Engineering Methodology for Organizations (DEMO), which is a major enterprise modeling methodology in the spotlight as a modeling principle to capture the skeleton of enterprises for developing enterprise information systems. The results show that the aspect model behaves well in the sense of algebraic operations and indeed constructs a Boolean algebra. This article also discusses comparisons with other modeling languages and suggests future work.

Algebraic aspects of exact models

International Nuclear Information System (INIS)

Gaudin, M.

1983-01-01

Spin chains, 2-D spin lattices, chemical crystals, and particles in delta function interaction share the same underlying structures: the applicability of Bethe's superposition ansatz for wave functions, the commutativity of transfer matrices, and the existence of a ternary operator algebra. The appearance of these structures and interrelations from the eight vortex model, for delta function interreacting particles of general spin, and for spin 1/2, are outlined as follows: I. Eight Vortex Model. Equivalences to Ising model and the dimer system. Transfer matrix and symmetry of the Self Conjugate model. Relation between the XYZ Hamiltonian and the transfer matrix. One parameter family of commuting transfer matrices. A representation of the symmetric group spin. Diagonalization of the transfer matrix. The Coupled Spectrum equations. II. Identical particles with Delta Function interaction. The Bethe ansatz. Yang's representation. The Ternary Algebra and intergrability. III. Identical particles with delta function interaction: general solution for two internal states. The problem of spin 1/2 fermions. The Operator method

An algebraic approach to modeling in software engineering

International Nuclear Information System (INIS)

Loegel, C.J.; Ravishankar, C.V.

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

Observable algebras for the rational and trigonometric Euler-Calogero-Moser Models

International Nuclear Information System (INIS)

Avan, J.; Billey, E.

1995-01-01

We construct polynomial Poisson algebras of observables for the classical Euler-Calogero-Moser (ECM) models. Their structure connects them to flavour-indexed non-linear W ∞ algebras, albeit with qualitative differences. The conserved Hamiltonians and symmetry algebras derived in a previous work are subsets of these algebra. We define their linear, N →∞ limits, realizing W ∞ type algebras coupled to current algebras. ((orig.))

The ABCDEFG of instantons and W-algebras

Science.gov (United States)

Keller, Christoph A.; Mekareeya, Noppadol; Song, Jaewon; Tachikawa, Yuji

2012-03-01

For arbitrary gauge groups, we check at the one-instanton level that the Nekrasov partition function of pure mathcal{N} = {2} super Yang-Mills is equal to the norm of a certain coherent state of the corresponding W-algebra. For non-simply-laced gauge groups, we confirm in particular that the coherent state is in the twisted sector of a simply-laced W-algebra.

Model Checking Markov Reward Models with Impulse Rewards

NARCIS (Netherlands)

Cloth, Lucia; Katoen, Joost-Pieter; Khattri, Maneesh; Pulungan, Reza; Bondavalli, Andrea; Haverkort, Boudewijn; Tang, Dong

This paper considers model checking of Markov reward models (MRMs), continuous-time Markov chains with state rewards as well as impulse rewards. The reward extension of the logic CSL (Continuous Stochastic Logic) is interpreted over such MRMs, and two numerical algorithms are provided to check the

A process algebra model of QED

International Nuclear Information System (INIS)

Sulis, William

2016-01-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. (paper)

UTP and Temporal Logic Model Checking

Science.gov (United States)

Anderson, Hugh; Ciobanu, Gabriel; Freitas, Leo

In this paper we give an additional perspective to the formal verification of programs through temporal logic model checking, which uses Hoare and He Unifying Theories of Programming (UTP). Our perspective emphasizes the use of UTP designs, an alphabetised relational calculus expressed as a pre/post condition pair of relations, to verify state or temporal assertions about programs. The temporal model checking relation is derived from a satisfaction relation between the model and its properties. The contribution of this paper is that it shows a UTP perspective to temporal logic model checking. The approach includes the notion of efficiency found in traditional model checkers, which reduced a state explosion problem through the use of efficient data structures

Higher-spin algebras, holography and flat space

Energy Technology Data Exchange (ETDEWEB)

Sleight, C. [Max-Planck-Institut für Physik (Werner-Heisenberg-Institut),Föhringer Ring 6, D-80805 Munich (Germany); Université Libre de Bruxelles and International Solvay Institutes,ULB-Campus Plaine CP231, 1050 Brussels (Belgium); Taronna, M. [Université Libre de Bruxelles and International Solvay Institutes,ULB-Campus Plaine CP231, 1050 Brussels (Belgium)

2017-02-20

In this article we study the higher-spin algebra behind the type-A cubic couplings recently extracted from the free O(N) model in generic dimensions, demonstrating that they coincide with the known structure constants for the unique higher-spin algebra in generic dimensions. This provides an explicit check of the holographic reconstruction and of the duality between higher-spin theories and the free O(N) model in generic dimensions, generalising the result of Giombi and Yin in AdS{sub 4}. For completeness, we also address the same problem in the flat space for the cubic couplings derived by Metsaev in 1991, which are recovered from the flat limit of the AdS type-A cubic couplings. We observe that both flat and AdS{sub 4} higher-spin Lorentz subalgebras coincide, hinting towards the existence of a full higher-spin symmetry behind the flat-space cubic couplings of Metsaev.

LHCb: Analysing DIRAC's Behavior using Model Checking with Process Algebra

CERN Multimedia

Remenska, Daniela

2012-01-01

DIRAC is the Grid solution designed to support LHCb production activities as well as user data analysis. Based on a service-oriented architecture, DIRAC consists of many cooperating distributed services and agents delivering the workload to the Grid resources. Services accept requests from agents and running jobs, while agents run as light-weight components, fulfilling specific goals. Services maintain database back-ends to store dynamic state information of entities such as jobs, queues, staging requests, etc. Agents use polling to check for changes in the service states, and react to these accordingly. A characteristic of DIRAC's architecture is the relatively low complexity in the logic of each agent; the main source of complexity lies in their cooperation. These agents run concurrently, and communicate using the services' databases as a shared memory for synchronizing the state transitions. Although much effort is invested in making DIRAC reliable, entities occasionally get into inconsistent states, leadi...

Model Checking Infinite-State Markov Chains

NARCIS (Netherlands)

Remke, Anne Katharina Ingrid; Haverkort, Boudewijn R.H.M.; Cloth, L.

2004-01-01

In this paper algorithms for model checking CSL (continuous stochastic logic) against infinite-state continuous-time Markov chains of so-called quasi birth-death type are developed. In doing so we extend the applicability of CSL model checking beyond the recently proposed case for finite-state

Current algebra of classical non-linear sigma models

International Nuclear Information System (INIS)

Forger, M.; Laartz, J.; Schaeper, U.

1992-01-01

The current algebra of classical non-linear sigma models on arbitrary Riemannian manifolds is analyzed. It is found that introducing, in addition to the Noether current j μ associated with the global symmetry of the theory, a composite scalar field j, the algebra closes under Poisson brackets. (orig.)

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...... set-theoretic models are considered, and conditions are given for the existence of initial reduct's of such models. Algebraic specifications for various set-theoretic concepts are considered....

Algebraic Optimization of Recursive Database Queries

DEFF Research Database (Denmark)

Hansen, Michael Reichhardt

1988-01-01

Queries are expressed by relational algebra expressions including a fixpoint operation. A condition is presented under which a natural join commutes with a fixpoint operation. This condition is a simple check of attribute sets of sub-expressions of the query. The work may be considered a generali......Queries are expressed by relational algebra expressions including a fixpoint operation. A condition is presented under which a natural join commutes with a fixpoint operation. This condition is a simple check of attribute sets of sub-expressions of the query. The work may be considered...... a generalization of Aho and Ullman, (1979). The result is interpreted in function free logic database terms as a transformation of the recursively defined predicate involving: (a) elimination of an argument, and (b) propagation of selections (instantiations) to the extensionally defined predicates. A collection...

Coverage Metrics for Model Checking

Science.gov (United States)

Penix, John; Visser, Willem; Norvig, Peter (Technical Monitor)

2001-01-01

When using model checking to verify programs in practice, it is not usually possible to achieve complete coverage of the system. In this position paper we describe ongoing research within the Automated Software Engineering group at NASA Ames on the use of test coverage metrics to measure partial coverage and provide heuristic guidance for program model checking. We are specifically interested in applying and developing coverage metrics for concurrent programs that might be used to support certification of next generation avionics software.

Anisotropic correlated electron model associated with the Temperley-Lieb algebra

International Nuclear Information System (INIS)

Foerster, Angela; Links, Jon; Roditi, Itzhak

1997-12-01

We present and anisotropic correlated electron model on a periodic lattice, constructed from an R-matrix associated with the Temperley-Lieb algebra. By modification of the coupling of the first and last sites we obtain a model with quantum algebra invariance. (author)

Algebraic Traveling Wave Solutions of a Non-local Hydrodynamic-type Model

International Nuclear Information System (INIS)

Chen, Aiyong; Zhu, Wenjing; Qiao, Zhijun; Huang, Wentao

2014-01-01

In this paper we consider the algebraic traveling wave solutions of a non-local hydrodynamic-type model. It is shown that algebraic traveling wave solutions exist if and only if an associated first order ordinary differential system has invariant algebraic curve. The dynamical behavior of the associated ordinary differential system is analyzed. Phase portraits of the associated ordinary differential system is provided under various parameter conditions. Moreover, we classify algebraic traveling wave solutions of the model. Some explicit formulas of smooth solitary wave and cuspon solutions are obtained

Kac-Moody algebra is not hidden symmetry of chiral models

International Nuclear Information System (INIS)

Devchand, C.; Schiff, J.

1997-01-01

A detailed examination of the infinite dimensional loop algebra of hidden symmetry transformations of the Principal Chiral Model reveals it to have a structure differing from a standard centreless Kac-Moody algebra. A new infinite dimensional Abelian symmetry algebra is shown to preserve a symplectic form on the space of solutions. (author). 15 refs

Algebraic approach to small-world network models

Science.gov (United States)

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.

Twisted boundary states and representation of generalized fusion algebra

International Nuclear Information System (INIS)

Ishikawa, Hiroshi; Tani, Taro

2006-01-01

The mutual consistency of boundary conditions twisted by an automorphism group G of the chiral algebra is studied for general modular invariants of rational conformal field theories. We show that a consistent set of twisted boundary states associated with any modular invariant realizes a non-negative integer matrix representation (NIM-rep) of the generalized fusion algebra, an extension of the fusion algebra by representations of the twisted chiral algebra associated with the automorphism group G. We check this result for several concrete cases. In particular, we find that two NIM-reps of the fusion algebra for su(3) k (k=3,5) are organized into a NIM-rep of the generalized fusion algebra for the charge-conjugation automorphism of su(3) k . We point out that the generalized fusion algebra is non-commutative if G is non-Abelian and provide some examples for G-bar S 3 . Finally, we give an argument that the graph fusion algebra associated with simple current extensions coincides with the generalized fusion algebra for the extended chiral algebra, and thereby explain that the graph fusion algebra contains the fusion algebra of the extended theory as a subalgebra

Engineering Abstractions in Model Checking and Testing

DEFF Research Database (Denmark)

Achenbach, Michael; Ostermann, Klaus

2009-01-01

Abstractions are used in model checking to tackle problems like state space explosion or modeling of IO. The application of these abstractions in real software development processes, however, lacks engineering support. This is one reason why model checking is not widely used in practice yet...... and testing is still state of the art in falsification. We show how user-defined abstractions can be integrated into a Java PathFinder setting with tools like AspectJ or Javassist and discuss implications of remaining weaknesses of these tools. We believe that a principled engineering approach to designing...... and implementing abstractions will improve the applicability of model checking in practice....

Implementing Model-Check for Employee and Management Satisfaction

Science.gov (United States)

Jones, Corey; LaPha, Steven

2013-01-01

This presentation will discuss methods to which ModelCheck can be implemented to not only improve model quality, but also satisfy both employees and management through different sets of quality checks. This approach allows a standard set of modeling practices to be upheld throughout a company, with minimal interaction required by the end user. The presenter will demonstrate how to create multiple ModelCheck standards, preventing users from evading the system, and how it can improve the quality of drawings and models.

Type checking by domain analysis in Ampersand

NARCIS (Netherlands)

Joosten, S.M.M.; Joosten, S.J.C.; Kahl, W.; Winter, M.; Oliveira, J.N.

2015-01-01

In the process of incorporating subtyping in relation algebra, an algorithm was found to derive the subtyping relation from the program to be checked. By using domain analysis rather than type inference, this algorithm offers an attractive visualization of the type derivation process. This

An algebraic formulation of level one Wess-Zumino-Witten models

International Nuclear Information System (INIS)

Boeckenhauer, J.

1995-07-01

The highest weight modules of the chiral algebra of orthogonal WZW models at level one possess a realization in fermionic representation spaces; the Kac-Moody and Virasoro generators are represented as unbounded limits of even CAR algebras. It is shown that the representation theory of the underlying even CAR algebras reproduces precisely the sectors of the chiral algebra. This fact allows to develop a theory of local von Neumann algebras on the punctured circle, fitting nicely in the Doplicher-Haag-Roberts framework. The relevant localized endomorphisms which generate the charged sectors are explicitly constructed by means of Bogoliubov transformations. Using CAR theory, the fusion rules in terms of sector equivalence classes are proven. (orig.)

Current algebra, statistical mechanics and quantum models

Science.gov (United States)

Vilela Mendes, R.

2017-11-01

Results obtained in the past for free boson systems at zero and nonzero temperatures are revisited to clarify the physical meaning of current algebra reducible functionals which are associated to systems with density fluctuations, leading to observable effects on phase transitions. To use current algebra as a tool for the formulation of quantum statistical mechanics amounts to the construction of unitary representations of diffeomorphism groups. Two mathematical equivalent procedures exist for this purpose. One searches for quasi-invariant measures on configuration spaces, the other for a cyclic vector in Hilbert space. Here, one argues that the second approach is closer to the physical intuition when modelling complex systems. An example of application of the current algebra methodology to the pairing phenomenon in two-dimensional fermion systems is discussed.

Partial-order reduction for GPU model checking

NARCIS (Netherlands)

Neele, T.S.; Wijs, A.J.; Bošnački, D.; van de Pol, J.C.

2016-01-01

Model checking using GPUs has seen increased popularity over the last years. Because GPUs have a limited amount of memory, only small to medium-sized systems can be verified. For on-the-fly explicitstate model checking, we improve memory efficiency by applying partialorder reduction. We propose

Partial-Order Reduction for GPU Model Checking

NARCIS (Netherlands)

Neele, T.; Wijs, A.; Bosnacki, D.; van de Pol, Jan Cornelis; Artho, C; Legay, A.; Peled, D.

2016-01-01

Model checking using GPUs has seen increased popularity over the last years. Because GPUs have a limited amount of memory, only small to medium-sized systems can be verified. For on-the-fly explicit-state model checking, we improve memory efficiency by applying partial-order reduction. We propose

The algebra of non-local charges in non-linear sigma models

International Nuclear Information System (INIS)

Abdalla, E.; Abdalla, M.C.B.; Brunelli, J.C.; Zadra, A.

1994-01-01

It is derived the complete Dirac algebra satisfied by non-local charges conserved in non-linear sigma models. Some examples of calculation are given for the O(N) symmetry group. The resulting algebra corresponds to a saturated cubic deformation (with only maximum order terms) of the Kac-Moody algebra. The results are generalized for when a Wess-Zumino term be present. In that case the algebra contains a minor order correction (sub-saturation). (author). 1 ref

Model checking exact cost for attack scenarios

DEFF Research Database (Denmark)

Aslanyan, Zaruhi; Nielson, Flemming

2017-01-01

Attack trees constitute a powerful tool for modelling security threats. Many security analyses of attack trees can be seamlessly expressed as model checking of Markov Decision Processes obtained from the attack trees, thus reaping the benefits of a coherent framework and a mature tool support....... However, current model checking does not encompass the exact cost analysis of an attack, which is standard for attack trees. Our first contribution is the logic erPCTL with cost-related operators. The extended logic allows to analyse the probability of an event satisfying given cost bounds and to compute...... the exact cost of an event. Our second contribution is the model checking algorithm for erPCTL. Finally, we apply our framework to the analysis of attack trees....

Model Checking the Remote Agent Planner

Science.gov (United States)

Khatib, Lina; Muscettola, Nicola; Havelund, Klaus; Norvig, Peter (Technical Monitor)

2001-01-01

This work tackles the problem of using Model Checking for the purpose of verifying the HSTS (Scheduling Testbed System) planning system. HSTS is the planner and scheduler of the remote agent autonomous control system deployed in Deep Space One (DS1). Model Checking allows for the verification of domain models as well as planning entries. We have chosen the real-time model checker UPPAAL for this work. We start by motivating our work in the introduction. Then we give a brief description of HSTS and UPPAAL. After that, we give a sketch for the mapping of HSTS models into UPPAAL and we present samples of plan model properties one may want to verify.

Multi-Valued Modal Fixed Point Logics for Model Checking

Science.gov (United States)

Nishizawa, Koki

In this paper, I will show how multi-valued logics are used for model checking. Model checking is an automatic technique to analyze correctness of hardware and software systems. A model checker is based on a temporal logic or a modal fixed point logic. That is to say, a system to be checked is formalized as a Kripke model, a property to be satisfied by the system is formalized as a temporal formula or a modal formula, and the model checker checks that the Kripke model satisfies the formula. Although most existing model checkers are based on 2-valued logics, recently new attempts have been made to extend the underlying logics of model checkers to multi-valued logics. I will summarize these new results.

The algebra of non-local charges in non-linear sigma models

International Nuclear Information System (INIS)

Abdalla, E.; Abdalla, M.C.B.; Brunelli, J.C.; Zadra, A.

1993-07-01

We obtain the exact Dirac algebra obeyed by the conserved non-local charges in bosonic non-linear sigma models. Part of the computation is specialized for a symmetry group O(N). As it turns out the algebra corresponds to a cubic deformation of the Kac-Moody algebra. The non-linear terms are computed in closed form. In each Dirac bracket we only find highest order terms (as explained in the paper), defining a saturated algebra. We generalize the results for the presence of a Wess-Zumino term. The algebra is very similar to the previous one, containing now a calculable correction of order one unit lower. (author). 22 refs, 5 figs

Take the Reins on Model Quality with ModelCHECK and Gatekeeper

Science.gov (United States)

Jones, Corey

2012-01-01

Model quality and consistency has been an issue for us due to the diverse experience level and imaginative modeling techniques of our users. Fortunately, setting up ModelCHECK and Gatekeeper to enforce our best practices has helped greatly, but it wasn't easy. There were many challenges associated with setting up ModelCHECK and Gatekeeper including: limited documentation, restrictions within ModelCHECK, and resistance from end users. However, we consider ours a success story. In this presentation we will describe how we overcame these obstacles and present some of the details of how we configured them to work for us.

Strategic Planning through Model Checking of ATL Formulae

NARCIS (Netherlands)

Jamroga, W.J.; Rutkowski, L.; Siekmann, J.; Tadeusiewicz, R.; Zadeh, L.A.

2004-01-01

Model checking of temporal logic has already been proposed for automatic planning. In this paper, we introduce a simple adaptation of the ATL model checking algorithm that returns a strategy to achieve given goal. We point out that the algorithm generalizes minimaxing, and that ATL models generalize

Special set linear algebra and special set fuzzy linear algebra

OpenAIRE

Kandasamy, W. B. Vasantha; Smarandache, Florentin; Ilanthenral, K.

2009-01-01

The authors in this book introduce the notion of special set linear algebra and special set fuzzy Linear algebra, which is an extension of the notion set linear algebra and set fuzzy linear algebra. These concepts are best suited in the application of multi expert models and cryptology. This book has five chapters. In chapter one the basic concepts about set linear algebra is given in order to make this book a self contained one. The notion of special set linear algebra and their fuzzy analog...

Polynomial algebra of discrete models in systems biology.

Science.gov (United States)

Veliz-Cuba, Alan; Jarrah, Abdul Salam; Laubenbacher, Reinhard

2010-07-01

An increasing number of discrete mathematical models are being published in Systems Biology, ranging from Boolean network models to logical models and Petri nets. They are used to model a variety of biochemical networks, such as metabolic networks, gene regulatory networks and signal transduction networks. There is increasing evidence that such models can capture key dynamic features of biological networks and can be used successfully for hypothesis generation. This article provides a unified framework that can aid the mathematical analysis of Boolean network models, logical models and Petri nets. They can be represented as polynomial dynamical systems, which allows the use of a variety of mathematical tools from computer algebra for their analysis. Algorithms are presented for the translation into polynomial dynamical systems. Examples are given of how polynomial algebra can be used for the model analysis. alanavc@vt.edu Supplementary data are available at Bioinformatics online.

Model Checking Temporal Logic Formulas Using Sticker Automata

Science.gov (United States)

Feng, Changwei; Wu, Huanmei

2017-01-01

As an important complex problem, the temporal logic model checking problem is still far from being fully resolved under the circumstance of DNA computing, especially Computation Tree Logic (CTL), Interval Temporal Logic (ITL), and Projection Temporal Logic (PTL), because there is still a lack of approaches for DNA model checking. To address this challenge, a model checking method is proposed for checking the basic formulas in the above three temporal logic types with DNA molecules. First, one-type single-stranded DNA molecules are employed to encode the Finite State Automaton (FSA) model of the given basic formula so that a sticker automaton is obtained. On the other hand, other single-stranded DNA molecules are employed to encode the given system model so that the input strings of the sticker automaton are obtained. Next, a series of biochemical reactions are conducted between the above two types of single-stranded DNA molecules. It can then be decided whether the system satisfies the formula or not. As a result, we have developed a DNA-based approach for checking all the basic formulas of CTL, ITL, and PTL. The simulated results demonstrate the effectiveness of the new method. PMID:29119114

Model Checking Feature Interactions

DEFF Research Database (Denmark)

Le Guilly, Thibaut; Olsen, Petur; Pedersen, Thomas

2015-01-01

This paper presents an offline approach to analyzing feature interactions in embedded systems. The approach consists of a systematic process to gather the necessary information about system components and their models. The model is first specified in terms of predicates, before being refined to t...... to timed automata. The consistency of the model is verified at different development stages, and the correct linkage between the predicates and their semantic model is checked. The approach is illustrated on a use case from home automation....

Generalized algebra-valued models of set theory

NARCIS (Netherlands)

Löwe, B.; Tarafder, S.

2015-01-01

We generalize the construction of lattice-valued models of set theory due to Takeuti, Titani, Kozawa and Ozawa to a wider class of algebras and show that this yields a model of a paraconsistent logic that validates all axioms of the negation-free fragment of Zermelo-Fraenkel set theory.

A Structural Model of Algebra Achievement: Computational Fluency and Spatial Visualisation as Mediators of the Effect of Working Memory on Algebra Achievement

Science.gov (United States)

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…

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.

Discrete-time rewards model-checked

NARCIS (Netherlands)

Larsen, K.G.; Andova, S.; Niebert, Peter; Hermanns, H.; Katoen, Joost P.

2003-01-01

This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with reward constraints. This allows to formulate complex measures – involving expected as well as accumulated rewards – in a precise and

Symbolic Dependency Graphs for PCTL Model-Checking

DEFF Research Database (Denmark)

Mariegaard, Anders; Larsen, Kim Guldstrand

2017-01-01

We consider the problem of model-checking a subset of probabilistic CTL, interpreted over (discrete-time) Markov reward models, allowing the specification of lower bounds on the probability of the set of paths satisfying a cost-bounded path formula. We first consider a reduction to fixed-point co......We consider the problem of model-checking a subset of probabilistic CTL, interpreted over (discrete-time) Markov reward models, allowing the specification of lower bounds on the probability of the set of paths satisfying a cost-bounded path formula. We first consider a reduction to fixed...

Soliton surfaces associated with sigma models: differential and algebraic aspects

International Nuclear Information System (INIS)

Goldstein, P P; Grundland, A M; Post, S

2012-01-01

In this paper, we consider both differential and algebraic properties of surfaces associated with sigma models. It is shown that surfaces defined by the generalized Weierstrass formula for immersion for solutions of the CP N-1 sigma model with finite action, defined in the Riemann sphere, are themselves solutions of the Euler–Lagrange equations for sigma models. On the other hand, we show that the Euler–Lagrange equations for surfaces immersed in the Lie algebra su(N), with conformal coordinates, that are extremals of the area functional, subject to a fixed polynomial identity, are exactly the Euler–Lagrange equations for sigma models. In addition to these differential constraints, the algebraic constraints, in the form of eigenvalues of the immersion functions, are systematically treated. The spectrum of the immersion functions, for different dimensions of the model, as well as its symmetry properties and its transformation under the action of the ladder operators are discussed. Another approach to the dynamics is given, i.e. description in terms of the unitary matrix which diagonalizes both the immersion functions and the projectors constituting the model. (paper)

Lie algebras and applications

CERN Document Server

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

2D sigma models and differential Poisson algebras

International Nuclear Information System (INIS)

Arias, Cesar; Boulanger, Nicolas; 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 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.

The bubble algebra: structure of a two-colour Temperley-Lieb Algebra

International Nuclear Information System (INIS)

Grimm, Uwe; Martin, Paul P

2003-01-01

We define new diagram algebras providing a sequence of multiparameter generalizations of the Temperley-Lieb algebra, suitable for the modelling of dilute lattice systems of two-dimensional statistical mechanics. These algebras give a rigorous foundation to the various 'multi-colour algebras' of Grimm, Pearce and others. We determine the generic representation theory of the simplest of these algebras, and locate the nongeneric cases (at roots of unity of the corresponding parameters). We show by this example how the method used (Martin's general procedure for diagram algebras) may be applied to a wide variety of such algebras occurring in statistical mechanics. We demonstrate how these algebras may be used to solve the Yang-Baxter equations

A Method for Model Checking Feature Interactions

DEFF Research Database (Denmark)

Pedersen, Thomas; Le Guilly, Thibaut; Ravn, Anders Peter

2015-01-01

This paper presents a method to check for feature interactions in a system assembled from independently developed concurrent processes as found in many reactive systems. The method combines and refines existing definitions and adds a set of activities. The activities describe how to populate the ...... the definitions with models to ensure that all interactions are captured. The method is illustrated on a home automation example with model checking as analysis tool. In particular, the modelling formalism is timed automata and the analysis uses UPPAAL to find interactions....

Model checking mobile ad hoc networks

NARCIS (Netherlands)

Ghassemi, Fatemeh; Fokkink, Wan

2016-01-01

Modeling arbitrary connectivity changes within mobile ad hoc networks (MANETs) makes application of automated formal verification challenging. We use constrained labeled transition systems as a semantic model to represent mobility. To model check MANET protocols with respect to the underlying

Four-parametric two-layer algebraic model of transition boundary layer at a planar plate

International Nuclear Information System (INIS)

Labusov, A.N.; Lapin, Yu.V.

1996-01-01

Consideration is given to four-parametric two-layer algebraic model of transition boundary layer on a plane plate, based on generalization of one-parametric algebraic Prandtl-Loitsjansky-Klauzer-3 model. The algebraic model uses Prandtl formulas for mixing path with Loitsjansky damping multiplier in the internal region and the relation for turbulent viscosity, based on universal scales of external region and named the Klauzer-3 formula. 12 refs., 10 figs

Chiral determinant formulae and subsingular vectors for the N=2 superconformal algebras

International Nuclear Information System (INIS)

Gato-Rivera, B.; Rosado, J.I.

1997-01-01

We derive conjectures for the N=2 ''chiral'' determinant formulae of the topological algebra, the antiperiodic NS algebra, and the periodic R-algebra, corresponding to incomplete Verma modules built on chiral topological primaries, chiral and antichiral NS primaries, and Ramond ground states, respectively. Our method is based on the analysis of the singular vectors in chiral Verma modules and their spectral flow symmetries, together with some computer exploration and some consistency checks. In addition, and as a consequence, we uncover the existence of subsingular vectors in these algebras, giving examples (subsingular vectors are non-highest-weight null vectors which are not descendants of any highest-weight singular vectors). (orig.)

Quantum affine algebras and deformations of the virasoro and W-algebras

International Nuclear Information System (INIS)

Frenkel, E.; Reshetikhin, N.

1996-01-01

Using the Wakimoto realization of quantum affine algebras we define new Poisson algebras, which are q-deformations of the classical W-algebras. We also define their free field realizations, i.e. homomorphisms into some Heisenberg-Poisson algebras. The formulas for these homomorphisms coincide with formulas for spectra of transfer-matrices in the corresponding quantum integrable models derived by the Bethe-Ansatz method. (orig.)

Creating Büchi automata for multi-valued model checking

NARCIS (Netherlands)

Vijzelaar, Stefan J.J.; Fokkink, Wan J.

2017-01-01

In explicit state model checking of linear temporal logic properties, a Büchi automaton encodes a temporal property. It interleaves with a Kripke model to form a state space, which is searched for counterexamples. Multi-valued model checking considers additional truth values beyond the Boolean true

Abstract algebra for physicists

International Nuclear Information System (INIS)

Zeman, J.

1975-06-01

Certain recent models of composite hadrons involve concepts and theorems from abstract algebra which are unfamiliar to most theoretical physicists. The algebraic apparatus needed for an understanding of these models is summarized here. Particular emphasis is given to algebraic structures which are not assumed to be associative. (2 figures) (auth)

Study of solving a Toda dynamic system with loop algebra

International Nuclear Information System (INIS)

Zhu Qiao; Yang Zhanying; Shi Kangjie; Wen Junqing

2006-01-01

The authors construct a Toda system with Loop algebra, and prove that the Lax equation L=[L,M] can be solved by means of solving a regular Riemann-Hilbert problem. In our system, M in Lax pair is an antisymmetrical matrix, while L=L + + M, and L + is a quasi-upper triangular matrix of loop algebra. In order to check our result, the authors exactly solve an R-H problem under a given initial condition as an example. (authors)

Lectures on algebraic statistics

CERN Document Server

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.

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

A voice-actuated wind tunnel model leak checking system

Science.gov (United States)

Larson, William E.

1989-01-01

A computer program has been developed that improves the efficiency of wind tunnel model leak checking. The program uses a voice recognition unit to relay a technician's commands to the computer. The computer, after receiving a command, can respond to the technician via a voice response unit. Information about the model pressure orifice being checked is displayed on a gas-plasma terminal. On command, the program records up to 30 seconds of pressure data. After the recording is complete, the raw data and a straight line fit of the data are plotted on the terminal. This allows the technician to make a decision on the integrity of the orifice being checked. All results of the leak check program are stored in a database file that can be listed on the line printer for record keeping purposes or displayed on the terminal to help the technician find unchecked orifices. This program allows one technician to check a model for leaks instead of the two or three previously required.

Directed Abelian algebras and their application to stochastic models.

Science.gov (United States)

Alcaraz, F C; Rittenberg, V

2008-10-01

With each directed acyclic graph (this includes some D-dimensional lattices) one can associate some Abelian algebras that we call directed Abelian algebras (DAAs). On each site of the graph one attaches a generator of the algebra. These algebras depend on several parameters and are semisimple. Using any DAA, one can define a family of Hamiltonians which give the continuous time evolution of a stochastic process. The calculation of the spectra and ground-state wave functions (stationary state probability distributions) is an easy algebraic exercise. If one considers D-dimensional lattices and chooses Hamiltonians linear in the generators, in finite-size scaling the Hamiltonian spectrum is gapless with a critical dynamic exponent z=D. One possible application of the DAA is to sandpile models. In the paper we present this application, considering one- and two-dimensional lattices. In the one-dimensional case, when the DAA conserves the number of particles, the avalanches belong to the random walker universality class (critical exponent sigma_(tau)=32 ). We study the local density of particles inside large avalanches, showing a depletion of particles at the source of the avalanche and an enrichment at its end. In two dimensions we did extensive Monte-Carlo simulations and found sigma_(tau)=1.780+/-0.005 .

Non-freely generated W-algebras and construction of N=2 super W-algebras

International Nuclear Information System (INIS)

Blumenhagen, R.

1994-07-01

Firstly, we investigate the origin of the bosonic W-algebras W(2, 3, 4, 5), W(2, 4, 6) and W(2, 4, 6) found earlier by direct construction. We present a coset construction for all three examples leading to a new type of finitely, non-freely generated quantum W-algebras, which we call unifying W-algebras. Secondly, we develop a manifest covariant formalism to construct N = 2 super W-algebras explicitly on a computer. Applying this algorithm enables us to construct the first four examples of N = 2 super W-algebras with two generators and the N = 2 super W 4 algebra involving three generators. The representation theory of the former ones shows that all examples could be divided into four classes, the largest one containing the N = 2 special type of spectral flow algebras. Besides the W-algebra of the CP(3) Kazama-Suzuki coset model, the latter example with three generators discloses a second solution which could also be explained as a unifying W-algebra for the CP(n) models. (orig.)

A note on probabilistic models over strings: the linear algebra approach.

Science.gov (United States)

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.

Solving the nuclear shell model with an algebraic method

International Nuclear Information System (INIS)

Feng, D.H.; Pan, X.W.; Guidry, M.

1997-01-01

We illustrate algebraic methods in the nuclear shell model through a concrete example, the fermion dynamical symmetry model (FDSM). We use this model to introduce important concepts such as dynamical symmetry, symmetry breaking, effective symmetry, and diagonalization within a higher-symmetry basis. (orig.)

Schedulability of Herschel revisited using statistical model checking

DEFF Research Database (Denmark)

David, Alexandre; Larsen, Kim Guldstrand; Legay, Axel

2015-01-01

-approximation technique. We can safely conclude that the system is schedulable for varying values of BCET. For the cases where deadlines are violated, we use polyhedra to try to confirm the witnesses. Our alternative method to confirm non-schedulability uses statistical model-checking (SMC) to generate counter...... and blocking times of tasks. Consequently, the method may falsely declare deadline violations that will never occur during execution. This paper is a continuation of previous work of the authors in applying extended timed automata model checking (using the tool UPPAAL) to obtain more exact schedulability...... analysis, here in the presence of non-deterministic computation times of tasks given by intervals [BCET,WCET]. Computation intervals with preemptive schedulers make the schedulability analysis of the resulting task model undecidable. Our contribution is to propose a combination of model checking techniques...

A set for relational reasoning: Facilitation of algebraic modeling by a fraction task.

Science.gov (United States)

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. Copyright © 2016 Elsevier Inc. All rights reserved.

Model checking biological systems described using ambient calculus

DEFF Research Database (Denmark)

Mardare, Radu Iulian; Priami, Corrado; Qualia, Paola

2005-01-01

Model checking biological systems described using ambient calculus. In Proc. of the second International Workshop on Computational Methods in Systems Biology (CMSB04), Lecture Notes in Bioinformatics 3082:85-103, Springer, 2005.......Model checking biological systems described using ambient calculus. In Proc. of the second International Workshop on Computational Methods in Systems Biology (CMSB04), Lecture Notes in Bioinformatics 3082:85-103, Springer, 2005....

The Schwinger Dyson equations and the algebra of constraints of random tensor models at all orders

International Nuclear Information System (INIS)

Gurau, Razvan

2012-01-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.

Inverse Modelling Problems in Linear Algebra Undergraduate Courses

Science.gov (United States)

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…

Dynamic State Space Partitioning for External Memory Model Checking

DEFF Research Database (Denmark)

Evangelista, Sami; Kristensen, Lars Michael

2009-01-01

We describe a dynamic partitioning scheme usable by model checking techniques that divide the state space into partitions, such as most external memory and distributed model checking algorithms. The goal of the scheme is to reduce the number of transitions that link states belonging to different...

Vertex algebras and algebraic curves

CERN Document Server

Frenkel, Edward

2004-01-01

Vertex algebras are algebraic objects that encapsulate the concept of operator product expansion from two-dimensional conformal field theory. Vertex algebras are fast becoming ubiquitous in many areas of modern mathematics, with applications to representation theory, algebraic geometry, the theory of finite groups, modular functions, topology, integrable systems, and combinatorics. This book is an introduction to the theory of vertex algebras with a particular emphasis on the relationship with the geometry of algebraic curves. The notion of a vertex algebra is introduced in a coordinate-independent way, so that vertex operators become well defined on arbitrary smooth algebraic curves, possibly equipped with additional data, such as a vector bundle. Vertex algebras then appear as the algebraic objects encoding the geometric structure of various moduli spaces associated with algebraic curves. Therefore they may be used to give a geometric interpretation of various questions of representation theory. The book co...

Algebraic partial Boolean algebras

International Nuclear Information System (INIS)

Smith, Derek

2003-01-01

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 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 8

A polynomial time algorithm for checking regularity of totally normed process algebra

NARCIS (Netherlands)

Yang, F.; Huang, H.

2015-01-01

A polynomial algorithm for the regularity problem of weak and branching bisimilarity on totally normed process algebra (PA) processes is given. Its time complexity is O(n 3 +mn) O(n3+mn), where n is the number of transition rules and m is the maximal length of the rules. The algorithm works for

Parity-Check Network Coding for Multiple Access Relay Channel in Wireless Sensor Cooperative Communications

Directory of Open Access Journals (Sweden)

Du Bing

2010-01-01

Full Text Available A recently developed theory suggests that network coding is a generalization of source coding and channel coding and thus yields a significant performance improvement in terms of throughput and spatial diversity. This paper proposes a cooperative design of a parity-check network coding scheme in the context of a two-source multiple access relay channel (MARC model, a common compact model in hierarchical wireless sensor networks (WSNs. The scheme uses Low-Density Parity-Check (LDPC as the surrogate to build up a layered structure which encapsulates the multiple constituent LDPC codes in the source and relay nodes. Specifically, the relay node decodes the messages from two sources, which are used to generate extra parity-check bits by a random network coding procedure to fill up the rate gap between Source-Relay and Source-Destination transmissions. Then, we derived the key algebraic relationships among multidimensional LDPC constituent codes as one of the constraints for code profile optimization. These extra check bits are sent to the destination to realize a cooperative diversity as well as to approach MARC decode-and-forward (DF capacity.

From Transition Systems to Variability Models and from Lifted Model Checking Back to UPPAAL

DEFF Research Database (Denmark)

Dimovski, Aleksandar; Wasowski, Andrzej

2017-01-01

efficient lifted (family-based) model checking for real-time variability models. This reduces the cost of maintaining specialized family-based real-time model checkers. Real-time variability models can be model checked using the standard UPPAAL. We have implemented abstractions as syntactic source...

Prediction of strongly-heated gas flows in a vertical tube using explicit algebraic stress/heat-flux models

International Nuclear Information System (INIS)

Baek, Seong Gu; Park, Seung O.

2003-01-01

This paper provides the assessment of prediction performance of explicit algebraic stress and heat-flux models under conditions of mixed convective gas flows in a strongly-heated vertical tube. Two explicit algebraic stress models and four algebraic heat-flux models are selected for assessment. Eight combinations of explicit algebraic stress and heat-flux models are used in predicting the flows experimentally studied by Shehata and McEligot (IJHMT 41(1998) p.4333) in which property variation was significant. Among the various model combinations, the Wallin and Johansson (JFM 403(2000) p. 89) explicit algebraic stress model-Abe, Kondo, and Nagano (IJHFF 17(1996) p. 228) algebraic heat-flux model combination is found to perform best. We also found that the dimensionless wall distance y + should be calculated based on the local property rather than the property at the wall for property-variation flows. When the buoyancy or the property variation effects are so strong that the flow may relaminarize, the choice of the basic platform two-equation model is a most important factor in improving the predictions

Computing with impure numbers - Automatic consistency checking and units conversion using computer algebra

Science.gov (United States)

Stoutemyer, D. R.

1977-01-01

The computer algebra language MACSYMA enables the programmer to include symbolic physical units in computer calculations, and features automatic detection of dimensionally-inhomogeneous formulas and conversion of inconsistent units in a dimensionally homogeneous formula. Some examples illustrate these features.

Performability assessment by model checking of Markov reward models

NARCIS (Netherlands)

Baier, Christel; Cloth, L.; Haverkort, Boudewijn R.H.M.; Hermanns, H.; Katoen, Joost P.

2010-01-01

This paper describes efficient procedures for model checking Markov reward models, that allow us to evaluate, among others, the performability of computer-communication systems. We present the logic CSRL (Continuous Stochastic Reward Logic) to specify performability measures. It provides flexibility

N=2 current algebra and coset models

International Nuclear Information System (INIS)

Hull, C.M.; Spence, B.

1990-01-01

The N=2 supersymmetric extension of the Kac-Moody algebra and the corresponding Sugawara construction of the N=2 superconformal algebra are discussed both in components and in N=1 superspace. A formulation of the Kac-Moody algebra and Sugawara construction is given in N=2 superspace in terms of supercurrents satisfying a non-linear chiral constraint. The operator product of two supercurrents includes terms that are non-linear in the supercurrents. The N=2 generalization of the GKO coset construction is then given and the conditions found by Kazama and Suzuki are seen to arise from the non-linearity of the algebra. (orig.)

Global identifiability of linear compartmental models--a computer algebra algorithm.

Science.gov (United States)

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.

Geometric model of topological insulators from the Maxwell algebra

Science.gov (United States)

Palumbo, Giandomenico

2017-11-01

We propose a novel geometric model of time-reversal-invariant topological insulators in three dimensions in presence of an external electromagnetic field. Their gapped boundary supports relativistic quantum Hall states and is described by a Chern-Simons theory, where the gauge connection takes values in the Maxwell algebra. This represents a non-central extension of the Poincaré 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.

Linear Algebra and Smarandache Linear Algebra

OpenAIRE

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 vector spaces over finite p...

Development of a butterfly check valve model under natural circulation conditions

International Nuclear Information System (INIS)

Rao, Yuxian; Yu, Lei; Fu, Shengwei; Zhang, Fan

2015-01-01

Highlights: • Bases on Lim’s swing check valve model, a butterfly check valve model was developed. • The method to quantify the friction torque T F in Li’s model was corrected. • The developed model was implemented into the RELAP5 code and verified. - Abstract: A butterfly check valve is widely used to prevent a reverse flow in the pipe lines of a marine nuclear power plant. Under some conditions, the natural circulation conditions in particular, the fluid velocity through the butterfly check valve might become too low to hold the valve disk fully open, thereby the flow resistance of the butterfly check valve varies with the location of the valve disk and as a result the fluid flow is significantly affected by the dynamic motion of the valve disk. Simulation of a pipe line that includes some butterfly check valves, especially under natural circulation conditions, is thus complicated. This paper focuses on the development of a butterfly check valve model to enhance the capability of the thermal–hydraulic system code and the developed model is implemented into the RELAP5 code. Both steady-state calculations and transient calculations were carried out for the primary loop system of a marine nuclear power plant and the calculation results are compared with the experimental data for verification purpose. The simulation results show an agreement with the experimental data

Matrix algebra for linear models

CERN Document Server

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

Introduction to vertex algebras, Borcherds algebras and the Monster Lie algebras

International Nuclear Information System (INIS)

Gebert, R.W.

1993-09-01

The theory of vertex algebras constitutes a mathematically rigorous axiomatic formulation of the algebraic origins of conformal field theory. In this context Borcherds algebras arise as certain ''physical'' subspaces of vertex algebras. The aim of this review is to give a pedagogical introduction into this rapidly-developing area of mathematics. Based on the machinery of formal calculus we present the axiomatic definition of vertex algebras. We discuss the connection with conformal field theory by deriving important implications of these axioms. In particular, many explicit calculations are presented to stress the eminent role of the Jacobi identity axiom for vertex algebras. As a class of concrete examples the vertex algebras associated with even lattices are constructed and it is shown in detail how affine Lie algebras and the fake Monster Lie algebra naturally appear. This leads us to the abstract definition of Borcherds algebras as generalized Kac-Moody algebras and their basic properties. Finally, the results about the simplest generic Borcherds algebras are analysed from the point of view of symmetry in quantum theory and the construction of the Monster Lie algebra is sketched. (orig.)

ADAM: analysis of discrete models of biological systems using computer algebra.

Science.gov (United States)

Hinkelmann, Franziska; Brandon, Madison; Guang, Bonny; McNeill, Rustin; Blekherman, Grigoriy; Veliz-Cuba, Alan; Laubenbacher, Reinhard

2011-07-20

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. 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. 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 analysis methods based on mathematical algorithms as a web

Model selection for contingency tables with algebraic statistics

NARCIS (Netherlands)

Krampe, A.; Kuhnt, S.; Gibilisco, P.; Riccimagno, E.; Rogantin, M.P.; Wynn, H.P.

2009-01-01

Goodness-of-fit tests based on chi-square approximations are commonly used in the analysis of contingency tables. Results from algebraic statistics combined with MCMC methods provide alternatives to the chi-square approximation. However, within a model selection procedure usually a large number of

CheckMATE 2: From the model to the limit

Science.gov (United States)

Dercks, Daniel; Desai, Nishita; Kim, Jong Soo; Rolbiecki, Krzysztof; Tattersall, Jamie; Weber, Torsten

2017-12-01

We present the latest developments to the CheckMATE program that allows models of new physics to be easily tested against the recent LHC data. To achieve this goal, the core of CheckMATE now contains over 60 LHC analyses of which 12 are from the 13 TeV run. The main new feature is that CheckMATE 2 now integrates the Monte Carlo event generation via MadGraph5_aMC@NLO and Pythia 8. This allows users to go directly from a SLHA file or UFO model to the result of whether a model is allowed or not. In addition, the integration of the event generation leads to a significant increase in the speed of the program. Many other improvements have also been made, including the possibility to now combine signal regions to give a total likelihood for a model.

Optimisation of BPMN Business Models via Model Checking

DEFF Research Database (Denmark)

Herbert, Luke Thomas; Sharp, Robin

2013-01-01

We present a framework for the optimisation of business processes modelled in the business process modelling language BPMN, which builds upon earlier work, where we developed a model checking based method for the analysis of BPMN models. We define a structure for expressing optimisation goals...... for synthesized BPMN components, based on probabilistic computation tree logic and real-valued reward structures of the BPMN model, allowing for the specification of complex quantitative goals. We here present a simple algorithm, inspired by concepts from evolutionary algorithms, which iteratively generates...

Phase Transitions in Algebraic Cluster Models

International Nuclear Information System (INIS)

Yepez-Martinez, H.; Cseh, J.; Hess, P.O.

2006-01-01

Complete text of publication follows. Phase transitions in nuclear systems are of utmost interest. An interesting class of phase transitions can be seen in algebraic models of nuclear structure. They are called shapephase transitions due to the following reason. These models have analytically solvable limiting cases, called dynamical symmetries, which are characterized by a chain of nested subgroups. They correspond to well-defined geometrical shape and behaviour, e.g. to rotation of an ellipsoid, or spherical vibration. The general case of the model, which includes interactions described by more than one groupchain, breaks the symmetry, and changing the relative strengths of these interactions, one can go from one shape to the other. In doing so a phase-transition can be seen. A phase transition is defined as a discontinuity of some quantity as a function of the control parameter, which gives the relative strength of the interactions of different symmetries. Real phase transitions can take place only in infinite systems, like in the classical limits of these algebraic models, when the particle number N is very large: N → ∞. For finite N the discontinuities are smoothed out, nevertheless, some indications of the phase-transitions can still be there. A controlled way of breaking the dynamical symmetries may reveal another very interesting phenomenon, i.e. the appearance of a quasidynamical (or effective) symmetry. This rather general symmetry-concept of quantum mechanics corresponds to a situation, in which the symmetry-breaking interactions are so strong that the energy-eigenfunctions are not symmetric, i.e. are not basis states of an irreducible representation of the symmetry group, rather they are linear combinations of these basis states. However, they are very special linear combinations in the sense that their coefficients are (approximately) identical for states with different spin values. When this is the case, then the underlying intrinsic state is the

Statistical Model Checking for Biological Systems

DEFF Research Database (Denmark)

David, Alexandre; Larsen, Kim Guldstrand; Legay, Axel

2014-01-01

Statistical Model Checking (SMC) is a highly scalable simulation-based verification approach for testing and estimating the probability that a stochastic system satisfies a given linear temporal property. The technique has been applied to (discrete and continuous time) Markov chains, stochastic...

Lie algebra in quantum physics by means of computer algebra

OpenAIRE

Kikuchi, Ichio; Kikuchi, Akihito

2017-01-01

This article explains how to apply the computer algebra package GAP (www.gap-system.org) in the computation of the problems in quantum physics, in which the application of Lie algebra is necessary. The article contains several exemplary computations which readers would follow in the desktop PC: such as, the brief review of elementary ideas of Lie algebra, the angular momentum in quantum mechanics, the quark eight-fold way model, and the usage of Weyl character formula (in order to construct w...

Optical linear algebra processors - Noise and error-source modeling

Science.gov (United States)

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.

Science.gov (United States)

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.

Quantum W-algebras and elliptic algebras

International Nuclear Information System (INIS)

Feigin, B.; Kyoto Univ.; Frenkel, E.

1996-01-01

We define a quantum W-algebra associated to sl N as an associative algebra depending on two parameters. For special values of the parameters, this algebra becomes the ordinary W-algebra of sl N , or the q-deformed classical W-algebra of sl N . We construct free field realizations of the quantum W-algebras and the screening currents. We also point out some interesting elliptic structures arising in these algebras. In particular, we show that the screening currents satisfy elliptic analogues of the Drinfeld relations in U q (n). (orig.)

Recoupling Lie algebra and universal ω-algebra

International Nuclear Information System (INIS)

Joyce, William P.

2004-01-01

We formulate the algebraic version of recoupling theory suitable for commutation quantization over any gradation. This gives a generalization of graded Lie algebra. Underlying this is the new notion of an ω-algebra defined in this paper. ω-algebra is a generalization of algebra that goes beyond nonassociativity. We construct the universal enveloping ω-algebra of recoupling Lie algebras and prove a generalized Poincare-Birkhoff-Witt theorem. As an example we consider the algebras over an arbitrary recoupling of Z n graded Heisenberg Lie algebra. Finally we uncover the usual coalgebra structure of a universal envelope and substantiate its Hopf structure

Slicing AADL specifications for model checking

NARCIS (Netherlands)

Odenbrett, M.R.; Nguyen, V.Y.; Noll, T.

2010-01-01

To combat the state-space explosion problem in model checking larger systems, abstraction techniques can be employed. Here, methods that operate on the system specification before constructing its state space are preferable to those that try to minimize the resulting transition system as they

Efficient family-based model checking via variability abstractions

DEFF Research Database (Denmark)

Dimovski, Aleksandar; Al-Sibahi, Ahmad Salim; Brabrand, Claus

2016-01-01

with the abstract model checking of the concrete high-level variational model. This allows the use of Spin with all its accumulated optimizations for efficient verification of variational models without any knowledge about variability. We have implemented the transformations in a prototype tool, and we illustrate......Many software systems are variational: they can be configured to meet diverse sets of requirements. They can produce a (potentially huge) number of related systems, known as products or variants, by systematically reusing common parts. For variational models (variational systems or families...... of related systems), specialized family-based model checking algorithms allow efficient verification of multiple variants, simultaneously, in a single run. These algorithms, implemented in a tool Snip, scale much better than ``the brute force'' approach, where all individual systems are verified using...

Towards Model Checking a Spi-Calculus Dialect

NARCIS (Netherlands)

Gnesi, S.; Latella, D.; Lenzini, Gabriele

We present a model checking framework for a spi-calculus dialect which uses a linear time temporal logic for expressing security properties. We have provided our spi-calculus dialect, called SPID, with a semantics based on labeled transition systems (LTS), where the intruder is modeled in the

Comments on two-loop Kac-Moody algebras

Energy Technology Data Exchange (ETDEWEB)

Ferreira, L A; Gomes, J F; Zimerman, A H [Instituto de Fisica Teorica (IFT), Sao Paulo, SP (Brazil); Schwimmer, A [Istituto Nazionale di Fisica Nucleare, Trieste (Italy)

1991-10-01

It is shown that the two-loop Kac-Moody algebra is equivalent to a two variable loop algebra and a decouple {beta}-{gamma} system. Similarly WZNW and CSW models having as algebraic structure the Kac-Moody algebra are equivalent to an infinity to versions of the corresponding ordinary models and decoupled Abelian fields. (author). 15 refs.

Vertex algebras and mirror symmetry

International Nuclear Information System (INIS)

Borisov, L.A.

2001-01-01

Mirror Symmetry for Calabi-Yau hypersurfaces in toric varieties is by now well established. However, previous approaches to it did not uncover the underlying reason for mirror varieties to be mirror. We are able to calculate explicitly vertex algebras that correspond to holomorphic parts of A and B models of Calabi-Yau hypersurfaces and complete intersections in toric varieties. We establish the relation between these vertex algebras for mirror Calabi-Yau manifolds. This should eventually allow us to rewrite the whole story of toric mirror symmetry in the language of sheaves of vertex algebras. Our approach is purely algebraic and involves simple techniques from toric geometry and homological algebra, as well as some basic results of the theory of vertex algebras. Ideas of this paper may also be useful in other problems related to maps from curves to algebraic varieties.This paper could also be of interest to physicists, because it contains explicit description of holomorphic parts of A and B models of Calabi-Yau hypersurfaces and complete intersections in terms of free bosons and fermions. (orig.)

PVeStA: A Parallel Statistical Model Checking and Quantitative Analysis Tool

KAUST Repository

AlTurki, Musab

2011-01-01

Statistical model checking is an attractive formal analysis method for probabilistic systems such as, for example, cyber-physical systems which are often probabilistic in nature. This paper is about drastically increasing the scalability of statistical model checking, and making such scalability of analysis available to tools like Maude, where probabilistic systems can be specified at a high level as probabilistic rewrite theories. It presents PVeStA, an extension and parallelization of the VeStA statistical model checking tool [10]. PVeStA supports statistical model checking of probabilistic real-time systems specified as either: (i) discrete or continuous Markov Chains; or (ii) probabilistic rewrite theories in Maude. Furthermore, the properties that it can model check can be expressed in either: (i) PCTL/CSL, or (ii) the QuaTEx quantitative temporal logic. As our experiments show, the performance gains obtained from parallelization can be very high. © 2011 Springer-Verlag.

Differential Hopf algebra structures on the universal enveloping algebra ofa Lie algebra

NARCIS (Netherlands)

N.W. van den Hijligenberg; R. Martini

1995-01-01

textabstractWe discuss a method to construct a De Rham complex (differential algebra) of Poincar'e-Birkhoff-Witt-type on the universal enveloping algebra of a Lie algebra $g$. We determine the cases in which this gives rise to a differential Hopf algebra that naturally extends the Hopf algebra

Automata-Based CSL Model Checking

DEFF Research Database (Denmark)

Zhang, Lijun; Jansen, David N.; Nielson, Flemming

2011-01-01

For continuous-time Markov chains, the model-checking problem with respect to continuous-time stochastic logic (CSL) has been introduced and shown to be decidable by Aziz, Sanwal, Singhal and Brayton in 1996. The presented decision procedure, however, has exponential complexity. In this paper, we...... probability can then be approximated in polynomial time (using uniformization). This makes the present work the centerpiece of a broadly applicable full CSL model checker. Recently, the decision algorithm by Aziz et al. was shown to be incorrect in general. In fact, it works only for stratified CTMCs...

Entanglement in a model for Hawking radiation: An application of quadratic algebras

International Nuclear Information System (INIS)

Bambah, Bindu A.; Mukku, C.; Shreecharan, T.; Siva Prasad, K.

2013-01-01

Quadratic polynomially deformed su(1,1) and su(2) algebras are utilized 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. Finally, we study the phenomenon of superradiance in our model in analogy with atomic Dicke superradiance. - Highlights: ► We examine a toy model for Hawking radiation with quantized black hole modes. ► We use quadratic polynomially deformed su(1,1) algebras to study its entanglement properties. ► We study the “Dicke Superradiance” in black hole radiation using quadratically deformed su(2) algebras. ► We study the modification of the thermal character of Hawking radiation due to quantized black hole modes.

The Yoneda algebra of a K2 algebra need not be another K2 algebra

OpenAIRE

Cassidy, T.; Phan, C.; Shelton, B.

2010-01-01

The Yoneda algebra of a Koszul algebra or a D-Koszul algebra is Koszul. K2 algebras are a natural generalization of Koszul algebras, and one would hope that the Yoneda algebra of a K2 algebra would be another K2 algebra. We show that this is not necessarily the case by constructing a monomial K2 algebra for which the corresponding Yoneda algebra is not K2.

Basic notions of algebra

CERN Document Server

Shafarevich, Igor Rostislavovich

2005-01-01

This book is wholeheartedly recommended to every student or user of mathematics. Although the author modestly describes his book as 'merely an attempt to talk about' algebra, he succeeds in writing an extremely original and highly informative essay on algebra and its place in modern mathematics and science. From the fields, commutative rings and groups studied in every university math course, through Lie groups and algebras to cohomology and category theory, the author shows how the origins of each algebraic concept can be related to attempts to model phenomena in physics or in other branches

The $W_{3}$ algebra modules, semi-infinite cohomology and BV algebras

CERN Document Server

Bouwknegt, Peter; Pilch, Krzysztof

1996-01-01

The noncritical D=4 W_3 string is a model of W_3 gravity coupled to two free scalar fields. In this paper we discuss its BRST quantization in direct analogy with that of the D=2 (Virasoro) string. In particular, we calculate the physical spectrum as a problem in BRST cohomology. The corresponding operator cohomology forms a BV-algebra. We model this BV-algebra on that of the polyderivations of a commutative ring on six variables with a quadratic constraint, or equivalently, on the BV-algebra of (polynomial) polyvector fields on the base affine space of SL(3,C). In this paper we attempt to present a complete summary of the progress made in these studies. [...

WCET Analysis of ARM Processors using Real-Time Model Checking

DEFF Research Database (Denmark)

Toft, Martin; Olesen, Mads Christian; Dalsgaard, Andreas

2009-01-01

This paper presents a flexible method that utilises real-time model checking to determine safe and sharp WCETs for processes running on hardware platforms featuring pipelining and caching.......This paper presents a flexible method that utilises real-time model checking to determine safe and sharp WCETs for processes running on hardware platforms featuring pipelining and caching....

Process Algebra and Markov Chains

NARCIS (Netherlands)

Brinksma, Hendrik; Hermanns, H.; Brinksma, Hendrik; Hermanns, H.; Katoen, Joost P.

This paper surveys and relates the basic concepts of process algebra and the modelling of continuous time Markov chains. It provides basic introductions to both fields, where we also study the Markov chains from an algebraic perspective, viz. that of Markov chain algebra. We then proceed to study

Process algebra and Markov chains

NARCIS (Netherlands)

Brinksma, E.; Hermanns, H.; Brinksma, E.; Hermanns, H.; Katoen, J.P.

2001-01-01

This paper surveys and relates the basic concepts of process algebra and the modelling of continuous time Markov chains. It provides basic introductions to both fields, where we also study the Markov chains from an algebraic perspective, viz. that of Markov chain algebra. We then proceed to study

The Sum-Product Algorithm for Degree-2 Check Nodes and Trapping Sets

OpenAIRE

Brevik, John O.; O'Sullivan, Michael E.

2014-01-01

The sum-product algorithm for decoding of binary codes is analyzed for bipartite graphs in which the check nodes all have degree $2$. The algorithm simplifies dramatically and may be expressed using linear algebra. Exact results about the convergence of the algorithm are derived and applied to trapping sets.

su(1,2) Algebraic Structure of XYZ Antiferromagnetic Model in Linear Spin-Wave Frame

International Nuclear Information System (INIS)

Jin Shuo; Xie Binghao; Yu Zhaoxian; Hou Jingmin

2008-01-01

The XYZ antiferromagnetic model in linear spin-wave frame is shown explicitly to have an su(1,2) algebraic 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

The Hamiltonian of the quantum trigonometric Calogero-Sutherland model in the exceptional algebra E8

International Nuclear Information System (INIS)

Fernandez Nunez, J; Garcia Fuertes, W; Perelomov, A M

2009-01-01

We express the Hamiltonian of the quantum trigonometric Calogero-Sutherland model for the Lie algebra E 8 and coupling constant κ by using the fundamental irreducible characters of the algebra as dynamical independent variables

Cylindric-like algebras and algebraic logic

CERN Document Server

Ferenczi, Miklós; Németi, István

2013-01-01

Algebraic logic is a subject in the interface between logic, algebra and geometry, it has strong connections with category theory and combinatorics. Tarski’s quest for finding structure in logic leads to cylindric-like algebras as studied in this book, they are among the main players in Tarskian algebraic logic. Cylindric algebra theory can be viewed in many ways:  as an algebraic form of definability theory, as a study of higher-dimensional relations, as an enrichment of Boolean Algebra theory, or, as logic in geometric form (“cylindric” in the name refers to geometric aspects). Cylindric-like algebras have a wide range of applications, in, e.g., natural language theory, data-base theory, stochastics, and even in relativity theory. The present volume, consisting of 18 survey papers, intends to give an overview of the main achievements and new research directions in the past 30 years, since the publication of the Henkin-Monk-Tarski monographs. It is dedicated to the memory of Leon Henkin.

Predicting NonInertial Effects with Algebraic Stress Models which Account for Dissipation Rate Anisotropies

Science.gov (United States)

Jongen, T.; Machiels, L.; Gatski, T. B.

1997-01-01

Three types of turbulence models which account for rotational effects in noninertial frames of reference are evaluated for the case of incompressible, fully developed rotating turbulent channel flow. The different types of models are a Coriolis-modified eddy-viscosity model, a realizable algebraic stress model, and an algebraic stress model which accounts for dissipation rate anisotropies. A direct numerical simulation of a rotating channel flow is used for the turbulent model validation. This simulation differs from previous studies in that significantly higher rotation numbers are investigated. Flows at these higher rotation numbers are characterized by a relaminarization on the cyclonic or suction side of the channel, and a linear velocity profile on the anticyclonic or pressure side of the channel. The predictive performance of the three types of models are examined in detail, and formulation deficiencies are identified which cause poor predictive performance for some of the models. Criteria are identified which allow for accurate prediction of such flows by algebraic stress models and their corresponding Reynolds stress formulations.

Model Checking Timed Automata with Priorities using DBM Subtraction

DEFF Research Database (Denmark)

David, Alexandre; Larsen, Kim Guldstrand; Pettersson, Paul

2006-01-01

In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic model-checking of timed automata with priorities. The subtraction is one of the few operations on DBMs that result...... in a non-convex set needing sets of DBMs for representation. Our subtraction algorithms are efficient in the sense that the number of generated DBMs is significantly reduced compared to a naive algorithm. The overhead in time is compensated by the gain from reducing the number of resulting DBMs since...... this number affects the performance of symbolic model-checking. The uses of the DBM subtraction operation extend beyond timed automata with priorities. It is also useful for allowing guards on transitions with urgent actions, deadlock checking, and timed games....

Differential Hopf algebra structures on the universal enveloping algebra of a Lie algebra

NARCIS (Netherlands)

van den Hijligenberg, N.W.; van den Hijligenberg, N.W.; Martini, Ruud

1995-01-01

We discuss a method to construct a De Rham complex (differential algebra) of Poincar'e-Birkhoff-Witt-type on the universal enveloping algebra of a Lie algebra $g$. We determine the cases in which this gives rise to a differential Hopf algebra that naturally extends the Hopf algebra structure of

Integrating model checking with HiP-HOPS in model-based safety analysis

International Nuclear Information System (INIS)

Sharvia, Septavera; Papadopoulos, Yiannis

2015-01-01

The ability to perform an effective and robust safety analysis on the design of modern safety–critical systems is crucial. Model-based safety analysis (MBSA) has been introduced in recent years to support the assessment of complex system design by focusing on the system model as the central artefact, and by automating the synthesis and analysis of failure-extended models. Model checking and failure logic synthesis and analysis (FLSA) are two prominent MBSA paradigms. Extensive research has placed emphasis on the development of these techniques, but discussion on their integration remains limited. In this paper, we propose a technique in which model checking and Hierarchically Performed Hazard Origin and Propagation Studies (HiP-HOPS) – an advanced FLSA technique – can be applied synergistically with benefit for the MBSA process. The application of the technique is illustrated through an example of a brake-by-wire system. - Highlights: • We propose technique to integrate HiP-HOPS and model checking. • State machines can be systematically constructed from HiP-HOPS. • The strengths of different MBSA techniques are combined. • Demonstrated through modeling and analysis of brake-by-wire system. • Root cause analysis is automated and system dynamic behaviors analyzed and verified

Off-critical W∞ and Virasoro algebras as dynamical symmetries of the integrable models

International Nuclear Information System (INIS)

Sotkov, G.; Stanishkov, M.

1993-01-01

An infinite set of new non commuting conserved charges in a specific class of perturbed CFT's is founded and a criterion for their existence is presented. They appear to be higher momenta of the already known commuting conserved currents. The algebra they close consists of two non commuting W ∞ algebras. Various Virasoro subalgebras of the full symmetry algebra are founded. It is shown on the examples of the perturbed Ising and Potts models that one of them plays an essential role in the computation of the correlation functions of the fields of the theory. (author)

Algebraic Bethe ansatz for 19-vertex models with reflection conditions

International Nuclear Information System (INIS)

Utiel, Wagner

2003-01-01

In this work we solve the 19-vertex models with the use of algebraic Bethe ansatz for diagonal reflection matrices (Sklyanin K-matrices). The eigenvectors, eigenvalues and Bethe equations are given in a general form. Quantum spin chains of spin one derived from the 19-vertex models were also discussed

Geometric Model of Topological Insulators from the Maxwell Algebra

Science.gov (United States)

Palumbo, Giandomenico

I propose a novel geometric model of time-reversal-invariant topological insulators in three dimensions in presence of an external electromagnetic field. Their gapped boundary supports relativistic quantum Hall states and is described by a Chern-Simons theory, where the gauge connection takes values in the Maxwell algebra. This represents a non-central extension of the Poincare' algebra and takes into account both the Lorentz and magnetic-translation symmetries of the surface states. In this way, I derive a relativistic version of the Wen-Zee term and I 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. This work is part of the DITP consortium, a program of the Netherlands Organisation for Scientific Research (NWO) that is funded by the Dutch Ministry of Education, Culture and Science (OCW).

The N=2 super-W3 algebra

International Nuclear Information System (INIS)

Romans, L.J.

1992-01-01

We present the complete structure of the N=2 super-W 3 algebra, a non-linear extended conformal algebra containing the usual N=2 superconformal algebra (with generators of spins 1, 3/2, 3/2 and 2) and a higher-spin multiplet of generators with spins 2, 5/2, 5/2 and 3. We investigate various sub-algebras and related algebras, and find necessary conditions upon possible unitary representations of the algebra. In particular, the central charge c is restricted to two discrete series, one ascending and one descending to a common accumulation point c=6. The results suggest that the algebra is realised in certain (compact or non-compact) Kazama-Suzuki coset models, including a c=9 model proposed by Bars based on SU(2, 1)/U(2). (orig.)

Using Max-Plus Algebra for the Evaluation of Stochastic Process Algebra Prefixes

NARCIS (Netherlands)

Cloth, L.; de Alfaro, L.; Gilmore, S.; Bohnenkamp, H.C.; Haverkort, Boudewijn R.H.M.

2001-01-01

In this paper, the concept of complete finite prefixes for process algebra expressions is extended to stochastic models. Events are supposed to happen after a delay that is determined by random variables assigned to the preceding conditions. Max-plus algebra expressions are shown to provide an

The algebras of higher order currents of the fermionic Gross-Neveu model

International Nuclear Information System (INIS)

Saltini, Luis Eduardo

1996-01-01

Results are reported from our studies on the following 2-dimensional field theories: the supersymmetric non-linear sigma model and the fermionic Gross-Neveu model. About the supersymmetric non-linear sigma model, an attempt is made to solve the the algebraic problem of finding the non-local conserved charges and the corresponding algebra, extending the methods described in a previous article for the case of the purely bosonic non linear sigma model. For the fermionic Gross-Neveu model, we intend to construct the conserved currents and the respective charges, related to the abelian U(1) symmetry and non-abelian SU(n) symmetry, at the conformal point and calculate the correlation functions between them. From these results at the conformal point, we want to study the effects of perturbation to get a massive but integral theory

Introduction to relation algebras relation algebras

CERN Document Server

Givant, Steven

2017-01-01

The first volume of a pair that charts relation algebras from novice to expert level, this text offers a comprehensive grounding for readers new to the topic. Upon completing this introduction, mathematics students may delve into areas of active research by progressing to the second volume, Advanced Topics in Relation Algebras; computer scientists, philosophers, and beyond will be equipped to apply these tools in their own field. The careful presentation establishes first the arithmetic of relation algebras, providing ample motivation and examples, then proceeds primarily on the basis of algebraic constructions: subalgebras, homomorphisms, quotient algebras, and direct products. Each chapter ends with a historical section and a substantial number of exercises. The only formal prerequisite is a background in abstract algebra and some mathematical maturity, though the reader will also benefit from familiarity with Boolean algebra and naïve set theory. The measured pace and outstanding clarity are particularly ...

Algebraic Structure of tt * Equations for Calabi-Yau Sigma Models

Science.gov (United States)

Alim, Murad

2017-08-01

The tt * equations define a flat connection on the moduli spaces of {2d, \\mathcal{N}=2} quantum field theories. For conformal theories with c = 3 d, which can be realized as nonlinear sigma models into Calabi-Yau d-folds, this flat connection is equivalent to special geometry for threefolds and to its analogs in other dimensions. We show that the non-holomorphic content of the tt * equations, restricted to the conformal directions, in the cases d = 1, 2, 3 is captured in terms of finitely many generators of special functions, which close under derivatives. The generators are understood as coordinates on a larger moduli space. This space parameterizes a freedom in choosing representatives of the chiral ring while preserving a constant topological metric. Geometrically, the freedom corresponds to a choice of forms on the target space respecting the Hodge filtration and having a constant pairing. Linear combinations of vector fields on that space are identified with the generators of a Lie algebra. This Lie algebra replaces the non-holomorphic derivatives of tt * and provides these with a finer and algebraic meaning. For sigma models into lattice polarized K3 manifolds, the differential ring of special functions on the moduli space is constructed, extending known structures for d = 1 and 3. The generators of the differential rings of special functions are given by quasi-modular forms for d = 1 and their generalizations in d = 2, 3. Some explicit examples are worked out including the case of the mirror of the quartic in {\\mathbbm{P}^3}, where due to further algebraic constraints, the differential ring coincides with quasi modular forms.

Model-checking techniques based on cumulative residuals.

Science.gov (United States)

Lin, D Y; Wei, L J; Ying, Z

2002-03-01

Residuals have long been used for graphical and numerical examinations of the adequacy of regression models. Conventional residual analysis based on the plots of raw residuals or their smoothed curves is highly subjective, whereas most numerical goodness-of-fit tests provide little information about the nature of model misspecification. In this paper, we develop objective and informative model-checking techniques by taking the cumulative sums of residuals over certain coordinates (e.g., covariates or fitted values) or by considering some related aggregates of residuals, such as moving sums and moving averages. For a variety of statistical models and data structures, including generalized linear models with independent or dependent observations, the distributions of these stochastic processes tinder the assumed model can be approximated by the distributions of certain zero-mean Gaussian processes whose realizations can be easily generated by computer simulation. Each observed process can then be compared, both graphically and numerically, with a number of realizations from the Gaussian process. Such comparisons enable one to assess objectively whether a trend seen in a residual plot reflects model misspecification or natural variation. The proposed techniques are particularly useful in checking the functional form of a covariate and the link function. Illustrations with several medical studies are provided.

Fusion rules of chiral algebras

International Nuclear Information System (INIS)

Gaberdiel, M.

1994-01-01

Recently we showed that for the case of the WZW and the minimal models fusion can be understood as a certain ring-like tensor product of the symmetry algebra. In this paper we generalize this analysis to arbitrary chiral algebras. We define the tensor product of conformal field theory in the general case and prove that it is associative and symmetric up to equivalence. We also determine explicitly the action of the chiral algebra on this tensor product. In the second part of the paper we demonstrate that this framework provides a powerful tool for calculating restrictions for the fusion rules of chiral algebras. We exhibit this for the case of the W 3 algebra and the N=1 and N=2 NS superconformal algebras. (orig.)

Extensions of Scott's Graph Model and Kleene's Second Algebra

NARCIS (Netherlands)

van Oosten, J.; Voorneveld, Niels

We use a way to extend partial combinatory algebras (pcas) by forcing them to represent certain functions. In the case of Scott’s Graph Model, equality is computable relative to the complement function. However, the converse is not true. This creates a hierarchy of pcas which relates to similar

Behavioral Consistency of C and Verilog Programs Using Bounded Model Checking

National Research Council Canada - National Science Library

Clarke, Edmund; Kroening, Daniel; Yorav, Karen

2003-01-01

.... We describe experimental results on various reactive present an algorithm that checks behavioral consistency between an ANSI-C program and a circuit given in Verilog using Bounded Model Checking...

Model Checking - Automated Verification of Computational Systems

Indian Academy of Sciences (India)

Home; Journals; Resonance – Journal of Science Education; Volume 14; Issue 7. Model Checking - Automated Verification of Computational Systems. Madhavan Mukund. General Article Volume 14 Issue 7 July 2009 pp 667-681. Fulltext. Click here to view fulltext PDF. Permanent link:

From Rota-Baxter algebras to pre-Lie algebras

International Nuclear Information System (INIS)

An Huihui; Ba, Chengming

2008-01-01

Rota-Baxter algebras were introduced to solve some analytic and combinatorial problems and have appeared in many fields in mathematics and mathematical physics. Rota-Baxter algebras provide a construction of pre-Lie algebras from associative algebras. In this paper, we give all Rota-Baxter operators of weight 1 on complex associative algebras in dimension ≤3 and their corresponding pre-Lie algebras

Quartic Poisson algebras and quartic associative algebras and realizations as deformed oscillator algebras

International Nuclear Information System (INIS)

Marquette, Ian

2013-01-01

We introduce the most general quartic Poisson algebra generated by a second and a fourth order integral of motion of a 2D superintegrable classical system. We obtain the corresponding quartic (associative) algebra for the quantum analog, extend Daskaloyannis construction obtained in context of quadratic algebras, and also obtain the realizations as deformed oscillator algebras for this quartic algebra. We obtain the Casimir operator and discuss how these realizations allow to obtain the finite-dimensional unitary irreducible representations of quartic algebras and obtain algebraically the degenerate energy spectrum of superintegrable systems. We apply the construction and the formula obtained for the structure function on a superintegrable system related to type I Laguerre exceptional orthogonal polynomials introduced recently

Yoneda algebras of almost Koszul algebras

Indian Academy of Sciences (India)

Abstract. Let k be an algebraically closed field, A a finite dimensional connected. (p,q)-Koszul self-injective algebra with p, q ≥ 2. In this paper, we prove that the. Yoneda algebra of A is isomorphic to a twisted polynomial algebra A![t; β] in one inde- terminate t of degree q +1 in which A! is the quadratic dual of A, β is an ...

Consistency checks in beam emission modeling for neutral beam injectors

International Nuclear Information System (INIS)

Punyapu, Bharathi; Vattipalle, Prahlad; Sharma, Sanjeev Kumar; Baruah, Ujjwal Kumar; Crowley, Brendan

2015-01-01

In positive neutral beam systems, the beam parameters such as ion species fractions, power fractions and beam divergence are routinely measured using Doppler shifted beam emission spectrum. The accuracy with which these parameters are estimated depend on the accuracy of the atomic modeling involved in these estimations. In this work, an effective procedure to check the consistency of the beam emission modeling in neutral beam injectors is proposed. As a first consistency check, at a constant beam voltage and current, the intensity of the beam emission spectrum is measured by varying the pressure in the neutralizer. Then, the scaling of measured intensity of un-shifted (target) and Doppler shifted intensities (projectile) of the beam emission spectrum at these pressure values are studied. If the un-shifted component scales with pressure, then the intensity of this component will be used as a second consistency check on the beam emission modeling. As a further check, the modeled beam fractions and emission cross sections of projectile and target are used to predict the intensity of the un-shifted component and then compared with the value of measured target intensity. An agreement between the predicted and measured target intensities provide the degree of discrepancy in the beam emission modeling. In order to test this methodology, a systematic analysis of Doppler shift spectroscopy data obtained on the JET neutral beam test stand data was carried out

Model checking the HAVi leader election protocol

NARCIS (Netherlands)

J.M.T. Romijn (Judi)

1999-01-01

textabstractThe HAVi specification proposes an architecture for audio/video interoperability in home networks. Part of the HAVi specification is a distributed leader election protocol. We have modelled this leader election protocol in Promela and Lotos and have checked several properties with the

Quantum cluster algebras and quantum nilpotent algebras

Science.gov (United States)

Goodearl, Kenneth R.; Yakimov, Milen T.

2014-01-01

A major direction in the theory of cluster algebras is to construct (quantum) cluster algebra structures on the (quantized) coordinate rings of various families of varieties arising in Lie theory. We prove that all algebras in a very large axiomatically defined class of noncommutative algebras possess canonical quantum cluster algebra structures. Furthermore, they coincide with the corresponding upper quantum cluster algebras. We also establish analogs of these results for a large class of Poisson nilpotent algebras. Many important families of coordinate rings are subsumed in the class we are covering, which leads to a broad range of applications of the general results to the above-mentioned types of problems. As a consequence, we prove the Berenstein–Zelevinsky conjecture [Berenstein A, Zelevinsky A (2005) Adv Math 195:405–455] for the quantized coordinate rings of double Bruhat cells and construct quantum cluster algebra structures on all quantum unipotent groups, extending the theorem of Geiß et al. [Geiß C, et al. (2013) Selecta Math 19:337–397] for the case of symmetric Kac–Moody groups. Moreover, we prove that the upper cluster algebras of Berenstein et al. [Berenstein A, et al. (2005) Duke Math J 126:1–52] associated with double Bruhat cells coincide with the corresponding cluster algebras. PMID:24982197

Mathematical Modelling in Engineering: A Proposal to Introduce Linear Algebra Concepts

Science.gov (United States)

Cárcamo Bahamonde, Andrea; Gómez Urgelles, Joan; Fortuny Aymemí, Josep

2016-01-01

The modern dynamic world requires that basic science courses for engineering, including linear algebra, emphasise the development of mathematical abilities primarily associated with modelling and interpreting, which are not exclusively calculus abilities. Considering this, an instructional design was created based on mathematical modelling and…

An introduction to algebraic geometry and algebraic groups

CERN Document Server

Geck, Meinolf

2003-01-01

An accessible text introducing algebraic geometries and algebraic groups at advanced undergraduate and early graduate level, this book develops the language of algebraic geometry from scratch and uses it to set up the theory of affine algebraic groups from first principles.Building on the background material from algebraic geometry and algebraic groups, the text provides an introduction to more advanced and specialised material. An example is the representation theory of finite groups of Lie type.The text covers the conjugacy of Borel subgroups and maximal tori, the theory of algebraic groups

Applications of Computer Algebra Conference

CERN Document Server

Martínez-Moro, Edgar

2017-01-01

The Applications of Computer Algebra (ACA) conference covers a wide range of topics from Coding Theory to Differential Algebra to Quantam Computing, focusing on the interactions of these and other areas with the discipline of Computer Algebra. This volume provides the latest developments in the field as well as its applications in various domains, including communications, modelling, and theoretical physics. The book will appeal to researchers and professors of computer algebra, applied mathematics, and computer science, as well as to engineers and computer scientists engaged in research and development.

Homotopy Theory of C*-Algebras

CERN Document Server

Ostvaer, Paul Arne

2010-01-01

Homotopy theory and C* algebras are central topics in contemporary mathematics. This book introduces a modern homotopy theory for C*-algebras. One basic idea of the setup is to merge C*-algebras and spaces studied in algebraic topology into one category comprising C*-spaces. These objects are suitable fodder for standard homotopy theoretic moves, leading to unstable and stable model structures. With the foundations in place one is led to natural definitions of invariants for C*-spaces such as homology and cohomology theories, K-theory and zeta-functions. The text is largely self-contained. It

Lie n-algebras of BPS charges

Energy Technology Data Exchange (ETDEWEB)

Sati, Hisham [University of Pittsburgh,Pittsburgh, PA, 15260 (United States); Mathematics Program, Division of Science and Mathematics, New York University Abu Dhabi,Saadiyat Island, Abu Dhabi (United Arab Emirates); Schreiber, Urs [Mathematics Institute of the Academy,Žitna 25, Praha 1, 115 67 (Czech Republic)

2017-03-16

We uncover higher algebraic structures on Noether currents and BPS charges. It is known that equivalence classes of conserved currents form a Lie algebra. We show that at least for target space symmetries of higher parameterized WZW-type sigma-models this naturally lifts to a Lie (p+1)-algebra structure on the Noether currents themselves. Applied to the Green-Schwarz-type action functionals for super p-brane sigma-models this yields super Lie (p+1)-algebra refinements of the traditional BPS brane charge extensions of supersymmetry algebras. We discuss this in the generality of higher differential geometry, where it applies also to branes with (higher) gauge fields on their worldvolume. Applied to the M5-brane sigma-model we recover and properly globalize the M-theory super Lie algebra extension of 11-dimensional superisometries by 2-brane and 5-brane charges. Passing beyond the infinitesimal Lie theory we find cohomological corrections to these charges in higher analogy to the familiar corrections for D-brane charges as they are lifted from ordinary cohomology to twisted K-theory. This supports the proposal that M-brane charges live in a twisted cohomology theory.

INPUT-OUTPUT STRUCTURE OF LINEAR-DIFFERENTIAL ALGEBRAIC SYSTEMS

NARCIS (Netherlands)

KUIJPER, M; SCHUMACHER, JM

Systems of linear differential and algebraic equations occur in various ways, for instance, as a result of automated modeling procedures and in problems involving algebraic constraints, such as zero dynamics and exact model matching. Differential/algebraic systems may represent an input-output

The Das-Popowicz Moyal momentum algebra

International Nuclear Information System (INIS)

Boulahoual, A.; Sedra, M.B.

2002-08-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. (author)

Continual Lie algebras and noncommutative counterparts of exactly solvable models

Science.gov (United States)

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 approach to q-deformed supersymmetric variants of the Hubbard model with pair hoppings

International Nuclear Information System (INIS)

Arnaudon, D.

1997-01-01

Two quantum spin chains Hamiltonians with quantum sl(2/1) invariance are constructed. These spin chains define variants of the Hubbard model and describe electron models with pair hoppings. A cubic algebra that admits the Birman-Wenzl-Murakami algebra as a quotient allows exact solvability of the periodic chain. The two Hamiltonians, respectively built using the distinguished and the fermionic bases of U q (sl(2/1)) differ only in the boundary terms. They are actually equivalent, but the equivalence is non local. Reflection equations are solved to get exact solvability on open chains with non trivial boundary conditions. Two families of diagonal solutions are found. The centre and the s-Casimir of the quantum enveloping algebra of sl(2/1) appear as tools for the construction of exactly solvable Hamiltonians. (author)

Differential Hopf algebra structures on the Universal Enveloping Algebra of a Lie Algebra

NARCIS (Netherlands)

van den Hijligenberg, N.W.; van den Hijligenberg, N.; Martini, Ruud

1995-01-01

We discuss a method to construct a De Rham complex (differential algebra) of Poincaré–Birkhoff–Witt type on the universal enveloping algebra of a Lie algebra g. We determine the cases in which this gives rise to a differential Hopf algebra that naturally extends the Hopf algebrastructure of U(g).

Verifying large SDL-specifications using model checking

NARCIS (Netherlands)

Sidorova, N.; Steffen, M.; Reed, R.; Reed, J.

2001-01-01

In this paper we propose a methodology for model-checking based verification of large SDL specifications. The methodology is illustrated by a case study of an industrial medium-access protocol for wireless ATM. To cope with the state space explosion, the verification exploits the layered and modular

The Virasoro algebra in integrable hierarchies and the method of matrix models

International Nuclear Information System (INIS)

Semikhatov, A.M.

1992-01-01

The action of the Virasoro algebra on hierarchies of nonlinear integrable equations, and also the structure and consequences of Virasoro constraints on these hierarchies, are studied. It is proposed that a broad class of hierarchies, restricted by Virasoro constraints, can be defined in terms of dressing operators hidden in the structure of integrable systems. The Virasoro-algebra representation constructed on the dressing operators displays a number of analogies with structures in conformal field theory. The formulation of the Virasoro constraints that stems from this representation makes it possible to translate into the language of integrable systems a number of concepts from the method of the 'matrix models' that describe nonperturbative quantum gravity, and, in particular, to realize a 'hierarchical' version of the double scaling limit. From the Virasoro constraints written in terms of the dressing operators generalized loop equations are derived, and this makes it possible to do calculations on a reconstruction of the field-theoretical description. The reduction of the Kadomtsev-Petviashvili (KP) hierarchy, subject to Virasoro constraints, to generalized Korteweg-deVries (KdV) hierarchies is implemented, and the corresponding representation of the Virasoro algebra on these hierarchies is found both in the language of scalar differential operators and in the matrix formalism of Drinfel'd and Sokolov. The string equation in the matrix formalism does not replicate the structure of the scalar string equation. The symmetry algebras of the KP and N-KdV hierarchies restricted by Virasoro constraints are calculated: A relationship is established with algebras from the family W ∞ (J) of infinite W-algebras

Coset realization of unifying W-algebras

International Nuclear Information System (INIS)

Blumenhagen, R.; Huebel, R.

1994-06-01

We construct several quantum coset W-algebras, e.g. sl(2,R)/U(1) and sl(2,R)+sl(2,R)/sl(2,R), and argue that they are finitely nonfreely generated. Furthermore, we discuss in detail their role as unifying W-algebras of Casimir W-algebras. We show that it is possible to give coset realizations of various types of unifying W-algebras, e.g. the diagonal cosets based on the symplectic Lie algebras sp(2n) realize the unifying W-algebras which have previously been introduced as 'WD -n '. In addition, minimal models of WD -n are studied. The coset realizations provide a generalization of level-rank-duality of dual coset pairs. As further examples of finitely nonfreely generated quantum W-algebras we discuss orbifolding of W-algebras which on the quantum level has different properties than in the classical case. We demonstrate in some examples that the classical limit according to Bowcock and Watts of these nonfreely finitely generated quantum W-algebras probably yields infinitely nonfreely generated classical W-algebras. (orig.)

The relation between quantum W algebras and Lie algebras

International Nuclear Information System (INIS)

Boer, J. de; Tjin, T.

1994-01-01

By quantizing the generalized Drinfeld-Sokolov reduction scheme for arbitrary sl 2 embeddings we show that a large set W of quantum W algebras can be viewed as (BRST) cohomologies of affine Lie algebras. The set W contains many known W algebras such as W N and W 3 (2) . Our formalism yields a completely algorithmic method for calculating the W algebra generators and their operator product expansions, replacing the cumbersome construction of W algebras as commutants of screening operators. By generalizing and quantizing the Miura transformation we show that any W algebra in W can be embedded into the universal enveloping algebra of a semisimple affine Lie algebra which is, up to shifts in level, isomorphic to a subalgebra of the original affine algebra. Therefore any realization of this semisimple affine Lie algebra leads to a realization of the W algebra. In particular, one obtains in this way a general and explicit method for constructing the free field realizations and Fock resolutions for all algebras in W. Some examples are explicitly worked out. (orig.)

2-Local derivations on matrix algebras over semi-prime Banach algebras and on AW*-algebras

International Nuclear Information System (INIS)

Ayupov, Shavkat; Kudaybergenov, Karimbergen

2016-01-01

The paper is devoted to 2-local derivations on matrix algebras over unital semi-prime Banach algebras. For a unital semi-prime Banach algebra A with the inner derivation property we prove that any 2-local derivation on the algebra M 2 n (A), n ≥ 2, is a derivation. We apply this result to AW*-algebras and show that any 2-local derivation on an arbitrary AW*-algebra is a derivation. (paper)

From the topological development of matrix models to the topological string theory: arrangement of surfaces through algebraic geometry

International Nuclear Information System (INIS)

Orantin, N.

2007-09-01

The 2-matrix model has been introduced to study Ising model on random surfaces. Since then, the link between matrix models and arrangement of discrete surfaces has strongly tightened. This manuscript aims to investigate these deep links and extend them beyond the matrix models, following my work's evolution. First, I take care to define properly the hermitian 2 matrix model which gives rise to generating functions of discrete surfaces equipped with a spin structure. Then, I show how to compute all the terms in the topological expansion of any observable by using algebraic geometry tools. They are obtained as differential forms on an algebraic curve associated to the model: the spectral curve. In a second part, I show how to define such differentials on any algebraic curve even if it does not come from a matrix model. I then study their numerous symmetry properties under deformations of the algebraic curve. In particular, I show that these objects coincide with the topological expansion of the observable of a matrix model if the algebraic curve is the spectral curve of this model. Finally, I show that the fine tuning of the parameters ensures that these objects can be promoted to modular invariants and satisfy the holomorphic anomaly equation of the Kodaira-Spencer theory. This gives a new hint that the Dijkgraaf-Vafa conjecture is correct. (author)

Model checking optimal finite-horizon control for probabilistic gene regulatory networks.

Science.gov (United States)

Wei, Ou; Guo, Zonghao; Niu, Yun; Liao, Wenyuan

2017-12-14

Probabilistic Boolean networks (PBNs) have been proposed for analyzing external control in gene regulatory networks with incorporation of uncertainty. A context-sensitive PBN with perturbation (CS-PBNp), extending a PBN with context-sensitivity to reflect the inherent biological stability and random perturbations to express the impact of external stimuli, is considered to be more suitable for modeling small biological systems intervened by conditions from the outside. In this paper, we apply probabilistic model checking, a formal verification technique, to optimal control for a CS-PBNp that minimizes the expected cost over a finite control horizon. We first describe a procedure of modeling a CS-PBNp using the language provided by a widely used probabilistic model checker PRISM. We then analyze the reward-based temporal properties and the computation in probabilistic model checking; based on the analysis, we provide a method to formulate the optimal control problem as minimum reachability reward properties. Furthermore, we incorporate control and state cost information into the PRISM code of a CS-PBNp such that automated model checking a minimum reachability reward property on the code gives the solution to the optimal control problem. We conduct experiments on two examples, an apoptosis network and a WNT5A network. Preliminary experiment results show the feasibility and effectiveness of our approach. The approach based on probabilistic model checking for optimal control avoids explicit computation of large-size state transition relations associated with PBNs. It enables a natural depiction of the dynamics of gene regulatory networks, and provides a canonical form to formulate optimal control problems using temporal properties that can be automated solved by leveraging the analysis power of underlying model checking engines. This work will be helpful for further utilization of the advances in formal verification techniques in system biology.

Mixed Portmanteau Test for Diagnostic Checking of Time Series Models

Directory of Open Access Journals (Sweden)

Sohail Chand

2014-01-01

Full Text Available Model criticism is an important stage of model building and thus goodness of fit tests provides a set of tools for diagnostic checking of the fitted model. Several tests are suggested in literature for diagnostic checking. These tests use autocorrelation or partial autocorrelation in the residuals to criticize the adequacy of fitted model. The main idea underlying these portmanteau tests is to identify if there is any dependence structure which is yet unexplained by the fitted model. In this paper, we suggest mixed portmanteau tests based on autocorrelation and partial autocorrelation functions of the residuals. We derived the asymptotic distribution of the mixture test and studied its size and power using Monte Carlo simulations.

Quantum cluster algebra structures on quantum nilpotent algebras

CERN Document Server

Goodearl, K R

2017-01-01

All algebras in a very large, axiomatically defined class of quantum nilpotent algebras are proved to possess quantum cluster algebra structures under mild conditions. Furthermore, it is shown that these quantum cluster algebras always equal the corresponding upper quantum cluster algebras. Previous approaches to these problems for the construction of (quantum) cluster algebra structures on (quantized) coordinate rings arising in Lie theory were done on a case by case basis relying on the combinatorics of each concrete family. The results of the paper have a broad range of applications to these problems, including the construction of quantum cluster algebra structures on quantum unipotent groups and quantum double Bruhat cells (the Berenstein-Zelevinsky conjecture), and treat these problems from a unified perspective. All such applications also establish equality between the constructed quantum cluster algebras and their upper counterparts.

A framework for automatically checking anonymity with μ CRL

OpenAIRE

Chothia, T.; Orzan, S.M.; Pang, J.; Torabi Dashti, M.; Montanari, U.; Sannella, D.; Bruni, R.

2007-01-01

We present a powerful and flexible method for automatically checking anonymity in a possibilistic general-purpose process algebraic verification toolset. We propose new definitions of a choice anonymity degree and a player anonymity degree, to quantify the precision with which an intruder is able to single out the true originator of a given event or to associate the right event to a given protocol participant. We show how these measures of anonymity can be automatically calculated from a prot...

Q-systems as cluster algebras

International Nuclear Information System (INIS)

Kedem, Rinat

2008-01-01

Q-systems first appeared in the analysis of the Bethe equations for the XXX model and generalized Heisenberg spin chains (Kirillov and Reshetikhin 1987 Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst. Steklov. 160 211-21, 301). Such systems are known to exist for any simple Lie algebra and many other Kac-Moody algebras. We formulate the Q-system associated with any simple, simply-laced Lie algebras g in the language of cluster algebras (Fomin and Zelevinsky 2002 J. Am. Math. Soc. 15 497-529), and discuss the relation of the polynomiality property of the solutions of the Q-system in the initial variables, which follows from the representation-theoretical interpretation, to the Laurent phenomenon in cluster algebras (Fomin and Zelevinsky 2002 Adv. Appl. Math. 28 119-44)

Kac-Moody algebras and controlled chaos

International Nuclear Information System (INIS)

Wesley, Daniel H

2007-01-01

Compactification can control chaotic Mixmaster behaviour in gravitational systems with p-form matter: we consider this in light of the connection between supergravity models and Kac-Moody algebras. We show that different compactifications define 'mutations' of the algebras associated with the noncompact theories. We list the algebras obtained in this way, and find novel examples of wall systems determined by Lorentzian (but not hyperbolic) algebras. Cosmological models with a smooth pre-big bang phase require that chaos is absent: we show that compactification alone cannot eliminate chaos in the simplest compactifications of the heterotic string on a Calabi-Yau, or M theory on a manifold of G 2 holonomy. (fast track communication)

Quantum algebras in nuclear structure

International Nuclear Information System (INIS)

Bonatsos, D.; Daskaloyannis, C.

1995-01-01

Quantum algebras is 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 through 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 pairing correlations, and the symmetries of the anisotropic quantum harmonic oscillator with rational ratios of frequencies, which underline the structure of superdeformed and hyperdeformed nuclei are discussed in some details. A brief description of similar applications to molecular structure and an outlook are also given. (author) 2 Tabs., 324 Refs

Characteristic Dynkin diagrams and W algebras

International Nuclear Information System (INIS)

Ragoucy, E.

1993-01-01

We present a classification of characteristic Dynkin diagrams for the A N , B N , C N and D N algebras. This classification is related to the classification of W(G, K) algebras arising from non-abelian Toda models, and we argue that it can give new insight on the structure of W algebras. (orig.)

On Elementary and Algebraic Cellular Automata

Science.gov (United States)

Gulak, Yuriy

In this paper we study elementary cellular automata from an algebraic viewpoint. The goal is to relate the emergent complex behavior observed in such systems with the properties of corresponding algebraic structures. We introduce algebraic cellular automata as a natural generalization of elementary ones and discuss their applications as generic models of complex systems.

Model Checking as Static Analysis

DEFF Research Database (Denmark)

Zhang, Fuyuan

fairness problems can be encoded into ALFP as well. To deal with multi-valued model checking problems, we have proposed multivalued ALFP. A Moore Family result for multi-valued ALFP is also established, which ensures the existence and uniqueness of the least model. When the truth values in multi-valued...... of states satisfying a CTL formula can be characterized as the least model of ALFP clauses specifying this CTL formula. The existence of the least model of ALFP clauses is ensured by the Moore Family property of ALFP. Then, we take fairness assumptions in CTL into consideration and have shown that CTL...... ALFP constitute a nite distributive complete lattice, multi-valued ALFP can be reduced to two-valued ALFP. This result enables to implement a solver for multi-valued ALFP by reusing existing solvers for twovalued ALFP. Our ALFP-based technique developed for the two-valued CTL naturally generalizes...

Quadratic algebras

CERN Document Server

Polishchuk, Alexander

2005-01-01

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

Regularity of C*-algebras and central sequence algebras

DEFF Research Database (Denmark)

Christensen, Martin S.

The main topic of this thesis is regularity properties of C*-algebras and how these regularity properties are re ected in their associated central sequence algebras. The thesis consists of an introduction followed by four papers [A], [B], [C], [D]. In [A], we show that for the class of simple...... Villadsen algebra of either the rst type with seed space a nite dimensional CW complex, or the second type, tensorial absorption of the Jiang-Su algebra is characterized by the absence of characters on the central sequence algebra. Additionally, in a joint appendix with Joan Bosa, we show that the Villadsen...... algebra of the second type with innite stable rank fails the corona factorization property. In [B], we consider the class of separable C*-algebras which do not admit characters on their central sequence algebra, and show that it has nice permanence properties. We also introduce a new divisibility property...

Real division algebras and other algebras motivated by physics

International Nuclear Information System (INIS)

Benkart, G.; Osborn, J.M.

1981-01-01

In this survey we discuss several general techniques which have been productive in the study of real division algebras, flexible Lie-admissible algebras, and other nonassociative algebras, and we summarize results obtained using these methods. The principal method involved in this work is to view an algebra A as a module for a semisimple Lie algebra of derivations of A and to use representation theory to study products in A. In the case of real division algebras, we also discuss the use of isotopy and the use of a generalized Peirce decomposition. Most of the work summarized here has appeared in more detail in various other papers. The exceptions are results on a class of algebras of dimension 15, motivated by physics, which admit the Lie algebra sl(3) as an algebra of derivations

Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking

Directory of Open Access Journals (Sweden)

Christian Appold

2010-06-01

Full Text Available One technique to reduce the state-space explosion problem in temporal logic model checking is symmetry reduction. The combination of symmetry reduction and symbolic model checking by using BDDs suffered a long time from the prohibitively large BDD for the orbit relation. Dynamic symmetry reduction calculates representatives of equivalence classes of states dynamically and thus avoids the construction of the orbit relation. In this paper, we present a new efficient model checking algorithm based on dynamic symmetry reduction. Our experiments show that the algorithm is very fast and allows the verification of larger systems. We additionally implemented the use of state symmetries for symbolic symmetry reduction. To our knowledge we are the first who investigated state symmetries in combination with BDD based symbolic model checking.

Contractions of quantum algebraic structures

International Nuclear Information System (INIS)

Doikou, A.; Sfetsos, K.

2010-01-01

A general framework for obtaining certain types of contracted and centrally extended algebras is reviewed. The whole process relies on the existence of quadratic algebras, which appear in the context of boundary integrable models. (Abstract Copyright [2010], Wiley Periodicals, Inc.)

Model checking methodology for large systems, faults and asynchronous behaviour. SARANA 2011 work report

International Nuclear Information System (INIS)

Lahtinen, J.; Launiainen, T.; Heljanko, K.; Ropponen, J.

2012-01-01

Digital instrumentation and control (I and C) systems are challenging to verify. They enable complicated control functions, and the state spaces of the models easily become too large for comprehensive verification through traditional methods. Model checking is a formal method that can be used for system verification. A number of efficient model checking systems are available that provide analysis tools to determine automatically whether a given state machine model satisfies the desired safety properties. This report reviews the work performed in the Safety Evaluation and Reliability Analysis of Nuclear Automation (SARANA) project in 2011 regarding model checking. We have developed new, more exact modelling methods that are able to capture the behaviour of a system more realistically. In particular, we have developed more detailed fault models depicting the hardware configuration of a system, and methodology to model function-block-based systems asynchronously. In order to improve the usability of our model checking methods, we have developed an algorithm for model checking large modular systems. The algorithm can be used to verify properties of a model that could otherwise not be verified in a straightforward manner. (orig.)

Model checking methodology for large systems, faults and asynchronous behaviour. SARANA 2011 work report

Energy Technology Data Exchange (ETDEWEB)

Lahtinen, J. [VTT Technical Research Centre of Finland, Espoo (Finland); Launiainen, T.; Heljanko, K.; Ropponen, J. [Aalto Univ., Espoo (Finland). Dept. of Information and Computer Science

2012-07-01

Digital instrumentation and control (I and C) systems are challenging to verify. They enable complicated control functions, and the state spaces of the models easily become too large for comprehensive verification through traditional methods. Model checking is a formal method that can be used for system verification. A number of efficient model checking systems are available that provide analysis tools to determine automatically whether a given state machine model satisfies the desired safety properties. This report reviews the work performed in the Safety Evaluation and Reliability Analysis of Nuclear Automation (SARANA) project in 2011 regarding model checking. We have developed new, more exact modelling methods that are able to capture the behaviour of a system more realistically. In particular, we have developed more detailed fault models depicting the hardware configuration of a system, and methodology to model function-block-based systems asynchronously. In order to improve the usability of our model checking methods, we have developed an algorithm for model checking large modular systems. The algorithm can be used to verify properties of a model that could otherwise not be verified in a straightforward manner. (orig.)

Hom-Novikov algebras

International Nuclear Information System (INIS)

Yau, Donald

2011-01-01

We study a twisted generalization of Novikov algebras, called Hom-Novikov algebras, in which the two defining identities are twisted by a linear map. It is shown that Hom-Novikov algebras can be obtained from Novikov algebras by twisting along any algebra endomorphism. All algebra endomorphisms on complex Novikov algebras of dimensions 2 or 3 are computed, and their associated Hom-Novikov algebras are described explicitly. Another class of Hom-Novikov algebras is constructed from Hom-commutative algebras together with a derivation, generalizing a construction due to Dorfman and Gel'fand. Two other classes of Hom-Novikov algebras are constructed from Hom-Lie algebras together with a suitable linear endomorphism, generalizing a construction due to Bai and Meng.

The quantum Rabi model and Lie algebra representations of sl2

International Nuclear Information System (INIS)

Wakayama, Masato; Yamasaki, Taishi

2014-01-01

The aim of the present paper is to understand the spectral problem of the quantum Rabi model in terms of Lie algebra representations of sl 2 (R). We define a second order element of the universal enveloping algebra U(sl 2 ) of sl 2 (R), which, through the image of a principal series representation of sl 2 (R), provides a picture equivalent to the quantum Rabi model drawn by confluent Heun differential equations. By this description, in particular, we give a representation theoretic interpretation of the degenerate part of the spectrum (i.e., Judd's eigenstates) of the Rabi Hamiltonian due to Kuś in 1985, which is a part of the exceptional spectrum parameterized by integers. We also discuss the non-degenerate part of the exceptional spectrum of the model, in addition to the Judd eigenstates, from a viewpoint of infinite dimensional irreducible submodules (or subquotients) of the non-unitary principal series such as holomorphic discrete series representations of sl 2 (R). (paper)

Reflective thinking in solving an algebra problem: a case study of field independent-prospective teacher

Science.gov (United States)

Agustan, S.; Juniati, Dwi; Yuli Eko Siswono, Tatag

2017-10-01

Nowadays, reflective thinking is one of the important things which become a concern in learning mathematics, especially in solving a mathematical problem. The purpose of this paper is to describe how the student used reflective thinking when solved an algebra problem. The subject of this research is one female student who has field independent cognitive style. This research is a descriptive exploratory study with data analysis using qualitative approach to describe in depth reflective thinking of prospective teacher in solving an algebra problem. Four main categories are used to analyse the reflective thinking in solving an algebra problem: (1) formulation and synthesis of experience, (2) orderliness of experience, (3) evaluating the experience and (4) testing the selected solution based on the experience. The results showed that the subject described the problem by using another word and the subject also found the difficulties in making mathematical modelling. The subject analysed two concepts used in solving problem. For instance, geometry related to point and line while algebra is related to algebra arithmetic operation. The subject stated that solution must have four aspect to get effective solution, specifically the ability to (a) understand the meaning of every words; (b) make mathematical modelling; (c) calculate mathematically; (d) interpret solution obtained logically. To test the internal consistency or error in solution, the subject checked and looked back related procedures and operations used. Moreover, the subject tried to resolve the problem in a different way to compare the answers which had been obtained before. The findings supported the assertion that reflective thinking provides an opportunity for the students in improving their weakness in mathematical problem solving. It can make a grow accuracy and concentration in solving a mathematical problem. Consequently, the students will get the right and logic answer by reflective thinking.

n-ary algebras: a review with applications

International Nuclear Information System (INIS)

De Azcarraga, J A; Izquierdo, J M

2010-01-01

This paper reviews the properties and applications of certain n-ary generalizations of Lie algebras in a self-contained and unified way. These generalizations are algebraic structures in which the two-entry Lie bracket has been replaced by a bracket with n entries. Each type of n-ary bracket satisfies a specific characteristic identity which plays the role of the Jacobi identity for Lie algebras. Particular attention will be paid to generalized Lie algebras, which are defined by even multibrackets obtained by antisymmetrizing the associative products of its n components and that satisfy the generalized Jacobi identity, and to Filippov (or n-Lie) algebras, which are defined by fully antisymmetric n-brackets that satisfy the Filippov identity. 3-Lie algebras have surfaced recently in multi-brane theory in the context of the Bagger-Lambert-Gustavsson model. As a result, Filippov algebras will be discussed at length, including the cohomology complexes that govern their central extensions and their deformations (it turns out that Whitehead's lemma extends to all semisimple n-Lie algebras). When the skewsymmetry of the Lie or n-Lie algebra bracket is relaxed, one is led to a more general type of n-algebras, the n-Leibniz algebras. These will be discussed as well, since they underlie the cohomological properties of n-Lie algebras. The standard Poisson structure may also be extended to the n-ary case. We shall review here the even generalized Poisson structures, whose generalized Jacobi identity reproduces the pattern of the generalized Lie algebras, and the Nambu-Poisson structures, which satisfy the Filippov identity and determine Filippov algebras. Finally, the recent work of Bagger-Lambert and Gustavsson on superconformal Chern-Simons theory will be briefly discussed. Emphasis will be made on the appearance of the 3-Lie algebra structure and on why the A 4 model may be formulated in terms of an ordinary Lie algebra, and on its Nambu bracket generalization. (topical

modelling of queuing process at airport check-in system

African Journals Online (AJOL)

HOD

Key words: Airport check-in system, discrete time events, analytical models, simulation model, SimEvents toolbox. 1. ..... [6] Gross, D. and Harris, C. M. Fundamentals of. Queueing ... [11] Manataki I. E. and Zogra os K. G. “A Generic. System ...

Linear algebra meets Lie algebra: the Kostant-Wallach theory

OpenAIRE

Shomron, Noam; Parlett, Beresford N.

2008-01-01

In two languages, Linear Algebra and Lie Algebra, we describe the results of Kostant and Wallach on the fibre of matrices with prescribed eigenvalues of all leading principal submatrices. In addition, we present a brief introduction to basic notions in Algebraic Geometry, Integrable Systems, and Lie Algebra aimed at specialists in Linear Algebra.

Monitor-Based Statistical Model Checking for Weighted Metric Temporal Logic

DEFF Research Database (Denmark)

Bulychev, Petr; David, Alexandre; Larsen, Kim Guldstrand

2012-01-01

We present a novel approach and implementation for ana- lysing weighted timed automata (WTA) with respect to the weighted metric temporal logic (WMTL≤ ). Based on a stochastic semantics of WTAs, we apply statistical model checking (SMC) to estimate and test probabilities of satisfaction with desi......We present a novel approach and implementation for ana- lysing weighted timed automata (WTA) with respect to the weighted metric temporal logic (WMTL≤ ). Based on a stochastic semantics of WTAs, we apply statistical model checking (SMC) to estimate and test probabilities of satisfaction...

Krichever-Novikov type algebras theory and applications

CERN Document Server

Schlichenmaier, Martin

2014-01-01

Krichever and Novikov introduced certain classes of infinite dimensionalLie algebrasto extend the Virasoro algebra and its related algebras to Riemann surfaces of higher genus. The author of this book generalized and extended them toa more general setting needed by the applications. Examples of applications are Conformal Field Theory, Wess-Zumino-Novikov-Witten models, moduli space problems, integrable systems, Lax operator algebras, and deformation theory of Lie algebra. Furthermore they constitute an important class of infinite dimensional Lie algebras which due to their geometric origin are

Isovectorial pairing in solvable and algebraic models

International Nuclear Information System (INIS)

Lerma, Sergio; Vargas, Carlos E; Hirsch, Jorge G

2011-01-01

Schematic interactions are useful to gain some insight in the behavior of very complicated systems such as the atomic nuclei. Prototypical examples are, in this context, the pairing interaction and the quadrupole interaction of the Elliot model. In this contribution the interplay between isovectorial pairing, spin-orbit, and quadrupole terms in a harmonic oscillator shell (the so-called pairing-plus-quadrupole model) is studied by algebraic methods. The ability of this model to provide a realistic description of N = Z even-even nuclei in the fp-shell is illustrated with 44 Ti. Our calculations which derive from schematic and simple terms confirm earlier conclusions obtained by using realistic interactions: the SU(3) symmetry of the quadrupole term is broken mainly by the spin-orbit term, but the energies depends strongly on pairing.

Filiform Lie algebras of order 3

Science.gov (United States)

Navarro, R. M.

2014-04-01

The aim of this work is to generalize a very important type of Lie algebras and superalgebras, i.e., filiform Lie (super)algebras, into the theory of Lie algebras of order F. Thus, the concept of filiform Lie algebras of order F is obtained. In particular, for F = 3 it has been proved that by using infinitesimal deformations of the associated model elementary Lie algebra it can be obtained families of filiform elementary lie algebras of order 3, analogously as that occurs into the theory of Lie algebras [M. Vergne, "Cohomologie des algèbres de Lie nilpotentes. Application à l'étude de la variété des algèbres de Lie nilpotentes," Bull. Soc. Math. France 98, 81-116 (1970)]. Also we give the dimension, using an adaptation of the {sl}(2,{C})-module Method, and a basis of such infinitesimal deformations in some generic cases.

Using Canonical Forms for Isomorphism Reduction in Graph-based Model Checking

NARCIS (Netherlands)

Kant, Gijs

Graph isomorphism checking can be used in graph-based model checking to achieve symmetry reduction. Instead of one-to-one comparing the graph representations of states, canonical forms of state graphs can be computed. These canonical forms can be used to store and compare states. However, computing

Variability-Specific Abstraction Refinement for Family-Based Model Checking

DEFF Research Database (Denmark)

Dimovski, Aleksandar; Wasowski, Andrzej

2017-01-01

and property, while the number of possible scenarios is very large. In this work, we present an automatic iterative abstraction refinement procedure for family-based model checking. We use Craig interpolation to refine abstract variational models based on the obtained spurious counterexamples (traces...

State Space Reduction for Model Checking Agent Programs

NARCIS (Netherlands)

S.-S.T.Q. Jongmans (Sung-Shik); K.V. Hindriks; M.B. van Riemsdijk; L. Dennis; O. Boissier; R.H. Bordini (Rafael)

2012-01-01

htmlabstractState space reduction techniques have been developed to increase the efficiency of model checking in the context of imperative programming languages. Unfortunately, these techniques cannot straightforwardly be applied to agents: the nature of states in the two programming paradigms

Extended Virasoro algebra and algebra of area preserving diffeomorphisms

International Nuclear Information System (INIS)

Arakelyan, T.A.

1990-01-01

The algebra of area preserving diffeomorphism plays an important role in the theory of relativistic membranes. It is pointed out that the relation between this algebra and the extended Virasoro algebra associated with the generalized Kac-Moody algebras G(T 2 ). The highest weight representation of these infinite-dimensional algebras as well as of their subalgebras is studied. 5 refs

A Novel Method to Verify Multilevel Computational Models of Biological Systems Using Multiscale Spatio-Temporal Meta Model Checking.

Science.gov (United States)

Pârvu, Ovidiu; Gilbert, David

2016-01-01

Insights gained from multilevel computational models of biological systems can be translated into real-life applications only if the model correctness has been verified first. One of the most frequently employed in silico techniques for computational model verification is model checking. Traditional model checking approaches only consider the evolution of numeric values, such as concentrations, over time and are appropriate for computational models of small scale systems (e.g. intracellular networks). However for gaining a systems level understanding of how biological organisms function it is essential to consider more complex large scale biological systems (e.g. organs). Verifying computational models of such systems requires capturing both how numeric values and properties of (emergent) spatial structures (e.g. area of multicellular population) change over time and across multiple levels of organization, which are not considered by existing model checking approaches. To address this limitation we have developed a novel approximate probabilistic multiscale spatio-temporal meta model checking methodology for verifying multilevel computational models relative to specifications describing the desired/expected system behaviour. The methodology is generic and supports computational models encoded using various high-level modelling formalisms because it is defined relative to time series data and not the models used to generate it. In addition, the methodology can be automatically adapted to case study specific types of spatial structures and properties using the spatio-temporal meta model checking concept. To automate the computational model verification process we have implemented the model checking approach in the software tool Mule (http://mule.modelchecking.org). Its applicability is illustrated against four systems biology computational models previously published in the literature encoding the rat cardiovascular system dynamics, the uterine contractions of labour

Exact boson mappings for nuclear neutron (proton) shell-model algebras having SU(3) subalgebras

International Nuclear Information System (INIS)

Bonatsos, D.; Klein, A.

1986-01-01

In this paper the commutation relations of the fermion pair operators of identical nucleons coupled to spin zero are given for the general nuclear major shell in LST coupling. The associated Lie algebras are the unitary symplectic algebras Sp(2M). The corresponding multipole subalgebras are the unitary algebras U(M), which possess SU(3) subalgebras. Number conserving exact boson mappings of both the Dyson and hermitian form are given for the nuclear neutron (proton) s--d, p--f, s--d--g, and p--f--h shells, and their group theoretical structure is emphasized. The results are directly applicable in the case of the s--d shell, while in higher shells the experimentally plausible pseudo-SU(3) symmetry makes them applicable. The final purpose of this work is to provide a link between the shell model and the Interacting Boson Model (IBM) in the deformed limit. As already implied in the work of Draayer and Hecht, it is difficult to associate the boson model developed here with the conventional IBM model. The differences between the two approaches (due mainly to the effects of the Pauli principle) as well as their physical implications are extensively discussed

An application of the division algebras, Jordan algebras and split composition algebras

International Nuclear Information System (INIS)

Foot, R.; Joshi, G.C.

1992-01-01

It has been established that the covering group of the Lorentz group in D = 3, 4, 6, 10 can be expressed in a unified way, based on the four composition division algebras R, C, Q and O. In this paper, the authors discuss, in this framework, the role of the complex numbers of quantum mechanics. A unified treatment of quantum-mechanical spinors is given. The authors provide an explicit demonstration that the vector and spinor transformations recently constructed from a subgroup of the reduced structure group of the Jordan algebras M n 3 are indeed the Lorentz transformations. The authors also show that if the division algebras in the construction of the covering groups of the Lorentz groups in D = 3, 4, 6, 10 are replaced by the split composition algebras, then the sequence of groups SO(2, 2), SO(3, 3) and SO(5, 5) result. The analysis is presumed to be self-contained as the relevant aspects of the division algebras and Jordan algebras are reviewed. Some applications to physical theory are indicated

Interactions Between Representation Ttheory, Algebraic Topology and Commutative Algebra

CERN Document Server

Pitsch, Wolfgang; Zarzuela, Santiago

2016-01-01

This book includes 33 expanded abstracts of selected talks given at the two workshops "Homological Bonds Between Commutative Algebra and Representation Theory" and "Brave New Algebra: Opening Perspectives," and the conference "Opening Perspectives in Algebra, Representations, and Topology," held at the Centre de Recerca Matemàtica (CRM) in Barcelona between January and June 2015. These activities were part of the one-semester intensive research program "Interactions Between Representation Theory, Algebraic Topology and Commutative Algebra (IRTATCA)." Most of the abstracts present preliminary versions of not-yet published results and cover a large number of topics (including commutative and non commutative algebra, algebraic topology, singularity theory, triangulated categories, representation theory) overlapping with homological methods. This comprehensive book is a valuable resource for the community of researchers interested in homological algebra in a broad sense, and those curious to learn the latest dev...

An introduction to Kac-Moody algebras and their physical applications

International Nuclear Information System (INIS)

Goddard, P.; Olive, D.

1986-01-01

Kac-Moody algebras, the physical applications and results on their representation theory are surveyed. The Sugawara construction of the Virasoro algebra associated with a Kac-Moody algebra is described and it is used to produce the full discrete series of representations of the Virasoro algebra. The quark model construction of representations of Kac-Moody algebras is also described. Conditions necessary for the equivalence of two-dimensional σ-models to free fermion theories are derived

Duncan F. Gregory, William Walton and the development of British algebra: 'algebraical geometry', 'geometrical algebra', abstraction.

Science.gov (United States)

Verburgt, Lukas M

2016-01-01

This paper provides a detailed account of the period of the complex history of British algebra and geometry between the publication of George Peacock's Treatise on Algebra in 1830 and William Rowan Hamilton's paper on quaternions of 1843. During these years, Duncan Farquharson Gregory and William Walton published several contributions on 'algebraical geometry' and 'geometrical algebra' in the Cambridge Mathematical Journal. These contributions enabled them not only to generalize Peacock's symbolical algebra on the basis of geometrical considerations, but also to initiate the attempts to question the status of Euclidean space as the arbiter of valid geometrical interpretations. At the same time, Gregory and Walton were bound by the limits of symbolical algebra that they themselves made explicit; their work was not and could not be the 'abstract algebra' and 'abstract geometry' of figures such as Hamilton and Cayley. The central argument of the paper is that an understanding of the contributions to 'algebraical geometry' and 'geometrical algebra' of the second generation of 'scientific' symbolical algebraists is essential for a satisfactory explanation of the radical transition from symbolical to abstract algebra that took place in British mathematics in the 1830s-1840s.

Filiform Lie algebras of order 3

International Nuclear Information System (INIS)

Navarro, R. M.

2014-01-01

The aim of this work is to generalize a very important type of Lie algebras and superalgebras, i.e., filiform Lie (super)algebras, into the theory of Lie algebras of order F. Thus, the concept of filiform Lie algebras of order F is obtained. In particular, for F = 3 it has been proved that by using infinitesimal deformations of the associated model elementary Lie algebra it can be obtained families of filiform elementary lie algebras of order 3, analogously as that occurs into the theory of Lie algebras [M. Vergne, “Cohomologie des algèbres de Lie nilpotentes. Application à l’étude de la variété des algèbres de Lie nilpotentes,” Bull. Soc. Math. France 98, 81–116 (1970)]. Also we give the dimension, using an adaptation of the sl(2,C)-module Method, and a basis of such infinitesimal deformations in some generic cases

Query Language for Location-Based Services: A Model Checking Approach

Science.gov (United States)

Hoareau, Christian; Satoh, Ichiro

We present a model checking approach to the rationale, implementation, and applications of a query language for location-based services. Such query mechanisms are necessary so that users, objects, and/or services can effectively benefit from the location-awareness of their surrounding environment. The underlying data model is founded on a symbolic model of space organized in a tree structure. Once extended to a semantic model for modal logic, we regard location query processing as a model checking problem, and thus define location queries as hybrid logicbased formulas. Our approach is unique to existing research because it explores the connection between location models and query processing in ubiquitous computing systems, relies on a sound theoretical basis, and provides modal logic-based query mechanisms for expressive searches over a decentralized data structure. A prototype implementation is also presented and will be discussed.

Current algebras and many-body physics

International Nuclear Information System (INIS)

Albertin, U.K.

1989-01-01

Several applications of current algebras in many body physics are examined. The first is the interacting Bose gas in three dimensions. Theories for phonons, vortices and rotons are all described within the current algebra formalism. Next the one dimensional electron gas is examined within the approximation of linear dispersion so that relativistic current algebra techniques may be used. The relation with Thirring strings and compactified boson models is examined, and points of enhanced symmetry in the compactified boson models are shown to lie on phase transition lines for the electron gas. Finally, mathematical aspects of the current algebra are studied. The theory of induced representations of the diffeomorphism group are used to describe the Aharanov-Bohm effect, the thermodynamics of the Bose gas, and the Bose gas in the presence of vortex filaments

Supersymmetry in physics: an algebraic overview

International Nuclear Information System (INIS)

Ramond, P.

1983-01-01

In 1970, while attempting to generalize the Veneziano model (string model) to include fermions, I introduced a new algebraic structure which turned out to be a graded Lie algebra; it was used as a spectrum-generating algebra. This approach was soon after generalized to include interactions, yielding a complete model of fermions and boson (RNS model). In an unrelated work in the Soviet Union, it was shown how to generalize the Poincare group to include fermionic charges. However it was not until 1974 that an interacting field theory invariant under the Graded Poincare group in 3 + 1 dimensions was built (WZ model). Supersymmetric field theories turned out to have less divergent ultraviolet behavior than non-supersymmetric field theories. Gravity was generalized to include supersymmetry, to a theory called supergravity. By now many interacting local field theories exhibiting supersymmetry have been built and studied from 1 + 1 to 10 + 1 dimensions. Supersymmetric local field theories in less than 9 + 1 dimensions, can be understood as limits of multilocal (string) supersymmetric theories, in 9 + 1 dimensions. On the other hand, graded Lie algebras have been used in non-relativistic physics as approximate symmetries of Hamiltonians. The most striking such use so far helps comparing even and odd nuclei energy levels. It is believed that graded Lie algebras can be used whenever paired and unpaired fermions excitations can coexist. In this overview of a tremendously large field, I will only survey finite graded Lie algebras and their representations. For non-relativistic applications, all of GLA are potentially useful, while for relativistic applications, only these which include the Poincare group are to be considered

Monomial algebras

CERN Document Server

Villarreal, Rafael

2015-01-01

The book stresses the interplay between several areas of pure and applied mathematics, emphasizing the central role of monomial algebras. It unifies the classical results of commutative algebra with central results and notions from graph theory, combinatorics, linear algebra, integer programming, and combinatorial optimization. The book introduces various methods to study monomial algebras and their presentation ideals, including Stanley-Reisner rings, subrings and blowup algebra-emphasizing square free quadratics, hypergraph clutters, and effective computational methods.

Algebra

CERN Document Server

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.

Iwahori-Hecke algebras and Schur algebras of the symmetric group

CERN Document Server

Mathas, Andrew

1999-01-01

This volume presents a fully self-contained introduction to the modular representation theory of the Iwahori-Hecke algebras of the symmetric groups and of the q-Schur algebras. The study of these algebras was pioneered by Dipper and James in a series of landmark papers. The primary goal of the book is to classify the blocks and the simple modules of both algebras. The final chapter contains a survey of recent advances and open problems. The main results are proved by showing that the Iwahori-Hecke algebras and q-Schur algebras are cellular algebras (in the sense of Graham and Lehrer). This is proved by exhibiting natural bases of both algebras which are indexed by pairs of standard and semistandard tableaux respectively. Using the machinery of cellular algebras, which is developed in Chapter 2, this results in a clean and elegant classification of the irreducible representations of both algebras. The block theory is approached by first proving an analogue of the Jantzen sum formula for the q-Schur algebras. T...

Color Algebras

Science.gov (United States)

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. The difficulty addressed here is the fact that, because of metamerism, we cannot know with certainty the spectrum that produced a particular color solely on the basis of sensory data. Knowledge of the spectrum is not required to compute additive mixture of colors, but is critical for subtractive (multiplicative) mixture. Therefore, we cannot predict with certainty the multiplicative interactions between colors based solely on sensory data. There are two potential applications of a color algebra: first, to aid modeling phenomena of human visual perception, such as color constancy and transparency; and, second, to provide better models of the interactions of lights and surfaces for computer graphics rendering.

Algebra of pseudo-differential operators over C*-algebra

International Nuclear Information System (INIS)

Mohammad, N.

1982-08-01

Algebras of pseudo-differential operators over C*-algebras are studied for the special case when in Hormander class Ssub(rho,delta)sup(m)(Ω) Ω = Rsup(n); rho = 1, delta = 0, m any real number, and the C*-algebra is infinite dimensional non-commutative. The space B, i.e. the set of A-valued C*-functions in Rsup(n) (or Rsup(n) x Rsup(n)) whose derivatives are all bounded, plays an important role. A denotes C*-algebra. First the operator class Ssub(phi,0)sup(m) is defined, and through it, the class Lsub(1,0)sup(m) of pseudo-differential operators. Then the basic asymptotic expansion theorems concerning adjoint and product of operators of class Ssub(1,0)sup(m) are stated. Finally, proofs are given of L 2 -continuity theorem and the main theorem, which states that algebra of all pseudo-differential operators over C*-algebras is itself C*-algebra

Commutative algebra with a view toward algebraic geometry

CERN Document Server

Eisenbud, David

1995-01-01

Commutative Algebra is best understood with knowledge of the geometric ideas that have played a great role in its formation, in short, with a view towards algebraic geometry. The author presents a comprehensive view of commutative algebra, from basics, such as localization and primary decomposition, through dimension theory, differentials, homological methods, free resolutions and duality, emphasizing the origins of the ideas and their connections with other parts of mathematics. Many exercises illustrate and sharpen the theory and extended exercises give the reader an active part in complementing the material presented in the text. One novel feature is a chapter devoted to a quick but thorough treatment of Grobner basis theory and the constructive methods in commutative algebra and algebraic geometry that flow from it. Applications of the theory and even suggestions for computer algebra projects are included. This book will appeal to readers from beginners to advanced students of commutative algebra or algeb...

The algebras of large N matrix mechanics

Energy Technology Data Exchange (ETDEWEB)

Halpern, M.B.; Schwartz, C.

1999-09-16

Extending early work, we formulate the large N matrix mechanics of general bosonic, fermionic and supersymmetric matrix models, including Matrix theory: The Hamiltonian framework of large N matrix mechanics provides a natural setting in which to study the algebras of the large N limit, including (reduced) Lie algebras, (reduced) supersymmetry algebras and free algebras. We find in particular a broad array of new free algebras which we call symmetric Cuntz algebras, interacting symmetric Cuntz algebras, symmetric Bose/Fermi/Cuntz algebras and symmetric Cuntz superalgebras, and we discuss the role of these algebras in solving the large N theory. Most important, the interacting Cuntz algebras are associated to a set of new (hidden!) local quantities which are generically conserved only at large N. A number of other new large N phenomena are also observed, including the intrinsic nonlocality of the (reduced) trace class operators of the theory and a closely related large N field identification phenomenon which is associated to another set (this time nonlocal) of new conserved quantities at large N.

Discrete event systems in dioid algebra and conventional algebra

CERN Document Server

Declerck, Philippe

2013-01-01

This book concerns the use of dioid algebra as (max, +) algebra to treat the synchronization of tasks expressed by the maximum of the ends of the tasks conditioning the beginning of another task - a criterion of linear programming. A classical example is the departure time of a train which should wait for the arrival of other trains in order to allow for the changeover of passengers.The content focuses on the modeling of a class of dynamic systems usually called "discrete event systems" where the timing of the events is crucial. Events are viewed as sudden changes in a process which i

Constraint Lie algebra and local physical Hamiltonian for a generic 2D dilatonic model

International Nuclear Information System (INIS)

Corichi, Alejandro; Karami, Asieh; Rastgoo, Saeed; Vukašinac, Tatjana

2016-01-01

We consider a class of two-dimensional dilatonic models, and revisit them from the perspective of a new set of ‘polar type’ variables. These are motivated by recently defined variables within the spherically symmetric sector of 4D general relativity. We show that for a large class of dilatonic models, including the case with matter, one can perform a series of canonical transformations in such a way that the Poisson algebra of the constraints becomes a Lie algebra. Furthermore, we construct Dirac observables and a reduced Hamiltonian that accounts for the time evolution of the system. (paper)

Recent advances in importance sampling for statistical model checking

NARCIS (Netherlands)

Reijsbergen, D.P.; de Boer, Pieter-Tjerk; Scheinhardt, Willem R.W.; Haverkort, Boudewijn R.H.M.

2013-01-01

In the following work we present an overview of recent advances in rare event simulation for model checking made at the University of Twente. The overview is divided into the several model classes for which we propose algorithms, namely multicomponent systems, Markov chains and stochastic Petri

On Diagnostic Checking of Vector ARMA-GARCH Models with Gaussian and Student-t Innovations

Directory of Open Access Journals (Sweden)

Yongning Wang

2013-04-01

Full Text Available This paper focuses on the diagnostic checking of vector ARMA (VARMA models with multivariate GARCH errors. For a fitted VARMA-GARCH model with Gaussian or Student-t innovations, we derive the asymptotic distributions of autocorrelation matrices of the cross-product vector of standardized residuals. This is different from the traditional approach that employs only the squared series of standardized residuals. We then study two portmanteau statistics, called Q1(M and Q2(M, for model checking. A residual-based bootstrap method is provided and demonstrated as an effective way to approximate the diagnostic checking statistics. Simulations are used to compare the performance of the proposed statistics with other methods available in the literature. In addition, we also investigate the effect of GARCH shocks on checking a fitted VARMA model. Empirical sizes and powers of the proposed statistics are investigated and the results suggest a procedure of using jointly Q1(M and Q2(M in diagnostic checking. The bivariate time series of FTSE 100 and DAX index returns is used to illustrate the performance of the proposed portmanteau statistics. The results show that it is important to consider the cross-product series of standardized residuals and GARCH effects in model checking.

Jordan algebras versus C*- algebras

International Nuclear Information System (INIS)

Stormer, E.

1976-01-01

The axiomatic formulation of quantum mechanics and the problem of whether the observables form self-adjoint operators on a Hilbert space, are discussed. The relation between C*- algebras and Jordan algebras is studied using spectral theory. (P.D.)

Complex algebraic geometry

CERN Document Server

Kollár, János

1997-01-01

This volume contains the lectures presented at the third Regional Geometry Institute at Park City in 1993. The lectures provide an introduction to the subject, complex algebraic geometry, making the book suitable as a text for second- and third-year graduate students. The book deals with topics in algebraic geometry where one can reach the level of current research while starting with the basics. Topics covered include the theory of surfaces from the viewpoint of recent higher-dimensional developments, providing an excellent introduction to more advanced topics such as the minimal model program. Also included is an introduction to Hodge theory and intersection homology based on the simple topological ideas of Lefschetz and an overview of the recent interactions between algebraic geometry and theoretical physics, which involve mirror symmetry and string theory.

An algebraic stress/flux model for two-phase turbulent flow

International Nuclear Information System (INIS)

Kumar, R.

1995-12-01

An algebraic stress model (ASM) for turbulent Reynolds stress and a flux model for turbulent heat flux are proposed for two-phase bubbly and slug flows. These mathematical models are derived from the two-phase transport equations for Reynolds stress and turbulent heat flux, and provide C μ , a turbulent constant which defines the level of eddy viscosity, as a function of the interfacial terms. These models also include the effect of heat transfer. When the interfacial drag terms and the interfacial momentum transfer terms are absent, the model reduces to a single-phase model used in the literature

Model-checking dense-time Duration Calculus

DEFF Research Database (Denmark)

Fränzle, Martin

2004-01-01

Since the seminal work of Zhou Chaochen, M. R. Hansen, and P. Sestoft on decidability of dense-time Duration Calculus [Zhou, Hansen, Sestoft, 1993] it is well-known that decidable fragments of Duration Calculus can only be obtained through withdrawal of much of the interesting vocabulary...... of this logic. While this was formerly taken as an indication that key-press verification of implementations with respect to elaborate Duration Calculus specifications were also impossible, we show that the model property is well decidable for realistic designs which feature natural constraints...... suitably sparser model classes we obtain model-checking procedures for rich subsets of Duration Calculus. Together with undecidability results also obtained, this sheds light upon the exact borderline between decidability and undecidability of Duration Calculi and related logics....

Simulation-Based Model Checking for Nondeterministic Systems and Rare Events

Science.gov (United States)

2016-03-24

rounds of Monte Carlo sampling and Reinforcement Learning to improve the policy for nondeterminic choices with respect to satisfying a Bounded Linear ...computations for evaluating elementary functions in the Embedded GNU C Library [11]. For instance, the sine function can return values larger than 1053...Joint International Work- shop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification 9 Final Report, March 14, 2016

Virasoro algebra action on integrable hierarchies and Virasoro contraints in matrix models

International Nuclear Information System (INIS)

Semikhatov, A.M.

1991-01-01

The action of the Virasoro algebra on integrable hierarchies of non-linear equations and on related objects ('Schroedinger' differential operators) is investigated. The method consists in pushing forward the Virasoro action to the wave function of a hierarchy, and then reconstructing its action on the dressing and Lax operators. This formulation allows one to observe a number of suggestive similarities between the structures involved in the description of the Virasoro algebra on the hierarchies and the structure of conformal field theory on the world-sheet. This includes, in particular, an 'off-shell' hierarchy version of operator products and of the Cauchy kernel. In relation to matrix models, which have been observed to be effectively described by integrable hierarchies subjected to Virasoro constraints, I propose to define general Virasoro-constrained hierarchies also in terms of dressing operators, by certain equations which carry the information of the hierarchy and the Virasoro algebra simultaneously and which suggest an interpretation as operator versions of recursion/loop equations in topological theories. These same equations provide a relation with integrable hierarchies with quantized spectral parameter introduced recently. The formulation in terms of dressing operators allows a scaling (continuum limit) of discrete (i.e. lattice) hierarchies with the Virasoro constraints into 'continuous' Virasoro-constrained hierarchies. In particular, the KP hierarchy subjected to the Virasoro constraints is recovered as a scaling limit of the Virasoro-constrained Toda hierarchy. The dressing operator method also makes is straightforward to identify the full symmetry algebra of Virasoro-constrained hierarchies, which is related to the family of W ∞ (J) algebras introduced recently. (orig./HS)

Implicative Algebras

African Journals Online (AJOL)

Tadesse

In this paper we introduce the concept of implicative algebras which is an equivalent definition of lattice implication algebra of Xu (1993) and further we prove that it is a regular Autometrized. Algebra. Further we remark that the binary operation → on lattice implicative algebra can never be associative. Key words: Implicative ...

Open algebraic surfaces

CERN Document Server

Miyanishi, Masayoshi

2000-01-01

Open algebraic surfaces are a synonym for algebraic surfaces that are not necessarily complete. An open algebraic surface is understood as a Zariski open set of a projective algebraic surface. There is a long history of research on projective algebraic surfaces, and there exists a beautiful Enriques-Kodaira classification of such surfaces. The research accumulated by Ramanujan, Abhyankar, Moh, and Nagata and others has established a classification theory of open algebraic surfaces comparable to the Enriques-Kodaira theory. This research provides powerful methods to study the geometry and topology of open algebraic surfaces. The theory of open algebraic surfaces is applicable not only to algebraic geometry, but also to other fields, such as commutative algebra, invariant theory, and singularities. This book contains a comprehensive account of the theory of open algebraic surfaces, as well as several applications, in particular to the study of affine surfaces. Prerequisite to understanding the text is a basic b...

Efficient Parallel Statistical Model Checking of Biochemical Networks

Directory of Open Access Journals (Sweden)

Paolo Ballarini

2009-12-01

Full Text Available We consider the problem of verifying stochastic models of biochemical networks against behavioral properties expressed in temporal logic terms. Exact probabilistic verification approaches such as, for example, CSL/PCTL model checking, are undermined by a huge computational demand which rule them out for most real case studies. Less demanding approaches, such as statistical model checking, estimate the likelihood that a property is satisfied by sampling executions out of the stochastic model. We propose a methodology for efficiently estimating the likelihood that a LTL property P holds of a stochastic model of a biochemical network. As with other statistical verification techniques, the methodology we propose uses a stochastic simulation algorithm for generating execution samples, however there are three key aspects that improve the efficiency: first, the sample generation is driven by on-the-fly verification of P which results in optimal overall simulation time. Second, the confidence interval estimation for the probability of P to hold is based on an efficient variant of the Wilson method which ensures a faster convergence. Third, the whole methodology is designed according to a parallel fashion and a prototype software tool has been implemented that performs the sampling/verification process in parallel over an HPC architecture.

CONSTRUCTION OF REGULAR LDPC LIKE CODES BASED ON FULL RANK CODES AND THEIR ITERATIVE DECODING USING A PARITY CHECK TREE

Directory of Open Access Journals (Sweden)

H. Prashantha Kumar

2011-09-01

Full Text Available Low density parity check (LDPC codes are capacity-approaching codes, which means that practical constructions exist that allow the noise threshold to be set very close to the theoretical Shannon limit for a memory less channel. LDPC codes are finding increasing use in applications like LTE-Networks, digital television, high density data storage systems, deep space communication systems etc. Several algebraic and combinatorial methods are available for constructing LDPC codes. In this paper we discuss a novel low complexity algebraic method for constructing regular LDPC like codes derived from full rank codes. We demonstrate that by employing these codes over AWGN channels, coding gains in excess of 2dB over un-coded systems can be realized when soft iterative decoding using a parity check tree is employed.

Hecke algebraic properties of dynamical R-matrices. Application to related quantum matrix algebras

International Nuclear Information System (INIS)

Khadzhiivanov, L.K.; Todorov, I.T.; Isaev, A.P.; Pyatov, P.N.; Ogievetskij, O.V.

1998-01-01

The quantum dynamical Yang-Baxter (or Gervais-Neveu-Felder) equation defines an R-matrix R cap (p), where p stands for a set of mutually commuting variables. A family of SL (n)-type solutions of this equation provides a new realization of the Hecke algebra. We define quantum antisymmetrizers, introduce the notion of quantum determinant and compute the inverse quantum matrix for matrix algebras of the type R cap (p) a 1 a 2 = a 1 a 2 R cap. It is pointed out that such a quantum matrix algebra arises in the operator realization of the chiral zero modes of the WZNW model

Separable algebras

CERN Document Server

Ford, Timothy J

2017-01-01

This book presents a comprehensive introduction to the theory of separable algebras over commutative rings. After a thorough introduction to the general theory, the fundamental roles played by separable algebras are explored. For example, Azumaya algebras, the henselization of local rings, and Galois theory are rigorously introduced and treated. Interwoven throughout these applications is the important notion of étale algebras. Essential connections are drawn between the theory of separable algebras and Morita theory, the theory of faithfully flat descent, cohomology, derivations, differentials, reflexive lattices, maximal orders, and class groups. The text is accessible to graduate students who have finished a first course in algebra, and it includes necessary foundational material, useful exercises, and many nontrivial examples.

Forward error correction based on algebraic-geometric theory

CERN Document Server

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.

Mathematical Modelling in Engineering: An Alternative Way to Teach Linear Algebra

Science.gov (United States)

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…

Generalized EMV-Effect Algebras

Science.gov (United States)

Borzooei, R. A.; Dvurečenskij, A.; Sharafi, A. H.

2018-04-01

Recently in Dvurečenskij and Zahiri (2017), new algebraic structures, called EMV-algebras which generalize both MV-algebras and generalized Boolean algebras, were introduced. We present equivalent conditions for EMV-algebras. In addition, we define a partial algebraic structure, called a generalized EMV-effect algebra, which is close to generalized MV-effect algebras. Finally, we show that every generalized EMV-effect algebra is either an MV-effect algebra or can be embedded into an MV-effect algebra as a maximal ideal.

Quantitative Analysis of Probabilistic Models of Software Product Lines with Statistical Model Checking

DEFF Research Database (Denmark)

ter Beek, Maurice H.; Legay, Axel; Lluch Lafuente, Alberto

2015-01-01

We investigate the suitability of statistical model checking techniques for analysing quantitative properties of software product line models with probabilistic aspects. For this purpose, we enrich the feature-oriented language FLAN with action rates, which specify the likelihood of exhibiting pa...

Quantum trigonometric Calogero-Sutherland model, irreducible characters and Clebsch-Gordan series for the exceptional algebra E7

International Nuclear Information System (INIS)

Fernandez Nunez, J.; Garcia Fuertes, W.; Perelomov, A.M.

2005-01-01

We reexpress the quantum Calogero-Sutherland model for the Lie algebra E 7 and the particular value of the coupling constant κ=1 by using the fundamental irreducible characters of the algebra as dynamical variables. For that, we need to develop a systematic procedure to obtain all the Clebsch-Gordan series required to perform the change of variables. We describe how the resulting quantum Hamiltonian operator can be used to compute more characters and Clebsch-Gordan series for this exceptional algebra

Enlarged symmetry algebras of spin chains, loop models, and S-matrices

International Nuclear Information System (INIS)

Read, N.; Saleur, H.

2007-01-01

The symmetry algebras of certain families of quantum spin chains are considered in detail. The simplest examples possess m states per site (m>=2), with nearest-neighbor interactions with U(m) symmetry, under which the sites transform alternately along the chain in the fundamental m and its conjugate representation m-bar. We find that these spin chains, even with arbitrary coefficients of these interactions, have a symmetry algebra A m much larger than U(m), which implies that the energy eigenstates fall into sectors that for open chains (i.e., free boundary conditions) can be labeled by j=0,1,...,L, for the 2L-site chain such that the degeneracies of all eigenvalues in the jth sector are generically the same and increase rapidly with j. For large j, these degeneracies are much larger than those that would be expected from the U(m) symmetry alone. The enlarged symmetry algebra A m (2L) consists of operators that commute in this space of states with the Temperley-Lieb algebra that is generated by the set of nearest-neighbor interaction terms; A m (2L) is not a Yangian. There are similar results for supersymmetric chains with gl(m+n|n) symmetry of nearest-neighbor interactions, and a richer representation structure for closed chains (i.e., periodic boundary conditions). The symmetries also apply to the loop models that can be obtained from the spin chains in a spacetime or transfer matrix picture. In the loop language, the symmetries arise because the loops cannot cross. We further define tensor products of representations (for the open chains) by joining chains end to end. The fusion rules for decomposing the tensor product of representations labeled j 1 and j 2 take the same form as the Clebsch-Gordan series for SU(2). This and other structures turn the symmetry algebra A m into a ribbon Hopf algebra, and we show that this is 'Morita equivalent' to the quantum group U q (sl 2 ) for m=q+q -1 . The open-chain results are extended to the cases vertical bar m vertical

Application of Model-Checking Technology to Controller Synthesis

DEFF Research Database (Denmark)

David, Alexandre; Grunnet, Jacob Deleuran; Jessen, Jan Jacob

2011-01-01

In this paper we present two frameworks that have been implemented to link traditional model-checking techniques to the domain of control. The techniques are based on solving a timed game and using the resulting solution (a strategy) as a controller. The obtained discrete controller must fit with...

Banach Synaptic Algebras

Science.gov (United States)

Foulis, David J.; Pulmannov, Sylvia

2018-04-01

Using a representation theorem of Erik Alfsen, Frederic Schultz, and Erling Størmer for special JB-algebras, we prove that a synaptic algebra is norm complete (i.e., Banach) if and only if it is isomorphic to the self-adjoint part of a Rickart C∗-algebra. Also, we give conditions on a Banach synaptic algebra that are equivalent to the condition that it is isomorphic to the self-adjoint part of an AW∗-algebra. Moreover, we study some relationships between synaptic algebras and so-called generalized Hermitian algebras.

Grassmann algebras

International Nuclear Information System (INIS)

Garcia, R.L.

1983-11-01

The Grassmann algebra is presented briefly. Exponential and logarithm of matrices functions, whose elements belong to this algebra, are studied with the help of the SCHOONSCHIP and REDUCE 2 algebraic manipulators. (Author) [pt

Applied linear algebra and matrix analysis

CERN Document Server

Shores, Thomas S

2018-01-01

In its second edition, this textbook offers a fresh approach to matrix and linear algebra. Its blend of theory, computational exercises, and analytical writing projects is designed to highlight the interplay between these aspects of an application. This approach places special emphasis on linear algebra as an experimental science that provides tools for solving concrete problems. The second edition’s revised text discusses applications of linear algebra like graph theory and network modeling methods used in Google’s PageRank algorithm. Other new materials include modeling examples of diffusive processes, linear programming, image processing, digital signal processing, and Fourier analysis. These topics are woven into the core material of Gaussian elimination and other matrix operations; eigenvalues, eigenvectors, and discrete dynamical systems; and the geometrical aspects of vector spaces. Intended for a one-semester undergraduate course without a strict calculus prerequisite, Applied Linear Algebra and M...

Algebraic geometry

CERN Document Server

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.

Helmholtz algebraic solitons

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.

Helmholtz algebraic solitons

International Nuclear Information System (INIS)

Christian, J M; McDonald, G S; Chamorro-Posada, P

2010-01-01

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.

Converting nested algebra expressions into flat algebra expressions

NARCIS (Netherlands)

Paredaens, J.; Van Gucht, D.

1992-01-01

Nested relations generalize ordinary flat relations by allowing tuple values to be either atomic or set valued. The nested algebra is a generalization of the flat relational algebra to manipulate nested relations. In this paper we study the expressive power of the nested algebra relative to its

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.

Fibered F-Algebra

OpenAIRE

Kleyn, Aleks

2007-01-01

The concept of F-algebra and its representation can be extended to an arbitrary bundle. We define operations of fibered F-algebra in fiber. The paper presents the representation theory of of fibered F-algebra as well as a comparison of representation of F-algebra and of representation of fibered F-algebra.

Quasi-superconformal algebras in two dimensions and hamiltonian reduction

International Nuclear Information System (INIS)

Romans, L.J.

1991-01-01

In the standard quantum hamiltonian reduction, constraining the SL(3, R) WZNW model leads to a model of Zamolodchikov's W 3 -symmetry. In recent work, Polyakov and Bershadsky have considered an alternative reduction which leads to a new algebra, W 3 2 , a nonlinear extension of the Virasoro algebra by a spin-1 current and two bosonic spin-3/2 currents. Motivated by this result, we display two new infinite series of nonlinear extended conformal algebras, containing 2N bosonic spin-3/2 currents and spin-1 Kac-Moody currents for either U(N) or Sp(2 N); the W 3 2 algebra appears as the N = 1 member of the U(N) series. We discuss the relationship between these algebras and the Knizhnik-Bershadsky superconformal algebras, and provide realisations in terms of free fields coupled to Kac-Moody currents. We propose a specific procedure for obtaining the algebras for general N through hamiltonian reduction. (orig.)

SoS contract verification using statistical model checking

Directory of Open Access Journals (Sweden)

Alessandro Mignogna

2013-11-01

Full Text Available Exhaustive formal verification for systems of systems (SoS is impractical and cannot be applied on a large scale. In this paper we propose to use statistical model checking for efficient verification of SoS. We address three relevant aspects for systems of systems: 1 the model of the SoS, which includes stochastic aspects; 2 the formalization of the SoS requirements in the form of contracts; 3 the tool-chain to support statistical model checking for SoS. We adapt the SMC technique for application to heterogeneous SoS. We extend the UPDM/SysML specification language to express the SoS requirements that the implemented strategies over the SoS must satisfy. The requirements are specified with a new contract language specifically designed for SoS, targeting a high-level English- pattern language, but relying on an accurate semantics given by the standard temporal logics. The contracts are verified against the UPDM/SysML specification using the Statistical Model Checker (SMC PLASMA combined with the simulation engine DESYRE, which integrates heterogeneous behavioral models through the functional mock-up interface (FMI standard. The tool-chain allows computing an estimation of the satisfiability of the contracts by the SoS. The results help the system architect to trade-off different solutions to guide the evolution of the SoS.

Construction of the K=8 fractional superconformal algebras

International Nuclear Information System (INIS)

Argyres, P.C.; Grochocinski, J.M.; Tye, S.H.H.

1993-01-01

We construct the K=8 fractional superconformal algebras. There are two such extended Virasoro algebras, one of which was constructed earlier, involving a fractional spin (equivalently, conformal dimension) 6/5 current. The new algebra involves two additional fractional spin currents with spin 13/5. Both algebras are non-local and satisfy non-abelian braiding relations. The construction of the algebras uses the ismorphism between the Z 8 parafermion theory and the tensor product of two tricritical Ising models. For the special value of the central charge c=52/55, corresponding to the eighth member of the unitary minimal series, the 13/5 currents of the new algebra decouple, while two spin 23/5 currents (level-2 current algebra descendants of the 13/5 currents) emerge. In addition, it is shown that the K=8 algebra involving the spin 13/5 currents at central charge c=12/5 is the appropriate algebra for the construction of the K=8 (four-dimensional) fractional superstring. (orig.)

Checking Fine and Gray subdistribution hazards model with cumulative sums of residuals

DEFF Research Database (Denmark)

Li, Jianing; Scheike, Thomas; Zhang, Mei Jie

2015-01-01

Recently, Fine and Gray (J Am Stat Assoc 94:496–509, 1999) proposed a semi-parametric proportional regression model for the subdistribution hazard function which has been used extensively for analyzing competing risks data. However, failure of model adequacy could lead to severe bias in parameter...... estimation, and only a limited contribution has been made to check the model assumptions. In this paper, we present a class of analytical methods and graphical approaches for checking the assumptions of Fine and Gray’s model. The proposed goodness-of-fit test procedures are based on the cumulative sums...

Construction Example for Algebra System Using Harmony Search Algorithm

Directory of Open Access Journals (Sweden)

FangAn Deng

2015-01-01

Full Text Available The construction example of algebra system is to verify the existence of a complex algebra system, and it is a NP-hard problem. In this paper, to solve this kind of problems, firstly, a mathematical optimization model for construction example of algebra system is established. Secondly, an improved harmony search algorithm based on NGHS algorithm (INGHS is proposed to find as more solutions as possible for the optimization model; in the proposed INGHS algorithm, to achieve the balance between exploration power and exploitation power in the search process, a global best strategy and parameters dynamic adjustment method are present. Finally, nine construction examples of algebra system are used to evaluate the optimization model and performance of INGHS. The experimental results show that the proposed algorithm has strong performance for solving complex construction example problems of algebra system.

HyLTL: a temporal logic for model checking hybrid systems

Directory of Open Access Journals (Sweden)

Davide Bresolin

2013-08-01

Full Text Available The model-checking problem for hybrid systems is a well known challenge in the scientific community. Most of the existing approaches and tools are limited to safety properties only, or operates by transforming the hybrid system to be verified into a discrete one, thus loosing information on the continuous dynamics of the system. In this paper we present a logic for specifying complex properties of hybrid systems called HyLTL, and we show how it is possible to solve the model checking problem by translating the formula into an equivalent hybrid automaton. In this way the problem is reduced to a reachability problem on hybrid automata that can be solved by using existing tools.

Algebraic monoids, group embeddings, and algebraic combinatorics

CERN Document Server

Li, Zhenheng; Steinberg, Benjamin; Wang, Qiang

2014-01-01

This book contains a collection of fifteen articles and is dedicated to the sixtieth birthdays of Lex Renner and Mohan Putcha, the pioneers of the field of algebraic monoids.   Topics presented include:   v  structure and representation theory of reductive algebraic monoids v  monoid schemes and applications of monoids v  monoids related to Lie theory v  equivariant embeddings of algebraic groups v  constructions and properties of monoids from algebraic combinatorics v  endomorphism monoids induced from vector bundles v  Hodge–Newton decompositions of reductive monoids   A portion of these articles are designed to serve as a self-contained introduction to these topics, while the remaining contributions are research articles containing previously unpublished results, which are sure to become very influential for future work. Among these, for example, the important recent work of Michel Brion and Lex Renner showing that the algebraic semigroups are strongly π-regular.   Graduate students as well a...

Applied matrix algebra in the statistical sciences

CERN Document Server

Basilevsky, Alexander

2005-01-01

This comprehensive text offers teachings relevant to both applied and theoretical branches of matrix algebra and provides a bridge between linear algebra and statistical models. Appropriate for advanced undergraduate and graduate students. 1983 edition.

A division algebra classification of generalized supersymmetries

International Nuclear Information System (INIS)

Toppan, Francesco

2004-10-01

Generalized supersymmetries admitting bosonic tensor central charges are classified in accordance with their division algebra properties. Division algebra consistent constraints lead (in the complex and quaternionic cases) to the classes of hermitian and holomorphic generalized supersymmetries. Applications to the analytic continuation of the M-algebra to the Euclidean and the systematic investigation of certain classes of models in generic space-times are briefly mentioned. (author)

Leavitt path algebras

CERN Document Server

Abrams, Gene; Siles Molina, Mercedes

2017-01-01

This book offers a comprehensive introduction by three of the leading experts in the field, collecting fundamental results and open problems in a single volume. Since Leavitt path algebras were first defined in 2005, interest in these algebras has grown substantially, with ring theorists as well as researchers working in graph C*-algebras, group theory and symbolic dynamics attracted to the topic. Providing a historical perspective on the subject, the authors review existing arguments, establish new results, and outline the major themes and ring-theoretic concepts, such as the ideal structure, Z-grading and the close link between Leavitt path algebras and graph C*-algebras. The book also presents key lines of current research, including the Algebraic Kirchberg Phillips Question, various additional classification questions, and connections to noncommutative algebraic geometry. Leavitt Path Algebras will appeal to graduate students and researchers working in the field and related areas, such as C*-algebras and...

Model checking software for phylogenetic trees using distribution and database methods

Directory of Open Access Journals (Sweden)

Requeno José Ignacio

2013-12-01

Full Text Available Model checking, a generic and formal paradigm stemming from computer science based on temporal logics, has been proposed for the study of biological properties that emerge from the labeling of the states defined over the phylogenetic tree. This strategy allows us to use generic software tools already present in the industry. However, the performance of traditional model checking is penalized when scaling the system for large phylogenies. To this end, two strategies are presented here. The first one consists of partitioning the phylogenetic tree into a set of subgraphs each one representing a subproblem to be verified so as to speed up the computation time and distribute the memory consumption. The second strategy is based on uncoupling the information associated to each state of the phylogenetic tree (mainly, the DNA sequence and exporting it to an external tool for the management of large information systems. The integration of all these approaches outperforms the results of monolithic model checking and helps us to execute the verification of properties in a real phylogenetic tree.

Open-closed homotopy algebra in mathematical physics

International Nuclear Information System (INIS)

Kajiura, Hiroshige; Stasheff, Jim

2006-01-01

In this paper we discuss various aspects of open-closed homotopy algebras (OCHAs) presented in our previous paper, inspired by Zwiebach's open-closed string field theory, but that first paper concentrated on the mathematical aspects. Here we show how an OCHA is obtained by extracting the tree part of Zwiebach's quantum open-closed string field theory. We clarify the explicit relation of an OCHA with Kontsevich's deformation quantization and with the B-models of homological mirror symmetry. An explicit form of the minimal model for an OCHA is given as well as its relation to the perturbative expansion of open-closed string field theory. We show that our open-closed homotopy algebra gives us a general scheme for deformation of open string structures (A ∞ algebras) by closed strings (L ∞ algebras)

A process algebra software engineering environment

NARCIS (Netherlands)

Diertens, B.

2008-01-01

In previous work we described how the process algebra based language PSF can be used in software engineering, using the ToolBus, a coordination architecture also based on process algebra, as implementation model. In this article we summarize that work and describe the software development process

An effective automatic procedure for testing parameter identifiability of HIV/AIDS models.

Science.gov (United States)

Saccomani, Maria Pia

2011-08-01

Realistic HIV models tend to be rather complex and many recent models proposed in the literature could not yet be analyzed by traditional identifiability testing techniques. In this paper, we check a priori global identifiability of some of these nonlinear HIV models taken from the recent literature, by using a differential algebra algorithm based on previous work of the author. The algorithm is implemented in a software tool, called DAISY (Differential Algebra for Identifiability of SYstems), which has been recently released (DAISY is freely available on the web site http://www.dei.unipd.it/~pia/ ). The software can be used to automatically check global identifiability of (linear and) nonlinear models described by polynomial or rational differential equations, thus providing a general and reliable tool to test global identifiability of several HIV models proposed in the literature. It can be used by researchers with a minimum of mathematical background.

Form factors in sinh- and sine-Gordon models, deformed Virasoro algebra, Macdonald polynomials and resonance identities

International Nuclear Information System (INIS)

Lashkevich, Michael; Pugai, Yaroslav

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 [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

Phase Two Feasibility Study for Software Safety Requirements Analysis Using Model Checking

Science.gov (United States)

Turgeon, Gregory; Price, Petra

2010-01-01

A feasibility study was performed on a representative aerospace system to determine the following: (1) the benefits and limitations to using SCADE , a commercially available tool for model checking, in comparison to using a proprietary tool that was studied previously [1] and (2) metrics for performing the model checking and for assessing the findings. This study was performed independently of the development task by a group unfamiliar with the system, providing a fresh, external perspective free from development bias.

Approximation of complex algebraic numbers by algebraic numbers of bounded degree

OpenAIRE

Bugeaud, Yann; Evertse, Jan-Hendrik

2007-01-01

We investigate how well complex algebraic numbers can be approximated by algebraic numbers of degree at most n. We also investigate how well complex algebraic numbers can be approximated by algebraic integers of degree at most n+1. It follows from our investigations that for every positive integer n there are complex algebraic numbers of degree larger than n that are better approximable by algebraic numbers of degree at most n than almost all complex numbers. As it turns out, these numbers ar...

Model checking as an aid to procedure design

International Nuclear Information System (INIS)

Zhang, Wenhu

2001-01-01

The OECD Halden Reactor Project has been actively working on computer assisted operating procedures for many years. The objective of the research has been to provide computerised assistance for procedure design, verification and validation, implementation and maintenance. For the verification purpose, the application of formal methods has been considered in several reports. The recent formal verification activity conducted at the Halden Project is based on using model checking to the verification of procedures. This report presents verification approaches based on different model checking techniques and tools for the formalization and verification of operating procedures. Possible problems and relative merits of the different approaches are discussed. A case study of one of the approaches is presented to show the practical application of formal verification. Application of formal verification in the traditional procedure design process can reduce the human resources involved in reviews and simulations, and hence reduce the cost of verification and validation. A discussion of the integration of the formal verification with the traditional procedure design process is given at the end of this report. (Author)

Operadic formulation of topological vertex algebras and gerstenhaber or Batalin-Vilkovisky algebras

International Nuclear Information System (INIS)

Huang Yizhi

1994-01-01

We give the operadic formulation of (weak, strong) topological vertex algebras, which are variants of topological vertex operator algebras studied recently by Lian and Zuckerman. As an application, we obtain a conceptual and geometric construction of the Batalin-Vilkovisky algebraic structure (or the Gerstenhaber algebra structure) on the cohomology of a topological vertex algebra (or of a weak topological vertex algebra) by combining this operadic formulation with a theorem of Getzler (or of Cohen) which formulates Batalin-Vilkovisky algebras (or Gerstenhaber algebras) in terms of the homology of the framed little disk operad (or of the little disk operad). (orig.)

Bootstrapping non-commutative gauge theories from L∞ algebras

Science.gov (United States)

Blumenhagen, Ralph; Brunner, Ilka; Kupriyanov, Vladislav; Lüst, Dieter

2018-05-01

Non-commutative gauge theories with a non-constant NC-parameter are investigated. As a novel approach, we propose that such theories should admit an underlying L∞ algebra, that governs not only the action of the symmetries but also the dynamics of the theory. Our approach is well motivated from string theory. We recall that such field theories arise in the context of branes in WZW models and briefly comment on its appearance for integrable deformations of AdS5 sigma models. For the SU(2) WZW model, we show that the earlier proposed matrix valued gauge theory on the fuzzy 2-sphere can be bootstrapped via an L∞ algebra. We then apply this approach to the construction of non-commutative Chern-Simons and Yang-Mills theories on flat and curved backgrounds with non-constant NC-structure. More concretely, up to the second order, we demonstrate how derivative and curvature corrections to the equations of motion can be bootstrapped in an algebraic way from the L∞ algebra. The appearance of a non-trivial A∞ algebra is discussed, as well.

Methods to model-check parallel systems software

International Nuclear Information System (INIS)

Matlin, O. S.; McCune, W.; Lusk, E.

2003-01-01

We report on an effort to develop methodologies for formal verification of parts of the Multi-Purpose Daemon (MPD) parallel process management system. MPD is a distributed collection of communicating processes. While the individual components of the collection execute simple algorithms, their interaction leads to unexpected errors that are difficult to uncover by conventional means. Two verification approaches are discussed here: the standard model checking approach using the software model checker SPIN and the nonstandard use of a general-purpose first-order resolution-style theorem prover OTTER to conduct the traditional state space exploration. We compare modeling methodology and analyze performance and scalability of the two methods with respect to verification of MPD

The Moyal momentum algebra applied to θ-deformed 2d conformal models and KdV-hierarchies

International Nuclear Information System (INIS)

Boulahoual, A.; Sedra, M.B.

2002-08-01

The properties of the Das-Popowicz Moyal momentum algebra that we introduce in hep-th/0207242 are reexamined in detail 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 -Σ-tilde n (0,n) to construct the sl 2 -Liouville conformal model δδ-barΦ=2/θe -1/θΦ and its sl 3 -Toda extension δδ-bar 1 =Ae -1/2θ(Φ 1 +1/2Φ 2 ) and δδ-barΦ 2 =Be -1/2 / θ (Φ 1 +2Φ 2 ) . We also show that the central charge, a la Feigin-Fuchs, associated to the spin-2 conformal current of the θ-Liouville model is given by c θ =(1+24θ 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 also discuss the primarily condition of conformal w θ -currents and interpret this condition as being a dressing gauge symmetry in the Moyal momentum space. Some computations related to the dressing gauge group are explicitly presented. (author)

Boundary Lax pairs from non-ultra-local Poisson algebras

International Nuclear Information System (INIS)

Avan, Jean; Doikou, Anastasia

2009-01-01

We consider non-ultra-local linear Poisson algebras on a continuous line. Suitable combinations of representations of these algebras yield representations of novel generalized linear Poisson algebras or 'boundary' extensions. They are parametrized by a boundary scalar matrix and depend, in addition, on the choice of an antiautomorphism. The new algebras are the classical-linear counterparts of the known quadratic quantum boundary algebras. For any choice of parameters, the non-ultra-local contribution of the original Poisson algebra disappears. We also systematically construct the associated classical Lax pair. The classical boundary principal chiral model is examined as a physical example.

Thin-layer approximation and algebraic model for separated turbulent flows

Science.gov (United States)

Baldwin, B.; Lomax, H.

1978-01-01

An algebraic turbulence model for two- and three-dimensional separated flows is specified that avoids the necessity for finding the edge of the boundary layer. Properties of the model are determined and comparisons made with experiment for an incident shock on a flat plate, separated flow over a compression corner, and transonic flow over an airfoil. Separation and reattachment points from numerical Navier-Stokes solutions agree with experiment within one boundary-layer thickness. Use of law-of-the-wall boundary conditions does not alter the predictions significantly. Applications of the model to other cases are contained in companion papers.

Symbolic Game Semantics for Model Checking Program Families

DEFF Research Database (Denmark)

Dimovski, Aleksandar

2016-01-01

represent program families with infinite integers as so-called (finite-state) featured symbolic automata. Specifically designed model checking algorithms are then employed to verify safety of all programs from a family at once and pinpoint those programs that are unsafe (respectively, safe). We present...... a prototype tool implementing this approach, and we illustrate it with several examples....

Wn(2) algebras

International Nuclear Information System (INIS)

Feigin, B.L.; Semikhatov, A.M.

2004-01-01

We construct W-algebra generalizations of the sl-circumflex(2) algebra-W algebras W n (2) generated by two currents E and F with the highest pole of order n in their OPE. The n=3 term in this series is the Bershadsky-Polyakov W 3 (2) algebra. We define these algebras as a centralizer (commutant) of the Uqs-bar (n vertical bar 1) quantum supergroup and explicitly find the generators in a factored, 'Miura-like' form. Another construction of the W n (2) algebras is in terms of the coset sl-circumflex(n vertical bar 1)/sl-circumflex(n). The relation between the two constructions involves the 'duality' (k+n-1)(k'+n-1)=1 between levels k and k' of two sl-circumflex(n) algebras

Model checking: one can do much more than you think!

NARCIS (Netherlands)

Katoen, Joost P.

2012-01-01

Model checking is an automated verification technique that actively is applied to find bugs in hardware and software designs. Companies like IBM and Cadence developed their in-house model checkers, and acted as driving forces behind the design of the IEEE-standardized temporal logic PSL. On the

Bayesian inference with information content model check for Langevin equations

DEFF Research Database (Denmark)

Krog, Jens F. C.; Lomholt, Michael Andersen

2017-01-01

The Bayesian data analysis framework has been proven to be a systematic and effective method of parameter inference and model selection for stochastic processes. In this work we introduce an information content model check which may serve as a goodness-of-fit, like the chi-square procedure...

Requirements-level semantics and model checking of object-oriented statecharts

NARCIS (Netherlands)

Eshuis, H.; Jansen, D.N.; Wieringa, Roelf J.

2002-01-01

In this paper we define a requirements-level execution semantics for object-oriented statecharts and show how properties of a system specified by these statecharts can be model checked using tool support for model checkers. Our execution semantics is requirements-level because it uses the perfect

Computing algebraic transfer entropy and coupling directions via transcripts

Science.gov (United States)

Amigó, José M.; Monetti, Roberto; Graff, Beata; Graff, Grzegorz

2016-11-01

Most random processes studied in nonlinear time series analysis take values on sets endowed with a group structure, e.g., the real and rational numbers, and the integers. This fact allows to associate with each pair of group elements a third element, called their transcript, which is defined as the product of the second element in the pair times the first one. The transfer entropy of two such processes is called algebraic transfer entropy. It measures the information transferred between two coupled processes whose values belong to a group. In this paper, we show that, subject to one constraint, the algebraic transfer entropy matches the (in general, conditional) mutual information of certain transcripts with one variable less. This property has interesting practical applications, especially to the analysis of short time series. We also derive weak conditions for the 3-dimensional algebraic transfer entropy to yield the same coupling direction as the corresponding mutual information of transcripts. A related issue concerns the use of mutual information of transcripts to determine coupling directions in cases where the conditions just mentioned are not fulfilled. We checked the latter possibility in the lowest dimensional case with numerical simulations and cardiovascular data, and obtained positive results.

Drinfeld currents of dynamical elliptic algebra

International Nuclear Information System (INIS)

Hou Boyu; Fan Heng; Yang Wenli; Cao Junpeng

2000-01-01

From the generalized Yang-Baxter relations RLL=LLR*, where R and R* are the dynamical R-matrix of A n-1 (1) type face model with the elliptic module shifted by the center of the algebra, using the Ding-Frenkel correspondence, the authors obtain the Drinfeld currents of dynamical elliptic algebra

Experimental Tests of the Algebraic Cluster Model

Science.gov (United States)

Gai, Moshe

2018-02-01

The Algebraic Cluster Model (ACM) of Bijker and Iachello that was proposed already in 2000 has been recently applied to 12C and 16O with much success. We review the current status in 12C with the outstanding observation of the ground state rotational band composed of the spin-parity states of: 0+, 2+, 3-, 4± and 5-. The observation of the 4± parity doublet is a characteristic of (tri-atomic) molecular configuration where the three alpha- particles are arranged in an equilateral triangular configuration of a symmetric spinning top. We discuss future measurement with electron scattering, 12C(e,e’) to test the predicted B(Eλ) of the ACM.

The vacuum preserving Lie algebra of a classical W-algebra

International Nuclear Information System (INIS)

Feher, L.; Tsutsui, I.

1993-07-01

We simplify and generalize an argument due to Bowcock and Watts showing that one can associate a finite Lie algebra (the 'classical vacuum preserving algebra') containing the Moebius sl(2) subalgebra to any classical W-algebra. Our construction is based on a kinematical analysis of the Poisson brackets of quasi-fields. In the case of the W S G -subalgebra S of a simple Lie algebra G, we exhibit a natural isomorphism between this finite Lie algebra and G whereby the Moebius sl(2) is identified with S. (orig.)

Nonflexible Lie-admissible algebras

International Nuclear Information System (INIS)

Myung, H.C.

1978-01-01

We discuss the structure of Lie-admissible algebras which are defined by nonflexible identities. These algebras largely arise from the antiflexible algebras, 2-varieties and associator dependent algebras. The nonflexible Lie-admissible algebras in our discussion are in essence byproducts of the study of nonassociative algebras defined by identities of degree 3. The main purpose is to discuss the classification of simple Lie-admissible algebras of nonflexible type

On 2-Banach algebras

International Nuclear Information System (INIS)

Mohammad, N.; Siddiqui, A.H.

1987-11-01

The notion of a 2-Banach algebra is introduced and its structure is studied. After a short discussion of some fundamental properties of bivectors and tensor product, several classical results of Banach algebras are extended to the 2-Banach algebra case. A condition under which a 2-Banach algebra becomes a Banach algebra is obtained and the relation between algebra of bivectors and 2-normed algebra is discussed. 11 refs

The Model Method: Singapore Children's Tool for Representing and Solving Algebraic Word Problems

Science.gov (United States)

Ng, Swee Fong; Lee, Kerry

2009-01-01

Solving arithmetic and algebraic word problems is a key component of the Singapore elementary mathematics curriculum. One heuristic taught, the model method, involves drawing a diagram to represent key information in the problem. We describe the model method and a three-phase theoretical framework supporting its use. We conducted 2 studies to…

Algebra

CERN Document Server

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

Representation theory of lattice current algebras

International Nuclear Information System (INIS)

Alekseev, A.Yu.; Eidgenoessische Technische Hochschule, Zurich; Faddeev, L.D.; Froehlich, L.D.; Schomerus, V.; Kyoto Univ.

1996-04-01

Lattice current algebras were introduced as a regularization of the left-and right moving degrees of freedom in the WZNW model. They provide examples of lattice theories with a local quantum symmetry U q (G). Their representation theory is studied in detail. In particular, we construct all irreducible representations along with a lattice analogue of the fusion product for representations of the lattice current algebra. It is shown that for an arbitrary number of lattice sites, the representation categories of the lattice current algebras agree with their continuum counterparts. (orig.)

Model checking conditional CSL for continuous-time Markov chains

DEFF Research Database (Denmark)

Gao, Yang; Xu, Ming; Zhan, Naijun

2013-01-01

In this paper, we consider the model-checking problem of continuous-time Markov chains (CTMCs) with respect to conditional logic. To the end, we extend Continuous Stochastic Logic introduced in Aziz et al. (2000) [1] to Conditional Continuous Stochastic Logic (CCSL) by introducing a conditional...

Methods of mathematical modeling using polynomials of algebra of sets

Science.gov (United States)

Kazanskiy, Alexandr; Kochetkov, Ivan

2018-03-01

The article deals with the construction of discrete mathematical models for solving applied problems arising from the operation of building structures. Security issues in modern high-rise buildings are extremely serious and relevant, and there is no doubt that interest in them will only increase. The territory of the building is divided into zones for which it is necessary to observe. Zones can overlap and have different priorities. Such situations can be described using formulas algebra of sets. Formulas can be programmed, which makes it possible to work with them using computer models.

Equations of motion for a spectrum-generating algebra: Lipkin-Meshkov-Glick model

International Nuclear Information System (INIS)

Rosensteel, G; Rowe, D J; Ho, S Y

2008-01-01

For a spectrum-generating Lie algebra, a generalized equations-of-motion scheme determines numerical values of excitation energies and algebra matrix elements. In the approach to the infinite particle number limit or, more generally, whenever the dimension of the quantum state space is very large, the equations-of-motion method may achieve results that are impractical to obtain by diagonalization of the Hamiltonian matrix. To test the method's effectiveness, we apply it to the well-known Lipkin-Meshkov-Glick (LMG) model to find its low-energy spectrum and associated generator matrix elements in the eigenenergy basis. When the dimension of the LMG representation space is 10 6 , computation time on a notebook computer is a few minutes. For a large particle number in the LMG model, the low-energy spectrum makes a quantum phase transition from a nondegenerate harmonic vibrator to a twofold degenerate harmonic oscillator. The equations-of-motion method computes critical exponents at the transition point

Little strings, quasi-topological sigma model on loop group, and toroidal Lie algebras

Directory of Open Access Journals (Sweden)

Meer Ashwinkumar

2018-03-01

Full Text Available We study the ground states and left-excited states of the Ak−1 N=(2,0 little string theory. Via a theorem by Atiyah [1], these sectors can be captured by a supersymmetric nonlinear sigma model on CP1 with target space the based loop group of SU(k. The ground states, described by L2-cohomology classes, form modules over an affine Lie algebra, while the left-excited states, described by chiral differential operators, form modules over a toroidal Lie algebra. We also apply our results to analyze the 1/2 and 1/4 BPS sectors of the M5-brane worldvolume theory.

Little strings, quasi-topological sigma model on loop group, and toroidal Lie algebras

Science.gov (United States)

Ashwinkumar, Meer; Cao, Jingnan; Luo, Yuan; Tan, Meng-Chwan; Zhao, Qin

2018-03-01

We study the ground states and left-excited states of the Ak-1 N = (2 , 0) little string theory. Via a theorem by Atiyah [1], these sectors can be captured by a supersymmetric nonlinear sigma model on CP1 with target space the based loop group of SU (k). The ground states, described by L2-cohomology classes, form modules over an affine Lie algebra, while the left-excited states, described by chiral differential operators, form modules over a toroidal Lie algebra. We also apply our results to analyze the 1/2 and 1/4 BPS sectors of the M5-brane worldvolume theory.

Lukasiewicz-Moisil algebras

CERN Document Server

Boicescu, V; Georgescu, G; Rudeanu, S

1991-01-01

The Lukasiewicz-Moisil algebras were created by Moisil as an algebraic counterpart for the many-valued logics of Lukasiewicz. The theory of LM-algebras has developed to a considerable extent both as an algebraic theory of intrinsic interest and in view of its applications to logic and switching theory.This book gives an overview of the theory, comprising both classical results and recent contributions, including those of the authors. N-valued and &THgr;-valued algebras are presented, as well as &THgr;-algebras with negation.Mathematicians interested in lattice theory or symbolic logic, and computer scientists, will find in this monograph stimulating material for further research.

Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks

DEFF Research Database (Denmark)

Fehr, Serge; Maurer, Ueli M.

2002-01-01

. VSS and DC are main building blocks for unconditional secure multi-party computation protocols. This general approach covers all known linear VSS and DC schemes. The main theorem states that the security of a scheme is equivalent to a pure linear-algebra condition on the linear mappings (e.......g. described as matrices and vectors) describing the scheme. The security of all known schemes follows as corollaries whose proofs are pure linear-algebra arguments, in contrast to some hybrid arguments used in the literature. Our approach is demonstrated for the CDM DC scheme, which we generalize to be secure......We present a general treatment of all non-cryptographic (i.e., information-theoretically secure) linear veriable-secret-sharing (VSS) and distributed-commitment (DC) schemes, based on an underlying secret sharing scheme, pairwise checks between players, complaints, and accusations of the dealer...

Identification of control targets in Boolean molecular network models via computational algebra.

Science.gov (United States)

Murrugarra, David; Veliz-Cuba, Alan; Aguilar, Boris; Laubenbacher, Reinhard

2016-09-23

Many problems in biomedicine and other areas of the life sciences can be characterized as control problems, with the goal of finding strategies to change a disease or otherwise undesirable state of a biological system into another, more desirable, state through an intervention, such as a drug or other therapeutic treatment. The identification of such strategies is typically based on a mathematical model of the process to be altered through targeted control inputs. This paper focuses on processes at the molecular level that determine the state of an individual cell, involving signaling or gene regulation. The mathematical model type considered is that of Boolean networks. The potential control targets can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. This paper presents a method for the identification of potential intervention targets in Boolean molecular network models using algebraic techniques. The approach exploits an algebraic representation of Boolean networks to encode the control candidates in the network wiring diagram as the solutions of a system of polynomials equations, and then uses computational algebra techniques to find such controllers. The control methods in this paper are validated through the identification of combinatorial interventions in the signaling pathways of previously reported control targets in two well studied systems, a p53-mdm2 network and a blood T cell lymphocyte granular leukemia survival signaling network. Supplementary data is available online and our code in Macaulay2 and Matlab are available via http://www.ms.uky.edu/~dmu228/ControlAlg . This paper presents a novel method for the identification of intervention targets in Boolean network models. The results in this paper show that the proposed methods are useful and efficient for moderately large networks.

Abstract Algebra for Algebra Teaching: Influencing School Mathematics Instruction

Science.gov (United States)

Wasserman, Nicholas H.

2016-01-01

This article explores the potential for aspects of abstract algebra to be influential for the teaching of school algebra (and early algebra). Using national standards for analysis, four primary areas common in school mathematics--and their progression across elementary, middle, and secondary mathematics--where teaching may be transformed by…

A Novel Algorithm for Intrusion Detection Based on RASL Model Checking

Directory of Open Access Journals (Sweden)

Weijun Zhu

2013-01-01

Full Text Available The interval temporal logic (ITL model checking (MC technique enhances the power of intrusion detection systems (IDSs to detect concurrent attacks due to the strong expressive power of ITL. However, an ITL formula suffers from difficulty in the description of the time constraints between different actions in the same attack. To address this problem, we formalize a novel real-time interval temporal logic—real-time attack signature logic (RASL. Based on such a new logic, we put forward a RASL model checking algorithm. Furthermore, we use RASL formulas to describe attack signatures and employ discrete timed automata to create an audit log. As a result, RASL model checking algorithm can be used to automatically verify whether the automata satisfy the formulas, that is, whether the audit log coincides with the attack signatures. The simulation experiments show that the new approach effectively enhances the detection power of the MC-based intrusion detection methods for a number of telnet attacks, p-trace attacks, and the other sixteen types of attacks. And these experiments indicate that the new algorithm can find several types of real-time attacks, whereas the existing MC-based intrusion detection approaches cannot do that.

PENERAPAN MODEL PEMBELAJARAN KOOPERATIF TIPE PAIR CHECKS PEMECAHAN MASALAH UNTUK MENINGKATKAN SOCIAL SKILL SISWA

Directory of Open Access Journals (Sweden)

R. Lestari

2012-07-01

Full Text Available Tujuan penelitian tindakan kelas ini untuk mengetahui pengaruh proses pembelajaran dengan menggunakan model pembelajaran kooperatif tipe Pair Checks pemecahan masalah terhadap peningkatan social skill siswa. Pada proses penerapan model pembelajaran kooperatif tipe Pair Checks pemecahan masalah siswa dibagi dalam kelompok-kelompok dan satu kelompok terdiri dari dua orang. Setiap kelompok berdiskusi untuk menyelesaikan suatu masalah, kemudian hasil diskusi kelompok akan dicek oleh pasangan dari kelompok lain. Metode Penelitian yang digunakan adalah penelitian tindakan kelas yang dilaksanakan dua siklus. Metode pengumpulan data menggunakan tes dan angket skala sikap, sedangkan teknik analisis data menggunakan teknik analisis data kuantitatif. Social Skill siswa dari siklus I ke siklus II mengalami peningkatan. Hal ini didapatkan dari data angket skala sikap siklus I ke siklus II ketuntasan klasikalnya meningkat dan sebagian besar siswa sudah memiliki social skill yang baik. Hasil belajar kognitif siswa juga mengalami peningkatan. Model pembelajaran kooperatif tipe Pair Checks pemecahan masalah dapat meningkatkan social skill siswa.This two cycles-action research aimed to know learning process applying cooperative learning model-pair checks problem solving type and improvement of student’s social skills. The process of the model was as follows: deviding students into some groups consisting of two students, solving problem by each group and checking result of the discussion by other groups. Data collection method used was test and the use of attitude scale questionnaire, while technique of data analysis used was quantitative data analysis technique. The data analysis result showed that there was an increase of student’s social skill and students’ achievement from cycle one to two. It is concluded that cooperative learning model-pair checks problem solving type can enhance student’s social skills

Mathematical Modelling and the Learning Trajectory: Tools to Support the Teaching of Linear Algebra

Science.gov (United States)

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…

The Boolean algebra and central Galois algebras

Directory of Open Access Journals (Sweden)

George Szeto

2001-01-01

Full Text Available Let B be a Galois algebra with Galois group G, Jg={b∈B∣bx=g(xb   for all   x∈B} for g∈G, and BJg=Beg for a central idempotent eg. Then a relation is given between the set of elements in the Boolean algebra (Ba,≤ generated by {0,eg∣g∈G} and a set of subgroups of G, and a central Galois algebra Be with a Galois subgroup of G is characterized for an e∈Ba.

Abstraction and Model Checking in the PEPA Plug-in for Eclipse

DEFF Research Database (Denmark)

Smith, Michael James Andrew

2010-01-01

lead to very large Markov chains. One way of analysing such models is to use abstraction - constructing a smaller model that bounds the properties of the original. We present an extension to the PEPA plug-in for Eclipse that enables abstracting and model checking of PEPA models. This implements two new...

Model Checking and Model-based Testing in the Railway Domain

DEFF Research Database (Denmark)

Haxthausen, Anne Elisabeth; Peleska, Jan

2015-01-01

This chapter describes some approaches and emerging trends for verification and model-based testing of railway control systems. We describe state-of-the-art methods and associated tools for verifying interlocking systems and their configuration data, using bounded model checking and k...... with good test strength are explained. Interlocking systems represent just one class of many others, where concrete system instances are created from generic representations, using configuration data for determining the behaviour of the instances. We explain how the systematic transition from generic...... to concrete instances in the development path is complemented by associated transitions in the verification and testing paths....

Wavelets and quantum algebras

International Nuclear Information System (INIS)

Ludu, A.; Greiner, M.

1995-09-01

A non-linear associative algebra is realized in terms of translation and dilation operators, and a wavelet structure generating algebra is obtained. We show that this algebra is a q-deformation of the Fourier series generating algebra, and reduces to this for certain value of the deformation parameter. This algebra is also homeomorphic with the q-deformed su q (2) algebra and some of its extensions. Through this algebraic approach new methods for obtaining the wavelets are introduced. (author). 20 refs

Hopf algebras and topological recursion

International Nuclear Information System (INIS)

Esteves, João N

2015-01-01

We consider a model for topological recursion based on the Hopf algebra of planar binary trees defined by Loday and Ronco (1998 Adv. Math. 139 293–309 We show that extending this Hopf algebra by identifying pairs of nearest neighbor leaves, and thus producing graphs with loops, we obtain the full recursion formula discovered by Eynard and Orantin (2007 Commun. Number Theory Phys. 1 347–452). (paper)

Novikov-Jordan algebras

OpenAIRE

Dzhumadil'daev, A. S.

2002-01-01

Algebras with identity $(a\\star b)\\star (c\\star d) -(a\\star d)\\star(c\\star b)$ $=(a,b,c)\\star d-(a,d,c)\\star b$ are studied. Novikov algebras under Jordan multiplication and Leibniz dual algebras satisfy this identity. If algebra with such identity has unit, then it is associative and commutative.

Using Linear Algebra to Introduce Computer Algebra, Numerical Analysis, Data Structures and Algorithms (and To Teach Linear Algebra, Too).

Science.gov (United States)

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)

Model based feasibility study on bidirectional check valves in wave energy converters

DEFF Research Database (Denmark)

Hansen, Anders Hedegaard; Pedersen, Henrik C.; Andersen, Torben Ole

2014-01-01

Discrete fluid power force systems have been proposed as the primary stage for Wave Energy Converters (WEC’s) when converting ocean waves into electricity, this to improve the overall efficiency of wave energy devices. This paper presents a model based feasibility study of using bidirectional check....../Off and bidirectional check valves. Based on the analysis it is found that the energy production may be slightly improved by using bidirectional check valves as compared to on/off valves, due to a decrease in switching losses. Furthermore a reduction in high flow peaks are realised. The downside being increased...

(Quasi-)Poisson enveloping algebras

OpenAIRE

Yang, Yan-Hong; Yao, Yuan; Ye, Yu

2010-01-01

We introduce the quasi-Poisson enveloping algebra and Poisson enveloping algebra for a non-commutative Poisson algebra. We prove that for a non-commutative Poisson algebra, the category of quasi-Poisson modules is equivalent to the category of left modules over its quasi-Poisson enveloping algebra, and the category of Poisson modules is equivalent to the category of left modules over its Poisson enveloping algebra.

Iterated Leavitt Path Algebras

International Nuclear Information System (INIS)

Hazrat, R.

2009-11-01

Leavitt path algebras associate to directed graphs a Z-graded algebra and in their simplest form recover the Leavitt algebras L(1,k). In this note, we introduce iterated Leavitt path algebras associated to directed weighted graphs which have natural ± Z grading and in their simplest form recover the Leavitt algebras L(n,k). We also characterize Leavitt path algebras which are strongly graded. (author)

Algebraic geometry and effective lagrangians

International Nuclear Information System (INIS)

Martinec, E.J.; Chicago Univ., IL

1989-01-01

N=2 supersymmetric Landau-Ginsburg fixed points describe nonlinear models whose target spaces are algebraic varieties in certain generalized projective spaces; the defining equation is precisely the zero set of the superpotential, considered as a condition in the projective space. The ADE classification of modular invariants arises as the classification of projective descriptions of P 1 ; in general, the hierarchy of fixed points is conjectured to be isomorphic to the classification of quasihomogeneous singularities. The condition of vanishing first Chern class is an integrality condition on the Virasoro central charge; the central charge is determined by the superpotential. The operator algebra is given by the algebra of Wick contractions of perturbations of the superpotential. (orig.)

The algebra of the energy-momentum tensor and the Noether currents in classical non-linear sigma models

International Nuclear Information System (INIS)

Forger, M.; Mannheim Univ.; Laartz, J.; Schaeper, U.

1994-01-01

The recently derived current algrbra of classical non-linear sigma models on arbitrary Riemannian manifolds is extended to include the energy-momentum tensor. It is found that in two dimensions the energy-momentum tensor θ μv , the Noether current j μ associated with the global symmetry of the theory and the composite field j appearing as the coefficient of the Schwinger term in the current algebra, together with the derivatives of j μ and j, generte a closed algebra. The subalgebra generated by the light-cone components of the energy-momentum tensor consists of two commuting copies of the Virasoro algebra, with central charge c=0, reflecting the classical conformal invariance of the theory, but the current algebra part and the semidirect product structure are quite different from the usual Kac-Moody/Sugawara type contruction. (orig.)

DiVinE-CUDA - A Tool for GPU Accelerated LTL Model Checking

Directory of Open Access Journals (Sweden)

Jiří Barnat

2009-12-01

Full Text Available In this paper we present a tool that performs CUDA accelerated LTL Model Checking. The tool exploits parallel algorithm MAP adjusted to the NVIDIA CUDA architecture in order to efficiently detect the presence of accepting cycles in a directed graph. Accepting cycle detection is the core algorithmic procedure in automata-based LTL Model Checking. We demonstrate that the tool outperforms non-accelerated version of the algorithm and we discuss where the limits of the tool are and what we intend to do in the future to avoid them.

Model-Checking Driven Design of QoS-Based Routing Protocol for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Zhi Chen

2015-01-01

Full Text Available Accurate and reliable routing protocols with Quality of Service (QoS support determine the mission-critical application efficiency in WSNs. This paper proposes a model-checking design driven framework for designing the QoS-based routing protocols of WSNs, which involves the light-weight design process, the timed automata model, and the alternative QoS verification properties. The accurate feedback of continually model checking in the iterative design process effectively stimulates the parameter tuning of the protocols. We demonstrate the straightforward and modular characteristics of the proposed framework in designing a prototype QoS-based routing protocol. The prototype study shows that the model-checking design framework may complement other design methods and ensure the QoS implementation of the QoS-based routing protocol design for WSNs.

Automatic generation of Fortran programs for algebraic simulation models

International Nuclear Information System (INIS)

Schopf, W.; Rexer, G.; Ruehle, R.

1978-04-01

This report documents a generator program by which econometric simulation models formulated in an application-orientated language can be transformed automatically in a Fortran program. Thus the model designer is able to build up, test and modify models without the need of a Fortran programmer. The development of a computer model is therefore simplified and shortened appreciably; in chapter 1-3 of this report all rules are presented for the application of the generator to the model design. Algebraic models including exogeneous and endogeneous time series variables, lead and lag function can be generated. In addition, to these language elements, Fortran sequences can be applied to the formulation of models in the case of complex model interrelations. Automatically the generated model is a module of the program system RSYST III and is therefore able to exchange input and output data with the central data bank of the system and in connection with the method library modules can be used to handle planning problems. (orig.) [de

Algebraic topological entropy

International Nuclear Information System (INIS)

Hudetz, T.

1989-01-01

As a 'by-product' of the Connes-Narnhofer-Thirring theory of dynamical entropy for (originally non-Abelian) nuclear C * -algebras, the well-known variational principle for topological entropy is eqivalently reformulated in purly algebraically defined terms for (separable) Abelian C * -algebras. This 'algebraic variational principle' should not only nicely illustrate the 'feed-back' of methods developed for quantum dynamical systems to the classical theory, but it could also be proved directly by 'algebraic' methods and could thus further simplify the original proof of the variational principle (at least 'in principle'). 23 refs. (Author)

Linearizing W-algebras

International Nuclear Information System (INIS)

Krivonos, S.O.; Sorin, A.S.

1994-06-01

We show that the Zamolodchikov's and Polyakov-Bershadsky nonlinear algebras W 3 and W (2) 3 can be embedded as subalgebras into some linear algebras with finite set of currents. Using these linear algebras we find new field realizations of W (2) 3 and W 3 which could be a starting point for constructing new versions of W-string theories. We also reveal a number of hidden relationships between W 3 and W (2) 3 . We conjecture that similar linear algebras can exist for other W-algebra as well. (author). 10 refs

Algebraic structure of chiral anomalies

International Nuclear Information System (INIS)

Stora, R.

1985-09-01

I will describe first the algebraic aspects of chiral anomalies, exercising however due care about the topological delicacies. I will illustrate the structure and methods in the context of gauge anomalies and will eventually make contact with results obtained from index theory. I will go into two sorts of generalizations: on the one hand, generalizing the algebraic set up yields e.g. gravitational and mixed gauge anomalies, supersymmetric gauge anomalies, anomalies in supergravity theories; on the other hand most constructions applied to the cohomologies which characterize anomalies easily extend to higher cohomologies. Section II is devoted to a description of the general set up as it applies to gauge anomalies. Section III deals with a number of algebraic set ups which characterize more general types of anomalies: gravitational and mixed gauge anomalies, supersymmetric gauge anomalies, anomalies in supergravity theories. It also includes brief remarks on σ models and a reminder on the full BRST algebra of quantized gauge theories

Model checking coalitional games in shortage resource scenarios

Directory of Open Access Journals (Sweden)

Dario Della Monica

2013-07-01

Full Text Available Verification of multi-agents systems (MAS has been recently studied taking into account the need of expressing resource bounds. Several logics for specifying properties of MAS have been presented in quite a variety of scenarios with bounded resources. In this paper, we study a different formalism, called Priced Resource-Bounded Alternating-time Temporal Logic (PRBATL, whose main novelty consists in moving the notion of resources from a syntactic level (part of the formula to a semantic one (part of the model. This allows us to track the evolution of the resource availability along the computations and provides us with a formalisms capable to model a number of real-world scenarios. Two relevant aspects are the notion of global availability of the resources on the market, that are shared by the agents, and the notion of price of resources, depending on their availability. In a previous work of ours, an initial step towards this new formalism was introduced, along with an EXPTIME algorithm for the model checking problem. In this paper we better analyze the features of the proposed formalism, also in comparison with previous approaches. The main technical contribution is the proof of the EXPTIME-hardness of the the model checking problem for PRBATL, based on a reduction from the acceptance problem for Linearly-Bounded Alternating Turing Machines. In particular, since the problem has multiple parameters, we show two fixed-parameter reductions.

Algebra of orthofermions and equivalence of their thermodynamics to the infinite U Hubbard model

International Nuclear Information System (INIS)

Kishore, R.; Mishra, A.K.

2006-01-01

The equivalence of thermodynamics of independent orthofermions to the infinite U Hubbard model, shown earlier for the one-dimensional infinite lattice, has been extended to a finite system of two lattice sites. Regarding the algebra of orthofermions, the algebraic expressions for the number operator for a given spin and the spin raising (lowering) operators in the form of infinite series are rearranged in such a way that the ith term, having the form of an infinite series, of the number (spin raising (lowering)) operator represents the number (spin raising (lowering)) operator at the ith lattice site

Path operator algebras in conformal quantum field theories

International Nuclear Information System (INIS)

Roesgen, M.

2000-10-01

Two different kinds of path algebras and methods from noncommutative geometry are applied to conformal field theory: Fusion rings and modular invariants of extended chiral algebras are analyzed in terms of essential paths which are a path description of intertwiners. As an example, the ADE classification of modular invariants for minimal models is reproduced. The analysis of two-step extensions is included. Path algebras based on a path space interpretation of character identities can be applied to the analysis of fusion rings as well. In particular, factorization properties of character identities and therefore of the corresponding path spaces are - by means of K-theory - related to the factorization of the fusion ring of Virasoro- and W-algebras. Examples from nonsupersymmetric as well as N=2 supersymmetric minimal models are discussed. (orig.)

Quantum deformed su(mvertical stroke n) algebra and superconformal algebra on quantum superspace

International Nuclear Information System (INIS)

Kobayashi, Tatsuo

1993-01-01

We study a deformed su(mvertical stroke n) algebra on a quantum superspace. Some interesting aspects of the deformed algebra are shown. As an application of the deformed algebra we construct a deformed superconformal algebra. From the deformed su(1vertical stroke 4) algebra, we derive deformed Lorentz, translation of Minkowski space, iso(2,2) and its supersymmetric algebras as closed subalgebras with consistent automorphisms. (orig.)

Linear algebraic groups

CERN Document Server

Springer, T A

1998-01-01

"[The first] ten chapters...are an efficient, accessible, and self-contained introduction to affine algebraic groups over an algebraically closed field. The author includes exercises and the book is certainly usable by graduate students as a text or for self-study...the author [has a] student-friendly style… [The following] seven chapters... would also be a good introduction to rationality issues for algebraic groups. A number of results from the literature…appear for the first time in a text." –Mathematical Reviews (Review of the Second Edition) "This book is a completely new version of the first edition. The aim of the old book was to present the theory of linear algebraic groups over an algebraically closed field. Reading that book, many people entered the research field of linear algebraic groups. The present book has a wider scope. Its aim is to treat the theory of linear algebraic groups over arbitrary fields. Again, the author keeps the treatment of prerequisites self-contained. The material of t...

Extended conformal algebras

International Nuclear Information System (INIS)

Goddard, Peter

1990-01-01

The algebra of the group of conformal transformations in two dimensions consists of two commuting copies of the Virasoro algebra. In many mathematical and physical contexts, the representations of ν which are relevant satisfy two conditions: they are unitary and they have the ''positive energy'' property that L o is bounded below. In an irreducible unitary representation the central element c takes a fixed real value. In physical contexts, the value of c is a characteristic of a theory. If c < 1, it turns out that the conformal algebra is sufficient to ''solve'' the theory, in the sense of relating the calculation of the infinite set of physically interesting quantities to a finite subset which can be handled in principle. For c ≥ 1, this is no longer the case for the algebra alone and one needs some sort of extended conformal algebra, such as the superconformal algebra. It is these algebras that this paper aims at addressing. (author)

Using Stochastic Model Checking to Provision Complex Business Services

DEFF Research Database (Denmark)

Herbert, Luke Thomas; Sharp, Robin

2012-01-01

bounds on resources consumed during execution of business processes. Accurate resource provisioning is often central to ensuring the safe execution of a process. We first introduce a formalised core subset of the Business Process Modelling and Notation (BPMN), which we extend with probabilistic and non......-deterministic branching and reward annotations. We then develop an algorithm for the efficient translation of these models into the guarded command language used by the model checker PRISM, in turn enabling model checking of BPMN processes and allowing for the calculation of a wide range of quantitative properties...

Optimizing ZigBee Security using Stochastic Model Checking

DEFF Research Database (Denmark)

Yuksel, Ender; Nielson, Hanne Riis; Nielson, Flemming

, we identify an important gap in the specification on key updates, and present a methodology for determining optimal key update policies and security parameters. We exploit the stochastic model checking approach using the probabilistic model checker PRISM, and assess the security needs for realistic......ZigBee is a fairly new but promising wireless sensor network standard that offers the advantages of simple and low resource communication. Nevertheless, security is of great concern to ZigBee, and enhancements are prescribed in the latest ZigBee specication: ZigBee-2007. In this technical report...

Generalized symmetry algebras

International Nuclear Information System (INIS)

Dragon, N.

1979-01-01

The possible use of trilinear algebras as symmetry algebras for para-Fermi fields is investigated. The shortcomings of the examples are argued to be a general feature of such generalized algebras. (author)

Current algebra and differential geometry

International Nuclear Information System (INIS)

Alekseev, Anton; Strobl, Thomas

2005-01-01

We show that symmetries and gauge symmetries of a large class of 2-dimensional sigma models are described by a new type of a current algebra. The currents are labeled by pairs of a vector field and a 1-form on the target space of the sigma model. We compute the current-current commutator and analyse the anomaly cancellation condition, which can be interpreted geometrically in terms of Dirac structures, previously studied in the mathematical literature. Generalized complex structures correspond to decompositions of the current algebra into pairs of anomaly free subalgebras. Sigma models that we can treat with our method include both physical and topological examples, with and without Wess-Zumino type terms. (author)

Rota-Baxter algebras and the Hopf algebra of renormalization

Energy Technology Data Exchange (ETDEWEB)

Ebrahimi-Fard, K.

2006-06-15

Recently, the theory of renormalization in perturbative quantum field theory underwent some exciting new developments. Kreimer discovered an organization of Feynman graphs into combinatorial Hopf algebras. The process of renormalization is captured by a factorization theorem for regularized Hopf algebra characters. Hereby the notion of Rota-Baxter algebras enters the scene. In this work we develop in detail several mathematical aspects of Rota-Baxter algebras as they appear also in other sectors closely related to perturbative renormalization, to wit, for instance multiple-zeta-values and matrix differential equations. The Rota-Baxter picture enables us to present the algebraic underpinning for the Connes-Kreimer Birkhoff decomposition in a concise way. This is achieved by establishing a general factorization theorem for filtered algebras. Which in turn follows from a new recursion formula based on the Baker-Campbell-Hausdorff formula. This allows us to generalize a classical result due to Spitzer to non-commutative Rota-Baxter algebras. The Baker-Campbell-Hausdorff based recursion turns out to be a generalization of Magnus' expansion in numerical analysis to generalized integration operators. We will exemplify these general results by establishing a simple representation of the combinatorics of renormalization in terms of triangular matrices. We thereby recover in the presence of a Rota-Baxter operator the matrix representation of the Birkhoff decomposition of Connes and Kreimer. (orig.)

Rota-Baxter algebras and the Hopf algebra of renormalization

International Nuclear Information System (INIS)

Ebrahimi-Fard, K.

2006-06-01

Recently, the theory of renormalization in perturbative quantum field theory underwent some exciting new developments. Kreimer discovered an organization of Feynman graphs into combinatorial Hopf algebras. The process of renormalization is captured by a factorization theorem for regularized Hopf algebra characters. Hereby the notion of Rota-Baxter algebras enters the scene. In this work we develop in detail several mathematical aspects of Rota-Baxter algebras as they appear also in other sectors closely related to perturbative renormalization, to wit, for instance multiple-zeta-values and matrix differential equations. The Rota-Baxter picture enables us to present the algebraic underpinning for the Connes-Kreimer Birkhoff decomposition in a concise way. This is achieved by establishing a general factorization theorem for filtered algebras. Which in turn follows from a new recursion formula based on the Baker-Campbell-Hausdorff formula. This allows us to generalize a classical result due to Spitzer to non-commutative Rota-Baxter algebras. The Baker-Campbell-Hausdorff based recursion turns out to be a generalization of Magnus' expansion in numerical analysis to generalized integration operators. We will exemplify these general results by establishing a simple representation of the combinatorics of renormalization in terms of triangular matrices. We thereby recover in the presence of a Rota-Baxter operator the matrix representation of the Birkhoff decomposition of Connes and Kreimer. (orig.)

On-the-fly confluence detection for statistical model checking (extended version)

NARCIS (Netherlands)

Hartmanns, Arnd; Timmer, Mark

Statistical model checking is an analysis method that circumvents the state space explosion problem in model-based verification by combining probabilistic simulation with statistical methods that provide clear error bounds. As a simulation-based technique, it can only provide sound results if the

Galilean contractions of W-algebras

Directory of Open Access Journals (Sweden)

Jørgen Rasmussen

2017-09-01

Full Text Available Infinite-dimensional Galilean conformal algebras can be constructed by contracting pairs of symmetry algebras in conformal field theory, such as W-algebras. Known examples include contractions of pairs of the Virasoro algebra, its N=1 superconformal extension, or the W3 algebra. Here, we introduce a contraction prescription of the corresponding operator-product algebras, or equivalently, a prescription for contracting tensor products of vertex algebras. With this, we work out the Galilean conformal algebras arising from contractions of N=2 and N=4 superconformal algebras as well as of the W-algebras W(2,4, W(2,6, W4, and W5. The latter results provide evidence for the existence of a whole new class of W-algebras which we call Galilean W-algebras. We also apply the contraction prescription to affine Lie algebras and find that the ensuing Galilean affine algebras admit a Sugawara construction. The corresponding central charge is level-independent and given by twice the dimension of the underlying finite-dimensional Lie algebra. Finally, applications of our results to the characterisation of structure constants in W-algebras are proposed.

Model-checking statistique pour la vérification de véhicules autonomes

OpenAIRE

Barbot , Benoît; Bérard , Béatrice; Duplouy , Yann; Haddad , Serge

2017-01-01

National audience; We present an application of statistical model-checking to the verification of an autonomous vehicle controller. Our goal is to check safety properties in various traffic situations. More specifically, we focus on a traffic jam situation. The controller is specified by a C++ program. Using sensors, it registers positions and velocities of nearby vehicles and modifies the position and velocity of the controlled vehicle to avoid collisions. We model the environment using a st...

Automorphisms of W-algebras and extended rational conformal field theories

International Nuclear Information System (INIS)

Honecker, A.

1992-11-01

Many extended conformal algebras with one generator in addition to the Virasoro field as well as Casimir algebras have non-trivial outer automorphisms which enables one to impose 'twisted' boundary conditions on the chiral fields. We study their effect on the highest weight representations. We give formulae for the enlarged rational conformal field theories in both series of W-algebras with two generators and conjecture a general formula for the additional models in the minimal series of Casimir algebras. A third series of W-algebras with two generators which includes the spin three algebra at c = -2 also has finitely many additional fields in the twisted sector although the model itself is apparently not rational. The additional fields in the twisted sector have applications in statistical mechanics as we demonstrate for Z n -quantum spin chains with a particular type of boundary conditions. (orig.)

Algebraic entropy for algebraic maps

International Nuclear Information System (INIS)

Hone, A N W; Ragnisco, Orlando; Zullo, Federico

2016-01-01

We propose an extension of the concept of algebraic entropy, as introduced by Bellon and Viallet for rational maps, to algebraic maps (or correspondences) of a certain kind. The corresponding entropy is an index of the complexity of the map. The definition inherits the basic properties from the definition of entropy for rational maps. We give an example with positive entropy, as well as two examples taken from the theory of Bäcklund transformations. (letter)

On hyper BCC-algebras

OpenAIRE

Borzooei, R. A.; Dudek, W. A.; Koohestani, N.

2006-01-01

We study hyper BCC-algebras which are a common generalization of BCC-algebras and hyper BCK-algebras. In particular, we investigate different types of hyper BCC-ideals and describe the relationship among them. Next, we calculate all nonisomorphic 22 hyper BCC-algebras of order 3 of which only three are not hyper BCK-algebras.

Planar Algebra of the Subgroup-Subfactor

Indian Academy of Sciences (India)

The crucial step in this identification is an exhibition of a model for the basic construction tower, and thereafter of the standard invariant of R ⋊ H ⊂ R ⋊ G in terms of operator matrices. We also obtain an identification between the planar algebra of the fixed algebra subfactor R G ⊂ R H and the -invariant planar subalgebra ...

Cluster algebras in mathematical physics

International Nuclear Information System (INIS)

Francesco, Philippe Di; Gekhtman, Michael; Kuniba, Atsuo; Yamazaki, Masahito

2014-01-01

identities in conformal field theory and so forth. It is remarkable that the key ingredients in such a variety of theories and models are captured and described universally in the common language of cluster algebras. This special issue provides a bird's-eye view of the known and latest results in various topics in mathematical physics where cluster algebras have played an essential role. The contributed articles are themselves an eloquent illustration of the breadth and depth of the subject of cluster algebras. We are confident that the issue will stimulate both newcomers and experts, since the applications to physics still seem to be growing

Modeling and analysis of cell membrane systems with probabilistic model checking

Science.gov (United States)

2011-01-01

Background Recently there has been a growing interest in the application of Probabilistic Model Checking (PMC) for the formal specification of biological systems. PMC is able to exhaustively explore all states of a stochastic model and can provide valuable insight into its behavior which are more difficult to see using only traditional methods for system analysis such as deterministic and stochastic simulation. In this work we propose a stochastic modeling for the description and analysis of sodium-potassium exchange pump. The sodium-potassium pump is a membrane transport system presents in all animal cell and capable of moving sodium and potassium ions against their concentration gradient. Results We present a quantitative formal specification of the pump mechanism in the PRISM language, taking into consideration a discrete chemistry approach and the Law of Mass Action aspects. We also present an analysis of the system using quantitative properties in order to verify the pump reversibility and understand the pump behavior using trend labels for the transition rates of the pump reactions. Conclusions Probabilistic model checking can be used along with other well established approaches such as simulation and differential equations to better understand pump behavior. Using PMC we can determine if specific events happen such as the potassium outside the cell ends in all model traces. We can also have a more detailed perspective on its behavior such as determining its reversibility and why its normal operation becomes slow over time. This knowledge can be used to direct experimental research and make it more efficient, leading to faster and more accurate scientific discoveries. PMID:22369714

XAL: An algebra for XML query optimization

NARCIS (Netherlands)

Frasincar, F.; Houben, G.J.P.M.; Pau, C.D.; Zhou, Xiaofang

2002-01-01

This paper proposes XAL, an XML ALgebra. Its novelty is based on the simplicity of its data model and its well-defined logical operators, which makes it suitable for composability, optimizability, and semantics definition of a query language for XML data. At the heart of the algebra resides the

A representation basis for the quantum integrable spin chain associated with the su(3) algebra

Energy Technology Data Exchange (ETDEWEB)

Hao, Kun [Institute of Modern Physics, Northwest University, Xian 710069 (China); Cao, Junpeng [Beijing National Laboratory for Condensed Matter Physics, Institute of Physics, Chinese Academy of Sciences, Beijing 100190 (China); Collaborative Innovation Center of Quantum Matter, Beijing (China); Li, Guang-Liang [Department of Applied Physics, Xian Jiaotong University, Xian 710049 (China); Yang, Wen-Li [Institute of Modern Physics, Northwest University, Xian 710069 (China); Beijing Center for Mathematics and Information Interdisciplinary Sciences, Beijing 100048 (China); Shi, Kangjie [Institute of Modern Physics, Northwest University, Xian 710069 (China); Wang, Yupeng [Beijing National Laboratory for Condensed Matter Physics, Institute of Physics, Chinese Academy of Sciences, Beijing 100190 (China); Collaborative Innovation Center of Quantum Matter, Beijing (China)

2016-05-20

An orthogonal basis of the Hilbert space for the quantum spin chain associated with the su(3) algebra is introduced. Such kind of basis could be treated as a nested generalization of separation of variables (SoV) basis for high-rank quantum integrable models. It is found that all the monodromy-matrix elements acting on a basis vector take simple forms. With the help of the basis, we construct eigenstates of the su(3) inhomogeneous spin torus (the trigonometric su(3) spin chain with antiperiodic boundary condition) from its spectrum obtained via the off-diagonal Bethe Ansatz (ODBA). Based on small sites (i.e. N=2) check, it is conjectured that the homogeneous limit of the eigenstates exists, which gives rise to the corresponding eigenstates of the homogenous model.

On hyper BCC-algebras

Directory of Open Access Journals (Sweden)

R. A. Borzooei

2006-01-01

Full Text Available We study hyper BCC-algebras which are a common generalization of BCC-algebras and hyper BCK-algebras. In particular, we investigate different types of hyper BCC-ideals and describe the relationship among them. Next, we calculate all nonisomorphic 22 hyper BCC-algebras of order 3 of which only three are not hyper BCK-algebras.

Algebraic theory of numbers

CERN Document Server

Samuel, Pierre

2008-01-01

Algebraic number theory introduces students not only to new algebraic notions but also to related concepts: groups, rings, fields, ideals, quotient rings and quotient fields, homomorphisms and isomorphisms, modules, and vector spaces. Author Pierre Samuel notes that students benefit from their studies of algebraic number theory by encountering many concepts fundamental to other branches of mathematics - algebraic geometry, in particular.This book assumes a knowledge of basic algebra but supplements its teachings with brief, clear explanations of integrality, algebraic extensions of fields, Gal

Dual number algebra method for Green's function derivatives in 3D magneto-electro-elasticity

Science.gov (United States)

Dziatkiewicz, Grzegorz

2018-01-01

The Green functions are the basic elements of the boundary element method. To obtain the boundary integral formulation the Green function and its derivative should be known for the considered differential operator. Today the interesting group of materials are electronic composites. The special case of the electronic composite is the magnetoelectroelastic continuum. The mentioned continuum is a model of the piezoelectric-piezomagnetic composites. The anisotropy of their physical properties makes the problem of Green's function determination very difficult. For that reason Green's functions for the magnetoelectroelastic continuum are not known in the closed form and numerical methods should be applied to determine such Green's functions. These means that the problem of the accurate and simply determination of Green's function derivatives is even harder. Therefore in the present work the dual number algebra method is applied to calculate numerically the derivatives of 3D Green's functions for the magnetoelectroelastic materials. The introduced method is independent on the step size and it can be treated as a special case of the automatic differentiation method. Therefore, the dual number algebra method can be applied as a tool for checking the accuracy of the well-known finite difference schemes.

Effective quark-diquark supersymmetry an algebraic approach

International Nuclear Information System (INIS)

Catto, S.

1989-01-01

Effective hadronic supersymmetries and color algebra, where extended Miyazawa U(6/21) supersymmetry between mesons and baryons are derived from QCD under some assumptions and within some approximation, also using a dynamical suppression of color-symmetric states. This shows the hadronic origin of supersymmetry as well as the underlying structure of exceptional algebras to the quark model. Supergroups, and infinite groups like Virasoro algebra, then emerge as useful descriptions of certain properties of the hadronic spectrum. Applications to exotic mesons and baryons are discussed

A rigorous approach to investigating common assumptions about disease transmission: Process algebra as an emerging modelling methodology for epidemiology.

Science.gov (United States)

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.

Bounded Model Checking and Inductive Verification of Hybrid Discrete-Continuous Systems

DEFF Research Database (Denmark)

Becker, Bernd; Behle, Markus; Eisenbrand, Fritz

2004-01-01

We present a concept to signicantly advance the state of the art for bounded model checking (BMC) and inductive verication (IV) of hybrid discrete-continuous systems. Our approach combines the expertise of partners coming from dierent domains, like hybrid systems modeling and digital circuit veri...

The BRS algebra of a free differential algebra

International Nuclear Information System (INIS)

Boukraa, S.

1987-04-01

We construct in this work, the Weil and the universal BRS algebras of theories that can have as a gauge symmetry a free differential (Sullivan) algebra, the natural extension of Lie algebras allowing the definition of p-form gauge potentials (p>1). The finite gauge transformations of these potentials are deduced from the infinitesimal ones and the group structure is shown. The geometrical meaning of these p-form gauge potentials is given by the notion of a Quillen superconnection. (author). 19 refs

Genetic coding and united-hypercomplex systems in the models of algebraic biology.

Science.gov (United States)

Petoukhov, Sergey V

2017-08-01

Structured alphabets of DNA and RNA in their matrix form of representations are connected with Walsh functions and a new type of systems of multidimensional numbers. This type generalizes systems of complex numbers and hypercomplex numbers, which serve as the basis of mathematical natural sciences and many technologies. The new systems of multi-dimensional numbers have interesting mathematical properties and are called in a general case as "systems of united-hypercomplex numbers" (or briefly "U-hypercomplex numbers"). They can be widely used in models of multi-parametrical systems in the field of algebraic biology, artificial life, devices of biological inspired artificial intelligence, etc. In particular, an application of U-hypercomplex numbers reveals hidden properties of genetic alphabets under cyclic permutations in their doublets and triplets. A special attention is devoted to the author's hypothesis about a multi-linguistic in DNA-sequences in a relation with an ensemble of U-numerical sub-alphabets. Genetic multi-linguistic is considered as an important factor to provide noise-immunity properties of the multi-channel genetic coding. Our results attest to the conformity of the algebraic properties of the U-numerical systems with phenomenological properties of the DNA-alphabets and with the complementary device of the double DNA-helix. It seems that in the modeling field of algebraic biology the genetic-informational organization of living bodies can be considered as a set of united-hypercomplex numbers in some association with the famous slogan of Pythagoras "the numbers rule the world". Copyright © 2017 Elsevier B.V. All rights reserved.

Analysis of an emergency diesel generator control system by compositional model checking. MODSAFE 2010 work report

International Nuclear Information System (INIS)

Lahtinen, J.; Bjoerkman, K.; Valkonen, J.; Frits, J.; Niemelae, I.

2010-12-01

Digital instrumentation and control (I and C) systems containing programmable logic controllers are challenging to verify. They enable complicated control functions and the state spaces (number of distinct values of inputs, outputs and internal memory) of the designs easily become too large for comprehensive manual inspection. Model checking is a formal method that can be used for verifying that systems have been correctly designed. A number of efficient model checking systems are available which provide analysis tools that are able to determine automatically whether a given state machine model satisfies the desired safety properties. The practical case analysed in this research project is called an 'emergency diesel generator control system' and its purpose is to provide reserve power to critical devices and computers that must be available without interruption. This report describes 1) the development of a compositional approach for checking the models in large system designs, 2) the development of a modular model checking approach for modelling function block diagrams with the Uppaal model checker and 3) the experience of utilising the new modelling approaches in practice. (orig.)

PENERAPAN MODEL PEMBELAJARAN KOOPERATIF TIPE PAIR CHECKS PEMECAHAN MASALAH UNTUK MENINGKATKAN SOCIAL SKILL SISWA

OpenAIRE

R. Lestari; S. Linuwih

2012-01-01

Tujuan penelitian tindakan kelas ini untuk mengetahui pengaruh proses pembelajaran dengan menggunakan model pembelajaran kooperatif tipe Pair Checks pemecahan masalah terhadap peningkatan social skill siswa. Pada proses penerapan model pembelajaran kooperatif tipe Pair Checks pemecahan masalah siswa dibagi dalam kelompok-kelompok dan satu kelompok terdiri dari dua orang. Setiap kelompok berdiskusi untuk menyelesaikan suatu masalah, kemudian hasil diskusi kelompok akan dicek oleh pasangan dari...

Pseudo-Riemannian Novikov algebras

Energy Technology Data Exchange (ETDEWEB)

Chen Zhiqi; Zhu Fuhai [School of Mathematical Sciences and LPMC, Nankai University, Tianjin 300071 (China)], E-mail: chenzhiqi@nankai.edu.cn, E-mail: zhufuhai@nankai.edu.cn

2008-08-08

Novikov algebras were introduced in connection with the Poisson brackets of hydrodynamic-type and Hamiltonian operators in formal variational calculus. Pseudo-Riemannian Novikov algebras denote Novikov algebras with non-degenerate invariant symmetric bilinear forms. In this paper, we find that there is a remarkable geometry on pseudo-Riemannian Novikov algebras, and give a special class of pseudo-Riemannian Novikov algebras.

On the PR-algebras

International Nuclear Information System (INIS)

Lebedenko, V.M.

1978-01-01

The PR-algebras, i.e. the Lie algebras with commutation relations of [Hsub(i),Hsub(j)]=rsub(ij)Hsub(i)(i< j) type are investigated. On the basis of former results a criterion for the membership of 2-solvable Lie algebras to the PR-algebra class is given. The conditions imposed by the criterion are formulated in the linear algebra language

Introduction to W-algebras

International Nuclear Information System (INIS)

Takao, Masaru

1989-01-01

We review W-algebras which are generated by stress tensor and primary fields. Associativity plays an important role in determining the extended algebra and further implies the algebras to exist for special values of central charges. Explicitly constructing the algebras including primary fields of spin less than 4, we investigate the closure structure of the Jacobi identity of the extended algebras. (author)

(Modular Effect Algebras are Equivalent to (Frobenius Antispecial Algebras

Directory of Open Access Journals (Sweden)

Dusko Pavlovic

2017-01-01

Full Text Available Effect algebras are one of the generalizations of Boolean algebras proposed in the quest for a quantum logic. Frobenius algebras are a tool of categorical quantum mechanics, used to present various families of observables in abstract, often nonstandard frameworks. Both effect algebras and Frobenius algebras capture their respective fragments of quantum mechanics by elegant and succinct axioms; and both come with their conceptual mysteries. A particularly elegant and mysterious constraint, imposed on Frobenius algebras to characterize a class of tripartite entangled states, is the antispecial law. A particularly contentious issue on the quantum logic side is the modularity law, proposed by von Neumann to mitigate the failure of distributivity of quantum logical connectives. We show that, if quantum logic and categorical quantum mechanics are formalized in the same framework, then the antispecial law of categorical quantum mechanics corresponds to the natural requirement of effect algebras that the units are each other's unique complements; and that the modularity law corresponds to the Frobenius condition. These correspondences lead to the equivalence announced in the title. Aligning the two formalisms, at the very least, sheds new light on the concepts that are more clearly displayed on one side than on the other (such as e.g. the orthogonality. Beyond that, it may also open up new approaches to deep and important problems of quantum mechanics (such as the classification of complementary observables.

An algorithm to construct the basic algebra of a skew group algebra

NARCIS (Netherlands)

Horobeţ, E.

2016-01-01

We give an algorithm for the computation of the basic algebra Morita equivalent to a skew group algebra of a path algebra by obtaining formulas for the number of vertices and arrows of the new quiver Qb. We apply this algorithm to compute the basic algebra corresponding to all simple quaternion

Petri Net and Probabilistic Model Checking Based Approach for the Modelling, Simulation and Verification of Internet Worm Propagation.

Directory of Open Access Journals (Sweden)

Misbah Razzaq

Full Text Available Internet worms are analogous to biological viruses since they can infect a host and have the ability to propagate through a chosen medium. To prevent the spread of a worm or to grasp how to regulate a prevailing worm, compartmental models are commonly used as a means to examine and understand the patterns and mechanisms of a worm spread. However, one of the greatest challenge is to produce methods to verify and validate the behavioural properties of a compartmental model. This is why in this study we suggest a framework based on Petri Nets and Model Checking through which we can meticulously examine and validate these models. We investigate Susceptible-Exposed-Infectious-Recovered (SEIR model and propose a new model Susceptible-Exposed-Infectious-Recovered-Delayed-Quarantined (Susceptible/Recovered (SEIDQR(S/I along with hybrid quarantine strategy, which is then constructed and analysed using Stochastic Petri Nets and Continuous Time Markov Chain. The analysis shows that the hybrid quarantine strategy is extremely effective in reducing the risk of propagating the worm. Through Model Checking, we gained insight into the functionality of compartmental models. Model Checking results validate simulation ones well, which fully support the proposed framework.

Compact quantum group C*-algebras as Hopf algebras with approximate unit

International Nuclear Information System (INIS)

Do Ngoc Diep; Phung Ho Hai; Kuku, A.O.

1999-04-01

In this paper, we construct and study the representation theory of a Hopf C*-algebra with approximate unit, which constitutes quantum analogue of a compact group C*-algebra. The construction is done by first introducing a convolution-product on an arbitrary Hopf algebra H with integral, and then constructing the L 2 and C*-envelopes of H (with the new convolution-product) when H is a compact Hopf *-algebra. (author)

Intervals in Generalized Effect Algebras and their Sub-generalized Effect Algebras

Directory of Open Access Journals (Sweden)

Zdenka Riečanová

2013-01-01

Full Text Available We consider subsets G of a generalized effect algebra E with 0∈G and such that every interval [0, q]G = [0, q]E ∩ G of G (q ∈ G , q ≠ 0 is a sub-effect algebra of the effect algebra [0, q]E. We give a condition on E and G under which every such G is a sub-generalized effect algebra of E.

Design of Installing Check Dam Using RAMMS Model in Seorak National Park of South Korea

Science.gov (United States)

Jun, K.; Tak, W.; JUN, B. H.; Lee, H. J.; KIM, S. D.

2016-12-01

Design of Installing Check Dam Using RAMMS Model in Seorak National Park of South Korea Kye-Won Jun*, Won-Jun Tak*, Byong-Hee Jun**, Ho-Jin Lee***, Soung-Doug Kim* *Graduate School of Disaster Prevention, Kangwon National University, 346 Joogang-ro, Samcheok-si, Gangwon-do, Korea **School of Fire and Disaster Protection, Kangwon National University, 346 Joogang-ro, Samcheok-si, Gangwon-do, Korea ***School of Civil Engineering, Chungbuk National University, 1 Chungdae-ro, Seowon-gu, Cheongju, Korea Abstract As more than 64% of the land in South Korea is mountainous area, so many regions in South Korea are exposed to the danger of landslide and debris flow. So it is important to understand the behavior of debris flow in mountainous terrains, the various methods and models are being presented and developed based on the mathematical concept. The purpose of this study is to investigate the regions that experienced the debris flow due to typhoon called Ewiniar and to perform numerical modeling to design and layout of the Check dam for reducing the damage by the debris flow. For the performance of numerical modeling, on-site measurement of the research area was conducted including: topographic investigation, research on bridges in the downstream, and precision LiDAR 3D scanning for composed basic data of numerical modeling. The numerical simulation of this study was performed using RAMMS (Rapid Mass Movements Simulation) model for the analysis of the debris flow. This model applied to the conditions of the Check dam which was installed in the upstream, midstream, and downstream. Considering the reduction effect of debris flow, the expansion of debris flow, and the influence on the bridges in the downstream, proper location of the Check dam was designated. The result of present numerical model showed that when the Check dam was installed in the downstream section, 50 m above the bridge, the reduction effect of the debris flow was higher compared to when the Check dam were

Variants of bosonization in parabosonic algebra: the Hopf and super-Hopf structures in parabosonic algebra

International Nuclear Information System (INIS)

Kanakoglou, K; Daskaloyannis, C

2008-01-01

Parabosonic algebra in finite or infinite degrees of freedom is considered as a Z 2 -graded associative algebra, and is shown to be a Z 2 -graded (or super) Hopf algebra. The super-Hopf algebraic structure of the parabosonic algebra is established directly without appealing to its relation to the osp(1/2n) Lie superalgebraic structure. The notion of super-Hopf algebra is equivalently described as a Hopf algebra in the braided monoidal category CZ 2 M. The bosonization technique for switching a Hopf algebra in the braided monoidal category H M (where H is a quasitriangular Hopf algebra) into an ordinary Hopf algebra is reviewed. In this paper, we prove that for the parabosonic algebra P B , beyond the application of the bosonization technique to the original super-Hopf algebra, a bosonization-like construction is also achieved using two operators, related to the parabosonic total number operator. Both techniques switch the same super-Hopf algebra P B to an ordinary Hopf algebra, thus producing two different variants of P B , with an ordinary Hopf structure

Priority in Process Algebras

Science.gov (United States)

Cleaveland, Rance; Luettgen, Gerald; Natarajan, V.

1999-01-01

This paper surveys the semantic ramifications of extending traditional process algebras with notions of priority that allow for some transitions to be given precedence over others. These enriched formalisms allow one to model system features such as interrupts, prioritized choice, or real-time behavior. Approaches to priority in process algebras can be classified according to whether the induced notion of preemption on transitions is global or local and whether priorities are static or dynamic. Early work in the area concentrated on global pre-emption and static priorities and led to formalisms for modeling interrupts and aspects of real-time, such as maximal progress, in centralized computing environments. More recent research has investigated localized notions of pre-emption in which the distribution of systems is taken into account, as well as dynamic priority approaches, i.e., those where priority values may change as systems evolve. The latter allows one to model behavioral phenomena such as scheduling algorithms and also enables the efficient encoding of real-time semantics. Technically, this paper studies the different models of priorities by presenting extensions of Milner's Calculus of Communicating Systems (CCS) with static and dynamic priority as well as with notions of global and local pre- emption. In each case the operational semantics of CCS is modified appropriately, behavioral theories based on strong and weak bisimulation are given, and related approaches for different process-algebraic settings are discussed.

The C*-algebra of a vector bundle and fields of Cuntz algebras

OpenAIRE

Vasselli, Ezio

2004-01-01

We study the Pimsner algebra associated with the module of continuous sections of a Hilbert bundle, and prove that it is a continuous bundle of Cuntz algebras. We discuss the role of such Pimsner algebras w.r.t. the notion of inner endomorphism. Furthermore, we study bundles of Cuntz algebras carrying a global circle action, and assign to them a class in the representable KK-group of the zero-grade bundle. We compute such class for the Pimsner algebra of a vector bundle.

Symbolic Model Checking and Analysis for E-Commerce Protocol

Institute of Scientific and Technical Information of China (English)

WEN Jing-Hua; ZHANG Mei; LI Xiang

2005-01-01

A new approach is proposed for analyzing non-repudiation and fairness of e-commerce protocols. The authentication e-mail protocol CMP1 is modeled as finite state machine and analyzed in two vital aspects - non-repudiation and fairness using SMV. As a result, the CMP1 protocol is not fair and we have improved it. This result shows that it is effective to analyze and check the new features of e-commerce protocols using SMV model checker

Using Model Checking for Analyzing Distributed Power Control Problems

DEFF Research Database (Denmark)

Brihaye, Thomas; Jungers, Marc; Lasaulce, Samson

2010-01-01

Model checking (MC) is a formal verification technique which has been known and still knows a resounding success in the computer science community. Realizing that the distributed power control ( PC) problem can be modeled by a timed game between a given transmitter and its environment, the authors...... objectives a transmitter-receiver pair would like to reach. The network is modeled by a game where transmitters are considered as timed automata interacting with each other. The objectives are then translated into timed alternating-time temporal logic formulae and MC is exploited to know whether the desired...

Bicovariant quantum algebras and quantum Lie algebras

International Nuclear Information System (INIS)

Schupp, P.; Watts, P.; Zumino, B.

1993-01-01

A bicovariant calculus of differential operators on a quantum group is constructed in a natural way, using invariant maps from Fun(G q ) to U q g, given by elements of the pure braid group. These operators - the 'reflection matrix' Y= triple bond L + SL - being a special case - generate algebras that linearly close under adjoint actions, i.e. they form generalized Lie algebras. We establish the connection between the Hopf algebra formulation of the calculus and a formulation in compact matrix form which is quite powerful for actual computations and as applications we find the quantum determinant and an orthogonality relation for Y in SO q (N). (orig.)

Shape Optimization for Navier-Stokes Equations with Algebraic Turbulence Model: Existence Analysis

Czech Academy of Sciences Publication Activity Database

Bulíček, M.; Haslinger, J.; Málek, J.; Stebel, Jan

2009-01-01

Roč. 60, č. 2 (2009), s. 185-212 ISSN 0095-4616 R&D Projects: GA MŠk LC06052 Institutional research plan: CEZ:AV0Z10190503 Keywords : optimal shape design * paper machine headbox * incompressible non-Newtonian fluid * algebraic turbulence model * outflow boundary condition Subject RIV: BA - General Mathematics Impact factor: 0.757, year: 2009

Simple relation algebras

CERN Document Server

Givant, Steven

2017-01-01

This monograph details several different methods for constructing simple relation algebras, many of which are new with this book. By drawing these seemingly different methods together, all are shown to be aspects of one general approach, for which several applications are given. These tools for constructing and analyzing relation algebras are of particular interest to mathematicians working in logic, algebraic logic, or universal algebra, but will also appeal to philosophers and theoretical computer scientists working in fields that use mathematics. The book is written with a broad audience in mind and features a careful, pedagogical approach; an appendix contains the requisite background material in relation algebras. Over 400 exercises provide ample opportunities to engage with the material, making this a monograph equally appropriate for use in a special topics course or for independent study. Readers interested in pursuing an extended background study of relation algebras will find a comprehensive treatme...

Deterministic Compilation of Temporal Safety Properties in Explicit State Model Checking

Data.gov (United States)

National Aeronautics and Space Administration — The translation of temporal logic specifications constitutes an essen- tial step in model checking and a major influence on the efficiency of formal verification via...

Boolean algebra

CERN Document Server

Goodstein, R L

2007-01-01

This elementary treatment by a distinguished mathematician employs Boolean algebra as a simple medium for introducing important concepts of modern algebra. Numerous examples appear throughout the text, plus full solutions.

Combinatorial commutative algebra

CERN Document Server

Miller, Ezra

2005-01-01

Offers an introduction to combinatorial commutative algebra, focusing on combinatorial techniques for multigraded polynomial rings, semigroup algebras, and determined rings. The chapters in this work cover topics ranging from homological invariants of monomial ideals and their polyhedral resolutions, to tools for studying algebraic varieties.

Algebraic Bethe ansatz for U(1) invariant integrable models: Compact and non-compact applications

International Nuclear Information System (INIS)

Martins, M.J.; Melo, C.S.

2009-01-01

We apply the algebraic Bethe ansatz developed in our previous paper [C.S. Melo, M.J. Martins, Nucl. Phys. B 806 (2009) 567] to three different families of U(1) integrable vertex models with arbitrary N bond states. These statistical mechanics systems are based on the higher spin representations of the quantum group U q [SU(2)] for both generic and non-generic values of q as well as on the non-compact discrete representation of the SL(2,R) algebra. We present for all these models the explicit expressions for both the on-shell and the off-shell properties associated to the respective transfer matrices eigenvalue problems. The amplitudes governing the vectors not parallel to the Bethe states are shown to factorize in terms of elementary building blocks functions. The results for the non-compact SL(2,R) model are argued to be derived from those obtained for the compact systems by taking suitable N→∞ limits. This permits us to study the properties of the non-compact SL(2,R) model starting from systems with finite degrees of freedom.

Algebraic Bethe ansatz for U(1) invariant integrable models: Compact and non-compact applications

Science.gov (United States)

Martins, M. J.; Melo, C. S.

2009-10-01

We apply the algebraic Bethe ansatz developed in our previous paper [C.S. Melo, M.J. Martins, Nucl. Phys. B 806 (2009) 567] to three different families of U(1) integrable vertex models with arbitrary N bond states. These statistical mechanics systems are based on the higher spin representations of the quantum group U[SU(2)] for both generic and non-generic values of q as well as on the non-compact discrete representation of the SL(2,R) algebra. We present for all these models the explicit expressions for both the on-shell and the off-shell properties associated to the respective transfer matrices eigenvalue problems. The amplitudes governing the vectors not parallel to the Bethe states are shown to factorize in terms of elementary building blocks functions. The results for the non-compact SL(2,R) model are argued to be derived from those obtained for the compact systems by taking suitable N→∞ limits. This permits us to study the properties of the non-compact SL(2,R) model starting from systems with finite degrees of freedom.

Topological أ-algebras with Cأ-enveloping algebras II

Indian Academy of Sciences (India)

necessarily complete) pro-Cأ-topology which coincides with the relative uniform .... problems in Cأ-algebras, Phillips introduced more general weakly Cأ- .... Banach أ-algebra obtained by completing A=Np in the norm jjxpjjp ¼ pًxق where.

C*-algebras by example

CERN Document Server

Davidson, Kenneth R

1996-01-01

The subject of C*-algebras received a dramatic revitalization in the 1970s by the introduction of topological methods through the work of Brown, Douglas, and Fillmore on extensions of C*-algebras and Elliott's use of K-theory to provide a useful classification of AF algebras. These results were the beginning of a marvelous new set of tools for analyzing concrete C*-algebras. This book is an introductory graduate level text which presents the basics of the subject through a detailed analysis of several important classes of C*-algebras. The development of operator algebras in the last twenty yea

Quantum walks, deformed relativity and Hopf algebra symmetries.

Science.gov (United States)

Bisio, Alessandro; D'Ariano, Giacomo Mauro; Perinotti, Paolo

2016-05-28

We show how the Weyl quantum walk derived from principles in D'Ariano & Perinotti (D'Ariano & Perinotti 2014Phys. Rev. A90, 062106. (doi:10.1103/PhysRevA.90.062106)), enjoying a nonlinear Lorentz symmetry of dynamics, allows one to introduce Hopf algebras for position and momentum of the emerging particle. We focus on two special models of Hopf algebras-the usual Poincaré and theκ-Poincaré algebras. © 2016 The Author(s).

An algebraic model for quark mass matrices with heavy top

International Nuclear Information System (INIS)

Krolikowski, W.; Warsaw Univ.

1991-01-01

In terms of an intergeneration U(3) algebra, a numerical model is constructed for quark mass matrices, predicting the top-quark mass around 170 GeV and the CP-violating phase around 75 deg. The CKM matrix is nonsymmetric in moduli with |V ub | being very small. All moduli are consistent with their experimental limits. The model is motivated by the author's previous work on three replicas of the Dirac particle, presumably resulting into three generations of leptons and quarks. The paper may be also viewed as an introduction to a new method of intrinsic dynamical description of lepton and quark mass matrices. (author)

Algebraic conformal field theory

International Nuclear Information System (INIS)

Fuchs, J.; Nationaal Inst. voor Kernfysica en Hoge-Energiefysica

1991-11-01

Many conformal field theory features are special versions of structures which are present in arbitrary 2-dimensional quantum field theories. So it makes sense to describe 2-dimensional conformal field theories in context of algebraic theory of superselection sectors. While most of the results of the algebraic theory are rather abstract, conformal field theories offer the possibility to work out many formulae explicitly. In particular, one can construct the full algebra A-bar of global observables and the endomorphisms of A-bar which represent the superselection sectors. Some explicit results are presented for the level 1 so(N) WZW theories; the algebra A-bar is found to be the enveloping algebra of a Lie algebra L-bar which is an extension of the chiral symmetry algebra of the WZW theory. (author). 21 refs., 6 figs

Logic Model Checking of Unintended Acceleration Claims in Toyota Vehicles

Science.gov (United States)

Gamble, Ed

2012-01-01

Part of the US Department of Transportation investigation of Toyota sudden unintended acceleration (SUA) involved analysis of the throttle control software, JPL Laboratory for Reliable Software applied several techniques including static analysis and logic model checking, to the software; A handful of logic models were build, Some weaknesses were identified; however, no cause for SUA was found; The full NASA report includes numerous other analyses

Boolean algebra essentials

CERN Document Server

Solomon, Alan D

2012-01-01

REA's Essentials provide quick and easy access to critical information in a variety of different fields, ranging from the most basic to the most advanced. As its name implies, these concise, comprehensive study guides summarize the essentials of the field covered. Essentials are helpful when preparing for exams, doing homework and will remain a lasting reference source for students, teachers, and professionals. Boolean Algebra includes set theory, sentential calculus, fundamental ideas of Boolean algebras, lattices, rings and Boolean algebras, the structure of a Boolean algebra, and Boolean

q-deformed Poincare algebra

International Nuclear Information System (INIS)

Ogievetsky, O.; Schmidke, W.B.; Wess, J.; Muenchen Univ.; Zumino, B.; Lawrence Berkeley Lab., CA

1992-01-01

The q-differential calculus for the q-Minkowski space is developed. The algebra of the q-derivatives with the q-Lorentz generators is found giving the q-deformation of the Poincare algebra. The reality structure of the q-Poincare algebra is given. The reality structure of the q-differentials is also found. The real Laplaacian is constructed. Finally the comultiplication, counit and antipode for the q-Poincare algebra are obtained making it a Hopf algebra. (orig.)

Generalizing the bms3 and 2D-conformal algebras by expanding the Virasoro algebra

Science.gov (United States)

Caroca, Ricardo; Concha, Patrick; Rodríguez, Evelyn; Salgado-Rebolledo, Patricio

2018-03-01

By means of the Lie algebra expansion method, the centrally extended conformal algebra in two dimensions and the bms3 algebra are obtained from the Virasoro algebra. We extend this result to construct new families of expanded Virasoro algebras that turn out to be infinite-dimensional lifts of the so-called Bk, Ck and Dk algebras recently introduced in the literature in the context of (super)gravity. We also show how some of these new infinite-dimensional symmetries can be obtained from expanded Kač-Moody algebras using modified Sugawara constructions. Applications in the context of three-dimensional gravity are briefly discussed.

Introduction to quantum algebras

International Nuclear Information System (INIS)

Kibler, M.R.

1992-09-01

The concept of a quantum algebra is made easy through the investigation of the prototype algebras u qp (2), su q (2) and u qp (1,1). The latter quantum algebras are introduced as deformations of the corresponding Lie algebras; this is achieved in a simple way by means of qp-bosons. The Hopf algebraic structure of u qp (2) is also discussed. The basic ingredients for the representation theory of u qp (2) are given. Finally, in connection with the quantum algebra u qp (2), the qp-analogues of the harmonic oscillator are discussed and of the (spherical and hyperbolical) angular momenta. (author) 50 refs

Continuum analogues of contragredient Lie algebras

International Nuclear Information System (INIS)

Saveliev, M.V.; Vershik, A.M.

1989-03-01

We present an axiomatic formulation of a new class of infinite-dimensional Lie algebras - the generalizations of Z-graded Lie algebras with, generally speaking, an infinite-dimensional Cartan subalgebra and a contiguous set of roots. We call such algebras ''continuum Lie algebras''. The simple Lie algebras of constant growth are encapsulated in our formulation. We pay particular attention to the case when the local algebra is parametrized by a commutative algebra while the Cartan operator (the generalization of the Cartan matrix) is a linear operator. Special examples of these algebras are the Kac-Moody algebras, algebras of Poisson brackets, algebras of vector fields on a manifold, current algebras, and algebras with differential or integro-differential Cartan operator. The nonlinear dynamical systems associated with the continuum contragredient Lie algebras are also considered. (author). 9 refs

Quiver W-algebras

Science.gov (United States)

Kimura, Taro; Pestun, Vasily

2018-06-01

For a quiver with weighted arrows, we define gauge-theory K-theoretic W-algebra generalizing the definition of Shiraishi et al. and Frenkel and Reshetikhin. In particular, we show that the qq-character construction of gauge theory presented by Nekrasov is isomorphic to the definition of the W-algebra in the operator formalism as a commutant of screening charges in the free field representation. Besides, we allow arbitrary quiver and expect interesting applications to representation theory of generalized Borcherds-Kac-Moody Lie algebras, their quantum affinizations and associated W-algebras.

Max plus at work modeling and analysis of synchronized systems a course on max-plus algebra and its applications

CERN Document Server

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

Applications of an anti-symmetry loop algebra and its expanding forms

International Nuclear Information System (INIS)

Zhang Yufeng; Yan Qingyou

2004-01-01

Constructing an anti-symmetry subalgebra A-tilde 2 of loop algebra A-tilde 2 gives the well-known Jaulent-Miodek (JM) hierarchy, the JM equation and its new Lax pair. Further, the Darboux transformation of the JM equation is deduced by anstaz method. By making use of a high-order loop algebra and Tu scheme, an expanding integrable model of the JM hierarchy is obtained. A direct expansion A-macron 2 * of loop algebra A-tilde 2 by considering the definition of Lie algebra is presented, which is used to establish two isospectral problems. It follows that corresponding two new integrable systems are engendered, which possess bi-Hamiltonian structures, respectively. Furthermore, a scalar transformation is applied to turn the loop algebra A-bar 2 * into its equivalent subalgebra A-tilde 1 of loop algebra A-tilde 1 . With the help of A-tilde 1 , another new high-order loop algebra G-bar is constructed, which is used to obtain an expanding integrable model of one of two integrable systems presented

Model Checking JAVA Programs Using Java Pathfinder

Science.gov (United States)

Havelund, Klaus; Pressburger, Thomas

2000-01-01

This paper describes a translator called JAVA PATHFINDER from JAVA to PROMELA, the "programming language" of the SPIN model checker. The purpose is to establish a framework for verification and debugging of JAVA programs based on model checking. This work should be seen in a broader attempt to make formal methods applicable "in the loop" of programming within NASA's areas such as space, aviation, and robotics. Our main goal is to create automated formal methods such that programmers themselves can apply these in their daily work (in the loop) without the need for specialists to manually reformulate a program into a different notation in order to analyze the program. This work is a continuation of an effort to formally verify, using SPIN, a multi-threaded operating system programmed in Lisp for the Deep-Space 1 spacecraft, and of previous work in applying existing model checkers and theorem provers to real applications.

Symmetric linear systems - An application of algebraic systems theory

Science.gov (United States)

Hazewinkel, M.; Martin, C.

1983-01-01

Dynamical systems which contain several identical subsystems occur in a variety of applications ranging from command and control systems and discretization of partial differential equations, to the stability augmentation of pairs of helicopters lifting a large mass. Linear models for such systems display certain obvious symmetries. In this paper, we discuss how these symmetries can be incorporated into a mathematical model that utilizes the modern theory of algebraic systems. Such systems are inherently related to the representation theory of algebras over fields. We will show that any control scheme which respects the dynamical structure either implicitly or explicitly uses the underlying algebra.

Abstract algebra

CERN Document Server

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

A Cohomological Perspective on Algebraic Quantum Field Theory

Science.gov (United States)

Hawkins, Eli

2018-05-01

Algebraic quantum field theory is considered from the perspective of the Hochschild cohomology bicomplex. This is a framework for studying deformations and symmetries. Deformation is a possible approach to the fundamental challenge of constructing interacting QFT models. Symmetry is the primary tool for understanding the structure and properties of a QFT model. This perspective leads to a generalization of the algebraic quantum field theory framework, as well as a more general definition of symmetry. This means that some models may have symmetries that were not previously recognized or exploited. To first order, a deformation of a QFT model is described by a Hochschild cohomology class. A deformation could, for example, correspond to adding an interaction term to a Lagrangian. The cohomology class for such an interaction is computed here. However, the result is more general and does not require the undeformed model to be constructed from a Lagrangian. This computation leads to a more concrete version of the construction of perturbative algebraic quantum field theory.

A Cohomological Perspective on Algebraic Quantum Field Theory

Science.gov (United States)

Hawkins, Eli

2018-02-01

Algebraic quantum field theory is considered from the perspective of the Hochschild cohomology bicomplex. This is a framework for studying deformations and symmetries. Deformation is a possible approach to the fundamental challenge of constructing interacting QFT models. Symmetry is the primary tool for understanding the structure and properties of a QFT model. This perspective leads to a generalization of the algebraic quantum field theory framework, as well as a more general definition of symmetry. This means that some models may have symmetries that were not previously recognized or exploited. To first order, a deformation of a QFT model is described by a Hochschild cohomology class. A deformation could, for example, correspond to adding an interaction term to a Lagrangian. The cohomology class for such an interaction is computed here. However, the result is more general and does not require the undeformed model to be constructed from a Lagrangian. This computation leads to a more concrete version of the construction of perturbative algebraic quantum field theory.

Twisted classical Poincare algebras

International Nuclear Information System (INIS)

Lukierski, J.; Ruegg, H.; Tolstoy, V.N.; Nowicki, A.

1993-11-01

We consider the twisting of Hopf structure for classical enveloping algebra U(g), where g is the inhomogeneous rotations algebra, with explicite formulae given for D=4 Poincare algebra (g=P 4 ). The comultiplications of twisted U F (P 4 ) are obtained by conjugating primitive classical coproducts by F element of U(c)xU(c), where c denotes any Abelian subalgebra of P 4 , and the universal R-matrices for U F (P 4 ) are triangular. As an example we show that the quantum deformation of Poincare algebra recently proposed by Chaichian and Demiczev is a twisted classical Poincare algebra. The interpretation of twisted Poincare algebra as describing relativistic symmetries with clustered 2-particle states is proposed. (orig.)

Using process algebra to develop predator-prey models of within-host parasite dynamics.

Science.gov (United States)

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

An algebraic interpretation of PSP composition.

Science.gov (United States)

Vaucher, G

1998-01-01

The introduction of time in artificial neurons is a delicate problem on which many groups are working. Our approach combines some properties of biological models and the algebraic properties of McCulloch and Pitts artificial neuron (AN) (McCulloch and Pitts, 1943) to produce a new model which links both characteristics. In this extended artificial neuron, postsynaptic potentials (PSPs) are considered as numerical elements, having two degrees of freedom, on which the neuron computes operations. Modelled in this manner, a group of neurons can be seen as a computer with an asynchronous architecture. To formalize the functioning of this computer, we propose an algebra of impulses. This approach might also be interesting in the modelling of the passive electrical properties in some biological neurons.

Pre-Algebra Essentials For Dummies

CERN Document Server