智能票箱的研制

介绍一种新型的智能票箱，叙述了它的软硬件工作原理，使其成为一个集采集测量，数据处理、显示、报警、控制分类与上级计算机进行实时通信于一体的测控系统。     

基于的票箱管理系统的研究与实现

介绍了一种基于RFID技术的AFC票箱管理系统方法,通过分析目前票箱管理现状,提出采用电子标签对票箱进行管理能有效提高管理效率的思想。使用结构化分析方法,建立了系统的功能模型,完成了系统各层数据流图分析,并展望了系统实施后的预期效果。该系统在能提高票箱管理的自动化程度,为AFC系统信息化提供有效的解决手段。     

计算机选举选票实时统计系统

介绍了基于OMR原理的智能票箱及计算机选举实时统计系统。详细叙述了选票四方向任意投入识别的原理,以及组成智能票箱的几个主要硬件模块。     

一个扩展的CCS

诉微分算子ＣＣＳ（Ｃａｌｃｌｕｓ ｏｆ Ｃｏｍｍｕｎｉ－ｃａｔｉｎｇ Ｓｙｓｔｅｍｓ）是由英国爱丁堡大学计算机科学系的ＲｏｂｉｎＭｉｌｎｅｒ首先提出的。ＣＣＳ是一个在数学上完整的理论算子系统,可以作为计算机通讯系统的基本理论模型。我们先简要说明一个ＣＣＳ的内容。我们所作的工作是在理论上扩充地的ＣＣＳ,使得我们的ＣＣＳ更为一般化。在我们的观战看来,ＲｏｂｉｎＭｉｂｅｒ的ＣＣＳ只不过是我们的ＣＣＳ的一     

View-based model-driven architecture for enhancing maintainability of data access services

In modern service-oriented architectures, database access is done by a special type of services, the so-called data access services (DAS). Though, particularly in data-intensive applications, using and developing DAS are very common today, the link between the DAS and their implementation, e.g. a layer of data access objects (DAOs) encapsulating the database queries, still is not sufficiently elaborated, yet. As a result, as the number of DAS grows, finding the desired DAS for reuse and/or associated documentation can become an impossible task. In this paper we focus on bridging this gap between the DAS and their implementation by presenting a view-based, model-driven data access architecture (VMDA) managing models of the DAS, DAOs and database queries in a queryable manner. Our models support tailored views of different stakeholders and are scalable with all types of DAS implementations. In this paper we show that our view-based and model driven architecture approach can enhance software development productivity and maintainability by improving DAS documentation. Moreover, our VMDA opens a wide range of applications such as evaluating DAS usage for DAS performance optimization. Furthermore, we provide tool support and illustrate the applicability of our VMDA in a large-scale case study. Finally, we quantitatively prove that our approach performs with acceptable response times.     

FTDSS：高容错分布式共享存储机制

Computerized data has become critical to the survival of an enterprise. Company must have a strategy for recovering their data should data lose. RAID is a popular mechanism to offer good fault-tolerance. But RAID can notwork well when one more disks fail. In this paper, we present an efficient Network-based high High-Tolerance Dis-tributed Shared Storage mechanism called FTDSS. FTDSS makes use of disk space of node in Network to build alarge pubhc shared storage space. Users can read/write their file from/to the public storage space from node of net-work. Physically File is stored in each node in form of data fragment or XOR verify fragment. Because of redundant XOR fragments, file is available even when two more nodes fail. FTDSS realize distant redundant srorage. At last,this paper use experiment to prove that FTDSS can offer high. fault-tolerance and advanced performance.     

Existential foundations of the composition paradigm

The theses of existonness, compoundness, and polyadness are proved. The consistency of these theses with the reversibility principle is founded. Existential foundations of the composition paradigm are constructed. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 3–12, March–April 2008.     

Autonomous programmable DNA nanorobotic devices using DNAzymes

