方正熊猫安全网关(PAGD)--交通部信息化建设二期工程防毒方案

在国家政策的倡导支持下,交通部领导十分重视交通信息化及交通部电子政务的建设工作.2001年交通部实施了交通部机关信息化基础设施改造一期工程,完善了交通部内网、专网(机关局域网)、外网的基础设施,构建了一个安全、实用、先进、可扩展的网络环境;但是,由于各种条件限制,交通行业信息化建设还存在一些问题.为了贯彻国务院对政府系统信息化建设的要求,实现交通部政务办公和行业管理信息服务的电子化、网络化,2005年交通部决定开展交通部信息化建设二期工程建设.     

Wafer-level packaging based on uniquely orienting self-assembly (the DUO-SPASS processes)

A wafer-level packaging strategy for micro device chips based on uniquely orienting self-assembly is presented with the following steps: 1) bulk parts are uniquely face- oriented and spread in a single layer; 2) Parts are palletized onto an alignment template having an array of receptor sites; 3) Parts are anchored one-to-one to the receptor sites; 4) Each anchored part is fixed to a unique in-plane orientation. We demonstrate all of these steps with two different self-organizing parallel assembly (SPASS) processes: a semidry uniquely orienting process (semi-DUO-SPASS) and a dry uniquely orienting (DUO-SPASS) process. The semidry process exploits: 1)An agitated air/water interface to uniquely face-orient bulk parts having a single hydrophobic face; 2) A hydrophobic carrier wafer to palletize the parts in an air environment; 3) Orbital shaking to drive the parts until they are anchored to receptor sites; 4) Gravity to uniquely align the parts. Experiments show that 2-mm square silicon parts are correctly registered on a 4-in alignment template having 164 receptor sites with a defect rate of /spl sim/1% after 3min orbital shaking. The dry process utilizes: 1) Asymmetry in dynamic stability to uniquely face-orient bulk parts having protruding features on one face; 2) Orbital shaking to drive the parts until they are first anchored to receptor sites and then fixed in well-defined in-plane orientations by two-stage shape recognition. In our experiments, 1-mm square silicon parts are assembled with a defect rate of /spl sim/2% in 10min on each of two 4-in alignment templates having, respectively, 397 and 720 receptor sites.     

Advantages of decision lists and implicit negatives in Inductive Logic Programming

This paper demonstrates the capabilities offoidl, an inductive logic programming (ILP) system whose distinguishing characteristics are the ability to produce first-order decision lists, the use of an output completeness assumption as a substitute for negative examples, and the use originally motivated by the problem of learning to generate the past tense of English verbs; however, this paper demonstrates its superior performance on two different sets of benchmark ILP problems. Tests on the finite element mesh design problem show thatfoidl’s decision lists enable it to produce generally more accurate results than a range of methods previously applied to this problem. Tests with a selection of list-processing problems from Bratko’s introductory Prolog text demonstrate that the combination of implicit negatives and intensionality allowfoidl to learn correct programs from far fewer examples thanfoil. This research was supported by a fellowship from AT&T awarded to the first author and by the National Science Foundation under grant IRI-9310819. Mary Elaine Califf: She is currently pursuing her doctorate in Computer Science at the University of Texas at Austin where she is supported by a fellowship from AT&T. Her research interests include natural language understanding, particularly using machine learning methods to build practical natural language understanding systems such as information extraction systems, and inductive logic programming. Raymond Joseph Mooney: He is an Associate Professor of Computer Sciences at the University of Texas at Austin. He recerived his Ph.D. in Computer Science from the University of Illinois at Urbana-Champaign in 1988. His current research interests include applying machine to natural language understanding, inductive logic programming, knowledge-base and theory refinement, learning for planning, and learning for recommender systems. He serves on the editorial boards of the journalNew Generation Computing, theMachine Learning journal, theJournal of Artificial Intelligence Research, and the journalApplied Intelligence.     

可调控误报率和漏报率的树突状细胞算法

了解决传统树突状细胞算法（DCA）对环境评判的盲目性,分析DCA权值矩阵对检测结果的影响,提出两种可调控误报率和漏报率的DCA。一种是改进的投票制DCA,即在树突状细胞（DC）状态转换准则中融入倾向因子,以求得对环境评判的公平,并通过对倾向因子的微调控制检测结果的误报率和漏报率;另一种是评分制DCA,即在DC状态转化阶段忽略对细胞环境的评判,改为直接对抗原进行评分,最后根据抗原的平均分分布调整异常阈值,以达到调控误报率和漏报率的目的。实验表明,两种算法均有效地实现了结果可控性,相比而言,评分制DCA可实现更为直观的调控。     

Surface functionalization for self-referencing surface plasmon resonance (SPR) biosensors by multi-step self-assembly

