The benefits and pitfalls of language change – The case of gender-fair language use

Gender-fair language (GFL) is a symmetric linguistic treatment of women and men. To create GFL two principle strategies can be deployed. Neutralization means that gender-unmarked forms (police officer) are used to substitute the male-biased (policeman). Feminization, implies that feminine forms of nouns are used systematically to make female referents visible. The results of a comprehensive European research program provide evidence in support of a non-discrimination policy in language, yet identify the potential setbacks preventing linguistic reforms to be effective. In general, studies indicate positive effects of GFL. In an applied context, for example women feel more motivated to apply for the position if a job advertisement is formulated in a GFL. However, negative effects of reformed usage were also reported specifically when GFL is novel. For example, a woman referred to as a chairperson was evaluated lower in occupational status than a woman referred to as a chairman.

VISUAL MEMORY PROCESSING BY PRIMATES AND AVIANS IN A RELATIONAL TASK

Three rhesus monkeys (Macaca mulatta) and four pigeons (Columba livia) were trained in a visual serial probe recognition (SPR) task. A list of visual stimuli (slides) was presented sequentially to the subjects. Following the list and after a delay interval, a probe stimulus was presented that could be either from the list (Same) or not from the list (Different). The monkeys readily acquired a variable list length SPR task, while pigeons showed acquisition only under constant list length condition. However, monkeys memorized the responses to the probes (absolute strategy) when overtrained with the same lists and probes, while pigeons compared the probe to the list in memory (relational strategy). Performance of the pigeon on 4-items constant list length was disrupted when blocks of trials of different list lengths were imbedded between the 4-items blocks. Serial position curves for recognition at variable probe delays showed better relative performance on the last items of the list at short delays (0-0.5 seconds) and better relative performance on the initial items of the list at long delays (6-10 seconds for the pigeons and 20-30 seconds for the monkeys and a human adolescent). The serial position curves also showed reliable primacy and recency effects at intermediate probe delays. The monkeys showed evidence of using a relational strategy in the variable probe delay task. The results are the first demonstration of relational serial probe recognition performance in an avian and suggest similar underlying dynamic recognition memory mechanisms in primates and avians. ^

Yoga off the mat: How far and to whom do the benefits extend?

At least 15 million American adults have participated in yoga at least once in their lifetime (Saper, Eisenberg, Davis, Culpepper, & Phillips, 2004). The field of yoga research is relatively new in the United States, and the majority of studies have concentrated on yoga's effect on measures of physiology (cardiovascular disease, diabetes, obesity) or psychological measures of stress and anxiety. This review attempted to identify studies that had been conducted measuring a different set of outcome measures, specifically violence, trauma, eating, and other behavioral disorders. In 9 of 10 studies reviewed, researchers observed statistically significant effects of yoga interventions. Effects were most evident within multifaceted studies that combined intensive yoga practice with group discussion and training. Only one group (Mitchell, Mazzeo, Rausch, & Cooke, 2007) failed to observe any significant differences between yoga practice groups and control groups. Effects were seen in both sexes, although a majority of the studies were aimed specifically at women. All studies were limited by small sample size and lack of follow-up data. Future research should seek to increase sample size, to diversify recruitment to allow for the randomization of treatment and control groups, and to allow for long-term follow-up.^

Charity care and community benefits by hospital type in Texas

