一个扩展的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模型、对文本集合后离散和先离散方法。在详细叙述这三种方法的基础上,针对时间粒度、是否在线等多个特征进行了对比,并且简要描述了目前广泛应用的话题演化评测方法。文章最后分析了目前存在的挑战,并且对该研究方向进行了展望。     

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.     

Schematic classification problems and their solution

The necessity arises in a variety of tasks to classify items on the basis of the presence of one of a number of criterial sets of co-related feature values. Such sets are called class characteristics. Because such classification problems require the identification of characteristics on the basis of limited training information, they entail a difficult search problem. Consideration of the differences between the theoretical models underlying characteristic and volume pattern generators suggests a schematic approach. Schemata, sets of commonly co-occuring features values, are probabilistic indicators of class membership whenever the characteristics are unknown but the characteristic model prevails. Formal and algorithmic solutions to the classification problem when exemplars are simple (consist only of M feature or attribute values) are described. The relevance of these procedures to problems involving general (relational) data structures is also indicated.     

Improving extraction of watermarks in color attacked watermarked images

A new approach for modeling color attacks of RGB-color watermarked images is presented in this paper. We have used a based interpolation watermarking algorithm and supposed that the attacks are simulated by a scaling of the colors followed by a translation. Then give bounds for the extracted watermark depending on the original image, the watermark and the attack. Different attacks like LSB, embedding another watermark, Stirmark have been simulated and the quality of the extracted watermark is discussed in each case.     

艺术的坦诚——浅析席勒艺术

艺术能为观者接受以致敬仰膜拜而百世流传,最本质的一点是艺术所表达的深深地感应了观者的心理。而这之间的过程就来自于艺术家将所感受到的人类情感予以坦诚的表达。席勒艺术在其一生中都彰显着坦诚,不论选材还是绘画表达方式上都是一种诚挚的心态。19世纪末,他在人类灵魂孤独无助时,让人类认识到自身的价值。他将慎微觉察到的人类灵魂图谱呈现在世人的面前。虽然生命短暂,却在人类心理历程中留下了光辉的一笔。     

KRISHNA - An efficient concurrency control algorithm based on dynamic attributes of transactions and its performance

Concurrent transactions during their execution life acquire a number of attributes. We call them dynamic attributes of transactions. We have used them to develop a concurrency control mechanism, called KRISHNA, using a two-phase locking policy. To establish the usefulness of dynamic attributes in developing concurrency control mechanisms and to investigate the behaviour of KRISHNA we have studied their performance using a detailed simulation model. We show that KRISHNA outperforms a number of well-known concurrency control mechanisms based on a two-phase policy. We also show that the conflict-resolution policy of KRISHNA is comparatively more accurate in resolving conflicts, i.e., it selects the ‘right’ transaction for rolling back or blocking. We argue that implementing KRISHNA is not expensive compared to commonly used concurrency control mechanisms.     

功能点的计算方法

目前,软件复杂度越来越高,有的甚至会成为管理系统的系统,虽然这些软件有着不同的目标,但最终它们都必须相互协调的在一起共同发展。然而,随着软件的复杂度的上升,软件的可控性却在下降。由此,软件度量在软件开发过程中的地位日益增强。因为只有做好软件度量工作,才能在很短的时间内,做出正确的决策,保证产品的质量,才能在日益激烈的竞争中取得胜利。而软件度量的方法有很多,例如FPA、LOC等等,本文主要关注的功能点分析方法,主要是探讨一下FPA中的功能点的计算方法。     

Using information management systems to study modern Greek folklore

The Karagiozis, Greek shadow puppet theater performance derived from a sixteenth century Turkish model, is an interactive performative event rather than a static text treated in isolation from its extended environmental and immediate performative contexts and thus requires critical shifts in the research approach one uses. A method of collating data that could handle the differences of multiple variants became necessary. Such a method had to effectively test the transformational growth of the form given the influence of irrational forces, had to organize a large number of variables as well as a substantial body of texts, and had to operate at the smallest level to insure that findings were confirmed or disconfirmed in the most exhaustive and comprehensive way possible. That method was to be found in information management systems, specifically Asksam and Notebook II.Kostas Myrsiades is Professor of Comparative Literature and English and chairperson of the Department of English at West Chester University. His publications include six books and numerous articles of criticism and translations of Greek poetry. His latest book,Yannis Ritsos: Selected Poems, 1938–1988 will be published this summer by Boa Editions. He is presently working on a book for the Modern Language Association on Nota Bene.Linda Suny Myrsiades has written numerous articles on Karagiozis Greek shadow theater in the U.S.A. and abroad. In 1988 New England University Press published her book.The Karagiozis Heroic Performance in Greek Shadow Theater (with Kostas Myrsiades). She and her husband are now completing a companion volume.The Karagiozis Oral Comic Performance.     

