Diversity of Listeria monocytogenes strains of clinical and food chain origins in Belgium between 1985 and 2014

Listeriosis is a rare but severe disease, mainly caused by Listeria monocytogenes. This study shows the results of the laboratory-based surveillance of Listeriosis in Belgium over the period 1985-2014. Besides the incidence and some demographic data we present also more detailed microbiological and molecular characteristics of human strains isolated since 2000. The strains from the latter period were compared to food and animal strains from the same period. Our study shows that different food matrices were commonly contaminated with L. monocytogenes presenting the same PFGE profile as in patient's isolates. Since 1985, we observed a significant decrease in incidence of the Materno-Neonatal cases (from 0.15 to 0.04 cases /100,000 inhabitants-year), which is probably to be attributed to active prevention campaigns targeting pregnant women. Despite the strengthening of different control measures by the food industry, the incidence of non-Materno-Neonatal listeriosis increased in Belgium (from 0.3 to 0.7 cases /100,000 inhabitants-year), probably due to the rise of highly susceptible patients in an aging population. This significant increase found in non-Materno-Neonatal cases (slope coefficient 7.42%/year, P< 0.0001) can be attributed to significant increase in incidence of isolates belonging to serovars 1/2a (n = 393, slope coefficient 6.62%/year, P< 0.0001). Although resistance to antimicrobials is rare among L. monocytogenes isolates, a trend to increasing MIC values is evident with chloramphenicol, amoxicillin, tetracycline and ciprofloxacin. We show that fluoroquinolone resistance is not linked to chromosomal mutations, but caused by a variety of efflux pumps. Our study also shows that huge majority of known underlying pathologies (426 out of 785 cases) were cancers (185/426, 43.1%) and haematological malignancies (75/185, 40.5%). Moreover the risk population is susceptible to low levels of contamination in food stressing the need of prevention campaigns specifically targeting these persons

Gravitational infall in the hard wall model

An infalling shell in the hard wall model provides a simple holographic model for energy injection in a confining gauge theory. Depending on its parameters, a scalar shell either collapses into a large black brane, or scatters between the hard wall and the anti-de Sitter boundary. In the scattering regime, we find numerical solutions that keep oscillating for as long as we have followed their evolution, and we provide an analytic argument that shows that a black brane can never be formed. This provides examples of states in infinite-volume field theory that never thermalize. We find that the field theory expectation value of a scalar operator keeps oscillating, with an amplitude that undergoes modulation.Comment: 7 pages, 4 figure

Holographic quenches and fermionic spectral functions

Using holographic methods we investigate the behaviour of fermionic spectral functions of strongly coupled 2+1 dimensional field theories as both temperature and chemical potential are quenched

Too Afraid to Learn: Attitudes towards Statistics as a Barrier to Learning Statistics and to Acquiring Quantitative Skills

Quantitative skills are important for studying and understanding social reality. Political science students, however, experience difficulties in acquiring and retaining such skills. Fear of statistics has often been listed among the major causes for this problem. This study aims at understanding the underlying factors for this anxiety and proposes a potential remedy. More specifically, we advocate the integration of quantitative material into non-methodological courses. After assessing the influence of dispositional, course-related and person-related factors on the attitudes towards statistics among political science students, we provide insights into the relation between these attitudes on the one hand and the learning and retention of statistics skills on the other. Our results indicate that a curriculum-wide approach to normalise the use of quantitative methods can not only foster interest in statistics but also foster retention of the acquired skills

Physical Conditions in Barnard\u27s Loop, Components of the Orion-Eridanus Bubble, and Implications for the Warm Ionized Medium Component of the Interstellar Medium

