The theoretical background for abstract formalization of the vague phenomenon of complex systems is the fuzzy set theory. In the paper, vague data is defined as specialized fuzzy sets fuzzy numbers and a fuzzy linear regression model is described as a fuzzy function with fuzzy numbers as vague regression parameters. To identify the fuzzy coefficients of the model, the genetic algorithm is used....

This paper presents the first step of a research woric which aims at predicting the propensity of Professional Virtual Communities (PVC) to create temporary alliances of business. This work is starting from the observation that up to now these business oriented communities laclc a conceptual frameworic for analyzing this issue in a theoretical way. Our approach consists in developing such a con...

This paper proposes an overview of a study that conceptually unify the fields of virtual reality and teleoperation, by analyzing the notion of “assistance” to the operator of a virtual reality or tele-operation system. This analysis demonstrates that cases of assistance that are usually considered to belong to virtual reality are not conceptually different from what has been done in tele-operat...

In this paper, we investigate automated proof construction in classical linear logic (CLL) by giving logical foundations for the design of proof search strategies. We propose common theoretical foundations for top-down, bottom-up and mixed proof search procedures with a systematic formalization of strategies construction using the notions of immediate or chaining composition or decomposition, d...

Essence is a syntactically rich language for specifying search and optimization problems. We show how to applying descriptive complexity theory to study the expressive power of Essence, and present several results on the expressive power of fragments incorporating certain features. The same approach can be applied to a number of other constraint specification or modelling languages. We believe ...

In the study of the basic properties observed in the immune system and, in a broader view, in biological systems, several concepts have already been mathematically formulated or treated in an analytical perspective, such as degeneracy, robustness, noise, and bow tie architecture [1,2,3,4,5]. These properties, among others, seem to rule many aspects of the system functioning, and share among the...

This note is about the \calculational style" of presenting proofs introduced by Dijkstra and Scholten and adopted in some books on theoretical computer science. We deene the concept of a calculation, which is a formal counterpart of the idea of a calculational proof. The deenition is in terms of a new formalization DS of predicate logic. Any proof tree in the system DS can be represented as a s...

We discuss some methods for rigorous expressions of infinite labeled directed graphs. In these methods, every" node of a graph is identified by a string of symbols from a finite alphabet, and edges are expressed as binary relations or functions among strings. We characterize these relations with some concepts in the theory of formal languages and automata, and from this characterization, we obt...

This paper continues study, both theoretical and empirical, of the method of Venn prediction, concentrating on binary prediction problems. Venn predictors produce probability-type predictions for the labels of test objects which are guaranteed to be well calibrated under the standard assumption that the observations are generated independently from the same distribution. We give a simple formal...

We present an executable formalization of the language Promela, the description language for models of the model checker SPIN. This formalization is part of the work for a completely verified model checker (CAVA), but also serves as a useful (and executable!) description of the semantics of the language itself, something that is currently missing. The formalization uses three steps: It takes an...