＊－素环上同态的广义导子的一个性质

讨论了＊－素环上同态的广义导子的结论,设R是＊－素环,θ是R上的自同构,设F：R→R是带有结合（θ,θ）－导子d的广义（θ,θ）导子,如果F在R上同态,则d ＝0．     

反商群与反同态

引入了反商群概念,利用反商群,反同态,反同构等概念得到了一系列与群同态,同构完全相应的性质。     

N（2、2、0）代数的（?、?úq（λ、μ））-模糊理想

对N (2、2、0)代数(?、?úq(λ、μ))-模糊理想进行了详细的研究。给出了N (2、2、0)代数广义模糊理想和点态化(?、?úq(λ、μ))-模糊理想的概念,讨论了两者之间的等价关系。给出了(?、?úq(λ、μ))-模糊理想的一些等价刻画,并研究了其相关性质。讨论了(?、?úq(λ、μ))-模糊理想的同态像与同态原像的关系。最后研究了(?、?úq(λ、μ))-模糊理想的直积。     

有限Boole格上的上下近似算子

在有限Boole格上定义上近似算子和下近似算子，讨化了它们的基本性质，从而在有限Boole格上建立了粗糙集结构。     

基于新截集的广义扩展原则和F幂集自同态

在Ｆ集的λ－上Ｑ－截集定义下，利用新的运算，给出了新的广义扩展原则和Ｆ幂集自同态，从而使已有的结果在相应的方面得以推广。     

D-homomorphisms and atomic σ-complete boolean D-posets

We study observables as σ-D-homomorphisms defined on Boolean D-posets of subsets into a Boolean D-poset. We show that given an atomic σ-complete Boolean D-poset ? with the countable set of atoms there exist a σ-complete Boolean D-poset of subsets ? and a σ-D-homomorphism h from ? onto ?, more precisely we can choose ? = ?(?), which gives an analogy of the Loomis–Sikorski representation theorem for Boolean σ-algebras. We show also that any atomic σ-complete Boolean D-poset with the countable set of atoms is the range of a σ-homomorphism defined on a σ-complete Boolean D-poset of fuzzy sets which gives another type of the Loomis–Sikorski theorem.     

一种结合秘密同态的在线安全计算研究*

分析了目前常用的在线实现方法。根据实际应用,结合各种方法之优缺点,提出依靠MATLAB系统通过秘密同态和安全套接层来保证科学计算中数据的安全性。提出基于数据库的在线改进计算模型,首次尝试借助秘密同态来实现安全算术运算,并通过实验进行分析。其结论比较符合实际,对如何提高在线安全计算提供了一个可参考的方法。     

复数域上2×2阶反Hermite矩阵李环的自同构

记K2是复数域上2×2阶反Herm ite矩阵构成的李环.本文利用反Herm ite矩阵酉相似于对角阵的性质,刻划了K2的满同态及同构.     

改进同态图像秘密共享ElGamal ECC加密体制

针对Li等人提出的ElGamal椭圆加密体制进行改进,该方案不需要增加计算开销就能提高接收者验证图像正确性的能力.一旦接收者发现加密图像的某些块被污染或者窜改,可立即丢掉这个图像,不需要等到整个图像完全解密出来后才判断出此图像已损坏.结果表明本方案能够对图像快速处理,提高验证速度,减少计算开销.     

An approach to expert assessment in software engineering

An approach is proposed to the solution of formalized problems of assessment of the activity that produces and maintains software systems (SSs). Such assessment is realized by using expertises that form a new assessment process adequate to the activity needs and specifics with an environment common to the expertises. The following mathematical apparatus is elaborated for expertises: a framework (target functions and executing mechanisms), a model and methods (formalisms for improving the quality and reusing the results of expertises) of an assessment process, and tools for integrating the apparatus into software development management processes. The approach is theoretically justified. Prospects of developing the proposed approach are described. Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 151–168, July–August 2009.