Hospital care is the largest component of the health care sector. This industry is made up of for profit hospital (FPH) organizations, not for profit (NFP) hospitals, and government (GOV) run hospital facilities. Objectives of this analysis were: (a) to conduct a literature review on NFP hospital legislation at the state level in Texas and at the federal level in the broader U.S.; and (b) to describe the types of charity care and community benefits currently being provided: by NFP hospitals compared to FPH hospitals and GOV hospitals; by hospitals geographic proximity to the Texas-Mexico border; and by hospital community type (rural, suburban, and urban); and (c) propose specific policy changes that may be needed to improve the current Texas State statute. Methods. In describing the historical and current policy context of NFP hospital legislation in the United States, federal legislation was reviewed from 1913 to the present and Texas State legislation was reviewed from 1980 to the present. In describing the provision of charity care, data from the 2008 Annual Cooperative Hospital Survey were examined by hospital organizational type, size, proximity to the border, and community type using linear regression and chi-squared tests to assess differences in charity care and community benefits. Results. The data included 123 NFP hospitals, 114 GOV hospitals, and 123 FPH. Results. Small sized (p<0.001) and medium sized (p<0.001) NFP hospitals provide a greater percent of total charity care when compared to FPH hospitals and to both GOV and FPH hospitals respectively; however, no significant difference in total charity care was found among large sized NFP hospitals when compared to FPH hospitals alone (p=.345) and both GOV and FPH facilities (p=.214). The amount of charity care provided was not found to be different based on proximity to the border or community type. Community benefit planning and budgeting was found to be similar regardless of community type and proximity to the border. Conclusion. No differences in charity care in Texas were found for large sized NFP hospitals compared to FPH and GOV hospitals. Contrary to widely held beliefs, this study did not find the border region to provide a greater amount of charity care or bad debt. Charity care also did not vary by community type. These findings underscore the need for continued collection of transparent data from all hospitals in order to provide policy makers and consumers with information on utilization trends to ensure benefits are being provided to the community. Policy changes or revoking tax-benefits may occur as charity care utilization declines with the implementation of health reform in the next few years.^

Volunteering: Demographic characteristics, motives and potential benefits from service

Volunteering is intricately woven into the fabric of our society. In 2009 alone, approximately 63.4 million Americans participated in volunteer activities, collectively donating over 8.1 billion service-hours (Corporation for National and Community Service [CNCS], 2010). Each service-hour is determined by the U.S. Bureau of Labor Statistics (2010) to be valued at $20.85/hr which translates to a national savings of $169 billion. Thus, we can clearly observe the significance of volunteer contribution to the overall benefit of society. In addition, there is now evidence that voluntary service may also benefit the actual volunteer, especially individuals who are 65+ years. As we reach 2020 this elderly class, composed of nearly 13 million (CNCS, 2010) Americans, will be of much consequence. Their potential to contribute in community-related efforts may save the U.S. billions in labor costs, and may also help reduce healthcare-related expenditures if volunteering proves to be a protective factor. In this literature review, we set out to explore the potential relationship between volunteer participation and increased mental and physical wellness. We also examined volunteer demographic characteristics and common motives for engaging in service-related activities. Analysis showed that volunteer work often combined low-impact physical activity and mental satisfaction from serving others, resulting in overall health benefit. Demographic characteristics displayed were consistent with previous studies and found that a majority of volunteers were female, White, married status, having received college degree or higher, employed, middle-high SES. In addition, age was seen to be a key characteristic in forecasting volunteer motivation and self-reported perceived health benefits.^

Program evaluation for a summer science internship: Short and long term benefits as reported by interns

Undergraduate research programs have been used as a tool to attract and retain student interest in science careers. This study evaluates the short and long-term benefits of a Summer Science Internship (SSI) at the University of Texas Health Science Center at Houston– School of Public Health – in Brownsville, Texas, by analyzing survey data from alumni. Questions assessing short-term program impact were aimed at three main topics, student: satisfaction with program, self-efficacy for science after completing the program, and perceived benefits. Long-term program impact was assessed by looking at student school attendance and college majors along with perceived links between SSI and future college plans. Students reported high program satisfaction, a significant increase in science self-efficacy and high perceived benefits. At the time data were collected for the study, one-hundred percent of alumni were enrolled in school (high school or college). The majority of students indicated they were interested in completing a science major/career, heavily influenced by their participation in the program.^

Exploring the Benefits of a Parent Partner Mentoring Program in Child Welfare

