Parameterized complexity of the MINCCA problem on graphs of bounded decomposability

In an edge-colored graph, the cost incurred at a vertex on a path when two incident edges with different colors are traversed is called reload or changeover cost. The "Minimum Changeover Cost Arborescence" (MINCCA) problem consists in finding an arborescence with a given root vertex such that the total changeover cost of the internal vertices is minimized. It has been recently proved by G\"oz\"upek et al. [TCS 2016] that the problem is FPT when parameterized by the treewidth and the maximum degree of the input graph. In this article we present the following results for the MINCCA problem: - the problem is W[1]-hard parameterized by the treedepth of the input graph, even on graphs of average degree at most 8. In particular, it is W[1]-hard parameterized by the treewidth of the input graph, which answers the main open problem of G\"oz\"upek et al. [TCS 2016]; - it is W[1]-hard on multigraphs parameterized by the tree-cutwidth of the input multigraph; - it is FPT parameterized by the star tree-cutwidth of the input graph, which is a slightly restricted version of tree-cutwidth. This result strictly generalizes the FPT result given in G\"oz\"upek et al. [TCS 2016]; - it remains NP-hard on planar graphs even when restricted to instances with at most 6 colors and 0/1 symmetric costs, or when restricted to instances with at most 8 colors, maximum degree bounded by 4, and 0/1 symmetric costs.Comment: 25 pages, 11 figure

Prospective improvements for safer fuel tanks: Experimental tests

n/

Neuromuscular evaluation in young patients with unilateral posterior crossbite before and after rapid maxillary expansion

OBJECTIVES: The aim of this study is to analyze the electromyographic and electrognatographic exams of 55 patients before and after rapid palatal expansion, and to find out a relationship between the results. MATERIALS AND METHODS: The sample consisted of 55 children (28 females and 27 males; age ranging between 6 and10 years) with unilateral posterior crossbite, and subjected to an electromyographic and electrognatographic examination before and after a rapid palatal expansion. RESULTS: By analyzing the results, it is possible to observe an increased electrical activity of the masticatory muscles (right and left masseters and anterior temporalis) both in rest position and during activities after rapid palatal expansion. CONCLUSIONS: Rapid palatal expansion produces important changes in the muscular tone and it increases the muscular activity of the masticatory muscles

Titanium TSME appliance for patients allergic to nickel

Aim The aim of this article is to describe the use of a titanium TSME appliance for patients with allergy to resin and nickel. We aim to highlight the optimal way to avoid problems such as stomatitis and peri-labial dermatitis, which generally appear in patients who use traditional orthodontic appliances made in acrylic resin and steel. Materials and methods The construction of a titanium appliance is described and a case treated with it is reported. Results The titanium TSME presented in this paper has excellent biocompatibility due to its ability to form superficial oxides, which prevent oxidation and thus corrosion. Conclusion The non-allergic properties of titanium allow to propose it as an alternative in patients with a long-term history of allergic reactions to nichel

Functional evaluation in orthodontic surgical treatment: long-term stability and predictability

Background: The introduction of electromyographic and kinesiographic technology in orthodontics allows to obtain objective data regarding the functional aspects of the mandibular movements and the masticatory muscular activity. It is then important to be able to correlate the data obtained by instrumental activity with the clinical ones. The aim of this study consists to analyse the post ortodontic surgical stability through instrumental evaluation of the masticatory muscles and mandibular movements. Method: 30 patients undergo electromyographic and kinesiographic evaluations through all the surgical orthodontic iter and were than followed during other 4 years. JMP software was used to analyze and correlate the electromyographic and knesioographic data during treatment and during the follow up. Results: A linear correlations between some functional objective values collected from the examinations at the beginning and during therapy and the follow up one has been demonstrated. Conclusion: It is important to submit patients in surgical ortodontic treatment to instrumental analysis which can evidence how masticatory function and mandibular movements are performed. It is also important to highlight some functional values also from the beginning of the treatment because an alteration of such values can be related to a better or worse postsurgical rehabilitation

Orthodontic-surgical treatment: electromyographic and kinesiographic evaluation in follow up period : Experimental study

