MV代数的子代数及相关重言式之间的关系

对MV单位区间[[0,1]]和n-值MV代数[Ln]的子代数的结构问题及其上重言式之间的关系进行了较为细致的研究。主要结论是：如果MV单位区间[[0,1]]的子代数[M]同构于n-值MV代数[Ln]的子代数,那么,存在正整数[m]满足[(m-1)|(n-1)]使得[M=Lm];如果[M]是MV单位区间[[0,1]]的子代数,那么或[M]为有限MV代数[Ln],或[M]为区间[[0,1]]上包含[{0,1}]的稠密集;若正整数[n-1]可分解为[(m1-1)(m2-1)?(mt-1)],其中[m1-1,m2-1,?,mt-1]是两两互素的正整数,则[Ln]是[Lm1,Lm2,?,Lmt]生成的MV代数;[T([0,1])=n=2∞T(Ln)],其中[T(M)]表示MV代数[M]上全体重言式之集合。     

二值命题逻辑中逻辑理论的计量化及应用

在二值命题逻辑系统中,利用势为2的均匀概率测度空间的无穷乘积,通过计算理论[Γ]的全体模型占整个赋值空间的测度定义了理论[Γ]的真度,进而利用理论的真度简化了理论的发散度和相容度的计算公式,给出了由推理的前提集的真度估计其逻辑结论真度的表达式。     

基于Stuttering等价技术的有界模型检测的优化

在讨论有界模型检测及其转换公式的基础上,对有界模型检测转换公式[[M,f]]k中的[[M]]k进行优化。通过在LTL有界模型检测中引入Stuttering等价技术,对状态转换路径优化,避免了SAT求解工具在有界Stuttering等价路径中的重复搜索。以安全系统验证为例,通过两个重要的模态算子G（p）和G（p→F（q））,验证优化方法,实验结果表明,该方法有效地提高了对安全系统保密性和认证性验证的效率。     

环[F2+uF2+vF2]上的[(1+v)-]常循环码

研究了环[R=F2+uF2+vF2] 上的[(1+v)-]常循环码。利用环[R]上奇长循环码的生成元来刻画环[R]上奇长的[(1+v)-]常循环码,进而给出了[Rn]到[(F2+uF2)2n]的一个广义Gray映射[φ],证明了环[R]上的[(1+v)-]常循环码[C]在[φ]下的广义Gray像[φ(C)]是环[F2+uF2]上的循环码。     

P-集合与F-数据选择-发现

P-集合是由内P-集合[XF]与外P-集合[XF]构成的集合对,或者[(XF,XF)]是P-集合。P-集合具有动态特性。P-集合是把动态特性引入到普通有限集合[X]中,得到的一个新的数学概念与数学模型。利用P-集合,给出[F]-数据,[F]-数据选择准则,[F]-数据选择定理,并利用这些理论结果,给出[F]-数据选择的应用。P-集合是研究数据系统的一个新的数学模型。     

优化初始聚类中心的K-means聚类算法

针对传统K-means算法对初始中心十分敏感,聚类结果不稳定问题,提出了一种改进K-means聚类算法。该算法首先计算样本间的距离,根据样本距离找出距离最近的两点形成集合,根据点与集合的计算公式找出其他所有离集合最近的点,直到集合内数据数目大于或等于[α]（[α]为样本集数据点数目与聚类的簇类数目的比值）,再把该集合从样本集中删除,重复以上步骤得到K（K为簇类数目）个集合,计算每个集合的均值作为初始中心,并根据K-means算法得到最终的聚类结果。在Wine、Hayes-Roth、Iris、Tae、Heart-stalog、Ionosphere、Haberman数据集中,改进算法比传统K-means、K-means++算法的聚类结果更稳定;在Wine、Iris、Tae数据集中,比最小方差优化初始聚类中心的K-means算法聚类准确率更高,且在7组数据集中改进算法得到的轮廓系数和F1值最大。对于密度差异较大数据集,聚类结果比传统K-means、K-means++算法更稳定,更准确,且比最小方差优化初始聚类中心的K-means算法更高效。     

量子纠错码[[7,1,4]]_p(p>3)存在性的图论构造方法

利用由Schingemann和Werner两人提出的构造量子纠错码的图论方法,证明了量子纠错码[[7,1,4]]p(p>3)的存在性。     

格蕴涵代数中的极小素理想及α-理想

在格蕴涵代数中,证明了极小素理想与极小格素理想的等价性,继而给出了极小素理想与零化子的相互表示定理。提出了格蕴涵代数中的[α]-理想概念并给出其若干等价刻画,证明了极小素理想是[α]-理想。证明了全体素[α]-理想之集[Sα(L)]是一个紧的Stone空间,进一步给出[Sα(L)]分别是[T1、][T2]拓扑空间的充要条件。     

Construction of punctured and extended quantum codes over GF(2)

On the basis of elementary transformation,we propose a new method for constructing a class of pure quantum codes [[n-i,2k-n+i,d-i]]2 and [[n+1,2k-n-1,d+1]]2 from a class of classical linear codes [n,k,d]2 that contain their dual codes.The construction process was based on the elementary algebra;the error-correcting performance of the quantum codes was analyzed according to the relationship between the parity-check matrix and the minimum distance of the classical linear codes;the encoding and decoding networks were constructed based on the stabilizer.The proposed method is simple,straightforward and easy to implement using a computer and other hardware system.The theoretical results showed that the method is practical for the construction of a class of quantum codes.     

