Alternative paths to Earth-Moon transfer

The planar, circular, restricted three-body problem predicts the existence of periodic orbits around the Lagrangian equilibrium point L1. Considering the Earth-lunar-probe system, some of these orbits pass very close to the surfaces of the Earth and the Moon. These characteristics make it possible for these orbits, in spite of their instability, to be used in transfer maneuvers between Earth and lunar parking orbits. The main goal of this paper is to explore this scenario, adopting a more complex and realistic dynamical system, the four-body problem Sun-Earth-Moon-probe. We defined and investigated a set of paths, derived from the orbits around L1, which are capable of achieving transfer between low-altitude Earth (LEO) and lunar orbits, including high-inclination lunar orbits, at a low cost and with flight time between 13 and 15 days.

Intercalation processes and diffusion paths of lithium ions in spinel-type structured Li(1+x)Ti(2)O(4): Density functional theory study

Intercalation processes and corresponding diffusion paths of Li ions into spinel-type structured Li(1+x)Ti(2)O(4) (0 <= x <= 0.375) are systematically studied by means of periodic density functional theory calculations for different compositions and arrangements. An analysis of the site preference for intercalation processes is carried out, while energy barriers for the diffusion paths have been computed in detail. Our results indicate that the Li insertion is thermodynamically favorable at octahedral sites 16c in the studied composition range, and Li migration from tetrahedral sites 8a to octahedral sites 16c stabilizes the structure and becomes favorable for compositions x >= 0.25. Diffusion paths from less stable arrangements involving Li migrations between tetrahedral and octahedral sites exhibit the lowest energy barrier since the corresponding trajectories and energy profiles take place across a triangle made by three neighboring oxygen anions without structural modification. Theoretical and experimental diffusion coefficients are in reasonable agreement.

Tourism for whom?: Different paths to development and alternative experiments in Brazil

The tourism policies pursued by the Brazilian government since the 1990s have not produced the benefits that were expected from mass tourism. The example of two very successful cases of community-based tourism, stressing paths rooted in a development model that is fair and environmentally responsible, shows that tourism development can improve the quality of life in communities that receive an influx of tourists provided that the local community is taken into account and the planning and implementation of such development focus on creating opportunities and benefits for its members. © 2008 Latin American Perpectives.

Paths towards international competitiveness: a CANalysis

Includes bibliography

Development of a support vector machine-based navigation system for driving a mobile robot through paths in plantations

The use of mobile robots turns out to be interesting in activities where the action of human specialist is difficult or dangerous. Mobile robots are often used for the exploration in areas of difficult access, such as rescue operations and space missions, to avoid human experts exposition to risky situations. Mobile robots are also used in agriculture for planting tasks as well as for keeping the application of pesticides within minimal amounts to mitigate environmental pollution. In this paper we present the development of a system to control the navigation of an autonomous mobile robot through tracks in plantations. Track images are used to control robot direction by preprocessing them to extract image features. Such features are then submitted to a support vector machine in order to find out the most appropriate route. The overall goal of the project to which this work is connected is to develop a real time robot control system to be embedded into a hardware platform. In this paper we report the software implementation of a support vector machine, which so far presented around 93% accuracy in predicting the appropriate route. © 2012 IEEE.

Development Paths In The Caribbean

This study analyzes the patterns of development in the Caribbean and gives particular focus to the challenges to and opportunities for sustainable development. The study is divided into two parts. The first part of the study examines trajectories for development in the Caribbean, while the second addresses the relationship between competition and integration.1 The significant development gains attained since independence have been threatened in the last decade. Slowing productivity growth, rising debt, increasing crime and social dislocation in recent years have adversely affected growth in per capita income and social welfare. The study therefore calls on policy makers to promote dynamic drivers of growth and development in the region. The key requirement in this regard, is the need to strengthen import productivity,2 or the efficiency with which the region uses foreign exchange. This can be done by producing and exporting more high-value services such as education and the output of the creative industries. The sub-region also needs to strengthen its systems of governance by providing more opportunities for citizens to participate in decision making. In addition, the region needs to address the inherent relationship between competition and integration by developing improved systems to cushion the negative impacts on weaker members of the integration arrangement. These could include a more robust development fund and capacity building to enable losers to benefit from regional trade and investment. However, regional integration should provide a platform for moving up the value chain, through research and development and innovation to produce more competitive exports.

Comparing support vector machines and artificial neural networks in the recognition of steering angle for driving of mobile robots through paths in plantations

