Microvascular free tissue transfer (FTT) is an increasingly used method of reconstruction for traumatic defects of the head and neck. We describe the immediate management, FTT reconstruction techniques, and outcomes of 6 individuals who sustained maxillofacial gunshot trauma and were treated at a single tertiary-care level I trauma center. All 6 patients were white men with a mean age of 33 yea...

Children with ventricular septal defect (VSD) often demonstrate failure to thrive (FTT). Such patients usually have reduced systemic cardiac output which has been postulated as a cause for their growth retardation. This study was conducted to ascertain the mechanism of the reduced cardiac output in children with VSD and FTT and also in a porcine model of VSD. Forward stroke volume was reduced i...

Failure to thrive (FTT) is a term generally used to describe an infant or child whose current weight or rate of weight gains is significantly below that expected of similar children of the same age, sex and ethnicity. It usually describes infants in whom linear growth and head circumference are either not affected, or are affected to a lesser degree than weight. FTT is a common problem, usually...

Traditional distributed embedded systems are configured using static environment information and thus do not support dynamic behavior of the system. The necessary flexibility in the system may be provided by the Flexible Time-Triggered (FTT) communication paradigm. If, in addition, it is required that the system operates continuously, the suitable fault tolerance mechanisms that provide high re...

Let us say that a relation r is symmetric iff whenever x bears r to y, y bears r to x; otherwise, r is non-symmetric. In this paper, I will argue for the thesis that necessarily, there are no non-symmetric relations. What is this predicate ‘. . . bears . . . to . . . ’ in terms of which ‘symmetric’ was defined? According to one important theory of relations, this predicate is primitive, in the ...

We study theory revision and composition in the context of OLPFOL logic. In this logic, the representation of knowledge is split into two parts: writing definitions for completely known concepts (OLP part), and writing constraints and expressing partial knowledge on other concepts (FOL part). In a previous work, the composition of two OLP-FOL theories with nonintersecting sets of defined predic...

This paper presents two frameworks that generalize Conditional Preference networks (CP-nets). The first generalization is the LCP-theory, first order logic theory that provides a rich framework to express preferences. The the second generalization, the PCP-networks, is a probabilistic generalization of CP-nets that models conditional preferences with uncertainty.

We prove that the first-order theory of the Medvedev degrees, the first-order theory of the Muchnik degrees, and the third-order theory of true arithmetic are pairwise recursively isomorphic (obtained independently by Lewis, Nies, and Sorbi [7]). We then restrict our attention to the degrees of closed sets and prove that the following theories are pairwise recursively isomorphic: the first-orde...

Lascar in [4] introduced the group Autf(N/A) of strong automorphisms over A, a normal subgroup of the group Aut(N/A) of all automorphisms overA of a modelN containingA. The quotient Aut(N/A)/Autf(N/A) is independent of the choice of N (for a big saturated model N and a small subset A ⊆ N ) and it is now called the Lascar group over A. Lascar showed in [4] that in the case of a very large class ...

This paper presents an encoding of a non-temporal fragment of the TLA language, which includes untyped set theory, functions, arithmetic expressions, and Hilbert’s ε operator, into many-sorted firstorder logic, the input language of state-of-the-art smt solvers. This translation, based on encoding techniques such as boolification, injection of unsorted expressions into sorted languages, term re...