bluuebunny/crossref_metadata_2025_split huggingface dataset:
Therapeutic management of users with oral anticoagulant therapy
Authors: Cascalho Serra Isaura da Conceição , Ribeiro Lurdes da Conceição Afonso Nobre , Gemito Maria Laurência Grou Parreirinha , Mendes Felismina Rosa Parreira 
Published: February 2016

Objetivo: Caracterizar a los usuarios con terapia anticoagulante oral; conocer el régimen de tratamiento y estimar los costes de evaluación de la International Normalized Ratio (INR). <br /><br />Metodologia: Estudio descriptivo, transversal, exploratorio, con 83 usuarios con terapia anticoagulante oral de un Centro de Salud de Alentejo. Los datos fueron recolectados con la aplicación de cuestionario construido para este fin. <br /><br />Resultados: Se concluyó que 50,6% informaron no saber qué es la coagulación; 49,4% lo que son anticoagulantes orales; 63,9% las complicaciones de la terapia anticoagulante oral. 27,7% conoce los alimentos que interfieren con esta terapia y 51,8% declara saber qué hacer en caso de lesión, cirugía o de la extracción de un diente. El costo de la evaluación de RNI (Razón Normalizada Internacional) en laboratorio es mayor que en los centros de salud. <br /><br />Conclusiones: Existen lagunas en el conocimiento sobre el proceso de coagulación, la interferencia de alimentación y el régimen. La descentralización de la consulta de enfermería puede reducir los costos, mejorar la accesibilidad y la gestión del régimen terapéutico.<br /><br />
Cuidados de enfermería basados en evidencia y modelo de Betty Neuman, para controlar estresores del entorno que pueden ocasionar delirium en unidad de cuidados intensivos
Authors: Gómez Tovar Luz Omaira , Díaz Suárez Leticia , Cortés Muñoz Fabián 
Published: February 2016

Antecedentes: El Delirium es una alteración del estado de conciencia, frecuente en las unidades de cuidado intensivo. En la UCI adultos del Hospital Universitario de Neiva se tiene una incidencia del 28%, esto aumenta la morbimortalidad; sin embargo es prevenible y requiere intervención. <br /><br />Objetivo: Determinar la efectividad de los cuidados aplicados, según la Guía de enfermería elaborada con evidencia y en base al Modelo de Betty Neuman, para controlar estresores del entorno que pueden ocasionar Delirium, en pacientes hospitalizados en la unidad de cuidados intensivos adulto.<br /><br />Metodología: Se realizó un estudio cuantitativo, transversal, pre-experimental, donde se aplicó la Guía de cuidados de enfermería a 49 pacientes. Se utilizó el diseño de preprueba y postprueba para conocer la percepción que tenían los pacientes de los estresores del entorno.<br /><br />Resultados: Los cuidados aplicados según la Guía propuesta, fueron efectivos, ya que previnieron el delirium en el 94% de los pacientes, sólo tres presentaron el evento, representando una incidencia acumulada de 6.12 casos X 100 pacientes intervenidos (IC 95%: 1.67 – 16.1), evidenciado en la curva de Kaplan–Meier. La prueba de hipótesis de proporciones (Z0.05= -1.65) indica que la presencia de delirium es significativamente menor a la de 2011 (28%). <br /><br />Conclusiones: Los cuidados aplicados según la Guía propuesta, lograron prevenir la aparición de delirium en 94% de los pacientes a pesar de sus antecedentes de factores de riesgo desencadenantes de delirium. De tal forma que, al minimizar la presencia de estresores del entorno, se favorece un ambiente creado agradable y familiar, y se constituye en un cuidado de enfermería fundamental para la prevención de delirium en UCI. <br /><br />
Vantagens da presença da família numa reanimação pediátrica ou em procedimentos dolorosos
Authors: Vaz Judite , Alves Rita , Gomes Ramos Vera Lúcia 
Published: February 2016

