Stability of the essential spectrum for 2D--transport models with Maxwell boundary conditions

We discuss the spectral properties of collisional semigroups associated to various models from transport theory by exploiting the links between the so-called resolvent approach and the semigroup approach. Precisely, we show that the essential spectrum of the full transport semigroup coincides with that of the collisionless transport semigroup in any $L^p$--spaces $(1 <p < \infty)$ for three 2D--transport models with Maxwell--boundary conditions.Comment: 23 page

Spondylolisthesis on bilateral pedicle stress fracture in the lumbar spine: A case study

AbstractWe report the clinical case of a 54-year-old woman presenting radicular low back pain on the right side of L4 associated to spondylolisthesis on L4-L5, without any notion of trauma or spine surgery. Furthermore this patient is regularly seen for benign rheumatoid polyarthritis complicated by steroid-induced osteoporosis. A preventive treatment was implanted with good results on pain improvement and functional capacities. For pedicle fractures the literature review reports several different etiologies: spontaneous fractures, hereditary fractures or stress-related fractures. There was a discussion on the various treatments available and in this case of spondylolisthesis on pedicle fracture a conservative treatment was implemented similar to the one for isthmic spondylolisthesis. It yielded satisfying results

A note on anti-coordination and social interactions

This note confirms a conjecture of [Bramoull\'{e}, Anti-coordination and social interactions, Games and Economic Behavior, 58, 2007: 30-49]. The problem, which we name the maximum independent cut problem, is a restricted version of the MAX-CUT problem, requiring one side of the cut to be an independent set. We show that the maximum independent cut problem does not admit any polynomial time algorithm with approximation ratio better than $n^{1-\epsilon}$, where $n$ is the number of nodes, and $\epsilon$ arbitrarily small, unless P=NP. For the rather special case where each node has a degree of at most four, the problem is still MAXSNP-hard.Comment: 7 page

Independent Set Reconfiguration in Cographs

We study the following independent set reconfiguration problem, called TAR-Reachability: given two independent sets $I$ and $J$ of a graph $G$, both of size at least $k$, is it possible to transform $I$ into $J$ by adding and removing vertices one-by-one, while maintaining an independent set of size at least $k$ throughout? This problem is known to be PSPACE-hard in general. For the case that $G$ is a cograph (i.e. $P_4$-free graph) on $n$ vertices, we show that it can be solved in time $O(n^2)$, and that the length of a shortest reconfiguration sequence from $I$ to $J$ is bounded by $4n-2k$, if such a sequence exists. More generally, we show that if $X$ is a graph class for which (i) TAR-Reachability can be solved efficiently, (ii) maximum independent sets can be computed efficiently, and which satisfies a certain additional property, then the problem can be solved efficiently for any graph that can be obtained from a collection of graphs in $X$ using disjoint union and complete join operations. Chordal graphs are given as an example of such a class $X$

Using multimedia and peer assessment to promote collaborative e-learning

Collaborative e-learning is increasingly appealing as a pedagogical approach that can positively affect student learning. We propose a didactical model that integrates multimedia with collaborative tools and peer assessment to foster collaborative e-learning. In this paper, we explain it and present the results of its application to the “International Seminars on Materials Science” online course. The proposed didactical model consists of five educational activities. In the first three, students review the multimedia resources proposed by the teacher in collaboration with their classmates. Then, in the last two activities, they create their own multimedia resources and assess those created by their classmates. These activities foster communication and collaboration among students and their ability to use and create multimedia resources. Our purpose is to encourage the creativity, motivation, and dynamism of the learning process for both teachers and students

The Canadian Healthy Infant Longitudinal Development (CHILD) birth cohort study: Assessment of environmental exposures

The Canadian Healthy Infant Longitudinal Development birth cohort was designed to elucidate interactions between environment and genetics underlying development of asthma and allergy. Over 3600 pregnant mothers were recruited from the general population in four provinces with diverse environments. The child is followed to age 5 years, with prospective characterization of diverse exposures during this critical period. Key exposure domains include indoor and outdoor air pollutants, inhalation, ingestion and dermal uptake of chemicals, mold, dampness, biological allergens, pets and pests, housing structure, and living behavior, together with infections, nutrition, psychosocial environment, and medications. Assessments of early life exposures are focused on those linked to inflammatory responses driven by the acquired and innate immune systems. Mothers complete extensive environmental questionnaires including time-activity behavior at recruitment and when the child is 3, 6, 12, 24, 30, 36, 48, and 60 months old. House dust collected during a thorough home assessment at 3–4 months, and biological specimens obtained for multiple exposure-related measurements, are archived for analyses. Geo-locations of homes and daycares and land-use regression for estimating traffic-related air pollution complement time-activity-behavior data to provide comprehensive individual exposure profiles. Several analytical frameworks are proposed to address the many interacting exposure variables and potential issues of co-linearity in this complex data set

On cycle transversals and their connected variants in the absence of a small linear forest.

A graph is H-free if it contains no induced subgraph isomorphic to H. We prove new complexity results for the two classical cycle transversal problems Feedback Vertex Set and Odd Cycle Transversal by showing that they can be solved in polynomial time for (sP1+P3) -free graphs for every integer s≥1 . We show the same result for the variants Connected Feedback Vertex Set and Connected Odd Cycle Transversal. For the latter two problems we also prove that they are polynomial-time solvable for cographs; this was known already for Feedback Vertex Set and Odd Cycle Transversal

Algorithm Engineering in Robust Optimization

Robust optimization is a young and emerging field of research having received a considerable increase of interest over the last decade. In this paper, we argue that the the algorithm engineering methodology fits very well to the field of robust optimization and yields a rewarding new perspective on both the current state of research and open research directions. To this end we go through the algorithm engineering cycle of design and analysis of concepts, development and implementation of algorithms, and theoretical and experimental evaluation. We show that many ideas of algorithm engineering have already been applied in publications on robust optimization. Most work on robust optimization is devoted to analysis of the concepts and the development of algorithms, some papers deal with the evaluation of a particular concept in case studies, and work on comparison of concepts just starts. What is still a drawback in many papers on robustness is the missing link to include the results of the experiments again in the design

KIMA: Noise: A visual sound installation on urban noise

KIMA: Noise is a participatory art piece inviting audiences to explore impact of urban noises interactively. Using specific urban sound sources, the audience experiences noise as spatial soundscapes, responding to it, physically engaging and interacting with it. KIMA: Noise creates awareness for the phenomenon of noise pollution. The paper looks at preeminent research in the field, and draws conclusions of how sound affects us as individuals. The art project KIMA: Noise is introduced technically and conceptually