a {em roman dominating function} on a graph $g$ is a function$f:v(g)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}a {em restrained roman dominating}function} $f$ is a {color{blue} roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} the wei...

Die Beschreibung einer Methodik zur Analyse der Industrietauglichkeit evolutionärer Algorithmen steht im Mittelpunkt dieses Beitrags. Dazu werden moderne statistische Verfahren wie “Design and Analysis of Computer Experiments” mit klassischen Verfahren der experimentellen Versuchsplanung (Design of Experiments) kombiniert. Diese Methoden eignen sich sehr gut, um den experimentellen Vergleich ve...

l’apparition de la révolution industrielle et de la technicité dans le roman français survient vers le milieu du xixe siècle, en pleine émergence de ce courant qui influence la vie et le travail de la population. le processus d’industrialisation débute par l’exode massif des paysans vers les villes industrielles nouvelles. tandis que la bourgeoisie profite pleinement de l’essor industriel, le p...

Dans le troisième volume de la Ransom Trilogy, publié en 1945, C.S. Lewis est inspiré par motif tour Babel. Le titre même, That Hideous Strength, renvoie à un poème David Lindsay y faisant référence. reprend dans cette œuvre, qualifiée lui « conte fées moderne pour adultes », thème soif éperdue pouvoir. Il choisit nom, Belbury, dont première syllabe évoque lieu dispersion biblique, et des perso...

a {em roman dominating function} on a graph $g = (v ,e)$ is a function $f : vlongrightarrow {0, 1, 2}$ satisfying the condition that every vertex $v$ for which $f (v) = 0$ is adjacent to at least one vertex $u$ for which $f (u) = 2$. the {em weight} of a roman dominating function is the value $w(f)=sum_{vin v}f(v)$. the roman domination number of a graph $g$, denoted by $gamma_r(g)$, equals the...

We present a survey of con uence properties of (acyclic) term graph rewriting. Results and counterexamples are given for di erent kinds of term graph rewriting: besides plain applications of rewrite rules, extensions with the operations of collapsing and copying, and with both operations together are considered. Collapsing and copying together constitute bisimilarity of term graphs. We establis...

The adoption of Model-Driven Development (MDD) is increasing and it is widely recognized as an important approach for building software systems. In addition to traditional development process models, an MDD process requires the selection of metamodels and mapping rules for the generation of the transformation chain which produces models and application code. However, existing support tools and ...