Introducción: La presencia de los padres o de otros familiares ante la prestación de procedimientos dolorosos para el niño, así como en la reanimación pediátrica, ha provocado discusión entre profesionales de la salud, por las ventajas y desventajas que presenta. <br /><br />Objetivo: Teniendo en cuenta este problema, el objetivo de esta investigación consiste en identificar estudios científicos orientados a las ventajas de la presencia de los familiares en la sala de reanimación y/o en procedimientos dolorosos. <br /><br />Método: Fue realizada una revisión sistemática de la literatura con la siguiente pregunta de investigación: ¿Cuáles son las ventajas de la presencia de la familia en la sala de reanimación y/o procedimientos dolorosos? <br /><br />Resultados: Todos los artículos identifican ventajas de la presencia de la familia en la sala de reanimación y/o procedimientos dolorosos. <br /><br />Conclusiones: La investigación favorece el debate y la reflexión entre el equipo multidisciplinar sobre la presencia de los familiares de los niños frente a procedimientos dolorosos o reanimación. Sin embargo, a fin de que este proceso sea factible, es necesaria la formación y capacitación de todo el equipo de salud, para que puedan estar disponibles para explicar los procedimientos a los familiares y acompañarlos en todo el proceso.<br /><br />
On converting CNF to DNF
Authors: Miltersen Peter Bro , Radhakrishnan Jaikumar , Wegener Ingo 
Published: February 2016

We study how big the blow-up in size can be when one switches between the CNF and DNF representations of boolean functions. For a function f : {0,1}^n -> {0,1}, cnfsize(f) denotes the minimum number of clauses in a CNF for f; similarly, dnfsize(f) denotes the minimum number of terms in a DNF for f. For 0 <= m <= 2^{n-1} , let dnfsize(m,n) be the maximum dnfsize(f) for a function f : {0,1}^n -> {0,1} with cnfsize(f) <= m. We show that there are constants c_1, c_2 >= 1 and epsilon > 0 , such that for all large n and all m in [ 1/epsilon n , 2^{epsilon n}], we have <br />2^{(n - c_1) n / log(m/n)} <= dnfsize(m,n) <= 2^{(n - c_2) n / log(m/n)}.<br /> In particular, when m is the polynomial n^c, we get dnfsize(n^c,n) = 2^{(n - theta) (c^{-1} n / log n)}.
On the Adaptiveness of Quicksort
Authors: Brodal Gerth Stølting , Fagerberg Rolf , Moruz Gabriel 
Published: February 2016

Quicksort was first introduced in 1961 by Hoare. Many variants have been developed, the best of which are among the fastest generic sorting algorithms available, as testified by the choice of Quicksort as the default sorting algorithm in most programming libraries. Some sorting algorithms are adaptive, i.e. they have a complexity analysis which is better for inputs which are nearly sorted, according to some specified measure of presortedness. Quicksort is not among these, as it uses Omega(n log n) comparisons even when the input is already sorted. However, in this paper we demonstrate empirically that the actual running time of Quicksort <em>is</em> adaptive with respect to the presortedness measure Inv. Differences close to a factor of two are observed between instances with low and high Inv value. We then show that for the randomized version of Quicksort, the number of element <em>swaps</em> performed is <em>provably</em> adaptive with respect to the measure Inv. More precisely, we prove that randomized Quicksort performs expected O(n (1 + log (1 + Inv/n))) element swaps, where Inv denotes the number of inversions in the input sequence. This result provides a theoretical explanation for the observed behavior, and gives new insights on the behavior of the Quicksort algorithm. We also give some empirical results on the adaptive behavior of Heapsort and Mergesort.
A Temporal-Logic Approach to Binding-Time Analysis
Authors: Davies Rowan 
Published: February 2016

<p>The Curry-Howard isomorphism identifies proofs with typed lambda-<br />calculus terms, and correspondingly identifies propositions with<br />types. We show how this isomorphism can be extended to relate<br />constructive temporal logic with binding-time analysis. In particular,<br />we show how to extend the Curry-Howard isomorphism<br />to include the ("next") operator from linear-time temporal<br />logic. This yields the simply typed lambda-calculus which we prove<br />to be equivalent to a multi-level binding-time analysis like those<br />used in partial evaluation.</p><p><br />Keywords: Curry-Howard isomorphism, partial evaluation, binding-time analysis, temporal logic.</p>
On a Question of Arto Salomaa: The Equational Theory of Regular Expressions over a Singleton Alphabet is not Finitely Based
Authors: Aceto Luca , Fokkink Willem Jan , Ingólfsdóttir Anna 
Published: February 2016

