Guest Editors' Introduction: Cross-Reality Environments

In this article, we define cross-reality as the union between ubiquitous sensor/actuator networks and shared online virtual worlds-a place where collective human perception meets the machines' view of pervasive computing. We describe how five of the articles in this issue expand on aspects of this theme.     

移动环境下支持实时事务处理的数据预取

随着移动通信技术的迅速发展,人们提出了新的应用要求:在移动环境下处理实时事务.而移动通信带宽有限性引起较大的数据访问延迟,有时甚至由于网络传输的断接使得事务得不到所需要的数据,数据预取能够很好地解决这个问题.已有的移动环境下数据预取没有考虑到数据的流行性和事务的时间特性.该文分析影响实时事务数据预取的因素,首先考虑数据易变性、活跃性等因素,获得高价值预取数据集合;然后考虑访问预取数据的事务优先级、数据流行性等因素,构造预取数据的选择函数,通过该函数在前面选取的集合中筛选出对满足实时事务截止期更有价值的数据对象进行预取.实验表明,该数据预取策略能降低移动实时事务满足截止期的比率,更好地支持移动实时事务处理.     

Building and Employing Cross-Reality

Considers present and future practical applications of cross-reality. From tools to build new 3D virtual worlds to the products of those tools, cross-reality is becoming a staple of our everyday reality. Practical applications of cross-reality include the ability to virtually visit a factory to manage and maintain resources from the comfort of your laptop or desktop PC as well as sentient visors that augment reality with additional information so that users can make more informed choices. Tools and projects considered are:Project Wonderland for multiuser mixed reality;ClearWorlds: mixed- reality presence through virtual clearboards; VICI (Visualization of Immersive and Contextual Information) for ubiquitous augmented reality based on a tangible user interface; Mirror World Chocolate Factory; and sentient visors for browsing the world.     

Optimization Techniques for RFID Complex Event Processing

One research crucial to wider adoption of Radio Frequency Identification(RFID) technology is how to efficiently transform sequences of RFID readings into meaningful business events.Contrary to traditional events,RFID readings are usually of high volume and velocity,and have the attributes representing their reading objects,occurrence times and spots. Based on these characteristics and the Non-deterministic Finite Automata(NFA) implementation framework,this paper studies the performance issues of RFID com...     

Component Based Simulation Environments of Distributed Discrete Event Simulation

Component based design is a software design method developing from object-oriented design. It uses hierarchical, rnodular ideas to analyze and design systerns. It improves the reusability of software, decreases the cost of system developments. This paper applies the ideas of component based software design and distributed discrete event simulation （DDES）, and puts forward simulation component model standards and distributed simulation method, and develops the simulation environment. This method allows the users to reuse existing models and to build simulation by assembling basic models. It is fit for modeling and simulating large and complex systems in especial domain such as communication network, and supports the reuse of models effectively. The simulation environment has good flexibility and expansibility.     

Foundations for Streaming Model Transformations by Complex Event Processing

Streaming model transformations represent a novel class of transformations to manipulate models whose elements are continuously produced or modified in high volume and with rapid rate of change. Executing streaming transformations requires efficient techniques to recognize activated transformation rules over a live model and a potentially infinite stream of events. In this paper, we propose foundations of streaming model transformations by innovatively integrating incremental model query, complex event processing (CEP) and reactive (event-driven) transformation techniques. Complex event processing allows to identify relevant patterns and sequences of events over an event stream. Our approach enables event streams to include model change events which are automatically and continuously populated by incremental model queries. Furthermore, a reactive rule engine carries out transformations on identified complex event patterns. We provide an integrated domain-specific language with precise semantics for capturing complex event patterns and streaming transformations together with an execution engine, all of which is now part of the Viatra reactive transformation framework. We demonstrate the feasibility of our approach with two case studies: one in an advanced model engineering workflow; and one in the context of on-the-fly gesture recognition.     

Toward Performance-Driven System Support for Distributed Computing in Clustered Environments

