bluuebunny/crossref_metadata_2025_split huggingface dataset:
René Worms et l’École de Le Play : un voisinage courtois
Authors: Guerlain Laetitia 
Published: February 2016

Cet article vise à éclairer les relations entre l’École de Frédéric Le Play et René Worms et ses institutions. Worms et les leplaysiens, malgré leurs irréductibles différences, entretiennent des rapports de voisinage feutrés. Ni franchement hostiles les uns aux autres, ni excessivement laudateurs, ils ne se jettent pas d’anathème mutuel, mais reconnaissent leurs mérites respectifs, tout en manifestant des désaccords. Cette attitude somme toute modérée de part et d’autre se manifeste à deux niveaux : d’abord par l’accueil réservé aux disciples de Le Play dans les institutions wormsiennes et ensuite par les débats doctrinaux et méthodologiques entre les deux courants.
La teoría narrativa en la obra de Antonio Rodríguez Almodóvar
Authors: Cenizo Jiménez José 
Published: February 2016

Nuestro estudio tiene como fin el análisis de la teoría narrativa en la obra de Antonio Rodríguez Almodóvar. Éste, natural de Alcalá de Guadaíra (Sevilla), donde nació en 1941, es catedrático (recién prejubilado) de Lengua y Literatura en el IES «Ramón Carande» de Sevilla y doctor en Filología Moderna. Amén de por su actividad política (fue Primer Teniente de Alcalde del Ayuntamiento de Sevilla y director del Pabellón de Andalucía en la Exposición Universal de 1992) y de sus cargos en la Administración Edu- cativa (fue Director General de Renovación Pedagógica de la Junta de Andalucía y hasta hace poco director del Centro de Profesores de Castilleja de la Cuesta en el Aljarafe), es conocido por su faceta de investigador y escritor, guionista de televisión y articulista (desde hace unos años en el periódico El País). Fruto de lo primero son sus libros Lecciones de narrativa hispano-americana, publicado por la Universidad de Sevilla en 1972; La estructura de la novela burguesa, publicado en 1976 por Taller Ediciones J. B. de Madrid; la edición y traducción de La estructura del Quijote, de Knud Togeby (Universidad de Sevilla, 1977 y 1991), o el libro recopilatorio de ensayos sueltos Hacia una crítica dialéctica (Sevilla, Alfar, 1987), la publicación en 1999 junto al profesor Félix Morales del hallazgo de una leyenda de Bécquer, Unida a la muerte, y, sobre todo, sus obras de recuperación de los cuentos españoles de tradición oral, divulgados en libros tan conocidos como Cuentos maravillosos españoles (Barcelona, Crítica, 1982), Cuentos al amor de la lumbre (Madrid, Anaya, vol. I, eds. 1983, 1984; vol. II, eds. 1984, 1985, que manejamos nosotros, y así hasta dieciséis reediciones el primer tomo y once el segundo, amén de las tres que ya lleva la edición de bolsillo),1 obra que fue Premio Nacional en 1984, o Cuentos de la media lunita (Sevilla, Algaida, 1985 y ss., traducida a todas las lenguas del Estado). La investigación seria y metódica sobre esta cuentística ha dado libros como Los cuentos populares o la tentativa de un texto infinito (Universidad de Murcia, 1989). Como escritor, ha transitado por géneros como la poesía –Memoria vir- gen (Sevilla, Río del Sur, 1962), A pesar de los dioses (Sevilla, Renacimiento, 1994) y Poemas del viajero (Sevilla, Renacimiento, 1999)–, los relatos fantásticos –El bosque de los sueños (Madrid, Siruela, 1993)–, y la novela –Variaciones para un saxo (Madrid, Cátedra, 1986) y Un lugar parecido al paraíso (Labor, 1991; Galaroza Ediciones, 1996; y Algaida, 2002)–.
Luque Durán, Juán de Dios y Pamies Bertrán, Antonio (eds.) (2005). La creatividad en el lenguaje: colocaciones idiomáticas y fraseología. Granada: Granada Lingvistica; 484 pp.
Authors: Markič Jasmina 
Published: February 2016

