Search

We have performed glottic closure as a surgical procedure for 35 patients (30 men, 5 women) who had suffered from recurrent aspiration pneumonia since 1985 to 1997. The diseases which caused their aspiration included cerebrovascular disease, degenerative disease, cerebral tumor, ischemic heart disease, myocarditis, tumor of the head and neck region, pulmonary emphysema, tuberculosis etc.Of these 35 cases, 33 patients underwent the glottic closure initially, and 29 cases of the 33 were successful. In the remaining 4 cases, a leakage of saliva was detected after the operation. 3 of these 4 cases then underwent a total laryngectomy, and the last patient had a second glottic closure operation. Two of the 35 cases underwent epiglottic closure, but in both of these cases saliva leakage was detected. One patient underwent a total laryngectomy after all, and another had the glottic closure operation. Both follow-up operations were successful.In all patients, the pneumonia was improved. 29 patients were discharged. 5 patients died in hospital, and 1 is still in hospital.As a glottic closure operation, Montgomery method is widely used. In this method, the laminae of the thyroid cartilage are perforated and sutured with the opposite arytenoid cartilages, and the vocal cords are sutured to each other. However, we use a “simplified” Montgomery method, in which the laminae of the thyroid cartilage are not perforated, and both arytenoid cartilages, the vocal cords and the false cords are sutured to each other. We have achieved good results with this procedure.

Five cases of perilymph fistula (PLF) were classified into two groups: three cases of PLF identified surgically (confirmed group), and two cases treated conservatively (uncertain group). The recovery of hearing and the outcome of nystagmus between the groups were compared. In both groups, the improvement of hearing in the low-middle tone range was good, but that in the high tone range was poor. In the confirmed group, spontaneous and positional nystagmus decreased or diminished soon after the closure operation of PLF. On the other hand, in the uncertain group, both types of nystagmus continued for long periods. We considerd that some inner ear damage remained in this group. Furthermore, PLF was indicated if spontaneous or positional nystagmus persisted for long periods without vertigo in idiopathic sudden hearing loss or Meniere's disease.

For each ordinal α < 1 we define a Galois correspondence between the category of closure spaces (i.e. sets endowed with an extensive and monotone closure operation taking value θ at θ) and the category of α-ary mono-relational systems. These correspondences are studied.

Nous etudions l'operation qui consiste a fermer (analytiquement) la partie localement libre d'un espace lineaire complexe. Plus generalement nous demontrons: soit un cone analytique π: X S defini par une O S -algebre graduee A et soit A un sous-ensemble analytique de S. Alors la fermeture du sous-cone ouvert X \π -1 (A) dans X est un cone analytique sur la fermeture de S \ A dans S et il est defini par l'algebre graduee A/H 0 A A Dans le cas ou S est reduit, A est d'interieur vide dans S et A est sans torsion sur S \ A; on a A/H 0 A A = A/T(A) ou T(A) designe l'ideal gradue des elements de torsion dans A. Nous etablissons des relations entre les elements de torsion et les elements nilpotents d'une algebre symetrique d'un faisceau analytique coherent. En appliquant nos resultats aux espaces tangents globaux de Zariski, nous obtenons, pour S reduit et localement intersection complete, une condition necessaire et suffisante en termes de dimensions pour que le cone de Whitney C 4 (S) soit la reduction de l'espace tangent global de Zariski, et deux criteres de regularite pour des courbes analytiques. Finalement, il y a des applications aux notions de positivite (amplitude).

To overcome the shortcomings of medium and small logistics companies, such as narrow coverage of transport network and service with single form, a way of setting up the logistics alliance was proposed. For the problem of choosing the transshipment company and logistics route in cooperative transportation, the bidirectional search algorithm of available logistics route based on site closure is designed and realized. The concept of site closure is introduced to compute all directly reachable sites. Both on origin site and destination site, the closure operation is made one by one to obtain available routes. The experimental result indicates that transshipment company routes and site routes are in conformity with reality by this algorithm, which not only enhances the search efficiency of logistics routes but also can obtain available logistics routes and has better practical application value.

