Vector lattice covers of ideals and bands in pre-Riesz spaces

Pre-Riesz spaces are ordered vector spaces which can be order densely embedded into vector lattices, their so-called vector lattice covers. Given a vector lattice cover $Y$ for a pre-Riesz space $X$, we address the question how to find vector lattice covers for subspaces of $X$, such as ideals and bands. We provide conditions such that for a directed ideal $I$ in $X$ its smallest extension ideal in $Y$ is a vector lattice cover. We show a criterion for bands in $X$ and their extension bands in $Y$ as well. Moreover, we state properties of ideals and bands in $X$ which are generated by sets, and of their extensions in $Y$

Ask Your Neurons: A Neural-based Approach to Answering Questions about Images

We address a question answering task on real-world images that is set up as a Visual Turing Test. By combining latest advances in image representation and natural language processing, we propose Neural-Image-QA, an end-to-end formulation to this problem for which all parts are trained jointly. In contrast to previous efforts, we are facing a multi-modal problem where the language output (answer) is conditioned on visual and natural language input (image and question). Our approach Neural-Image-QA doubles the performance of the previous best approach on this problem. We provide additional insights into the problem by analyzing how much information is contained only in the language part for which we provide a new human baseline. To study human consensus, which is related to the ambiguities inherent in this challenging task, we propose two novel metrics and collect additional answers which extends the original DAQUAR dataset to DAQUAR-Consensus.Comment: ICCV'15 (Oral

Synchronization recovery and state model reduction for soft decoding of variable length codes

Variable length codes exhibit de-synchronization problems when transmitted over noisy channels. Trellis decoding techniques based on Maximum A Posteriori (MAP) estimators are often used to minimize the error rate on the estimated sequence. If the number of symbols and/or bits transmitted are known by the decoder, termination constraints can be incorporated in the decoding process. All the paths in the trellis which do not lead to a valid sequence length are suppressed. This paper presents an analytic method to assess the expected error resilience of a VLC when trellis decoding with a sequence length constraint is used. The approach is based on the computation, for a given code, of the amount of information brought by the constraint. It is then shown that this quantity as well as the probability that the VLC decoder does not re-synchronize in a strict sense, are not significantly altered by appropriate trellis states aggregation. This proves that the performance obtained by running a length-constrained Viterbi decoder on aggregated state models approaches the one obtained with the bit/symbol trellis, with a significantly reduced complexity. It is then shown that the complexity can be further decreased by projecting the state model on two state models of reduced size

Labor unions: a public health institution.

Using a social-ecological framework, we drew on a targeted literature review and historical and contemporary cases from the US labor movement to illustrate how unions address physical and psychosocial conditions of work and the underlying inequalities and social determinants of health. We reviewed labor involvement in tobacco cessation, hypertension control, and asthma, limiting articles to those in English published in peer-reviewed public health or medical journals from 1970 to 2013. More rigorous research is needed on potential pathways from union membership to health outcomes and the facilitators of and barriers to union-public health collaboration. Despite occasional challenges, public health professionals should increase their efforts to engage with unions as critical partners