bluuebunny/crossref_metadata_2025 huggingface dataset:
Impact of Siberian observations on the optimization of surface CO2 flux
Authors: Kim Jinwoong , Kim Hyun Mee , Cho Chun-Ho , Boo Kyung-On , Jacobson Andrew R. , Sasakawa Motoki , Machida Toshinobu , Arshinov Mikhail , Fedoseev Nikolay
Published: February 2016

Abstract. To investigate the effect of additional CO2 observations in the Siberia region on the Asian and global surface CO2 flux analyses, two experiments using different observation dataset were performed. One experiment was conducted using a data set that includes additional observations of Siberian tower measurements (Japan-Russia Siberian Tall Tower Inland Observation Network: JR-STATION), and the other experiment was conducted using a data set without the above additional observations. The results show that the global balance of the sources and sinks of surface CO2 fluxes was maintained for both experiments with and without the additional observations. While the magnitude of the optimized surface CO2 flux uptake in Siberia decreased, the magnitude of the optimized surface CO2 flux uptake in the other regions (e.g., Europe) of the Northern Hemisphere (NH) increased for the experiment with the additional observations. This change was mostly caused by changes in the magnitudes of surface CO2 flux in June and July. The observation impact measured by uncertainty reduction and self-sensitivity tests shows that additional observations provide useful information on the estimated surface CO2 flux. It is expected that the Siberian observations play an important role in estimating surface CO2 flux in the NH in the future.
Model-measurement comparison of functional group abundance in α-pinene and 1,3,5-trimethylbenzene secondary organic aerosol formation
Authors: Ruggeri G. , Bernhard F. A. , Henderson B. H. , Takahama S.
Published: February 2016

Abstract. Secondary organic aerosol (SOA) formed by α-pinene and 1,3,5-trimethylbenzene photooxidation under different NOx regimes is simulated using the Master Chemical Mechanism v3.2 (MCM) coupled with an absorptive gas/particle partitioning module. Vapor pressures for individual compounds are estimated with the SIMPOL.1 group contribution model for determining apportionment of reaction products to each phase. We apply chemoinformatic tools to harvest functional group (FG) composition from the simulations and estimate their contributions to the overall oxygen to carbon ratio. Furthermore, we compare FG abundances in simulated SOA to measurements of FGs reported in previous chamber studies using Fourier Transform Infrared Spectroscopy. These simulations qualitatively capture the dynamics of FG composition of SOA formed from both α-pinene and 1,3,5-trimethylbenzene in low NOx conditions, especially in the first hours after start of photooxidation. Higher discrepancies are found after several hours of simulation; the nature of these discrepancies indicate sources of uncertainty or types of reactions in the condensed or gas phase missing from current model implementation. Higher discrepancies are found in the case of α-pinene photooxidation under different NOx concentration regimes, which are reasoned through the domination by a few polyfunctional compounds that disproportionately impact the simulated FG abundance in the aerosol phase. This manuscript illustrates the usefulness of FG analysis to complement existing methods for model-measurement evaluation.
Characterization of “dead-zone” eddies in the tropical Northeast Atlantic Ocean
Authors: Schütte Florian , Karstensen Johannes , Krahmann Gerd , Hauss Helena , Fiedler Björn , Brandt Peter , Visbeck Martin , Körtzinger Arne
Published: February 2016

