63 resultados para traversal


Relevância:

10.00% 10.00%

Publicador:

Resumo:

A desktop tool for replay and analysis of gaze-enhanced multiparty virtual collaborative sessions is described. We linked three CAVE (TM)-like environments, creating a multiparty collaborative virtual space where avatars are animated with 3D gaze as well as head and hand motions in real time. Log files are recorded for subsequent playback and analysis Using the proposed software tool. During replaying the user can rotate the viewpoint and navigate in the simulated 3D scene. The playback mechanism relies on multiple distributed log files captured at every site. This structure enables an observer to experience latencies of movement and information transfer for every site as this is important fir conversation analysis. Playback uses an event-replay algorithm, modified to allow fast traversal of the scene by selective rendering of nodes, and to simulate fast random access. The tool's is analysis module can show each participant's 3D gaze points and areas where gaze has been concentrated.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This paper proposes a Dual-Magnet Magnetic Compliance Unit (DMCU) for use in medium sized space rover platforms to enhance terrain handling capabilities and speed of traversal. An explanation of magnetic compliance and how it can be applied to space robotics is shown, along with an initial mathematical model for this system. A design for the DMCU is proposed along with a 4-wheeled DMCU Testing Rig.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We report a clear transition through a reconnection layer at the low-latitude magnetopause which shows a complete traversal across all reconnected field lines during northwestward interplanetary magnetic field (IMF) conditions. The associated plasma populations confirm details of the electron and ion mixing and the time history and acceleration through the current layer. This case has low magnetic shear with a strong guide field and the reconnection layer contains a single density depletion layer on the magnetosheath side which we suggest results from nearly field-aligned magnetosheath flows. Within the reconnection boundary layer, there are two plasma boundaries, close to the inferred separatrices on the magnetosphere and magnetosheath sides (Ssp and Ssh) and two boundaries associated with the Alfvén waves (or Rotational Discontinuities, RDsp and RDsh). The data are consistent with these being launched from the reconnection site and the plasma distributions are well ordered and suggestive of the time elapsed since reconnection of the field lines observed. In each sub-layer between the boundaries the plasma distribution is different and is centered around the current sheet, responsible for magnetosheath acceleration. We show evidence for a velocity dispersion effect in the electron anisotropy that is consistent with the time elapsed since reconnection. In addition, new evidence is presented for the occurrence of partial reflection of magnetosheath electrons at the magnetopause current layer.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The planning of semi-autonomous vehicles in traffic scenarios is a relatively new problem that contributes towards the goal of making road travel by vehicles free of human drivers. An algorithm needs to ensure optimal real time planning of multiple vehicles (moving in either direction along a road), in the presence of a complex obstacle network. Unlike other approaches, here we assume that speed lanes are not present and that different lanes do not need to be maintained for inbound and outbound traffic. Our basic hypothesis is to carry forward the planning task to ensure that a sufficient distance is maintained by each vehicle from all other vehicles, obstacles and road boundaries. We present here a 4-layer planning algorithm that consists of road selection (for selecting the individual roads of traversal to reach the goal), pathway selection (a strategy to avoid and/or overtake obstacles, road diversions and other blockages), pathway distribution (to select the position of a vehicle at every instance of time in a pathway), and trajectory generation (for generating a curve, smooth enough, to allow for the maximum possible speed). Cooperation between vehicles is handled separately at the different levels, the aim being to maximize the separation between vehicles. Simulated results exhibit behaviours of smooth, efficient and safe driving of vehicles in multiple scenarios; along with typical vehicle behaviours including following and overtaking.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Introduction: The Frailty Syndrome is characterized by the decrease of energy reserve and the reduced resistance to stressors. Studies indicate that the neuroendocrine markers can be related to the appearance of this syndrome. The main endocrine answer to stress is the increase of cortisol levels. Objective: To analyze the correlation between the frailty syndrome the salivary cortisol in elderly residing in nursing homes. Method: A traversal study was accomplished, in João Pessoa city, PB, with a sample composed by 69 institutionalized elderly. The collected data refer to the frailty phenotype (weight loss, exhaustion, slowness, weakness, and lower level of physical activity) and to salivary cortisol parameters (first measure - 6-7h; second measure - 11-12h; third measure - 16-17h). In the statistical analysis the Pearson s correlation test was used, Chi square Test and Anova and Simple Linear Regression analyses. Results: The sample was composed by 37.7% of men and 62.3% of women, with age average of 77.52 (±7.82). There was a percentile of 45.8% frail elderly. The frail elderly obtained higher cortisol values in the third measure (p=0.04) and the frailty load was significantly associated to the first measure (r=0.25, p=0.04). The simple linear regression analysis presented a determination rate (R2=0.05) between frailty load and first cortisol measure. Conclusion: The largest cortisol values in the morning and before sleeping among the frail elderly supply indications that can have a relationship of cortisol increase levels and the frailty presence in elderly from nursing homes.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A time for a quantum particle to traverse a barrier is obtained for stationary states by setting the local value of a time operator equal to a constant. This time operator, called the tempus operator because it is distinct from the time of evolution, is defined as the operator canonically conjugate to the energy operator. The local value of the tempus operator gives a complex time for a particle to traverse a barrier. The method is applied to a particle with a semiclassical wave function, which gives, in the classical limit, the correct classical traversal time. It is also applied to a quantum particle tunneling through a rectangular barrier. The resulting complex tunneling time is compared with complex tunneling times from other methods.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Pós-graduação em Agronomia - FEIS

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Pós-graduação em Ciências Biológicas (Biologia Vegetal) - IBRC

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A long-standing problem when testing from a deterministic finite state machine is to guarantee full fault coverage even if the faults introduce extra states in the implementations. It is well known that such tests should include the sequences in a traversal set which contains all input sequences of length defined by the number of extra states. This paper suggests the SPY method, which helps reduce the length of tests by distributing sequences of the traversal set and reducing test branching. It is also demonstrated that an additional assumption about the implementation under test relaxes the requirement of the complete traversal set. The results of the experimental comparison of the proposed method with an existing method indicate that the resulting reduction can reach 40%. Experimental results suggest that the additional assumption about the implementation can help in further reducing the test suite length. Copyright (C) 2011 John Wiley & Sons, Ltd.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

