Half-a-Century of the »Körmend Growth Study«

The authors give a sketch about the „Körmend Growth Study« which is series of cross-sectional growth studies, carried out in Körmend, a small town in Western Hungary. The first investigation was carried out in 1958 (K-58) and it has been repeated every ten years (K-68, K-78, K-88, and K-98). All 3-18 year-old healthy boys and girls in nurseries and schools in Körmend were involved in the study. Twenty-three body measurements were taken. This paper focuses on changes in height, weight, and BMI. Means of these two body measurements show an increase from time to time (as a phenomenon of positive secular trend), however, the secular trend for increasing height and weight is declining. BMI follows a similar pattern

A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion

Vertex deletion problems ask whether it is possible to delete at most $k$ vertices from a graph so that the resulting graph belongs to a specified graph class. Over the past years, the parameterized complexity of vertex deletion to a plethora of graph classes has been systematically researched. Here we present the first single-exponential fixed-parameter tractable algorithm for vertex deletion to distance-hereditary graphs, a well-studied graph class which is particularly important in the context of vertex deletion due to its connection to the graph parameter rank-width. We complement our result with matching asymptotic lower bounds based on the exponential time hypothesis. As an application of our algorithm, we show that a vertex deletion set to distance-hereditary graphs can be used as a parameter which allows single-exponential fixed-parameter tractable algorithms for classical NP-hard problems.Comment: 43 pages, 9 figures (revised journal version; an extended abstract appeared in the proceedings of MFCS 2016

Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth

We develop a framework for applying treewidth-based dynamic programming on graphs with "hybrid structure", i.e., with parts that may not have small treewidth but instead possess other structural properties. Informally, this is achieved by defining a refinement of treewidth which only considers parts of the graph that do not belong to a pre-specified tractable graph class. Our approach allows us to not only generalize existing fixed-parameter algorithms exploiting treewidth, but also fixed-parameter algorithms which use the size of a modulator as their parameter. As the flagship application of our framework, we obtain a parameter that combines treewidth and rank-width to obtain fixed-parameter algorithms for Chromatic Number, Hamiltonian Cycle, and Max-Cut

A Polynomial Kernel for 3-Leaf Power Deletion

For a non-negative integer ?, a graph G is an ?-leaf power of a tree T if V(G) is equal to the set of leaves of T, and distinct vertices v and w of G are adjacent if and only if the distance between v and w in T is at most ?. Given a graph G, 3-Leaf Power Deletion asks whether there is a set S ? V(G) of size at most k such that GS is a 3-leaf power of some treeT. We provide a polynomial kernel for this problem. More specifically, we present a polynomial-time algorithm for an input instance (G,k) to output an equivalent instance (G\u27,k\u27) such that k\u27? k and G\u27 has at most O(k^14) vertices

A Unifying Framework for Characterizing and Computing Width Measures

Algorithms for computing or approximating optimal decompositions for decompositional parameters such as treewidth or clique-width have so far traditionally been tailored to specific width parameters. Moreover, for mim-width, no efficient algorithms for computing good decompositions were known, even under highly restrictive parameterizations. In this work we identify ?-branchwidth as a class of generic decompositional parameters that can capture mim-width, treewidth, clique-width as well as other measures. We show that while there is an infinite number of ?-branchwidth parameters, only a handful of these are asymptotically distinct. We then develop fixed-parameter and kernelization algorithms (under several structural parameterizations) that can approximate every possible ?-branchwidth, providing a unifying parameterized framework that can efficiently obtain near-optimal tree-decompositions, k-expressions, as well as optimal mim-width decompositions

Stationary probability density of stochastic search processes in global optimization

A method for the construction of approximate analytical expressions for the stationary marginal densities of general stochastic search processes is proposed. By the marginal densities, regions of the search space that with high probability contain the global optima can be readily defined. The density estimation procedure involves a controlled number of linear operations, with a computational cost per iteration that grows linearly with problem size

Hypersensitivity and chaos signatures in the quantum baker's maps

Classical chaotic systems are distinguished by their sensitive dependence on initial conditions. The absence of this property in quantum systems has lead to a number of proposals for perturbation-based characterizations of quantum chaos, including linear growth of entropy, exponential decay of fidelity, and hypersensitivity to perturbation. All of these accurately predict chaos in the classical limit, but it is not clear that they behave the same far from the classical realm. We investigate the dynamics of a family of quantizations of the baker's map, which range from a highly entangling unitary transformation to an essentially trivial shift map. Linear entropy growth and fidelity decay are exhibited by this entire family of maps, but hypersensitivity distinguishes between the simple dynamics of the trivial shift map and the more complicated dynamics of the other quantizations. This conclusion is supported by an analytical argument for short times and numerical evidence at later times.Comment: 32 pages, 6 figure

Food and beverage intakes according to physical activity levels in European children: The IDEFICS (Identification and prevention of Dietary and lifestyle induced health EFfects in Children and infantS) study

Objective Physical activity (PA) levels and dietary habits are considered some of the most important factors associated with obesity. The present study aimed to examine the association between PA level and food and beverage consumption in European children (2-10 years old).Design/Setting/Subjects A sample of 7229 children (49·0 % girls) from eight European countries participating in the IDEFICS (Identification and prevention of Dietary and lifestyle induced health EFfects In Children and infantS) study was included. Moderate-to-vigorous PA (MVPA) was assessed objectively with accelerometers. FFQ was used to register dietary habits. ANCOVA and binary logistic regression were applied.Results Boys who spent less time in MVPA reported lower consumption of vegetables, fruits, cereals, yoghurt, milk, bread, pasta, candies and sugar-sweetened beverages (SSB) than boys who spent more time in MVPA (P<0·05). Moreover, boys who spent less time in MVPA were more likely to consume fast foods and water than those in the highest MVPA tertile (P<0·05). Girls who spent less time in MVPA reported lower consumption frequencies of vegetables, pasta, bread, yoghurt, candies, jam/honey and SSB than girls in the highest MVPA tertile (P<0·05). Also, girls in the lowest MVPA tertile were more likely to consume fast foods and water than those with high levels of MVPA (P<0·05).Conclusions Food intake among European children varied with different levels of daily MVPA. Low time spent in MVPA was associated with lowest consumption of both high- and low-energy-dense foods and high fast-food consumption