Abstract. Localized open-ocean low–oxygen dead-zones in the tropical Northeast Atlantic are recently discovered ocean features that can develop in dynamically isolated water masses within cyclonic eddies (CE) and anticyclonic modewater eddies (ACME). Analysis of a comprehensive oxygen dataset obtained from gliders, moorings, research vessels and Argo floats revealed that eddies with low oxygen concentrations at 50–150 m depths can be found in surprisingly high numbers and in a large area (from about 4°N to 22°N, from the shelf at the eastern boundary to 38°W). Minimum oxygen concentrations of about 9 µmol kg−1 in CEs and severely suboxic concentrations (< 1 µmol kg−1) in ACMEs were observed. In total, 173 profiles with oxygen concentrations below the minimum background concentration of 40 µmol kg−1 could be associated with 27 independent “dead-zone” eddies (10 CEs; 17 ACMEs) over a period of 10 years. The eddies’ oxygen minimum is located in the eddy core beneath the mixed layer at a mean depth of 80 m. Compared to the surrounding waters, the mean oxygen anomaly between 50 and 150 m depth for CEs (ACMEs) is −38 (−79) µmol kg−1. The low oxygen concentration right beneath the mixed layer has been attributed to the combination of high productivity in the eddies’ surface waters and the isolation of their cores with respect to lateral oxygen supply. Indeed, eddies of both types feature a cold sea surface temperature anomaly and enhanced chlorophyll concentrations in their center. The locally increased consumption within these eddies represents an essential part of the total consumption in the open tropical Northeast Atlantic Ocean and might be partly responsible for the formation of the shallow oxygen minimum zone. Eddies south of 12°N carry weak hydrographic anomalies in their cores and seem to be generated in the open ocean away from the boundary. North of 12°N, eddies of both types carry anomalously low salinity water of South Atlantic Central Water origin from the eastern boundary upwelling region into the open ocean. Water mass properties and satellite eddy tracking both point to an eddy generation near the eastern boundary.
Análisis de la sociedad de "Pa negre" (Agustí Villaronga, 2010) y los entornos rurales
Authors: Corral Rey Maria-Nieves
Published: February 2016

Este artículo se ha desarrollado con la intención de analizar cómo los estereotipos, los prejuicios y las mentiras pueden influir en la educación de los niños. Formación que suele provenir sobre todo de familia y profesores, quienes en ocasiones se mueven por ideologías extremistas. Existen múltiples ficciones en las que observamos estos arquetipos sociales, pero es el caso de la película Pa negre (Agustí Villaronga, 2010), donde el personaje principal evoluciona psicológicamente, a causa de lo que sus ojos observan y las ideas que le transmiten sobre su familia, en los entornos rurales, donde convive la tradición de los rumores.
Interpretación a lengua de signos en televisión. Estudio de recepción
Authors: Gil Sabroso Esther , Utray Francisco
Published: February 2016

Este artículo analiza las preferencias de las personas sordas signantes usuarias del servicio de interpretación a lengua de signos y las características con que los canales prestan este servicio en la televisión de difusión estatal en España. El objetivo es conocer si el modo en que se ofrece este servicio de accesibilidad se aproxima o difiere de las preferencias de sus usuarios. Se ha recogido la opinión sobre este servicio de personas sordas que utilizan como primera lengua para la comunicación la lengua de signos española. También se ha realizado un estudio de los programas signados emitidos durante una semana (10-16/marzo/2014). Los principales datos resultantes revelan que las personas sordas están insatisfechas con el horario de emisión de estos programas, demandan espacios informativos con lengua de signos, reclaman la presencia de signantes sordos y prefieren al intérprete como imagen principal. Con respecto al análisis de los programas, el estudio apunta que la mayoría de los programas signados se emiten durante la madrugada, están dirigidos al entretenimiento, los intérpretes son signantes oyentes y su figura se sitúa en una esquina de la pantalla.
The Relationship between Teaching Styles and Autonomy among Iranian Female EFL Teachers, Teaching at Advanced Levels
Authors: Baradaran Abdollah
Published: February 2016

The current research aimed at inspecting the existence of a significant relationship between teachers’ teaching styles and their Autonomy. For this reason, two questionnaires with regard to the main variables were given to 175 female English language teachers, teaching at advanced levels. Moreover, non-parametric Mann Whitney and Kruskal Wallis tests were selected to compare the levels of each style in terms of Autonomy scores. The results showed no significant correlation between the two variables.
The Difficulties Experienced in Teaching Proof to Prospective Mathematics Teachers: Academician Views
Authors: Güler Gürsel
Published: February 2016

The aim of this study is to examine the difficulties prospective mathematics teachers experience in mathematical proving, the courses in which they have difficulties in proving, the importance of proof in mathematics education and its functions in their professional lives. The data of the study was collected via semi-structured interviews with fifteen academicians who volunteered to take part in the study. Content analysis method was used to analyze the data obtained. As a result of the study, based the views of the academicians, it was seen that prospective mathematics teachers experience four different difficulties in proving. Besides, in line with the views of the academicians the following categories were formed: the courses that prospective teachers experience difficulty, the importance of proof in mathematics education and its functions in prospective teachers’ professional lives and these categories were presented with their subcategories.
Headmaster Instructional Leadership and Organizational Learning on the Quality of Madrasah and the Quality of Graduates the State Madrasah Aliyah at Jakarta Capital Region
Authors: Rosmaniar Widhyanti , Charil bin Hj. Marzuki Shahril
Published: February 2016