Seventy surgical cases of ventral incisional hernia performed in our department during the past 15 years were examined regarding background factor, primary disease for the previous operation, location of hernia, subjective symptoms lapse of time before onset of symptoms, and operation procedure. In addition preoperative complications (cure prolonging factor) and postoperative course were studied in 24 cases which were previously operated on at the department. Incisional hernia tended to be frequent in female patients after receiving emergency operations for benign conditions. Most cases occurred within one year after the previous surgery. An important determinant of the hernia was preoperative complications at the previous operation, which occurred in 75.0% of the cases. A relationship between hernia and postoperative complications of the previous operation such as wound infection and wound dehiscence was also suggested. Simple layer-to-layer closure operation had a hernia recurrence rate of 10%. Artificial fascia prosthetic operation, with a recurrence rate of 3.0%, is considered a useful surgical treatment method for large hernias and recurring cases.

We consider a variety of commutative operator semigroups, that is, of algebras with a unary operation and a binary commutative and associative operation. Asubpartition of a set is a partition of a subset of the set. For each integern>0, we represent the subpartitions on ann-element set asn-ary terms in the variety. We determine necessary and sufficient conditions on the variety ensuring that there be no constant terms and, for eachn>0, that these representing terms be all the essentiallyn-ary terms and moreover that distinct subpartitions yield distinct terms. We show that there is precisely one such variety of commutative operator semigroups.

A closure operation connected with Hall subgroups is introduced for classes of finite soluble groups, and it is shown that this operation can be used to give a criterion for membership of certain special Fitting classes, including the so-called ‘central-socle’ classes.

The family of functional dependencies (FDs) was introduced by E. F. Codd. Equivalent descriptions of family of FDs play essential roles in the design and implementation of the relational datamodel. It is known [1–10] that closure operations, meet-semilattices, families of members which are not intersections of two other members, give the equivalent descriptions of family of FDs, i.e., they and family of FDs determine each other uniquely. These equivalent descriptions were successfully applied to find many desirable properties of functional dependency. This paper introduces the concept of maximal family of attributes. We prove that this family is an equivalent description of family of FDs. The concept of nonredundant family of attributes is also introduced in this paper. We present some characterizations and desirable properties of these families. We prove that given a relation scheme, the time complexities of problems of finding nonredundant and maximal families of attributes are exponential in the number of attributes. However, this paper shows that if a relation scheme is changed to a relation then these problems are solved by polynomial time algorithms.

Perfect phylogeny consisting of determining the compatibility of a set of characters is known to be NP-complete [4,28]. We propose in this article a conjecture on the necessary and sufficient conditions of compatibility: Given a set C of r-states full characters, there exists a function f(r) such that C is compatible iff every set of f(r) characters of C is compatible. According to [7,9,8,25,11,23], f(2) = 2, f(3) = 3 and f(r) ≥ r. [23] conjectured that f(r) = r for any r ≥ 2. In this paper, we present an example showing that f(4) ≥ 5. Therefore it could be the case that for r ≥ 4 characters the problem behavior drastically changes. In a second part, we propose a closure operation for chordal sandwich graphs. The later problem is a common approach of perfect phylogeny.

For arbitrary complete atomistic ortholatticesL the*-semigroup is explicitly built whose annihilator ortholattice is isomorphic toL. The elements of this*-semigroup are represented by binary relations on the set of atoms ofL.

The rudiments of the theory of Galois connections (or residuation theory, as it is sometimes called) are provided, together with many examples and applications. Galois connections occur in profusion and are well known to most mathematicians who deal with order theory; they seem to be less known to topologists. However, because of their ubiquity and simplicity, they (like equivalence relations) can be used as an effective research tool throughout mathematics and related areas. If one recognizes that a Galois connection is involved in a phenomenon that may be relatively complex, then many aspects of that phenomenon immediately become clear, and thus, the whole situation typically becomes much easier to understand.

