An adaptive appearance-based map for long-term topological localization of mobile robots

"This work considers a mobile service robot which uses an appearance-based representation of its workplace as a map, where the current view and the map are used to estimate the current position in the environment. Due to the nature of real-world environments such as houses and offices, where the appearance keeps changing, the internal representation may become out of date after some time. To solve this problem the robot needs to be able to adapt its internal representation continually to the changes in the environment. This paper presents a method for creating an adaptive map for long-term appearance-based localization of a mobile robot using long-term and short-term memory concepts, with omni-directional vision as the external sensor."--publisher website

Simultaneous localization and planning on multiple map hypotheses

This paper presents a novel method to rank map hypotheses by the quality of localization they afford. The highest ranked hypothesis at any moment becomes the active representation that is used to guide the robot to its goal location. A single static representation is insufficient for navigation in dynamic environments where paths can be blocked periodically, a common scenario which poses significant challenges for typical planners. In our approach we simultaneously rank multiple map hypotheses by the influence that localization in each of them has on locally accurate odometry. This is done online for the current locally accurate window by formulating a factor graph of odometry relaxed by localization constraints. Comparison of the resulting perturbed odometry of each hypothesis with the original odometry yields a score that can be used to rank map hypotheses by their utility. We deploy the proposed approach on a real robot navigating a structurally noisy office environment. The configuration of the environment is physically altered outside the robots sensory horizon during navigation tasks to demonstrate the proposed approach of hypothesis selection.

Working as one: A road map to disaster resilience for Australia

Natural disasters cause widespread disruption, costing the Australian economy $6.3 billion per year, and those costs are projected to rise incrementally to $23 billion by 2050. With more frequent natural disasters with greater consequences, Australian communities need the ability to prepare and plan for them, absorb and recover from them, and adapt more successfully to their effects. Enhancing Australian resilience will allow us to better anticipate disasters and assist in planning to reduce losses, rather than just waiting for the next king hit and paying for it afterwards. Given the scale of devastation, governments have been quick to pick up the pieces when major natural disasters hit. But this approach (‘The government will give you taxpayers’ money regardless of what you did to help yourself, and we’ll help you rebuild in the same risky area.’) has created a culture of dependence. This is unsustainable and costly. In 2008, ASPI published Taking a punch: building a more resilient Australia. That report emphasised the importance of strong leadership and coordination in disaster resilience policymaking, as well as the value of volunteers and family and individual preparation, in managing the effects of major disasters. This report offers a roadmap for enhancing Australia’s disaster resilience, building on the 2011 National Strategy for Disaster Resilience. It includes a snapshot of relevant issues and current resilience efforts in Australia, outlining key challenges and opportunities. The report sets out 11 recommendations to help guide Australia towards increasing national resilience, from individuals and local communities through to state and federal agencies.

Shortest path and vehicle trajectory aided map-matching for low frequency GPS data

Map-matching algorithms that utilise road segment connectivity along with other data (i.e.position, speed and heading) in the process of map-matching are normally suitable for high frequency (1 Hz or higher) positioning data from GPS. While applying such map-matching algorithms to low frequency data (such as data from a fleet of private cars, buses or light duty vehicles or smartphones), the performance of these algorithms reduces to in the region of 70% in terms of correct link identification, especially in urban and sub-urban road networks. This level of performance may be insufficient for some real-time Intelligent Transport System (ITS) applications and services such as estimating link travel time and speed from low frequency GPS data. Therefore, this paper develops a new weight-based shortest path and vehicle trajectory aided map-matching (stMM) algorithm that enhances the map-matching of low frequency positioning data on a road map. The well-known A* search algorithm is employed to derive the shortest path between two points while taking into account both link connectivity and turn restrictions at junctions. In the developed stMM algorithm, two additional weights related to the shortest path and vehicle trajectory are considered: one shortest path-based weight is related to the distance along the shortest path and the distance along the vehicle trajectory, while the other is associated with the heading difference of the vehicle trajectory. The developed stMM algorithm is tested using a series of real-world datasets of varying frequencies (i.e. 1 s, 5 s, 30 s, 60 s sampling intervals). A high-accuracy integrated navigation system (a high-grade inertial navigation system and a carrier-phase GPS receiver) is used to measure the accuracy of the developed algorithm. The results suggest that the algorithm identifies 98.9% of the links correctly for every 30 s GPS data. Omitting the information from the shortest path and vehicle trajectory, the accuracy of the algorithm reduces to about 73% in terms of correct link identification. The algorithm can process on average 50 positioning fixes per second making it suitable for real-time ITS applications and services.

