Parameterized Approximation Schemes using Graph Widths

Combining the techniques of approximation algorithms and parameterized complexity has long been considered a promising research area, but relatively few results are currently known. In this paper we study the parameterized approximability of a number of problems which are known to be hard to solve exactly when parameterized by treewidth or clique-width. Our main contribution is to present a natural randomized rounding technique that extends well-known ideas and can be used for both of these widths. Applying this very generic technique we obtain approximation schemes for a number of problems, evading both polynomial-time inapproximability and parameterized intractability bounds

From aptamer-based biomarker discovery to diagnostic and clinical applications: an aptamer-based, streamlined multiplex proteomic assay

Recently, we reported an aptamer-based, highly multiplexed assay for the purpose of biomarker identification. To enable seamless transition from highly multiplexed biomarker discovery assays to a format suitable and convenient for diagnostic and life-science applications, we developed a streamlined, plate-based version of the assay. The plate-based version of the assay is robust, sensitive (sub-picomolar), rapid, can be highly multiplexed (upwards of 60 analytes), and fully automated. We demonstrate that quantification by microarray-based hybridization, Luminex bead-based methods, and qPCR are each compatible with our platform, further expanding the breadth of proteomic applications for a wide user community

On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT

Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F over a finite universe U and an integer t; the question is whether there is a set of t elements that intersects every set in F. The Hitting Set problem parameterized by the size of the solution is a well-known W[2]-complete problem in parameterized complexity theory. In this paper we investigate the complexity of Hitting Set under various structural parameterizations of the input. Our starting point is the folklore result that Hitting Set is polynomial-time solvable if there is a tree T on vertex set U such that the sets in F induce connected subtrees of T. We consider the case that there is a treelike graph with vertex set U such that the sets in F induce connected subgraphs; the parameter of the problem is a measure of how treelike the graph is. Our main positive result is an algorithm that, given a graph G with cyclomatic number k, a collection P of simple paths in G, and an integer t, determines in time 2^{5k} (|G| +|P|)^O(1) whether there is a vertex set of size t that hits all paths in P. It is based on a connection to the 2-SAT problem in multiple valued logic. For other parameterizations we derive W[1]-hardness and para-NP-completeness results.Comment: Presented at the 41st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2015. (The statement of Lemma 4 was corrected in this update.

Hitting forbidden subgraphs in graphs of bounded treewidth

We study the complexity of a generic hitting problem H-Subgraph Hitting, where given a fixed pattern graph $H$ and an input graph $G$, the task is to find a set $X \subseteq V(G)$ of minimum size that hits all subgraphs of $G$ isomorphic to $H$. In the colorful variant of the problem, each vertex of $G$ is precolored with some color from $V(H)$ and we require to hit only $H$-subgraphs with matching colors. Standard techniques shows that for every fixed $H$, the problem is fixed-parameter tractable parameterized by the treewidth of $G$; however, it is not clear how exactly the running time should depend on treewidth. For the colorful variant, we demonstrate matching upper and lower bounds showing that the dependence of the running time on treewidth of $G$ is tightly governed by $\mu(H)$, the maximum size of a minimal vertex separator in $H$. That is, we show for every fixed $H$ that, on a graph of treewidth $t$, the colorful problem can be solved in time $2^{\mathcal{O}(t^{\mu(H)})}\cdot|V(G)|$, but cannot be solved in time $2^{o(t^{\mu(H)})}\cdot |V(G)|^{O(1)}$, assuming the Exponential Time Hypothesis (ETH). Furthermore, we give some preliminary results showing that, in the absence of colors, the parameterized complexity landscape of H-Subgraph Hitting is much richer.Comment: A full version of a paper presented at MFCS 201

Substance Misuse Education for Physicians: Why Older People are Important.

This perspective article focuses on the need for training and education for undergraduate medical students on substance-related disorders, and describes initiatives undertaken in the United Kingdom (UK), Netherlands, United States (US), and Norway to develop the skills, knowledge, and attitudes needed by future doctors to treat patients adequately. In addition, we stress that in postgraduate training, further steps should be taken to develop Addiction Medicine as a specialized and transverse medical domain. Alcohol use disorder is a growing public health problem in the geriatric population, and one that is likely to continue to increase as the baby boomer generation ages. Prescription drug misuse is a major concern, and nicotine misuse remains problematic in a substantial minority. Thus, Addiction Medicine training should address the problems for this specific population. In recent years, several countries have started an Addiction Medicine specialty. Although addiction psychiatry has been a subspecialty in the UK and US for more than 20 years, in most countries it has been a more recent development. Additional courses on addiction should be integrated into the curriculum at both undergraduate and postgraduate levels, as well as form part of the continuous training of other medical specialists. It is recommended that further research and mapping of what is currently taught in medical programs be undertaken, so as to enhance medical education in addiction and improve treatment services

Tight Kernel Bounds for Problems on Graphs with Small Degeneracy

In this paper we consider kernelization for problems on d-degenerate graphs, i.e. graphs such that any subgraph contains a vertex of degree at most $d$. This graph class generalizes many classes of graphs for which effective kernelization is known to exist, e.g. planar graphs, H-minor free graphs, and H-topological-minor free graphs. We show that for several natural problems on d-degenerate graphs the best known kernelization upper bounds are essentially tight.Comment: Full version of ESA 201

Parents' points of view: an evaluation of the M'Lop Tapang special needs programme, Cambodia

M’Lop Tapang is a registered non-governmental organisation working in South West Cambodia and providing services to 5000 vulnerable children and 2500 families. This evaluation was commissioned to review M’Lop Tapang’s special needs programme. Interviews were conducted with 35 parents / carers of children who receive services from M’Lop Tapang’s special needs programme . Nearly all of these parents / carers reported that they had noticed improvements in their children’s behaviour or functional ability since attending the programme. Significantly, almost all also reported a dramatic reduction in stress as a result of their child attending the programmes. While the study revealed many positive aspects of M'Lop Tapang’s special needs programme it also highlighted areas for improvement, particularly in areas of parental learning and education

Julian of Norwich and her children today: Editions, translations and versions of her revelations

The viability of such concepts as "authorial intention," "the original text," "critical edition" and, above all, "scholarly editorial objectivity" is not what it was, and a study of the textual progeny of the revelations of Julian of Norwich--editions, versions, translations and selections--does little to rehabilitate them. Rather it tends to support the view that a history of reading is indeed a history of misreading or, more positively, that texts can have an organic life of their own that allows them to reproduce and evolve quite independently of their author. Julian's texts have had a more robustly continuous life than those of any other Middle English mystic. Their history--in manuscript and print, in editions more or less approximating Middle English and in translations more or less approaching Modern English--is virtually unbroken since the fifteenth century. But on this perilous journey, many and strange are the clutches into which she and her textual progeny have fallen

PHYTOCHEMICAL SCREENING AND ANALYSIS POLYPHENOLIC ANTIOXIDANT ACTIVITY OF METHANOLIC EXTRACT OF WHITE DRAGON FRUIT (Hylocereus undatus)

White dragon fruit is a well known and widely used herbal medicine, especially in Asia, which contains several interesting bioactive constituents and possesses health promoting properties. The aim of this study was to analyze for the bioactive compounds, evaluate total phenolic contents and antioxidant capacities of methanolic extract of white dragon fruit. The antioxidant activity was determined by the 1,1-diphenyl-2-picrylhydrazyl (DPPH) free radical scavenging activity assay. Total phenolic content were determined by Folin-Ciocalteu method. Phytochemical screening of the white dragon fruit showed the presence of triterpenoid, alkaloid, flavonoid and saponin. The extract exhibited strong antioxidant activity with IC50 of 193 μg/mL, and total phenolic content of 246 μg/mL in 1 Kg dry extract