1,210 research outputs found
Moyamoya Disease with Peripheral Pulmonary Artery Stenoses and Coronary Artery Fistulae
Moyamoya is a progressive disorder of the cerebral vasculature. Our report describes a rare case of Moyamoya disease with distal peripheral pulmonary artery stenoses and coronary fistulae in a 12-year-old Caucasian female patient
High-Angular-Resolution Camera Coupled with an Undulator Source at the European Synchrotron Radiation Facility High-Brilliance Beamline
Length of Stay prediction for Hospital Management using Domain Adaptation
Inpatient length of stay (LoS) is an important managerial metric which if
known in advance can be used to efficiently plan admissions, allocate resources
and improve care. Using historical patient data and machine learning
techniques, LoS prediction models can be developed. Ethically, these models can
not be used for patient discharge in lieu of unit heads but are of utmost
necessity for hospital management systems in charge of effective hospital
planning. Therefore, the design of the prediction system should be adapted to
work in a true hospital setting. In this study, we predict early hospital LoS
at the granular level of admission units by applying domain adaptation to
leverage information learned from a potential source domain. Time-varying data
from 110,079 and 60,492 patient stays to 8 and 9 intensive care units were
respectively extracted from eICU-CRD and MIMIC-IV. These were fed into a
Long-Short Term Memory and a Fully connected network to train a source domain
model, the weights of which were transferred either partially or fully to
initiate training in target domains. Shapley Additive exPlanations (SHAP)
algorithms were used to study the effect of weight transfer on model
explanability. Compared to the benchmark, the proposed weight transfer model
showed statistically significant gains in prediction accuracy (between 1% and
5%) as well as computation time (up to 2hrs) for some target domains. The
proposed method thus provides an adapted clinical decision support system for
hospital management that can ease processes of data access via ethical
committee, computation infrastructures and time
The relation between self-event connections and personality functioning in youth with severe psychopathology
OBJECTIVE: One way in which individuals construct their narrative identity is by making selfâevent connections, which are often linked to better functioning. Being unable to make connections is related to identity discontinuity and psychopathology. Work in the general population corroborates this association, but also highlights the importance of focusing on specific aspects of these connections and on vulnerable populations. METHOD: We examined the association of selfâevent connections with personality functioning in youth with severe psychopathology (crossâsectional N = 228, M (age) = 19.5, longitudinal N = 84), and the role of event and connection valence in the subsample of youth who made a connection (n = 188 and n = 68). Negative affectivity was controlled for in all models. RESULTS: We found no evidence that selfâevent connections, nor connection valence and its interaction with event valence, are related to functioning. Positive event valence was associated with better functioning. Higher negative affectivity was strongly linked to lower functioning and explained the relation between event valence and functioning. No longitudinal associations emerged. CONCLUSIONS: These findings show that for youth with severe psychopathology making selfâevent connections may not be associated with better functioning. Moreover, negative affectivity may be a distal predictor of both event valence and functioning
Component-based programming for higher-order attribute grammars
This paper presents techniques for a component-based style of programming in the context of higher-oder attribute grammars (HAG). Attribute grammar components are "plugged in" into larger attribute grammar systems through higher-order attribute grammars. Higher-order attributes are used as (intermediate) "gluing" data structures.This paper also presents two attribute grammar components that can be re-used across different language-based tool specifications: a visualizer and animator of programs and a graphical user interface AG component. Both components are reused in the definition of a simple language processor. The techniques presented in this paper are implemented in LRC: a purely functional, higher-order attribute grammar-based system that generates language-based tools.(undefined
A molecular analysis of the Afrotropical Baetidae
Recent work on the Afrotropical Baetidae has resulted in a number of important taxonomic changes: several polyphyletic genera have been split and more than 30 new Afrotropical genera have been established. In order to test their phylogenetic relevance and to clarify the suprageneric relationships, we reconstructed the first comprehensive molecular phylogeny of the Afrotropical Baetidae. We sequenced a total of ca. 2300 bp from nuclear (18S) and mitochondrial (12S and 16S) gene regions from 65 species belonging to 26 genera. We used three different approaches of phylogeny reconstruction: direct optimization, maximum parsimony and maximum likelihood. The molecular reconstruction indicates the Afrotropical Baetidae require a global revision at a generic as well as suprageneric level. Only four of the 12 genera were monophyletic when represented by more than one species in the analysis. Historically, two conflicting concepts of the suprageneric classification of Afrotropical Baetidae were proposed. One was based on the gathering of sister genera into complexes and the other on the division of the family into a restricted number of subfamilies. According to our reconstruction, neither is completely satisfactory: the major complexes of genera present in Africa are either paraphyletic or polyphyletic and the division of the Afrotropical Baetidae into two subfamilies is probably too simplified
Subsurface life can modify volatile cycling on a planetary scale
The past decade of environmental microbiology has revealed that subsurface environments, both marine and continental, harbor one of the largest ecosystems of our planet, with diversity and biomass rivaling those of the surface. In addition, subsurface life has been recently shown to contribute significantly to the planetâs biogeochemistry, with microbial activity potentially playing an important role in controlling the flux and composition of volatiles recycled between the Earthâs surface and interior, which has broad implications for the search for life beyond our planet. Current efforts to discover extraterrestrial life are focused on planetary bodies with largely inhospitable surfaces, such as Mars, Venus, Europa, Titan, and Enceladus. In these locations, subsurface environments might provide niches of habitability, making the study of deep microbial life a priority for future astrobiological missions. Understanding how volatile elements are exchanged between planetary surfaces and interiors and the role of a subsurface biosphere in altering their composition and flux might provide a tractable target for defining planetary habitability and the detection of subsurface life forms.Fil: Giovanelli, D.. UniversitĂ degli Studi di Napoli Federico II; Italia. Tokyo Institute of Technology; JapĂłn. Rutgers University; Estados Unidos. Consiglio Nazionale delle Ricerche; Italia. Woods Hole Oceanographic Institution; Estados UnidosFil: Barry, P. H.. Woods Hole Oceanographic Institution; Estados UnidosFil: Bekaert, D. V.. Woods Hole Oceanographic Institution; Estados UnidosFil: Chiodi, Agostina Laura. Consejo Nacional de Investigaciones CientĂficas y TĂ©cnicas. Centro CientĂfico TecnolĂłgico Conicet - Salta. Instituto de Bio y Geociencias del NOA. Universidad Nacional de Salta. Facultad de Ciencias Naturales. Museo de Ciencias Naturales. Instituto de Bio y Geociencias del NOA; ArgentinaFil: Cordone, A.. UniversitĂ degli Studi di Napoli Federico II; ItaliaFil: Covone, G.. UniversitĂ degli Studi di Napoli Federico II; Italia. Istituto Nazionale di Astrofisica; Italia. Istituto Nazionale di Fisica Nucleare; ItaliaFil: Jessen, G.. Universidad Austral de Chile; ChileFil: Lloyd, K.. University of Tennessee; Estados UnidosFil: de Moor, J. M.. Universidad Nacional; Costa RicaFil: Morrison, S. M.. Carnegie Institution For Science; Estados UnidosFil: Schrenk, M. O.. Michigan State University; Estados UnidosFil: Vitale Brovarone, A.. Alma Mater Studiorum Universit`a Di Bologna; Italia. Sorbonne University; Francia. Museum National dâHistoire Naturelle; Franci
Entanglement on mixed stabilizer states: normal forms and reduction procedures
Published versio
Translation initiation on the insulin-like growth factor II leader 1 is developmentally regulated
Datalog-Based program analysis with BES and RWL
This paper describes two techniques for Datalog query evaluation and their application to object-oriented program analysis. The first technique transforms Datalog programs into an implicit Boolean Equation System (Bes) that can then be solved by using linear-time complexity algorithms that are available in existing, general purpose verification toolboxes such as Cadp. In order to improve scalability and to enable analyses involving advanced meta-programming features, we develop a second methodology that transforms Datalog programs into rewriting logic (Rwl) theories. This method takes advantage of the preeminent features and facilities that are available within the high-performance system Maude, which provides a very efficient implementation of Rwl. We provide evidence of the practicality of both approaches by reporting on some experiments with a number of real-world Datalog-based analyses. © 2011 Springer-Verlag.This work has been partially supported by the eu(feder), the Spanish mec/micinn under grants tin2007-68093-C02 and tin2010-21062-C02-02, and the Generalitat Valenciana under grant Emergentes gv/2009/024. M.A.Feliu was partially supported by the Spanish mec fpu grant AP2008-00608.Alpuente Frasnedo, M.; FeliĂș GabaldĂłn, MA.; Joubert, C.; Villanueva GarcĂa, A. (2011). Datalog-Based program analysis with BES and RWL. En Datalog Reloaded. Springer Verlag (Germany). 6702:1-20. https://doi.org/10.1007/978-3-642-24206-9_1S1206702Afrati, F.N., Ullman, J.D.: Optimizing joins in a map-reduce environment. In: Manolescu, I., Spaccapietra, S., Teubner, J., Kitsuregawa, M., LĂ©ger, A., Naumann, F., Ailamaki, A., Ăzcan, F. (eds.) EDBT. ACM International Conference Proceeding Series, vol. 426, pp. 99â110. ACM, New York (2010)Alpuente, M., FeliĂș, M., Joubert, C., Villanueva, A.: Defining Datalog in Rewriting Logic. Technical Report DSIC-II/07/09, DSIC, Universidad PolitĂ©cnica de Valencia (2009)Alpuente, M., FeliĂș, M., Joubert, C., Villanueva, A.: Using Datalog and Boolean Equation Systems for Program Analysis. In: Cofer, D., Fantechi, A. (eds.) FMICS 2008. LNCS, vol. 5596, pp. 215â231. Springer, Heidelberg (2009)Alpuente, M., FeliĂș, M.A., Joubert, C., Villanueva, A.: Defining datalog in rewriting logic. In: De Schreye, D. (ed.) LOPSTR 2009. LNCS, vol. 6037, pp. 188â204. Springer, Heidelberg (2010)Andersen, H.R.: Model checking and boolean graphs. Theoretical Computer Science 126(1), 3â30 (1994)Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J.D.: Magic Sets and Other Strange Ways to Implement Logic Programs. In: Proc. 5th ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, PODS 1986, pp. 1â15. ACM Press, New York (1986)Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Springer, Heidelberg (1990)Chen, T., Ploeger, B., van de Pol, J., Willemse, T.A.C.: Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 120â135. Springer, Heidelberg (2007)Clavel, M., DurĂĄn, F., Ejer, S., Lincoln, P., MartĂ-Oliet, N., Meseguer, J., Talcott, C.: All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)Dam, A., Ploeger, B., Willemse, T.: Instantiation for Parameterised Boolean Equation Systems. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol. 5160, pp. 440â454. Springer, Heidelberg (2008)de Moor, O., Sereni, D., Verbaere, M., Hajiyev, E., Avgustinov, P., Ekman, T., Ongkingco, N., Tibble, J.: QL: Object-oriented queries made easy. In: LĂ€mmel, R., Visser, J., Saraiva, J. (eds.) GTTSE 2008. LNCS, vol. 5235, pp. 78â133. Springer, Heidelberg (2008)FeliĂș, M., Joubert, C., TarĂn, F.: Efficient BES-based Bottom-Up Evaluation of Datalog Programs. In: GulĂas, V., Silva, J., Villanueva, A. (eds.) Proc. X Jornadas sobre ProgramaciĂłn y Lenguajes (PROLE 2010), Garceta, pp. 165â176 (2010)FeliĂș, M., Joubert, C., TarĂn, F.: Evaluation strategies for datalog-based points-to analysis. In: Bendisposto, J., Leuschel, M., Roggenbach, M. (eds.) Proc. 10th Workshop on Automated Verification of Critical Systems (AVoCS 2010), pp. 88â103. Technical Report of DĂŒsseldorf University (2010)Garavel, H., Mateescu, R., Lang, F., Serwe, W.: CADP 2006: A Toolbox for the Construction and Analysis of Distributed Processes. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 158â163. Springer, Heidelberg (2007)Hajiyev, E., Verbaere, M., de Moor, O.: CodeQuest: Scalable Source Code Queries with Datalog. In: Hu, Q. (ed.) ECOOP 2006. LNCS, vol. 4067, pp. 2â27. Springer, Heidelberg (2006)Hanus, M.: The Integration of Functions into Logic Programming: From Theory to Practice. Journal on Logic Programming 19 & 20, 583â628 (1994)Joubert, C., Mateescu, R.: Distributed On-the-Fly Model Checking and Test Case Generation. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol. 3925, pp. 126â145. Springer, Heidelberg (2006)Leeuwen, J. (ed.): Formal Models and Semantics, vol. B. Elsevier, The MIT Press (1990)Liu, X., Smolka, S.A.: Simple Linear-Time Algorithms for Minimal Fixed Points. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 53â66. Springer, Heidelberg (1998)Liu, Y.A., Stoller, S.D.: From datalog rules to efficient programs with time and space guarantees. ACM Trans. Program. Lang. Syst. 31(6) (2009)Livshits, B., Whaley, J., Lam, M.: Reflection Analysis for Java. In: Yi, K. (ed.) APLAS 2005. LNCS, vol. 3780, pp. 139â160. Springer, Heidelberg (2005)Marchiori, M.: Logic Programs as Term Rewriting Systems. In: RodrĂguez-Artalejo, M., Levi, G. (eds.) ALP 1994. LNCS, vol. 850, pp. 223â241. Springer, Heidelberg (1994)Mateescu, R.: Local Model-Checking of an Alternation-Free Value-Based Modal Mu-Calculus. In: Proc. 2nd Intâl Workshop on Verication, Model Checking and Abstract Interpretation, VMCAI 1998 (1998)Mateescu, R., Thivolle, D.: A Model Checking Language for Concurrent Value-Passing Systems. In: Cuellar, J., Sere, K. (eds.) FM 2008. LNCS, vol. 5014, pp. 148â164. Springer, Heidelberg (2008)Meseguer, J.: Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science 96(1), 73â155 (1992)Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 18â61. Springer, Heidelberg (1998)Reddy, U.: Transformation of Logic Programs into Functional Programs. In: Proc. Symposium on Logic Programming (SLP 1984), pp. 187â197. IEEE Computer Society Press, Los Alamitos (1984)Reps, T.W.: Solving Demand Versions of Interprocedural Analysis Problems. In: Adsul, B. (ed.) CC 1994. LNCS, vol. 786, pp. 389â403. Springer, Heidelberg (1994)Rosu, G., Havelund, K.: Rewriting-Based Techniques for Runtime Verification. Autom. Softw. Eng. 12(2), 151â197 (2005)Schneider-Kamp, P., Giesl, J., Serebrenik, A., Thiemann, R.: Automated Termination Analysis for Logic Programs by Term Rewriting. In: Puebla, G. (ed.) LOPSTR 2006. LNCS, vol. 4407, pp. 177â193. Springer, Heidelberg (2007)Ullman, J.D.: Principles of Database and Knowledge-Base Systems, Volume I and II, The New Technologies. Computer Science Press, Rockville (1989)Vieille, L.: Recursive Axioms in Deductive Databases: The Query/Subquery Approach. In: Proc. 1st Intâl Conf. on Expert Database Systems, EDS 1986, pp. 253â267 (1986)Whaley, J.: Joeq: a Virtual Machine and Compiler Infrastructure. In: Proc. Workshop on Interpreters, Virtual Machines and Emulators, IVME 2003, pp. 58â66. ACM Press, New York (2003)Whaley, J., Avots, D., Carbin, M., Lam, M.S.: Using Datalog with Binary Decision Diagrams for Program Analysis. In: Yi, K. (ed.) APLAS 2005. LNCS, vol. 3780, pp. 97â118. Springer, Heidelberg (2005)Zheng, X., Rugina, R.: Demand-driven alias analysis for C. In: Proc. 35th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 2008, pp. 197â208. ACM Press, New York (2008
- âŠ