Graph editing to a given degree sequence

We investigate the parameterized complexity of the graph editing problem called Editing to a Graph with a Given Degree Sequence where the aim is to obtain a graph with a given degree sequence σ by at most k vertex deletions, edge deletions and edge additions. We show that the problem is W[1]-hard when parameterized by k for any combination of the allowed editing operations. From the positive side, we show that the problem can be solved in time 2O(k(Δ⁎+k)2)n2log⁡n for n -vertex graphs, where Δ⁎=max⁡σ, i.e., the problem is FPT when parameterized by k+Δ⁎. We also show that Editing to a Graph with a Given Degree Sequence has a polynomial kernel when parameterized by k+Δ⁎ if only edge additions are allowed, and there is no polynomial kernel unless NP⊆co-NP/poly for all other combinations of the allowed editing operations

Sarcopenia: etiology, clinical consequences, intervention, and assessment

The aging process is associated with loss of muscle mass and strength and decline in physical functioning. The term sarcopenia is primarily defined as low level of muscle mass resulting from age-related muscle loss, but its definition is often broadened to include the underlying cellular processes involved in skeletal muscle loss as well as their clinical manifestations. The underlying cellular changes involve weakening of factors promoting muscle anabolism and increased expression of inflammatory factors and other agents which contribute to skeletal muscle catabolism. At the cellular level, these molecular processes are manifested in a loss of muscle fiber cross-sectional area, loss of innervation, and adaptive changes in the proportions of slow and fast motor units in muscle tissue. Ultimately, these alterations translate to bulk changes in muscle mass, strength, and function which lead to reduced physical performance, disability, increased risk of fall-related injury, and, often, frailty. In this review, we summarize current understanding of the mechanisms underlying sarcopenia and age-related changes in muscle tissue morphology and function. We also discuss the resulting long-term outcomes in terms of loss of function, which causes increased risk of musculoskeletal injuries and other morbidities, leading to frailty and loss of independence

Proton magnetic resonance spectroscopic imaging reveals differences in spinocerebellar ataxia types 2 and 6.

The objective of this study was to investigate cerebellar metabolism in patients with autosomal dominant cerebellar ataxia type 1 (ADCA-I) carrying two distinct mutations of spinocerebellar ataxia (SCA). Non-invasive image-guided proton magnetic resonance spectroscopy imaging (1H-MRSI) was performed in 4 patients with SCA2, and 3 patients carrying the SCA6 mutation. For MRSI, we employed a spin-echo sequence (TR = 1500 msec, TE = 135 msec, slice thickness = 15 mm, FOV = 240 mm) and a stimulated-echo sequence (TR = 1500 msec, TE = 20 msec, slice thickness = 15 mm, FOV = 240 mm). Measures included the peak integral ratios of neuronal and glial markers [N-acetylaspartate (NA) to creatine (Cr), choline-containing compounds (CHO) to Cr, and lactate (LAC) to Cr]. We found NA:Cr ratios were significantly lower in patients with SCA2 (40.4% lower) compared to patients carrying the SCA6 mutation. CHO:Cr ratios differed between the two mutations using short echo time (30.8% lower in SCA2), but not when applying long echo time 1H-MRSI. Measurements using long echo time revealed LAC peaks in all SCA2 patients. 1H-MRSI revealed metabolic differences between SCA2 and SCA6 patients. NA:Cr ratios were significantly lower in patients with the SCA2 mutation compared to the SCA6 mutation, and LAC signals were obtained in the cerebella of SCA2 patients. In addition, CHO:Cr ratios showed different behavior using short and long TE, indicating differences in relaxation times of choline compounds in SCA2

A Comparison of a Global Approach and a Decomposition Method for Frequency Assignment in Multibeam Satellite Systems

International audienceAs a result of the continually growing demand for multimedia content and higher throughputs in wireless communication systems, the telecommuni-cation industry has to keep improving the use of the bandwidth resources. This access to the radiofrequency spectrum is both limited and expensive, which has naturally lead to the definition of the generic class of combinatorial optimization problems known as " Frequency Assignment Problems " (FAP). In this article, we present a new extension of these problems to the case of satellite systems that use a multibeam coverage. With the models we propose, we make sure that for each frequency plan produced there exists a corresponding satellite payload architecture that is cost-efficient and decently complex. Two approaches are presented and compared : a global constraint program that handles all the constraints simultaneously , and a decomposition method that involves both constraint programming and integer linear programming. For the latter approach where two subprob-lems are studied, we show that one of them can be modeled as a multiprocessor scheduling problem while the other can either be seen as a path-covering problem or a multidimensionnal bin-packing problem depending on the assumptions made. These analogies are used to prove that both the subproblems addressed in the decomposition method belong to the category of NP-hard problems. We also show that, for the most common class of interference graphs in multibeam satellite systems, the maximal cliques can all be enumerated in polynomial time and their number is relatively low, therefore it is perfectly acceptable to rely on them in the scheduling model that we derived. Our experiments on realistic scenarios show that the decomposition method proposed can indeed provide a solution of the problem when the global CP model does not