Partitioning space for range queries

It is shown that, given a set S of n points in R3, one can always find three planes that form an eight-partition of S, that is, a partition where at most n/8 points of S lie in each of the eight open regions. This theorem is used to define a data structure, called an octant tree, for representing any point set in R3. An octant tree for n points occupies O(n) space and can be constructed in polynomial time. With this data structure and its refinements, efficient solutions to various range query problems in 2 and 3 dimensions can be obtained, including (1) half-space queries: find all points of S that lie to one side of any given plane; (2) polyhedron queries: find all points that lie inside (outside) any given polyhedron; and (3) circular queries in R2: for a planar set S, find all points that lie inside (outside) any given circle. The retrieval time for all these queries is T(n)=O(na + m) where a= 0.8988 (or 0.8471 in case (3)) and m is the size of the output. This performance is the best currently known for linear-space data structures which can be deterministically constructed in polynomial time

Fast detection of polyhedral intersection

AbstractMethods are given for unifying and extending previous work on detecting intersections of suitably preprocessed polyhedra. New upper bounds of O(log n) and O(log2 n) are given on plane-polyhedron and polyhedron-polyhedron intersection problems

Lower bounds on the dilation of plane spanners

(I) We exhibit a set of 23 points in the plane that has dilation at least $1.4308$, improving the previously best lower bound of $1.4161$ for the worst-case dilation of plane spanners. (II) For every integer $n\geq13$, there exists an $n$-element point set $S$ such that the degree 3 dilation of $S$ denoted by $\delta_0(S,3) \text{ equals } 1+\sqrt{3}=2.7321\ldots$ in the domain of plane geometric spanners. In the same domain, we show that for every integer $n\geq6$, there exists a an $n$-element point set $S$ such that the degree 4 dilation of $S$ denoted by $\delta_0(S,4) \text{ equals } 1 + \sqrt{(5-\sqrt{5})/2}=2.1755\ldots$ The previous best lower bound of $1.4161$ holds for any degree. (III) For every integer $n\geq6$, there exists an $n$-element point set $S$ such that the stretch factor of the greedy triangulation of $S$ is at least $2.0268$.Comment: Revised definitions in the introduction; 23 pages, 15 figures; 2 table

BNCI systems as a potential assistive technology: ethical issues and participatory research in the BrainAble project

This paper highlights aspects related to current research and thinking about ethical issues in relation to Brain Computer Interface (BCI) and Brain-Neuronal Computer Interfaces (BNCI) research through the experience of one particular project, BrainAble, which is exploring and developing the potential of these technologies to enable people with complex disabilities to control computers. It describes how ethical practice has been developed both within the multidisciplinary research team and with participants. Results: The paper presents findings in which participants shared their views of the project prototypes, of the potential of BCI/BNCI systems as an assistive technology, and of their other possible applications. This draws attention to the importance of ethical practice in projects where high expectations of technologies, and representations of “ideal types” of disabled users may reinforce stereotypes or drown out participant “voices”. Conclusions: Ethical frameworks for research and development in emergent areas such as BCI/BNCI systems should be based on broad notions of a “duty of care” while being sufficiently flexible that researchers can adapt project procedures according to participant needs. They need to be frequently revisited, not only in the light of experience, but also to ensure they reflect new research findings and ever more complex and powerful technologies

A waitlist-controlled trial of group cognitive behavioural therapy for depression and anxiety in Parkinson’s disease

Background: The aim of this study was to evaluate the efficacy of a group Cognitive Behavioural Therapy (CBT) treatment for depression and anxiety in Parkinson’s disease (PD). Methods: A waitlist-controlled trial design was used. Eighteen adults with PD and a comorbid DSM-IV-TR diagnosis of depression and/or anxiety were randomised to either Intervention (8-week group CBT treatment) or Waitlist (8-week clinical monitoring preceding treatment). The Depression, Anxiety, Stress Scale-21 (DASS-21) was the primary outcome. Assessments were completed at Time 1 (pretreatment), Time 2 (posttreatment/post-waitlist) and 1-month and 6-month follow-ups. Results: At Time 2, participants who received CBT reported greater reductions in depression (Mchange = -2.45) than Waitlist participants (Mchange = .29) and this effect was large, d = 1.12, p = .011. Large secondary effects on anxiety were also observed for CBT participants, d = .89, p = .025. All treatment gains were maintained and continued to improve during the follow-up period. At 6-month follow-up, significant and large effects were observed for both depression (d = 2.07) and anxiety (d = 2.26). Conclusions: Group CBT appears to be an efficacious treatment approach for depression and anxiety in PD however further controlled trials with larger numbers of participants are required