The purpose of this study is to look closely aspects of instructional leadership, and organizational learning affect the quality of madrasah in improving the quality of graduate the state madrasah aliyah. The experiment was conducted using a quantitative approach with descriptive and inferential methods, in inferential methods used correlation analysis and regression analysis. The process is first conducted analysis of data validity and reliability of data as well as test for normality using the Kolmogorov-Smirnov Test. The study population is the overall teacher the State Madrasah Aliyah at Jakarta Capital Region. The study sample size of 150 teachers. The collecting data about the instrument with research using Likert scale, to obtain data on instructional leadership, organizational learning, quality of madrassah and the quality of graduates. The results of research known that headmaster instructional leadership has a strong and positive relationship with the quality of the madrasah, the quality of graduates, organizational Learnings have strong relationships and positive impact on the quality of madrasah. The quality of graduates and have a reciprocal relationship with a high instructional leadership. It can be concluded that an increasing in the quality of madrasah and the quality of graduates at the school can be done with an increase in instructional leadership and organization of learning in the madrasah. Thus improvement instructional leadership and organizational learning have a positive influence on the improvement of the quality of madrasah and the achievement of the quality of graduates.
Music Confucius Institute: Evaluating Its Approach as an Agent for International Chinese Music Dissemination
Authors: Guo Wei , Li Sheng Bing
Published: February 2016

The paper identifies the educational and presentational functions of the Confucius Institute (MCI) at the Royal Danish Academy of Music (RDAM) as its core approaches which mostly influence Chinese cultural dissemination in its host country. The MCI’s utilization of the two dissemination approaches aligns with the “receiver-centered” framework introduced by Jiang and Zhang (2009), providing three concurrent strategies—Localization, “Entertainalization” and Regulation (LER)—in order to enhance the dissemination of Chinese culture to the general public. Through detailed analysis of somewhat limited pre-existing research findings and literature, this article makes the claim that the MCI has achieved positive results in its two functional domains, meeting its overseas audience’s needs at various levels whilst supporting Chinese cultural dissemination internationally. This article concludes on the prospect that more MCIs are expected to be established around the world in order to satisfy the growing needs of authentic studies in Chinese musical traditions without travelling to China, as well as to support Chinese cultural communication with the rest of the world.
Humanoid Head Face Mechanism with Expandable Facial Expressions
Authors: Asheber Wagshum Techane , Lin Chyi-Yeu , Yen Shih Hsiang
Published: February 2016

Recently a social robot for daily life activities is becoming more common. To this end a humanoid robot with realistic facial expression is a strong candidate for common chores. In this paper, the development of a humanoid face mechanism with a simplified system complexity to generate human like facial expression is presented. The distinctive feature of this face robot is the use of significantly fewer actuators. Only three servo motors for facial expressions and five for the rest of the head motions have been used. This leads to effectively low energy consumption, making it suitable for applications such as mobile humanoid robots. Moreover, the modular design makes it possible to have as many face appearances as needed on one structure. The mechanism allows expansion to generate more expressions without addition or alteration of components. The robot is also equipped with an audio system and camera inside each eyeball, consequently hearing and vision sensibility are utilized in localization, communication and enhancement of expression exposition processes.
Common surgery, uncommon complication
Authors: Akdeniz Hande , Ozer Kadri , Dikmen Adile , Kocer Ugur
Published: February 2016

Ingrown nail surgery is the one of the most common surgeries in outpatient clinics that are generally perfomed in response to patient complaints. Still, making simple observations, taking patient histories and conducting further tests are often neglected by outpatient clinics. Consequently, it is important to be aware if ingrown nail is associated with any underlying diseases that can lead to major complications.

In this article, we report on two cases ending in amputation that were performed with Winograd’s partial matrix excision procedure for ingrown nails. Such a complication is rare, unexpected, and most unwanted in forefoot surgery. After a detailed analysis of the situation, we discovered that both patients were smokers, and one of them had Buerger’s disease. These conditions led to the ingrown nails in addition to poor wound healing.

