模糊数学,随机数学与精确数学的逻辑比较

本文揭示模糊数学，随机数学与精确数学有相似的形式公理化描述，它们的区别只在语义上。     

《关于命题的讨论》一文的一点瑕疵

文 [1 ]旨在对高中新教材中新增加的“简易逻辑”内容进行解释说明 ,对于不熟悉这部分内容的中学师生颇有参考价值 .但是该文中有一点瑕疵 ,今冒昧指出 .文 [1 ]在谈到关于命题的否定与否命题这一问题时认为 :“若ｐ则ｑ”的否定是“若ｐ则非ｑ” .这是一个错误观点 .事实上 ,“若ｐ则ｑ”等价于 (「ｐ)∨ｑ(文 [1 ]在谈到关于逻辑联结词与复合命题时也是这样说的 ) ,其否定应该是ｐ∧ (「ｑ) .ｐ∧ (「ｑ)读作“ｐ且非ｑ” ,习惯上也可以说成“虽然ｐ ,但非ｑ” .“若ｐ则非ｑ”等价于 (「ｐ) ∨ (「ｑ) .当ｐ为假时 ,「ｐ为真 ,于是 (「ｐ…     

不同测验模型的信度估计及统计性质

在教育与心理测验中，信度是衡量测验是否可靠的重要指标。本文在不同模型下考虑测验的信度估计及其统计性质。在正态模型下，给出信度的无偏估计，在二项模型下，给出信度的相合估计；利用项目反应理论，给出测验信度的另一类估计；在组合测验模型下，给出迄今最接近信度真值的一个下界，同时给出相应的估计公式。     

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

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

基于低功耗双边沿D触发器的任意进制异步计数器设计

从D触发器激励表入手，分别给出了采用单边沿D触发器和双边沿D触发器的2^n进制异步加法计数器、减法计数器的设计方法．在此基础上，采用逻辑函数修改技术，通过实例讨论了基于单边沿D触发器和双边沿D触发器的异步任意进制计数器的设计．该设计方法方便，快速，具有一定的实用意义．     

Single Qubit and Its Universal Logic Gate Made of a Heisenberg Spin Cluster with Five Particles

We investigate an anisotropic Heisenberg spin cluster with five particles controlled by a time-dependent magnetic field. With the algebraic dynamical method, we obtain the exact analytical solution to the time dependent Schr6dinger equation. Based on the analytical solution, it is shown that the system can be used as a universal single qubit logic gate controlled by the strength and frequency of the magnetic field, and the six special single qubit logic gates can be realized physically. We also discuss the anti-decoherence property of the qubit and its logic gates resulted from particle coupling effect and collectivity of the cluster.     

一个令人费解的逆否命题

作者在给“百千万骨干教师”讲授逻辑问题时 ,一位教师向我提出了一个令他困惑不解的问题 ,下面是解决此问题的全过程 .(为叙述方便 ,把“百千万骨干教师”视为学生 )问题 :原命题　若 x≥ 0 ,则 x2 ≥ 0 .逆否命题　若 x2 <0 ,则 x<0 .学生甲 :逆否命题这样写对吗 ?教师 :对呀 .学生甲 :原命题显然是真的 ,然而逆否命题怎样是假的呢 ?教师 :这个问题提的好 .(因为刚讲过逻辑研究的对象 ,这个问题正好与逻辑研究的对象有关 )请同学们讨论逆否命题到底是真还是假 ?学生乙 :在实数范围内 ,x<0不可能 ,所以逆否命题不存在 .学生丙 :不对 .x2 <0…     

Pre—Separation Axioms in Fuzzifying Topology

1　 IntroductionYing[5,6 ] introduced and elementally developed so called fuzzifying topology with the semanticmethod of continuous valued L ogic.Shen[7] introduced and studied T0 -,T1-,T2 (Hausdorff) -,T3(regularity) -,T4 (normality) -separation axioms in fuzzifying topology.In [3 ]the concepts of thefamily of fuzzifying pre-open sets,fuzzifying pre-neighbourhood structure of a point and fuzzifyingpre-closure are introduced and studied.It is worth to mention that pre-separation axioms are …     

Blind equalization of underwater acoustic channelusing a combined constant modulus algorithm

A kind of Combined Constant Modulus Algorithm (CCMA) is presented to compensate the defects of the Constant Modulus Algorithm (CMA) and the Sign Error CMA (SECMA). And CCMA is applied to the equalization of the underwater acoustic channel (UWAC). Based on the decision of the equalizer‘s output, its iteration process switches between CMA and SECMA automatically. It is more robust than SECMA, and more computationally efficient than CMA. Therefore, it is very suitable for the recovery of the underwater data transmission. The performance of CCMA is proven by computer simulation for the equalization of the UWAC.     

Quantum Logic Network for Probabilistic Teleportation of Two-Particle State in a General Form

A simplification scheme of probabilistic teleportation of two-particle state in a general form is given.By means of the primitive operations consisting of single-qubit gates,two-qubit controlled-not gates,Von Neumann measure-ment and classically controlled operations,we construct and efficient quantum logical network for implementing the new scheme of probabilistic teleportation of a two-particle state in a general form.