Parent partner mentoring programs are an innovative strategy for child welfare agencies to engage families in case planning and service delivery. These programs recruit and train parents who have been involved in the system and have successfully resolved identified child abuse or neglect issues to work with families with current open cases in the child welfare system. Parent partner mentors can provide social and emotional support, advocacy, and practical advice for navigating this challenging system. Insofar as parent partners share similar experiences, and cultural and socioeconomic characteristics of families, they may be more successful in engaging families and building trusting supportive relationships. The current study presents qualitative data from interviews and case studies of families who were matched with a parent partner in a large county in a Midwestern state. Interviews with families, parent partner mentors, child welfare agency staff, and community partners and providers suggest that parent partner programs may be just as beneficial for parent partner mentors as they are for families being mentored. These programs can build professional skills, help improve self-esteem, provide an avenue for social support, and may potentially prevent recidivism. Parent Partner programs also provide a mechanism for amplifying family voice at all levels of the agency.

Relational and Allegorical Semantics for Constraint Logic Programming

El cálculo de relaciones binarias fue creado por De Morgan en 1860 para ser posteriormente desarrollado en gran medida por Peirce y Schröder. Tarski, Givant, Freyd y Scedrov demostraron que las álgebras relacionales son capaces de formalizar la lógica de primer orden, la lógica de orden superior así como la teoría de conjuntos. A partir de los resultados matemáticos de Tarski y Freyd, esta tesis desarrolla semánticas denotacionales y operacionales para la programación lógica con restricciones usando el álgebra relacional como base. La idea principal es la utilización del concepto de semántica ejecutable, semánticas cuya característica principal es el que la ejecución es posible utilizando el razonamiento estándar del universo semántico, este caso, razonamiento ecuacional. En el caso de este trabajo, se muestra que las álgebras relacionales distributivas con un operador de punto fijo capturan toda la teoría y metateoría estándar de la programación lógica con restricciones incluyendo los árboles utilizados en la búsqueda de demostraciones. La mayor parte de técnicas de optimización de programas, evaluación parcial e interpretación abstracta pueden ser llevadas a cabo utilizando las semánticas aquí presentadas. La demostración de la corrección de la implementación resulta extremadamente sencilla. En la primera parte de la tesis, un programa lógico con restricciones es traducido a un conjunto de términos relacionales. La interpretación estándar en la teoría de conjuntos de dichas relaciones coincide con la semántica estándar para CLP. Las consultas contra el programa traducido son llevadas a cabo mediante la reescritura de relaciones. Para concluir la primera parte, se demuestra la corrección y equivalencia operacional de esta nueva semántica, así como se define un algoritmo de unificación mediante la reescritura de relaciones. La segunda parte de la tesis desarrolla una semántica para la programación lógica con restricciones usando la teoría de alegorías—versión categórica del álgebra de relaciones—de Freyd. Para ello, se definen dos nuevos conceptos de Categoría Regular de Lawvere y _-Alegoría, en las cuales es posible interpretar un programa lógico. La ventaja fundamental que el enfoque categórico aporta es la definición de una máquina categórica que mejora e sistema de reescritura presentado en la primera parte. Gracias al uso de relaciones tabulares, la máquina modela la ejecución eficiente sin salir de un marco estrictamente formal. Utilizando la reescritura de diagramas, se define un algoritmo para el cálculo de pullbacks en Categorías Regulares de Lawvere. Los dominios de las tabulaciones aportan información sobre la utilización de memoria y variable libres, mientras que el estado compartido queda capturado por los diagramas. La especificación de la máquina induce la derivación formal de un juego de instrucciones eficiente. El marco categórico aporta otras importantes ventajas, como la posibilidad de incorporar tipos de datos algebraicos, funciones y otras extensiones a Prolog, a la vez que se conserva el carácter 100% declarativo de nuestra semántica. ABSTRACT The calculus of binary relations was introduced by De Morgan in 1860, to be greatly developed by Peirce and Schröder, as well as many others in the twentieth century. Using different formulations of relational structures, Tarski, Givant, Freyd, and Scedrov have shown how relation algebras can provide a variable-free way of formalizing first order logic, higher order logic and set theory, among other formal systems. Building on those mathematical results, we develop denotational and operational semantics for Constraint Logic Programming using relation algebra. The idea of executable semantics plays a fundamental role in this work, both as a philosophical and technical foundation. We call a semantics executable when program execution can be carried out using the regular theory and tools that define the semantic universe. Throughout this work, the use of pure algebraic reasoning is the basis of denotational and operational results, eliminating all the classical non-equational meta-theory associated to traditional semantics for Logic Programming. All algebraic reasoning, including execution, is performed in an algebraic way, to the point we could state that the denotational semantics of a CLP program is directly executable. Techniques like optimization, partial evaluation and abstract interpretation find a natural place in our algebraic models. Other properties, like correctness of the implementation or program transformation are easy to check, as they are carried out using instances of the general equational theory. In the first part of the work, we translate Constraint Logic Programs to binary relations in a modified version of the distributive relation algebras used by Tarski. Execution is carried out by a rewriting system. We prove adequacy and operational equivalence of the semantics. In the second part of the work, the relation algebraic approach is improved by using allegory theory, a categorical version of the algebra of relations developed by Freyd and Scedrov. The use of allegories lifts the semantics to typed relations, which capture the number of logical variables used by a predicate or program state in a declarative way. A logic program is interpreted in a _-allegory, which is in turn generated from a new notion of Regular Lawvere Category. As in the untyped case, program translation coincides with program interpretation. Thus, we develop a categorical machine directly from the semantics. The machine is based on relation composition, with a pullback calculation algorithm at its core. The algorithm is defined with the help of a notion of diagram rewriting. In this operational interpretation, types represent information about memory allocation and the execution mechanism is more efficient, thanks to the faithful representation of shared state by categorical projections. We finish the work by illustrating how the categorical semantics allows the incorporation into Prolog of constructs typical of Functional Programming, like abstract data types, and strict and lazy functions.

