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

Interaction of caveolin-1 with Ku70 inhibits Bax-mediated apoptosis

Caveolin-1, the structural protein component of caveolae, acts as a scaffolding protein that functionally regulates signaling molecules. We show that knockdown of caveolin-1 protein expression enhances chemotherapeutic drug-induced apoptosis and inhibits long-term survival of colon cancer cells. In vitro studies demonstrate that caveolin-1 is a novel Ku70-binding protein, as shown by the binding of the scaffolding domain of caveolin-1 (amino acids 82-101) to the caveolin-binding domain (CBD) of Ku70 (amino acids 471-478). Cell culture data show that caveolin-1 binds Ku70 after treatment with chemotherapeutic drugs. Mechanistically, we found that binding of caveolin-1 to Ku70 inhibits the chemotherapeutic drug-induced release of Bax from Ku70, activation of Bax, translocation of Bax to mitochondria and apoptosis. Potentiation of apoptosis by knockdown of caveolin-1 protein expression is greatly reduced in the absence of Bax expression. Finally, we found that overexpression of wild type Ku70, but not a mutant form of Ku70 that cannot bind to caveolin-1 (Ku70 Φ→A), limits the chemotherapeutic drug-induced Ku70/Bax dissociation and apoptosis. Thus, caveolin-1 acts as an anti-apoptotic protein in colon cancer cells by binding to Ku70 and inhibiting Bax-dependent cell death. © 2012 Zou et al

Influence of Flood Pulse on Termite Diversity (INSECTA: ISOPTERA) in the Pantanal

This research aimed to associate termite diversity to flood pulse by Paraguay River, and with savannas and pasture areas. The study was conducted nearby the town of Cáceres, in Pantanal - Mato Grosso, on six livestock farms subject to Paraguay River flood pulse. Types of land use sampled were native savanna and cultivated pasture. Flooded and dry plots were selected, both the savanna and the pasture in each sampling area. Termite richness and abundance was analysed based on the  environments as an explanatory variable (FP – flooded pasture, DP – dry pasture, FS – flooded savanna, DS – dry savanna) through GLM; Tukey’s test was subsequently performed to determine whether land use and/or flood pulse can significantly affect the termite community. There were 37 termite species and 19 genera. Richness and abundance of termite species cannot be explain by flooding pulse, but were explained only by land use (pasture and savanna). The similarity analysis also identified that species composition was quite affected by flood in grazing areas, but this disturbance does not affect the savanna areas. In conclusion, flood pulse is not a determining factor for savannas or pasture termite richness, but change the composition of the termite fauna in the environment

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

Hyrax versus transverse sagittal maxillary expander: An assessment of arch changes on dental casts: A retrospective study

Objective: The aim of this study was to compare arch changes before and after maxillary expansion with Transverse Maxillary Sagittal Expander (TSME) and Hyrax Palatal Expander (HPE), in growing patients with diagnosis of maxillary hypoplasia. Materials and methods: The sample consisted of 40 patients\u2019 records (20 males 20 females mean age 9.2 \ub1 2.6 years) were selected from the archive of the Orthodontic Department of the University of Milan, Italy. Patients were randomly divided in two groups: patients in group 1 were treated with HPE as they presented only transverse deficiency of the maxilla and in group 2 were treated with TSME. Plaster models have been measured with a Verniere caliper to evaluate the differences in maxillary expansion of the two devices. Measurements were performed on casts poured from impressions taken before appliance bonding (T0), immediately after appliance debonding (T1) and at 6 months follow-up (T2). The variations in the following distances have been considered: inter-molar distance, inter-canine distance, palatal depth, palatal length and arch circumference. Shapiro-Wilk test was performed to assess normality distribution. ANOVA for repeated measures with multiple paired t-test for pairwise comparisons and its non-parametric equivalent Friedman's test with multiple Wilcoxon tests for pairwise comparisons were performed to evaluate changes in time of each variable in each group. Between groups comparisons were performed for each variable at each observing time using independent t-test or Mann-Whitney test. Significance level was set at p < 0,05. Results: Both the Friedman test and the rm-ANOVA test and their respective post-hoc show that within both groups the respective variables have a statistically significant increase between T0 and T1 (p < 0,05) and a slight decrease between T1 and T2 (p < 0,05) that is not clinically relevant remaining always T2 greater than T0 in a statistically and clinically relevant way (p < 0,05). The analysis between the differences of the measurements at different timing measured by the Mann-Whitney test shows that for all the variables there is no statistically significant difference between the 2 devices (p < 0,05), except for the perimeter of the arch and the length of the palate; in this case it appeared that the TSME is better statistically (p < 0,05). Conclusions: The study has shown that RPE and TSME can achieve similar results in transversal palatal expansion. Differences have been found in the palatal length and in the arch perimeter where TSME seems to be more efficient

Properties of the mechanosensitive channel MscS pore revealed by tryptophan scanning mutagenesis

Funding This work was supported by a Wellcome Trust Programme grant [092552/A/10/Z awarded to I.R.B., S.M., J. H. Naismith (University of St Andrews, St Andrews, U.K.), and S. J. Conway (University of Oxford, Oxford, U.K.)] (T.R. and M.D.E.), by a BBSRC grant (A.R.) [BB/H017917/1 awarded to I.R.B., J. H. Naismith, and O. Schiemann (University of St Andrews)], by a Leverhulme Emeritus Fellowship (EM-2012-060\2), and by a CEMI grant to I.R.B. from the California Institute of Technology. The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013 FP7/2007-2011) under Grant PITN-GA-2011-289384 (FP7-PEOPLE-2011-ITN NICHE) (H.G.) (awarded to S.M.).Peer reviewedPublisher PD

Gamma ray production in inelastic scattering of neutrons produced by cosmic muons in 56^{56}Fe

We report on the study of the intensities of several gamma lines emitted after the inelastic scattering of neutrons in $^{56}$Fe. Neutrons were produced by cosmic muons passing the 20t massive iron cube placed at the Earth's surface and used as a passive shield for the HPGe detector. Relative intensities of detected gamma lines are compared with the results collected in the same iron shield by the use of $^{252}$Cf neutrons. Assessment against the published data from neutron scattering experiments at energies up to 14 MeV is also provided

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