基于互补型SET的通用阈值逻辑门设计

与MOS管相比,单电子晶体管(SET)具有超低功耗、超高集成度等优点,被认为是可能取代MOS管的新一代量子器件的主要竞争者.在简要介绍SET特性及通用阈值逻辑门(UTLG)的基础上,沿用CMOS逻辑电路的设计思想,提出了功能强大的基于互补型SET的三变量UTLG实现方案.利用一个UTLG辅之少量门电路就可实现全部256个三变量逻辑函数.通过实例说明了利用查表设计进行UTLG综合的过程.对所设计的SET电路进行了Pspice仿真,结果表明,基于SET的UTLG以及用UTLG实现的全比较器均具有正确的逻辑功能.     

Sémantique de type Kripke d'un système logique basé sur un ensemble ordonné fini

In order to modelize the reasoning of intelligent agents represented by a poset T, H. Rasiowa introduced logic systems called “Approximation Logics”. In these systems the use of a set of constants constitutes a fundamental tool. We have introduced in [8] a logic system called without this kind of constants but limited to the case that T is a finite poset. We have proved a completeness result for this system w.r.t. an algebraic semantics. We introduce in this paper a Kripke‐style semantics for a subsystem of for which there existes a deduction theorem. The set of “possible worldsr is enriched by a family of functions indexed by the elements of T and satisfying some conditions. We prove a completeness result for system with respect to this Kripke semantics and define a finite Kripke structure that characterizes the propositional fragment of logic . We introduce a reational semantics (found by E. Orlowska) which has the advantage to allow an interpretation of the propositionnal logic using only binary relations. We treat also the computational complexity of the satisfiability problem of the propositional fragment of logic .     

Well-Balanced Ambipolar Charge Transport of Diketopyrrolepyrrole-Based Copolymers: Organic Field-Effect Transistors and High-Voltage Logic Applications

A poly (3,6-bis(thiophen-2-yl)−2,5-bis(2-decyltetradecyl)−2,5-dihydropyrrolo[3,4-c]pyrrole-1,4-dione-co-(2,3-bis(phenyl)acrylonitrile)) (PDPADPP) copolymer, composed of diketopyrrolopyrrole (DPP) and a cyano (nitrile) group with a vinylene spacer linking two benzene rings, is synthesized via a palladium-catalyzed Suzuki coupling reaction. The electrical performance of PDPADPP in organic field-effect transistors (OFETs) and circuits is investigated. The OFETs based on PDPADPP exhibit typical ambipolar transport characteristics, with the as-cast OFETs demonstrating low field-effect hole and electron mobility values of 0.016 and 0.004 cm² V⁻¹ s⁻¹, respectively. However, after thermal annealing at 240 °C, the OFETs exhibit improved transport characteristics with highly balanced ambipolar transport, showing average hole and electron mobility values of 0.065 and 0.116 cm² V⁻¹ s⁻¹, respectively. To verify the application of the PDPADPP OFETs in high-voltage logic circuits, compact modeling using the industry-standard small-signal Berkeley short-channel IGFET model (BSIM) is performed, and the logic application characteristics are evaluated. The circuit simulation results demonstrate excellent logic application performance of the PDPADPP-based ambipolar transistor and illustrate that the device annealed at 240 °C exhibits ideal circuit characteristics.     

三值移位寄存器与三值环形计数器

本文利用三值D型触发器和三值置态型触发器,提出了对三值移位寄存器和三值环形计数器的电路设计.讨论表明所设计的电路在结构和功能上与二值电路均有很好的对应关系,同时还揭示了三值环形计数器的各种结构与三值变量的极性变换有关.     

基于和图的电流型CMOS三变量通用逻辑门设计

电流型电路具有高速、低功耗、带宽、设计方便、直观、易于实现多值逻辑电路等优点。阈算术代数系统的提出为电流型电路的设计提供了更符合电流信号运算特点的系统方法,而和图是将逻辑函数转化为阈算术函数的图形表示方法。本文在谱技术的基础上,提出了一种新的和图与谱系数图的转换方法,设计了一种基于和图的电流型CMOS三变量通用逻辑门,即三变量特征阈值逻辑门,可实现任意的三变量阈值函数。     

Constructive Axiomatizations of Plane Absolute,Euclidean and Hyperbolic Geometry

In this paper we provide quantifier‐free, constructive axiomatizations for 2‐dimensional absolute, Euclidean, and hyperbolic geometry. The main novelty consists in the first‐order languages in which the axiom systems are formulated.     

Constructive Order Theory

We introduce the notion of constructive suprema and of constructively directed sets. The Axiom of Choice turns out to be equivalent to the postulate that every supremum is constructive, but also to the hypothesis that every directed set admits a function assigning to each finite subset an upper bound. The Axiom of Multiple Choice (which is known to be weaker than the full Axiom of Choice in set theory without foundation) implies a simple set‐theoretical induction principle (SIP), stating that any system of sets that is closed under unions of well‐ordered subsystems and contains all finite subsets of a given set must also contain that set itself. This is not provable without choice principles but equivalent to the statement that the existence of joins for constructively directed subsets of a poset follows from the existence of joins for nonempty well‐ordered subsets. Moreover, we establish the equivalence of SIP with several other fundamental statements concerning inductivity, compactness, algebraic closure systems, and the exchange between chains and directed sets.     

Cut‐elimination Theorems for Some Infinitary Modal Logics

In this article, a cut‐free system TLM_ω1 for infinitary propositional modal logic is proposed which is complete with respect to the class of all Kripke frames.The system TLM_ω1 is a kind of Gentzen style sequent calculus, but a sequent of TLM_ω1 is defined as a finite tree of sequents in a standard sense. We prove the cut‐elimination theorem for TLM_ω1 via its Kripke completeness.     

An alignment‐free methodology for modelling field‐based 3D‐structure activity relationships using inductive logic programming

Traditional 3D‐quantitative structure–activity relationship (QSAR)/structure–activity relationship (SAR) methodologies are sensitive to the quality of an alignment step which is required to make molecular structures comparable. Even though many methods have been proposed to solve this problem, they often result in a loss of model interpretability. The requirement of alignment is a restriction imposed by traditional regression methods due to their failure to represent relations between data objects directly. Inductive logic programming (ILP) is a class of machine‐learning methods able to describe relational data directly. We propose a new methodology which is aimed at using the richness in molecular interaction fields (MIFs) without being restricted by any alignment procedure. A set of MIFs is computed and further compressed by finding their minima corresponding to the sites of strongest interaction between a molecule and the applied test probe. ILP uses these minima to build easily interpretable rules about activity expressed as pharmacophore rules in the powerful language of first‐order logic. We use a set of previously published inhibitors of factor Xa of the benzamidine family to discuss the problems, requirements and advantages of the new methodology. Copyright © 2007 John Wiley & Sons, Ltd.