The identification problem for excitable media is investigated in this paper. A new scalar coupled map lattice (SCML) model is introduced and the orthogonal least squares algorithm is employed to determinate the structure of the SCML model and to estimate the associated parameters. A simulated pattern and a pattern observed directly from a real Belousov–Zhabotinsky reaction are identified. The ...

In this thesis, the multiple-relaxation-time model of the collision operator in the lattice Boltzmann method is presented. In contrast to the simple Bhatnagar-GrossKrook approximation, not only a single but various relaxation parameters are available and can be used to optimise the simulation results. The main idea behind this approach is the construction of a space based on the moments of the ...

We summarise what lattice simulations have to say about the physical properties of continuum SU(N) gauge theories in 3+1 dimensions. The quantities covered are: the glueball mass spectrum, the confining string tension, the temperature at which the theory becomes deconfined, the topological susceptibility, the value of the scale ΛMS that governs the rate at which the coupling runs and the r0 par...

Minimizing the rank of a matrix subject to affine constraints is a fundamental problem with many important applications in machine learning and statistics. In this paper we propose a simple and fast algorithm SVP (Singular Value Projection) for rank minimization with affine constraints (ARMP) and show that SVP recovers the minimum rank solution for affine constraints that satisfy the restricted...

Several papers relate different alternative approaches to classical concept lattices: such as property-oriented and object-oriented concept lattices and the dual concept lattices. Whereas the usual approach to the latter is via a negation operator, this paper presents a fuzzy generalization of the dual concept lattice, the dual multi-adjoint concept lattice, in which the philosophy of the multi...

The boolean hierarchy of partitions was introduced and studied by K. Wagner and S. Kosub, mostly over the lattice of NP -sets. We consider this hierarchy for the case of lattices having the reduction property and show that in this case the hierarchy behaves much easier and admits a deeper investigation. We completely characterize the hierarchy over some concrete important lattices, e.g. over th...

This note gives a complete characterization of when the ordinal sum of two lattices (the lattice obtained by placing the second lattice on top of the first) is projective. This characterization applies not only to the class of all lattices, but to any variety of lattices, and in particular, to the class of distributive lattices. Lattices L with the property that every epimorphism onto L has an ...

The theory of abelian totally ordered groups has a model completion. We show that the theory of abelian lattice-ordered groups has no model companion. Indeed, the Archimedean property can be captured by a first order V3V sentence for existentially complete abelian lattice-ordered groups, and distinguishes between finitely generic abelian lattice-ordered groups and infinitely generic ones. We th...

We propose an alternate Givens rotation-based least-squares lattice algorithm. Based on spherical trigonometry principles, this algorithm turns out to be a normalized version of the fast QRD-based least-squares lattice filter, introduced independently by Ling and by Proudler et al. In constrast with that algorithm, the storage requirements of the new algorithm are minimal (in the system theory ...

In this paper, we introduce theta-functions of VOA-modules and show that the space spanned by them has a modular invariance property. If a VOA is a lattice VOA VL associated with an even lattice L (cf. [FLM]), then the above theta functions coincide to the ordinary theta functions θ(τ, ~v) = ∑ m∈L+β e πıτ+ for < β,L >⊆ Z, ~v ∈ CL and τ ∈ H.