<p>Salomaa ((1969) Theory of Automata, page 143) asked whether the equational theory of regular expressions over a singleton alphabet has a finite equational base. In this paper, we provide a negative answer to this long standing question. The proof of our main result rests upon a model-theoretic argument. For every finite collection of equations, that are sound in the algebra of regular expressions over a singleton alphabet, we build a model in which some valid regular equation fails. The construction of the model mimics the one used by Conway ((1971) Regular Algebra and Finite Machines, page 105) in his proof of a result, originally due to Redko, to the effect that infinitely many equations are needed to axiomatize equality of regular expressions. Our analysis of the model, however, needs to be more refined than the one provided by Conway ibidem.</p><p>AMS Subject Classification (1991): 08A70, 03C05, 68Q45, 68Q68,<br />68Q70.<br />CR Subject Classification (1991): D.3.1, F.1.1, F.4.1.<br />Keywords and Phrases: Regular expressions, equational logic, complete axiomatizations.</p><p> </p>
Statistical Secrecy and Multi-Bit Commitments
Authors: Damgård Ivan B. , Pedersen Torben P. , Pfitzmann Birgit 
Published: February 2016

<p>We present and compare definitions of the notion of "statistically<br />hiding" protocols, and we propose a novel statistically hiding commitment<br />scheme. Informally, a protocol statistically hides a secret if a<br />computationally unlimited adversary who conducts the protocol with<br />the owner of the secret learns almost nothing about it. One definition<br />is based on the L1-norm distance between probability distributions,<br />the other on information theory. We prove that the two definitions are<br />essentially equivalent. For completeness, we also show that statistical<br />counterparts of definitions of computational secrecy are essentially<br />equivalent to our main definitions. Commitment schemes are an important<br /> cryptologic primitive. Their purpose is to commit one party to a certain value,<br /> while hiding this value from the other party until some later time.<br /> We present a statistically<br />hiding commitment scheme allowing commitment to many<br />bits. The commitment and reveal protocols of this scheme are constant<br />round, and the size of a commitment is independent of the number of<br />bits committed to. This also holds for the total communication complexity,<br />except of course for the bits needed to send the secret when it<br />is revealed. The proof of the hiding property exploits the equivalence<br />of the two definitions.</p><p>Index terms -- Cryptology, Shannon theory, unconditional security,<br />statistically hiding, multi-bit commitment, similarity of ensembles<br />of distributions, zero-knowledge, protocols.</p><p> </p>
Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Zero-Knowledge be for Free?
Authors: Cramer Ronald , Damgård Ivan B. 
Published: February 2016

We present zero-knowledge proofs and arguments for arithmetic circuits over finite prime fields, namely given a circuit, show in zero-knowledge that inputs can be selected leading to a given output. For a field GF(q), where q is an n-bit prime, a<br />circuit of size O(n), and error probability 2^−n, our protocols require communication of O(n^2) bits. This is the same worst-cast complexity as the trivial (non zero-knowledge)<br />interactive proof where the prover just reveals the input values. If the circuit involves n multiplications, the best previously known methods would in general require communication<br />of Omega(n^3 log n) bits.<br />Variations of the technique behind these protocols lead to other interesting applications.<br />We first look at the Boolean Circuit Satisfiability problem and give zero-knowledge proofs and arguments for a circuit of size n and error probability 2^−n in which there is an interactive preprocessing phase requiring communication of O(n^2)<br />bits. In this phase, the statement to be proved later need not be known. Later the prover can non-interactively prove any circuit he wants, i.e. by sending only one message, of size O(n) bits.<br />As a second application, we show that Shamirs (Shens) interactive proof system for the (IP-complete) QBF problem can be transformed to a zero-knowledge proof<br />system with the same asymptotic communication complexity and number of rounds. The security of our protocols can be based on any one-way group homomorphism with a particular set of properties. We give examples of special assumptions sufficient for this, including: the RSA assumption, hardness of discrete log in a prime order group, and polynomial security of Die-Hellman encryption. We note that the constants involved in our asymptotic complexities are small enough for our protocols to be practical with realistic choices of parameters.
Generating Hard Tautologies Using Predicate Logic and the Symmetric Group
Authors: Riis Søren , Sitharam Meera 
Published: February 2016

