Search results

Filter

Filetype

Your search for "*" yielded 538731 hits

Low-molecular-weight heparin adherence and effects on survival within a randomised phase III lung cancer trial (RASTEN)

Background: Coagulation activation is a hallmark of cancer, and anticoagulants have shown tumour-inhibiting properties. However, recent trials have failed to demonstrate improved survival with low-molecular-weight heparin (LMWH) in cancer populations. This has raised the question of suboptimal adherence as a possible explanation for the lack of benefit. Still, there is no standardised method to di

Decreased expression of nemo-like kinase in melanoma is correlated with increased vascularity and metastasis

Melanoma is a highly metastatic cancer, and its incidence has increased over the past several decades. Angiogenesis is associated with melanoma metastasis and a poor prognosis. Many genetic and epigenetic factors affecting tumour vascularization and metastasis have been investigated, despite the heterogeneity of cancer cells and the complicated mechanisms involved in melanoma. Nemo-like kinase (NL

Surgical Outcomes of Anterior Versus Posterior Fusion in Lenke Type 1 Adolescent Idiopathic Scoliosis

STUDY DESIGN: Retrospective study. OBJECTIVE: To describe surgical results in two and three dimensions and patient-reported outcomes of scoliosis treatment for Lenke type 1 idiopathic curves with an open anterior or posterior approach. SUMMARY OF BACKGROUND DATA: Different surgical techniques have been described to prevent curve progression and to restore spinal alignment in idiopathic scoliosis.

Approximate counting of K-paths : Deterministic and in polynomial space

A few years ago, Alon et al. [ISMB 2008] gave a simple randomized O((2e)km∊−2)-time exponential-space algorithm to approximately compute the number of paths on k vertices in a graph G up to a multiplicative error of 1 ± ∊. Shortly afterwards, Alon and Gutner [IWPEC 2009, TALG 2010] gave a deterministic exponential-space algorithm with running time (2e)k+O(log3 k)m log n whenever ∊−1 = kO(1). Recen

Experiences from the 60s – activism for Peace Education in the 80s in Sweden

Voices today from the eighties – constructing peaceful citizensThe increased interest for questions of survival, focused in the fear for a nuclear war, also became the start for university courses and of Action research both in public schools, in Teacher Education and in the Universities in Sweden. The article is arguing that there are roots back to the 1960s and a continuity within Peace Educatio

An acoustofluidic platform for non-contact trapping of cell-laden hydrogel droplets compatible with optical microscopy

Production of cell-laden hydrogel droplets as miniaturized niches for 3D cell culture provides a new route for cell-based assays. Such production can be enabled by droplet microfluidics and here we present a droplet trapping system based on bulk acoustic waves for handling hydrogel droplets in a continuous flow format. The droplet trapping system consists of a glass capillary equipped with a small

Computing permanents and counting Hamiltonian cycles by listing dissimilar vectors

We show that the permanent of an n × n matrix over any finite ring of r ≤ n elements can be computed with a deterministic 2n−Ω(nr ) time algorithm. This improves on a Las Vegas algorithm running in expected 2n−Ω(n/(r log r)) time, implicit in [Björklund, Husfeldt, and Lyckberg, IPL 2017]. For the permanent over the integers of a 0/1-matrix with exactly d ones per row and column, we provide a deter

Solving systems of polynomial equations over GF(2) by a parity-counting self-reduction

We consider the problem of finding solutions to systems of polynomial equations over a finite field. Lokshtanov et al. [SODA'17] recently obtained the first worst-case algorithms that beat exhaustive search for this problem. In particular for degree-d equations modulo two in n variables, they gave an O∗2(1−1/(5d))n time algorithm, and for the special case d = 2 they gave an O∗20.876n time algorith