This case report emphasizes the fact that even when performing minor procedures, obtaining a detailed history and conducting an examination are of paramount importance. Patient selection is also a considerable factor, especially for patients who are smokers, who may experience a worst case surgical scenario.
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”.

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.
 
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<,008); mejora NOC a las 24 semanas (68.7% vs.10.1%,  p<,001). Indicadores “descripción justificación régimen terapéutico”; “actividad prescrita”; “beneficios del tratamiento” mejoran con p< ,001.

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.

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
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.

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.

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.
 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.
Alcohol dependence syndrome in emergency services: assessment protocol for the professional nursing practice
Authors: Villar Luis Margarita Antonia , Barbosa Sara Pinto , Luchesi Luciana Barizon , Ferreira Santos Jair Lício
Published: February 2016

Estudio cuantitativo exploratorio realizado en los servicios de urgencias del municipio de Ribeirão Preto, interior del Estado de São Paulo, Brasil.

El objetivo del estudio fue evaluar señales y síntomas del Síndrome de Abstinencia Alcohólica (SAA) por el equipo de enfermería, utilizando para esto un protocolo.

La colecta de datos se realizó durante 642 horas de turnos. De los 463 participantes, 297 presentaron AUDIT (Alcohol Use Disorders Identification Test) ≥7, de estos, 59 (12,7%) presentaban AUDIT ≥20, o sea, sugerente de SAA siendo, por esto, incluídos en esta investigación. En cuanto a las señales, de los 59 usuarios, 8 no sabían decir el tiempo de hospitalización, 7 no sabían en qué año o mes estaban, y 13 presentaban inquietud. En relación a los signos físicos de la dependencia, 17 presentaron signos de temblores, 8 refirieron convulsiones.

Los servicios de urgencias pueden ser lugares privilegiados para identificar síntomas de consumo abusivo y de dependencia del alcohol y la utilización del protocolo de evaluación de enfermería puede ser una estratégia útil en el seguimiento e intervención.
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.

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.

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.

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.
Deriving Bisimulation Congruences: 2-Categories vs. Precategories
Authors: Sassone Vladimiro , Sobocinski Pawel
Published: February 2016

G-relative pushouts (GRPOs) have recently been proposed by the authors as a new foundation for Leifer and Milner's approach to deriving labelled bisimulation congruences from reduction systems. This paper develops the theory of GRPOs further, arguing that they provide a simple and powerful basis towards a comprehensive solution. As an example, we construct GRPOs in a category of `bunches and wirings.' We then examine the approach based on Milner's precategories and Leifer's functorial reactive systems, and show that it can be recast in a much simpler way into the 2-categorical theory of GRPOs.
Fast Partial Evaluation of Pattern Matching in Strings
Authors: Ager Mads Sig , Danvy Olivier , Rohde Henning Korsholm
Published: February 2016

We show how to obtain all of Knuth, Morris, and Pratt's linear-time string matcher by partial evaluation of a quadratic-time string matcher with respect to a pattern string. Although it has been known for 15 years how to obtain this linear matcher by partial evaluation of a quadratic one, how to obtain it in linear time has remained an open problem.

Obtaining a linear matcher by partial evaluation of a quadratic one is achieved by performing its backtracking at specialization time and memoizing its results. We show (1) how to rewrite the source matcher such that its static intermediate computations can be shared at specialization time and (2) how to extend the memoization capabilities of a partial evaluator to static functions. Such an extended partial evaluator, if its memoization is implemented efficiently, specializes the rewritten source matcher in linear time.

Superseded by (BRICS-RS-03-20 and) BRICS-RS-04-40.
From Interpreter to Compiler and Virtual Machine: A Functional Derivation
Authors: Ager Mads Sig , Biernacki Dariusz , Danvy Olivier , Midtgaard Jan
Published: February 2016

We show how to derive a compiler and a virtual machine from a compositional interpreter. We first illustrate the derivation with two evaluation functions and two normalization functions. We obtain Krivine's machine, Felleisen et al.'s CEK machine, and a generalization of these machines performing strong normalization, which is new. We observe that several existing compilers and virtual machines--e.g., the Categorical Abstract Machine (CAM), Schmidt's VEC machine, and Leroy's Zinc abstract machine--are already in derived form and we present the corresponding interpreter for the CAM and the VEC machine. We also consider Hannan and Miller's CLS machine and Landin's SECD machine.

