bluuebunny/crossref_metadata_2025_split huggingface dataset:
Evaluación del impacto de un plan de cuidados de enfermería de pacientes con EPOC con diagnóstico enfermero “Manejo inefectivo del régimen terapéutico”, en términos de mejora del criterio de resultado de enfermería (NOC) “Conocimiento del régimen terapeut
Authors: Iniesta Sánchez Javier , Abad Corpa Eva , Royo Morales Tania , Sáez Soto Ángeles Del Rosario , Rodríguez Mondéjar Juan José , Carrillo Alcaraz Andrés 
Published: February 2016

Objetivo: Conocer el impacto en el “Conocimiento del régimen terapéutico”, en pacientes con un plan de cuidados sobre “Manejo inefectivo del régimen terapéutico”. <br /><br />Método: Estudio cuasiexperimental, en dos Hospitales Generales Universitarios (junio 2007 - diciembre 2008) pacientes con EPOC. Grupo intervención: plan de cuidados desarrollado mediante taxonomías; grupo control: asistencia hospitalaria habitual.<br /> <br />Resultados: 143 pacientes incluidos en el estudio (grupo intervención=56; grupo control =87). Mejora NOC a las 2 semanas (69.2% intervención vs. 10,7% control; p&lt;,008); mejora NOC a las 24 semanas (68.7% vs.10.1%, p&lt;,001). Indicadores “descripción justificación régimen terapéutico”; “actividad prescrita”; “beneficios del tratamiento” mejoran con p&lt; ,001. <br /><br />Conclusiones: La implementación de un plan de cuidados dirigido al alta orientado al incremento del NOC mejora el manejo del régimen terapéutico.<br /><br />Implicaciones para la práctica: La implementación de taxonomías en planificación de cuidados orientados al alta constituyen una herramienta para evaluar resultados de las intervenciones enfermeras y su evolución<br /><br />
Análisis de los componentes principales de la escala Satisfacción laboral (S20-23) medida en una muestra del equipo de enfermería de Centros de Atención Primaria de las Provincias de Ñuble y Valparaíso, Chile
Authors: Luengo Martinez Carolina Elena , Lara Jaque Roxana , López Espinoza Miguel Ángel 
Published: February 2016

Objetivo Evaluar las propiedades psicométricas de la escala de Satisfacción laboral (S-23) aplicada al equipo de enfermería de Centros de Atención Primaria. <br /><br />Metodología. Estudio transversal (validación local), con una muestra de 277 integrantes del equipo de enfermería pertenecientes a 27 Centros Atención Primaria de la Provincia Ñuble y Valparaíso, Chile. Se aplicó el cuestionario que mide Satisfacción laboral de 23 ítems (SL-23). Se utilizó análisis factorial exploratorio (Componentes principales) con rotación Varimax. La consistencia interna se evaluó con alfa de Cronbach. Se usó SPSS. <br /><br />Resultados. La versión original (SL-23) presentó un 64,22% de varianza y dos ítems con cargas factoriales con comportamientos erráticos dentro del cuestionario, optándose por eliminarlos. Con la versión abreviada (21 ítems), se encontró un 65,716% de varianza total y fiabilidad global del 0,922.<br /> Conclusión. Se sugiere considerar la versión abreviada del cuestionario para ser aplicada a los integrantes del equipo de enfermería por presentar mejores propiedades psicométricas que la versión original. <br /><br />
Brote de Leishmaniasis en la Comunidad Autónoma de Madrid. Importancia de las medidas de prevención
Authors: Pérez Roldán Francisca , Montilla Pérez Manuel , Muñoz Lomas Fernando 
Published: February 2016

