1,085 research outputs found
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
Computing a rectilinear shortest path amid splinegons in plane
We reduce the problem of computing a rectilinear shortest path between two
given points s and t in the splinegonal domain \calS to the problem of
computing a rectilinear shortest path between two points in the polygonal
domain. As part of this, we define a polygonal domain \calP from \calS and
transform a rectilinear shortest path computed in \calP to a path between s and
t amid splinegon obstacles in \calS. When \calS comprises of h pairwise
disjoint splinegons with a total of n vertices, excluding the time to compute a
rectilinear shortest path amid polygons in \calP, our reduction algorithm takes
O(n + h \lg{n}) time. For the special case of \calS comprising of concave-in
splinegons, we have devised another algorithm in which the reduction procedure
does not rely on the structures used in the algorithm to compute a rectilinear
shortest path in polygonal domain. As part of these, we have characterized few
of the properties of rectilinear shortest paths amid splinegons which could be
of independent interest
Archiving of data on occurrence of breeding birds associated with fire treatments and controls
Since 2001, we have collected data on occupancy and relative abundance of Greater Sage- Grouse (Centrocercus urophasianus) and other species of breeding birds in the central Great Basin, and characterized the vegetation structure and composition of breeding birds’ habitats, through four projects supported by the Joint Fire Science Program (00-2-15, 01B-3-3-01, 05-2-1- 94, and 09-1-08-4). These projects collectively have generated dozens of refereed publications, dozens of invited papers or presentations, multiple M.S. theses and Ph.D. dissertations, and many workshops and field tours. Bird data included in refereed publications to date were based on point counts with a fixed radius of 75 or 100 m and a duration of 5 minutes per visit. These data previously were archived with the USDA Forest Service’s Research Data Archive. Since 2004, however, we also have conducted 100-m fixed-radius point counts with a duration of 8 minutes per visit. Furthermore, starting in 2002, we recorded birds detected beyond the fixed radius and during travel among point-count locations or at other times of day or night. We archived data on the incidental and longer-distance detections of birds, which included more than 22,600 records. We also archived all data on vegetation structure and the composition of dominant trees and shrubs collected through 2012. There are few sets of long-term, spatially extensive data on distributions and abundance of fauna or extensive characterizations of vegetation in the Great Basin. These data have considerable capacity to inform understanding and management of fire dynamics; changes in land cover, including conversion of native vegetation to cheatgrass (Bromus tectorum); and the status of species proposed for listing under the Endangered Species Act
Effects of point-count duration on estimated detection probabilities and occupancy of breeding birds
Increasingly, point-count data are used to estimate occupancy, the probability that a species is present at a given location; occupancy accounts for imperfect detection, the probability that a species is detected given that it is present. To our knowledge, effects of sampling duration on inferences from models of bird occupancy have not been evaluated. Our objective was to determine whether changing count duration from 5 to 8min affected inferences about the occupancy of birds sampled in the Chesapeake Bay Lowlands (eastern United States) and the central and western Great Basin (western United States) in 2012 and 2013. We examined the proportion of species (two doves, one cuckoo, two swifts, five hummingbirds, 11 woodpeckers, and 122 passerines) for which estimates of detection probability were 0.3. For species with single-season detection probabilities 0.3, we compared occupancy estimates derived from 5- and 8-min counts. We also compared estimates for three species sampled annually for 5yr in the central Great Basin. Detection probabilities based on both the 5- and 8-min counts were 0.3 for 40% 3% of the species in an ecosystem. Extending the count duration from 5 to 8min increased the detection probability to 0.3 for 5% +/- 0.5% of the species. We found no difference in occupancy estimates that were based on 5- versus 8-min counts for species sampled over two or five consecutive years. However, for 97% of species sampled over 2yr, precision of occupancy estimates that were based on 8-min counts averaged 12% +/- 2% higher than those based on 5-min counts. We suggest that it may be worthwhile to conduct a pilot season to determine the number of locations and surveys needed to achieve detection probabilities that are sufficiently high to estimate occupancy for species of interest
Lower bounds on the dilation of plane spanners
(I) We exhibit a set of 23 points in the plane that has dilation at least
, improving the previously best lower bound of for the
worst-case dilation of plane spanners.
(II) For every integer , there exists an -element point set
such that the degree 3 dilation of denoted by in the domain of plane geometric spanners. In the
same domain, we show that for every integer , there exists a an
-element point set such that the degree 4 dilation of denoted by
The
previous best lower bound of holds for any degree.
(III) For every integer , there exists an -element point set
such that the stretch factor of the greedy triangulation of is at least
.Comment: Revised definitions in the introduction; 23 pages, 15 figures; 2
table
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
Controlling the Electromagnetic Field Confinement with Metamaterials
The definition of a precise illumination region is essential in many applications where the electromagnetic field should be confined in some specific volume. By using conventional structures, it is difficult to achieve an adequate confinement distance (or volume) with negligible levels of radiation leakage beyond it. Although metamaterial structures and metasurfaces are well-known to provide high controllability of their electromagnetic properties, this feature has not yet been applied to solve this problem. We present a method of electromagnetic field confinement based on the generation of evanescent waves by means of metamaterial structures. With this method, the confinement volume can be controlled, namely, it is possible to define a large area with an intense field without radiation leakage. A prototype working in the microwave region has been implemented, and very good agreement between the measurements and the theoretical prediction of field distribution has been obtained
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
- …