线性系统的纯点谱和弱Lyapunov相似

本文引入了线性系统的弱Ｌｙａｐｕｎｏｖ相似的概念，并且得到：具有纯点谱的有界线性系统弱Ｌｙａｐｕｎｏｖ相似于常系数对角线线性系统．     

网络体系结构建模和性能评价的形式化方法——随机进程代数

随机进程代数是从经典进程代数发展起来 ,用于并发系统的定性和定量分析的形式化方法 ,特别适合在计算机网络和通信协议的建模和性能评价 .首先介绍了 SPA的语法和操作语义 .并以令牌环局域网模型为例来说明其应用 .进一步讨论了 SPA的三种等价关系 ,以期解决模型状态空间爆炸问题 .     

Weak relatively uniform convergences on abelian lattice ordered groups

The notion of relatively uniform convergence has been applied in the theory of vector lattices and in the theory of archimedean lattice ordered groups. Let G be an abelian lattice ordered group. In the present paper we introduce the notion of weak relatively uniform convergence (wru-convergence, for short) on G generated by a system M of regulators. If G is archimedean and M = G ⁺, then this type of convergence coincides with the relative uniform convergence on G. The relation of wru-convergence to the o-convergence is examined. If G has the diagonal property, then the system of all convex ℓ-subgroups of G closed with respect to wru-limits is a complete Brouwerian lattice. The Cauchy completeness with respect to wru-convergence is dealt with. Further, there is established that the system of all wru-convergences on an abelian divisible lattice ordered group G is a complete Brouwerian lattice.     

M—矩阵的等价表征

本文引进了按环路弱不约非零元素对角占优的概念，讨论了Ｍ－矩阵的等价条件，给出了Ｍ－矩阵的两个等价表征，改进与推广了（１），（２），（５），（９）的相应结果。     

On the free implicative semilattice extension of a Hilbert algebra

Hilbert algebras provide the equivalent algebraic semantics in the sense of Blok and Pigozzi to the implication fragment of intuitionistic logic. They are closely related to implicative semilattices. Porta proved that every Hilbert algebra has a free implicative semilattice extension. In this paper we introduce the notion of an optimal deductive filter of a Hilbert algebra and use it to provide a different proof of the existence of the free implicative semilattice extension of a Hilbert algebra as well as a simplified characterization of it. The optimal deductive filters turn out to be the traces in the Hilbert algebra of the prime filters of the distributive lattice free extension of the free implicative semilattice extension of the Hilbert algebra. To define the concept of optimal deductive filter we need to introduce the concept of a strong Frink ideal for Hilbert algebras which generalizes the concept of a Frink ideal for posets.     

Track initiation of bearings-only tracking based on ant navigation concept

A novel heuristic track initiation method is developed for the bearing-only multi-sensor–multi-target tracking system, in which each target is assumed to move with a straight line. The key idea of the proposed method is derived from the ant navigation concept in its foraging life, which differs from the traditional ant colony optimization algorithm, and it utilizes the concept of path integration and visual landmarks in ants’ navigation toolkit to find the exact positions of each target. Numerous numerical simulations are conducted and the effectiveness of the proposed track initiation method is verified according to the probability of correct track initiation.     

A genetic design of linguistic terms for fuzzy rule based classifiers

The determination of fuzzy information granules including the estimation of their membership functions play a significant role in fuzzy system design as well as in the design of fuzzy rule based classifiers (FRBCSs). However, although linguistic terms are fundamental elements in the process of elucidating expert’s knowledge, the problem of linguistic term design along with their fuzzy-set-based semantics has not been fully addressed, since term-sets of attributes have not been interpreted as a formalized structure. Thus, the essential relationship between linguistic terms, as syntax, and the constructed fuzzy sets, as their quantitative semantics, or in other words, the problem of the natural semantics of terms behind the linguistic literal has not been addressed. In this paper, we introduce the problem of the design of optimal linguistic terms and propose a method of the design of FRBCSs which may incorporate with the design of linguistic terms to ensure that the presence of linguistic literals are supported not only by data but also by their natural semantics. It is shown that this problem plays a primordial role in enhancing the performance and the interpretability of the designed FRBCSs and helps striking a better balance between the generality and the specificity of the desired fuzzy rule bases for fuzzy classification problems. A series of experiments concerning 17 Machine Learning datasets is reported.     

