handy systematic method for enumerating all possible data dependency cases that could occur between any two instru c-tions that might happen to be processed at the same time at different stages o f the pipeline. Given instructions of the instruction set, specific information about operands of each instruction and when an instruction reads or writes data, the method could be used to enumerate al...

This paper presents a visual query notation for the generic model query language GMQL. So far, GMQL allows for specifying pattern queries as complex set-theoretical formulas. This fact impedes the practical usability of GMQL, because specifying and understanding a query is unintuitive. The visual query notation we propose is a first step towards resolving this shortcoming. We derive objectives ...

The paper shortly analyses the HL7 communication standards for resolving the gap between them by developing a set of ontologies reflecting the concepts and relationships which is exemplified with the incompatible HL7 versions 2.x and 3. Bridging between the different ontologies is performed by introducing a reference ontology to which a mapping is defined. The paper discusses problems and solut...

This paper describes a hybrid, two-level approach for resolving hedge cues, the problem of the CoNLL 2010 shared task. First, a maximum entropy classifier is applied to identify cue words, using both syntacticand surface-oriented features. Second, a set of manually crafted rules, operating on dependency representations and the output of the classifier, is applied to resolve the scope of the hed...

Autonomous agents operate in complex environments and, over time, conflicts inevitably occur among them. Negotiation is the predominant process for resolving conflicts. This paper presents a generic negotiation model for autonomous agents that handles multiparty, multi-issue and repeated rounds. The model is based on computationally tractable assumptions, accounts for a tight integration of the...

Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every vertex in (V (G) \S) to one of its neighbors such that the total number of vertices mapped by f to any vertex v ∈ S does not exceed c(v). In the Planar Capacitated Dominating Set problem we are given a planar graph G, a ca...

Pipelining is a widely used technique that query execution engines employ to improve individual query execution times. In recently proposed settings, pipelining is used as an alternative to materialization to evaluate query plan graphs, where nodes in a query plan can have multiple parents. Such scenarios include shared table scans, runtime operator sharing, parallel sorting, and pipelined Mult...

In a quantified expression, the possibility of referring to the set-theoretical difference of restrictor and scope is known as complement anaphora (CA). Existing literature suggests two ways of analyzing this phenomenon either as confusion with reference to the maximal set, or as genuine complement reference. This paper will show that resolving an anaphor to the complement set is never a viable...