We derived Krivine's machine via a call-by-name CPS transformation and the CEK machine via a call-by-value CPS transformation. These two derivations hold both for an evaluation function and for a normalization function. They provide a non-trivial illustration of Reynolds's warning about the evaluation order of a meta-language.
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.
A Length-Flexible Threshold Cryptosystem with Applications
Authors: Damgård Ivan B. , Jurik Mads J.
Published: February 2016

We propose a public-key cryptosystem which is derived from the Paillier cryptosystem. The scheme inherits the attractive homomorphic properties of Paillier encryption. In addition, we achieve two new properties: First, all users can use the same modulus when generating key pairs, this allows more efficient proofs of relations between different encryptions. Second, we can construct a threshold decryption protocol for our scheme that is length flexible, i.e., it can handle efficiently messages of arbitrary length, even though the public key and the secret key shares held by decryption servers are of fixed size. We show how to apply this cryptosystem to build:

1) a self-tallying election scheme with perfect ballot secrecy. This is a small voting system where the result can be computed from the submitted votes without the need for decryption servers. The votes are kept secret unless the cryptosystem can be broken, regardless of the number of cheating parties. This is in contrast to other known schemes that usually require a number of decryption servers, the majority of which must be honest.

2) a length-flexible mix-net which is universally verifiable, where the size of keys and ciphertexts do not depend on the number of mix servers, and is robust against a corrupt minority. Mix-nets can provide anonymity by shuffling messages to provide a random permutation of input ciphertexts to the output plaintexts such that no one knows which plaintexts relate to which ciphertexts. The mix-net inherits several nice properties from the underlying cryptosystem, thus making it useful for a setting with small messages or high computational power, low-band width and that anyone can verify that the mix have been done correctly.
The Complexity of Checking Consistency of Pedigree Information and Related Problems
Authors: Aceto Luca , Hansen Jens Alsted , Ingólfsdóttir Anna , Johnsen Jacob , Knudsen John
Published: February 2016

Consistency checking is a fundamental computational problem in genetics. Given a pedigree and information on the genotypes (of some) of the individuals in it, the aim of consistency checking is to determine whether these data are consistent with the classic Mendelian laws of inheritance. This problem arose originally from the geneticists' need to filter their input data from erroneous information, and is well motivated from both a biological and a sociological viewpoint. This paper shows that consistency checking is NP-complete, even with focus on a single gene and in the presence of three alleles. Several other results on the computational complexity of problems from genetics that are related to consistency checking are also offered. In particular, it is shown that checking the consistency of pedigrees over two alleles, and of pedigrees without loops, can be done in polynomial time.
Static Analysis of XML Transformations in Java
Authors: Kirkegaard Christian , Møller Anders , Schwartzbach Michael I.
Published: February 2016

XML documents generated dynamically by programs are typically represented as text strings or DOM trees. This is a low-level approach for several reasons: 1) Traversing and modifying such structures can be tedious and error prone; 2) Although schema languages, e.g. DTD, allow classes of XML documents to be defined, there are generally no automatic mechanisms for statically checking that a program transforms from one class to another as intended. We introduce XACT, a high-level approach for Java using XML templates as a first-class data type with operations for manipulating XML values based on XPath. In addition to an efficient runtime representation, the data type permits static type checking using DTD schemas as types. By specifying schemas for the input and output of a program, our algorithm will statically verify that valid input data is always transformed into valid output data and that no errors occur during processing.
RS-2 Tagging, Encoding, and Jones Optimality
Authors: Danvy Olivier , López Pablo E. Martínez
Published: February 2016

A partial evaluator is said to be Jones-optimal if the result of specializing a self-interpreter with respect to a source program is textually identical to the source program, modulo renaming. Jones optimality has already been obtained if the self-interpreter is untyped. If the self-interpreter is typed, however, residual programs are cluttered with type tags. To obtain the original source program, these tags must be removed.