What is the available evidence concerning relative performance of different designs of mixed-species plantings for smallholder and community forestry in the tropics? A systematic map protocol

Background There has been growing interest in mixed species plantation systems because of their potential to provide a range of socio-economic and bio-physical benefits which can be matched to the diverse needs of smallholders and communities. Potential benefits include the production of a range of forest products for home and commercial use; improved soil fertility especially when nitrogen fixing species are included; improved survival rates and greater productivity of species; a reduction in the amount of damage from pests or disease; and improved biodiversity and wildlife habitats. Despite these documented services and growing interest in mixed species plantation systems, the actual planting areas in the tropics are low, and monocultures are still preferred for industrial plantings and many reforestation programs because of perceived higher economic returns and readily available information about the species and their silviculture. In contrast, there are few guidelines for the design and management of mixed-species systems, including the social and ecological factors of successful mixed species plantings. Methods This protocol explains the methodology used to investigate the following question: What is the available evidence for the relative performance of different designs of mixed-species plantings for smallholder and community forestry in the tropics? This study will systematically search, identify and describe studies related to mixed species plantings across tropical and temperate zones to identify the social and ecological factors that affect polyculture systems. The objectives of this study are first to identify the evidence of biophysical or socio-economic factors that have been considered when designing mixed species systems for community and smallholder forestry in the tropics; and second, to identify gaps in research of mixed species plantations. Results of the study will help create guidelines that can assist practitioners, scientists and farmers to better design mixed species plantation systems for smallholders in the tropics.

Extending genetic linkage analysis to diffusion tensor images to map single gene effects on brain fiber architecture

We extended genetic linkage analysis - an analysis widely used in quantitative genetics - to 3D images to analyze single gene effects on brain fiber architecture. We collected 4 Tesla diffusion tensor images (DTI) and genotype data from 258 healthy adult twins and their non-twin siblings. After high-dimensional fluid registration, at each voxel we estimated the genetic linkage between the single nucleotide polymorphism (SNP), Val66Met (dbSNP number rs6265), of the BDNF gene (brain-derived neurotrophic factor) with fractional anisotropy (FA) derived from each subject's DTI scan, by fitting structural equation models (SEM) from quantitative genetics. We also examined how image filtering affects the effect sizes for genetic linkage by examining how the overall significance of voxelwise effects varied with respect to full width at half maximum (FWHM) of the Gaussian smoothing applied to the FA images. Raw FA maps with no smoothing yielded the greatest sensitivity to detect gene effects, when corrected for multiple comparisons using the false discovery rate (FDR) procedure. The BDNF polymorphism significantly contributed to the variation in FA in the posterior cingulate gyrus, where it accounted for around 90-95% of the total variance in FA. Our study generated the first maps to visualize the effect of the BDNF gene on brain fiber integrity, suggesting that common genetic variants may strongly determine white matter integrity.

Educational interventions for preventing vascular catheter bloodstream infections in critical care: Evidence map, systematic review and economic evaluation

