Precise Localization of the Soft Gamma Repeater SGR 1627-41 and the Anomalous X-ray Pulsar AXP 1E1841-045 with Chandra

We present precise localizations of AXP 1E1841-045 and SGR 1627-41 with Chandra. We obtained new infrared observations of SGR 1627-41 and reanalyzed archival observations of AXP 1E1841-045 in order to refine their positions and search for infrared counterparts. A faint source is detected inside the error circle of AXP 1E1841-045. In the case of SGR 1627-41, several sources are located within the error radius of the X-ray position and we discuss the likelihood of one of them being the counterpart. We compare the properties of our candidates to those of other known AXP and SGR counterparts. We find that the counterpart candidates for SGR 1627-41 and SGR 1806-20 would have to be intrinsically much brighter than AXPs to have detectable counterparts with the observational limits currently available for these sources. To confirm the reported counterpart of SGR 1806-20, we obtained new IR observations during the July 2003 burst activation of the source. No brightening of the suggested counterpart is detected, implying that the counterpart of SGR 1806-20 remains yet to be identified.Comment: 29 pages, 4 figures, accepted for publication in Ap

Independent Set Reconfiguration in Cographs

We study the following independent set reconfiguration problem, called TAR-Reachability: given two independent sets $I$ and $J$ of a graph $G$, both of size at least $k$, is it possible to transform $I$ into $J$ by adding and removing vertices one-by-one, while maintaining an independent set of size at least $k$ throughout? This problem is known to be PSPACE-hard in general. For the case that $G$ is a cograph (i.e. $P_4$-free graph) on $n$ vertices, we show that it can be solved in time $O(n^2)$, and that the length of a shortest reconfiguration sequence from $I$ to $J$ is bounded by $4n-2k$, if such a sequence exists. More generally, we show that if $X$ is a graph class for which (i) TAR-Reachability can be solved efficiently, (ii) maximum independent sets can be computed efficiently, and which satisfies a certain additional property, then the problem can be solved efficiently for any graph that can be obtained from a collection of graphs in $X$ using disjoint union and complete join operations. Chordal graphs are given as an example of such a class $X$

Retention of Supraspinal Delta-like Analgesia and Loss of Morphine Tolerance in δ Opioid Receptor Knockout Mice

AbstractGene targeting was used to delete exon 2 of mouse DOR-1, which encodes the δ opioid receptor. Essentially all 3H-[D-Pen2,D-Pen5]enkephalin (3H-DPDPE) and 3H-[D-Ala2,D-Glu4]deltorphin (3H-deltorphin-2) binding is absent from mutant mice, demonstrating that DOR-1 encodes both δ1 and δ2 receptor subtypes. Homozygous mutant mice display markedly reduced spinal δ analgesia, but peptide δ agonists retain supraspinal analgesic potency that is only partially antagonized by naltrindole. Retained DPDPE analgesia is also demonstrated upon formalin testing, while the nonpeptide δ agonist BW373U69 exhibits enhanced activity in DOR-1 mutant mice. Together, these findings suggest the existence of a second delta-like analgesic system. FinallyDOR-1 mutant mice do not develop analgesic tolerance to morphine, genetically demonstrating a central role for DOR-1 in this process

Register Allocation After Classical SSA Elimination is NP-Complete

Abstract. Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference graph of a program in static single assignment (SSA) form is chordal and therefore colorable in linear time. Can we use the result of Bouchez et al. to do register allocation in polynomial time by first transforming the program to SSA form, then performing register allocation, and finally doing the classical SSA elimination that replaces φ-functions with copy instructions? In this paper we show that the answer is no, unless P = NP: register allocation after classical SSA elimination is NP-complete. Chaitin’s proof technique does not work for programs after classical SSA elimination; instead we use a reduction from the graph coloring problem for circular arc graphs.

Reconfiguration of Cliques in a Graph

We study reconfiguration problems for cliques in a graph, which determine whether there exists a sequence of cliques that transforms a given clique into another one in a step-by-step fashion. As one step of a transformation, we consider three different types of rules, which are defined and studied in reconfiguration problems for independent sets. We first prove that all the three rules are equivalent in cliques. We then show that the problems are PSPACE-complete for perfect graphs, while we give polynomial-time algorithms for several classes of graphs, such as even-hole-free graphs and cographs. In particular, the shortest variant, which computes the shortest length of a desired sequence, can be solved in polynomial time for chordal graphs, bipartite graphs, planar graphs, and bounded treewidth graphs

Register Allocation Via Coloring of Chordal Graphs

Abstract. We present a simple algorithm for register allocation which is competitive with the iterated register coalescing algorithm of George and Appel. We base our algorithm on the observation that 95 % of the methods in the Java 1.5 library have chordal interference graphs when compiled with the JoeQ compiler. A greedy algorithm can optimally color a chordal graph in time linear in the number of edges, and we can eas-ily add powerful heuristics for spilling and coalescing. Our experiments show that the new algorithm produces better results than iterated regis-ter coalescing for settings with few registers and comparable results for settings with many registers.

Global patient outcomes after elective surgery: prospective cohort study in 27 low-, middle- and high-income countries.

BACKGROUND: As global initiatives increase patient access to surgical treatments, there remains a need to understand the adverse effects of surgery and define appropriate levels of perioperative care. METHODS: We designed a prospective international 7-day cohort study of outcomes following elective adult inpatient surgery in 27 countries. The primary outcome was in-hospital complications. Secondary outcomes were death following a complication (failure to rescue) and death in hospital. Process measures were admission to critical care immediately after surgery or to treat a complication and duration of hospital stay. A single definition of critical care was used for all countries. RESULTS: A total of 474 hospitals in 19 high-, 7 middle- and 1 low-income country were included in the primary analysis. Data included 44 814 patients with a median hospital stay of 4 (range 2-7) days. A total of 7508 patients (16.8%) developed one or more postoperative complication and 207 died (0.5%). The overall mortality among patients who developed complications was 2.8%. Mortality following complications ranged from 2.4% for pulmonary embolism to 43.9% for cardiac arrest. A total of 4360 (9.7%) patients were admitted to a critical care unit as routine immediately after surgery, of whom 2198 (50.4%) developed a complication, with 105 (2.4%) deaths. A total of 1233 patients (16.4%) were admitted to a critical care unit to treat complications, with 119 (9.7%) deaths. Despite lower baseline risk, outcomes were similar in low- and middle-income compared with high-income countries. CONCLUSIONS: Poor patient outcomes are common after inpatient surgery. Global initiatives to increase access to surgical treatments should also address the need for safe perioperative care. STUDY REGISTRATION: ISRCTN5181700