时间窗对UWB系统的平均误比特率影响

在IEEE 802.15.3a超宽带（UWB）信道模型两个场景基础上,采用二进制信号调制方案,推导了超宽带系统接收机端加信号观察时间窗[[0,T]]的平均误比特率[Pe]公式,提出了两种时间窗选取方法来寻找合适的窗长[T],仿真结果表明所提出的时间窗选取方法在保证捕获了大部分信道特性基础上,其平均误比特率[Pe]接近理论值,并减少了信号观察时间。     

Attacks on the (enhanced) Yang-Shieh authentication

The Yang-Shieh authentication is a time-stamp based password authentication scheme that uses smart cards [[1]]. In [ [2 and 3]], various attacks on this scheme are described. However, an enhancement of the scheme is proposed in [ [3]] and enables the scheme to resist these existing attacks. In this paper, we show two new attack that can break the enhanced scheme. We further point out that the fundamental computational assumption of the Yang-Shieh authentication scheme is incorrect.     

An equivalence theorem for labeled marked graphs

Petri nets and their languages are a useful model of systems exhibiting concurrent behavior. The sequential language associated with a given Petri net S consists of all possible firing sequences of S, where each element of a firing sequence is a single transition. The concurrent language associated with S consists of all possible concurrent firing sequences of S, where each element of a concurrent firing sequence is a set of transitions. The sequential language and the concurrent language associated with S are denoted by (L)(S) and (π)(S), respectively. In this paper, we consider an important special ease of Petri nets, called labeled marked graphs. The main result derived in this paper states that if Γ₁ and Γ₂ are two structurally deterministic labeled marked graphs, then (L)(Γ₁)=L(Γ₂)&rlhar2;π(Γ ₁)=π(Γ₂)     

三值命题逻辑系统中理论的随机发散度的分布

在三值命题逻辑系统的随机逻辑度量空间[(F(S),ρp)]中,指出理论的[p]-随机发散度是和随机三值分布序列[p=(p1,p2,…)]的具体取值密切相关的,证明了全体原子公式之集[S]的[p]-随机发散度随着三值分布序列[p]的不同取值可以充满整个[(0,1]]实数区间。     

二值逻辑系统中理论的随机发散度的分布

在二值命题逻辑系统的随机逻辑度量空间[(F(S),ρp)]中提出理论的[p]-随机发散度概念,指出理论的[p]-随机发散度是和随机两点分布序列[p=(p1,p2,?)]的具体取值密切相关的,证明了全体原子公式集[S]的[p]-随机发散度随着两点分布序列[p]的不同取值可以充满整个实数[(0,1]]区间。     

n元经典逻辑度量空间中的平移变换

利用模2的加法运算和逻辑公式的向量表示构造了n元经典逻辑度量空间中的平移变换。得到了平移变换的一些简单性质,证明了平移变换保持非运算,但不保持交、并、蕴涵运算;得到了逻辑理论的发散度、有限理论的相容度在平移变换之下不变的结论。证明了平移变换之集构成一个群;在经典逻辑度量空间中以公式类中公式的真度为范数,进一步证明了[(Fn(S),ρ)]关于该范数可以构成次范整线性空间。     

Composite materials non-linear modelling for long fibre-reinforced laminates: Continuum basis, computational aspects and validations

An innovative computational methodology is proposed for modelling the material non-linear mechanical behaviour of FRP structures. To model a single unidirectional composite lamina, a serial-parallel (SP) continuum approach has been developed assuming that components behave as parallel materials in the fibres alignment direction and as serial materials in orthogonal directions. The model is based on the appropriate management of the constitutive models of the component materials, by making use of suitable ‘closure equations’ that characterize the composite micro-mechanics [Rastellini F. Modelización numérica de la no-linealidad constitutiva de laminados compuestos. PhD thesis. ETSECCPB, Politechnical University of Catalonia, Barcelona, March, 2006. [in Spanish]]. Classical lamination theory is combined with the SP model to describe multidirectional laminates. The methodology is validated through several numerical analyses, which are contrasted against benchmark tests and experimental data taken from the world-wide failure exercise [Hinton MJ, Soden PD. Predicting failure in composite laminates: The background to the exercise. Comp Sci Technol 1998; 58:1001-10].     

An ontology-based collaborative service-oriented simulation framework with Microsoft Robotics Studio®

In Service-Oriented Architecture (SOA), the concepts that services can be discovered and application can be composed via service discovery bring great flexibility to application development [Y. Chen, W.T. Tsai, Distributed Service-Oriented Software Development, Kendall/Hunt, 2008, [4]]. Microsoft Robotics Studio (MSRS) is a recent initiative in applying SOA to embedded systems and one of its key features is its 3-D simulation tool that allows applications to be simulated before deployment. This paper proposes an ontology-based service-oriented simulation framework with MSRS by adding a set of ontology systems, i.e., service ontology, workflow ontology, entity ontology, and environment ontology. These ontology systems store relevant information useful to compose simulation applications, and items stored also cross reference to each other to facilitate reusability and rapid application composition, This paper then provides a detailed case study on a popular robotic game Sumobot using MSRS to illustrate the key concepts and how they can support rapid simulation development.¹