The binary operation multint on Z is defined as follows: (Def. 1) For all elements a, b of Z holds (multint)(a, b) = ·R(a, b). The unary operation compint on Z is defined as follows: (Def. 2) For every element a of Z holds (compint)(a) = −R(a). The double loop structure INT.Ring is defined by: (Def. 3) INT.Ring = 〈Z, +Z,multint, 1(∈ Z), 0(∈ Z)〉. Let us mention that INT.Ring is strict and non em...

Let I1 be a relation structure. We say that I1 is discrete if and only if: (Def. 1) The internal relation of I1 = △the carrier of I1. Let us mention that there exists a poset which is strict discrete and non empty and there exists a poset which is strict discrete and empty. Let X be a set. Then △X is an order in X. Observe that 〈∅,△∅〉 is empty. Let P be an empty relation structure. One can chec...

Sensor nodes may be easily compromised and seized by adversaries, because they are disseminated in hostile environments. Adversaries may try various security attacks on sensor networks using compromised nodes. False data injection attacks using nodes may cause false alarms, and severe energy waste. The dynamic en-route filtering scheme (DEF) can detect and drop false data during the forwarding ...

We propose an architecture for generating natural language from Linked Data that automatically learns sentence templates and statistical document planning from parallel RDF datasets and text. We have built a proof-of-concept system (LOD-DEF) trained on un-annotated text from the Simple English Wikipedia and RDF triples from DBpedia, focusing exclusively on factual, non-temporal information. The...

RESUMO No Brasil várias estruturas de concreto tem se mostrado deterioradas precocemente em decorrência da formação tardia etringita (DEF). Ainda existem muitas lacunas e, especial, no que diz respeito ao comportamento materiais cimentícios suplementares e sua eficácia combate das expansões por DEF. O acompanhamento controle obra vezes trazem preocupação futura, pós lançamento dos concretos, ha...

The domain of deenite Boolean functions, Def , can be used to express the groundness of, and trace grounding dependencies between, program variables in (constraint) logic programs. In this paper, previously unexploited computational properties of Def are utilised to develop an eecient and succinct groundness analyser that can be coded in Prolog. In particular, entailment checking is used to pre...

The non empty set the set of complex sequences is defined by: (Def. 1) For every set x holds x ∈ the set of complex sequences iff x is a complex sequence. Let z be a set. Let us assume that z ∈ the set of complex sequences. The functor idseq(z) yields a complex sequence and is defined by: (Def. 2) idseq(z) = z. Let z be a set. Let us assume that z ∈ C. The functor idC(z) yielding a Complex is d...

Let G be a finite simple graph having a maximum matching M. The deficiency def(G) of G is the number of M-unsaturated vertices in G. In an earlier paper we determined an upper bound for def(G) when G is regular and connected. This upper bound is in general not sharp when G is triangle free. In this paper we study the case when G is triangle free and r-regular. We present an upper bound for defC...

The objective of this paper is to present a tool supporting dataflow coverage testing of Java programs. Code based (”white box”) approach to testing can be divided into two main types: control flow coverage and data flow coverage methods. Dataflow testing was introduced for structural programming languages and later adopted for object languages. Among many tools supporting code based testing of...

BACKGROUND gcrR gene acts as a negative regulator related to sucrose-dependent adherence in S. mutans. It is constructive to test the potential capacity of mutans with gcrR gene deficient in bacteria replacement therapy. METHODS In this study, we constructed the mutant by homologous recombination. The morphological characteristics of biofilms were analyzed by confocal laser scanning microscop...