Protocol for the Locomotor Experience Applied Post-stroke (LEAPS) trial: a randomized controlled trial

<p>Abstract</p> <p>Background</p> <p>Locomotor training using body weight support and a treadmill as a therapeutic modality for rehabilitation of walking post-stroke is being rapidly adopted into clinical practice. There is an urgent need for a well-designed trial to determine the effectiveness of this intervention.</p> <p>The objective of the Locomotor Experience Applied Post-Stroke (LEAPS) trial is to determine if there is a difference in the proportion of participants who recover walking ability at one year post-stroke when randomized to a specialized locomotor training program (LTP), conducted at 2- or 6-months post-stroke, or those randomized to a home based non-specific, low intensity exercise intervention (HEP) provided 2 months post-stroke. We will determine if the timing of LTP delivery affects gait speed at 1 year and whether initial impairment severity interacts with the timing of LTP. The effect of number of treatment sessions will be determined by changes in gait speed taken pre-treatment and post-12, -24, and -36 sessions.</p> <p>Methods/Design</p> <p>We will recruit 400 adults with moderate or severe walking limitations within 30 days of stroke onset. At two months post stroke, participants are stratified by locomotor impairment severity as determined by overground walking speed and randomly assigned to one of three groups: (a) LTP-Early; (b) LTP-Late or (c) Home Exercise Program -Early. The LTP program includes body weight support on a treadmill and overground training. The LTP and HEP interventions are delivered for 36 sessions over 12 weeks.</p> <p>Primary outcome measure include successful walking recovery defined as the achievement of a 0.4 m/s gait speed or greater by persons with initial severe gait impairment or the achievement of a 0.8 m/s gait speed or greater by persons with initial moderate gait impairment.</p> <p>LEAPS is powered to detect a 20% difference in the proportion of participants achieving successful locomotor recovery between the LTP groups and the HEP group, and a 0.1 m/s mean difference in gait speed change between the two LTP groups.</p> <p>Discussion</p> <p>The goal of this single-blinded, phase III randomized clinical trial is to provide evidence to guide post-stroke walking recovery programs.</p> <p>Trial registration</p> <p>NCT00243919.</p

Health for sale: the medicinal plant markets in Trujillo and Chiclayo, Northern Peru

Traditional methods of healing have been beneficial in many countries with or without access to conventional allopathic medicine. In the United States, these traditional practices are increasingly being sought after for illnesses that cannot be easily treated by allopathic medicine. More and more people are becoming interested in the knowledge maintained by traditional healers and in the diversity of medicinal plants that flourish in areas like Northern Peru. While scientific studies of medicinal plants are underway, concern has arisen over the preservation of both the large diversity of medicinal plants and the traditional knowledge of healing methods that accompanies them. To promote further conservation work, this study attempted to document the sources of the most popular and rarest medicinal plants sold in the markets of Trujillo (Mayorista and Hermelinda) and Chiclayo (Modelo and Moshoqueque), as well as to create an inventory of the plants sold in these markets, which will serve as a basis for comparison with future inventories. Individual markets and market stalls were subjected to cluster analysis based on the diversity of the medicinal plants they carry. The results show that markets were grouped based on the presence of: (1) common exotic medicinal plants; (2) plants used by laypeople for self-medication related to common ailments ("everyday remedies"); (3) specialized medicinal plants used by curanderos or traditional healers; and (4) highly "specialized" plants used for magical purposes. The plant trade in the study areas seems to correspond well with the specific health care demands from clientele in those areas. The specific market patterns of plant diversity observed in the present study represent a foundation for comparative market research in Peru and elsewhere

Every Large Point Set contains Many Collinear Points or an Empty Pentagon

We prove the following generalised empty pentagon theorem: for every integer $\ell \geq 2$, every sufficiently large set of points in the plane contains $\ell$ collinear points or an empty pentagon. As an application, we settle the next open case of the "big line or big clique" conjecture of K\'ara, P\'or, and Wood [\emph{Discrete Comput. Geom.} 34(3):497--506, 2005]