Drainage induced convection rolls in foams

Hutzler, S., Cox, S.J., Janiaud, E. and Weaire, D. (2007) Drainage induced convection rolls in foams. Colloids and Surfaces A: Physicochemical and Engineering Aspects Volume 309, Issues 1-3, 1 November 2007, Pages 33-37 A Collection of Papers Presented at the 6th Eufoam Conference, Potsdam, Germany, 2-6 July, 2006 Sponsorship: European Space Agency (14914/02/NL/SH, 14308/00/NL/SG) (AO-99-031) CCN 002 MAP Project AO-99-075); Science Foundation Ireland (RFP 05/RFP/PHY0016); Royal Society; UWA Learned Societies.

Steady drainage in emulsions: corrections for surface Plateau borders and a model for high aqueous volume fraction

Peron, N., Cox, S.J., Hutzler, S. and Weaire, D. (2007) Steady drainage in emulsions: corrections for surface Plateau borders and a model for high aqueous volume fraction. The European Physical Journal E - Soft Matter. 22: 341-351. Sponsorship: This research was supported by the European Space Agency (14914/02/NL/SH, 14308/00/NL/SG) (AO-99-031) CCN 002 MAP Project AO-99-075) and Science Foundation Ireland (RFP 05/RFP/PHY0016). SJC acknowledges support from EPSRC (EP/D071127/1).

A viscous froth model for dry foams in the Surface Evolver

Cox, S.J. (2005) A Viscous Froth Model for Dry Foams in the Surface Evolver. Coll. Surf. A 263:81-89. Sponsorship: Partial support from both the Ulysses France?Ireland Exchange Scheme and the European Space Agency, Contract 14308/00/NL/SH (AO-99-031) CCN 002 MAP Project AO-99-075.

Bacteremic pneumonia before and after withdrawal of 13-valent pneumococcal conjugate vaccine from a public vaccination program in Spain: a case-control study

The objective of this study is to compare the incidence and epidemiology of bacteremic community-acquired pneumonia (CAP) in the setting of changes in 13-valent pneumococcal conjugate vaccine (PCV13) coverage. In the region of Madrid, universal immunization with the PCV13 started in May 2010. In July 2012, public funding ceased. Vaccination coverage decreased from >95% to 82% in 2013 and to 67% in 2014. We performed a multicenter surveillance and case-control study from 2009-2014. Cases were hospitalized children with bacteremic CAP. Controls were children selected 1:1 from next-admitted with negative blood cultures and typical, presumed bacterial CAP. Annual incidence of bacteremic CAP declined from 7.9/100 000 children (95% CI 5.1-11.1) in 2009 to 2.1/100 000 children (95% CI 1.1-4.1) in 2012. In 2014, 2 years after PCV13 was withdrawn from the universal vaccination program, the incidence of bacteremic CAP increased to 5.4/100 000 children (95% CI 3.5-8.4). We enrolled 113 cases and 113 controls. Streptococcus pneumoniae caused most of bloodstream infections (78%). Empyema was associated with bacteremia (P = .003, OR 3.6; 95% CI 1.4-8.9). Simple parapneumonic effusion was not associated with bacteremia. Incomplete PCV immunization was not a risk factor for bacteremic pneumonia.

Gut microbiota modification: Another piece in the puzzle of the benefits of physical exercise in health?

Regular physical exercise provides many health benefits, protecting against the development of chronic diseases, and improving quality of life. Some of the mechanisms by which exercise provides these effects are the promotion of an anti-inflammatory state, reinforcement of the neuromuscular function, and activation of the hypothalamic–pituitary–adrenal (HPA) axis. Recently, it has been proposed that physical exercise is able to modify gut microbiota, and thus this could be another factor by which exercise promotes well-being, since gut microbiota appears to be closely related to health and disease. The purpose of this paper is to review the recent findings on gut microbiota modification by exercise, proposing several mechanisms by which physical exercise might cause changes in gut microbiota.

Gwilym Prichard: A Retrospective

To accompany exhibition curated by Robert Meyrick, 'Gwilym Prichard', National Library of Wales; Oriel Theatr Clwyd; Oriel Plas Glyn-y-Weddw; Graham Sutherland Gallery, Picton Castle. pp.103

Wspólnota z przypadku. Studium tożsamości mieszkańców Naddniestrza

Wydział Historyczny

Sobrecargas posturais

Projeto de Pós-Graduação/Dissertação apresentado à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Medicina Dentária

Qualidade de Vida, Vinculação e Resiliência em adolescentes institucionalizados

Dissertação apresentada à Universidade Fernando Pessoa como parte dos requisitos para a obtenção do grau de Mestre em Psicologia, ramo de Psicologia Clínica e da Saúde