A number of sophisticated solutions have already been proposed. We observe, however, that with a simple representation shift, ordinary partial evaluation is already Jones-optimal, modulo an encoding. The representation shift amounts to reading the type tags as constructors for higher-order abstract syntax. We substantiate our observation by considering a typed self-interpreter whose input syntax is higher-order. Specializing this interpreter with respect to a source program yields a residual program that is textually identical to the source program, modulo renaming.
Fast Partial Evaluation of Pattern Matching in Strings
Authors: Ager Mads Sig , Danvy Olivier , Rohde Henning Korsholm
Published: February 2016

We show how to obtain all of Knuth, Morris, and Pratt's linear-time string matcher by partial evaluation of a quadratic-time string matcher with respect to a pattern string. Although it has been known for 15 years how to obtain this linear matcher by partial evaluation of a quadratic one, how to obtain it in linear time has remained an open problem.

Obtaining a linear matcher by partial evaluation of a quadratic one is achieved by performing its backtracking at specialization time and memoizing its results. We show (1) how to rewrite the source matcher such that its static intermediate computations can be shared at specialization time and (2) how to extend the memoization capabilities of a partial evaluator to static functions. Such an extended partial evaluator, if its memoization is implemented efficiently, specializes the rewritten source matcher in linear time.

Supersedes BRICS-RS-03-11 and is superseded by BRICS-RS-04-40.
From Interpreter to Logic Engine by Defunctionalization
Authors: Biernacki Dariusz , Danvy Olivier
Published: February 2016

Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied to the lambda-calculus. The key transformation here is Reynolds's defunctionalization that transforms a tail-recursive, continuation-passing interpreter into a transition system, i.e., an abstract machine. Similar denotational and operational semantics were studied by de Bruin and de Vink in previous work (their article at TAPSOFT 1989), and we compare their study with our derivation. Additionally, we present a direct-style interpreter of propositional Prolog expressed with control operators for delimited continuations.

Superseded by BRICS-RS-04-5.
CCS with Hennessy's Merge has no Finite Equational Axiomatization
Authors: Aceto Luca , Fokkink Willem Jan , Ingólfsdóttir Anna , Luttik Bas
Published: February 2016

This paper confirms a conjecture of Bergstra and Klop's from 1984 by establishing that the process algebra obtained by adding an auxiliary operator proposed by Hennessy in 1981 to the recursion free fragment of Milner's Calculus of Communicationg Systems is not finitely based modulo bisimulation equivalence. Thus Hennessy's merge cannot replace the left merge and communication merge operators proposed by Bergstra and Klop, at least if a finite axiomatization of parallel composition is desired.
Contracts for Cooperation between Web Service Programmers and HTML Designers
Authors: Böttger Henning , Møller Anders , Schwartzbach Michael I.
Published: February 2016

Interactive Web services consist of a mixture of HTML fragments and program code. The fragments, which are maintained by designers, are combined to form HTML pages that are shown to the clients. The code, which is maintained by programmers, is executed on the server to handle the business logic. Current Web service frameworks provide little help in separating these constituents, which complicates cooperation between programmers and HTML designers.

We propose a system based on XML templates and formalized contracts allowing a flexible separation of concerns. The contracts act as interfaces between the programmers and the HTML designers and permit tool support for statically checking that both parties fulfill their obligations. This ensures that (1) programmers and HTML designers work more independently focusing on their own expertises, (2) the Web service implementation is better structured and thus easier to develop and maintain, (3) it is guaranteed that only valid HTML is sent to the clients even though it is constructed dynamically, (4) the programmer uses the XML templates consistently, and (5) the form input fields being sent to the client always match the code receiving those values. Additionally, we describe tools that aid in the construction and management of contracts and XML templates.
A Formal Model for Trust in Dynamic Networks
Authors: Carbone Marco , Nielsen Mogens , Sassone Vladimiro
Published: February 2016

We propose a formal model of trust informed by the Global Computing scenario and focusing on the aspects of trust formation, evolution, and propagation. The model is based on a novel notion of trust structures which, building on concepts from trust management and domain theory, feature at the same time a trust and an information partial order.
A Denotational Account of Untyped Normalization by Evaluation
Authors: Filinski Andrzej , Rohde Henning Korsholm
Published: February 2016

We show that the standard normalization-by-evaluation construction for the simply-typed lambda_{beta eta}-calculus has a natural counterpart for the untyped lambda_beta-calculus, with the central type-indexed logical relation replaced by a "recursively defined'' invariant relation, in the style of Pitts. In fact, the construction can be seen as generalizing a computational-adequacy argument for an untyped, call-by-name language to normalization instead of evaluation.