Objetivo: Conocer el origen del brote de Leishmaniasis producido en 2009-2014 en la Comunidad Autónoma de Madrid (C.A.M.) y dar a conocer las pautas de prevención.<br /><br />Metodología: Se realizó una revisión bibliográfica a través de varias bases de datos utilizando diferentes descriptores relacionados con el brote de Leishmaniasis en la C.A.M. acontecido entre 2009 -2014.<br /><br />Resultados: Se obtuvieron un total de 177 estudios sobre Leishmaniasis, de los cuales 29 estudios analizan aspectos relevantes sobre la Leishmaniasis. Los estudios afirman que la modificación por el ser humano de los grandes paisajes verdes y el avance en la construcción de nuevas autovías y redes de cercanías junto con las condiciones climáticas podrían haber sido relevantes para explicar el comportamiento espacial del brote, contribuyendo a la creación de un ecosistema favorable para la proliferación y estabilización de un nuevo ciclo urbano de Leishmaniasis. La única medida de prevención eficaz es actuar de forma adecuada para evitar la picadura del mosquito.<br /><br />Conclusiones: Cabe destacar que para la creación de un nuevo ciclo urbano de Leishmaniasis podrían haber contribuido factores relevantes como el crecimiento poblacional, la presencia de grandes espacios verdes de reciente construcción periurbana y la construcción de extensas infraestructuras de ferrocarril y carreteras. Aunque se ha trabajado de forma activa y conjunta desde las Autoridades Sanitarias y han disminuido el número de casos, el problema no se ha erradicado, por tanto juega un papel muy importante la difusión y aplicación de las medidas preventivas, siendo esencial que la población conozca cómo debe actuar.<br /><br />
A Semantic Theory for Value-Passing Processes Based on the Late Approach
Authors: Ingólfsdóttir Anna 
Published: February 2016

A general class of languages for value-passing calculi based on the late semantic approach is defined and a concrete instantiation of the general syntax is given. This is a modification of the standard CCS according to the late approach. Three kinds of semantics are given for this language. First a Plotkin style operational semantics by means of an applicative labelled transition system is introduced. This is a modification of the standard labelled transition system that caters for value-passing according to the late approach. As an abstraction, late bisimulation preorder is given. Then a general class of denotational models for the late semantics is defined. A denotational model for the concrete language is given as an instantiation of the general class. Two equationally based proof systems are defined. The first one, which is value-finitary, i. e. only reasons about a finite number of values at each time, is shown to be sound and complete with respect to this model. The second proof system, a value-infinitary one, is shown to be sound with respect to the model, whereas the completeness is proven later. The operational and the denotational semantics are compared and it is shown that the bisimulation preorder is finer than the preorder induced by the denotational model. We also show that in general the omega-bisimulation preorder is strictly included in the model induced preorder. Finally a value-finitary version of the bisimulation preorder is defined and the full abstractness of the denotational model with respect to it is shown. It is also shown that for CCS_L the omega -bisimulation preorder coincides with the preorder induced by the model. From this we can conclude that if we allow for parameterized recursion in our language, we may express processes which coincide in any algebraic domain but are distinguished by the omega-bisimulation. This shows that if we extend CCS_L in this way we obtain a strictly more expressive language.
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge
Authors: Aceto Luca , Fokkink Willem Jan , Ingólfsdóttir Anna , Luttik Bas 
Published: February 2016

This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981 to the recursion free fragment of Milner's Calculus of Communicating Systems. Thus the addition of a single binary operation, viz. Hennessy's merge, is sufficient for the finite equational axiomatization of parallel composition modulo this non-interleaving equivalence. This result is in sharp contrast to a theorem previously obtained by the same authors to the effect that the same language is not finitely based modulo bisimulation equivalence.
An Interface Theory for Input/Output Automata
Authors: Larsen Kim G. , Nyman Ulrik , Wasowski Andrzej 
Published: February 2016

Building on the theory of interface automata by de Alfaro and Henzinger we design an interface language for Lynch's Input/Output Automata, a popular formalism used in the development of distributed asynchronous systems, not addressed by previous interface research. We introduce an explicit separation of assumptions from guarantees not yet seen in other behavioral interface theories. Moreover we derive the composition operator systematically and formally, guaranteeing that the resulting compositions are always the weakest in the sense of assumptions, and the strongest in the sense of guarantees. We also present a method for solving systems of relativized behavioral inequalities as used in our setup and draw a formal correspondence between our work and interface automata. Proofs are provided in an appendix.
Tables should be sorted (on random access machines)
Authors: Fich Faith , Miltersen Peter Bro 
Published: February 2016