Automated Placement of Cameras in a Floorplan to Satisfy Task-Specific Constraints

In many multi-camera vision systems the effect of camera locations on the task-specific quality of service is ignored. Researchers in Computational Geometry have proposed elegant solutions for some sensor location problem classes. Unfortunately, these solutions utilize unrealistic assumptions about the cameras' capabilities that make these algorithms unsuitable for many real-world computer vision applications: unlimited field of view, infinite depth of field, and/or infinite servo precision and speed. In this paper, the general camera placement problem is first defined with assumptions that are more consistent with the capabilities of real-world cameras. The region to be observed by cameras may be volumetric, static or dynamic, and may include holes that are caused, for instance, by columns or furniture in a room that can occlude potential camera views. A subclass of this general problem can be formulated in terms of planar regions that are typical of building floorplans. Given a floorplan to be observed, the problem is then to efficiently compute a camera layout such that certain task-specific constraints are met. A solution to this problem is obtained via binary optimization over a discrete problem space. In preliminary experiments the performance of the resulting system is demonstrated with different real floorplans.

Approximately Uniform Random Sampling in Sensor Networks

Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates broadcast queries to all sensors and use in-network aggregation of responses to minimize messaging costs. In this work, we focus on uniform random sampling across nodes, which can serve both as an alternative building block for aggregation and as an integral component of many other useful randomized algorithms. Prior to our work, the best existing proposals for uniform random sampling of sensors involve contacting all nodes in the network. We propose a practical method which is only approximately uniform, but contacts a number of sensors proportional to the diameter of the network instead of its size. The approximation achieved is tunably close to exact uniform sampling, and only relies on well-known existing primitives, namely geographic routing, distributed computation of Voronoi regions and von Neumann's rejection method. Ultimately, our sampling algorithm has the same worst-case asymptotic cost as routing a point-to-point message, and thus it is asymptotically optimal among request/reply-based sampling methods. We provide experimental results demonstrating the effectiveness of our algorithm on both synthetic and real sensor topologies.

Equational Axiomization of Bicoercibility for Polymorphic Types

Two polymorphic types σ and τ are said to be bicoercible if there is a coercion from σ to τ and conversely. We give a complete equational axiomatization of bicoercible types and prove that the relation of bicoercibility is decidable.

Cluster-Based Optimizations for Distributed Hash Tables

We consider the problem of performing topological optimizations of distributed hash tables. Such hash tables include Chord and Tapestry and are a popular building block for distributed applications. Optimizing topologies over one dimensional hash spaces is particularly difficult as the higher dimensionality of the underlying network makes close fits unlikely. Instead, current schemes are limited to heuristically performing local optimizations finding the best of small random set of peers. We propose a new class of topology optimizations based on the existence of clusters of close overlay members within the underlying network. By constructing additional overlays for each cluster, a significant portion of the search procedure can be performed within the local cluster with a corresponding reduction in the search time. Finally, we discuss the effects of these additional overlays on spatial locality and other load balancing scheme.

Lightweight Modeling of Java Virtual Machine Security Constraints using Alloy

The Java programming language has been widely described as secure by design. Nevertheless, a number of serious security vulnerabilities have been discovered in Java, particularly in the component known as the Bytecode Verifier. This paper describes a method for representing Java security constraints using the Alloy modeling language. It further describes a system for performing a security analysis on any block of Java bytecodes by converting the bytes into relation initializers in Alloy. Any counterexamples found by the Alloy analyzer correspond directly to insecure code. Analysis of a real-world malicious applet is given to demonstrate the efficacy of the approach.

Adaptive Weighing Designs for Keyword Value Computation

Attributing a dollar value to a keyword is an essential part of running any profitable search engine advertising campaign. When an advertiser has complete control over the interaction with and monetization of each user arriving on a given keyword, the value of that term can be accurately tracked. However, in many instances, the advertiser may monetize arrivals indirectly through one or more third parties. In such cases, it is typical for the third party to provide only coarse-grained reporting: rather than report each monetization event, users are aggregated into larger channels and the third party reports aggregate information such as total daily revenue for each channel. Examples of third parties that use channels include Amazon and Google AdSense. In such scenarios, the number of channels is generally much smaller than the number of keywords whose value per click (VPC) we wish to learn. However, the advertiser has flexibility as to how to assign keywords to channels over time. We introduce the channelization problem: how do we adaptively assign keywords to channels over the course of multiple days to quickly obtain accurate VPC estimates of all keywords? We relate this problem to classical results in weighing design, devise new adaptive algorithms for this problem, and quantify the performance of these algorithms experimentally. Our results demonstrate that adaptive weighing designs that exploit statistics of term frequency, variability in VPCs across keywords, and flexible channel assignments over time provide the best estimators of keyword VPCs.