Optimized cardinality-based generalized itemset mining using transaction ID and numeric encoding

In recent years, generalization-based data mining techniques have become an interesting topic for many data scientists. Generalized itemset mining is an exploration technique that focuses on extracting high-level abstractions and correlations in a database. However, the problem that domain experts must always deal with is how to manage and interpret a large number of extracted patterns from a massive database of transactions. In generalized pattern mining, taxonomies that contain abstraction information for each dataset are defined, so the number of frequent patterns can grow enormously. Therefore, exploiting knowledge turns into a difficult and costly process. In this article, we introduce an approach that uses cardinality-based constraints with transaction id and numeric encoding to mine generalized patterns. We applied transaction id to support the computation of each frequent itemset as well as to encode taxonomies into a numeric type using two simple rules. We also attempted to apply the combination of cardinality cons- traints and closed or maximal patterns. Experiments show that our optimizations significantly improve the performance of the original method, and the importance of comprehensive information within closed and maximal patterns is worth considering in generalized frequent pattern mining.     

Specification of temporal properties with OCL

The Object Constraint Language (OCL) is widely used to express static constraints on models and object-oriented systems. However, the notion of dynamic constraints, controlling the system behavior over time, has not been natively supported. Such dynamic constraints are necessary to handle temporal and real-time properties of systems.In this paper, we first add a temporal layer to the OCL language, based syntactically on Dwyer et al.'s specification patterns. We enrich it with formal scenario-based semantics and integrate it into the current Eclipse OCL plug-in. Second, we translate, with a compositional approach, OCL temporal properties into finite-state automata and we connect our framework to automatic test generators. This way, we create a bridge linking model driven engineering and usual formal methods.     

基于本体和会话策略的多主体交互协议描述方法

提出一种基于会话策略的多主体交互协议描述方法。交互协议中的消息用言语动作来表示,这些言语动作被描述为WS-Agreement的schema;会话策略则描述了消息传递的流程以及交互过程中的上下文信息,如参与者属性、时间阈值等等,所有这些会话策略组成了一个多主体交互协议;采用本体描述语言OWL作为会话策略的表示语言。这种方法使得主体在一个开放、动态的环境中可以灵活地选择交互协议。     

基于事务映射区间求交的高效频繁模式挖掘算法

关联规则挖掘是数据挖掘重要研究课题,大数据处理对关联规则挖掘算法效率提出了更高要求,而关联规则挖掘的最耗时的步骤是频繁模式挖掘。针对当前频繁模式挖掘算法效率不高的问题,结合Apriori算法和FP-growth算法,提出一种基于事务映射区间求交的频繁模式挖掘算法IITM（interval interaction and transaction mapping）,只需扫描数据集两次来生成FP树,然后扫描FP树将每个项的ID映射到区间中,通过区间求交来进行模式增长。该算法解决了Apriori算法需要多次扫描数据集,FP-growth算法需要迭代地生成条件FP树来进行模式增长而带来的效率下降的问题。在真实数据集上的实验显示,在不同的支持度下IITM算法都要要优于Apriori、FP-growth以及PIETM算法。     

银行账户交易复杂网络特性分析

首先基于银行账户交易的特点,建立了一个有向加权的银行账户交易网络通用模型。进而,根据复杂网络的定义,从网络结构和节点2个层面,验证了交易网络的复杂网络特性。其中,网络结构特性包括静态特性（即无标度特性和小世界特性）和动态演化特性（即自组织特性）。此外,使用吸引子特性验证了复杂网络节点的动力学特征。分析包含非法传销交易的真实银行交易数据,得出如下结论：该网络具有无标度特性、小世界特性、部分自组织特性和奇异吸引子。     

Specification and analysis of timing properties in a case tool CONRAD

The methods and environments for developing real-time systems have become an important factor encouraging the rapidly increasing role of real-time systems in everyday life. In spite of the remarkable success in applying software engineering tools to real-time systems, the analysis of timing properties and the consistency proofs of time-constraints is still in its infancy.This paper suggests a solution which improves the ability to study and prove time-correctness of real-time systems. CONRAD (CONtrol software Requirements, Analysis and Design) is a set of tools which allows formal specification and analysis of timing properties (the EDITOR), and informal analysis (animation) starting from the early stages of the requirements specification. This paper describes the possibilities provided by the EDITOR.     