We introduce methods to generate uniform families of hard propositional tautologies. The tautologies are essentially generated from a single propositional formula by a natural action of the symmetric group Sn.<br />The basic idea is that any Second Order Existential sentence Psi can be systematically translated into a conjunction phi of a finite collection of clauses such that the models of size n of an appropriate Skolemization Psi~ are in one-to-one correspondence with the satisfying assignments to phi_n: the Sn-closure of phi, under a natural action of the symmetric group Sn. Each phi_n is a CNF and thus has depth at most 2. The size of the phi_n's is bounded by a polynomial in n. Under the assumption NEXPTIME |= co- NEXPTIME, for any such sequence phi_n for which the spectrum S := {n : phi_n satisfiable} is NEXPTIME-complete, the tautologies not phi_(n not in S) do not have polynomial length proofs in any propositional proof system.<br /> Our translation method shows that most sequences of tautologies being studied in propositional proof complexity can be systematically generated from Second Order Existential sentences and moreover, many natural mathematical statements can be converted into sequences of propositional tautologies in this manner.<br /> We also discuss algebraic proof complexity issues for such sequences of tautologies. To this end, we show that any Second Order Existential sentence Psi can be systematically translated into a finite collection of polynomial equations Q = 0 such that the models of size n of an appropriate skolemization Psi~ are in one-to-one correspondence with the solutions to Qn = 0: the Sn-closure of Q = 0, under a natural action of the symmetric group Sn. The degree of Qn is the same as that of Q, and hence is independent of n, and the number of variables is no more than a polynomial in n. Furthermore, using results in [19] and [20], we briefly describe how, for the corresponding sequences of tautologies phi_n, the rich structure of the Sn closed, uniformly generated, algebraic systems Qn has profound consequences on the algebraic proof complexity of phi_n.
A Complexity Gap for Tree-Resolution
Authors: Riis Søren 
Published: February 2016

<p>It is shown that any sequence psi_n of tautologies which expresses the<br />validity of a fixed combinatorial principle either is "easy" i.e. has polynomial<br />size tree-resolution proofs or is "difficult" i.e requires exponential<br />size tree-resolution proofs. It is shown that the class of tautologies which<br />are hard (for tree-resolution) is identical to the class of tautologies which<br />are based on combinatorial principles which are violated for infinite sets.<br />Actually it is shown that the gap-phenomena is valid for tautologies based<br />on infinite mathematical theories (i.e. not just based on a single proposition).<br />We clarify the link between translating combinatorial principles (or<br />more general statements from predicate logic) and the recent idea of using<br /> the symmetrical group to generate problems of propositional logic.<br />Finally, we show that it is undecidable whether a sequence psi_n (of the<br />kind we consider) has polynomial size tree-resolution proofs or requires<br />exponential size tree-resolution proofs. Also we show that the degree of<br />the polynomial in the polynomial size (in case it exists) is non-recursive,<br />but semi-decidable.</p><p>Keywords: Logical aspects of Complexity, Propositional proof complexity,<br />Resolution proofs.</p><p> </p>
Foundational and Mathematical Uses of Higher Types
Authors: Kohlenbach Ulrich 
Published: February 2016