Background Bloodstream infections resulting from intravascular catheters (catheter-BSI) in critical care increase patients' length of stay, morbidity and mortality, and the management of these infections and their complications has been estimated to cost the NHS annually £19.1–36.2M. Catheter-BSI are thought to be largely preventable using educational interventions, but guidance as to which types of intervention might be most clinically effective is lacking. Objective To assess the effectiveness and cost-effectiveness of educational interventions for preventing catheter-BSI in critical care units in England. Data sources Sixteen electronic bibliographic databases – including MEDLINE, MEDLINE In-Process & Other Non-Indexed Citations, Cumulative Index to Nursing and Allied Health Literature (CINAHL), NHS Economic Evaluation Database (NHS EED), EMBASE and The Cochrane Library databases – were searched from database inception to February 2011, with searches updated in March 2012. Bibliographies of systematic reviews and related papers were screened and experts contacted to identify any additional references. Review methods References were screened independently by two reviewers using a priori selection criteria. A descriptive map was created to summarise the characteristics of relevant studies. Further selection criteria developed in consultation with the project Advisory Group were used to prioritise a subset of studies relevant to NHS practice and policy for systematic review. A decision-analytic economic model was developed to investigate the cost-effectiveness of educational interventions for preventing catheter-BSI. Results Seventy-four studies were included in the descriptive map, of which 24 were prioritised for systematic review. Studies have predominantly been conducted in the USA, using single-cohort before-and-after study designs. Diverse types of educational intervention appear effective at reducing the incidence density of catheter-BSI (risk ratios statistically significantly < 1.0), but single lectures were not effective. The economic model showed that implementing an educational intervention in critical care units in England would be cost-effective and potentially cost-saving, with incremental cost-effectiveness ratios under worst-case sensitivity analyses of < £5000/quality-adjusted life-year. Limitations Low-quality primary studies cannot definitively prove that the planned interventions were responsible for observed changes in catheter-BSI incidence. Poor reporting gave unclear estimates of risk of bias. Some model parameters were sourced from other locations owing to a lack of UK data. Conclusions Our results suggest that it would be cost-effective and may be cost-saving for the NHS to implement educational interventions in critical care units. However, more robust primary studies are needed to exclude the possible influence of secular trends on observed reductions in catheter-BSI.

An algebraic theory of functional and multivalued dependencies in relational databases

Computation of the dependency basis is the fundamental step in solving the membership problem for functional dependencies (FDs) and multivalued dependencies (MVDs) in relational database theory. We examine this problem from an algebraic perspective. We introduce the notion of the inference basis of a set M of MVDs and show that it contains the maximum information about the logical consequences of M. We propose the notion of a dependency-lattice and develop an algebraic characterization of inference basis using simple notions from lattice theory. We also establish several interesting properties of dependency-lattices related to the implication problem. Founded on our characterization, we synthesize efficient algorithms for (a): computing the inference basis of a given set M of MVDs; (b): computing the dependency basis of a given attribute set w.r.t. M; and (c): solving the membership problem for MVDs. We also show that our results naturally extend to incorporate FDs also in a way that enables the solution of the membership problem for both FDs and MVDs put together. We finally show that our algorithms are more efficient than existing ones, when used to solve what we term the ‘generalized membership problem’.

The Implication Problem for Functional and Multivalued Dependencies

Computation of the dependency basis is the fundamental step in solving the implication problem for MVDs in relational database theory. We examine this problem from an algebraic perspective. We introduce the notion of the inference basis of a set M of MVDs and show that it contains the maximum information about the logical consequences of M. We propose the notion of an MVD-lattice and develop an algebraic characterization of the inference basis using simple notions from lattice theory. We also establish several properties of MVD-lattices related to the implication problem. Founded on our characterization, we synthesize efficient algorithms for (a) computing the inference basis of a given set M of MVDs; (b) computing the dependency basis of a given attribute set w.r.t. M; and (c) solving the implication problem for MVDs. Finally, we show that our results naturally extend to incorporate FDs also in a way that enables the solution of the implication problem for both FDs and MVDs put together.

Functionally associated molecular genetic marker map construction in perennial ryegrass (Lolium perenne L.)

A molecular marker-based map of perennial ryegrass (Lolium perenne L.) has been constructed through the use of polymorphisms associated with expressed sequence tags (ESTs). A pair-cross between genotypes from a North African ecotype and the cultivar Aurora was used to generate a two-way pseudo-testcross population. A selection of 157 cDNAs assigned to eight different functional categories associated with agronomically important biological processes was used to detect polymorphic EST–RFLP loci in the F1(NA6 × AU6) population. A comprehensive set of EST–SSR markers was developed from the analysis of 14,767 unigenes, with 310 primer pairs showing efficient amplification and detecting 113 polymorphic loci. Two parental genetic maps were produced: the NA6 genetic map contains 88 EST–RFLP and 71 EST–SSR loci with a total map length of 963 cM, while the AU6 genetic map contains 67 EST–RFLP and 58 EST–SSR loci with a total map length of 757 cM. Bridging loci permitted the alignment of homologous chromosomes between the parental maps, and a sub-set of genomic DNA-derived SSRs was used to relate linkage groups to the perennial ryegrass reference map. Regions of segregation distortion were identified, in some instances in common with other perennial ryegrass maps. The EST-derived marker-based map provides the basis for in silico comparative genetic mapping, as well as the evaluation of co-location between QTLs and functionally associated genetic loci.

