Perineurioma: an unusual cause of an external auditory canal polyp

BACKGROUND: Home parenteral nutrition (HPN) is used to treat intestinal failure. A minority of HPN patients are dependent on opiates and benzodiazepines to control pain and anxiety. The aim of this study was to determine what effects such drug dependence had on patient outcomes. METHODS: Ten dependent patients were prospectively compared with 10 well-matched, nondependent HPN patients for the same 12-month period. Episodes of line sepsis and other complications were documented and the cost of treatment estimated. Health status was measured using the SF36 and EuroQol instruments. RESULTS: The dependent group had significantly more episodes of central line sepsis (p = .0007) as well as other complications (p = .0002). This led to significantly longer periods of inpatient care (p = .0004) and therefore higher costs of treatment. Health status was lower in the dependent group; they reported more pain (p = .04) and less energy (p = .04). CONCLUSIONS: The complication rate and increased cost of treatment for opiate- and sedative-dependent patients receiving HPN significantly detract from the overall outcome of this therapy.     

Biosynthesis of the escherichia coli K4 capsule polysaccharide. A parallel system for studies of glycosyltransferases in chondroitin formation

Escherichia coli K4 bacteria synthesize a capsule polysaccharide (GalNAc-GlcA(fructose))n with the carbohydrate backbone identical to chondroitin. GlcA- and GalNAc-transferase activities from the bacterial membrane were assayed with acceptors derived from the capsule polysaccharide and radiolabeled UDP-[14C]GlcA and UDP-[3H]GalNAc, respectively. It was shown that defructosylated oligosaccharides (chondroitin) could serve as substrates for both the GlcA- and the GalNAc-transferases. The radiolabeled products were completely degraded with chondroitinase AC; the [14C]GlcA unit could be removed by beta-D-glucuronidase, and the [3H]GalNAc could be removed by beta-N-acetylhexosaminidase. A fructosylated oligosaccharide acceptor tested for GlcA-transferase activity was found to be inactive. These results indicate that the chain elongation reaction of the K4 polysaccharide proceeds in the same way as the polymerization of the chondroitin chain, by the addition of the monosaccharide units one by one to the nonreducing end of the polymer. This makes the biosynthesis of the K4 polysaccharide an interesting parallel system for studies of chondroitin sulfate biosynthesis. In the biosynthesis of capsule polysaccharides from E. coli, a similar mechanism has earlier been demonstrated for polysialic acid (NeuNAc)n (Rohr, T. E., and Troy, F. A. (1980) J. Biol. Chem. 255, 2332-2342) and for the K5 polysaccharide (GlcAbeta1-4GlcNAcalpha1-4)n (Lidholt, K., Fjelstad, M., Jann, K., and Lindahl, U. (1994) Carbohydr. Res. 255, 87-101). In contrast, chain elongation of hyaluronan (GlcAbeta1-3GlcNAcbeta1-4)n is claimed to occur at the reducing end (Prehm, P. (1983) Biochem. J. 211, 181-189).     

Electrical linewidth test structures fabricated in monocrystallinefilms for reference-material applications

The physical widths of reference features incorporated into electrical linewidth test structures patterned in films of monocrystalline silicon have been determined from Kelvin voltage measurements. The films in which the test structures are patterned are electrically insulated from the bulk-silicon substrate by a layer of silicon dioxide provided by SIMOX (Separation by the IMplantation of OXygen) processing. The motivation is to facilitate the development of linewidth reference materials for critical-dimension (CD) metrology-instrument calibration. The selection of the (110) orientation of the starting silicon and the orientation of the structures' features relative to the crystal lattice enable a lattice-plane-selective etch to generate reference-feature properties of rectangular cross section and atomically planar sidewalls. These properties are highly desirable for CD applications in which feature widths are certified with nanometer-level uncertainty for use by a diverse range of CD instruments. End applications include the development and calibration of new generations of CD instruments directed at controlling processes for manufacturing devices having sub-quarter-micrometer features     

A unified diode model for circuit simulation

A new commercially available diode model is described. This unified model is capable of simulating the widest range of diode technologies of any presently available. The emphasis of this paper is on describing the model's extensive features and flexibility in the different domains of operation and is of particular interest in power applications     