Probabilistic stit logic and its decomposition

We define an extension of stit logic that encompasses subjective probabilities representing beliefs about simultaneous choice exertion of other agents. This semantics enables us to express that an agent sees to it that a condition obtains under a minimal chance of success. We first define the fragment of XSTIT where choice exertion is not collective. Then we add lower bounds for the probability of effects to the stit syntax, and define the semantics of the newly formed stit operator in terms of subjective probabilities concerning choice exertion of other agents. We show how the resulting probabilistic stit logic faithfully generalizes the non-probabilistic XSTIT fragment. In a second step we analyze the defined probabilistic stit logic by decomposing it into an XSTIT fragment and a purely epistemic fragment. The resulting epistemic logic for grades of believes is a weak modal logic with a neighborhood semantics combining probabilistic and modal logic theory.     

Slim Semimodular Lattices. II. A Description by Patchwork Systems

Rectangular lattices are special planar semimodular lattices introduced by G. Grätzer and E. Knapp in Acta Sci Math 75:29–48, 2009. A patch lattice is a rectangular lattice whose weak corners are coatoms. As a variant of gluing, we introduce the concept of a patchwork system. We prove that every glued sum indecomposable, planar, semimodular lattice is a patchwork of its maximal patch lattice intervals. For a planar modular lattice, our patchwork system is the same as the S-glued system introduced by C. Herrmann in Math Z 130:255–274, 1973. Among planar semimodular lattices, patch lattices are characterized as the patchwork-irreducible ones. They are also characterized as the indecomposable ones with respect to gluing over chains; this gives another structure theorem.     

Logic as Calculus Versus Logic as Language, Language as Calculus Versus Language as Universal Medium, and Syntax Versus Semantics

This paper discusses the distinctions indicated in its title. It is argued that the distinction between syntax and semantics is much more important for the present situation in logic than other distinctions. In particular, doing formal syntax and formal semantics requires the use of an informal melanguage based on ordinary mathematics.     

Numerical evaluation of two recoloring operators for an immiscible two-phase flow lattice Boltzmann model

The lattice Boltzmann method is applied to the study of immiscible two-phase flows using a Rothman-Keller-type (RK) model. The focus is on the algorithm proposed by Latva-Kokko and Rothman, which has been modified and integrated into the Reis and Phillips model, which belongs to the RK family. A key element of the RK model is the recoloring step applied at the interface of two fluids, at which the fluids are separated and sent to their own region. When convection is weak, the interface in the Reis and Phillips model suffers from “lattice pinning”, which is a problem that may prevent the interface from moving. While the recoloring algorithm proposed by Latva-Kokko and Rothman diminishes this problem, it was not used in the work of Reis and Phillips. This is the framework in which the present study has been conducted. Its scope is twofold: first, to integrate and adapt the Latva-Kokko and Rothman recoloring algorithms for reducing the lattice pinning problem found in the Reis and Phillips model; and second, to conduct a set of numerical tests to show that the combination of the two algorithms leads to an improvement in the quality of the results, along with a better convergence. The context of the work is two-dimensional, with the D2Q9 lattice used as the basic computational element.     

A note on representation of lattices by weak congruences

A weak congruence is a symmetric, transitive, and compatible relation. An element u of an algebraic lattice L is ??-suitable if there is an isomorphism ?? from L to the lattice of weak congruences of an algebra such that ??(u) is the diagonal relation. Some conditions implying the ??-suitability of u are presented.     

A concept of nonlinear block diagonal dominance

We introduce a concept of block diagonal dominance for nonlinear functions, and discuss the relations to strictly diagonally dominant functions and M-functions. Some sufficient conditions for the new kind of functions are given. The global convergence of block asynchronous SOR-methods for finding zeros of block diagonal dominant nonlinear functions is proved.     