We have supplemented existing spectra of Barnard\u27s Loop with high accuracy spectrophotometry of one new position. Cloudy photoionization models were calculated for a variety of ionization parameters and stellar temperatures and compared with the observations. After testing the procedure with recent observations of M43, we establish that Barnard\u27s Loop is photoionized by four candidate ionizing stars, but agreement between the models and observations is only possible if Barnard\u27s Loop is enhanced in heavy elements by about a factor of 1.4. Barnard\u27s Loop is very similar in properties to the brightest components of the Orion-Eridanus Bubble and the warm ionized medium (WIM). We are able to establish models that bound the range populated in low-ionization color-color diagrams (I([S II])/I(Hα) versus I([N II])/I(Hα)) using only a limited range of ionization parameters and stellar temperatures. Previously established variations in the relative abundance of heavy elements render uncertain the most common method of determining electron temperatures for components of the Orion-Eridanus Bubble and the WIM based only on the I([N II])/I(Hα) ratio, although we confirm that the lowest surface brightness components of the WIM are on average of higher electron temperature. The electron temperatures for a few high surface brightness WIM components determined by direct methods are comparable to those of classical bright H II regions. In contrast, the low surface brightness H II regions studied by the Wisconsin Hα Mapper are of lower temperatures than the classical bright H II regions

Specializing Interpreters using Offline Partial Deduction

We present the latest version of the Logen partial evaluation system for logic programs. In particular we present new binding-types, and show how they can be used to effectively specialise a wide variety of interpreters.We show how to achieve Jones-optimality in a systematic way for several interpreters. Finally, we present and specialise a non-trivial interpreter for a small functional programming language. Experimental results are also presented, highlighting that the Logen system can be a good basis for generating compilers for high-level languages

Relational symbolic execution of SQL code for unit testing of database programs

Symbolic execution is a technique enabling the automatic generation of test inputs that exercise a set of execution paths within a code unit to be tested. If the paths cover a sufficient part of the code under test, the test data offer a representative view of the actual behaviour of this code. This notably enables detecting errors and correcting faults. Relational databases are ubiquitous in software, but symbolic execution of code units that manipulate them remains a non-trivial problem, particularly because of the complex structure of such databases and the complex behaviour of SQL statements. Finding errors in such code units is yet critical, as it can avoid corrupting important data. In this work, we define a symbolic execution translating database manipulation code directly into constraints and integrate it with a more traditional symbolic execution of normal program code. The database tables are represented by relational symbols and the SQL statements by relational constraints over these symbols. An algorithm based on these principles is presented for the symbolic execution of simple Java methods that implement transactional use cases by reading and writing in a relational database, the latter subject to data integrity constraints. The algorithm is integrated in a test generation tool and experimented over sample code. The target language for the constraints produced by the tool is the SMT-Lib standard and the used solver is Microsoft Z3. The results show that the proposed approach enables generating meaningful test data, including valid database content, in reasonable time. In particular, the Z3 solver is shown to be more scalable than the Alloy solver, used in our previous work, for solving relational constraints

A Direct Symbolic Execution of SQL Code for Testing of Data-Oriented Applications

Symbolic execution is a technique which enables automatically generating test inputs (and outputs) exercising a set of execution paths within a program to be tested. If the paths cover a sufficient part of the code under test, the test data offer a representative view of the program's actual behaviour, which notably enables detecting errors and correcting faults. Relational databases are ubiquitous in software, but symbolic execution of pieces of code that manipulate them remains a non-trivial problem, particularly because of the complex structure of such databases and the complex behaviour of SQL statements. In this work, we define a direct symbolic execution for database manipulation code and integrate it with a more traditional symbolic execution of normal program code. The database tables are represented by relational symbols and the SQL statements by relational constraints over these symbols and the symbols representing the normal variables of the program. An algorithm based on these principles is presented for the symbolic execution of Java methods that implement business use cases by reading and writing in a relational database, the latter subject to data integrity constraints. The algorithm is integrated in a test generation tool and experimented over sample code. The target language for the constraints produced by the tool is the SMT-Lib standard and the used solver is Microsoft Z3. The results show that the proposed approach enables generating meaningful test data, including valid database content, in reasonable time. In particular, the Z3 solver is shown to be more scalable than the Alloy solver, used in our previous work, for solving relational constraints