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

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

Dithienylmaleimide-based D-A Conjugated Polymer Film: Photo-Responsive Behavior and Application in Electrical Memory and Logic Gates

Solid-stated smart polymers responsive to external stimuli have attracted much attention for potential application in the field of photoelectron devices, logic gates, sensor, data storage and security. However, it is a bigger challenge for polymers than that for small molecules in solid state to acquire stimuli-responsive properties, because polymers with high molecular weight are not as easy to change the packing structure as small molecules under external stimulation. Here, a D-A type alternating copolymer PTMF-o containing 3,4-bisthienylmaleimide(A unit) and fluorene(D unit) is designed and synthesized. Upon irradiation of sunlight, PTMF-o film exhibits a photo-response with the color altering from purple to colorless. It is attributed to the structure of copolymer transformed from ring-opening form(PTMF-o) to ring-closure form(PTMF-c), resulting from the oxidative photocyclization of 3,4-bisthienylmaleimide unit. Consequently, the ability of charge transfer(CT) from fluorene to 3,4-bisthienylmaleimide unit in PTMF-o can be easily weakened by light stimuli. PTMF-o film displays a WORM-type resistive storage performance for the strong CT. Interestingly, after exposure, the electrical memory behavior in situ transfers into FLASH type, due to weak CT in PTMF-c. PTMF-o film can also be employed as smart material to construct NAND and NOR logic gates by using light as input condition. The work provides a simple way to modify the electronic properties of polymers and realize stimuli-response in solid states.     

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.     

Simple linkage: Analysis of a threshold-accepting global optimization method

In a recent paper the authors introduced an infinite class of global optimization algorithms based upon random sampling from the feasible region and local searches started from selected sample points, based upon an acceptance/rejection criterion. All of the algorithms of that class possess strong theoretical properties.Here we analyze a member of that family, which, although being significantly simpler to implement and more efficient than the well known Multi-Level Single-Linkage algorithm, enjoys the same theoretical properties. It is shown here that, with very high probability, our method is able to discover from which points Multi-Level Single-Linkage will decide to start local search.     

Randomized k-server algorithms for growth-rate bounded graphs

The k-server problem is a fundamental online problem where k mobile servers should be scheduled to answer a sequence of requests for points in a metric space as to minimize the total movement cost. While the deterministic competitive ratio is at least k, randomized k-server algorithms have the potential of reaching o(k)-competitive ratios. Prior to this work only few specific cases of this problem were solved. For arbitrary metric spaces, this goal may be approached by using probabilistic metric approximation techniques. This paper gives the first results in this direction, obtaining o(k)-competitive ratio for a natural class of metric spaces, including d-dimensional grids, and wide range of k.     

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.     

Randomized approximation of Sobolev embeddings, III

We continue the study of randomized approximation of embeddings between Sobolev spaces on the basis of function values. The source space is a Sobolev space with nonnegative smoothness order; the target space has negative smoothness order. The optimal order of approximation (in some cases only up to logarithmic factors) is determined. Extensions to Besov and Bessel potential spaces are given and a problem recently posed by Novak and Woźniakowski is partially solved. The results are applied to the complexity analysis of weak solution of elliptic PDE.     

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.     

关于BCI逻辑的一种偏序代数

通常,人们认为Kiyoshi Iséki在20世纪60年代引入的BCI-代数是组合逻辑中BCI逻辑的代数对等物。然而这种广为人知的断言却是有问题的,因为BCI逻辑关于BCI代数是不完备的。在本文中,我们引入一种称为MPE的偏序代数。在MPE中的每个不等式对应BCI逻辑中的一个重言式且反之亦然,从而MPE代数是与BCI逻辑完备的代数类。     

积格上蕴涵算子的直积分解

进一步讨论蕴涵算子的直积分解,描述积格上可以分解为两个蕴涵算子直积的蕴涵算子的特性,并研究积格上S-蕴涵、R-蕴涵、n-反演R-蕴涵和n-反演QL-蕴涵的可分解性。