可编程控制器在捆扎机自动控制中的应用

介绍了一种用可编程控制器（PLC）实现捆扎机自动控制的设计方案，详细地介绍了设计过程，给出了完整的程序流程图和部分控制程序。     

Parallel branch-and-bound search in Parlog

The concurrent logic languages, of which Parlog is one, have been promoted as a new generation of software languages specifically designed for parallel programming. This paper investigates their application to a search problem commonly used as an illustration of artificial intelligence techniques, the 8-puzzle. It notes that programs written in the concurrent logic languages which do not pay attention to the parallelism can fall into two possible traps: either there is little real parallelism in them due to data dependencies, or there is too much parallelism and any practical architecture will be overwhelmed. A solution which controls the parallelism using user-defined priorities is proposed. This solution has the advantage of being architecture-independent.     

The hierarchies of knowledge and the mathematics of discovery

Rather than attempting to characterize a relation of confirmation between evidence and theory, epistemology might better consider which methods of forming conjectures from evidence, or of altering beliefs in the light of evidence, are most reliable for getting to the truth. A logical framework for such a study was constructed in the early 1960s by E. Mark Gold and Hilary Putnam. This essay describes some of the results that have been obtained in that framework and their significance for philosophy of science, artificial intelligence, and for normative epistemology when truth is relative.I am indebted to Kevin Kelly for several years of happy conversation from which the perspective and views of this paper grew, for comments on a draft of the paper, and for constructing some of the illustrations. A fellowship from the John Simon Guggenheim Memorial Foundation provided the liberty to write this paper. It was first presented in the Turing Colloquium, 1990.     

Integrating integer programming and probabilistic deduction graphs for probabilistic reasoning

Optimal solutions of several variants of the probabilistic reasoning problem were found by a new technique that integrates integer programming and probabilistic deduction graphs (PDG). PDGs are extended from deduction graphs of the and-type via normal deduction graphs. The foregoing variants to be solved can involve multiple hypotheses and multiple evidences where the former is given and the latter is unknown and being found or vice versa. The relationship among these hypotheses and evidences with possible intermediaries is represented by a causal graph. The proposed method can handle a large causal graph of any type and find an optimal solution by invoking a linear integer programming package. In addition, formulating the reasoning problem to fit integer programming takes a polynomial time. H.-L. Li was visiting the Department of Computer Sciences, University of North Texas in 1988–1989. He is with the Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan, R.O.C.     

DC-DC电荷泵的研究与设计

以Dickson电荷泵的基本原理为出发点，研究了一种将正电压输入转为负电压输出的开关电容电路。由于开关电容的充放电特点，为确定电容时间常数，采用非交叠时钟控制信号避免了由于时钟交叠而造成的当电容充电还未完成即对下一级电容进行放电的现象。同时，参考功率MOS-FET的电容模型通过增大驱动电路的电流减小了开关管的上升延时，提高了开关动作的速度，使转换效率得到明显提高。此电路结构简单，性能优良，易于集成，可广泛应用于输出负电压的电源产品中。     

XML schema, tree logic and sheaves automata

XML documents may be roughly described as unranked, ordered trees and it is therefore natural to use tree automata to process or validate them. This idea has already been successfully applied in the context of Document Type Definition (DTD), the simplest standard for defining document validity, but additional work is needed to take into account XML Schema, a more advanced standard, for which regular tree automata are not satisfactory. In this paper, we introduce Sheaves Logic (SL), a new tree logic that extends the syntax of the – recursion-free fragment of – W3C XML Schema Definition Language (WXS). Then, we define a new class of automata for unranked trees that provides decision procedures for the basic questions about SL: model-checking; satisfiability; entailment. The same class of automata is also used to answer basic questions about WXS, including recursive schemas: decidability of type-checking documents; testing the emptiness of schemas; testing that a schema subsumes another one.This work was partially supported by the French government research grant ACI TRALALA and by IST Global Computing Profundis.     

纳秒级上升时间的高压脉冲群电源

按照IEC 61000-4-4/GB 17626.4—1998的要求，首先应用PSPICE仿真确定电路中各元件的参数值，然后基于拉普拉斯变换用MATLAB求解二阶电路验证各元件参数。在此基础上研制了一台以开关电源作为高压直流电源、以氢闸流管作为主控开关的脉冲群电源。该电源体积小、重量轻、效率高、成本低廉。试验结果表明，其输出信号符合标准要求，可用于快速瞬变脉冲群抗扰度试验。     

铁电材料用于阴极发射的研究

铁电材料作为一种新型的阴极材料，具有真空要求低、制作简单、功函数低、响应速度快等特点。本文讨论了铁电阴极发射的机理，回顾了主要铁电阴极材料的发射实验，包括低电压铁电发射实验，最后对铁电阴极材料的应用做了讨论和展望。     

On a responsive replenishment system: a fuzzy logic approach

In today's competitive business environment, it is important that customers are able to obtain their preferred items in the shops they visit, particularly for convenience store chains such as 7–Eleven where popular items are expected to be readily available on the shelves of the stores for buyers. To minimize the cost of running such store chains, it is essential that stocks be kept to a minimum and at the same time large varieties of popular items are available for customers. In this respect, the replenishment system needs to be able to cope with the taxing demands of minimal inventory but at the same time keeping large varieties of needed items. This paper proposes a replenishment system which is able to respond to the fluctuating demands of customers and provide a timely supply of needed items in a cost–effective way. The proposed system embraces the principle of fuzzy logic which is able to deal with uncertainties by virtue of its fuzzy rules reasoning mechanism, thereby leveraging the responsiveness of the entire replenishment system for the chain stores. To validate the feasibility of the approach, a case study has been conducted in an emulated environment with promising results.     

基于复数权值神经元的数字逻辑最稳健设计

复数权值神经元由于引入了多阈值逻辑而具有更强的性能,文中根据其数学模型,结合二进神经元稳健性的概念,提出了基于该神经元的稳健性定义.并结合定义,实现了基于单个神经元的基本数字逻辑以及异或运算的最稳健设计方案,从而证明了该稳健神经元实现任意数字逻辑的有效性和可行性,说明了其强大的处理能力.