We consider the problem of storing an n element subset S of a universe<br />of size m, so that membership queries (is x in S?) can be answered<br />efficiently. The model of computation is a random access machine with<br />the standard instruction set (direct and indirect addressing, conditional<br />branching, addition, subtraction, and multiplication). We show that if s<br />memory registers are used to store S, where n <= s <= m/n^epsilon, then query<br />time Omega(log n) is necessary in the worst case. That is, under these conditions,<br />the solution consisting of storing S as a sorted table and doing<br />binary search is optimal. The condition s <= m/n^epsilon is essentially optimal;<br />we show that if n + m/n^o(1) registers may be used, query time o(log n) is<br />possible.
Axiomatizing Prefix Iteration with Silent Steps
Authors: Aceto Luca , Fokkink Willem Jan , Glabbeek Rob J. van , Ingólfsdóttir Anna 
Published: February 2016

<p>Prefix iteration is a variation on the original binary version of the Kleene star operation P*Q, obtained by restricting the first argument to be an atomic action. The interaction of prefix iteration with silent steps is studied in the setting of Milner's basic CCS. Complete equational axiomatizations are given for four notions of behavioural congruence over basic CCS with prefix iteration, viz. branching congruence, eta-congruence, delay congruence and weak congruence. The completeness proofs for eta-, delay, and weak congruence are obtained by reduction to the completeness theorem for branching congruence. It is also argued that the use of the completeness result for branching congruence in obtaining the completeness result for weak congruence leads to a considerable simplification with respect to the only direct proof presented in the literature. The preliminaries and the completeness proofs focus on open terms, i.e. terms that may contain process variables. As a by-product, the omega-completeness of the axiomatizations is obtained as well as their completeness for closed terms.</p><p> </p><p>AMS Subject Classification (1991): 68Q10, 68Q40, 68Q55.<br />CR Subject Classification (1991): D.3.1, F.1.2, F.3.2.<br />Keywords and Phrases: Concurrency, process algebra, basic CCS, prefix iteration, branching bisimulation, eta-bisimulation, delay bisimulation, weak bisimulation, equational logic, complete axiomatizations.</p>
Presheaf Models for the pi-Calculus
Authors: Cattani Gian Luca , Stark Ian , Winskel Glynn 
Published: February 2016

<p>Recent work has shown that presheaf categories provide a general model of concurrency, with an inbuilt notion of bisimulation based on open maps. Here it is shown how this approach can also handle systems where the language of actions may change dynamically as a process evolves. The example is the pi-calculus, a calculus for `mobile processes' whose communication topology varies as channels are created and discarded. A denotational semantics is described for the pi-calculus within an indexed category of profunctors; the model is fully abstract for bisimilarity, in the sense that bisimulation in the model, obtained from open maps, coincides with the usual bisimulation obtained from the operational semantics of the pi-calculus. While attention is concentrated on the `late' semantics of the pi-calculus, it is indicated how the `early' and other variants can also be captured.</p><p> </p><p>A version of this paper appears in Category Theory and Computer Science: Proceedings of the 7th International Conference CTCS '97, Lecture Notes in Computer Science 1290. Springer-Verlag, September 1997.</p>
Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure
Authors: Danvy Olivier , Schultz Ulrik P. 
Published: February 2016

<p>Lambda-lifting a functional program transforms it into a set of recursive<br />equations. We present the symmetric transformation: lambda-dropping.<br />Lambda-dropping a set of recursive equations restores block<br />structure and lexical scope.<br />For lack of scope, recursive equations must carry around all the<br />parameters that any of their callees might possibly need. Both lambda-lifting<br />and lambda-dropping thus require one to compute a transitive<br />closure over the call graph:</p><p>- for lambda-lifting: to establish the Def/Use path of each free<br />variable (these free variables are then added as parameters to<br />each of the functions in the call path);</p><p>- for lambda-dropping: to establish the Def/Use path of each parameter<br />(parameters whose use occurs in the same scope as their<br />definition do not need to be passed along in the call path).<br />Without free variables, a program is scope-insensitive. Its blocks are<br />then free to float (for lambda-lifting) or to sink (for lambda-dropping)<br />along the vertices of the scope tree.</p><p><br />We believe lambda-lifting and lambda-dropping are interesting per<br />se, both in principle and in practice, but our prime application is partial<br />evaluation: except for Malmkjær and Ørbæk's case study presented at<br />PEPM'95, most polyvariant specializers for procedural programs operate<br />on recursive equations. To this end, in a pre-processing phase,<br />they lambda-lift source programs into recursive equations. As a result,<br />residual programs are also expressed as recursive equations, often with<br />dozens of parameters, which most compilers do not handle efficiently.<br />Lambda-dropping in a post-processing phase restores their block structure<br />and lexical scope thereby significantly reducing both the compile<br />time and the run time of residual programs.<br /><br /></p><p> </p>
Optimal Time-Space Trade-Offs for Sorting
Authors: Pagter Jakob , Rauhe Theis 
Published: February 2016

