Software testing is an expensive component of software development and maintenance. For data flow testing, test cases must be found t o test the def-use pairs in a program. Since some o f the def-use pairs identified through static analysis may be infeasible, no amount of testing effort may result in exhaustive testing of a program. Therefore in practice a fixed amount of effort is spent in tes...

Let us mention that every non empty relational structure which is trivial and reflexive is also complete. Let T be a relational structure. A type of T is an element of T . Let T be a relational structure. We say that T is Noetherian if and only if: (Def. 1) The internal relation of T is reversely well founded. Let us observe that every non empty relational structure which is trivial is also Noe...

(Def. 1) CastNatx = { x, if x is a natural number, 0, otherwise. Let W1 be a set. A sequence of W1 is a function from N into W1. For simplicity, we adopt the following rules: k, n denote natural numbers, a denotes a set, D, S denote non empty sets, and p, q denote finite sequences of elements of N. Let us consider n. The functor atom. n yielding a finite sequence of elements of N is defined as ...

(Def. 1) CastNatx = { x, if x is a natural number, 0, otherwise. Let W1 be a set. A sequence of W1 is a function from N into W1. For simplicity, we use the following convention: k, n denote natural numbers, a denotes a set, D, S denote non empty sets, and p, q denote finite sequences of elements of N. Let us consider n. The functor atom. n yields a finite sequence of elements of N and is define...

• list(A) is the set of all lists having their elements in A • nil is the empty list • a :: q is the list starting with an element a and continuing with the tail list q • q − is the append (list concatenation) operator: for any list l, we have nil q −l def. l and (a :: q) q −l def. a :: (q q −l). • lterf (l) is the lter operator, recursively de ned as follows: lterf ( ) = and lterf (a :: q) = {...

BACKGROUND AND AIMS DEFICIENS (DEF)- and GLOBOSA (GLO)-like proteins constitute two sister clades of floral homeotic transcription factors that were already present in the most recent common ancestor (MRCA) of extant angiosperms. Together they specify the identity of petals and stamens in flowering plants. In core eudicots, DEF- and GLO-like proteins are functional in the cell only as heterodim...

APETALA3 (AP3)/DEFICIENS (DEF) is a MADS-box transcription factor that is involved in establishing the identity of petal and stamen floral organs. The AP3/DEF gene lineage has been extensively examined throughout the angiosperms in order to better understand its role in floral diversity and evolution. As a result, a large number of cloned AP3/DEF orthologues are available, which can be used for...

DEFICIENS (DEF) and GLOBOSA (GLO) function in petal and stamen organ identity in Antirrhinum and are orthologs of APETALA3 and PISTILLATA in Arabidopsis. These genes are known as B-function genes for their role in the ABC genetic model of floral organ identity. Phylogenetic analyses show that DEF and GLO are closely related paralogs, having originated from a gene duplication event after the sep...

In this paper, we propose the least-squares method for computing the positive solution of a $mtimes n$ fully fuzzy linear system (FFLS) of equations, where $m > n$, based on Kaffman's arithmetic operations on fuzzy numbers that introduced in [18]. First, we consider all elements of coefficient matrix are non-negative or non-positive. Also, we obtain 1-cut of the fuzzy number vector solution of ...

Numerical simulations of re-entrant waves in detailed ionic models reveal a phenomenon that is impossible in traditional simplified mathematical models of FitzHugh-Nagumo type: dissipation of the excitation front (DEF). We have analysed the structure of three selected ionic models, identified the small parameters that appear in non-standard ways, and developed an asymptotic approach based on th...