In the untyped setting, not all terms have normal forms, so the normalization function is necessarily partial. We establish its correctness in the senses of soundness (the output term, if any, is beta-equivalent to the input term); standardization ( beta-equivalent terms are mapped to the same result); and completeness (the function is defined for all terms that do have normal forms). We also show how the semantic construction enables a simple yet formal correctness proof for the normalization algorithm, expressed as a functional program in an ML-like call-by-value language.
An Operational Foundation for Delimited Continuations
Authors: Biernacka Malgorzata , Biernacki Dariusz , Danvy Olivier
Published: February 2016

We derive an abstract machine that corresponds to a definitional interpreter for the control operators shift and reset. Based on this abstract machine, we construct a syntactic theory of delimited continuations.

Both the derivation and the construction scale to the family of control operators shift_n and reset_n. The definitional interpreter for shift_n and reset_n has n + 1 layers of continuations, the corresponding abstract machine has n + 1 layers of control stacks, and the corresponding syntactic theory has n + 1 layers of evaluation contexts.

See also BRICS-RS-05-24.
The Cell Probe Complexity of Succinct Data Structures
Authors: Gál Anna , Miltersen Peter Bro
Published: February 2016

In the cell probe model with word size 1 (the bit probe model), a static data structure problem is given by a map f : {0,1}^n * {0,1}^m -> {0,1}, where {0,1}^n is a set of possible data to be stored, {0,1}^m is a set of possible queries (for natural problems, we have m << n) and f(x,y) is the answer to question y about data x.

A solution is given by a representation phi : {0,1}^n -> {0,1}^s and a query algorithm q so that q(phi(x), y) = f(x,y). The time t of the query algorithm is the number of bits it reads in phi(x).

In this paper, we consider the case of succinct representations where s = n + r for some redundancy r << n. For a boolean version of the problem of polynomial evaluation with preprocessing of coefficients, we show a lower bound on the redundancy-query time trade-off of the form
(r + 1) t >= Omega(n/log n).
 In particular, for very small redundancies r, we get an almost optimal lower bound stating that the query algorithm has to inspect almost the entire data structure (up to a logarithmic factor). We show similar lower bounds for problems satisfying a certain combinatorial property of a coding theoretic flavor. Previously, no omega(m) lower bounds were known on t in the general model for explicit functions, even for very small redundancies.

By restricting our attention to systematic or index structures phi satisfying phi(x) = x · phi*(x) for some map phi* (where · denotes concatenation) we show similar lower bounds on the redundancy-query time trade-off for the natural data structuring problems of Prefix Sum and Substring Search.
Online On-the-Fly Testing of Real-time Systems
Authors: Mikucionis Marius , Larsen Kim G. , Nielsen Brian
Published: February 2016

In this paper we present a framework, an algorithm and a new tool for online testing of real-time systems based on symbolic techniques used in UPPAAL model checker. We extend UPPAAL timed automata network model to a test specification which is used to generate test primitives and to check the correctness of system responses including the timing aspects. We use timed trace inclusion as a conformance relation between system and specification to draw a test verdict. The test generation and execution algorithm is implemented as an extension to UPPAAL and experiments carried out to examine the correctness and performance of the tool. The experiment results are promising.
Pragmatics of Modular SOS
Authors: Mosses Peter D.
Published: February 2016

Modular SOS is a recently-developed variant of Plotkin's Structural Operational Semantics (SOS) framework. It has several pragmatic advantages over the original framework--the most significant being that rules specifying the semantics of individual language constructs can be given definitively, once and for all.

Modular SOS is being used for teaching operational semantics at the undergraduate level. For this purpose, the meta-notation for modular SOS rules has been made more user-friendly, and derivation of computations according to the rules is simulated using Prolog.

After giving an overview of the foundations of Modular SOS, this paper gives some illustrative examples of the use of the framework, and discusses various pragmatic aspects.
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.
Strong Privacy Protection in Electronic Voting
Authors: Groth Jens , Salomonsen Gorm
Published: February 2016

