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

Parameterized Algorithms for Graph Partitioning Problems

We study a broad class of graph partitioning problems, where each problem is specified by a graph $G=(V,E)$, and parameters $k$ and $p$. We seek a subset $U\subseteq V$ of size $k$, such that $\alpha_1m_1 + \alpha_2m_2$ is at most (or at least) $p$, where $\alpha_1,\alpha_2\in\mathbb{R}$ are constants defining the problem, and $m_1, m_2$ are the cardinalities of the edge sets having both endpoints, and exactly one endpoint, in $U$, respectively. This class of fixed cardinality graph partitioning problems (FGPP) encompasses Max $(k,n-k)$-Cut, Min $k$-Vertex Cover, $k$-Densest Subgraph, and $k$-Sparsest Subgraph. Our main result is an $O^*(4^{k+o(k)}\Delta^k)$ algorithm for any problem in this class, where $\Delta \geq 1$ is the maximum degree in the input graph. This resolves an open question posed by Bonnet et al. [IPEC 2013]. We obtain faster algorithms for certain subclasses of FGPPs, parameterized by $p$, or by $(k+p)$. In particular, we give an $O^*(4^{p+o(p)})$ time algorithm for Max $(k,n-k)$-Cut, thus improving significantly the best known $O^*(p^p)$ time algorithm

02. Front Matter - Who Will Care For Me in 2020?

In the Summer of 1979 Profs. Robert Guhde and Ed Downey of the Department of Public Administration at the College at Brockport offered a special seminar to consider ways to deal with rising health care costs with a focus on long term care. The seminar called Public Management Simulation included a competition among MPA students from Brockport, Syracuse University, and SUNY Albany to see who could come up with the best solutions. The seminar and competition were funded by a grant to the Department of Public Administration from the 1979 Title IX Higher Education Act. Papers from the students were edited and published as a book entitled: Who Will Take Care of Me in 2020? A Speculative Look at Government-Funded Long Term Care. Prof. Guhde submitted the paper written by the Brockport students (Laura Volk, Jeanne B. Hutchins, and Jean S. Doremus) to the Public Administration Review, where it won the prestigious Garvey Award and was published in the Sep. – Oct. 1980 edition of the journal. This work is of interest today because it chronicles earlier attempts to deal with rising health care costs and provides insight into some of the policy and administrative remedies under current discussion

04. Introduction

The Public Management Simulation (PMS) was conceived as a unique way to combine teaching and research in, public administration. The ideal of combining teaching and research all too often finds its expression as a classroom lecture on somebody\u27s pet study or as the lonely process of grinding out a dissertation or thesis. While both of these methods have undeniable merit, they tend to lack the vitality and challenge that comes from working with a group of intelligent and informed people to understand complex social phenomenon. PMS provides an alternative that utilizes the students as policy researchers with the added stimulus of an adversary setting. In this instance the PMS was used to develop alternatives for government funding of Long Term Care

01. Who Will Take Care of Me in 2020? (Full text)

In the Summer of 1979 Profs. Robert Guhde and Ed Downey of the Department of Public Administration at the College at Brockport offered a special seminar to consider ways to deal with rising health care costs with a focus on long term care. The seminar called Public Management Simulation included a competition among MPA students from Brockport, Syracuse University, and SUNY Albany to see who could come up with the best solutions. The seminar and competition were funded by a grant to the Department of Public Administration from the 1979 Title IX Higher Education Act. Papers from the students were edited and published as a book entitled: Who Will Take Care of Me in 2020? A Speculative Look at Government-Funded Long Term Care. Prof. Guhde submitted the paper written by the Brockport students (Laura Volk, Jeanne B. Hutchins, and Jean S. Doremus) to the Public Administration Review, where it won the prestigious Garvey Award and was published in the Sep. – Oct. 1980 edition of the journal. This work is of interest today because it chronicles earlier attempts to deal with rising health care costs and provides insight into some of the policy and administrative remedies under current discussion

Steady-state evoked potentials possibilities for mental-state estimation

The use of the human steady-state evoked potential (SSEP) as a possible measure of mental-state estimation is explored. A method for evoking a visual response to a sum-of-ten sine waves is presented. This approach provides simultaneous multiple frequency measurements of the human EEG to the evoking stimulus in terms of describing functions (gain and phase) and remnant spectra. Ways in which these quantities vary with the addition of performance tasks (manual tracking, grammatical reasoning, and decision making) are presented. Models of the describing function measures can be formulated using systems engineering technology. Relationships between model parameters and performance scores during manual tracking are discussed. Problems of unresponsiveness and lack of repeatability of subject responses are addressed in terms of a need for loop closure of the SSEP. A technique to achieve loop closure using a lock-in amplifier approach is presented. Results of a study designed to test the effectiveness of using feedback to consciously connect humans to their evoked response are presented. Findings indicate that conscious control of EEG is possible. Implications of these results in terms of secondary tasks for mental-state estimation and brain actuated control are addressed

Degree spectra for transcendence in fields

We show that for both the unary relation of transcendence and the finitary relation of algebraic independence on a field, the degree spectra of these relations may consist of any single computably enumerable Turing degree, or of those c.e. degrees above an arbitrary fixed $\Delta^0_2$ degree. In other cases, these spectra may be characterized by the ability to enumerate an arbitrary $\Sigma^0_2$ set. This is the first proof that a computable field can fail to have a computable copy with a computable transcendence basis

The Complexity of Routing with Few Collisions

We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph $G$ with two distinct terminal vertices and two positive integers $p$ and $k$, the question is whether one can connect the terminals by at least $p$ routes (e.g. paths) such that at most $k$ edges are time-wise shared among them. We study three types of routes: traverse each vertex at most once (paths), each edge at most once (trails), or no such restrictions (walks). We prove that for paths and trails the problem is NP-complete on undirected and directed graphs even if $k$ is constant or the maximum vertex degree in the input graph is constant. For walks, however, it is solvable in polynomial time on undirected graphs for arbitrary $k$ and on directed graphs if $k$ is constant. We additionally study for all route types a variant of the problem where the maximum length of a route is restricted by some given upper bound. We prove that this length-restricted variant has the same complexity classification with respect to paths and trails, but for walks it becomes NP-complete on undirected graphs

A Process Evaluation of the HappyHealthy SocIal Marketing Campaign

Social marketing campaigns are effective in promoting health behavior changes in individuals and communities. Mississippi State University Extension Service’s (MSU Extension) Office of Nutrition Education launched a statewide social marketing campaign branded HappyHealthy to target nutrition and healthy lifestyle-related behaviors of Supplemental Nutrition Assistance Program-eligible individuals and families. In this study, a process evaluation was conducted with MSU Extension staff to assess perceptions of the campaign’s relative advantage, compatibility, complexity, trialability, and observability. In the early stages of the campaign, external evaluators conducted in-depth interviews with MSU Extension staff members (n = 17). After the campaign had been active for several months, the same external evaluators developed a web-based survey instrument for administration with MSU Extension staff (n = 54). Interview and survey responses were interpreted in accordance with Roger’s diffusion of innovation theory. Staff responses indicated it is important that campaign messages and materials align with and enhance staff members’ job responsibilities and that campaign messages are consistent with other education being delivered. Allowing staff to get familiar with some campaign materials before they are responsible for using them may also be advantageous for successful adoption and implementation