Does survey recall error explain the Deaton–Paxson puzzle?

Using recall and diary food expenditure data from Canada, we compare estimates of the household size elasticity of per capita food expenditure. In contrast to Gibson (2002), we find negative elasticities in both recall and diary data. This in turn means we find evidence of the “Deaton–Paxson puzzle” in both diary and recall data. Recall error cannot be the sole explanation of the puzzle

A Computational Interpretation of Context-Free Expressions

We phrase parsing with context-free expressions as a type inhabitation problem where values are parse trees and types are context-free expressions. We first show how containment among context-free and regular expressions can be reduced to a reachability problem by using a canonical representation of states. The proofs-as-programs principle yields a computational interpretation of the reachability problem in terms of a coercion that transforms the parse tree for a context-free expression into a parse tree for a regular expression. It also yields a partial coercion from regular parse trees to context-free ones. The partial coercion from the trivial language of all words to a context-free expression corresponds to a predictive parser for the expression

Linear Parsing Expression Grammars

PEGs were formalized by Ford in 2004, and have several pragmatic operators (such as ordered choice and unlimited lookahead) for better expressing modern programming language syntax. Since these operators are not explicitly defined in the classic formal language theory, it is significant and still challenging to argue PEGs' expressiveness in the context of formal language theory.Since PEGs are relatively new, there are several unsolved problems.One of the problems is revealing a subclass of PEGs that is equivalent to DFAs. This allows application of some techniques from the theory of regular grammar to PEGs. In this paper, we define Linear PEGs (LPEGs), a subclass of PEGs that is equivalent to DFAs. Surprisingly, LPEGs are formalized by only excluding some patterns of recursive nonterminal in PEGs, and include the full set of ordered choice, unlimited lookahead, and greedy repetition, which are characteristic of PEGs. Although the conversion judgement of parsing expressions into DFAs is undecidable in general, the formalism of LPEGs allows for a syntactical judgement of parsing expressions.Comment: Parsing expression grammars, Boolean finite automata, Packrat parsin

The Magic Number Problem for Subregular Language Families

We investigate the magic number problem, that is, the question whether there exists a minimal n-state nondeterministic finite automaton (NFA) whose equivalent minimal deterministic finite automaton (DFA) has alpha states, for all n and alpha satisfying n less or equal to alpha less or equal to exp(2,n). A number alpha not satisfying this condition is called a magic number (for n). It was shown in [11] that no magic numbers exist for general regular languages, while in [5] trivial and non-trivial magic numbers for unary regular languages were identified. We obtain similar results for automata accepting subregular languages like, for example, combinational languages, star-free, prefix-, suffix-, and infix-closed languages, and prefix-, suffix-, and infix-free languages, showing that there are only trivial magic numbers, when they exist. For finite languages we obtain some partial results showing that certain numbers are non-magic.Comment: In Proceedings DCFS 2010, arXiv:1008.127

Quotient Complexity of Regular Languages

The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presented. Since state complexity is a property of a language, it is appropriate to define it in formal-language terms as the number of distinct quotients of the language, and to call it "quotient complexity". The problem of finding the quotient complexity of a language f(K,L) is considered, where K and L are regular languages and f is a regular operation, for example, union or concatenation. Since quotients can be represented by derivatives, one can find a formula for the typical quotient of f(K,L) in terms of the quotients of K and L. To obtain an upper bound on the number of quotients of f(K,L) all one has to do is count how many such quotients are possible, and this makes automaton constructions unnecessary. The advantages of this point of view are illustrated by many examples. Moreover, new general observations are presented to help in the estimation of the upper bounds on quotient complexity of regular operations

Reduced NGF in gastric endothelial cells is one of the main causes of impaired angiogenesis in aging gastric mucosa

This study detected reduced nerve growth factor (NGF) expression within gastric endothelial cells in both elderly patients and aged rats. Reduced NGF correlated with impaired angiogenesis and delayed gastric ulcer healing in aged rats. The defects could be reversed by exogenous NGF via phosphoinositide-3 kinase/serine threonine kinase signaling protein, and mammalian target of rapamycin signaling, and was dependent on serum response factor. These data show that down-regulation of endothelial NGF expression in aging is a significant contributor to impaired gastric mucosal repair

Stability and Complexity of Minimising Probabilistic Automata

We consider the state-minimisation problem for weighted and probabilistic automata. We provide a numerically stable polynomial-time minimisation algorithm for weighted automata, with guaranteed bounds on the numerical error when run with floating-point arithmetic. Our algorithm can also be used for "lossy" minimisation with bounded error. We show an application in image compression. In the second part of the paper we study the complexity of the minimisation problem for probabilistic automata. We prove that the problem is NP-hard and in PSPACE, improving a recent EXPTIME-result.Comment: This is the full version of an ICALP'14 pape

A Comparison of Recall and Diary Food Expenditure Data

Recall food expenditure data, which is the basis of a great deal of empirical work, is believed to suffer from considerable measurement error. Diary records are believed to be more accurate. We study an unusual data set that collects recall and diary data from the same households and so allows a direct comparison of the two methods of data collection. The diary data imply measurement errors in recall food expenditure data that are substantial, and which do not have the properties of classical measurement error. However, we also present evidence that the diary measures are themselves imperfect

HIV/AIDS among Inmates of and Releasees from US Correctional Facilities, 2006: Declining Share of Epidemic but Persistent Public Health Opportunity

Because certain groups at high risk for HIV/AIDS (human immunodeficiency virus/acquired immunodeficiency syndrome) come together in correctional facilities, seroprevalence was high early in the epidemic. The share of the HIV/AIDS epidemic borne by inmates of and persons released from jails and prisons in the United States (US) in 1997 was estimated in a previous paper. While the number of inmates and releasees has risen, their HIV seroprevalence rates have fallen. We sought to determine if the share of HIV/AIDS borne by inmates and releasees in the US decreased between 1997 and 2006. We created a new model of population flow in and out of correctional facilities to estimate the number of persons released in 1997 and 2006. In 1997, approximately one in five of all HIV-infected Americans was among the 7.3 million who left a correctional facility that year. Nine years later, only one in seven (14%) of infected Americans was among the 9.1 million leaving, a 29.3% decline in the share. For black and Hispanic males, two demographic groups with heightened incarceration rates, recently released inmates comprise roughly one in five of those groups' total HIV-infected persons, a figure similar to the proportion borne by the correctional population as a whole in 1997. Decreasing HIV seroprevalence among those admitted to jails and prisons, prolonged survival and aging of the US population with HIV/AIDS beyond the crime-prone years, and success with discharge planning programs targeting HIV-infected prisoners could explain the declining concentration of the epidemic among correctional populations. Meanwhile, the number of persons with HIV/AIDS leaving correctional facilities remains virtually identical. Jails and prisons continue to be potent targets for public health interventions. The fluid nature of incarcerated populations ensures that effective interventions will be felt not only in correctional facilities but also in communities to which releasees return

HFST—Framework for Compiling and Applying Morphologies

HFST–Helsinki Finite-State Technology ( hfst.sf.net ) is a framework for compiling and applying linguistic descriptions with finite-state methods. HFST currently connects some of the most important finite-state tools for creating morphologies and spellers into one open-source platform and supports extending and improving the descriptions with weights to accommodate the modeling of statistical information. HFST offers a path from language descriptions to efficient language applications in key environments and operating systems. HFST also provides an opportunity to exchange transducers between different software providers in order to get the best out of each finite-state library.Peer reviewe