A major challenge in nanoscience is the design of synthetic molecular devices that run autonomously (that is, without externally mediated changes per work-cycle) and are programmable (that is, their behavior can be modified without complete redesign of the device). DNA-based synthetic molecular devices have the advantage of being relatively simple to design and engineer, due to the predictable secondary structure of DNA nanostructures and the well-established biochemistry used to manipulate DNA nanostructures. However, ideally we would like to minimize the use of protein enzymes in the design of a DNA-based synthetic molecular device. We present the design of a class of DNA-based molecular devices using DNAzyme. These DNAzyme-based devices are autonomous, programmable, and further require no protein enzymes. The basic principle involved is inspired by a simple but ingenious molecular device due to Tian et al. [Y. Tian, Y. He, Y. Chen, P. Yin, C. Mao, A DNAzyme that walks processively and autonomously along a one-dimensional track, Angew. Chem. Intl. Ed. 44 (2005) 4355–4358] that used DNAzyme to traverse on a DNA nanostructure, but was not programmable in the sense defined above (it did not execute computations).     

基于LDA话题演化研究方法综述

现实生活中不断有新话题的产生和旧话题的衰减,同时话题的内容也会随着时间发生变化。自动探测话题随时间的演化越来越受到人们的关注。Latent Dirichlet Allocation模型是近年提出的概率话题模型,已经在话题演化领域得到较为广泛的应用。该文提出了话题演化的两个方面 内容演化和强度演化,总结了基于LDA话题模型的话题演化方法,根据引入时间的不同方式将目前的研究方法分为三类 将时间信息结合到LDA模型、对文本集合后离散和先离散方法。在详细叙述这三种方法的基础上,针对时间粒度、是否在线等多个特征进行了对比,并且简要描述了目前广泛应用的话题演化评测方法。文章最后分析了目前存在的挑战,并且对该研究方向进行了展望。     

An Analysis of the Criteria for Evaluating Adequate Theories of Computation

This paper deals with the question: What are the criteria that an adequate theory of computation has to meet? (1) Smith’s answer: it has to meet the empirical criterion (i.e. doing justice to computational practice), the conceptual criterion (i.e. explaining all the underlying concepts) and the cognitive criterion (i.e. providing solid grounds for computationalism). (2) Piccinini’s answer: it has to meet the objectivity criterion (i.e. identifying computation as a matter of fact), the explanation criterion (i.e. explaining the computer’s behaviour), the right things compute criterion, the miscomputation criterion (i.e. accounting for malfunctions), the taxonomy criterion (i.e. distinguishing between different classes of computers) and the empirical criterion. (3) Von Neumann’s answer: it has to meet the precision and reliability of computers criterion, the single error criterion (i.e. addressing the impacts of errors) and the distinction between analogue and digital computers criterion. (4) “Everything” computes answer: it has to meet the implementation theory criterion by properly explaining the notion of implementation.     

BOOTSTRAP 3.0—A SPICE1 Conformant Software Process Assessment Methodology

BOOTSTRAP methodology was initially developed in an ESPRIT project together with European industry. After February 1993, the methodology has been managed and further developed by a European Economic Interest Group, called BOOTSTRAP Institute. BOOTSTRAP methodology version 3.0 was released in September 1997. It is compliant with the ISO/IEC software engineering standard number 15504, the emerging standard on software process assessment. The core of the methodology consists of an assessment model and method. The assessment model of the methodology version 3.0 was updated to align with the ISO 12207 life-cycle and 15504 reference model requirements. In addition to the Process and Capability dimensions, it contains a Technology dimension. The Process dimension contains 33 different processes organised in six clusters: Organisation, Life Cycle Dependent, Management, Support, Customer-Supplier, and Process Related. The Capability dimension consists of six levels, each level consisting of one or more process attributes, adopted from ISO 15504. An assessment is conducted at SPU and project levels. The BOOTSTRAP Institute organises and co-ordinates assessor training and registration scheme. BOOTSTRAP methodology is being used in two European projects: SPAM and PROFES.