基于粗集与概念格的属性简约讨论

概念格的属性简约是在形式背景下解决复杂问题的重要途径,通过对概念格、粗糙集的讨论,将两者有效结合,并借助粗糙集上(下)近似的方法,得出了一个对概念格属性简约的方法,方法将二维的概念格属性简约转化为一维的一种对象格的简约,避免了形式背景下的概念的计算和进一步的可辨识矩阵的计算,方法简便,算法简单易实现,是概念格属性简约有效的算法.     

Weak periodic shift operator and generalized-periodic motions

We introduce the notions of a weak periodic system and its generalized-periodic motions. Such systems include systems generated by ordinary differential equations, equations with retarded argument, Volterra type equations, etc. We present a criterion for the existence of generalized-periodic motions and establish their main properties.     

提高软件Agent策略生成的语义互操作能力

软件Agent遇到语义二义性时无法正确地为用户解决矛盾问题.利用本体支持语义互操作的特点,在软件Agent策略生成机制中引入复合元本体,加入Agent智能引导的人机交互方法,实现了具有语义歧义消除能力的可拓策略生成系统.当用户输入的问题信息语义模糊时,Agent根据本体中的知识与用户交互,逐步理解用户的信息语义,直到能为用户生成解决矛盾问题的策略.以旅游与购物问题为例进行了实验,结果表明了软件Agent策略生成的语义互操作能力得到了提高.     

Correlation Function of the Two-Dimensional Ising Model on a Finite Lattice: I

The spin–spin correlation function of the two-dimensional Ising model with nearest-neighbor interaction is calculated on a finite lattice with periodic boundary conditions. The representations, which are analogous to the form-factor representation, are obtained for the ferromagnetic and paramagnetic domains of the interaction parameter. We discuss the effects of the finiteness of the system. We investigate the asymptotic dependence of the corresponding quantities on the lattice size.     

A semantic hierarchy for intuitionistic logic

Brouwer’s views on the foundations of mathematics have inspired the study of intuitionistic logic, including the study of the intuitionistic propositional calculus and its extensions. The theory of these systems has become an independent branch of logic with connections to lattice theory, topology, modal logic, and other areas. This paper aims to present a modern account of semantics for intuitionistic propositional systems. The guiding idea is that of a hierarchy of semantics, organized by increasing generality: from the least general Kripke semantics on through Beth semantics, topological semantics, Dragalin semantics, and finally to the most general algebraic semantics. While the Kripke, topological, and algebraic semantics have been extensively studied, the Beth and Dragalin semantics have received less attention. We bring Beth and Dragalin semantics to the fore, relating them to the concept of a nucleus from pointfree topology, which provides a unifying perspective on the semantic hierarchy.     

Long-range order in quantum lattice systems of linear oscillators

The existence of the ferromagnetic long-range order is proved for equilibrium quantum lattice systems of linear oscillators whose potential energy contains a strong ferromagnetic nearest-neighbor (nn) pair interaction term and a weak nonferromagnetic term under a special condition on a superstability bound. It is shown that the long-range order is possible if the mass of a quantum oscillator and the strength of the ferromagnetic nn interaction exceed special values. A generalized Peierls argument and a contour bound, proved with the help of a new superstability bound for correlation functions, are our main tools. Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 58, No. 10, pp. 1407–1424, October, 2006.     

Some difficulties with abstract and concrete syntax

Abstract syntax is a useful mechanism in defining the semantics of programming languages as it relieves the semantic definition from text handling and syntactic analysis and shows clearly the semantically essential parts of program texts. Abstract syntax is usually required to have a high quality semantic content and so a straightforward forming of abstract syntax from a concrete one may lead to many errors. This paper introduces three error-prone constructs: parentheses that have an uncommon meaning, ambiguous concrete syntax, and empty lists. The first two errors originate in problems with concrete syntax while the last one is due to a weakness of some formalisms for abstract syntax.