The benefits and pitfalls of participating in a corporate inversion: a case study of two companies on two different paths

Even though the term corporate inversion has been heard globally for decades, it has only become more prevalent in the United States during the past two years. This case study examines two United States companies that recently had very high profile and public corporate inversion experiences. Complicated tax laws and high tax rales have long eroded the ability of United States companies to remain competitive on a global scale. During the past two years, tax reform has been elevated to the Presidential and Congressional levei. Because these reform efforts have stalled, however, and in the constant search for ways to become more competitive and profitable, United States dorniciled companies have begun to more aggressively explore corporate inversion. This case study of Walgreens Alliance Boots and Mylan N.V., is undertaken because while the reasons to pursue a corporate inversion for both companies were very similar and done during the same time period, the internai process and final outcome were dramatically different. The other dynamic studied is the role both internai and externai politics had on these two cornpanies and how they influenced the decisions made by the executives. Lastly, the Obama Administration continues to threaten so called "corporate America" to remain in the country through regulatory pressure, but this has not stopped companies frorn pursing corporate inversions. Legislatively, attempts at corporate tax reform, another way to encourage Untied States companies to remain, have also failed. I will not try to determine i f a corporate inversion is the right path for a company to take. I am examining how the rise o f the practice o f corporate inversions has been elevated in boardroorns, on Wall Street, in Congress and at the White House during the past two years.

The open capacitated arc routing problem

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

Alternative paths for insertion of probes into high inclination lunar orbits

The dynamics of the restricted three-body Earth-Moon-particle problem predicts the existence of direct periodic orbits around the Lagrangian equilibrium point L1. From these orbits, we derive a set of trajectories that form links between the Earth and the Moon and are capable of performing transfers between terrestrial and lunar orbits, in addition to defining an escape route from the Earth-Moon system. When we consider a more complex and realistic dynamical system - the four-body Sun-Earth-Moon-particle (probe) problem - the trajectories have an expressive gain of inclination when they penetrate in the lunar influence sphere, thus allowing the insertion of probes into low-altitude lunar orbits with high inclinations, including polar orbits. In this study, we present these links and investigate some possibilities for performing an Earth-Moon transfer based on these trajectories. (C) 2007 COSPAR. Published by Elsevier Ltd. All rights reserved.

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

GRASP with evolutionary path-relinking for the capacitated arc routing problem

The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required edges under vehicle capacity constraints. There are numerous applications for the CARP, such as street sweeping, garbage collection, mail delivery, school bus routing, and meter reading. A Greedy Randomized Adaptive Search Procedure (GRASP) with Path-Relinking (PR) is proposed and compared with other successful CARP metaheuristics. Some features of this GRASP with PR are (i) reactive parameter tuning, where the parameter value is stochastically selected biased in favor of those values which historically produced the best solutions in average; (ii) a statistical filter, which discard initial solutions if they are unlikely to improve the incumbent best solution; (iii) infeasible local search, where high-quality solutions, though infeasible, are used to explore the feasible/infeasible boundaries of the solution space; (iv) evolutionary PR, a recent trend where the pool of elite solutions is progressively improved by successive relinking of pairs of elite solutions. Computational tests were conducted using a set of 81 instances, and results reveal that the GRASP is very competitive, achieving the best overall deviation from lower bounds and the highest number of best solutions found. © 2011 Elsevier Ltd. All rights reserved.

Application of ontologies in peer-to-peer database with routing queries based on ant colony algorithm

A significant set of information stored in different databases around the world, can be shared through peer-topeer databases. With that, is obtained a large base of knowledge, without the need for large investments because they are used existing databases, as well as the infrastructure in place. However, the structural characteristics of peer-topeer, makes complex the process of finding such information. On the other side, these databases are often heterogeneous in their schemas, but semantically similar in their content. A good peer-to-peer databases systems should allow the user access information from databases scattered across the network and receive only the information really relate to your topic of interest. This paper proposes to use ontologies in peer-to-peer database queries to represent the semantics inherent to the data. The main contribution of this work is enable integration between heterogeneous databases, improve the performance of such queries and use the algorithm of optimization Ant Colony to solve the problem of locating information on peer-to-peer networks, which presents an improve of 18% in results. © 2011 IEEE.

Architecture for peer-to-peer databases with routing queries using ant colony algorithm and semantic support

In a peer-to-peer network, the nodes interact with each other by sharing resources, services and information. Many applications have been developed using such networks, being a class of such applications are peer-to-peer databases. The peer-to-peer databases systems allow the sharing of unstructured data, being able to integrate data from several sources, without the need of large investments, because they are used existing repositories. However, the high flexibility and dynamicity of networks the network, as well as the absence of a centralized management of information, becomes complex the process of locating information among various participants in the network. In this context, this paper presents original contributions by a proposed architecture for a routing system that uses the Ant Colony algorithm to optimize the search for desired information supported by ontologies to add semantics to shared data, enabling integration among heterogeneous databases and the while seeking to reduce the message traffic on the network without causing losses in the amount of responses, confirmed by the improve of 22.5% in this amount. © 2011 IEEE.

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.