Soft commutation in capacitive idling converters

The capacitive idling converters derived from the Cuk, SEPIC, Zeta, and flyback topologies allow soft commutation of power switches without the need for additional circuitry, making it possible to increase the switching frequency while maintaining high efficiency     

Scientific and artistic investigation of multi-dimensional fractals on the AT & T pixel machine

The pipelined architecture and parallel organization of the AT&T Pixel Machine image computer are described and demonstrated with applications for the visualization of multidimensional fractals, particularly linear fractals and quaternion/ stacked Julia sets. Techniques for pushing the Pixel Machine to its peak abilities are described and apply to more recent parallel image computers as well.     

Function materialization in object bases: design, realization, andevaluation

View materialization is a well-known optimization technique of relational database systems. We present a similar, yet more powerful, optimization concept for object-oriented data models: function materialization. Exploiting the object-oriented paradigm-namely, classification, object identity, and encapsulation-facilitates a rather easy incorporation of function materialization into (existing) object-oriented systems. Only those types (classes) whose instances are involved in some materialization are appropriately modified and recompiled, thus leaving the remainder of the object system invariant. Furthermore, the exploitation of encapsulation (information hiding) and object identity provides for additional performance tuning measures that drastically decrease the invalidation and rematerialization overhead incurred by updates in the object base. First, it allows us to cleanly separate the object instances that are irrelevant for the materialized functions from those that are involved in the materialization of some function result, and this to penalize only those involved objects upon update. Second, the principle of information hiding facilitates fine-grained control over the invalidation of precomputed results. Based on specifications given by the data type implementor, the system can exploit operational semantics to better distinguish between update operations that invalidate a materialized result and those that require no rematerialization. The paper concludes with a quantitative analysis of function materialization based on two sample performance benchmarks obtained from our experimental object base system GOM     

Site and query scheduling policies in multicomputer databasesystems

We study run-time issues, such as site allocation and query scheduling policies, in executing read-only queries in a hierarchical, distributed memory, multicomputer system. The particular architecture considered is based on the hypercube interconnection. The data are stored in a base cube, which is controlled by a control cube and host node hierarchy. Input query trees are transformed into operation sequence trees, and the operation sequences become the units of scheduling. These sequences are scheduled dynamically at run-time. Algorithms for dynamic site allocation are provided. Several query scheduling policies that support interquery concurrency are also studied. Average query completion times and initiation delays are obtained for the various policies using simulations     

RAPS: a rule-based language for specifying resource allocation andtime-tabling problems

A general language for specifying resource allocation and time-tabling problems is presented. The language is based on an expert system paradigm that was developed previously by the authors and that enables the solution of resource allocation problems by using experts' knowledge and heuristics. The language enables the specification of a problem in terms of resources, activities, allocation rules, and constraints, and thus provides a convenient knowledge acquisition tool. The language syntax is powerful and allows the specification of rules and constraints that are very difficult to formulate with traditional approaches, and it also supports the specification of various control and backtracking strategies. We constructed a generalized inference engine that runs compiled resource allocation problem specification language (RAPS) programs and provides all necessary control structures. This engine acts as an expert system shell and is called expert system for resource allocation (ESRA). The performance of RAPS combined with ESRA is demonstrated by analyzing its solution of a typical resource allocation problem     

Sort vs. hash revisited

Efficient algorithms for processing large volumes of data are very important both for relational and new object-oriented database systems. Many query-processing operations can be implemented using sort- or hash-based algorithms, e.g. intersections, joins, and duplicate elimination. In the early relational database systems, only sort-based algorithms were employed. In the last decade, hash-based algorithms have gained acceptance and popularity, and are often considered generally superior to sort-based algorithms such as merge-join. In this article, we compare the concepts behind sort- and hash-based query-processing algorithms and conclude that (1) many dualities exist between the two types of algorithms, (2) their costs differ mostly by percentages rather than by factors, (3) several special cases exist that favor one or the other choice, and (4) there is a strong reason why both hash- and sort-based algorithms should be available in a query-processing system. Our conclusions are supported by experiments performed using the Volcano query execution engine