Dark Matter Halo Structure in CDM Hydrodynamical Simulations

We have carried out a comparative analysis of the properties of dark matter halos in N-body and hydrodynamical simulations. We analyze their density profiles, shapes and kinematical properties with the aim of assessing the effects that hydrodynamical processes might produce on the evolution of the dark matter component. The simulations performed allow us to reproduce dark matter halos with high resolution, although the range of circular velocities is limited. We find that for halos with circular velocities of $[150-200] km s^{-1}$ at the virial radius, the presence of baryons affects the evolution of the dark matter component in the central region modifying the density profiles, shapes and velocity dispersions. We also analyze the rotation velocity curves of disk-like structures and compare them with observational results.Comment: 28 pages, 15 figures (figures 3ab sent by request), 2 tables. Accepted for publication MNRA

Polynomial kernels for 3-leaf power graph modification problems

A graph G=(V,E) is a 3-leaf power iff there exists a tree T whose leaves are V and such that (u,v) is an edge iff u and v are at distance at most 3 in T. The 3-leaf power graph edge modification problems, i.e. edition (also known as the closest 3-leaf power), completion and edge-deletion, are FTP when parameterized by the size of the edge set modification. However polynomial kernel was known for none of these three problems. For each of them, we provide cubic kernels that can be computed in linear time for each of these problems. We thereby answer an open problem first mentioned by Dom, Guo, Huffner and Niedermeier (2005).Comment: Submitte

Parameterized Algorithms for Modular-Width

It is known that a number of natural graph problems which are FPT parameterized by treewidth become W-hard when parameterized by clique-width. It is therefore desirable to find a different structural graph parameter which is as general as possible, covers dense graphs but does not incur such a heavy algorithmic penalty. The main contribution of this paper is to consider a parameter called modular-width, defined using the well-known notion of modular decompositions. Using a combination of ILPs and dynamic programming we manage to design FPT algorithms for Coloring and Partitioning into paths (and hence Hamiltonian path and Hamiltonian cycle), which are W-hard for both clique-width and its recently introduced restriction, shrub-depth. We thus argue that modular-width occupies a sweet spot as a graph parameter, generalizing several simpler notions on dense graphs but still evading the "price of generality" paid by clique-width.Comment: to appear in IPEC 2013. arXiv admin note: text overlap with arXiv:1304.5479 by other author

Effectiveness of two web-based cognitive bias modification interventions targeting approach and attentional bias in gambling problems:Study protocol for a pilot randomised controlled trial

BACKGROUND: Disordered gamblers have phenotypical and pathological similarities to those with substance use disorders (SUD), including exaggerated automatic cognitive processing of motivationally salient gambling cues in the environment (i.e., attentional and approach bias). Cognitive bias modification (CBM) is a family of computerised interventions that have proved effective in successfully re-training these automatic cognitive biases in SUD. CBM interventions can, in principle, be administered online, thus showing potential of being a low-cost, low-threshold addition to conventional treatments. This paper presents the design of a pilot randomised controlled trial exploring the effectiveness of two web-based CBM interventions targeting attentional and approach bias towards gambling cues in a sample of Dutch and Belgian problematic and pathological gamblers. METHODS/DESIGN: Participants (N = 182) are community-recruited adults experiencing gambling problems, who have gambled at least twice in the past 6 months and are motivated to change their gambling behaviour. After a baseline assessment session, participants are randomly assigned to one of four experimental conditions (attentional or approach bias training, or the placebo version of the two trainings) and complete six sessions of training. At baseline and before each training session, participants receive automated personalised feedback on their gambling motives and reasons to quit or reduce gambling. The post-intervention, 1-month, and 3-month follow-up assessments will examine changes in gambling behaviour, with frequency and expenditure as primary outcomes, and depressive symptoms and gambling-related attentional and approach biases as secondary outcomes. Secondary analyses will explore possible moderators (interference control capacity and trait impulsivity) and mediators (change in cognitive bias) of training effects on the primary outcomes. DISCUSSION: This study is the first to explore the effectiveness of an online CBM intervention for gambling problems. The results of this study can be extremely valuable for developing e-health interventions for gambling problems and further understanding the role of motivational implicit cognitive processes underlying problematic gambling behaviour. TRIAL REGISTRATION: Netherlands Trial Register, NTR5096 . Registered on 11 March 2015

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.

Design Simulation of Multiple Differential Transceiver at 2.0 GHz for Third Generation Mobile Communication System

Third generation mobile communication system is widely used nowadays. One of its parameter standard, which is QPSK modulation has been adopted by International Telecommunication Union (ITU) to be used in IMT-2000. However, due to amplitude variations introduced in QPSK, a rather robust and reliable data modulation technique, namely the 7c/4-shift Differential QPSK is proposed. For detection purposes, two types of detectors are evaluated for their performance in AWGN and Rayleigh fading channels. A differential detection technique called multiple differential detection technique which uses maximum-likelihood sequence estimation (MLSE) of the transmitted phases is compared with conventional differential detection which uses symbol-bysymbol detection. By using some of the IMT-2000 standard parameters, the simulation results show that multiple differential detection scheme performs much better than conventional differential detection scheme

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