We study the fundamental problem of sorting in a sequential model of computation and in particular consider the time-space trade-off (product of time and space) for this problem.<br />Beame has shown a lower bound of Omega(n^2) for this product leaving a gap of a logarithmic factor up to the previously best known upper bound of O(n^2 log n) due to Frederickson. Since then, no progress has been made towards tightening this gap.<br />The main contribution of this paper is a comparison based sorting algorithm which closes this gap by meeting the lower bound of Beame. The time-space product O(n^2) upper bound holds for the full range of space bounds between log n and n/log n. Hence in this range our algorithm is optimal for comparison based models as well as for the very powerful general models considered by Beame.
Formatting Strings in ML
Authors: Danvy Olivier 
Published: February 2016

A string-formatting function such as printf in C seemingly requires dependent types, because its control string specifies the rest of its arguments.<br /> <br />Examples:<dl compact="compact"><dt></dt><dd><tt> printf ("Hello world.\n");</tt> <br /><tt>printf (" The %s is %d.\n", "answer", 42);</tt></dd></dl>We show how changing the representation of the control string makes it possible to program printf in ML (which does not allow dependent types). The result is well typed and perceptibly more efficient than the corresponding library functions in Standard ML of New Jersey and in Caml.<br /><br />P.S. See also BRICS-RS-98-12
An Expressive Extension of TLC
Authors: Henriksen Jesper G. 
Published: February 2016

A temporal logic of causality (TLC) was introduced by Alur, Penczek<br />and Peled in [1]. It is basically a linear time temporal logic<br />interpreted over Mazurkiewicz traces which allows quantification over<br />causal chains. Through this device one can directly formulate causality<br />properties of distributed systems. In this paper we consider an<br />extension of TLC by strengthening the chain quantification operators.<br />We show that our logic TLC adds to the expressive power of TLC.<br />We do so by defining an Ehrenfeucht-Fraissé game to capture the expressive<br /> power of TLC. We then exhibit a property and by means of<br />this game prove that the chosen property is not definable in TLC. We<br />then show that the same property is definable in TLC. We prove in<br />fact the stronger result that TLC is expressively stronger than TLC<br />exactly when the dependence relation associated with the underlying<br />trace alphabet is not transitive.
Linear Time Recognition of P4-Indifferent Graphs
Authors: Rizzi Romeo 
Published: February 2016

<p>A simple graph is P4-indifferent if it admits a total order < on<br />its nodes such that every chordless path with nodes a, b, c, d and edges<br />ab, bc, cd has a < b < c < d or a > b > c > d. P4-indifferent graphs generalize<br /> indifferent graphs and are perfectly orderable. Recently, Hoang,<br />Maray and Noy gave a characterization of P4-indifferent graphs in<br />terms of forbidden induced subgraphs. We clarify their proof and describe<br /> a linear time algorithm to recognize P4-indifferent graphs. When<br />the input is a P4-indifferent graph, then the algorithm computes an order < as above.</p><p>Key words: P4-indifference, linear time, recognition, modular decomposition.</p><p> </p>
Checking for Open Bisimilarity in the pi-Calculus
Authors: Frendrup Ulrik , Jensen Jesper Nyholm 
Published: February 2016