In this note we present some remarks on big Cohen-Macaulay algebras. Our methods for doing this are inspired by the notion of dagger closure and by ideas of Northcott on dropping of the Noetherian assumption of certain homological properties., to appear in Journal of Algebra and Its Applications

Using relation algebra, we generalize Aumann's notion of a contact relation and that of a closure operation from powersets to general membership relations and their induced partial orders. We also investigate the relationship between contacts and closures in this general setting and use contacts to establish a one-to-one correspondence between the column space and the row space of a relation.

Let R be a Dedekind domain whose residue fields are finite, and let K be the field of fractions of R. When S is a (non-empty) subset of K we write F (S) for the subring of K[x] consisting of all polynomials f(x) in K[x] such that f(S) ⊂ R. In a recent paper R. Gilmer (J. Number Theory, 33, 1989, 95–100) characterized those sets S with the property that F (S) = F (R) (see Theorem 3 of this paper). In this note we use results of the author proved in J. Reine Angew. Math., 358, 1985, 162–178, and a closure operation on sets, similar to the closure in the Zariski topology, to decide when F (S1) = F (S2) for arbitrary sets S1 and S2; in particular we recover Gilmer's theorem.

A locally presentable category 6 is the category of models of some theory F which can be described using a-limits, for a regular cardinal a. Our aim is to find conditions which ensure good properties of the category d of models: when is 6 Cartesian closed? When is d a quasi-topos? When is d a topos? and so on. In this paper, we focus our attention on some semantic conditions. A locally a-presentable category 8 can thus be presented as the category of cc-left exact presheaves on a small category $9 with a-colimits. Clearly, each subpresheaf S of an E-left exact presheaf F has an a-left exact closure SC F. This closure operation plays a key role in the theory of a-left exact functors and we study, first, conditions on dz~Lex(%?) which ensure the universality of that closure operation. We prove this universality to be equivalent to the universality of strongly epimorphic families in &, but also to the fact that a-Lex(%‘) is an epireflective subcategory of a Grothendieck topos. This Grothendieck topos will play an important role in the rest of the paper; its construction depends heavily on the fact that, under our assumptions, a-left exact subpresheaves are stable under arbitrary intersections, from the point of view of the internal logic of the topos 4 of presheaves. Among the epireflective subcategories of a Grothendieck topos, we find the categories of separated objects for a given topology in this topos. These

The U.S. Environmental Protection Agency Mobile Incineration System, which was operated at the Denney Farm site in southwestern Missouri between October 1985 and June 1989, treated almost six million kilograms of dioxin-contaminated wastes from eight area sites. At the conclusion of operations, the site soils, equipment, and buildings were decontaminated following approved closure plans. The closure operation and closure certification process are described in this paper.

We investigate the problem of encoding arbitrary data into the words of a DNA language that is defined via the subword closure operation, which appears to be useful in various situations related to data encodings. We present a few theoretical results on the subword closure operation as well as an initial implementation of a web-system that computes DNA languages according to the user's parameters, and performs encodings of data into these languages.

Progress properties of programs are often expressed using the operator leads-to , a binary relation over predicates on the program state. Informally, p leads-to q means that from a state satisfying p a state satisfying q is reached eventually. We investigate the notion of the weakest predicate that leads-to q , for some given q . We formalize this notion by defining the predicate transformer wlt as a certain closure operation, and show that wlt maps a predicate q to the weakest predicate that leads-to q . We also demonstrate that wlt and leads-to are equivalent in expressive power by showing that each can be defined in terms of the other. The advantages of basing concurrent program semantics on the predicate transformer wlt rather than the relation leads-to are similar to those of basing sequential program semantics on the predicate transformer wp rather than on the relation of Hoare-Triples { p } S { q }. We investigate the junctivity properties of wlt . It turns out that wlt is strict and monotonic, but not or -continuous and neither finitely conjunctive nor finitely disjunctive.

