On graphical quintuple systems

In this paper, we prove with the aid of symbolic computational tools, that there does not exist a non-trivial graphical 4-(λ, 5, ν) design for any λ and ν

On Formal Consistency between Value and Coordination Models

In information systems (IS) engineering dierent techniques for modeling inter-organizational collaborations are applied. In particular, value models estimate the profitability for involved stakeholders, whereas coordination models are used to agree upon the inter-organizational processes before implementing them. During the execution of inter-organizational collaboration, in addition, event logs are collected by the individual organizations representing another view of the IS. The combination of the two models and the event log represent the IS and they should therefore be consistent, i.e., not contradict each other. Since these models are provided by dierent user groups during design time and the event log is collected during run-time consistency is not straight forward. Inconsistency occurs when models contain a conflicting description of the same information, i.e., there exists a conflicting overlap between the models. In this paper we introduce an abstraction of value models, coordination models and event logs which allows ensuring and maintaining alignment between models and event log. We demonstrate its use by outlining a proof of an inconsistency resolution result based on this abstraction. Thus, the introduction of abstractions allows to explore formal inter-model relations based on consistency

Automatic specification of reliability models for fault-tolerant computers

The calculation of reliability measures using Markov models is required for life-critical processor-memory-switch structures that have standby redundancy or that are subject to transient or intermittent faults or repair. The task of specifying these models is tedious and prone to human error because of the large number of states and transitions required in any reasonable system. Therefore, model specification is a major analysis bottleneck, and model verification is a major validation problem. The general unfamiliarity of computer architects with Markov modeling techniques further increases the necessity of automating the model specification. Automation requires a general system description language (SDL). For practicality, this SDL should also provide a high level of abstraction and be easy to learn and use. The first attempt to define and implement an SDL with those characteristics is presented. A program named Automated Reliability Modeling (ARM) was constructed as a research vehicle. The ARM program uses a graphical interface as its SDL, and it outputs a Markov reliability model specification formulated for direct use by programs that generate and evaluate the model

Towards Building a Knowledge Base of Monetary Transactions from a News Collection

We address the problem of extracting structured representations of economic events from a large corpus of news articles, using a combination of natural language processing and machine learning techniques. The developed techniques allow for semi-automatic population of a financial knowledge base, which, in turn, may be used to support a range of data mining and exploration tasks. The key challenge we face in this domain is that the same event is often reported multiple times, with varying correctness of details. We address this challenge by first collecting all information pertinent to a given event from the entire corpus, then considering all possible representations of the event, and finally, using a supervised learning method, to rank these representations by the associated confidence scores. A main innovative element of our approach is that it jointly extracts and stores all attributes of the event as a single representation (quintuple). Using a purpose-built test set we demonstrate that our supervised learning approach can achieve 25% improvement in F1-score over baseline methods that consider the earliest, the latest or the most frequent reporting of the event.Comment: Proceedings of the 17th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL '17), 201

Fuzzy Bigraphs: An Exercise in Fuzzy Communicating Agents

Bigraphs and their algebra is a model of concurrency. Fuzzy bigraphs are a generalization of birgraphs intended to be a model of concurrency that incorporates vagueness. More specifically, this model assumes that agents are similar, communication is not perfect, and, in general, everything is or happens to some degree.Comment: 11 pages, 3 figure