Introduction. The aim of this study was to investigate muscular function and mandibular kinesiology of patients undergoing orthodontic-surgical treatment by electromyography and kinesiography. Electromyographic evaluation is essential to estimate masticatory forces in patients undergoing combined surgical-orthodontic treatment. Materials and methods. 60 patients referred for orthodontic surgical treatment were included in the study, 43 patients presented a class III while 17 presented a class II. The patients underwent electromyographic and kinesiographic examinations during all the therapeutic orthodontic-surgical phases. Results. The relationship between fundamental electromyographic values and age, weight, asymmetry and activation was weak. A strong and positive relationship was observed between the relaxation percentage after TENS (transcutaneous electrical neuromuscular stimulation), the steepness of the post-surgery rehabilitation curve, the initial POC (percentage overlapping coefficient), and for the values in microvolts of the right and left temporal and masseters at the beginning of treatment. Conclusions. Patients with dentofacial deformities corrected by surgical treatment, have a significant positive treatment outcome in respect of masticatory activity and performance electromyographic evaluation on, before, during and follow up period of the analized patients permit to underline that this examination can predict long term stability

Quantum Circuits for the Unitary Permutation Problem

We consider the Unitary Permutation problem which consists, given $n$ unitary gates $U_1, \ldots, U_n$ and a permutation $\sigma$ of $\{1,\ldots, n\}$, in applying the unitary gates in the order specified by $\sigma$, i.e. in performing $U_{\sigma(n)}\ldots U_{\sigma(1)}$. This problem has been introduced and investigated by Colnaghi et al. where two models of computations are considered. This first is the (standard) model of query complexity: the complexity measure is the number of calls to any of the unitary gates $U_i$ in a quantum circuit which solves the problem. The second model provides quantum switches and treats unitary transformations as inputs of second order. In that case the complexity measure is the number of quantum switches. In their paper, Colnaghi et al. have shown that the problem can be solved within $n^2$ calls in the query model and $\frac{n(n-1)}2$ quantum switches in the new model. We refine these results by proving that $n\log_2(n) +\Theta(n)$ quantum switches are necessary and sufficient to solve this problem, whereas $n^2-2n+4$ calls are sufficient to solve this problem in the standard quantum circuit model. We prove, with an additional assumption on the family of gates used in the circuits, that $n^2-o(n^{7/4+\epsilon})$ queries are required, for any $\epsilon >0$. The upper and lower bounds for the standard quantum circuit model are established by pointing out connections with the permutation as substring problem introduced by Karp.Comment: 8 pages, 5 figure

Hints of theta_13>0 from global neutrino data analysis

Nailing down the unknown neutrino mixing angle theta_13 is one of the most important goals in current lepton physics. In this context, we perform a global analysis of neutrino oscillation data, focusing on theta_13, and including recent results [Neutrino 2008, Proceedings of the XXIII International Conference on Neutrino Physics and Astrophysics, Christchurch, New Zealand, 2008 (unpublished)]. We discuss two converging hints of theta_13>0, each at the level of ~1sigma: an older one coming from atmospheric neutrino data, and a newer one coming from the combination of solar and long-baseline reactor neutrino data. Their combination provides the global estimate sin^2(theta_13) = 0.016 +- 0.010 (1sigma), implying a preference for \theta_13>0 with non-negligible statistical significance (~90% C.L.). We discuss possible refinements of the experimental data analyses, which might sharpen such intriguing indication.Comment: Minor changes in the text. Matches published version in PR

The Parameterized Complexity of Domination-type Problems and Application to Linear Codes

We study the parameterized complexity of domination-type problems. (sigma,rho)-domination is a general and unifying framework introduced by Telle: a set D of vertices of a graph G is (sigma,rho)-dominating if for any v in D, |N(v)\cap D| in sigma and for any $v\notin D, |N(v)\cap D| in rho. We mainly show that for any sigma and rho the problem of (sigma,rho)-domination is W[2] when parameterized by the size of the dominating set. This general statement is optimal in the sense that several particular instances of (sigma,rho)-domination are W[2]-complete (e.g. Dominating Set). We also prove that (sigma,rho)-domination is W[2] for the dual parameterization, i.e. when parameterized by the size of the dominated set. We extend this result to a class of domination-type problems which do not fall into the (sigma,rho)-domination framework, including Connected Dominating Set. We also consider problems of coding theory which are related to domination-type problems with parity constraints. In particular, we prove that the problem of the minimal distance of a linear code over Fq is W[2] for both standard and dual parameterizations, and W[1]-hard for the dual parameterization. To prove W[2]-membership of the domination-type problems we extend the Turing-way to parameterized complexity by introducing a new kind of non deterministic Turing machine with the ability to perform `blind' transitions, i.e. transitions which do not depend on the content of the tapes. We prove that the corresponding problem Short Blind Multi-Tape Non-Deterministic Turing Machine is W[2]-complete. We believe that this new machine can be used to prove W[2]-membership of other problems, not necessarily related to dominationComment: 19 pages, 2 figure