Recently, a novel SPR sensor with on-chip referencing has been realized. In this sensor, one-half of the gold sensing surface is covered with a high refractive index overlayer of tantalum pentoxide (Ta₂O₅). When polychromatic beam illuminates the sensing surface, surface plasmon resonance in the areas with and without the overlayer occur at different wavelengths. Therefore, the reflected light exhibits two dips associated with SPRs in those two areas. When functionalized properly, one of the areas can be used as a specific sensing channel for detection of specific bio-interactions and the other can act as a reference channel for compensation for background refractive index fluctuations. In this paper we present a new functionalization approach for these mixed architecture chips. The gold side of the chip is functionalized with a mixed self-assembled monolayer of polyethylene oxide (PEO) and biotin terminated (BAT) thiols whereas the Ta₂O₅ side is coated with PEO terminated silanes. The PEO terminated thiols and silanes serve as a protein resistant background, while the biotin terminated thiols are used to bind streptavidin, which in turn immobilizes biotinylated antibodies. Hence, the gold side of the chip is used for the binding and detection of target analytes and the Ta₂O₅ side functions as a reference channel that monitors bulk refractive index changes and temperature drift. We have studied human chorionic gonadotropin (hCG) as a model system, currently detecting down to 5 ng/ml. In addition, we demonstrate the power of the on-chip reference channel for compensating for refractive index changes and eliminating false alarms.     

Producibility in hierarchical self-assembly

Three results are shown on producibility in the hierarchical model of tile self-assembly. It is shown that a simple greedy polynomial-time strategy decides whether an assembly α is producible. The algorithm can be optimized to use \(O(|\alpha | \log ^2 |\alpha |)\) time. Cannon et al. (STACS 2013: proceedings of the thirtieth international symposium on theoretical aspects of computer science. pp 172–184, 2013) showed that the problem of deciding if an assembly α is the unique producible terminal assembly of a tile system \({\mathcal {T}}\) can be solved in \(O(|\alpha |^2 |{\mathcal {T}}| + |\alpha | |{\mathcal {T}}|^2)\) time for the special case of noncooperative “temperature 1” systems. It is shown that this can be improved to \(O(|\alpha | |{\mathcal {T}}| \log |{\mathcal {T}}|)\) time. Finally, it is shown that if two assemblies are producible, and if they can be overlapped consistently—i.e., if the positions that they share have the same tile type in each assembly—then their union is also producible.     

Combining self-healing and proofreading in self-assembly

Molecular self-assembly is a promising approach to bottom-up fabrication of complex structures. A major impediment to the practical use of self-assembly to create complex structures is the high rate of error under existing experimental conditions. Recent theoretical work on algorithmic self-assembly has shown that under a realistic model of tile addition and detachment, error correcting tile sets are possible that can recover from the attachment of incorrect tiles during the assembly process. An orthogonal type of error correction was recently considered as well: whether damage to a completed structure can be repaired. It was shown that such self-healing tile sets are possible. However, these tile sets are not robust to the incorporation of incorrect tiles. It remained an open question whether it is possible to create tile sets that can simultaneously resist wholesale removal of tiles and the incorporation of incorrect ones. Here we present a method for converting a tile set producing a pattern on the quarter plane into a tile set that makes the same pattern (at a larger scale) but is able to withstand both of these types of errors.

带野值的单类分类器在安全审计中的应用

单类分类器是当前模式识别领域的一个研究热点。带野值的单类分类器是在单类分类器的基础上,通过引入少量珍贵的异常样本（野值）,以加强分类器的性能。该模型适用于处理正类样本数目远多于反类样本的两类数据类别不平衡问题。提出了将带野值的支持向量描述方法应用于安全审计数据分析中,并通过实验证实了该方法对异常样本更为敏感,具有良好的应用潜力。     

Observer-based strict positive real (SPR) feedback control system design

This paper presents theory for stability analysis and design for a class of observer-based feedback control systems. Relaxation of the controllability and observability conditions imposed in the Yakubovich-Kalman-Popov (YKP) lemma can be made for a class of nonlinear systems described by a linear time-invariant system (LTI) with a feedback-connected cone-bounded nonlinear element. It is shown how a circle-criterion approach can be used to design an observer-based state feedback control which yields a closed-loop system with specified robustness characteristics. The approach is relevant for design with preservation of stability when a cone-bounded nonlinearity is introduced in the feedback loop. Important applications are to be found in nonlinear control with high robustness requirements.     

Verification in staged tile self-assembly

Natural Computing - We prove the unique assembly and unique shape verification problems, benchmark measures of self-assembly model power, are $$\textsf {coNP}^{\textsf {NP}}$$ -hard and contained...     

People are not computers: (most) thought processes are not computational procedures

The computational conception of the mind that dominates cognitive science assumes that thought processes involve the computation of algorithms or the execution of functions. Human minds turn out to be automatic formal systems or physical syntax-processing systems. The objection has often been posed that systems of this kind do not possess sufficient conditions for mentality, because the syntax they process may be meaningless for those systems. That problem concerns their semantic content. Here an additional objection is posed that systems of this kind, as normatively-directed, problem-solving causal systems, impose conditions that are not necessary for mentality, because many if not most human thought processes violate them. This problem concerns their causal character. The computational conception reflects an overgeneralization about human thought processes based on special kinds of thinking and thus seems to be trivial or false.     