A high-density consensus map of barley linking DArT markers to SSR, RFLP and STS loci and agricultural traits

Background: Molecular marker technologies are undergoing a transition from largely serial assays measuring DNA fragment sizes to hybridization-based technologies with high multiplexing levels. Diversity Arrays Technology (DArT) is a hybridization-based technology that is increasingly being adopted by barley researchers. There is a need to integrate the information generated by DArT with previous data produced with gel-based marker technologies. The goal of this study was to build a high-density consensus linkage map from the combined datasets of ten populations, most of which were simultaneously typed with DArT and Simple Sequence Repeat (SSR), Restriction Enzyme Fragment Polymorphism (RFLP) and/or Sequence Tagged Site (STS) markers. Results: The consensus map, built using a combination of JoinMap 3.0 software and several purpose-built perl scripts, comprised 2,935 loci (2,085 DArT, 850 other loci) and spanned 1,161 cM. It contained a total of 1,629 'bins' (unique loci), with an average inter-bin distance of 0.7 ± 1.0 cM (median = 0.3 cM). More than 98% of the map could be covered with a single DArT assay. The arrangement of loci was very similar to, and almost as optimal as, the arrangement of loci in component maps built for individual populations. The locus order of a synthetic map derived from merging the component maps without considering the segregation data was only slightly inferior. The distribution of loci along chromosomes indicated centromeric suppression of recombination in all chromosomes except 5H. DArT markers appeared to have a moderate tendency toward hypomethylated, gene-rich regions in distal chromosome areas. On the average, 14 ± 9 DArT loci were identified within 5 cM on either side of SSR, RFLP or STS loci previously identified as linked to agricultural traits. Conclusion: Our barley consensus map provides a framework for transferring genetic information between different marker systems and for deploying DArT markers in molecular breeding schemes. The study also highlights the need for improved software for building consensus maps from high-density segregation data of multiple populations.

The use of high resolution melting (HRM) to map single nucleotide polymorphism markers linked to a covered smut resistance gene in barley

Using an established genetic map, a single gene conditioning covered smut resistance, Ruh.7H, was mapped to the telomere region of chromosome 7HS in an Alexis/Sloop doubled haploid barley population. The closest marker to Ruh.7H, abg704 was 7.5 cM away. Thirteen loci on the distal end of 7HS with potential to contain single nucleotide polymorphisms (SNPs) were identified by applying a comparative genomics approach using rice sequence data. Of these, one locus produced polymorphic co-dominant bands of different size while two further loci contained SNPs that were identified using the recently developed high resolution melting (HRM) technique. Two of these markers flanked Ruh.7H with the proximal marker located 3.8 cM and the distal marker 2.7 cM away. This is the first report on the application of the HRM technique to SNP detection and to rapid scoring of known cleaved amplified polymorphic sequence (CAPS) markers in plants. This simple, precise post-PCR technique should find widespread use in the fine-mapping of genetic regions of interest in complex cereal and other plant genomes.

Split-Freedom And Mvd-Intersection - A New Characterization Of Multivalued Dependencies Having Conflict-Free Covers

Sets of multivalued dependencies (MVDs) having conflict-free covers are important to the theory and design of relational databases [2,12,15,16]. Their desirable properties motivate the problem of testing a set M of MVDs for the existence of a confiict-free cover. In [8] Goodman and Tay have proposed an approach based on the possible equivalence of M to a single (acyclic) join dependency (JD). We remark that their characterization does not lend an insight into the nature of such sets of MVDs. Here, we use notions that are intrinsic to MVDs to develop a new characterization. Our approach proceeds in two stages. In the first stage, we use the notion of “split-free” sets of MVDs and obtain a characterization of sets M of MVDs having split-free covers. In the second, we use the notion of “intersection” of MVDs to arrive at a necessary and sufficient condition for a split-free set of MVDs to be conflict-free. Based on our characterizations, we also give polynomial-time algorithms for testing whether M has split-free and conflict-free covers. The highlight of our approach is the clear insight it provides into the nature of sets of MVDs having conflict-free covers. Less emphasis is given in this paper to the actual efficiency of the algorthms. Finally, as a bonus, we derive a desirable property of split-free sets of MVDs,thereby showing that they are interesting in their own right.