With the proliferation of workstation clusters connected by high-speed networks, providing efficient system support for concurrent applications engaging in nontrivial interaction has become an important problem. Two principal barriers to harnessing parallelism are: (1) efficient mechanisms that achieve transparent dependency maintenance while preserving semantic correctness and (2) scheduling algorithms that match coupled processes to distributed resources while explicitly incorporating their communication costs. This paper describes a set of performance features and their properties and implementation in a system support environment called DUNES that achieves transparent dependency maintenance—IPC, file access, memory access, process creation/termination, process relationships—under dynamic load balancing. The two principal performance features are push/pull-based active and passive end-point caching and communication-sensitive load balancing. Collectively, they mitigate the overhead introduced by the transparent dependency maintenance mechanisms. Communication-sensitive load balancing, in addition, affects the scheduling of distributed resources to application processes where both communication and computation costs are explicitly taken into account. DUNES' architecture endows commodity operating systems with distributed operating system functionality while achieving transparency with respect to their existing application base. DUNES also preserves semantic correctness with respect to single processor semantics. We show performance measurements of a UNIX-based implementation on Sparc and x86 architectures over high-speed LAN environments. We show that significant performance gains in terms of system throughput and parallel application speedup are achievable.     

Complex Event Processing (CEP)

Zusammenfassung  Ereignisgesteuerte Informationssysteme ben?tigen eine systematische und automatische Verarbeitung von Ereignissen: Complex Event Processing (CEP).     

一种基于算子的可扩展复杂事件处理模型

随着大数据处理的深入发展,系统单位时间内产生的数据日趋庞大,数据间的关联关系日趋复杂,这使得传统的“存储-查询”或者“发布-订阅”的方式无法很好地满足诸如故障监控、股票分析、医疗及生命保障等对大数据具有实时处理需求的系统。复杂事件处理技术实现的是将用户对特定的事件序列的查询需求映射到特定识别结构上。该结构从多个持续的数据流中分析并提取满足特定模式的事件序列。该技术能够很好地支持对大量数据进行实时在线分析。但由于在数据处理的过程中,系统不可能预置全部的查询语义,许多系统在使用过程中会需要使用新的语义,以查询新产生的模式。因此,一种支持扩展的语义的复杂事件处理模型是非常必要的。同时,现有的复杂事件处理模型仅针对某几类特定的查询进行描述以及优化,对整体模型缺乏统一描述,导致许多模型在多规则复杂查询的情况下效率欠佳。针对上述问题,提出了基于算子的可扩展复杂事件处理模型。该模型能够良好地支持现有的各类查询语义,具有较快的识别速度。基于该模型的形式化描述,对系统在识别过程中的性能消耗进行了详细分析,给出了模型构造最优算法。通过实验验证了算子模型优化方案的正确性。实验结果表明,经过优化后的树结构事件处理速度比开源复杂事件处理引擎Esper快3倍以上。     

Complex Event Processing (CEP)

Ereignisgesteuerte Informationssysteme ben?tigen eine systematische und automatische Verarbeitung von Ereignissen: Complex Event Processing (CEP).     

数据广播环境下实时查询处理

现有的实时数据广播研究中,只考虑了具有截止期约束的单个数据请求的调度问题,而支持实时查询处理的数据广播技术尚未得到足够的关注。该文研究在on-demand数据广播环境下,如何有效地处理实时查询问题,提出一种新的数据调度算法(QSA)。通过仿真实验与目前最为有效的数据请求调度算法SIN进行了比较,结果显示QSA具有更低的错过截止期比率,在最好的情况下,QSA比SIN降低了17.45%。     

面向RFID数据处理的复杂事件模式匹配方法

RFID数据具有不确定性,复杂事件处理技术将RFID数据看作不同类型的事件,从事件流中检测符合特定匹配模式的复杂事件。概率事件流分为多项概率事件流和单项概率事件流;针对多项概率事件流,提出NFA-MMG模式匹配方法,亦即使用多个有向无环图结合自动机实现模式匹配。针对单项概率事件流,提出NFA-Tree模式匹配方法,亦即使用匹配树结合自动机实现模式匹配;并提出改进的NFA-Tree方法,即基于概率阈值进行过滤,提高结果过滤效率。实验结果验证了上述模式匹配方法的性能优势。     

Sequence Clustering-based Automated Rule Generation for Adaptive Complex Event Processing

