Bosbach states on fuzzy structures

Pseudo-BL algebras are non-commutative fuzzy structures which generalize BL-algebras and pseudo-MV algebras. In this paper we study the states on a pseudo-BL algebra. This concept is obtained by using the Bosbach condition for each of the two implications of a pseudo BL-algebra. We also propose a notion of conditional state for BL-algebras.The author would like to thank Laureiu Leutean for his valuable suggestions in obtaining the final version of the paper.     

Hybrid generalized Bosbach and Rie c̆ an states on non-commutative residuated lattices

Generalized Bosbach and Rie c? an states, which are useful for the development of an algebraic theory of probabilistic models for commutative or non-commutative fuzzy logics, have been investigated in the literature. In this paper, a new way arising from generalizing residuated lattice-based filters from commutative case to non-commutative one is applied to introduce new notions of generalized Bosbach and Rie c? an states, which are called hybrid ones, on non-commutative residuated lattices is provided, and the relationships between hybrid generalized states and those existing ones are studied, examples show that they are different. In particular, two problems from L.C. Ciungu, G. Georgescu, and C. Mure, “Generalized Bosbach States: Part I” (Archive for Mathematical Logic 52 (2013):335–376) are solved, and properties of hybrid generalized states, which are similar to those on commutative residuated lattices, are obtained without the condition “strong”.     

基于有限状态自动机的服务组合模型

分析了目前服务计算的研究现状和存在的问题，在D Berardi和A Wombacher的基础上提出了一种带条件的有限状态自动机模型cFSA（Finite State Automata with condition），并给出了基于cFSA的服务理论模型．在该服务理论模型的基础上提出了一种基于有限状态自动机的服务组合形式化模型，并给出了该模型的代数性质和实现方法．     

Rough implication operator based on strong topological rough algebras

The role of topological De Morgan algebra in the theory of rough sets is investigated. The rough implication operator is introduced in strong topological rough algebra that is a generalization of classical rough algebra and a topological De Morgan algebra. Several related issues are discussed. First, the two application directions of topological De Morgan algebras in rough set theory are described, a uniform algebraic depiction of various rough set models are given. Secondly, based on interior and closure operators of a strong topological rough algebra, an implication operator (called rough implication) is introduced, and its important properties are proved. Thirdly, a rough set interpretation of classical logic is analyzed, and a new semantic interpretation of ?ukasiewicz continuous-valued logic system ?uk is constructed based on rough implication. Finally, strong topological rough implication algebra (STRI-algebra for short) is introduced. The connections among STRI-algebras, regular double Stone algebras and RSL-algebras are established, and the completeness theorem of rough logic system RSL is discussed based on STRI-algebras.     

基于Verilog HDL的有限状态机设计与描述

有限状态机(FSM)是逻辑设计的重要内容,稍大一点的逻辑设计都存在FSM.介绍了采用Verilog HDL实现有限状态机的几种不同编码方式和描述风格,并从稳定性、可读性、速度和面积等方面比较了不同实现方式的利弊.最后,以简单序列检测器为例实现了可综合的FSM描述,并分析了其采用不同描述风格所得的综合结果.     

基于有限状态自动机的Web服务组合

Web服务是Web上的特殊软件资源,可以被应用系统发现和调用.如何根据用户的需求(目标服务)来组合Web服务是研究中需要解决的重要问题.通过使用有限状态自动机,服务组成的社区中的状态和操作可以使用有限状态自动机来模拟,这样可以表示服务操作的内部和外部概要.结合确定性动态命题逻辑,可以根据已有的Web服务,解决目标服务的可组合问题,产生组合计划.同时讨论了算法的复杂性.     

Theorems on the structure of finite dimensional estimation algebras

In this paper we proved several theorems concerning the structure of finite dimensional estimation algebras. In particular, under proper technical assumptions, we proved the following: (1) The observation of a filtering system must be linear if the estimation algebra is finite dimensional. (2) All elements of a finite dimensional estimation algebra belong to a special class of polynomial differential operators. (3) All finite dimensional estimation algebras are solvable.     

