Structural parameterizations for boxicity

The boxicity of a graph $G$ is the least integer $d$ such that $G$ has an intersection model of axis-aligned $d$-dimensional boxes. Boxicity, the problem of deciding whether a given graph $G$ has boxicity at most $d$, is NP-complete for every fixed $d \ge 2$. We show that boxicity is fixed-parameter tractable when parameterized by the cluster vertex deletion number of the input graph. This generalizes the result of Adiga et al., that boxicity is fixed-parameter tractable in the vertex cover number. Moreover, we show that boxicity admits an additive $1$-approximation when parameterized by the pathwidth of the input graph. Finally, we provide evidence in favor of a conjecture of Adiga et al. that boxicity remains NP-complete when parameterized by the treewidth.Comment: 19 page

The maximum number of minimal codewords in an [n,k]−[n,k]-code

Upper and lower bounds are derived for the quantity in the title, which is tabulated for modest values of $n$ and $k.$ An application to graphs with many cycles is given.Comment: 6 pp. Submitte

Газоаналитические средства системы контроля утечек хлора на основе электрохимических сенсоров

Созданы и внедряются газоаналитические средства контроля и сигнализации утечек хлора на основе электрохимических сенсоров с улучшенными характеристиками

From paradox to pattern shift: Conceptualising liminal hotspots and their affective dynamics

This article introduces the concept of liminal hotspots as a specifically psychosocial and sociopsychological type of wicked problem, best addressed in a process-theoretical framework. A liminal hotspot is defined as an occasion characterised by the experience of being trapped in the interstitial dimension between different forms-of-process. The paper has two main aims. First, to articulate a nexus of concepts associated with liminal hotspots that together provide general analytic purchase on a wide range of problems concerning “troubled” becoming. Second, to provide concrete illustrations through examples drawn from the health domain. In the conclusion, we briefly indicate the sense in which liminal hotspots are part of broader and deeper historical processes associated with changing modes for the management and navigation of liminality

Plasmas and Controlled Nuclear Fusion

Contains reports on three research projects.U. S. Atomic Energy Commission (Contract AT(30-1)-3980

Suspended liminality: Vacillating affects in cyberbullying/research

This paper develops a concept of liminal hotspots in the context of i) a secondary analysis of a cyberbullying case involving a group of school children from a Danish school, and ii) an altered auto-ethnography in which the authors ‘entangle’ their own experiences with the case analysis. These two sources are used to build an account of a liminal hotspot conceived as an occasion of troubled and suspended transformative transition in which a liminal phase is extended and remains unresolved. The altered auto-ethnography is used to explore the affectivity at play in liminal hotspots, and this liminal affectivity is characterised in terms of volatility, vacillation, suggestibility and paradox

Voting procedures and parliamentary representation in the European Parliament

Parliamentary representation is a fluid concept. Yet, while the behaviour of elected representatives during roll call votes has been widely analysed, we know little about how parliamentarians act when their individual voting choices are not made public. This paper explores the relationship between voting procedures and the likelihood that Members of the European Parliament prioritise the interests of their EP party group versus the interests of their national party. Using an original survey, I find that MEPs are more likely to prioritise the interests of their national party over those of their EP party group when voting by show of hands or electronically, as opposed to by roll call. Moreover, this voting procedure effect is particularly salient among MEPs elected from 2004/07 accession countries

Convexity-Increasing Morphs of Planar Graphs

We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawing of an internally 3-connected graph, we show how to morph the drawing to one with strictly convex faces while maintaining planarity at all times. Our morph is convexity-increasing, meaning that once an angle is convex, it remains convex. We give an efficient algorithm that constructs such a morph as a composition of a linear number of steps where each step either moves vertices along horizontal lines or moves vertices along vertical lines. Moreover, we show that a linear number of steps is worst-case optimal. To obtain our result, we use a well-known technique by Hong and Nagamochi for finding redrawings with convex faces while preserving y-coordinates. Using a variant of Tutte's graph drawing algorithm, we obtain a new proof of Hong and Nagamochi's result which comes with a better running time. This is of independent interest, as Hong and Nagamochi's technique serves as a building block in existing morphing algorithms.Comment: Preliminary version in Proc. WG 201

Applied Plasma Research

Contains research objectives and reports on three research projects.National Science Foundation (Grant GK-18185)Lincoln Laboratory Purchase Order No. CC-554U. S. Navy (Office of Naval Research) under Contract N00014-67-A-0204-0019Air Force Office of Scientific Researc