Comment on "Conjectures on exact solution of three-dimensional (3D) simple orthorhombic Ising lattices" [arXiv:0705.1045]

It is shown that a recent article by Z.-D. Zhang [arXiv:0705.1045] is in error and violates well-known theorems.Comment: LaTeX, 3 pages, no figures, submitted to Philosophical Magazine. Expanded versio

Incremental Grid-like Layout Using Soft and Hard Constraints

We explore various techniques to incorporate grid-like layout conventions into a force-directed, constraint-based graph layout framework. In doing so we are able to provide high-quality layout---with predominantly axis-aligned edges---that is more flexible than previous grid-like layout methods and which can capture layout conventions in notations such as SBGN (Systems Biology Graphical Notation). Furthermore, the layout is easily able to respect user-defined constraints and adapt to interaction in online systems and diagram editors such as Dunnart.Comment: Accepted to Graph Drawing 201

On Packet Scheduling with Adversarial Jamming and Speedup

In Packet Scheduling with Adversarial Jamming packets of arbitrary sizes arrive over time to be transmitted over a channel in which instantaneous jamming errors occur at times chosen by the adversary and not known to the algorithm. The transmission taking place at the time of jamming is corrupt, and the algorithm learns this fact immediately. An online algorithm maximizes the total size of packets it successfully transmits and the goal is to develop an algorithm with the lowest possible asymptotic competitive ratio, where the additive constant may depend on packet sizes. Our main contribution is a universal algorithm that works for any speedup and packet sizes and, unlike previous algorithms for the problem, it does not need to know these properties in advance. We show that this algorithm guarantees 1-competitiveness with speedup 4, making it the first known algorithm to maintain 1-competitiveness with a moderate speedup in the general setting of arbitrary packet sizes. We also prove a lower bound of $\phi+1\approx 2.618$ on the speedup of any 1-competitive deterministic algorithm, showing that our algorithm is close to the optimum. Additionally, we formulate a general framework for analyzing our algorithm locally and use it to show upper bounds on its competitive ratio for speedups in $[1,4)$ and for several special cases, recovering some previously known results, each of which had a dedicated proof. In particular, our algorithm is 3-competitive without speedup, matching both the (worst-case) performance of the algorithm by Jurdzinski et al. and the lower bound by Anta et al.Comment: Appeared in Proc. of the 15th Workshop on Approximation and Online Algorithms (WAOA 2017

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility

Word equations are a crucial element in the theoretical foundation of constraint solving over strings, which have received a lot of attention in recent years. A word equation relates two words over string variables and constants. Its solution amounts to a function mapping variables to constant strings that equate the left and right hand sides of the equation. While the problem of solving word equations is decidable, the decidability of the problem of solving a word equation with a length constraint (i.e., a constraint relating the lengths of words in the word equation) has remained a long-standing open problem. In this paper, we focus on the subclass of quadratic word equations, i.e., in which each variable occurs at most twice. We first show that the length abstractions of solutions to quadratic word equations are in general not Presburger-definable. We then describe a class of counter systems with Presburger transition relations which capture the length abstraction of a quadratic word equation with regular constraints. We provide an encoding of the effect of a simple loop of the counter systems in the theory of existential Presburger Arithmetic with divisibility (PAD). Since PAD is decidable, we get a decision procedure for quadratic words equations with length constraints for which the associated counter system is \emph{flat} (i.e., all nodes belong to at most one cycle). We show a decidability result (in fact, also an NP algorithm with a PAD oracle) for a recently proposed NP-complete fragment of word equations called regular-oriented word equations, together with length constraints. Decidability holds when the constraints are additionally extended with regular constraints with a 1-weak control structure.Comment: 18 page

Online Multi-Coloring with Advice

We consider the problem of online graph multi-coloring with advice. Multi-coloring is often used to model frequency allocation in cellular networks. We give several nearly tight upper and lower bounds for the most standard topologies of cellular networks, paths and hexagonal graphs. For the path, negative results trivially carry over to bipartite graphs, and our positive results are also valid for bipartite graphs. The advice given represents information that is likely to be available, studying for instance the data from earlier similar periods of time.Comment: IMADA-preprint-c

A Reflection on Teaching and Learning in a Community Literacies Graduate Course

Th is article outlines one potential model for a graduate–level course in community literacy studies. Ellen Cushman and Jeffrey Grabill taught this course for the first time at Michigan State University in the spring of 2007. In this article our colleagues with varying disciplinary backgrounds reflect on the course, its readings, and their theoretical and practical understanding surrounding many of the central questions of this new discipline: what is a community? What is literacy? What is community literacy? And what does it mean to practice “community literacy”—to write, to speak, and so on? After a wide discussion of course experience from several student colleagues in the course, Cushman and Grabill reflect on their course objectives and point toward future incarnations of the course

Algorithms for Stable Matching and Clustering in a Grid

We study a discrete version of a geometric stable marriage problem originally proposed in a continuous setting by Hoffman, Holroyd, and Peres, in which points in the plane are stably matched to cluster centers, as prioritized by their distances, so that each cluster center is apportioned a set of points of equal area. We show that, for a discretization of the problem to an $n\times n$ grid of pixels with $k$ centers, the problem can be solved in time $O(n^2 \log^5 n)$, and we experiment with two slower but more practical algorithms and a hybrid method that switches from one of these algorithms to the other to gain greater efficiency than either algorithm alone. We also show how to combine geometric stable matchings with a $k$-means clustering algorithm, so as to provide a geometric political-districting algorithm that views distance in economic terms, and we experiment with weighted versions of stable $k$-means in order to improve the connectivity of the resulting clusters.Comment: 23 pages, 12 figures. To appear (without the appendices) at the 18th International Workshop on Combinatorial Image Analysis, June 19-21, 2017, Plovdiv, Bulgari

Bounded Languages Meet Cellular Automata with Sparse Communication

Cellular automata are one-dimensional arrays of interconnected interacting finite automata. We investigate one of the weakest classes, the real-time one-way cellular automata, and impose an additional restriction on their inter-cell communication by bounding the number of allowed uses of the links between cells. Moreover, we consider the devices as acceptors for bounded languages in order to explore the borderline at which non-trivial decidability problems of cellular automata classes become decidable. It is shown that even devices with drastically reduced communication, that is, each two neighboring cells may communicate only constantly often, accept bounded languages that are not semilinear. If the number of communications is at least logarithmic in the length of the input, several problems are undecidable. The same result is obtained for classes where the total number of communications during a computation is linearly bounded

Nucleus Accumbens Adenosine A2A Receptors Regulate Exertion of Effort by Acting on the Ventral Striatopallidal Pathway

Goal-directed actions are sensitive to work-related response costs, and dopamine in nucleus accumbens is thought to modulate the exertion of effort in motivated behavior. Dopamine-rich striatal areas such as nucleus accumbens also contain high numbers of adenosine A2A receptors, and, for that reason, the behavioral and neurochemical effects of the adenosine A2A receptor agonist CGS 21680 [2-p-(2-carboxyethyl) phenethylamino-5′-N-ethylcarboxamidoadenosine] were investigated. Stimulation of accumbens adenosine A2A receptors disrupted performance of an instrumental task with high work demands (i.e., an interval lever-pressing schedule with a ratio requirement attached) but had little effect on a task with a lower work requirement. Immunohistochemical studies revealed that accumbens neurons that project to the ventral pallidum showed adenosine A2A receptors immunoreactivity. Moreover, activation of accumbens A2A receptors by local injections of CGS 21680 increased extracellular GABA levels in the ventral pallidum. Combined contralateral injections of CGS 21680 into the accumbens and the GABAA agonist muscimol into ventral pallidum (i.e., “disconnection” methods) also impaired response output, indicating that these structures are part of a common neural circuitry regulating the exertion of effort. Thus, accumbens adenosine A2A receptors appear to regulate behavioral activation and effort-related processes by modulating the activity of the ventral striatopallidal pathway. Research on the effort-related functions of these forebrain systems may lead to a greater understanding of pathological features of motivation, such as psychomotor slowing, anergia, and fatigue in depression

Coordinated grid and place cell replay during rest

Hippocampal replay has been hypothesized to underlie memory consolidation and navigational planning, yet the involvement of grid cells in replay is unknown. During replay we found grid cells to be spatially coherent with place cells, encoding locations 11 ms delayed relative to the hippocampus, with directionally modulated grid cells and forward replay exhibiting the greatest coherence with the CA1 area of the hippocampus. This suggests grid cells are engaged during the consolidation of spatial memories to the neocortex