The use of mobile robots turns out to be interesting in activities where the action of human specialist is difficult or dangerous. Mobile robots are often used for the exploration in areas of difficult access, such as rescue operations and space missions, to avoid human experts exposition to risky situations. Mobile robots are also used in agriculture for planting tasks as well as for keeping the application of pesticides within minimal amounts to mitigate environmental pollution. In this paper we present the development of a system to control the navigation of an autonomous mobile robot through tracks in plantations. Track images are used to control robot direction by pre-processing them to extract image features. Such features are then submitted to a support vector machine and an artificial neural network in order to find out the most appropriate route. A comparison of the two approaches was performed to ascertain the one presenting the best outcome. The overall goal of the project to which this work is connected is to develop a real time robot control system to be embedded into a hardware platform. In this paper we report the software implementation of a support vector machine and of an artificial neural network, which so far presented respectively around 93% and 90% accuracy in predicting the appropriate route. (C) 2013 The Authors. Published by Elsevier B.V. Selection and peer review under responsibility of the organizers of the 2013 International Conference on Computational Science

Environment and dispersal paths override life strategies and residence time in determining regional patterns of invasion by alien plants

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

Capturing Transition Paths and Transition States for Conformational Rearrangements in the Ribosome

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A Heuristic with Bounded Guarantee to Compute Diverse Paths under Shared Protection in WDM Mesh Networks

Establishing a fault-tolerant connection in a network involves computation of diverse working and protection paths. The Shared Risk Link Group (SRLG) [1] concept is used to model several types of failure conditions such as link, node, fiber conduit, etc. In this work we focus on the problem of computing optimal SRLG/link diverse paths under shared protection. Shared protection technique improves network resource utilization by allowing protection paths of multiple connections to share resources. In this work we propose an iterative heuristic for computing SRLG/link diverse paths. We present a method to calculate a quantitative measure that provides a bounded guarantee on the optimality of the diverse paths computed by the heuristic. The experimental results on computing link diverse paths show that our proposed heuristic is efficient in terms of number of iterations required (time taken) to compute diverse paths when compared to other previously proposed heuristics.

Least-cost Disjoint Paths with Dependent Cost Structure in Wavelength Continuous Optical WDM Networks

One of the important issues in establishing a fault tolerant connection in a wavelength division multiplexing optical network is computing a pair of disjoint working and protection paths and a free wavelength along the paths. While most of the earlier research focused only on computing disjoint paths, in this work we consider computing both disjoint paths and a free wavelength along the paths. The concept of dependent cost structure (DCS) of protection paths to enhance their resource sharing ability was proposed in our earlier work. In this work we extend the concept of DCS of protection paths to wavelength continuous networks. We formalize the problem of computing disjoint paths with DCS in wavelength continuous networks and prove that it is NP-complete. We present an iterative heuristic that uses a layered graph model to compute disjoint paths with DCS and identify a free wavelength.

Permutation classes, sorting algorithms, and lattice paths

A permutation is said to avoid a pattern if it does not contain any subsequence which is order-isomorphic to it. Donald Knuth, in the first volume of his celebrated book "The art of Computer Programming", observed that the permutations that can be computed (or, equivalently, sorted) by some particular data structures can be characterized in terms of pattern avoidance. In more recent years, the topic was reopened several times, while often in terms of sortable permutations rather than computable ones. The idea to sort permutations by using one of Knuth’s devices suggests to look for a deterministic procedure that decides, in linear time, if there exists a sequence of operations which is able to convert a given permutation into the identical one. In this thesis we show that, for the stack and the restricted deques, there exists an unique way to implement such a procedure. Moreover, we use these sorting procedures to create new sorting algorithms, and we prove some unexpected commutation properties between these procedures and the base step of bubblesort. We also show that the permutations that can be sorted by a combination of the base steps of bubblesort and its dual can be expressed, once again, in terms of pattern avoidance. In the final chapter we give an alternative proof of some enumerative results, in particular for the classes of permutations that can be sorted by the two restricted deques. It is well-known that the permutations that can be sorted through a restricted deque are counted by the Schrӧder numbers. In the thesis, we show how the deterministic sorting procedures yield a bijection between sortable permutations and Schrӧder paths.

Paths of Discovery: Comparing the Search effectiveness of EBSCO Discovery Service, Summon, Google Scholar, and Conventional Library Resources

In 2011, researchers at Bucknell University and Illinois Wesleyan University compared the search efficacy of Serial Solutions Summon, EBSCO Discovery Service, Google Scholar and conventional library databases. Using a mixed-methods approach, qualitative and quantitative data was gathered on students’ usage of these tools. Regardless of the search system, students exhibited a marked inability to effectively evaluate sources and a heavy reliance on default search settings. On the quantitative benchmarks measured by this study, the EBSCO Discovery Service tool outperformed the other search systems in almost every category. This article describes these results and makes recommendations for libraries considering these tools.