In this paper we develop mathematically strong systems of analysis in<br />higher types which, nevertheless, are proof-theoretically weak, i.e. conservative<br />over elementary resp. primitive recursive arithmetic. These systems<br />are based on non-collapsing hierarchies (Phi_n-WKL+, Psi_n-WKL+) of principles<br />which generalize (and for n = 0 coincide with) the so-called `weak' K¨onig's<br />lemma WKL (which has been studied extensively in the context of second order<br />arithmetic) to logically more complex tree predicates. Whereas the second<br />order context used in the program of reverse mathematics requires an encoding<br />of higher analytical concepts like continuous functions F : X -> Y between<br />Polish spaces X, Y , the more flexible language of our systems allows to treat<br />such objects directly. This is of relevance as the encoding of F used in reverse<br />mathematics tacitly yields a constructively enriched notion of continuous functions<br />which e.g. for F : N^N -> N can be seen (in our higher order context) to be equivalent<br /> to the existence of a continuous modulus of pointwise continuity.<br />For the direct representation of F the existence of such a modulus is<br />independent even of full arithmetic in all finite types E-PA^omega plus quantifier-free<br />choice, as we show using a priority construction due to L. Harrington.<br />The usual WKL-based proofs of properties of F given in reverse mathematics<br />make use of the enrichment provided by codes of F, and WKL does not seem<br />to be sufficient to obtain similar results for the direct representation of F in<br />our setting. However, it turns out that Psi_1-WKL+ is sufficient.<br />Our conservation results for (Phi_n-WKL+, Psi_n-WKL+) are proved via a new<br />elimination result for a strong non-standard principle of uniform Sigma^0_1-<br />boundedness<br />which we introduced in 1996 and which implies the WKL-extensions studied<br />in this paper.
Language-Based Caching of Dynamically Generated HTML
Authors: Brabrand Claus , Møller Anders , Olesen Steffan , Schwartzbach Michael I. 
Published: February 2016

<p>Increasingly, HTML documents are dynamically generated by interactive Web<br />services. To ensure that the client is presented with the newest versions of such<br />documents it is customary to disable client caching causing a seemingly inevitable performance penalty. In the <bigwig> system, dynamic HTML documents are composed of higher-order templates that are plugged together to construct complete documents. We show how to exploit this feature to provide an automatic fine-grained caching of document templates, based on the service source code. A <bigwig> service transmits not the full HTML document but instead a compact JavaScript recipe for a client-side construction of the document based on a static collection of fragments that can be cached by the browser in the usual manner. We compare our approach with related techniques and demonstrate on a number of realistic benchmarks that the size of the transmitted data and the latency may be reduced significantly.</p>
Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting
Authors: Pagh Rasmus , Pagter Jakob 
Published: February 2016

<p>We study the fundamental problem of sorting n integers of w bits on a unit-cost RAM with word size w, and in particular consider the time-space trade-off (product of time and space in bits) for this problem. For comparison-based algorithms, the time-space complexity is known to be Theta(n^2). A result of Beame shows that the lower bound also holds for non-comparison-based algorithms, but no algorithm has met this for time below the comparison-based <br />Omega(n lg n) lower bound. </p><p>We show that if sorting within some time bound T~ is possible, then time T = O(T~ + n lg* n) can be achieved with high probability using space S = O(n^2/T + w), which is optimal. Given a deterministic priority queue using amortized<br />time t(n) per operation and space n^O(1), we provide a deterministic<br />algorithm sorting in time T = O(n (t(n) + lg* n)) with S = O(n^2/T+w). Both results require that w <= n^(1-Omega(1)).</p><p>Using existing priority queues and sorting algorithms, this implies<br />that we can deterministically sort time-space optimally in time Theta(T) for T >= n(lg lg n)^2, and with high probability for T >= n lg lg n.</p><p>Our results imply that recent lower bounds for deciding element distinctness in o(n lg n) time are nearly tight.</p>
On the Number of Quasi-Kernels in Digraphs
Authors: Gutin Gregory , Koh Khee Meng , Tay Eng Guan , Yeo Anders 
Published: February 2016

<p>A vertex set X of a digraph D = (V,A) is a kernel if X is independent<br /> (i.e., all pairs of distinct vertices of X are non-adjacent) and for<br />every v in V − X there exists x in X such that vx in A. A vertex set<br />X of a digraph D = (V,A) is a quasi-kernel if X is independent and<br />for every v in V − X there exist w in V − X, x in X such that either<br />vx in A or vw,wx in A: In 1994, Chvatal and Lovasz proved that every<br />digraph has a quasi-kernel. In 1996, Jacob and Meyniel proved that, <br />if a digraph D has no kernel, then D contains at least three quasi-kernels.</p><p>We characterize digraphs with exactly one and two quasi-kernels, and,<br />thus, provide necessary and sufficient conditions for a digraph to have<br />at least three quasi-kernels. In particular, we prove that every strong<br />digraph of order at least three, which is not a 4-cycle, has at least<br />three quasi-kernels. We conjecture that every digraph with no sink<br />has a pair of disjoint quasi-kernels and provide some support to this<br />conjecture.</p>
Solving the String Statistics Problem in Time O(n log n)
Authors: Brodal Gerth Stølting , Lyngsø Rune B. , Östlin Anna , Pedersen Christian N. S. 
Published: February 2016

The string statistics problem consists of preprocessing a string of length n such that given a query pattern of length m, the maximum number of non-overlapping occurrences of the query pattern in the string can be reported efficiently. Apostolico and Preparata introduced the minimal augmented suffix tree (MAST) as a data structure for the string statistics problem, and showed how to construct the MAST in time O(n log^2 n) and how it supports queries in time O(m) for constant sized alphabets. A subsequent theorem by Fraenkel and Simpson stating that a string has at most a linear number of distinct squares implies that the MAST requires space O(n). In this paper we improve the construction time for the MAST to O(n log n) by extending the algorithm of Apostolico and Preparata to exploit properties of efficient joining and splitting of search trees together with a refined analysis.