Results 251 to 260 of about 1,226,857 (290)
Some of the next articles are maybe not open access.
Fault trees and sequence dependencies
Annual Proceedings on Reliability and Maintainability Symposium, 2002One of the frequency cited shortcomings of fault-tree models, their inability to model so-called sequence dependencies, is discussed. Several sources of such sequence dependencies are discussed, and new fault-tree gates to capture this behavior are defined.
J.B. Dugan, S.J. Bavuso, M.A. Boyd
openaire +1 more source
Sequences Characterizing k-Trees
2006A non-decreasing sequence of n integers is the degree sequence of a 1-tree (i.e., an ordinary tree) on n vertices if and only if there are least two 1’s in the sequence, and the sum of the elements is 2(n–1). We generalize this result in the following ways.
Lotker, Z. +3 more
openaire +2 more sources
Encoding Trees by Linear Recurrence Sequences
Cybernetics and Systems Analysis, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Disjoint Representation of Tree Realizable Sequences
SIAM Journal on Applied Mathematics, 1974A necessary and sufficient condition is obtained for the edge disjoint tree realization of two degree sequences each of which is tree realizable. The condition is that the sum sequence be graphical.
openaire +2 more sources
An evolutionary tree for invertebrate globin sequences
Journal of Molecular Evolution, 1988A phylogenetic tree was constructed from 245 globin amino acid sequences. Of the six plant globins, five represented the Leguminosae and one the Ulmaceae. Among the invertebrate sequences, 7 represented the phylum Annelida, 13 represented Insecta and Crustacea of the phylum Arthropoda, and 6 represented the phylum Mollusca. Of the vertebrate globins, 4
M, Goodman +8 more
openaire +2 more sources
Test Sequence Generation from Classification Trees
2012 IEEE Fifth International Conference on Software Testing, Verification and Validation, 2012The combinatorial test design and combinatorial interaction testing are well studied topics. For the generation of dynamic test sequences from a formal specification of combinatorial problems, there has not been much work yet. The classification tree method implements aspects from the field of combinatorial testing.
Peter M. Kruse, Joachim Wegener
openaire +1 more source
Maximum trees of finite sequences
Applied Mathematics, 1995Assume that \(s_1,\dots, s_n\) are natural numbers. There are at most \(n+ \sum s_i\) sequences \((a_1,\dots, a_n)\) with \(0\leq a_i\leq s_i\) such that if \((a_1,\dots, a_n)\), \((b_1,\dots, b_n)\) are two of them then either \(a_i\leq b_i\) holds for every \(i\), or vice versa, or \(a_i b_i= 0\) holds for every \(i\).
openaire +1 more source
Loopless generation of k-ary tree sequences
Information Processing Letters, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Sequence Algebra, Sequence Decision Diagrams and Dynamic Fault Trees
Reliability Engineering & System Safety, 2011Abstract A large attention has been focused on the Dynamic Fault Trees in the past few years. By adding new gates to static (regular) Fault Trees, Dynamic Fault Trees aim to take into account dependencies among events. Merle et al. proposed recently an algebraic framework to give a formal interpretation to these gates.
openaire +1 more source
Animals, Trees and Renewal Sequences
IMA Journal of Applied Mathematics, 1981Rands, B. M. I., Welsh, D. J. A.
openaire +1 more source