Decomposition of algebras over finite fields and number fields

We consider the boolean complexity of the decomposition of semi-simple algebras over finite fields and number fields.We present new polynomial time algorithms for the decomposition of semi-simple algebras over these fields. Our algorithms are somewhat simpler than previous algorithms, and provide parallel reductions from semi-simple decomposition to the factorization of polynomials. As a consequence we obtain efficient parallel algorithms for the decomposition of semi-simple algebras over small finite fields. We also present efficient sequential and parallel algorithms for the decomposition of a simple algebra from a basis and a primitive idempotent. These will be applied in a subsequent paper to obtain Las Vegas polynomial time algorithms for the decomposition of matrix algebras over and .     

USSD对话有限状态自动机的设计与实现

USSD（Unstructured Supplementary Service Data，非结构化补充业务数据）是一种基于GSM移动通信网络的新型交互式数据业务，与短消息相比，具有响应速度快、交互能力强、可靠性高的特点。首先分析了USSD对话的信令流程，然后从提高信令的并行处理能力出发，提出了USSD对话有限状态自动机的实现方法。     

Topology optimization based on finite strain plasticity

In this paper infinitesimal elasto-plastic based topology optimization is extended to finite strains. The employed model is based on rate-independent isotropic hardening plasticity and to separate the elastic deformation from the plastic deformation, use is made of the multiplicative split of the deformation gradient. The mechanical balance laws are solved using an implicit total Lagrangian formulation. The optimization problem is solved using the method of moving asymptotes and the sensitivity required to form convex separable approximations is derived using a path-dependent adjoint strategy. The optimization problem is regularized using a PDE-type filter. A simple boundary value problem where the plastic work is maximized is used to demonstrate the capability of the presented model. The numerical examples reveal that finite strain plasticity successfully can be combined with topology optimization.     

基于有限状态自动机的漏洞检测模型

漏洞是软件安全的一个严重威胁,如何检测软件中存在的漏洞对提高其安全性具有重要的意义.经过分析缓冲区溢出漏洞产生的原因,得出了其形成的3个必要条件,并根据产生原因的不同,针对函数调用出错和循环拷贝出错而导致的两类缓冲区溢出漏洞,分别提出了相应的基于有限状态自动机的漏洞检测模型.     

基于有限单元法的汽车称重传感器

分析集成化称重板式轮重秤的设计原理，提出采用辐板式称重传感器作为动态称重系统压力元件的设计方案，重点阐述利用有限元软件进行传感器敏感元件模型设计、网格划分、施加载荷与边界条件的过程；根据敏感元件的应力分布规律，找到应变片的布片规律和具体位置，组成全桥差动电路，使车辆轮胎载荷作用在秤台平面的不同区域均可以测出其准确重量．通过传感器的动态响应试验分析其频率响应特性．     

基于有限自动机的二值图像的开运算

以图像与图像平移的并集作为状态集,以探针与探针拷贝的并集作为输入字母表,用向量加减法构造状态转换映射和输出映射,给出了实现数学形态学基本运算开运算的有限自动机。与通用计算机对图像的串行处理相比,开运算自动机采取了并行结构。开运算自动机将运算的时间复杂度降低到了探针像素个数减1。     

An algorithm for removing facial makeup disturbances based on Clifford algebras

The main goal of the paper is to show that Clifford algebras can be used to solve problems of removing facial makeup disturbance. After simulation and practical application experiments, the algorithm is a natural and effective manner.     

基于现场总线的网络化智能传感器研究

针对当前工业过程自动化、制造自动化、电力系统自动化等相关领域中传感器小型化,智能化和网络化的发展趋势,在分析网络化智能传感器特点的基础上,开发了一种基于PROFIBUS的网络化智能传感器,并给出了该传感器的系统结构,硬件及软件的实现方法。     

