Cognitive and environmental factors influencing the process of spatial knowledge acquisition within virtual reality environments

As the fidelity of virtual environments (VE) continues to increase, the possibility of using them as training platforms is becoming increasingly realistic for a variety of application domains, including military and emergency personnel training. In the past, there was much debate on whether the acquisition and subsequent transfer of spatial knowledge from VEs to the real world is possible, or whether the differences in medium during training would essentially be an obstacle to truly learning geometric space. In this paper, the authors present various cognitive and environmental factors that not only contribute to this process, but also interact with each other to a certain degree, leading to a variable exposure time requirement in order for the process of spatial knowledge acquisition (SKA) to occur. The cognitive factors that the authors discuss include a variety of individual user differences such as: knowledge and experience; cognitive gender differences; aptitude and spatial orientation skill; and finally, cognitive styles. Environmental factors discussed include: Size, Spatial layout complexity and landmark distribution. It may seem obvious that since every individual's brain is unique - not only through experience, but also through genetic predisposition that a one size fits all approach to training would be illogical. Furthermore, considering that various cognitive differences may further emerge when a certain stimulus is present (e.g. complex environmental space), it would make even more sense to understand how these factors can impact spatial memory, and to try to adapt the training session by providing visual/auditory cues as well as by changing the exposure time requirements for each individual. The impact of this research domain is important to VE training in general, however within service and military domains, guaranteeing appropriate spatial training is critical in order to ensure that disorientation does not occur in a life or death scenario.

A two-armed pattern in flickering maps of the nova-like variable UU aquarii

We report the analysis of a uniform sample of 31 light curves of the nova-like variable UU Aqr with eclipse-mapping techniques. The data were combined to derive eclipse maps of the average steady-light component, the long-term brightness changes, and the low- and high-frequency flickering components. The long-term variability responsible for the ""low-brightness`` and ""high-brightness`` states is explained in terms of the response of a viscous disk to changes of 20%-50% in the mass transfer rate from the donor star. Low- and high-frequency flickering maps are dominated by emission from two asymmetric arcs reminiscent of those seen in the outbursting dwarf nova IP Peg, and they are similarly interpreted as manifestations of a tidally induced spiral shock wave in the outer regions of a large accretion disk. The asymmetric arcs are also seen in the map of the steady light aside from the broad brightness distribution of a roughly steady-state disk. The arcs account for 25% of the steady-light flux and are a long-lasting feature in the accretion disk of UU Aqr. We infer an opening angle of 10 degrees +/- 3 degrees for the spiral arcs. The results suggest that the flickering in UU Aqr is caused by turbulence generated after the collision of disk gas with the density-enhanced spiral wave in the accretion disk.

Identifying the borders of mathematical knowledge

Based on a divide and conquer approach, knowledge about nature has been organized into a set of interrelated facts, allowing a natural representation in terms of graphs: each `chunk` of knowledge corresponds to a node, while relationships between such chunks are expressed as edges. This organization becomes particularly clear in the case of mathematical theorems, with their intense cross-implications and relationships. We have derived a web of mathematical theorems from Wikipedia and, thanks to the powerful concept of entropy, identified its more central and frontier elements. Our results also suggest that the central nodes are the oldest theorems, while the frontier nodes are those recently added to the network. The network communities have also been identified, allowing further insights about the organization of this network, such as its highly modular structure.

A game theoretical approach to the evolution of structured communication codes

Structured meaning-signal mappings, i.e., mappings that preserve neighborhood relationships by associating similar signals with similar meanings, are advantageous in an environment where signals are corrupted by noise and sub-optimal meaning inferences are rewarded as well. The evolution of these mappings, however, cannot be explained within a traditional language evolutionary game scenario in which individuals meet randomly because the evolutionary dynamics is trapped in local maxima that do not reflect the structure of the meaning and signal spaces. Here we use a simple game theoretical model to show analytically that when individuals adopting the same communication code meet more frequently than individuals using different codes-a result of the spatial organization of the population-then advantageous linguistic innovations can spread and take over the population. In addition, we report results of simulations in which an individual can communicate only with its K nearest neighbors and show that the probability that the lineage of a mutant that uses a more efficient communication code becomes fixed decreases exponentially with increasing K. These findings support the mother tongue hypothesis that human language evolved as a communication system used among kin, especially between mothers and offspring.