We give suggestions for protection against adversaries with access to the voter's equipment in voting schemes based on homomorphic encryption. Assuming an adversary has complete knowledge of the contents and computations taking place on the client machine we protect the voter's privacy in a way so that the adversary has no knowledge about the voter's choice. Furthermore, an active adversary trying to change a voter's ballot may do so, but will end up voting for a random candidate.

To accomplish the goal we assume that the voter has access to a secondary communication channel through which he can receive information inaccessible to the adversary. An example of such a secondary communication channel is ordinary mail. Additionally, we assume the existence of a trusted party that will assist in the protocol. To some extent, the actions of this trusted party are verifiable.
Maker-Maker and Maker-Breaker Games are PSPACE-Complete
Authors: Byskov Jesper Makholm
Published: February 2016

We show that the problems of deciding the outcome of Maker-Maker and Maker-Breaker games played on arbitrary hypergraphs are PSPACE-complete. Maker-Breaker games have earlier been shown PSPACE-complete by Schaefer (1978); we give a simpler proof and show a reduction from Maker-Maker games to Maker-Breaker games.
The Full Abstraction of the UC Framework
Authors: Almansa Jesús Fernando
Published: February 2016

Two different approaches for general protocol security are proved equivalent. Concretely, we prove that security in the Universal Composability framework (UC) is equivalent to security in the probabilistic polynomial time calculus ppc. Security is defined under active and adaptive adversaries with synchronous and authenticated communication. In detail, we define an encoding from machines in UC to processes in ppc and show UC is fully abstract in ppc, i.e., we show the soundness and completeness of security in ppc with respect to UC. However, we restrict security in ppc to be quantified not over all possible contexts, but over those induced by UC-environments under encoding. This result is not overly-restricting security in ppc, since the threat and communication models we assume are meaningful in both practice and theory.
Distributed Approximation of Fixed-Points in Trust Structures
Authors: Krukow Karl , Twigg Andrew
Published: February 2016

Recently, developments of sophisticated formal models of trust in large distributed environments, incorporate aspects of partial information, important e.g. in global-computing scenarios. Specifically, the framework based on the notion of trust structures, introduced by Carbone, Nielsen and Sassone, deals well with the aspect of partial information. The framework is ``denotational'' in the sense of giving meaning to the global trust-state as a unique, abstract mathematical object (the least fixed-point of a continuous function). We complement the denotational framework with ``operational'' techniques, addressing the practically important problem of approximating and computing the semantic objects. We show how to derive from the setting of the framework, a situation in which one may apply a well-established distributed algorithm, due to Bertsekas, in order to solve the problem of computation and approximation of least fixed-points of continuous functions on cpos. We introduce mild assumptions about trust structures, enabling us to derive two theoretically simple, but highly useful propositions (and their duals), which form the basis for efficient protocols for sound approximation of the least fixed-point. Finally, we give dynamic algorithms for safe reuse of information between computations, in face of dynamic trust-policy updates.
Computing Logarithms Digit-by-Digit
Authors: Goldberg Mayer
Published: February 2016

In this work, we present an algorithm for computing logarithms of positive real numbers, that bares structural resemblance to the elementary school algorithm of long division. Using this algorithm, we can compute successive digits of a logarithm using a 4-operation pocket calculator. The algorithm makes no use of Taylor series or calculus, but rather exploits properties of the radix-d representation of a logarithm in base d. As such, the algorithm is accessible to anyone familiar with the elementary properties of exponents and logarithms.
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
Authors: Brodal Gerth Stølting , Fagerberg Rolf , Meyer Ulrich , Zeh Norbert
Published: February 2016

We present improved cache-oblivious data structures and algorithms for breadth-first search (BFS) on undirected graphs and the single-source shortest path (SSSP) problem on undirected graphs with non-negative edge weights. For the SSSP problem, our result closes the performance gap between the currently best cache-aware algorithm and the cache-oblivious counterpart. Our cache-oblivious SSSP-algorithm takes nearly full advantage of block transfers for dense graphs. The algorithm relies on a new data structure, called bucket heap, which is the first cache-oblivious priority queue to efficiently support a weak DECREASEKEY operation. For the BFS problem, we reduce the number of I/Os for sparse graphs by a factor of nearly sqrt{B}, where B is the cache-block size, nearly closing the performance gap between the currently best cache-aware and cache-oblivious algorithms.