基于有限反馈机会波束的无线传感器网络

无线传感器网络中的传感器要把被监测的数据有效地传输到远端的收集器,且其节点的能量有限,为了提高衰落无线信道中无线传感器网络通信的有效性,提出基于有限反馈机会波束的无线传感器网络,基站设置多天线,传感器节点设置单天线,构成MISO系统,在每一时隙基站选择处于峰值状态的传感器节点进行通信。设置反馈门限,当传感器节点的接收信干噪比大于反馈门限时,对信干噪比进行量化,再将量化电平反馈给基站;否则,无需进行量化和反馈。以吞吐量最大化为原则设定最佳反馈门限和量化电平,在瑞利块衰落信道中对系统进行仿真,结果表明:随着节点数的增加,该系统的反馈数可降至传统模拟反馈的1%以下,大大降低了反馈量,提高了系统的效率和节点能量利用率。     

基于污点状态空间的脆弱性可疑点定位方法

针对现有方法在定位效能和适应性方面的不足,提出一种基于污点状态空间的脆弱性可疑点定位方法,在动态污点分析的框架下,建模扩展污点状态机模型,通过离线轨迹文件分析指令执行时的污点状态迁移,同时设计了多类非安全迁移规则,检测并定位脆弱性可疑点。构造原型系统并进行测试的结果表明该方法能在未触发脆弱性的条件下较完备和快速地定位多类脆弱性可疑点。     

一种基于有限域运算的半脆弱数字水印算法

通过分析水印图像置乱加密对数字水印算法的脆弱性影响,提出了一种基于有限域运算的抗JPEG压缩半脆弱数字水印算法。实验证明该算法对固定系数的JPEG压缩有较好的鲁棒性,并对图像的恶意篡改有较好的脆弱性。     

基于矩阵模型的有限自动机的综合

研究如何构造有限自动机，使得每一输入的内动部分的图形为给定的图形，即每一给定的图形为该有限自动机在某输入下的内动部分的图形；对给定的常量布尔方阵C，是否存在满足一定条件的有限自动机，使得该自动机总图的拟邻接矩阵为C，给出了判断的充要条件及构造算法；设计了时序电路模拟自动机，该时序电路实现给定的图形或拟邻接矩阵。     

Applying weakest t-norm based approximate intuitionistic fuzzy arithmetic operations on different types of intuitionistic fuzzy numbers to evaluate reliability of PCBA fault

This research addresses system reliability analysis using weakest t-norm based approximate intuitionistic fuzzy arithmetic operations, where failure probabilities of all components are represented by different types of intuitionistic fuzzy numbers. Due to the incomplete, imprecise, vague and conflicting information about the component of system, the present study evaluates the reliability of system in terms of membership function and non-membership function by using weakest t-norm (T_w) based approximate intuitionistic fuzzy arithmetic operations on different types of intuitionistic fuzzy numbers. In general, interval arithmetic (α-cut arithmetic) operations have been used to analyze the fuzzy system reliability. In complicated systems, interval arithmetic operations may occur the accumulating phenomenon of fuzziness. In order to overcome the accumulating phenomenon of fuzziness, this research adopts approximate intuitionistic fuzzy arithmetic operations under the weakest t-norm arithmetic operations (T_w) to analyze fuzzy system reliability. The approximate intuitionistic fuzzy arithmetic operations employ principle of interval arithmetic under the weakest t-norm arithmetic operations. The proposed novel fuzzy arithmetic operations may obtain fitter decision values, which have smaller fuzziness accumulating and successfully analyze the system reliability. Also weakest t-norm arithmetic operations provide more exact fuzzy results and effectively reduce fuzzy spreads (fuzzy intervals). Using proposed approach, fuzzy reliability of series system and parallel system are also constructed. For numerical verification of proposed approach, a malfunction of printed circuit board assembly (PCBA) is presented as a numerical example. The result of the proposed method is compared with the listing approaches of reliability analysis methods.