Spotting Trees with Few Leaves

We show two results related to the Hamiltonicity and $k$-Path algorithms in undirected graphs by Bj\"orklund [FOCS'10], and Bj\"orklund et al., [arXiv'10]. First, we demonstrate that the technique used can be generalized to finding some $k$-vertex tree with $l$ leaves in an $n$-vertex undirected graph in $O^*(1.657^k2^{l/2})$ time. It can be applied as a subroutine to solve the $k$-Internal Spanning Tree ($k$-IST) problem in $O^*(\min(3.455^k, 1.946^n))$ time using polynomial space, improving upon previous algorithms for this problem. In particular, for the first time we break the natural barrier of $O^*(2^n)$. Second, we show that the iterated random bipartition employed by the algorithm can be improved whenever the host graph admits a vertex coloring with few colors; it can be an ordinary proper vertex coloring, a fractional vertex coloring, or a vector coloring. In effect, we show improved bounds for $k$-Path and Hamiltonicity in any graph of maximum degree $\Delta=4,\ldots,12$ or with vector chromatic number at most 8

Cloning and characterization of mouse UBPy, a deubiquitinating enzyme that interacts with the Ras guanine nucleotide exchange factor CDC25(Mm)/Ras-GRF1

We used yeast "two-hybrid" screening to isolate cDNA-encoding proteins interacting with the N-terminal domain of the Ras nucleotide exchange factor CDC25(Mm). Three independent overlapping clones were isolated from a mouse embryo cDNA library. The full-length cDNA was cloned by RACE-polymerase chain reaction. It encodes a large protein (1080 amino acids) highly homologous to the human deubiquitinating enzyme hUBPy and contains a well conserved domain typical of ubiquitin isopeptidases. Therefore we called this new protein mouse UBPy (mUBPy). Northern blot analysis revealed a 4-kilobase mRNA present in several mouse tissues and highly expressed in testis; a good level of expression was also found in brain, where CDC25(Mm) is exclusively expressed. Using a glutathione S-transferase fusion protein, we demonstrated an "in vitro" interaction between mUBPy and the N-terminal half (amino acids 1-625) of CDC25(Mm). In addition "in vivo" interaction was demonstrated after cotransfection in mammalian cells. We also showed that CDC25Mm, expressed in HEK293 cells, is ubiquitinated and that the coexpression of mUBPy decreases its ubiquitination. In addition the half-life of CDC25Mm protein was considerably increased in the presence of mUBPy. The specific function of the human homolog hUBPy is not defined, although its expression was correlated with cell proliferation. Our results suggest that mUBPy may play a role in controlling degradation of CDC25(Mm), thus regulating the level of this Ras-guanine nucleotide exchange factor

End-to-end verifiable elections in the standard model

We present the cryptographic implementation of “DEMOS”, a new e-voting system that is end-to-end verifiable in the standard model, i.e., without any additional “setup” assumption or access to a random oracle (RO). Previously known end-to-end verifiable e-voting systems required such additional assumptions (specifically, either the existence of a “randomness beacon” or were only shown secure in the RO model). In order to analyze our scheme, we also provide a modeling of end-to-end verifiability as well as privacy and receipt-freeness that encompasses previous definitions in the form of two concise attack games. Our scheme satisfies end-to-end verifiability information theoretically in the standard model and privacy/receipt-freeness under a computational assumption (subexponential Decisional Diffie Helman). In our construction, we utilize a number of techniques used for the first time in the context of e-voting schemes that include utilizing randomness from bit-fixing sources, zero-knowledge proofs with imperfect verifier randomness and complexity leveraging

Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification

In this paper, we present two new and very communication-efficient protocols for maliciously secure multi-party computation over fields in the honest-majority setting with abort. Our first protocol improves a recent protocol by Lindell and Nof. Using the so far overlooked tool of batchwise multiplication verification, we speed up their technique for checking correctness of multiplications (with some other improvements), reducing communication by 2x to 7x. In particular, in the 3PC setting, each party sends only two field elements per multiplication. We also show how to achieve fairness, which Lindell and Nof left as an open problem. Our second protocol again applies batchwise multiplication verification, this time to perform 3PC by letting two parties perform the SPDZ protocol using triples generated by a third party and verified batchwise. In this protocol, each party sends only 4/3 field elements during the online phase and 5/3 field elements during the preprocessing phase

Systematic review of dexketoprofen in acute and chronic pain

which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Background: Dexketoprofen, an NSAID used in the management of acute and chronic pains, is licensed in several countries but has not previously been the subjected of a systematic review. We used published and unpublished information from randomised clinical trials (RCTs) of dexketoprofen in painful conditions to assess evidence on efficacy and harm. Methods: PubMed and Cochrane Central were searched for RCTs of dexketoprofen for pain of any aetiology. Reference lists of retrieved articles and reviews were also searched. Menarini Group produced copies of published and unpublished studies (clinical trial reports). Data were abstracted into a standard form. For studies reporting results of single dose administration, the number of patients with at least 50 % pain relief was derived and used to calculate the relative benefit (RB) and number-needed-to-treat (NNT) for one patient to achieve at least 50 % pain relief compared with placebo. Results: Thirty-five trials were found in acute pain and chronic pain; 6,380 patients were included, 3,381 receiving dexketoprofen. Information from 16 trials (almost half the total patients) wa

Proving formally the implementation of an efficient gcd algorithm for polynomials

Last version published in the proceedings of IJCAR 06, part of FLOC 06.International audienceWe describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correction of our implementation of the subresultant algorithm. Up to our knowledge, it is the first mechanized proof of this result

Image-guided focused ultrasound ablation of breast cancer: current status, challenges, and future directions

Image-guided focussed ultrasound (FUS) ablation is a non-invasive procedure that has been used for treatment of benign or malignant breast tumours. Image-guidance during ablation is achieved either by using real-time ultrasound (US) or magnetic resonance imaging (MRI). The past decade phase I studies have proven MRI-guided and US-guided FUS ablation of breast cancer to be technically feasible and safe. We provide an overview of studies assessing the efficacy of FUS for breast tumour ablation as measured by percentages of complete tumour necrosis. Successful ablation ranged from 20% to 100%, depending on FUS system type, imaging technique, ablation protocol, and patient selection. Specific issues related to FUS ablation of breast cancer, such as increased treatment time for larger tumours, size of ablation margins, methods used for margin assessment and residual tumour detection after FUS ablation, and impact of FUS ablation on sentinel node procedure are presented. Finally, potential future applications of FUS for breast cancer treatment such as FUS-induced anti-tumour immune response, FUS-mediated gene transfer, and enhanced drug delivery are discussed. Currently, breast-conserving surgery remains the gold standard for breast cancer treatment

Non-Malleability against Polynomial Tampering

We present the first explicit construction of a non-malleable code that can handle tampering functions that are bounded-degree polynomials. Prior to our work, this was only known for degree-1 polynomials (affine tampering functions), due to Chattopadhyay and Li (STOC 2017). As a direct corollary, we obtain an explicit non-malleable code that is secure against tampering by bounded-size arithmetic circuits. We show applications of our non-malleable code in constructing non-malleable secret sharing schemes that are robust against bounded-degree polynomial tampering. In fact our result is stronger: we can handle adversaries that can adaptively choose the polynomial tampering function based on initial leakage of a bounded number of shares. Our results are derived from explicit constructions of seedless non-malleable extractors that can handle bounded-degree polynomial tampering functions. Prior to our work, no such result was known even for degree-2 (quadratic) polynomials