Oblivious permutations on the plane

We consider a distributed system of n identical mobile robots operating in the two dimensional Euclidian plane. As in the previous studies, we consider the robots to be anonymous, oblivious, dis-oriented, and without any communication capabilities, operating based on the Look-Compute-Move model where the next location of a robot depends only on its view of the current configuration. Even in this seemingly weak model, most formation problems which require constructing specific configurations, can be solved quite easily when the robots are fully synchronized with each other. In this paper we introduce and study a new class of problems which, unlike the studied formation problems, cannot always be solved even in the fully synchronous model with atomic and rigid moves. This class of problems requires the robots to permute their locations in the plane. In particular, we are interested in implementing two special types of permutations - permutations without any fixed points and permutations of order n. The former (called Move-All) requires each robot to visit at least two of the initial locations, while the latter (called Visit-All) requires every robot to visit each of the initial locations in a periodic manner. We provide a characterization of the solvability of these problems, showing the main challenges in solving this class of problems for mobile robots. We also provide algorithms for the feasible cases, in particular distinguishing between one-step algorithms (where each configuration must be a permutation of the original configuration) an

Colocalization of 14-3-3 Proteins with SOD1 in Lewy Body-Like Hyaline Inclusions in Familial Amyotrophic Lateral Sclerosis Cases and the Animal Model

Background and Purpose: Cu/Zn superoxide dismutase (SOD1) is a major component of Lewy body-like hyaline inclusion (LBHI) found in the postmortem tissue of SOD1-linked familial amyotrophic lateral sclerosis (FALS) patients. In our recent studies, 14-3-3 proteins have been found in the ubiquitinated inclusions inside the anterior horn cells of spinal cords with sporadic amyotrophic lateral sclerosis (ALS). To further investigate the role of 14-3-3 proteins in ALS, we performed immunohistochemical analysis of 14-3-3 proteins and compared their distributions with those of SOD1 in FALS patients and SOD1-overexpressing mice. Methods: We examined the postmortem brains and the spinal cords of three FALS cases (A4V SOD1 mutant). Transgenic mice expressing the G93A mutant human SOD1 (mutant SOD1-Tg mice), transgenic mice expressing the wild-type human SOD1 (wild-type SOD1-Tg mice), and non-Tg wild-type mice were also subjected to the immunohistochemical analysis. Results: In all the FALS patients, LBHIs were observed in the cytoplasm of the anterior horn cells, and these inclusions were immunopositive intensely for pan 14-3-3, 14-3-3$\beta$, and 14-3-3$\gamma$. In the mutant SOD1-Tg mice, a high degree of immunoreactivity for misfolded SOD1 (C4F6) was observed in the cytoplasm, with an even greater degree of immunoreactivity present in the cytoplasmic aggregates of the anterior horn cells in the lumbar spinal cord. Furthermore, we have found increased 14-3-3$\beta$ and 14-3-3$\gamma$ immunoreactivities in the mutant SOD1-Tg mice. Double immunofluorescent staining showed that C4F6 and 14-3-3 proteins were partially co-localized in the spinal cord with FALS and the mutant SOD1-Tg mice. In comparison, the wild-type SOD1-Tg and non-Tg wild-type mice showed no or faint immunoreactivity for C4F6 and 14-3-3 proteins (pan 14-3-3, 14-3-3$\beta$, and 14-3-3$\gamma$) in any neuronal compartments. Discussion: These results suggest that 14-3-3 proteins may be associated with the formation of SOD1-containing inclusions, in FALS patients and the mutant SOD1-Tg mice.Mathematic

Variants of C-C Motif Chemokine 22 (CCL22) Are Associated with Susceptibility to Atopic Dermatitis: Case-Control Studies

Atopic dermatitis (AD) is a common inflammatory skin disease caused by multiple genetic and environmental factors. AD is characterized by the local infiltration of T helper type 2 (Th2) cells. Recent clinical studies have shown important roles of the Th2 chemokines, CCL22 and CCL17 in the pathogenesis of AD. To investigate whether polymorphisms of the CCL22 gene affect the susceptibility to AD, we conducted association studies and functional studies of the related variants. We first resequenced the CCL22 gene and found a total of 39 SNPs. We selected seven tag SNPs in the CCL22 gene, and conducted association studies using two independent Japanese populations (1st population, 916 cases and 1,032 controls; 2nd population 1,034 cases and 1,004 controls). After the association results were combined by inverse variance method, we observed a significant association at rs4359426 (meta-analysis, combined P = 9.6×10−6; OR, 0.74; 95% CI, 0.65–0.85). Functional analysis revealed that the risk allele of rs4359426 contributed to higher expression levels of CCL22 mRNA. We further examined the allelic differences in the binding of nuclear proteins by electrophoretic mobility shift assay. The signal intensity of the DNA-protein complex derived from the G allele of rs223821, which was in absolute LD with rs4359426, was higher than that from the A allele. Although further functional analyses are needed, it is likely that related variants play a role in susceptibility to AD in a gain-of-function manner. Our findings provide a new insight into the etiology and pathogenesis of AD