Decay of geometry for Fibonacci critical covering maps of the circle

We study the growth of Df `` (f(c)) when f is a Fibonacci critical covering map of the circle with negative Schwarzian derivative, degree d >= 2 and critical point c of order l > 1. As an application we prove that f exhibits exponential decay of geometry if and only if l <= 2, and in this case it has an absolutely continuous invariant probability measure, although not satisfying the so-called Collet-Eckmann condition. (C) 2009 Elsevier Masson SAS. All rights reserved.

ABELIANIZED OBSTRUCTION FOR FIXED POINTS OF FIBER-PRESERVING MAPS OF SURFACE BUNDLES

Let f: M -> M be a fiber-preserving map where S -> M -> B is a bundle and S is a closed surface. We study the abelianized obstruction, which is a cohomology class in dimension 2, to deform f to a fixed point free map by a fiber-preserving homotopy. The vanishing of this obstruction is only a necessary condition in order to have such deformation, but in some cases it is sufficient. We describe this obstruction and we prove that the vanishing of this class is equivalent to the existence of solution of a system of equations over a certain group ring with coefficients given by Fox derivatives.

Process evaluation of a knowledge translation intervention using facilitation of local stakeholder groups to improve neonatal survival in the Quang Ninh province, Vietnam

BACKGROUND: Annually, 2.8 million neonatal deaths occur worldwide, despite the fact that three-quarters of them could be prevented if available evidence-based interventions were used. Facilitation of community groups has been recognized as a promising method to translate knowledge into practice. In northern Vietnam, the Neonatal Health - Knowledge Into Practice trial evaluated facilitation of community groups (2008-2011) and succeeded in reducing the neonatal mortality rate (adjusted odds ratio, 0.51; 95 % confidence interval 0.30-0.89). The aim of this paper is to report on the process (implementation and mechanism of impact) of this intervention. METHODS: Process data were excerpted from diary information from meetings with facilitators and intervention groups, and from supervisor records of monthly meetings with facilitators. Data were analyzed using descriptive statistics. An evaluation including attributes and skills of facilitators (e.g., group management, communication, and commitment) was performed at the end of the intervention using a six-item instrument. Odds ratios were analyzed, adjusted for cluster randomization using general linear mixed models. RESULTS: To ensure eight active facilitators over 3 years, 11 Women's Union representatives were recruited and trained. Of the 44 intervention groups, composed of health staff and commune stakeholders, 43 completed their activities until the end of the study. In total, 95 % (n = 1508) of the intended monthly meetings with an intervention group and a facilitator were conducted. The overall attendance of intervention group members was 86 %. The groups identified 32 unique problems and implemented 39 unique actions. The identified problems targeted health issues concerning both women and neonates. Actions implemented were mainly communication activities. Communes supported by a group with a facilitator who was rated high on attributes and skills (n = 27) had lower odds of neonatal mortality (odds ratio, 0.37; 95 % confidence interval, 0.19-0.73) than control communes (n = 46). CONCLUSIONS: This evaluation identified several factors that might have influenced the outcomes of the trial: continuity of intervention groups' work, adequate attributes and skills of facilitators, and targeting problems along a continuum of care. Such factors are important to consider in scaling-up efforts.

Extraction of structured programs from specification proofs

We present a method using an extended logical system for obtaining programs from specifications written in a sublanguage of CASL. These programs are “correct” in the sense that they satisfy their specifications. The technique we use is to extract programs from proofs in formal logic by techniques due to Curry and Howard. The logical calculus, however, is novel because it adds structural rules corresponding to the standard ways of modifying specifications: translating (renaming), taking unions, and hiding signatures. Although programs extracted by the Curry-Howard process can be very cumbersome, we use a number of simplifications that ensure that the programs extracted are in a language close to a standard high-level programming language. We use this to produce an executable refinement of a given specification and we then provide a method for producing a program module that maximally respects the original structure of the specification. Throughout the paper we demonstrate the technique with a simple example.