Let S be a Steinitz Exchange System with closure operation cl. We examine the logical complexity of the first-order theory of the lattice of cl-closed subsets of S. We show that in many cases the first-order theory of the lattice has the complexity of full second-order logic on S. The strongest results are in the special case where S is an algebraically closed field and cl is algebraic closure in S

Background: The wall of patent ductus arteriosus (PDA) in adults is usually fragile and may be associated with calcification. Method: We present a 43-year-old female patient who underwent successful ductal closure operation under cardiopulmonary bypass (CPB) via a transpulmonary route. Results: The operation was uneventful and the patient was discharged from the hospital on the 4th postoperative day. Conclusion: Transpulmonary route for the closure of the PDA by using CPB is a safe and acceptable approach in adult patients.

In this paper we concern an abstract model of self‐organizing process called local cellular automata (LCA) proposed by us recently. The circular organization of living systems is addressed. A consistent circularity is defined by a closure operation on complete lattice. An inconsistent circularity is defined by a quasi‐closure called weak closure implied by an internal perspective. Each cell in a LCA receives data about the time developments of its neighbors at one step before. It constructs a (in general incomplete) look‐up table by taking closure (or weak closure) of the received data on an appropriate lattice. It applies obtained rule to its own present state and changes the state. In the former half of the paper, the theory which is the basis for LCA based on set lattice is reformulated in terms of complete lattice. In the latter half, we restrict cells’ information receiving ability and define restricted local cellular automata (RLCA). The space‐time patterns of RLCA are estimated by the variance of i...

Background and aims To explore the application effect of the intestinal lumen catheter external drainage for the surgical treatment of neonatal necrotizing enterocolitis (NEC). Methods From January 2008 to January 2014, 22 children with NEC which need the surgical treatment and have too extensive lesions to be decided the resection range were treated by intestinal lumen catheter external drainage and traditional operation in the First Hospital of Jilin University. These patients were divided into 2 groups. In group A, from January 2008 to April 2011, 10 patients were operated by traditional operation--- the first phase enterostomy or intestinal exteriorization, and after 24 h, redetermine the resection range, after 2–3 months, the closure operation will be executed. In group B, from May 2011 to January 2014, 12 patients were treated by catheter drainage --- the first phase operation of intestinal lumen catheter external drainage, after 7–10 days, according to the bowel condition, enteroenterostomy or enterostomy will be executed, then after 2–3 months, the closure operation will be performed. The first phase operative time and the postoperative survival rate will be compared between two groups. Results Age and weight were not different between two groups. The operative time in group A was longer than that in group B [(65 ± 18 vs. 42 ± 13)min] (p Conclusions Compared with traditional operation, the intestinal lumen catheter external drainage have the advantages of shorter operative time and higher postoperative survival rate.

A fundamental problem in biological classification is the reconstruction of phylogenetic trees for a set X of species from a collection of either subtrees or qualitative characters. This task is equivalent to tree reconstruction from a set of partial X-splits (bipartitions of subsets of X). In this paper, we define and analyse a "closure" operation for partial X-splits that was informally proposed by Meacham [5]. In particular, we establish a sufficient condition for such an operation to reconstruct a tree when there is essentially only one tree that displays the partial X-splits. This result exploits a recent combinatorial result from [2].

This paper presents an algorithm for polymorphic type inference involving the let construct of ML in the context of higher order abstract syntax. It avoids the polymorphic closure operation of the algorithm W of Damas and Milner by using a uniform treatment of type variables at the meta-level. The basic technique of the algorithm facilitates the declarative formulation of type inference as goal-directed proof-search in a logical frameworks setting.

The intent of this paper is to present a set of axioms that are sufficient for a closure operation to generate a balanced big Cohen-Macaulay module B over a complete local domain R. Conversely, we show that if such a B exists over R, then there exists a closure operation that satisfies the given axioms., 14 pages

We use lengthening and an enhanced version of the Gilbert-Varshamov lower bound for linear codes to construct a large number of record-breaking codes. Our main theorem may be seen as a closure operation on databases.

The closing of tidal basins generally serves a combination of various purposes, such as land reclamation, protection against floods, creation of fresh-water reservoirs, etc. Closure works in tidal areas will change the tidal conditions on the sea side of the closure, while desalination will be the main problem in the enclosed area. A comparison between some closure methods is given. A distinction is made between sudden and gradual closure methods, the latter being subdivided into vertical, horizontal and combined methods. Some attention is paid also to the seabed protection, which is needed in order to reduce the risk of instability of the closure dam during construction. As an illustration of a large-scale closure operation, a case study has been worked out briefly. From a comparison between a vertical and a combined horizontal and vertical closure method, the latter appears to be less appropriate in the case of large-scale closure works.

We define a closure operation on semigroups of matrices over a skew field, and show that a semigroup of matrices can be (upper) triangularized if and only if its closure can be. We then give necessary and sufficient conditions for a closed semigroup to be triangularizable.

In this paper, an alternative closure operation to the one introduced in [2] is given. For any vertex x of a 2-connected graph G = (V,E), let N(x) be the set of vertices of V adjacent to x and d(x) be the degree of x in G. Let T = {xϵV:a,bϵN(x))} be a set of vertices associated with 2 nonadjacent vertices a,b and let α ab = 2 + ¦T¦ and δ ab = min a i ϵT d(a i ) . We prove that if G is 2-connected and a,b are two nonadjacent vertices such that α ab ⩽δ ab , the G is hamiltonian if and and only if G+ab is hamiltonian. Condition α ab ⩽δ ab is a simpler version of the main result of this paper.