Prospective study of daily low-dose nedaplatin and continuous 5-fluorouracil infusion combined with radiation for the treatment of esophageal squamous cell carcinoma

<p>Abstract</p> <p>Background</p> <p>Protracted low-dose concurrent chemotherapy combined with radiation has been proposed for enhanced treatment results for esophageal cancer. We evaluated the efficacy and the toxicity of a novel regimen of daily low-dose nedaplatin (cis-diammine-glycolatoplatinum) and continuous infusion of 5-fluorouracil (5-FU) with radiation in patients with esophageal squamous cell carcinoma.</p> <p>Methods</p> <p>Between January 2003 and June 2008, 33 patients with clinical stage I to IVB esophageal squamous cell carcinoma were enrolled. Nedaplatin (10 mg/body/day) was administered daily and 5-FU (500 mg/body/day) was administered continuously for 20 days. Fractionated radiotherapy for a total dose of 50.4-66 Gy was administered together with chemotherapy. Additional chemotherapy with nedaplatin and 5-FU was optionally performed for a maximum of 5 courses after chemoradiotherapy. The primary end-point of this study was to evaluate the tumor response, and the secondary end-points were to evaluate the toxicity and the overall survival.</p> <p>Results</p> <p>Twenty-two patients (72.7%) completed the regimen of chemoradiotherapy. Twenty patients (60.6%) achieved a complete response, 10 patients (30.3%) a partial response. One patient (3.0%) had a stable disease, and 2 (6.1%) a progressive disease. The overall response rate was 90.9% (95% confidence interval: 75.7%-98.1%). For grade 3-4 toxicity, leukopenia was observed in 75.8% of the cases, thrombocytopenia in 24.2%, anemia in 9.1%, and esophagitis in 36.4%, while late grade 3-4 cardiac toxicity occurred in 6.1%. Additional chemotherapy was performed for 26 patients (78.8%) and the median number of courses was 3 (range, 1-5). The 1-, 2- and 3-year survival rates were 83.9%, 76.0% and 58.8%, respectively. The 1- and 2-year survival rates were 94.7% and 88.4% in patients with T1-3 M0 disease, and 66.2% and 55.2% in patients with T4/M1 disease.</p> <p>Conclusion</p> <p>The treatment used in our study may yield a high complete response rate and better survival for each stage of esophageal squamous cell carcinoma.</p> <p>Trial registration</p> <p>ClinicalTrials.gov Identifier: NCT00197444</p

Finishing the euchromatic sequence of the human genome

The sequence of the human genome encodes the genetic instructions for human physiology, as well as rich information about human evolution. In 2001, the International Human Genome Sequencing Consortium reported a draft sequence of the euchromatic portion of the human genome. Since then, the international collaboration has worked to convert this draft into a genome sequence with high accuracy and nearly complete coverage. Here, we report the result of this finishing process. The current genome sequence (Build 35) contains 2.85 billion nucleotides interrupted by only 341 gaps. It covers ∼99% of the euchromatic genome and is accurate to an error rate of ∼1 event per 100,000 bases. Many of the remaining euchromatic gaps are associated with segmental duplications and will require focused work with new methods. The near-complete sequence, the first for a vertebrate, greatly improves the precision of biological analyses of the human genome including studies of gene number, birth and death. Notably, the human enome seems to encode only 20,000-25,000 protein-coding genes. The genome sequence reported here should serve as a firm foundation for biomedical research in the decades ahead

Ramucirumab plus docetaxel versus placebo plus docetaxel in patients with locally advanced or metastatic urothelial carcinoma after platinum-based therapy (RANGE): a randomised, double-blind, phase 3 trial

Few treatments with a distinct mechanism of action are available for patients with platinum-refractory advanced or metastatic urothelial carcinoma. We assessed the efficacy and safety of treatment with docetaxel plus either ramucirumab-a human IgG1 VEGFR-2 antagonist-or placebo in this patient population

Gathering and election by mobile robots in a continuous cycle

Consider a set of n mobile computational entities, called robots, located and operating on a continuous cycle C (e.g., the perimeter of a closed region of R2) of arbitrary length `. The robots are identical, can only see their current location, have no location awareness, and cannot communicate at a distance. In this weak setting, we study the classical problems of gathering (GATHER), requiring all robots to meet at a same location; and election (ELECT), requiring all robots to agree on a single one as the “leader”. We investigate how to solve the problems depending on the amount of knowledge (exact, upper bound, none) the robots have about their number n and about the length of the cycle `. Cost of the algorithms is analyzed with respect to time and number of random bits. We establish a variety of new results specific to the continuous cycle - a geometric domain never explored before for GATHER and ELECT in a mobile robot setting; compare Monte Carlo and Las Vegas algorithms; and obtain several optimal bounds