El libro La creatividad en el lenguaje: colocaciones idiomáticas y fraseología, editado por dos profesores de la Universidad de Granada, los doctores Juan de Dios Luque Durán y Antonio Pamies Bertrán, y publicado en 2005 por Granada Lingvistica en la Colección«Collectae», distribuido por Método Ediciones, es un valioso aporte a los estudios de fraseología. El libro lleva en la portada la reproducción de una pintura de las tablas de colmenas, ejemplo del arte popular esloveno, que simboliza el carácter multicultural de la obra. El libro de 484 páginas es un volumen colectivo en el que participan 28 renombrados investigadores españoles y extranjeros con 25 artículos especializados en diferentes aspectos de la fraseología.
Fragmentación y desconfianza del ayer : estrategias para releer el pasado en dos novelas argentinas contemporáneas
Authors: Hernán Sosa Carlos 
Published: February 2016

Durante las últimas décadas, se ha escrito una enorme cantidad de textos críticos académicos1 dedicados al estudio de la novela histórica -o «nueva novela histórica», en términos de Seymour Menton (1996)-, un género que pródigamente se viene produciendo en Latinoamérica, aproximadamente desde mediados del siglo XX. Proponer un panóptico de este ingente fenómeno escriturario, tanto de la producción literaria como de la concomitante producción crítica, es una tarea monumental que escapa a los intereses más acotados de este trabajo. En realidad, en nuestro abordaje nos interesa rescatar sólo una de las características, reiterada en diferentes textos exponentes de este género, que resulta especialmente relevante en el corpus de análisis que proponemos. Nos referimos a la reconstrucción desmitificadora de la historia, como una perspectiva iterativa dentro de las estrategias discursivas de estas novelas, y su consustancial percepción, muchas veces cifrada, del presente.
Revista de crítica literaria marxista (2008)
Authors: Escalera Cordero Matías 
Published: February 2016

Si es cierto que quien quiera acercarse a la crítica literaria marxista, hoy, sea estudiante o especialista, se encontrará con «enormes dificultades y obstáculos», tal como anuncia David Becerra Mayor (Rebelión, 04/11/08), en la presentación del primer número de la Revista de crítica literaria marxista, de la FIM:2 por ejemplo, ser «tildado de dogmático»; o de «estar desfasado», o de «no haber sido capaz de adaptarse a los cambios». No es del todo cierto, sin embargo, que no haya modelos actuales a los que acudir, o que «acudir a los clásicos del marxismo» (Lukács, Althusser, o la Escuela de Frankfurt) sea un problema; pues la potencia de sus propuestas permanece vigente, más allá de los vaivenes de las modas, sean canónicas, mediáticas o académicas.
El mito de Apolo y otros mitemas: una lectura metaficcional del cuento Apolo y las putas de Carlos Fuentes / Petra Tournay-Theodotou
Authors: Tournay-Theodotou Petra 
Published: February 2016

El cuento Apolo y las putason su título algo escabroso– forma parte del volumen de cinco cuentos de Carlos Fuentes que se titula El naranjo, publicado en 1993.1 Según el texto de la solapa «en este libro Carlos Fuentes juega con diversos mitos –el conquista- dor conquistado, la atemporalidad de la historia– y recorre obsesiones típícas de su litera- tura» (1993).
Natural Language Processing for Cohort Discovery in a Discharge Prediction Model for the Neonatal ICU
Authors: Lehmann Christoph , Fabbri Daniel , Temple Michael 
Published: February 2016

SummaryDischarging patients from the Neonatal Intensive Care Unit (NICU) can be delayed for non-medical reasons including the procurement of home medical equipment, parental education, and the need for children’s services. We previously created a model to identify patients that will be medically ready for discharge in the subsequent 2–10 days. In this study we use Natural Language Processing to improve upon that model and discern why the model performed poorly on certain patients.We retrospectively examined the text of the Assessment and Plan section from daily progress notes of 4,693 patients (103,206 patient-days) from the NICU of a large, academic children’s hospital. A matrix was constructed using words from NICU notes (single words and bigrams) to train a supervised machine learning algorithm to determine the most important words differentiating poorly performing patients compared to well performing patients in our original discharge prediction model.NLP using a bag of words (BOW) analysis revealed several cohorts that performed poorly in our original model. These included patients with surgical diagnoses, pulmonary hypertension, retinopathy of prematurity, and psychosocial issues.The BOW approach aided in cohort discovery and will allow further refinement of our original discharge model prediction. Adequately identifying patients discharged home on g-tube feeds alone could improve the AUC of our original model by 0.02. Additionally, this approach identified social issues as a major cause for delayed discharge.A BOW analysis provides a method to improve and refine our NICU discharge prediction model and could potentially avoid over 900 (0.9%) hospital days.AUC – Area under the Curve, CART -- Classification And Regression Trees, DTD – Days to Dis- charge, GI – Gastrointestinal, LOS – Length of Stay, NICU – Neonatal Intensive Care Unit, NS – Neurosurgery, RF – Random Forest.
Sharing of Computations
Authors: Amtoft Torben 
Published: February 2016

