Moose-vehicle collisions (MVC) in the State of Maine from 1992-2004

http://digitalcommons.colby.edu/atlasofmaine2005/1004/thumbnail.jpg

ESTIMATED NUMBER AND LOCATION OF FUTURE MOOSE-VEHICLE COLLISIONS (MVC) IN MAINE

http://digitalcommons.colby.edu/atlasofmaine2005/1018/thumbnail.jpg

Estimated Number and Location of Future Moose-Vehicle Collisions (MVC) in Maine

Moose (Alces alces) are a keystone herbivore in Maine. Because of the large number of rural roads in Maine, there is a high rate of moose-vehicle collisions (MVCs), which is increasing. On-road encounters with animals resulted in 231 fatalities in the United States in 1999. Because of the fatality of MVCs, it is important to know where they are most likely to occur. I used GIS analysis to estimate where future MVCs would occur, factoring in the variables of land cover suitability for moose, distance from water bodies, locations of past MVCs, and speed limits on the roads. I ran four different analyses, each one weighting the variables equally. I also ran a regression to determine if increasing road speed was associated with the increase in the number of MVCs per length of road. There was not a strong positive relationship between the number of MVCs per length of road and the speed limit, but it was interesting to note that there were more MVCs per length of road on 35mph and 40mph roads than on 45, 50, 55 or 65mph roads. Future research on MVCs would benefit from the inclusion of include moose population density and road traffic data.

Graphical constraints: a graphical user interface for constraint problems

A constraint satisfaction problem is a classical artificial intelligence paradigm characterized by a set of variables (each variable with an associated domain of possible values), and a set of constraints that specify relations among subsets of these variables. Solutions are assignments of values to all variables that satisfy all the constraints. Many real world problems may be modelled by means of constraints. The range of problems that can use this representation is very diverse and embraces areas like resource allocation, scheduling, timetabling or vehicle routing. Constraint programming is a form of declarative programming in the sense that instead of specifying a sequence of steps to execute, it relies on properties of the solutions to be found, which are explicitly defined by constraints. The idea of constraint programming is to solve problems by stating constraints which must be satisfied by the solutions. Constraint programming is based on specialized constraint solvers that take advantage of constraints to search for solutions. The success and popularity of complex problem solving tools can be greatly enhanced by the availability of friendly user interfaces. User interfaces cover two fundamental areas: receiving information from the user and communicating it to the system; and getting information from the system and deliver it to the user. Despite its potential impact, adequate user interfaces are uncommon in constraint programming in general. The main goal of this project is to develop a graphical user interface that allows to, intuitively, represent constraint satisfaction problems. The idea is to visually represent the variables of the problem, their domains and the problem constraints and enable the user to interact with an adequate constraint solver to process the constraints and compute the solutions. Moreover, the graphical interface should be capable of configure the solver’s parameters and present solutions in an appealing interactive way. As a proof of concept, the developed application – GraphicalConstraints – focus on continuous constraint programming, which deals with real valued variables and numerical constraints (equations and inequalities). RealPaver, a state-of-the-art solver in continuous domains, was used in the application. The graphical interface supports all stages of constraint processing, from the design of the constraint network to the presentation of the end feasible space solutions as 2D or 3D boxes.

Desenvolvimento de um modelo computacional para a ampliação do atendimento do Programa de Acessibilidade Especial Porta a Porta - PRAE

Worldwide, the demand for transportation services for persons with disabilities, the elderly, and persons with reduced mobility have increased in recent years. The population is aging, governments need to adapt to this reality, and this fact could mean business opportunities for companies. Within this context is inserted the Programa de Acessibilidade Especial porta a porta PRAE, a door to door public transportation service from the city of Natal-RN in Brazil. The research presented in this dissertation seeks to develop a programming model which can assist the process of decision making of managers of the shuttle. To that end, it was created an algorithm based on methods of generating approximate solutions known as heuristics. The purpose of the model is to increase the number of people served by the PRAE, given the available fleet, generating optimized schedules routes. The PRAE is a problem of vehicle routing and scheduling of dial-a-ride - DARP, the most complex type among the routing problems. The validation of the method of resolution was made by comparing the results derived by the model and the currently programming method. It is expected that the model is able to increase the current capacity of the service requests of transport

Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem

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

Ice as a vehicle for diarrheagenic Escherichia coli

In a recent study of the microbiological quality of commercial ice, 50 Escherichia coli isolates belonging to different serotypes were found. The potential hazard from these isolates was examined by testing their adherence patterns ill HeLa cells and searching for the presence of DNA sequences related to E. coli virulence properties. Twelve potentially diarrheagenic isolates were found and classified as enteroaggregative E. coli (EAEC) based oil their ability to produce aggregative adherence to HeLa cells. The remaining isolates were devoid of the virulence properties searched for. The EAEC isolates belonged to 10 different serotypes, among which O128ab:H35 is often found in diarrheic feces. None of these isolates reacted with a specific EAEC DNA probe or carried any of the known EAEC virulence genes. These data indicate that ice may be all important vehicle for transmission of enteropathogens, especially of the EAEC group. (C) 2003 Elsevier B.V. All rights reserved.

A study of reverse logistics flow management in vehicle battery industries in the midwest of the state of São Paulo (Brazil)

Having the objective of minimizing costs and improving their image in the consumer and export market, car battery industries began to seek environmental alternatives geared towards sustainable development. Reverse logistics flow represents an unprecedented tool for the economic and operational development of company activities, as well as a differential in the search for competitive advantages through environmentally correct practices. The aim of this paper is to describe the reverse logistics chain adopted by automotive battery industries in the midwest of the state of São Paulo, proposing a reverse logistics framework for small manufacturers that creates actions aimed at not harming the environment. (C) 2010 Elsevier Ltd. All rights reserved.

Binary integer programming formulations for scheduling in market-driven foundries

This paper describes the development and solution of binary integer formulations for production scheduling problems in market-driven foundries. This industrial sector is comprised of small and mid-sized companies with little or no automation, working with diversified production, involving several different metal alloy specifications in small tailor-made product lots. The characteristics and constraints involved in a typical production environment at these industries challenge the formulation of mathematical programming models that can be computationally solved when considering real applications. However, despite the interest on the part of these industries in counting on effective methods for production scheduling, there are few studies available on the subject. The computational tests prove the robustness and feasibility of proposed models in situations analogous to those found in production scheduling at the analyzed industrial sector. (C) 2010 Elsevier Ltd. All rights reserved.