999 resultados para Navigation Graph


Relevância:

20.00% 20.00%

Publicador:

Resumo:

WebGraphEd is an open source software for graph visualization and manipulation. It is especially designed to work for the web platform through a web browser. The web application has been written in JavaScript and compacted later, which makes it a very lightweight software. There is no need of additional software, and the only requirement is to have an HTML5 compliant browser. WebGraphEd works with scalable vector graphics (SVG), which it makes possible to create lossless graph drawings.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper deals with the relationship between the periodic orbits of continuous maps on graphs and the topological entropy of the map. We show that the topological entropy of a graph map can be approximated by the entropy of its periodic orbits.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper deals with the relationship between the periodic orbits of continuous maps on graphs and the topological entropy of the map. We show that the topological entropy of a graph map can be approximated by the entropy of its periodic orbits

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Rodrigo, Chamizo, McLaren, & Mackintosh (1997) demonstrated the blocking effect in a navigational task using a swimming pool: rats initially trained to use three landmarks (ABC) to find an invisible platform learned less about a fourth landmark (X) added later than did rats trained from the outset with these four landmarks (ABCX). The aim of the experiment reported here was to demonstrate unblocking using a similar procedure as in the previous work. Three groups of rats were initially trained to find an invisible platfom in the presence of three landmarks: ABC for the Blocking and Unblocking groups and LMN for the Control group. Then, all animals were trained to find the platform in the presence of four landmarks, ABCX. In this second training, unlike animals in the Blocking group to which only a new landmark (X) was added in comparison to the first training, the animals in the Unblocking group also had a change in the platform position. In the Control group, both the four landmarks and the platform position were totally new at the beginning of this second training. As in Rodrigo et al. (1997) a blocking effect was found: rats in the Blocking group learned less with respect to the added landmark (X) than did animals in the Control group. However, rats in the Unblocking group learned about the added landmark (X) as well as did animals in the Control group. The results are interpreted as an unblocking effect due to a change in the platform position between the two phases of training, similarly to what is normal in classical conditioning experiments, in which a change in the conditions of reinforcement between the two training phases of a blocking design produce an attenuation or elimination of this effect. These results are explained within an error-correcting connectionist account of spatial navigation (McLaren, 2002).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The use of domain-specific languages (DSLs) has been proposed as an approach to cost-e ectively develop families of software systems in a restricted application domain. Domain-specific languages in combination with the accumulated knowledge and experience of previous implementations, can in turn be used to generate new applications with unique sets of requirements. For this reason, DSLs are considered to be an important approach for software reuse. However, the toolset supporting a particular domain-specific language is also domain-specific and is per definition not reusable. Therefore, creating and maintaining a DSL requires additional resources that could be even larger than the savings associated with using them. As a solution, di erent tool frameworks have been proposed to simplify and reduce the cost of developments of DSLs. Developers of tool support for DSLs need to instantiate, customize or configure the framework for a particular DSL. There are di erent approaches for this. An approach is to use an application programming interface (API) and to extend the basic framework using an imperative programming language. An example of a tools which is based on this approach is Eclipse GEF. Another approach is to configure the framework using declarative languages that are independent of the underlying framework implementation. We believe this second approach can bring important benefits as this brings focus to specifying what should the tool be like instead of writing a program specifying how the tool achieves this functionality. In this thesis we explore this second approach. We use graph transformation as the basic approach to customize a domain-specific modeling (DSM) tool framework. The contributions of this thesis includes a comparison of di erent approaches for defining, representing and interchanging software modeling languages and models and a tool architecture for an open domain-specific modeling framework that e ciently integrates several model transformation components and visual editors. We also present several specific algorithms and tool components for DSM framework. These include an approach for graph query based on region operators and the star operator and an approach for reconciling models and diagrams after executing model transformation programs. We exemplify our approach with two case studies MICAS and EFCO. In these studies we show how our experimental modeling tool framework has been used to define tool environments for domain-specific languages.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The authors thoroughly report the development, the technical aspects and the performance of the first navigated liver resections, by laparotomy and laparoscopy, in Brazil, done at the National Cancer Institute, Ministry of Health, using a surgical navigator.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

1915/10/30 (A38,N15).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

1908/12/12 (A31,N50).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

1904/12/03 (A27,N49).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

1905/07/15 (A28,N28).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

1882/04/08 (A5,SER2,N123).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

1886/07/17 (A9,SER3,N29).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

1910/10/29 (A33,N44).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

1907/05/18 (A30,N20).