相关论文: Evolving Algebras and Partial Evaluation
Some algebraic aspects of field quantization in space-time with boundaries are discussed. We introduce an associative algebra, whose exchange properties are inferred from the scattering processes in integrable models with reflecting…
We introduce a dynamical evolution operator for dealing with unstable physical process, such as scattering resonances, photon emission, decoherence and particle decay. With that aim, we use the formalism of rigged Hilbert space and…
We discuss the deal of imperfectness of atomic actions in reality with the background of process algebras. And we show the applications of the imperfect actions in verification of computational systems.
We consider the classical \w42 algebra from the integrable system viewpoint. The integrable evolution equations associated with the \w42 algebra are constructed and the Miura maps , consequently modifications, are presented. Modifying the…
We associate an square to any two dimensional evolution algebra. This geometric object is uniquely determined, does not depend on the basis and describes the structure and the behaviour of the algebra. We determine the identities of degrees…
This paper surveys and organizes research works in an under-studied area, which we call automated evaluation for student argumentative writing. Unlike traditional automated writing evaluation that focuses on holistic essay scoring, this…
We give an overview of some recent developments in semigroup C*-algebras.
We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…
We formulate stochastic partial differential equations on Riemannian manifolds, moving surfaces, general evolving Riemannian manifolds (with appropriate assumptions) and Riemannian manifolds with random metrics, in the variational setting…
We prolonge the list of C*-algebras for which all extensions by any stable separable C*-algebra are semi-invertible. In particular, we handle certain amalgamations, both of C*-algebras and of groups. Concerning groups we consider both…
We give a brief survey of the development of the Elliott program of classification of separable simple amenable $C^*$-algebras.
State-of-the-art review of cellular automata, cellular automata for partial differential equations, differential equations for cellular automata and pattern formation in biology and engineering.
We describe here a library aimed at automating the solution of partial differential equations using the finite element method. By employing novel techniques for automated code generation, the library combines a high level of expressiveness…
In this article we study algebraic structures of function spaces defined by graphs and state spaces equipped with Gibbs measures by associating evolution algebras. We give a constructive description of associating evolution algebras to the…
We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…
We discuss the application of computer algebra to problems commonly arising in numerical relativity, such as the derivation of 3+1-splits, manipulation of evolution equations and automatic code generation. Particular emphasis is put on…
We study \'etale descent of derivations of algebras with values in a module. The algebras under consideration are twisted forms of algebras over rings, and apply to all classes of algebras, notably associative and Lie algebras, such as the…
In this work I discuss briefly the calculation of the algebraic entropy for systems of quad equations. In particular, I observe that since systems of multilinear equations can have algebraic solution, in some cases one might need to…
An analytical method for investigation of the evolution of dynamical systems {\it with independent on time accuracy} is developed for perturbed Hamiltonian systems. The error-free estimation using of computer algebra enables the application…
To date, most probabilistic reasoning systems have relied on a fixed belief network constructed at design time. The network is used by an application program as a representation of (in)dependencies in the domain. Probabilistic inference…