<p>This paper deals with algorithmic checking of open bisimilarity in the pi-calculus. Most bisimulation checking algorithms are based on the partition refinement approach. Unfortunately the definition of open bisimulation does not permit us to use a partition refinement approach for open bisimulation checking directly, but in the paper 'A Partition Refinement Algorithm for the pi-Calculus' Marco Pistore and Davide Sangiorgi present an iterative method that makes it possible to check for open bisimilarity using partition refinement. We have implemented the algorithm presented by Marco Pistore and Davide Sangiorgi. Furthermore,<br />we have optimized this algorithm and implemented this optimized algorithm. The time-complexity of this algorithm is the same as the time-complexity for the first algorithm, but performance tests have shown that in many cases the running time of the optimized algorithm is shorter than the running time of the first algorithm. Our implementation of the optimized open bisimulation checker algorithm and a user interface have been integrated in a system called the OBC Workbench.The source code and a manual for it is available from http://www.cs.auc.dk/research/FS/ny/PR-pi/.</p>
Chromatic Number in Time O(2.4023^n) Using Maximal Independent Sets
Authors: Byskov Jesper Makholm 
Published: February 2016

In this paper we improve an algorithm by Eppstein (2001) for finding the chromatic number of a graph. We modify the algorithm slightly, and by using a bound on the number of maximal independent sets of size k from our recent paper (2003), we prove that the running time is O(2.4023^n). Eppstein's algorithm runs in time O(2.4150^n). The space usage for both algorithms is O(2^n).
Wii i Trige Et projekt om Wii, motivation og ældres træning.
Authors: Aarhus Rikke , Cedergren Anni , Grönvall Erik , Hald Anja Elgaard , Larsen Simon Bo , Moesgaard Tine , Wollsen Susanne 
Published: February 2016

Projektet Wii i Trige (feb.-juli 2009) blev igangsat i forbindelse med Konsortiet for Brugerdreven Sundhedsinnovations arbejde med ældre og teknologi. Undersøgelsen har haft fokus på ældres anvendelse af Nintendo Wii, samt på hvorvidt computerspil med fysisk interaktion kan motivere og bidrage til vedligeholdelsestræning og genoptræning på et lokalcenter. Projektet er gennemført af ansatte fra Lokalcenter Bjørnshøj, Datalogisk Institut og Alexandra Instituttet.<br />
Proceedings of Designing Self-care for Everyday Life. Workshop in conjunction with NordiCHI 2014, 27th October.
Authors: Verdezoto Nervo , Nunes Francisco , Grönvall Erik , Fitzpatrick Geraldine , Storni Cristiano , Kyng Morten 
Published: February 2016

<p>Managing chronic conditions can be challenging. People in such conditions, and the people around them, have to, for example: deal with symptoms, adapt to the resulting disability, manage emotions, and change habits to keep the condition under control. Self-care technologies have the potential to support self-care, however they often disregard the complexity of the settings in which they are used and fail to become integrated in everyday life.</p><p>The present collection of papers forms the Proceedings of the Workshop “Designing Selfcare for Everyday Life” conducted last October 27th, 2014 in Helsinki, where 14 participants from 7 different countries spent the day discussing how to design self-care technologies that are in harmony with people’s everyday life. During the morning, discussions were driven by poster presentations focused on the participants’ work. In the afternoon, we engaged in a<br />participatory design exercise focused on the self-care of Parkinson’s disease. Our discussions were driven by the experience of two people living with Parkinson’s that participated in our workshop. At the end of the exercise, each group presented the different insights, concepts and problems that each patient experiences in their everyday life with the disease. Last, we all engaged in a broader discussion with a mapping exercise of issues and challenges in relation to self-care.</p><p>The contributions featured in the proceedings have been peer-reviewed by the members of the Workshop Program Committee and selected on the basis of their quality, alignment with the workshop theme, and the extent (and diversity) of their backgrounds in design. They express points of view of researchers from both Academia and Industry and provide relevant insights in the design and development use of technologies for self-care.</p><p>We want to thank all the participants and co-authors for contributing to the Workshop. We are particularly grateful to the two patients, members of the Finnish Parkinson’s Association, who accepted to participate in the workshop and enabled researchers to get a<br />perspective on the challenges of their lives. We also want to thank all the Programme Committee members for all their work during the reviewing process as well as the organisers of NordiCHI 2014 for providing useful facilities.</p>