对苯二甲醛缩二氨基硫脲-钆配合物的合成及阴离子识别研究

合成了化合物(2E,2′E)-2,2′-(1,4-苯基双亚甲基双硫代氨基脲)(C10H12N6S2)(L),利用L与钆离子形成了配合物(GdL)。用UV-Vis吸收光谱考察其与F-、Cl-、Br-、I-、Ac-、NO3-、HSO4-和H2PO4-等阴离子的识别。研究表明,加入F-或H2PO4-时,溶液颜色由无色变为黄色,加入其它阴离子没有变化,从而实现受体对这两种阴离子的检测。Job法表明主客体间形成1∶1配合物。受体对两种离子的识别作用主要源于配合物多余的结合位点。在此基础上,以GdL的DMSO溶液作为起始状态,以F-和H2PO4-为两化学输入,构建了一个"或"(OR)分子逻辑门。     

激光混沌耦合反馈光电及全光逻辑门研究

理论上利用两个混沌半导体激光器的耦合反馈,构建了两种基本的光电及全光门.基本方法是,让外部光注入到两个激光器中而导致激光混沌,通过两激光器激光的相互耦合及反馈实现同步;在这基础上,一是让两激光器分别在电流调制下,控制混沌同步或者非同步,实现光电逻辑门的功能与计算;二是利用光的外部调制方法让两相互耦合激光分别在相位调制下,控制混沌同步或者非同步,并最终实现全光逻辑门的功能与计算.数值结果证明了两方法的可行性. 关键词： 混沌 逻辑门 激光器 同步     

三值函数表格法最小化中的消变量与消闭化简

本文在讨论Post代数中三值函数的代数基础、成本计算方法与函数简化准则的基础上提出了兼考虑消变量与消阑化简的三值函数表格法最小化程序.通过实例的化简表明考虑消阂化简后所得的函数的最小化SOP形式要比只考虑消变量化简所得的形式更简单，相应电路的成本更低.     

Complexity of fuzzy answer set programming under Łukasiewicz semantics

Fuzzy answer set programming (FASP) is a generalization of answer set programming (ASP) in which propositions are allowed to be graded. Little is known about the computational complexity of FASP and almost no techniques are available to compute the answer sets of a FASP program. In this paper, we analyze the computational complexity of FASP under Łukasiewicz semantics. In particular we show that the complexity of the main reasoning tasks is located at the first level of the polynomial hierarchy, even for disjunctive FASP programs for which reasoning is classically located at the second level. Moreover, we show a reduction from reasoning with such FASP programs to bilevel linear programming, thus opening the door to practical applications. For definite FASP programs we can show P-membership. Surprisingly, when allowing disjunctions to occur in the body of rules – a syntactic generalization which does not affect the expressivity of ASP in the classical case – the picture changes drastically. In particular, reasoning tasks are then located at the second level of the polynomial hierarchy, while for simple FASP programs, we can only show that the unique answer set can be found in pseudo-polynomial time. Moreover, the connection to an existing open problem about integer equations suggests that the problem of fully characterizing the complexity of FASP in this more general setting is not likely to have an easy solution.     

基于模糊逻辑的彩色图像增强

彩色图像的对比度增强具有较强的工程应用价值,提出了一种简单高效的彩色图像增强算法。该算法基于模糊逻辑理论,配合使用RGB和HSI彩色模型,并依据使对比度变换误差最小的原则,调整灰度变换系数。实验结果表明,该方法的增强效果优于传统的直方图均衡,运行效率高,具有实用价值。     

CLEW: The Generation of Pharmacophore Hypotheses Through Machine Learning

Abstract

The paper describes the program CLEW, which utilizes learning and geometrical fitting to discover pharmacophores from a set of active and inactive compounds. The program first divides the compounds into similar classes. It then utilizes machine learning to derive a set of rules that relate structure to activity for each class. Then it finds the common features among all classes. These common features are used by a geometrical fitting program that tries to a 3D fit between these features between minimized conformations for every active molecule in every class. Such a fit is used to infer a pharmacophore.     

超高速碰撞2024-T4铝靶产生的等离子体对逻辑芯片的干扰

 为了掌握超高速碰撞产生等离子体对航天器上常用典型逻辑芯片产生的干扰,利用自主设计的朗缪尔三探针诊断系统,进行了弹丸（入射速度为6.10 km/s,入射角度为30°）超高速碰撞2024-T4铝产生等离子体的特征参量诊断,测量了给定位置和方位角处等离子体的电子密度,利用数据采集系统对实验给定位置和方位角处逻辑芯片的干扰情况进行了评价。实验结果表明,超高速碰撞产生的等离子体对航天器上常用的逻辑芯片将产生严重干扰。     

Coherence control for photonic logic gates via Y-configuration double-control quantum interferences

Destructive and constructive quantum interferences exhibited in a four-level Y-configuration double-control atomic system are suggested. It is shown that the probe transition (driven by the probe field) can be manipulated by the quantum interferences between two control transitions (driven by the control fields) of the four-level system. The atomic vapor is opaque (or transparent) to the probe field if the destructive (or constructive) quantum interference between the control transitions emerges. The optically sensitive responses due to double-control quantum interferences can be utilized to realize some quantum optical and photonic devices such as the logic-gate devices, e.g., the NOT, OR, NOR and EXNOR gates.     

基础R0-代数与基础L*系统

研究了王国俊教授建立的模糊命题演算的形式演绎系统L^*和与之在语义上相匹配的R0-代数，以及：Petr Hajek建立的模糊命题演算系统BL和BL-代数，提出了基础R0-代数和基础L^*系统的观点，讨论了基础L^*代数与BL代数，基础L^*系统与BL系统之间．的相互关系及相对独立性，讨论了基础L^*系统关于基础风一代数的完备性问题，证明了MV-代数是特殊的基础R0-代数，指出了Lukasiewicz模糊命题演算系统是基础L^*系统的扩张，最后作为基础R0-代数与基础L^*系统的一个应用，证明了L^*系统关于语义Ωw的完备性，并在将模糊命题演算系统中的推演证明转化为相应逻辑代数中的代数运算方面作了一些尝试．