The whole face G ( φ ) G\left ( \varphi \right ) of m m -planes calibrated by a torus m m -form φ \varphi is determined by the torus face G T ( φ ) {G_T}\left ( \varphi \right ) . Indeed, G ( φ ) G\left ( \varphi \right ) results from applying a new closure operation to G T ( φ ) {G_T}\left ( \varphi \right ) .

Roughly speaking a suitable theory is a theory T together with its formal provability predicate Prv (.). A pseudo-topological space is a boolean algebra B which carries a derivative operation d and its associated closure operation c. Thus we can pretend that B is a topological space. We show that the Lindenbaum algebra B(T) of a suitable theory becomes, in a natural way, a pseudotopological space, and hence we can translate properties of T into topological language, as properties of B(T). We do this translation for several properties of T, including (1) satisfying Gödel's first theorem, (2) satisfying Löb's theorem and (3) asserting one's own inconsistency. These correspond to the topological properties (1) having an isolated point, (2) being scattered, (3) being discrete.

• A glottic closure procedure rather than laryngectomy is suggested for patients with loss of laryngeal sphincter function. The operation allows restoration of respiration and swallowing without aspiration, but sacrifices phonatory function. No patient has had sufficient recovery of laryngeal sphincteric function to warrant an attempt to reverse the laryngeal closure operation. ( Arch Otolaryngol 101:679-682, 1975)

We exhibit a closure operation which serves to define saturated formations of finite soluble groups.

Two characterizations of transductions defined by abstract families of transducers are presented. The first characterization is in terms of languages defined by acceptors derived from the transducers when the output structure is removed. The second characterization is in terms of sets of pairs of words satisfying certain closure operations.

A new surgical technic for treatment of pilonidal sinuses is presented and results of its use in 110 patients are evaluated. This excisional technic with partial closure (midway between an open operation and a primary closure) compared favorably with the marsupialization operation in healing time, in lack of morbidity, and in low recurrence rate. The technical steps in the procedure are outlined. The operation is particularly indicated where the tracts are small, tortuous or ill-defined.

