This paper deals with managing variability on behavioral models. Such models are generally more complex, less tractable by hand than the static, structural parts of a system description. This calls for specific support to check the consistency of variability expression model-wide: defining some elements as variable may impact several behavioral constructs, even elements that designers may not b...

Ford and Fulkerson’s original 1956 max flow/min cut paper formulated max flow in terms of flows on paths, rather than the more familiar flows on arcs. In 1974 Hoffman pointed out that Ford and Fulkerson’s original proof was quite abstract, and applied to a wide range of flow problems. In this abstract model we have capacitated elements, and linearly ordered subsets of elements called paths. Whe...

Recently, Abiteboul and Kanellakis introduced the notion of determinate query to describe database queries having the ability to create new domain elements. As there are no natural determinate-complete query languages known, more restrictive (the constructive queries) and more general (the semi-deterministic queries) notions of query were considered. Here, we show that the advantage of the seco...

Let K〈x, y〉 be the free associative algebra of rank 2 over an algebraically closed constructive field of any characteristic. We present an algorithm which decides whether or not two elements in K〈x, y〉 are equivalent under an automorphism of K〈x, y〉. A modification of our algorithm solves the problem whether or not an element in K〈x, y〉 is a semiinvariant of a nontrivial automorphism. In partic...

In the execution of bridge decks or viaducts, several construction methods are adopted. In this Thesis the construction methods most frequently applied in bridge decks using precast beams are presented. For the considered work a 4D (3D + time) geometric model was implemented in a virtual reality environment, which simulates the construction of a deck, allowing the visualization and interaction ...

We consider the role of randomness for the decisional complexity in algebraic decision (or computation) trees, i.e. the number of comparisons ignoring all other computation. Recently Ting and Yao showed that the problem of finding the maximum of n elements has decisional complexity O(log2 n). In contrast, Rabin showed in 1972 an Ω(n) bound for the deterministic case. We point out that their tec...

Introduction: This study aimed to investigate the influence of neglect and the effect of Prism Adaptation (PA) combined with continuous Theta-Burst Transcranial Magnetic Stimulation (cTBS) on the art constructive errors of painting rehabilitation of stroke patients with neglect. Methods: Fourteen patients with neglect and art constructive errors of painting secondary to stroke were randomly as...

Considering the more frequently events (volcanic eruptions, explosions, chemical contaminations etc.) which occur in nature, villages and industrial towns, the paper presents simple solutions and mechanical devices that allow the use of aeration function within habitable places for life protection and human health. These devices were the objective of some research studies that led to the determ...