Benefits of using a Wendland Kernel for free-surface flows

The aim of this paper Is lo discuss the influence of the selection of the interpolation kernel in the accuracy of the modeling of the internal viscous dissipation in Tree surface Hows, Simulations corresponding to a standing wave* for which an analytic solution available, are presented. Wendland and renormalized Gaussian kernels are considered. The differences in the flow pattern* and Internal dissipation mechanisms are documented for a range of Reynolds numbers. It is shown that the simulations with Wendland kernels replicate the dissipation mechanisms more accurately than those with a renormalized Gaussian kernel. Although some explanations are hinted we have Tailed to clarify which the core structural reasons for Mich differences are*

Approximate Relational Reasoning for Probabilistic Programs

La seguridad verificada es una metodología para demostrar propiedades de seguridad de los sistemas informáticos que se destaca por las altas garantías de corrección que provee. Los sistemas informáticos se modelan como programas probabilísticos y para probar que verifican una determinada propiedad de seguridad se utilizan técnicas rigurosas basadas en modelos matemáticos de los programas. En particular, la seguridad verificada promueve el uso de demostradores de teoremas interactivos o automáticos para construir demostraciones completamente formales cuya corrección es certificada mecánicamente (por ordenador). La seguridad verificada demostró ser una técnica muy efectiva para razonar sobre diversas nociones de seguridad en el área de criptografía. Sin embargo, no ha podido cubrir un importante conjunto de nociones de seguridad “aproximada”. La característica distintiva de estas nociones de seguridad es que se expresan como una condición de “similitud” entre las distribuciones de salida de dos programas probabilísticos y esta similitud se cuantifica usando alguna noción de distancia entre distribuciones de probabilidad. Este conjunto incluye destacadas nociones de seguridad de diversas áreas como la minería de datos privados, el análisis de flujo de información y la criptografía. Ejemplos representativos de estas nociones de seguridad son la indiferenciabilidad, que permite reemplazar un componente idealizado de un sistema por una implementación concreta (sin alterar significativamente sus propiedades de seguridad), o la privacidad diferencial, una noción de privacidad que ha recibido mucha atención en los últimos años y tiene como objetivo evitar la publicación datos confidenciales en la minería de datos. La falta de técnicas rigurosas que permitan verificar formalmente este tipo de propiedades constituye un notable problema abierto que tiene que ser abordado. En esta tesis introducimos varias lógicas de programa quantitativas para razonar sobre esta clase de propiedades de seguridad. Nuestra principal contribución teórica es una versión quantitativa de una lógica de Hoare relacional para programas probabilísticos. Las pruebas de correción de estas lógicas son completamente formalizadas en el asistente de pruebas Coq. Desarrollamos, además, una herramienta para razonar sobre propiedades de programas a través de estas lógicas extendiendo CertiCrypt, un framework para verificar pruebas de criptografía en Coq. Confirmamos la efectividad y aplicabilidad de nuestra metodología construyendo pruebas certificadas por ordendor de varios sistemas cuyo análisis estaba fuera del alcance de la seguridad verificada. Esto incluye, entre otros, una meta-construcción para diseñar funciones de hash “seguras” sobre curvas elípticas y algoritmos diferencialmente privados para varios problemas de optimización combinatoria de la literatura reciente. ABSTRACT The verified security methodology is an emerging approach to build high assurance proofs about security properties of computer systems. Computer systems are modeled as probabilistic programs and one relies on rigorous program semantics techniques to prove that they comply with a given security goal. In particular, it advocates the use of interactive theorem provers or automated provers to build fully formal machine-checked versions of these security proofs. The verified security methodology has proved successful in modeling and reasoning about several standard security notions in the area of cryptography. However, it has fallen short of covering an important class of approximate, quantitative security notions. The distinguishing characteristic of this class of security notions is that they are stated as a “similarity” condition between the output distributions of two probabilistic programs, and this similarity is quantified using some notion of distance between probability distributions. This class comprises prominent security notions from multiple areas such as private data analysis, information flow analysis and cryptography. These include, for instance, indifferentiability, which enables securely replacing an idealized component of system with a concrete implementation, and differential privacy, a notion of privacy-preserving data mining that has received a great deal of attention in the last few years. The lack of rigorous techniques for verifying these properties is thus an important problem that needs to be addressed. In this dissertation we introduce several quantitative program logics to reason about this class of security notions. Our main theoretical contribution is, in particular, a quantitative variant of a full-fledged relational Hoare logic for probabilistic programs. The soundness of these logics is fully formalized in the Coq proof-assistant and tool support is also available through an extension of CertiCrypt, a framework to verify cryptographic proofs in Coq. We validate the applicability of our approach by building fully machine-checked proofs for several systems that were out of the reach of the verified security methodology. These comprise, among others, a construction to build “safe” hash functions into elliptic curves and differentially private algorithms for several combinatorial optimization problems from the recent literature.

Cognitive reserve benefits brain efficiency in healthy aging

The concept of cognitive reserve (CR) describes the mind’s resistance to the progressive damage of the brain and probably this can be reflected as the ability to recruit brain networks in an effective way. It is as- sociated with the abilityto copewith the deleterious effects of brain damage,brain degeneration, or age-related changes on cognitive performance.

Quality of bus services performance: benefits of real time passenger information systems

One of the main problems in urban areas is the steady growth in car ownership and traffic levels. Therefore, the challenge of sustainability is focused on a shift of the demand for mobility from cars to collective means of transport. For this purpose, buses are a key element of the public transport systems. In this respect Real Time Passenger Information (RTPI) systems help people change their travel behaviour towards more sustainable transport modes. This paper provides an assessment methodology which evaluates how RTPI systems improve the quality of bus services performance in two European cities, Madrid and Bremerhaven. In the case of Madrid, bus punctuality has increased by 3%. Regarding the travellers perception, Madrid raised its quality of service by 6% while Bremerhaven increased by 13%. On the other hand, the users¿ perception of Public Transport (PT) image increased by 14%.