The Distributed Time-Triggered Simulation Scheme: Core Principles and Supporting Execution Engine

Distributed real-time simulation is a young technology field but its practice is under increasing demands. In recent years the author and his collaborators have been establishing a new approach called the distributed time-triggered simulation (DTS) scheme which is conceptually simple and easy to use but widely applicable. The concept was initiated in the course of developing a new-generation object-oriented real-time programming scheme called the time-triggered message-triggered object (TMO) programming scheme. Some fundamental issues inherent in distributed real-time simulation that were learned during recent experimental studies are discussed along with some approaches for resolving the issues. An execution engine developed to support both the TMOs engaged in control computation and the TMOs engaged in DTS is also discussed along with its possible extensions that will enable significantly larger-scale DTSs.     

可拓聚类的科教人际网络节点重要性动态分析方法

目前大多数研究对复杂社会网络关键节点影响力的识别都是静态的，缺乏动态变化的分析。采用可拓聚类方法对动态变化下的科教人际网络进行量化分析，首先以多属性决策法计算每个节点重要性，再利用变异系数权重法计算得该节点综合重要性量值，之后划分等级并取标准正域和正域区间，利用可拓关联函数计算每个节点与每个等级的关联度，关联度值最大的等级即为该节点对应等级，最后分析同一社会网络节点在不同时间点的重要性等级变化。可拓聚类方法尝试从动态上对网络节点重要性进行把握，最后通过实例验证了该方法的有效性。     

基于K-means算法的地铁站台异物检测

针对地铁屏蔽门和列车门之间的间隙会产生夹人夹物等地铁运营安全事故隐患,提出一种基于K-means的地铁站台异物面检测方法。该方法通过采用人工构造光学背景,并且采用HSV颜色空间来提高检测的效率和准确度。算法采用K-means方法对车首摄像头拍摄车尾灯带图像进行目标提取,通过对目标的完整性计算来判断列车车体与屏蔽门缝隙是否存在空间异物。通过对真实视频数据进行实验,结果表明所提算法对光照变化具有很好的鲁棒性,可以准确检测出各种异物,能够辅助司机进行开车前的决策。     

A pragmatic multi-method investigation of discrepant technological events: Coping,attributions, and ‘accidental’ learning

Discrepant technological events or situations that entail a problem, a misunderstanding or a difficulty with the Information Technology (IT) being employed, are common in the workplace, and can lead to frustration and avoidance behaviors. Little is known, however, about how individuals cope with these events. This paper examines these events by using a multi-method pragmatic approach informed by coping theory. The results of two studies – a critical incident study and an experiment – serve to build and test, respectively, a theoretical model that posits that individuals use a variety of strategies when dealing with these events: they experience negative emotions, make external attributions, and adopt engagement coping strategies directed at solving the event, eventually switching to a disengagement coping strategy when they feel they have no control over the situation. Furthermore, users’ efforts may result in ‘accidental’ learning as they try to overcome the discrepant IT events through engagement coping. The paper ends with a discussion of the results in light of existing literature, future opportunities for research, and implications for practice.     

Recovering the military Enigma using permutations—filling in the details of Rejewski's solution

During the last few months of 1932, the Polish mathematician Marian Rejewski solved the problem of finding the internal connections of the rotors and reflector of the Enigma cipher machine used by the German army at that time. This allowed the Polish Cipher Bureau to construct an analogue of the machine, and subsequently to find effective methods for deciphering secret messages. Rejewski performed this feat virtually alone using cryptographic material provided by the Polish secret services. His knowledge of the theory of permutation groups was essential in solving this problem.

This article describes in detail how to find the complete wiring of the rotors and reflector of Enigma, as well as other specifics, using data that Rejewski had at his disposal, by systematically presenting the resolution of all cases that could have been encountered. Similarly, we complete those stages of the procedure that were only outlined by Rejewski.