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 …     

直觉I-Fuzzy拓扑空间的杨忠道定理

以L~*-格值上Lukasiewicz蕴含算子为工具引入了直觉I-Fuzzy拓扑空间中导集概念,接着给出它的一些性质,最后证明了直觉I-Fuzzy拓扑空间中导集的杨忠道定理.     

一种嵌入式软件逻辑覆盖测试方法研究

针对嵌入式软件测试覆盖率低的问题,本文提出了基于软件故障注入的逻辑覆盖测试方法,首先就嵌入式系统常用传感器建立故障模式库,设计了嵌入式软件故障注入系统;其次选取中间层作为故障注入点,研究基于VxWorks653嵌入式操作系统的故障注入实现方式,并通过分析故障信号在软件系统中的传播,提出优化测试用例的方法;最后通过实验验证了该方法可有效提高容错设计功能、冗余设计功能、故障检测功能测试的逻辑覆盖率;有助于提高嵌入式软件的可靠性。     

HLT500高低温试验箱PLC控制系统

介绍了以PLC(可编程控制器)为核心的高低温试验箱电控系统,着重介绍了可编程逻辑控制器PLC的选择和可编程控制器的程序编译。     

III–V quantum devices and circuits based on nanoscale Schottky gate control of hexagonal quantum wire networks

The concept, the present status, key issues and future prospects of a novel hexagonal binary decision diagram (BDD) quantum circuit approach for III–V quantum large-scale integrated circuits (QLSIs) are presented and discussed. In this approach, the BDD logic circuits are implemented on III–V semiconductor-based hexagonal nanowire networks controlled by nanoscale Schottky gates. The hexagonal BDD QLSIs can operate at delay-power products near the quantum limit in the quantum regime as well as in the many-electron classical regime. To demonstrate the feasibility of the present approach, GaAs Schottky wrap gate (WPG)-based single-electron BDD node devices and their integrated circuits were fabricated and their proper operations were confirmed. Selectively grown InGaAs sub-10 nm quantum wires and their hexagonal networks have been investigated to form high-density hexagonal BDD QLSIs operating in the quantum regime at room temperature.     

An improvement on the complexity of factoring read-once Boolean functions

Read-once functions have gained recent, renewed interest in the fields of theory and algorithms of Boolean functions, computational learning theory and logic design and verification. In an earlier paper [M.C. Golumbic, A. Mintz, U. Rotics, Factoring and recognition of read-once functions using cographs and normality, and the readability of functions associated with partial k-trees, Discrete Appl. Math. 154 (2006) 1465-1677], we presented the first polynomial-time algorithm for recognizing and factoring read-once functions, based on a classical characterization theorem of Gurvich which states that a positive Boolean function is read-once if and only if it is normal and its co-occurrence graph is P₄-free.In this note, we improve the complexity bound by showing that the method can be modified slightly, with two crucial observations, to obtain an O(n|f|) implementation, where |f| denotes the length of the DNF expression of a positive Boolean function f, and n is the number of variables in f. The previously stated bound was O(n²k), where k is the number of prime implicants of the function. In both cases, f is assumed to be given as a DNF formula consisting entirely of the prime implicants of the function.     

The colorimetric and ratiometric fluorescent detection of cyanide and sulfide in live cells,application for logic gate and bioimging

We described the design and synthesis of a colorimetric and ratiometric fluorescent probe based on a conjugated π-electron system that displayed differential fluorescence responses towards cyanide and sulfide and demonstrated its utility in intracellular ion imaging and logic gate.     

Running time experiments on some algorithms for solving propositional satisfiability problems

Satisfiability problems are of importance for many practical problems. They are NP-complete problems. However, some instances of the SAT problem can be solved efficiently. This paper reports on a study concerning the behaviour of a variety of algorithmic approaches to this problem tested on a set of problems collected at FAW. The results obtained give a lot of insight into the algorithms and problems, yet also show some general technical and methodological problems associated with such comparisons.     

Theo’s reinvention of the logic of conditional statements’ proofs rooted in set-based reasoning

This report documents how one undergraduate student used set-based reasoning to reinvent logical principles related to conditional statements and their proofs. This learning occurred in a teaching experiment intended to foster abstraction of these logical relationships by comparing the relationships between predicates within the conditional statements and inference structures among various proofs (in number theory and geometry). We document the progression of Theo’s set-based emergent model (Gravemeijer, 1999) from a model-of the truth of statements to a model-for logical relationships. This constitutes some of the first evidence for how students can abstract such logical concepts in this way and provides evidence for the viability of the learning progression that guided the instructional design.