<p>The main purpose of the thesis is to develop a model enabling one to reason about various techniques for program optimization, in particular wrt.\ speedup and correctness. Moreover, several methods to increase the amount of sharing are discussed, and a new one (to be termed ''ultimate sharing'') is treated in detail.</p><p> </p><p>Concerning speedup, a main point is to factor out the reasons why a program transformation may yield more than a constant speedup.</p><p> </p><p>Concerning correctness, the interesting part is preservation of termination properties. This issue is mainly addressed for a logic language, where previous results from the literature are generalized -- but also for a functional language some (more limited) results are presented.</p>
Complexity Results for 1-safe Nets
Authors: Cheng Allan , Esparza Javier , Palsberg Jens 
Published: February 2016

<p>We study the complexity of several standard problems for 1-safe Petri nets and some of its subclasses. We prove that reachability, liveness, and deadlock are all PSPACE-complete for 1-safe nets. We also prove that deadlock is NP-complete for free-choice nets and for 1-safe free-choice nets. Finally, we prove that for arbitrary Petri nets, deadlock is equivalent to reachability and liveness.</p><p> </p><p>This paper is to be presented at <em>FST &amp; TCS, Foundations of Software Technology &amp; Theoretical Computer Science</em>, to be held 15-17 December 1993, in Bombay, India.</p><p>A version of the paper with most proofs omitted is to appear in the proceedings.</p>
Models for Concurrency
Authors: Winskel Glynn , Nielsen Mogens 
Published: February 2016

<p>Revised version of DAIMI PB-429</p><p> </p><p>This is, we believe, the final version of a chapter for the Handbook of Logic and the Foundations of Computer Science, vol. IV, Oxford University Press.</p><p>It surveys a range of models for parallel computation to include interleaving models like transition systems, synchronisation trees and languages (often called Hoare traces in this context), and models like Petri nets, asynchronous transition systems, event structures, pomsets and Mazurkiewicz traces where concurrency is represented more explicitly by a form of causal independence.</p><p>The presentation is unified by casting the models in a category-theoretic framework. One aim is to use category theory to provide abstract characterisations of constructions like parallel composition valid throughout a range of different models and to provide formal means for translating between different models. A knowledge of basic category theory is assumed, up to an acquaintance with the notion of adjunction.</p>
Efficient Training of Feed-Forward Neural Networks
Authors: Møller Martin F. 
Published: February 2016

<p>Since the discovery of the back-propagation method, many modified and new algorithms have been proposed for training of feed-forward neural networks. The problem with slow convergence rate has, however, not been solved when the training is on large scale problems. There is still a need for more efficient algorithms. This Ph.D. thesis describes different approaches to improve convergence. The main results of the thesis is the development of the Scaled Conjugate Gradient Algorithm and the stochastic version of this algorithm. Other important results are the development of methods that can derive and use Hessian information in an efficient way. The main part of this thesis is the 5 papers presented in appendices A-E. Chapters 1-6 give an overview of learning in feed-forward neural networks, put these papers in perspective and present the most important results. The conclusion of this thesis is:</p><p> </p><p>* Conjugate gradient algorithms are very suitable for training of feed-forward networks.</p><p>* Use of second order information by calculations on the Hessian matrix can be used to improve convergence.</p>
Tailorable Systems: Design, Support, Techniques, and Applications
Authors: Malhotra Jawahar 
Published: February 2016

