Death Resulting from Pneumocephalus Complicating Endoscopic Food Bolus Retrieval in a Patient with Eosinophilic Esophagitis

Pneumocephalus is a rare complication of esophagogastroduodenoscopy (EGD), but existing literature does not discuss pneumocephalus surrounding endoscopic food bolus retrieval. We present a death involving pneumocephalus complicating endoscopic food removal from the esophagus. A 40-year-old man presented with dysphagia and suprasternal discomfort 12 hours following chicken ingestion. On flexible endoscopy, chicken was visualized in the distal esophagus. After successful retrieval, a mucosal laceration was noted where the chicken had been lodged. He was unarousable following the procedure and was emergently transported to a hospital, where computed tomography scanning showed pneumocephalus. He was later declared brain dead. The case was referred for medicolegal autopsy. The brain was examined first, revealing rare air bubbles within meningeal vessels and numerous, diffuse petechiae-like hemorrhages within the brain parenchyma. The esophageal mucosa had focal discoloration and a partial thickness laceration; microscopic examination revealed eosinophilic esophagitis. Eosinophilic esophagitis is a known risk factor for food bolus impaction and should be suspected in such patients. Pneumocephalus is a rare possible complication of EGD for food bolus retrieval. In patients unresponsive after endoscopy, radiographic detection of potential pneumocephalus should be encouraged to enable timely therapy and improved outcomes, or to supplement autopsy in the event of patient death. Forensic pathologists should understand that pneumocephalus is a potential mechanism of injury/death in patients experiencing esophageal trauma, including injury incurred during EGD

Optimized laser turrets for minimum phase distortion

An analysis and computer program which optimizes laser turret geometry to obtain minimum phase distortion is described. Phase distortion due to compressible, inviscid flow over small perturbation laser turrets in subsonic or supersonic flow is calculated. The turret shape is determined by a two dimensional Fourier series; in a similar manner, the flow properties are given by a Fourier series. Phase distortion is calcualted for propagation at serveral combinations of elevation and azimuth angles. A sum is formed from the set of values, and this sum becomes the objective function for an optimization computer program. The shape of the turret is varied to provide minimum phase distortion

Interference effects during burning in air for stationary n-heptane, ethyl alcohol, and methyl alcohol droplets

Experiments have been conducted for the determination of the evaporation constant and flame shapes of two and of five closely spaced droplets burning in air. Droplets of approximately the same and of different diameters were used at various distances between the droplet centers. The apparent flame shape, which was observed only for n-heptane droplets, changes very little during burning. The square of the droplet diameter decreases linearly with time for fixed spacing between droplet centers, at least within the experimental limits of accuracy. In general, the average evaporation constant for two droplets, K', must be assumed either to vary continuously during burning or else to be a function of average initial drop diameter, D^0. The change of K' with time corresponds to the second derivative in plots of the square of the diameter vs. time. These second derivatives are not defined in our work because of unavoidable scatter of the experimental data. Attempts at understanding the observed results by considering published theories for single droplets, as well as groupings obtained from dimensional analysis, have been unsuccessful. It appears that the diffusion model for the heterogeneous burning of single fuel droplets will require serious revision and extension before the burning of droplets arrays and sprays can be understood quantitatively. Furthermore, the effective value of K' for a spray probably depends not only on the fuel-oxidizer system but also on the injection pattern. For this reason additional studies had best be carried out under conditions corresponding to those existing in service models

A program for calculating turbofan-driven lift-fan propulsion system performance

The performance of a turbofan-powered lift fan propulsion system for vertical takeoff and landing (VTOL) aircraft is calculated. The program formulation consists of taking bleed air from a turbofan engine, heating the bleed air in an interburner, and passing it through a tip turbine to drive a lift fan. Two options are available: bleed air from the engine exhaust, or bleed air that has passed through the engine fan only. This computer program will benefit persons unfamiliar with the thermodynamics of engine cycle analysis

ORION: A Small, Full Capability, General Purpose, Low Earth Orbit Satellite Bus

A low cost general purpose satellite bus has been designed to support a wide variety of small scientific and commercial payloads. The design provides a number of launch options, including the new NASA extended Get- Away-Special * (GAS) canister and several small expendable launch vehicles. The satellite is 48 cm. (19 in,) in diameter, 89 cm. (35 in.) high and weighs approximately 123 kg. (270 Ibs.). The satellite bus provides telemetry, attitude control, orbital boost/station keeping, electrical power, microprocessor and data storage for up to 23 kg. (50 Ibs.) of user payload. The satellite. has a hydrazine propulsion system, with up to 123 m/s (2600 ft/s) delta-V capability. On-board propulsion reduces launcher orbital insertion accuracy requirements and allows the satellite to independently achieve 1480 km. (300 nm. } circular or 4070 km, (2200 nm.) elliptic orbits from an initial orbit of 250 km. (135 nm.)

Phototesting and photoprotection in LE

Photosensitivity and induction of skin lesions following UV radiation is a common problem of patients with cutaneous and systemic forms of lupus erythematosus. The detrimental effect of UV radiation to patients with lupus erythematosus was already recognized in the last century. Skin lesions can now be provoked under standardized conditions allowing the diagnosis and classification of patients with photosensitive disorders. The aim of this review is to give an overview on the history, test procedure and test results in patients with lupus erythematosus