Specification and evaluation of polymorphic shellcode properties using a new temporal logic

It is a well-known fact that polymorphism is one of the greatest find of malicious code authors. Applied in the context of Buffer Overflow attacks, the detection of such codes becomes very difficult. In view of this problematic, which constitutes a real challenge for all the international community, we propose in this paper a new formal language (based on temporal logics such as CTL) allowing to specify polymorphic codes, to detect them and to better understand their nature. The efficiency and the expressiveness of this language are shown via the specification of a variety of properties characterizing polymorphic shellcodes. Finally, to make the verification process automatic, this language is supported by a new IDS (Intrusion Detection System) that will also be presented in this paper.     

Expressing checkable properties of dynamic systems: the Bandera Specification Language

Research on how to reason about correctness properties of software systems using model checking is advancing rapidly. Work on extracting finite-state models from program source code and on abstracting those models is focused on enabling the tractable checking of program properties such as freedom from deadlock and assertion violations. For the most part, the problem of specifying more general program properties has not been considered. In this paper, we report on the support for specifying properties of dynamic multi-threaded Java programs that we have built into the Bandera system. Bandera extracts finite-state models, in the input format of several existing model checkers, from Java code based on the property to be checked. The Bandera Specification Language (BSL) provides a language for defining general assertions and pre/post conditions on methods. It also supports the definition of observations that can be made of the state of program objects and the incorporation of those observations as predicates that can be instantiated in the scope of object quantifiers and used in describing common forms of state/event sequencing properties. We illustrate how BSL can be used to formulate a variety of system correctness properties for several multi-threaded Java applications. Published online: 2 October 2002     

Evie - A developer toolkit for encoding service interaction patterns

Facilitation of collaborative business processes across organizational and infrastructural boundaries continues to present challenges to enterprise software developers. One of the greatest difficulties in this respect is achieving a streamlined pipeline from business modeling to execution infrastructures. In this paper we present Evie - an approach for rapid design and deployment of event driven collaborative processes based on significant language extensions to Java that are characterized by abstract and succinct constructs. The focus of this paper is to provide proof of concept of Evie’s expressability using a recent benchmark known as service interaction patterns. While the patterns encapsulate the breadth of required business process semantics the Evie language delivers a rapid means of encoding them at an abstract level, and subsequently compiling and executing them to create a fully fledged Java-based execution environment.

Tetra-trees properties in graphic interaction

The localization of the components of an object near to a device before obtaining the real interaction is usually determined by means of a proximity measurement to the device of the object’s features. In order to do this efficiently, hierarchical decompositions are used, so that the features of the objects are classified into several types of cells, usually rectangular.In this paper we propose a solution based on the classification of a set of points situated on the device in a little-known spatial decomposition named tetra-tree. Using this type of spatial decomposition gives us several quantitative and qualitative properties that allow us a more realistic and intuitive visual interaction, as well as the possibility of selecting inaccessible components. These features could be used in virtual sculpting or accessibility tasks.In order to show these properties we have compared an interaction system based on tetra-trees to one based on octrees.     

Heterogeneous and autonomous transaction processing

The problems specific to heterogeneous and autonomous transactions processing (HATP) systems are discussed. HATP is divided into three dimensions: distribution, heterogeneity, and autonomy. The authors regard the three dimensions as independent, and they present concrete design and implementation techniques to support this view     

工作流事务性研究综述

阐述了工作流中事务性的起源和发展,讨论了事务工作流在建模阶段将业务模型与事务性相结合所采用的主要方法,总结了事务工作流中并发控制机制和采用的各种调度算法,研究了事务工作流的错误恢复机制,概括了广泛应用的补偿机制的研究现状,论述了面向Web服务工作流事务性的特点及相关研究,并展望工作流事务性未来的研究方向.     

Requirements and Specification Exemplars

