48 research outputs found

    The Power of Centralized PC Systems of Pushdown Automata

    Full text link
    Parallel communicating systems of pushdown automata (PCPA) were introduced in (Csuhaj-Varj{\'u} et. al. 2000) and in their centralized variants shown to be able to simulate nondeterministic one-way multi-head pushdown automata. A claimed converse simulation for returning mode (Balan 2009) turned out to be incomplete (Otto 2012) and a language was suggested for separating these PCPA of degree two (number of pushdown automata) from nondeterministic one-way two-head pushdown automata. We show that the suggested language can be accepted by the latter computational model. We present a different example over a single letter alphabet indeed ruling out the possibility of a simulation between the models. The open question about the power of centralized PCPA working in returning mode is then settled by showing them to be universal. Since the construction is possible using systems of degree two, this also improves the previous bound three for generating all recursively enumerable languages. Finally PCPAs are restricted in such a way that a simulation by multi-head automata is possible

    International consensus recommendations on key outcome measures for organ preservation after (chemo)radiotherapy in patients with rectal cancer

    Get PDF
    Multimodal treatment strategies for patients with rectal cancer are increasingly including the possibility of organ preservation, through nonoperative management or local excision. Organ preservation strategies can enable patients with a complete response or near-complete clinical responses after radiotherapy with or without concomitant chemotherapy to safely avoid the morbidities associated with radical surgery, and thus to maintain anorectal function and quality of life. However, standardization of the key outcome measures of organ preservation strategies is currently lacking; this includes a lack of consensus of the optimal definitions and selection of primary end points according to the trial phase and design; the optimal time points for response assessment; response-based decision-making; follow-up schedules; use of specific anorectal function tests; and quality of life and patient-reported outcomes. Thus, a consensus statement on outcome measures is necessary to ensure consistency and facilitate more accurate comparisons of data from ongoing and future trials. Here, we have convened an international group of experts with extensive experience in the management of patients with rectal cancer, including organ preservation approaches, and used a Delphi process to establish the first international consensus recommendations for key outcome measures of organ preservation, in an attempt to standardize the reporting of data from both trials and routine practice in this emerging area.Patients with early-stage rectal cancer might potentially benefit from treatment with an organ-sparing approach, which preserves quality of life owing to avoidance of the need for permanent colostomy. Trials conducted to investigate this have so far been hampered by considerable inter-trial heterogeneity in several key features. In this Consensus Statement, the authors provide guidance on the optimal end points, response assessment time points, follow-up procedures and quality of life measures in an attempt to improve the comparability of clinical research in this area

    Layered control architectures in robots and vertebrates

    Get PDF
    We revieiv recent research in robotics, neuroscience, evolutionary neurobiology, and ethology with the aim of highlighting some points of agreement and convergence. Specifically, we com pare Brooks' (1986) subsumption architecture for robot control with research in neuroscience demonstrating layered control systems in vertebrate brains, and with research in ethology that emphasizes the decomposition of control into multiple, intertwined behavior systems. From this perspective we then describe interesting parallels between the subsumption architecture and the natural layered behavior system that determines defense reactions in the rat. We then consider the action selection problem for robots and vertebrates and argue that, in addition to subsumption- like conflict resolution mechanisms, the vertebrate nervous system employs specialized selection mechanisms located in a group of central brain structures termed the basal ganglia. We suggest that similar specialized switching mechanisms might be employed in layered robot control archi tectures to provide effective and flexible action selection

    Bounds for error reduction with few quantum queries

    Get PDF
    Abstract. We consider the quantum database search problem, where we are given a function f: [N] → {0, 1}, and are required to return an x ∈ [N] (a target address) such that f(x) = 1. Recently, Grover [G05] showed that there is an algorithm that after making one quantum query to the database, returns an X ∈ [N] (a random variable) such that Pr[f(X) = 0] = ɛ 3, where ɛ = |f −1 (0)|/N. Using the same idea, Grover derived a t-query quantum algorithm (for infinitely many t) that errs with probability only ɛ 2t+1. Subsequently, Tulsi, Grover and Patel [TGP05] showed, using a different algorithm, that such a reduction can be achieved for all t. This method can be placed in a more general framework, where given any algorithm that produces a target state for some database f with probability of error ɛ, one can obtain another that makes t queries to f, and errs with probability ɛ 2t+1. For this method to work, we do not require prior knowledge of ɛ. Note that no classical randomized algorithm can reduce the error probability to significantly below ɛ t+1, even if ɛ is known. In this paper, we obtain lower bounds that show that the amplification achieved by these quantum algorithms is essentially optimal. We also present simple alternative algorithms that achieve the same bound as those in Grover [G05], and have some other desirable properties. We then study the best reduction in error that can be achieved by a t-query quantum algorithm, when the initial error ɛ is known to lie in an interval of the form [ℓ, u]. We generalize our basic algorithms and lower bounds, and obtain nearly tight bounds in this setting.
    corecore