This paper presents a new lightweight algorithm for pruning inactive entries in version vectors (VVs). This algorithm lets each node remove inactive VV entries without any coordination with other nodes. It achieves this feature by devising a new way to compare two version vectors based on loosely synchronized clocks and placing a timing restriction on the behavior of the application. VVs comput...

Temporal uncertainty in raw data can impede the inference of temporal and causal relationships between events and compromise the output of data-to-text NLG systems. In this paper, we introduce a framework to reason with and represent temporal uncertainty from the raw data to the generated text, in order to provide a faithful picture to the user of a particular situation. The model is grounded i...

In a distributed system, it is often important to detect the causal relationships between events, where event e 1 is causally before event e 2 if e 1 happened before e 2 and could possibly have aaected the occurrence of e 2. In this paper we argue that detecting causal relationships among events can be important for security, in the sense that it may be essential to the correct implementation o...

Experts of chance discovery have recognized a new class of problems where the previous methods fail to visualize a latent structure behind observation. There are invisible events that play an important role in the dynamics of visible events. An invisible leader in a communication network is a typical example. Such an event is named a dark event. A novel technique has been proposed to understand...

The processor architecture available on the K computer (SPARC64 VIIIfx) features an hardware cache partitioning mechanism called sector cache. This facility enables software to split the memory cache in two independent sectors: data loads in one sector cannot trigger the eviction of data in the second one. Moreover, software is responsible for data placement in each sector by issuing special in...

At the very beginning of compiling a bibliography, usually only basic information, such as title, authors and publication date of an item are known. In order to gather additional information about a specific item, one typically has to search the library catalog or use a web search engine. This look-up procedure implies a manual effort for every single item of a bibliography. In this technical r...

Discovering motion activities in videos is a key problem in computer vision, with applications in scene analysis, video categorization, and video indexing. In this paper, we propose a method that uses probabilistic topic modeling for discovering patterns of motion that occur in a given activity. Our method also identifies how the discovered patterns of motion relate to one another in space and ...

The paper presents a method of association rules discovering from medical data using the evolutionary approach. The elaborated method (EGAR) uses a genetic algorithm as a tool of knowledge discovering from a set of data, in the form of association rules. The method is compared with known and common method – FPTree. The developed computer program is applied for testing the proposed method and co...

We present an empirical study of one-onone human tutoring dialogues in the domain of Computer Science data structures. We are interested in discovering effective tutoring strategies, that we frame as discovering which Dialogue Act (DA) sequences correlate with learning. We employ multiple linear regression, to discover the strongest models that explain why students learn during one-on-one tutor...

The paper presents a method of association rules discovering from medical data using the evolutionary approach. The elaborated method (EGAR) uses a genetic algorithm as a tool of knowledge discovering from a set of data, in the form of association rules. The method is compared with known and common method – FPTree. The developed computer program is applied for testing the proposed method and co...