Specification exemplars are familiar to most software engineering researchers. For instance, many will have encountered the well known library and lift problem statements, and will have seen one or more published specifications. Exemplars may serve several purposes: to drive and communicate individual research advances; to establish research agendas and to compare and contrast alternative approaches; and, ultimately, to lead to advances in software development practices.Because of their prevalence in the literature, exemplars are worth critical study. In this paper we consider the purposes that exemplars may serve, and explore the incompatibilities inherent in trying to serve several of them at once. Researchers should therefore be clear about what successfully handling an exemplar demonstrates. We go on to examine the use of exemplars not only for writing specifications (an end product of requirements engineering), but also for the requirements engineering process itself. In particular, requirements for good requirements exemplars are suggested and ways of obtaining such exemplars are discussed.     

ESB事务模型的设计与实现

企业服务总线中,传统事务处理模型、扩展事务处理模型和Web服务事务处理模型都无法满足该环境下服务流程的事务处理需求.提出一种以流程进行事务注册、以事务性消息进行事务划分的面向流程的事务处理模型来解决企业服务总线环境下具有服务松耦合、运行时间长短不确定,服务类型多样以及服务流程的静态编制等特性的服务流程的事务需求.该事务处理模型已在企业服务总线产品中得到了成功应用.     

Specification of iterators

Iterators are defined, and previously published methods for defining their meanings are outlined. It is shown how to use trace specifications to define a common form of iterator module (Alphard-style iterators). A form of specification for an iterator is shown which can capture the key differences between a set and a sequence at a few particular places in the specification. The trace specification of a sequence iterator is compared to an algebraic specification. It is concluded that the algebraic specification is possible but somewhat clumsier. Traces are used to give partial specifications of iterator construct that make sequences of calls on procedural parameters     

Concurrent execution of transaction copies

Copies of a transaction execute concurrently when a task has to be performed at the same time by multiple database users (e.g., airline seat reservation). We assume a distributed database which controls concurrency by locking, and we present the following two results. In order to determine whether or not an arbitrarily large set of copies is deadlock-free, at least m copies must be tested for deadlock freedom, where m is the number of referenced database entities. On the other hand, to determine whether such a set ensures serializability it suffices to test only two copies.     

交易中间件的研究与实现

文章设计了一个交易中间件模型，该模型主要由通信进程、交易进程和服务进程组成，同时介绍了应用层接口和数据库接口，重点描述了交易处理方式及完整性保护机制。为了有效地控制交易风险，提出了一种锁与自动确认／冲正相结合的处理方式。     

Design of transaction management protocols

The paper shows how transaction management protocols can be designed using discrete-event system control theory. It outlines designs for some well-known protocols: serialization graph testing, two-phase locking, and timestamp ordering. These protocols can be obtained as solutions (centralized, fully decentralized, or maximal decentralized) of standard control problems. The results serve to unify the problems considered and suggest the possibility of computer-aided design     

Efficient and flexible anonymization of transaction data

Transaction data are increasingly used in applications, such as marketing research and biomedical studies. Publishing these data, however, may risk privacy breaches, as they often contain personal information about individuals. Approaches to anonymizing transaction data have been proposed recently, but they may produce excessively distorted and inadequately protected solutions. This is because these approaches do not consider privacy requirements that are common in real-world applications in a realistic and flexible manner, and attempt to safeguard the data only against either identity disclosure or sensitive information inference. In this paper, we propose a new approach that overcomes these limitations. We introduce a rule-based privacy model that allows data publishers to express fine-grained protection requirements for both identity and sensitive information disclosure. Based on this model, we also develop two anonymization algorithms. Our first algorithm works in a top-down fashion, employing an efficient strategy to recursively generalize data with low information loss. Our second algorithm uses sampling and a combination of top-down and bottom-up generalization heuristics, which greatly improves scalability while maintaining low information loss. Extensive experiments show that our algorithms significantly outperform the state-of-the-art in terms of retaining data utility, while achieving good protection and scalability.     

Web service的事务协调框架研究与实现

提出并实现了一种Web服务的事务协调框架,DTCF（Distributed Transaction Coordination Framework）。该模型基于嵌套事务模型和协调思想,将局部事务的实现细节进行封装,不同局部事务可采用不同的并发控制和恢复技术,而对全局事务则采用完全分布的管理机制进行管理。DTCF是一种可重用的框架,实验结果表明其可用性。