123,212 research outputs found

    Chemotherapy-induced peripheral neuropathy in cancer patients : a four-arm randomized trial on the effectiveness of electroacupuncture

    Get PDF
    Purpose. Chemotherapy-induced peripheral neuropathy (CIPN) is a common and dose-limiting side effect of cytostatic drugs. Since there are no proven therapeutic procedures against CIPN, we were interested to define the role of electroacupuncture (EA) from which preliminary data showed promising results. Methods. In a randomized trial with a group sequential adaptive design in patients with CIPN, we compared EA (LV3, SP9, GB41, GB34, LI4, LI11, SI3, and HT3; n=14) with hydroelectric baths (HB, n=14), vitamin B1/B6 capsules (300/300 mg daily; VitB, n=15), and placebo capsules (n=17). The statistical power in this trial was primarily calculated for proving EA only, so results of HB and VitB are pilot data. Results. CIPN complaints improved by 0.8 +- 1.2 (EA), 1.7 +- 1.7 (HB), 1.6 +- 2.0 (VitB), and 1.3 +- 1.3 points (placebo) on a 10-point numeric rating scale without significant difference between treatment groups or placebo. In addition no significant differences in sensory nerve conduction studies or quality of life (EORTC QLQ-C30) were found. Conclusions. The used EA concept, HB, and VitB were not superior to placebo. Since, contrary to our results, studies with different acupuncture concepts showed a positive effect on CIPN, the effect of acupuncture on CIPN remains unclear. Further randomized, placebo controlled studies seem necessary. This trial is registered with DRKS00004448

    Stratified Negation in Limit Datalog Programs

    Full text link
    There has recently been an increasing interest in declarative data analysis, where analytic tasks are specified using a logical language, and their implementation and optimisation are delegated to a general-purpose query engine. Existing declarative languages for data analysis can be formalised as variants of logic programming equipped with arithmetic function symbols and/or aggregation, and are typically undecidable. In prior work, the language of limit programs\mathit{limit\ programs} was proposed, which is sufficiently powerful to capture many analysis tasks and has decidable entailment problem. Rules in this language, however, do not allow for negation. In this paper, we study an extension of limit programs with stratified negation-as-failure. We show that the additional expressive power makes reasoning computationally more demanding, and provide tight data complexity bounds. We also identify a fragment with tractable data complexity and sufficient expressivity to capture many relevant tasks.Comment: 14 pages; full version of a paper accepted at IJCAI-1
    • …