In Complex Event Processing (CEP), complex events are detected according to a set of rules that are defined by domain experts. However, it makes the reliability of the system decreased as dynamic changes occur in the domain environment or domain experts make mistakes. To address such problem, this study proposes a Sequence Clustering-based Automated Rule Generation (SCARG) that can automatically generate rules by mining decision-making history of domain experts based on sequence clustering and probabilistic graphical modeling. Furthermore, based on a two-way learning approach, the proposed method is able to support automated regular or occasional rule updates. It makes self-adaptive CEP system possible by combining the rule generation method and the existing dynamic CEP systems. This technique is verified by establishing an automated stock trading system, and the performance of the system is measured in terms of the rate of return. The study solves the aforementioned problems and shows excellent results with an increase of 19.32% in performance when compared to the existing dynamic CEP technique.     

基于事件顺序的时间戳协议处理

在不考虑网络延迟的情况下,提出一种基于事件顺序的时间戳协议处理方法。在分析时间戳大小与事件关系的基础上,证明为使事件绑定时主体接收的时间戳是新的,状态转移必须满足时间戳关系无环性,并基于事件顺序给出时间戳关系无环性的验证算法。实例表明,该方法易于实现,且具有一定适用性。     

复杂事件处理中时间窗口的改进

针对各种复杂事件处理引擎的优缺点，考虑特别查询和时间窗口2项关键技术，提出一种改进的实现方法。对已有引擎的优缺点进行对比，采用增加预处理和调度模块的方法，实现STREAM系统的改进版本SPSA。实验结果证明，该改进能在特定的条件下提高系统效率、降低系统压力。     

Out-of-Order Event Processing in Kinetic Data Structures

We study the problem of designing kinetic data structures (KDS’s for short) when event times cannot be computed exactly and events may be processed in a wrong order. In traditional KDS’s this can lead to major inconsistencies from which the KDS cannot recover. We present more robust KDS’s for the maintenance of several fundamental structures such as kinetic sorting and kinetic tournament trees, which overcome the difficulty by employing a refined event scheduling and processing technique. We prove that the new event scheduling mechanism leads to a KDS that is correct except for finitely many short time intervals. We analyze the maximum delay of events and the maximum error in the structure, and we experimentally compare our approach to the standard event scheduling mechanism.     

面向车联网的时空事件处理语言STEP

车联网是物联网技术应用于智能交通领域所形成的重要研究领域。复杂事件处理技术是车联网系统数据流处理的重要方法。有别于经典的物联网系统,车联网中数据流包含大量的时间和空间信息。在复杂事件处理技术中,如何有效地表达和处理车联网的时空数据流成为亟待解决的问题。针对该问题,提出了一种时空事件处理语言(spatial-temporal event processing language,STEP)。STEP分别采用时间段和栅格地图作为时间和空间模型。基于该时空模型,首先给出STEP语言的相关时空算子和完整语法,从而有效地表达车联网中时空事件流的时空信息。然后,分别从形式语义学角度引入STEP语言的操作语义,并且从实现角度给出了基于Petri网模型的时空事件流处理算法,从而建立车联网时空事件流处理机制。最后,通过实验说明了基于STEP语言的车联网时空事件流处理机制的有效性。     

面向物联网的分布式上下文敏感复杂事件处理方法

物联网产生的数据具有大数据特征,而这些数据难以用现有数据处理技术进行有效处理.作为物联网中间件的核心技术,复杂事件处理技术具备大数据的海量、复杂性等特征和实时处理的需求.上下文敏感是复杂事件处理引擎的重要特征.提出一种高效的面向物联网的分布式上下文敏感复杂事件处理架构和方法.该方法使用模糊本体进行上下文建模,以支持事件的不确定性及模糊事件查询问题.以基于模糊本体的查询和基于相似性的分布式推理为基础,生成复杂事件查询规划,并通过查询重写,把上下文相关查询转换为上下文无关子查询.根据不同的事件模型和上下文划分数据,并通过优化和多级并行来提高性能.实验结果表明该方法能够处理模糊事件上下文,对于面向物联网的分布式上下文敏感复杂事件处理具有比一般方法更好的性能和可伸缩性.