Alternating runtime and size complexity analysis of integer programs

We present a modular approach to automatic complexity analysis. Based on a novel alternation between finding symbolic time bounds for program parts and using these to infer size bounds on program variables, we can restrict each analysis step to a small part of the program while maintaining a high level of precision. Extensive experiments with the implementation of our method demonstrate its performance and power in comparison with other tools

Models for logics and conditional constraints in automated proofs of termination

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-13770-4_3Reasoning about termination of declarative programs, which are described by means of a computational logic, requires the definition of appropriate abstractions as semantic models of the logic, and also handling the conditional constraints which are often obtained. The formal treatment of such constraints in automated proofs, often using numeric interpretations and (arithmetic) constraint solving can greatly benefit from appropriate techniques to deal with the conditional (in)equations at stake. Existing results from linear algebra or real algebraic geometry are useful to deal with them but have received only scant attention to date. We investigate the definition and use of numeric models for logics and the resolution of linear and algebraic conditional constraints as unifying techniques for proving termination of declarative programs.Developed during a sabbatical year at UIUC. Supported by projects NSF CNS13-19109, MINECO TIN2010-21062-C02-02 and TIN2013-45732-C4-1-P, and GV BEST/2014/026 and PROMETEO/2011/052.Lucas Alba, S.; Meseguer, J. (2014). Models for logics and conditional constraints in automated proofs of termination. En Artificial Intelligence and Symbolic Computation. Springer Verlag (Germany). 9-20. https://doi.org/10.1007/978-3-319-13770-4_3S920Alarcón, B., Gutiérrez, R., Lucas, S., Navarro-Marset, R.: Proving Termination Properties with mu-term. In: Johnson, M., Pavlovic, D. (eds.) AMAST 2010. LNCS, vol. 6486, pp. 201–208. Springer, Heidelberg (2011)Alarcón, B., Lucas, S., Navarro-Marset, R.: Using Matrix Interpretations over the Reals in Proofs of Termination. In: Proc. of PROLE 2009, pp. 255–264 (2009)Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C. (eds.): All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)Contejean, E., Marché, C., Tomás, A.-P., Urbain, X.: Mechanically proving termination using polynomial interpretations. J. of Aut. Reas. 34(4), 325–363 (2006)Endrullis, J., Waldmann, J., Zantema, H.: Matrix Interpretations for Proving Termination of Term Rewriting. J. of Aut. Reas. 40(2-3), 195–220 (2008)Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: Maximal Termination. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 110–125. Springer, Heidelberg (2008)Futatsugi, K., Diaconescu, R.: CafeOBJ Report. AMAST Series. World Scientific (1998)Hudak, P., Peyton-Jones, S.J., Wadler, P.: Report on the Functional Programming Language Haskell: a non–strict, purely functional language. Sigplan Notices 27(5), 1–164 (1992)Lucas, S.: Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming 1998(1), 1–61 (1998)Lucas, S.: Polynomials over the reals in proofs of termination: from theory to practice. RAIRO Theoretical Informatics and Applications 39(3), 547–586 (2005)Lucas, S., Marché, C., Meseguer, J.: Operational termination of conditional term rewriting systems. Information Processing Letters 95, 446–453 (2005)Lucas, S., Meseguer, J.: Proving Operational Termination of Declarative Programs in General Logics. In: Proc. of PPDP 2014, pp. 111–122. ACM Digital Library (2014)Lucas, S., Meseguer, J.: 2D Dependency Pairs for Proving Operational Termination of CTRSs. In: Proc. of WRLA 2014. LNCS, vol. 8663 (to appear, 2014)Lucas, S., Meseguer, J., Gutiérrez, R.: Extending the 2D DP Framework for CTRSs. In: Selected papers of LOPSTR 2014. LNCS (to appear, 2015)Meseguer, J.: General Logics. In: Ebbinghaus, H.-D., et al. (eds.) Logic Colloquium 1987, pp. 275–329. North-Holland (1989)Nguyen, M.T., de Schreye, D., Giesl, J., Schneider-Kamp, P.: Polytool: Polynomial interpretations as a basis for termination of logic programs. Theory and Practice of Logic Programming 11(1), 33–63 (2011)Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer (April 2002)Prestel, A., Delzell, C.N.: Positive Polynomials. In: From Hilbert’s 17th Problem to Real Algebra. Springer, Berlin (2001)Podelski, A., Rybalchenko, A.: A Complete Method for the Synthesis of Linear Ranking Functions. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 239–251. Springer, Heidelberg (2004)Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons (1986)Zantema, H.: Termination of Context-Sensitive Rewriting. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 172–186. Springer, Heidelberg (1997

Automatically proving termination and memory safety for programs with pointer arithmetic

While automated verification of imperative programs has been studied intensively, proving termination of programs with explicit pointer arithmetic fully automatically was still an open problem. To close this gap, we introduce a novel abstract domain that can track allocated memory in detail. We use it to automatically construct a symbolic execution graph that over-approximates all possible runs of a program and that can be used to prove memory safety. This graph is then transformed into an integer transition system, whose termination can be proved by standard techniques. We implemented this approach in the automated termination prover AProVE and demonstrate its capability of analyzing C programs with pointer arithmetic that existing tools cannot handle