<p>A tailorable system is one that can be tailored in its use-environment, without any changes to the source-code of the original system. Such a system must allow its users to make significant changes to its functionality, but without any modifications to its source-code. One way to accomplish this is to write the system in a manner such that changes to the system's functionality can be made by <em> extensions </em> to its source-code as opposed to <em> modifications </em> of its source-code. A system written in this manner is an <em> extensible </em> system.</p><p> </p><p>The goal of this dissertation is to study the problems encountered in the process of developing highly extensible systems, and in the process of tailoring them. The study is logically divided into four major parts: (1) <em>design</em> deals with issues in the design of extensible systems, (2) <em> support </em> explores the language-level and compiler-level support necessary for developing extensible systems, (3) <em> techniques </em> illustrates some tested techniques for developing extensible systems, and (4) <em> applications </em> deals with the application of the other three parts to create tailorable applications in specific domains.</p>
Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using a Genetic Algorithm
Authors: Esbensen Henrik 
Published: February 2016

<p>A new Genetic Algorithm (GA) for the Steiner Problem in a Graph (SPG) is presented. The algorithm is based on a bitstring encoding. A bitstring specifies selected Steiner vertices and the corresponding Steiner tree is computed using the Distance Network Heuristic. This scheme ensures that every bitstring correspond to a valid Steiner tree and thus eliminates the need for penalty terms in the cost function.</p><p> </p><p>The GA is tested on all SPG instances from the OR-Library of which the largest graphs have 2,500 vertices and 62,500 edges. When executed 10 times on each of 58 graph examples, the GA finds the global optimum at least once for 55 graphs and every time for 43 graphs. In total the GA finds the global optimum in 77 % of all program executions and is within 1 % from the global optimum in more than 92 % of all executions.</p><p> </p><p>The performance is compared to that of two branch-and-cut algorithms and one of the very best deterministic heuristics, an iterated version of the Shortest Path Heuristic (SPH-I). For all test examples but one, even the worst result ever found by the GA is equal to or better than the result of SPH-I and in many cases the average error ratio of the GA is an order of magnitude better than that of SPH-I. The runtime of the GA is moderate for all test examples. This is in contrast to SPH-I as well as the branch-and-cut algorithms, for which the runtime in some cases are extremely high.</p>
Graphs and Decidable Transductions based on Edge Constraints: Extended abstract
Authors: Klarlund Nils , Schwartzbach Michael I. 
Published: February 2016

<p>We give examples to show that not even <strong> c-edNCE </strong>, the most general known notion of context-free graph grammar, is suited for the specification of some common data structures.</p><p> </p><p>To overcome this problem, we use monadic second-order logic and introduce <em> edge constraints</em> as a new means of specifying a large class of graph families. Our notion stems from a natural dichotomy found in programming practice between ordinary pointers forming spanning trees and auxiliary pointers cutting across.</p><p> </p><p>Our main result is that for certain transformations of graphs definable in monadic second-order logic, the question of whether a graph family given by a specification <strong> A </strong> is mapped to a family given by a specification <strong> B </strong> is decidable. Thus a decidable Hoare logic arises.</p>
Verification of Pointers
Authors: Klarlund Nils , Schwartzbach Michael I. 
Published: February 2016

<p>Our recent work links type checking in programming languages to verification based on automata. In this survey, we give an overview of our methods and suggest directions for future research.</p><p> </p><p>In our approach, we view data types as invariants and devise a logical and decidable framework for expressing global properties of a store consisting of records and pointers.</p><p>We can express common properties, for example about doubly-linked lists and their algorithms. Such properties seemed to have called for a full Hoare logic beyond the reach of type checking and decidability.</p><p> </p><p>Our work is based on monadic second-order logic. Thus verification boils down to calculations on finite-state automata. This raises specific questions about combinatorial techniques for representing state spaces if these calculations are ever to be carried out on more than simple examples.</p>
Fourfold rotationally symmetrically polarized laser beam for drilling a square hole
Authors: Kikuchi Hiroshi , Mizutani Akio , Kikuta Hisao 
Published: February 2016

