QEPAS系统中石英音叉模态仿真计算与研究

对石英音叉增强型光声光谱(QEPAS)系统中常用的石英音叉进行了有限元模态计算，获得石英音叉前6阶振型与模态频率，认知了第4阶对称摆动振型为有效振动，利用单因素法分析了石英音叉的音臂长度l₁、音臂宽度w₁、音臂厚度t、音臂切角θ、音臂圆孔直径d及音臂圆孔高度h对低阶有效共振频率(Fre)的影响，敏感度依次为： l₁> w₁>d>θ>t>h，考虑实际设计情形，筛选出了l₁，w₁，d与h四个石英音叉设计变量，采用Box-Behnken实验设计方案与RSM(response surface methodology)方法，以Fre为函数目标，建立l₁，w₁，d与h的二次回归响应面模型，得到了参数之间的交互作用，利用Design-Expert软件对响应面模型进行设计参数反求，结果表明，在15 000 Hz≤Fre≤25 000 Hz计算区域内误差较小，基本满足QEPAS系统的计算需求，所提出的研究与设计方法具有一定通用性，可为QEPAS系统中石英音叉结构参数设计提供参考。     

A finite model property for RMImin

It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI _min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI _min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On Binary Computation Structures

Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for knowledge and nexttime. These operators are interpreted in binary computation structures. We present an axiomatization of the set T of theorems valid for this class of semantical domains and prove – as the main result of this paper – its completeness. Moreover, the question of decidability of T is treated.     

A parametric representation of linguistic hedges in Zadeh’s fuzzy logic

This paper proposes a model for the parametric representation of linguistic hedges in Zadeh’s fuzzy logic. In this model each linguistic truth-value, which is generated from a primary term of the linguistic truth variable, is identified by a real number r depending on the primary term. It is shown that the model yields a method of efficiently computing linguistic truth expressions accompanied with a rich algebraic structure of the linguistic truth domain, namely De Morgan algebra. Also, a fuzzy logic based on the parametric representation of linguistic truth-values is introduced.     

求解通信网节点间全部路由的逻辑代数化算法

经典的D IJKSTRA和BELLM AN-F LOYD通信网络路由算法,只能根据特定网络参数得到最佳路由,却无法获得网络存在的全部可用路由,而通信网理论研究及网络管理等方面,往往需要获得节点之间的全部可用路由.研究出一种路由新算法,遵循逻辑代数运算规则、采用关联矩阵中行与行之间整合与删除方式计算,N个节点的网络只需N-1次整合及删除运算,就能得到源节点到任意节点两点之间全部路由结果.详细论证了算法的正确性与合理性,简介了算法的并行运算可行性及与经典路由算法的兼容性等问题.通过算例详细说明算法的计算过程,并验证其正确性.     

Group-valued measures on coarse-grained quantum logics

In [3] it was shown that a (real) signed measure on a cyclic coarse-grained quantum logic can be extended, as a signed measure, over the entire power algebra. Later ([9]) this result was re-proved (and further improved on) and, moreover, the non-negative measures were shown to allow for extensions as non-negative measures. In both cases the proof technique used was the technique of linear algebra. In this paper we further generalize the results cited by extending group-valued measures on cyclic coarse-grained quantum logics (or non-negative group-valued measures for lattice-ordered groups). Obviously, the proof technique is entirely different from that of the preceding papers. In addition, we provide a new combinatorial argument for describing all atoms of cyclic coarse-grained quantum logics.     

A New View on Fuzzy Hypermodules

We describe the relationship between the fuzzy sets and the algebraic hyperstructures. In fact, this paper is a continuation of the ideas presented by Davvaz in （Fuzzy Sets Syst., 117： 477- 484, 2001） and Bhakat and Das in （Fuzzy Sets Syst., 80： 359-368, 1996）. The concept of the quasicoincidence of a fuzzy interval value with an interval-valued fuzzy set is introduced and this is a natural generalization of the quasi-coincidence of a fuzzy point in fuzzy sets. By using this new idea, the concept of interval-valued （α,β）-fuzzy sub-hypermodules of a hypermodule is defined. This newly defined interval-valued （α,β）-fuzzy sub-hypermodule is a We shall study such fuzzy sub-hypermodules and sub-hypermodules of a hypermodule. generalization of the usual fuzzy sub-hypermodule. consider the implication-based interval-valued fuzzy     

Tensor Products of Quantum Structures and Their Applications in Quantum Measurements

Tensor products of quantum logics and effect algebras with some known problems are reviewed. It is noticed that although tensor products of effect algebras having at least one state exist, in the category of complex Hilbert space effect algebras similar problems as with tensor products of projection lattices occur. Nevertheless, if one of the two coupled physical systems is classical, tensor product exists and can be considered as a Boolean power. Some applications of tensor products (in the form of Boolean powers) to quantum measurements are reviewed.     

Reflection of Long Game Formulas

We study game formulas the truth of which is determined by a semantical game of uncountable length. The main theme is the study of principles stating reflection of these formulas in various admissible sets. This investigation leads to two weak forms of strict-II¹₁ reflection (or ∑₁-compactness). We show that admissible sets such as H(ω₂) and L_ω2 which fail to have strict-II¹₁ reflection, may or may not, depending on set-theoretic hypotheses satisfy one or both of these weaker forms. Mathematics Subject Classification : 03C70, 03C75.     

数学分析中的一题多解问题

通过两个积分 (一个是不定积分 ,一个是定积分 )及一个极限 ,说明如何灵活使用积分法解决积分问题 ,方法灵活、巧妙 ,适用范围广 .