Computer Science and Communication Research Unit

Primarily guided with the idea to express zero-time transitions by means of temporal propositional language, we have developed a temporal logic where the time flow is isomorphic to ordinal ω 2 (concatenation of ω copies of ω). If we think of ω 2 as lexicographically ordered ω×ω, then any particular zero-time transition can be represented by states whose indices are all elements of some {n} × ω. In order to express noninfinitesimal transitions, we have introduced a new unary temporal operator [ω] (ω-jump), whose effect on the time flow is the same as the effect of α → α + ω in ω 2 . In terms of lexicographically ordered ω × ω, [ω]φ is satisfied in i, j -th time instant iff φ is satisfied in i + 1, 0 -th time instant. Moreover, in order to formally capture the natural semantics of the until operator U, we have introduced a local variant u of the until operator. More precisely, φ uψ is satisfied in i, j -th time instant iff ψ is satisfied in i, j + k -th time instant for some nonnegative integer k, and φ is satisfied in i, j + l -th time instant for all 0 l < k. As in many of our previous publications, the leitmotif is the usage of infinitary inference rules in order to achieve the strong completeness.

The aim of the paper is to present a sound, strongly complete and decidable probabilistic temporal logic that can model reasoning about evidence. The formal system developed here is actually a solution of a problem proposed by Halpern and Pucella (J Artif Intell Res 26: 2006).

We show that certain families of sets and functions related to a countable structure A are analytic subsets of a Polish space. Examples include sets of automorphisms, endomorphisms and congruences of A and sets of the combinatorial nature such as coloring of countable plain graphs and domino tiling of the plane. This implies, without any additional set-theoretical assumptions, i.e., in ZFC alone, that cardinality of every such uncountable set is 2 ℵ 0 .

This paper presents a sound and strongly complete axiomatization of the reasoning about linear combinations of conditional probabilities, including compar- ative statements. The developed logic is decidable, with a PSPACE containment for the decision procedure.

The Attacks done by Viruses, Worms, Hackers, etc. are a Network Security-Problem in many Organisations. Current Intrusion Detection Systems have significant Disadvantages, e.g. the need of plenty of Computational Power or the Local Installation. Therefore, we introduce a novel Framework for Network Security which is called SANA. SANA contains an artificial Immune System with artificial Cells which perform certain Tasks in order to to support existing systems to better secure the Network against Intrusions. The Advantages of SANA are that it is efficient, adaptive, autonomous, and massively-distributed. In this Article, we describe the Architecture of the artificial Immune System and the Functionality of the Components. We explain briefly the Implementation and discuss Results.

Abstract. In our understanding, a mind-map is an adaptive en-gine that basically works incrementally on the fundament of ex-isting transactional streams. Generally, mind-maps consist of sym-bolic cells that are connected with each other and that become either stronger or weaker ...

Abstract— In the today&#x27;s Internet and TCP/IP-networks, the queueing of packets is commonly imple-mented using the protocol FIFO (First In First Out). Unfortunately, FIFO performs poorly in the Adversar-ial Queueing Theory. Other queueing strategies are re-searched in this ...

Our belief is that conviviality is a concept of great depth that plays an important role in any social interaction. A convivial relation between individuals is one that allows participating individuals to behave and interact with each other following a set of conventions either shared, commonly agreed upon or at least understood. This presupposes implicit or an explicit regulation mechanism based on consensus or social contracts and applies to the behaviours and interactions of participating individuals. With respect to web-based systems, an applicable social attribute is to assist another user, to help him/her in situations that are unclear and to recommend him in finding the right decision whenever a conflict arises. Such a convivial social biotope deeply depends on both implicit and explicit co-operation and collaboration of natural users inside a community. An individual conviviality may benefit from the "wisdom of the crowd", which means that a dynamic understanding of the user's behaviours heavily influences the individual well being of another person(s). To achieve that, we present the system CUBA and target at user profiling while making a stay convivial through recommendations.

The following (position) paper follows the concept of the field of Artificial Life and argues that the (relational) management of data can be understood as a chemical model. Whereas each data itself is consistent with atomic entities, each combination of data corresponds to a (artificial) molecular structure. For example, an attribute D inside a relational system can be represented by a nucleus α D sharing a cloud of values, which consists of so-called valectrons (the values for the column D). By using reaction rules like the selection of tuples or projection of attributes, a retrieve of molecules can be achieved quite easily. Advantages of the chemical model are no data types, a fast data access, and the associative nature of the molecules: this automatically supports a direct identification of patterns in the sense of data mining. A disadvantage is the need for restructuring that must eventually be done, because the incoming data stream is allowed to influence the chemical model. With this position paper, we present our basic concept. 2 With that, we firstly introduce the molecular model, present several reaction rules to explain its depth, and demonstrate its strength on an example.

We motivate the idea of e-conviviality in web-based systems and argue that a convivial social being deeply depends on the implicit and explicit co-operation and collaboration of natural users inside a community. We believe that a (individual) conviviality benefits from the wisdom of crowds, meaning that a continuously and dynamic understanding of the user's behaviour can heavily influence the individual well being. In this respect, we are currently implementing the system CUBA (conviviality and user behaviour analysis), which aims to find novel ways to support users during their web site visits while discovering their interests. CUBA comes up with certain recommendations and suggestions, which base on a common behaviour of the "Wisdom of Crowds". For example, concepts with respect to time, space, and user-based actions are considered.