Abstract
A method of laser processing with a space-variant polarized laser beam is discussed for drilling a square hole. Fourfold rotationally symmetrically polarized beams were proposed. The square-hole was formed by using the difference in the absorption of polarized light for oblique incidence. The feasibility of square hole drilling with the polarized beams was investigated by numerical simulations of laser processing. The calculated holes had square openings with sharp corners. Moreover, one of the square openings was about the same size as a circular hole drilled with a circularly polarized focused beam.
Improving the operational characteristic stability in Al/Au/ZnO/Al resistive random access memory devices
Authors: Wu Cheng-Yen , You Hsin-Chiang , Lin Gong-Kai , Yang Wen-Luh 
Published: February 2016

Abstract
Resistive random access memory (ReRAM) devices are considered to be one of the most promising candidates for the next generation of nonvolatile memory devices because of their superior properties such as low power consumption, simple structure, high integration density, and fast operation speed. In this study, we used zinc oxide (ZnO) thin films to fabricate ReRAM devices comprising Au/ZnO/Al and Al/Au/ZnO/Al structures. We observed that the operating stability of the device containing the Al/Au/ZnO/Al structure improved. The devices displayed effective and stable operational characteristics. The operational voltage of the ZnO ReRAM devices was less than 3 V, and the reset operational voltage was less than −1.5 V.
Minimization of reverse recovery charge and forward voltage of silicon p–i–n diodes
Authors: Yamashita Yusuke , Machida Satoru 
Published: February 2016

Abstract
The forward voltage and reverse recovery charge of silicon p–i–n diodes are controlled on the basis of carrier lifetime or carrier injection efficiency to reduce power loss. In this study, the ideal carrier lifetime for minimizing power loss is calculated by theoretical analysis. The ideal carrier lifetime depends on the current density, forward voltage, and trap energy level in the intrinsic layer. A decrease in the current density leads to an increase in the ideal lifetime. In addition, a shallow trap level has similar current dependence on ideal lifetime. Using the appropriate lifetime is important for designing a p–i–n diode, and a shallow trap level can achieve greater ideal current density dependency.
Diagnosis, Risk Stratification, and Treatment of Pericarditis
Authors: Cremer Paul C. , Klein Allan L. , Imazio Massimo 
Published: September 2024

ImportancePericarditis accounts for up to 5% of emergency department visits for nonischemic chest pain in North America and Western Europe. With appropriate treatment, 70% to 85% of these patients have a benign course. In acute pericarditis, the development of constrictive pericarditis (&amp;lt;0.5%) and pericardial tamponade (&amp;lt;3%) can be life-threatening.ObservationsAcute pericarditis is diagnosed with presence of 2 or more of the following: sharp, pleuritic chest pain that worsens when supine (≈90%); new widespread electrocardiographic ST-segment elevation and PR depression (≈25%-50%); a new or increased pericardial effusion that is most often small (≈60%); or a pericardial friction rub (&amp;lt;30%). In North America and Western Europe, the most common causes of acute pericarditis are idiopathic or viral, followed by pericarditis after cardiac procedures or operations. Tuberculosis is the most common cause in endemic areas and is treated with antituberculosis therapy, with corticosteroids considered for associated constrictive pericarditis. Treatment of acute idiopathic and pericarditis after cardiac procedures or operations involves use of high-dose nonsteroidal anti-inflammatory drugs (NSAIDs), with doses tapered once chest pain has resolved and C-reactive protein level has normalized, typically over several weeks. These patients should receive a 3-month course of colchicine to relieve symptoms and reduce the risk of recurrence (37.5% vs 16.7%; absolute risk reduction, 20.8%). With a first recurrence of pericarditis, colchicine should be continued for at least 6 months. Corticosteroids are often used if pericarditis does not improve with NSAIDs and colchicine. In certain patients with multiple recurrences, which can occur for several years, interleukin 1 (IL-1) blockers have demonstrated efficacy and may be preferred to corticosteroids.ConclusionsAcute pericarditis is a common cause of nonischemic chest pain. Tuberculosis is the leading cause of pericarditis in endemic areas and is treated with antitubercular therapy. In North America and Western Europe, pericarditis is typically idiopathic, develops after a viral infection, or develops following cardiac procedures or surgery. Treatment with NSAIDs and colchicine leads to a favorable prognosis in most patients, although 15% to 30% of patients develop recurrence. Patients with multiple recurrent pericarditis can have a disease duration of several years or more, are often treated with corticosteroids, and IL-1 blockers may be used for selected patients as steroid-sparing therapy.