Distributed agreement in tile self-assembly

Laboratory investigations have shown that a formal theory of fault-tolerance will be essential to harness nanoscale self-assembly as a medium of computation. Several researchers have voiced an intuition that self-assembly phenomena are related to the field of distributed computing. This paper formalizes some of that intuition. We construct tile assembly systems that are able to simulate the solution of the wait-free consensus problem in some distributed systems. (For potential future work, this may allow binding errors in tile assembly to be analyzed, and managed, with positive results in distributed computing, as a “blockage” in our tile assembly model is analogous to a crash failure in a distributed computing model.) We also define a strengthening of the “traditional” consensus problem, to make explicit an expectation about consensus algorithms that is often implicit in distributed computing literature. We show that solution of this strengthened consensus problem can be simulated by a two-dimensional tile assembly model only for two processes, whereas a three-dimensional tile assembly model can simulate its solution in a distributed system with any number of processes.     

Fast arithmetic in algorithmic self-assembly

In this paper we consider the time complexity of adding two n-bit numbers together within the tile self-assembly model. The (abstract) tile assembly model is a mathematical model of self-assembly in which system components are square tiles with different glue types assigned to tile edges. Assembly is driven by the attachment of singleton tiles to a growing seed assembly when the net force of glue attraction for a tile exceeds some fixed threshold. Within this frame work, we examine the time complexity of computing the sum of two n-bit numbers, where the input numbers are encoded in an initial seed assembly, and the output sum is encoded in the final, terminal assembly of the system. We show that this problem, along with multiplication, has a worst case lower bound of \(\varOmega ( \sqrt{n} )\) in 2D assembly, and \(\varOmega (\root 3 \of {n})\) in 3D assembly. We further design algorithms for both 2D and 3D that meet this bound with worst case run times of \(O(\sqrt{n})\) and \(O(\root 3 \of {n})\) respectively, which beats the previous best known upper bound of O(n). Finally, we consider average case complexity of addition over uniformly distributed n-bit strings and show how we can achieve \(O(\log n)\) average case time with a simultaneous \(O(\sqrt{n})\) worst case run time in 2D. As additional evidence for the speed of our algorithms, we implement our algorithms, along with the simpler O(n) time algorithm, into a probabilistic run-time simulator and compare the timing results.     

Log-logarithmic worst-case range queries are possible in space Θ(N)

Let S denote a set of N records whose keys are distinct nonnegative integers less than some initially specified bound M. This paper introduces a new data structure, called the y-fast trie, which uses Θ(N) space and Θ(log log M) time for range queries on a random access machine. We will also define a simpler but less efficient structure, called the x-fast trie.     

Control of self-assembly in micro- and nano-scale systems

Control of self-assembling systems at the micro- and nano-scale provides new opportunities for the engineering of novel materials in a bottom-up fashion. These systems have several challenges associated with control including high-dimensional and stochastic nonlinear dynamics, limited sensors for real-time measurements, limited actuation for control, and kinetic trapping of the system in undesirable configurations. Three main strategies for addressing these challenges are described, which include particle design (active self-assembly), open-loop control, and closed-loop (feedback) control. The strategies are illustrated using a variety of examples such as the design of patchy and Janus particles, the toggling of magnetic fields to induce the crystallization of paramagnetic colloids, and high-throughput crystallization of organic compounds in nanoliter droplets. An outlook of the future research directions and the necessary technological advancements for control of micro- and nano-scale self-assembly is provided.     

Hello, MIS medical record (wherever you are)

A management information system record takes an imaginary orientation journey through El Camino Hospital in Mountain View, Calif., and meets a cast of seven hospital staffers who acquaint it with their own specific requirements.     

New frontiers: self-assembly and nanoelectronics

In the quest for new semiconductor materials and processes, researchers focus on self-assembly, a concept that draws from diverse disciplines like chemistry, biology, material science, and electrical engineering. The following areas are examined: information theory; thermodynamics, synergetics and self-assembly; ribosome based lithography; nanofabrication by self-assembly; molecular electronics; and smart matter     

Definite clause programs are canonical (over a suitable domain)

For each first-order languageL with a nonempty Herbrand universe, we construct an algebraC interpreting the function symbols ofL that is a model of the Clark equality theory with languageL and is canonical in the sense that for every definite clause programP in the languageL,T _P ^C is the greatest fixed point ofT _P ^C . The universe of individuals inC is a quotient of the set of terms ofL and is, a fortiori, countable ifL is countable. If contains at least one function symbol of arity at least 2, then the graphs of partial recursive functions onC, suitably defined, are representable in a natural way as individuals inC.Research sponsored in part by U.S. Air Force Contract F30602-85-C-0008.