The Attacks done by Viruses, Worms, Hackers, etc. are a Network Security-Problem in many Organisations. Current Intrusion De- tection Systems have significant Disadvantages, e.g. the need of plenty of Computational Power or the Local Installation. Therefore, we introduce a novel Framework for Network Security which is called SANA. SANA contains an artificial Immune System with artificial Cells which perform certain

Content zoning can be understood as a segmentation of textual documents into zones. This is inspired by [6] who initially proposed an approach for the argumentative zoning of textual documents. With the prototypical Cozo+ engine, we focus on content zoning towards an automatic processing of textual streams while considering only the actors as the zones. We gain information that can be used to realize an automatic recognition of content for pre-defined actors. We understand Cozo+ as a necessary pre-step towards an automatic generation of summaries and to make intellectual ownership of documents detectable.

Our belief is that conviviality is a concept of great depth that plays an important role in any social interaction. A convivial relation between individuals is one that allows participating individuals to behave and interact with each other following a set of conventions either shared, commonly agreed upon or at least understood. This presupposes implicit or an explicit regulation mechanism based on consensus or social contracts and applies to the behaviours and interactions of participating individuals. With respect to web-based systems, an applicable social attribute is to assist another user, to help him/her in situations that are unclear and to recommend him in finding the right decision whenever a conflict arises. Such a convivial social biotope deeply depends on both implicit and explicit co-operation and collaboration of natural users inside a community. An individual conviviality may benefit from the "wisdom of the crowd", which means that a dynamic understanding of the user's behaviours heavily influences the individual well being of another person(s). To achieve that, we present the system CUBA and target at user profiling while making a stay convivial through recommendations.

In the today's Internet and TCP/IP-networks, the queueing of packets is commonly implemented using the protocol FIFO (First In First Out). Unfortunately, FIFO performs poorly in the Adversarial Queueing Theory. Other queueing strategies are researched in this model and better results are performed by alternative queueing strategies, e.g. LIS (Longest In System). This article introduces a new queueing protocol called interval-strategy that is concerned with the reduction from dynamic to static routing. We discuss the maximum system time for a packet and estimate with up-to-date results how this can be achieved. We figure out the maximum amount of time where a packet can spend in the network (i.e. worst case system time), and argue that the universal instability of the presented interval-strategy can be reached through these results. When a large group of queueing strategies is used for queueing, we prove that the interval-strategy will be universally unstable. Finally, we calculate the maximum time of the static routing to reach an universal stable and polynomial - in detail linear - bounded interval-strategy. Afterwards we close - in order to check this upper bound - with up-to-date results about the delivery times in static routing.

The explorative mind-map is a dynamic framework, that emerges automatically from the input, it gets. It is unlike a verificative modeling system where existing (human) thoughts are placed and connected together. In this regard, explorative mind-maps change their size continuously, being adaptive with connectionist cells inside; mind-maps process data input incrementally and offer lots of possibilities to interact with the user through an appropriate communication interface. With respect to a cognitive-motivated situation like a conversation between partners, mind-maps become interesting as they are able to process stimulating signals whenever they occur. If these signals are close to an own understanding of the world, then the conversational partner becomes automatically more trustful than if the signals do not or less match the own knowledge scheme. In this (position) paper, we therefore motivate explorative mindmaps as a cognitive engine and propose these as a decision support engine to foster trust.

For human beings, the processing of text streams of unknown size leads generally to problems because e.g. noise must be selected out, information be tested for its relevance or redundancy, and linguistic phenomenon like ambiguity or the resolution of pronouns be advanced. Putting this into simulation by using an artificial mind-map is a challenge, which offers the gate for a wide field of applications like automatic text summarization or punctual retrieval. In this work we present a framework that is a first step towards an automatic intellect. It aims at assembling a mind-map based on incoming text streams and on a subject-verb-object strategy, having the verb as an interconnection between the adjacent nouns. The mind-map's performance is enriched by a pronoun resolution engine that bases on the work of D. Klein, and C. D. Manning.

In this paper, we introduce an explorative but adaptive-associative information management system in the presence of a natural conversation. We take advantage of these explorative mind-maps, which have been demonstrated in and which are altogether a management framework that emerges automatically from the data input stream it gets. An explorative mind-map is a non-verificative but dynamic system that basis on the natural paradigm: it changes its complexity continuously and fosters symbolic cells according to internal activation states. Generally, the structure mirrors a mental state where the oblivion of associated facts arrive once the stimulation decreases. As a special case, immortal mind-maps may be taken with respect to conversation streams, where the "die off" and the "forget" of a stimulated input may be disregarded but exploited. Considering two mind-maps A1,2 and B1,2 for two conversational partners A and B, then a mind-map * 1 represents the self-conversation and * 2 the conversational stream of the conversational partner. If we merge these mind-maps, we may apply the out-coming results for the computation of trust.

Current network protection systems use a collection of intelligent components -e.g. classifiers or rule-based firewall systems to detect intrusions and anomalies and to secure a network against viruses, worms, or trojans. However, these network systems rely on individuality and support an architecture with less collaborative work of the protection components. They give less administration support for maintenance, but offer a large number of individual single points of failures -an ideal situation for network attacks to succeed. In this work, we discuss the required features, the performance, and the problems of a distributed protection system called SANA. It consists of a cooperative architecture, it is motivated by the human immune system, where the components correspond to artificial immune cells that are connected for their collaborative work. SANA promises a better protection against intruders than common known protection systems through an adaptive self-management while keeping the resources efficiently by an intelligent reduction of redundant tasks. We introduce a library of several novel and common used protection components and evaluate the performance of SANA by a proof-of-concept implementation.