Subrecursive degrees are partitions of computable (recursive) functions generated by strong reducibility orderings. Such reducibilities can be naturally characterized in terms of closure operations. Closure operations corresponding to standard reducibilities such as ''primitive recursive,'' etc., are computation time closed. It is shown that if the closure operation defining a strong reducibility satisfies certain axioms, then the partial ordering of the subrecursive degrees contains dense chains.

The long-term results of the closure operation of atrial septal defect were followed up on 59 patients. The majority of the cases had excellent results, but 17% of them had some complaint or could not gain clear-cut improvement. Three factors are important to have excellent results : (1) perfect closure of the defect, (2) repair of other possible coexsistent abnormalities, and (3) operation in early age, preferably under twenty years of age. The long-term results of shunt-operation were studied on 78 cases of Fallot's tetralogy. About 80% of these cases had excellent or good results. However 20% of them had no change or lost improvement. The causes of loss of improvement were commented. Among the age group under 5 years, there are many cases who showed loss of improvement, while excellent results are rarely seen among the patients over 15 years of age. Four cases were treated by Brock's method and the other four patiente received the corrective operations by direct vision. Of these cases the results were followed up and discussed.

Let a be a column of the m x n matrix M and A a set of its columns. We say that A implies a iff M contains no two rows equal in A but different in a. It is easy to see that if @?"M(A) denotes the columns implied by A, than @?"M(A) is a closure operation. We say that M represents this closure operation. s() is the minimum number of the rows of the matrices representing a given closure operation. s(@?) is determined for some particular closure operations.

It is well known that nice conditions on the canonical module of a ring have a strong impact in the study of strong F-regularity and F-purity. For example, in the Gorenstein (or even Q -Gorenstein) case strong F-regularity is equivalent to weak F-regularity, and it is conjectured that this is true in general. In this note, we will show how to use the double cover of a ring to obtain sufficient conditions for strong F-regularity and F-purity. Our results involve a closure operation for a pair of ideals that could be of relevance for the conjecture mentioned above.

In this paper we introduce the definite closure operation for max-plus matrices with finite permanent, reveal inner structures of definite eigenspaces, and establish some facts about Hilbert distances between these inner structures and the boundary of the definite eigenspace, 20 pages,6 figures, v2: minor changes in figures and in the main text

Let b be a column of an m×n matrix M and A a set of its columns. We say that A implies b if and only if M contains no two rows equal in A but different in b. If L M(A) denotes the set of columns implied by A, then L M(A) is a closure operation and we say that M represents this closure operation. Let s( L ) denote the minimum number of rows of the matrices representing a given closure operation L . The k-uniform closure operation on an n-element groundset X is defined by L k n (A)= X, if |A|≥k, A, if |A| . It is known that the closure operation L n k can be represent by some matrix, that is, there is an m×n matrix M such that L M = L n k . In this paper we shall verify two conjectures of Demetrovics et al. with regards to the determination of s( L n 3 ) . In particular, we prove that s( L n 3 )=n for all n ≥ 7, with the possible exception of n = 8.

In his Canberra lectures on finite soluble groups, [3], Gaschütz observed that a Schunck class (sometimes called a saturated homomorph) is {Q, Eφ, D0}-closed but not necessarily R0closed(*). In Problem 7·8 of the notes he then asks whether every {Q, Eφ, D0}-closed class is a Schunck class. We show below with an example † that this is not the case, and then we construct a closure operation R0 satisfying Do < ro < Ro such that is a Schunck class if and only if = {QEφ, Ro}. In what follows the class of finite soluble groups is universal. Let B denote the class of primitive groups. We recall that a Schunck class is one which satisfies: (a) = Q, and (b) contains all groups G such that Q(G) ∩ B ⊆.