光驱动分子梭

分子梭在分子开关、分子逻辑门、信息存储等领域有着潜在的应用价值,是超分子化学领域的研究热点之一。本文综述了光驱动分子梭的研究进展：重点举例介绍了荧光光谱识别法和圆二色光谱识别法这两种识别光驱动分子梭位置状态的方法;阐述了构建光驱动轮烷分子梭的新型方法学,包括光驱动环糊精[2]轮烷和[1]轮烷分子梭的定向合成,举例介绍了光间接驱动的轮烷分子梭,以及光驱动[3]轮烷型分子梭和分子梭聚合物;举例说明了光驱动分子梭的功能性应用,用光驱动分子梭来模拟分子水平的逻辑门,研究光驱动分子梭体系中的能量传递机理,以及非溶液态的光驱动分子梭;并对分子梭今后的发展做了展望。     

Reasoning about sequences of memory states

Motivated by the verification of programs with pointer variables, we introduce a temporal logic whose underlying assertion language is the quantifier-free fragment of separation logic and the temporal logic on the top of it is the standard linear-time temporal logic LTL. We analyze the complexity of various model-checking and satisfiability problems for , considering various fragments of separation logic (including pointer arithmetic), various classes of models (with or without constant heap), and the influence of fixing the initial memory state. We provide a complete picture based on these criteria. Our main decidability result is pspace-completeness of the satisfiability problems on the record fragment and on a classical fragment allowing pointer arithmetic. -completeness or -completeness results are established for various problems by reducing standard problems for Minsky machines, and underline the tightness of our decidability results.     

Optimal triangular decompositions of matrices with entries from residuated lattices

We describe optimal decompositions of an n×m matrix I into a triangular product of an n×k matrix A and a k×m matrix B. We assume that the matrix entries are elements of a residuated lattice, which leaves binary matrices or matrices which contain numbers from the unit interval [0, 1] as special cases. The entries of I, A, and B represent grades to which objects have attributes, factors apply to objects, and attributes are particular manifestations of factors, respectively. This way, the decomposition provides a model for factor analysis of graded data. We prove that fixpoints of particular operators associated with I, which are studied in formal concept analysis, are optimal factors for decomposition of I in that they provide us with decompositions with the smallest number k of factors possible. Moreover, we describe transformations between the m-dimensional space of original attributes and the k-dimensional space of factors. We provide illustrative examples and remarks on the problem of computing the optimal decompositions. Even though we present the results for matrices, i.e. for relations between finite sets in terms of relations, the arguments behind are valid for relations between infinite sets as well.     

An introduction to the perplex number system

The perplex number system is a generalization of the abstract logical relationships among electrical particles. The inferential logic of the new number system is homologous to the inferential logic of the progression of the atomic numbers. An electrical progression is defined categorically as a sequence of objects with teridentities. Each identity infers corresponding values of an integer, units and a correspondence relation between each unit and its integer. Thus, in this logical system, each perplex numeral contains an exact internal representational structure; it carries an internal message. This structure is a labeled bipartite graph that is homologous to the internal electrical structure of a chemical atom. The formal logical operations are conjunctions and disjunctions. Combinations of conjunctions and disjunctions compose the spatiality of objects. Conjunctions may include the middle term of pairs of propositions with a common term, thereby creating new information. The perplex numerals are used as a universal source of diagrams.The perplex number system, as an abstract generalization of concrete objects and processes, constitutes a new exact notation for chemistry without invoking alchemical symbols. Practical applications of the number system to concrete objects (chemical elements, simple ions and molecules, and the perplex isomers, ethanol and dimethyl ether) are given. In conjunction with the real number system, the relationships between the perplex number system and scientific theories of concrete systems (thermodynamics, intra-molecular dynamics, molecular biology and individual medicine) are described.     

关于耦合网络间同步控制的一个注记

本文旨在研究具有相互作用的两个网络间的同步及其控制问题,从理论上我们证明了通过选择适当的控制项,两个网络可以达到同步．文中没有限制两个网络具有相同的动力学,针对两个网络的拓扑结构和网络问的作用矩阵,我们提出了两种自适应同步格式,最后通过数值算例来阐述我们得到的理论结果．     

超混沌Lü系统的反同步研究

针对超混沌Lü系统,解析地设计了非线性控制器,基于线性系统稳定性定理,实现了超混沌Lü系统的反同步和异结构反同步,给出了理论分析和数值模拟结果。结果表明所设计的非线性控制器能够有效地使两系统达到反同步。     

电器电路故障问题的解决方法

用软件来解决故障问题,其目的是缩短系统的开发的时间和降低开发的成本,实现系统的可移植性和可操作性,提高学习和工作的效率.介绍了关键技术逻辑方程和事件方程的研究和处理,用此方法来解决电器电路的故障问题.     

基于人工免疫系统的检测器生成算法改进

研究了免疫检测器的生成机制,通过采用k平均聚类算法提取到的规则生成未成熟检测器,提出了将模糊逻辑理论运用到成熟检测器激活及记忆检测器生成的进化方法,改进了传统的以人工免疫为基础的入侵检测系统中随机生成未成熟检测器的算法.实验表明该方法能够提高检测器的检测性能,证实了该算法的有效性.     

组合逻辑电路竞争冒险Multisim仿真分析

分析了组合逻辑电路中"1"型竞争冒险、"0"型竞争冒险的产生条件,基于探索竞争冒险仿真实验技术的目的,采用Multisim10仿真软件对组合逻辑电路竞争冒险的工作波形进行了仿真实验测试,给出了Multisim仿真实验方案,仿真结果生动地展示了竞争冒险的产生过程.所述方法的创新点是解决了组合逻辑电路竞争冒险的工作波形无法用电子实验仪器进行分析验证的问题.     

FX-TRN软件在PLC教学中的应用

采用FX-TRN仿真软件作为多媒体教学的平台,把《可编程控制器》（PLC）课程的知识点,通过软件中各案例来进行讲解。在屏幕上以＂动画＂方式展现出PLC的控制过程及结果,把抽象的知识形象化,这样激发了学生的学习兴趣,提高了教学效果。文中选用了FX-TRN软件中的部件分配案例,来介绍该软件在PLC课程教学中的应用方法,这种方法对PLC以及其他课程的信息化教学具有较重要的参考价值。