As the number of solutions to the Einstein equations with realistic matter sources that admit closed time-like curves (CTC's) has grown drastically, it has provoked some authors [10] to call for a physical interpretation of these seemingly exotic curves that could possibly allow for causality violations. A first step in drafting a physical interpretation would be to understand how CTC's are created because the recent work of [16] has suggested that, to follow a CTC, observers must counter-rotate with the rotating matter, contrary to the currently accepted explanation that it is due to inertial frame dragging that CTC's are created. The exact link between inertialframe dragging and CTC's is investigated by simulating particle geodesics and the precession of gyroscopes along CTC's and backward in time oriented circular orbits in the van Stockum metric, known to have CTC's that could be traversal, so the van Stockum cylinder could be exploited as a time machine. This study of gyroscopeprecession, in the van Stockum metric, supports the theory that CTC's are produced by inertial frame dragging due to rotating spacetime metrics.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

An optimizing compiler internal representation fundamentally affects the clarity, efficiency and feasibility of optimization algorithms employed by the compiler. Static Single Assignment (SSA) as a state-of-the-art program representation has great advantages though still can be improved. This dissertation explores the domain of single assignment beyond SSA, and presents two novel program representations: Future Gated Single Assignment (FGSA) and Recursive Future Predicated Form (RFPF). Both FGSA and RFPF embed control flow and data flow information, enabling efficient traversal program information and thus leading to better and simpler optimizations. We introduce future value concept, the designing base of both FGSA and RFPF, which permits a consumer instruction to be encountered before the producer of its source operand(s) in a control flow setting. We show that FGSA is efficiently computable by using a series T1/T2/TR transformation, yielding an expected linear time algorithm for combining together the construction of the pruned single assignment form and live analysis for both reducible and irreducible graphs. As a result, the approach results in an average reduction of 7.7%, with a maximum of 67% in the number of gating functions compared to the pruned SSA form on the SPEC2000 benchmark suite. We present a solid and near optimal framework to perform inverse transformation from single assignment programs. We demonstrate the importance of unrestricted code motion and present RFPF. We develop algorithms which enable instruction movement in acyclic, as well as cyclic regions, and show the ease to perform optimizations such as Partial Redundancy Elimination on RFPF.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Information-centric networking (ICN) enables communication in isolated islands, where fixed infrastructure is not available, but also supports seamless communication if the infrastructure is up and running again. In disaster scenarios, when a fixed infrastructure is broken, content discovery algorit hms are required to learn what content is locally available. For example, if preferred content is not available, users may also be satisfied with second best options. In this paper, we describe a new content discovery algorithm and compare it to existing Depth-first and Breadth-first traversal algorithms. Evaluations in mobile scenarios with up to 100 nodes show that it results in better performance, i.e., faster discovery time and smaller traffic overhead, than existing algorithms.