Business model analysis of Mobitto: How to solve the chicken and egg problem of a multi-sided platform?

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics

Variation in Aedes aegypti (Linnaeus) (Diptera, Culicidae) infestation in artificial containers in Caxias, state of Maranhão, Brazil

INTRODUCTION: Dengue is a serious public health problem worldwide, with cases reported annually in tropical and subtropical regions. Aedes aegypti (Linnaeus, 1762), the main vector of dengue, is a domiciliary species with high dispersal and survival capacities and can use various artificial containers as breeding sites. We assessed potential container breeding sites of A. aegypti in the municipality of Caxias, Maranhão, Brazil. METHODS: In the initial phase, we analyzed 900 properties in 3 neighborhoods during the dry and rainy seasons (August-October 2005 and February-April 2006, respectively). During the second sampling period, September 2006-August 2007, we used 5 assessment cycles for 300 properties in a single neighborhood. RESULTS: During the dry and rainy seasons, water-storage containers comprised 55.7% (n = 1,970) and 48.5% (n = 1,836) of the total containers inspected, and showed the highest productivity of immature A. aegypti; we found 23.7 and 106.1 individuals/container, respectively, in peridomicile sites. In intradomicile sites, water-storage containers were also the most important breeding sites with 86.4% (n = 973) and 85.6% (n = 900) of all containers and a mean of 7.9 and 108.3 individuals/container in the dry and rainy seaso-October 2006 (1,342). The highest number of positives (70) was recorded in May, mostly (94%) in storage containers. CONCLUSIONS: Storage containers are the principal and most productive A. aegypti breeding sites and are a major contributing factor to the maintenance of this vector in Caxias.

A public transport bus assignment problem: parallel metaheuristics assessment

Combinatorial Optimization Problems occur in a wide variety of contexts and generally are NP-hard problems. At a corporate level solving this problems is of great importance since they contribute to the optimization of operational costs. In this thesis we propose to solve the Public Transport Bus Assignment problem considering an heterogeneous fleet and line exchanges, a variant of the Multi-Depot Vehicle Scheduling Problem in which additional constraints are enforced to model a real life scenario. The number of constraints involved and the large number of variables makes impracticable solving to optimality using complete search techniques. Therefore, we explore metaheuristics, that sacrifice optimality to produce solutions in feasible time. More concretely, we focus on the development of algorithms based on a sophisticated metaheuristic, Ant-Colony Optimization (ACO), which is based on a stochastic learning mechanism. For complex problems with a considerable number of constraints, sophisticated metaheuristics may fail to produce quality solutions in a reasonable amount of time. Thus, we developed parallel shared-memory (SM) synchronous ACO algorithms, however, synchronism originates the straggler problem. Therefore, we proposed three SM asynchronous algorithms that break the original algorithm semantics and differ on the degree of concurrency allowed while manipulating the learned information. Our results show that our sequential ACO algorithms produced better solutions than a Restarts metaheuristic, the ACO algorithms were able to learn and better solutions were achieved by increasing the amount of cooperation (number of search agents). Regarding parallel algorithms, our asynchronous ACO algorithms outperformed synchronous ones in terms of speedup and solution quality, achieving speedups of 17.6x. The cooperation scheme imposed by asynchronism also achieved a better learning rate than the original one.

Snakebites as a largely neglected problem in the Brazilian Amazon: highlights of the epidemiological trends in the State of Amazonas

Envenoming snakebites are thought to be a particularly important threat to public health worldwide, especially in rural areas of tropical and subtropical countries. The true magnitude of the public health threat posed by snakebites is unknown, making it difficult for public health officials to optimize prevention and treatment. The objective of this work was to conduct a systematic review of the literature to gather data on snakebite epidemiology in the Amazon region and describe a case series of snakebites from epidemiological surveillance in the State of Amazonas (1974-2012). Only 11 articles regarding snakebites were found. In the State of Amazonas, information regarding incidents involving snakes is scarce. Historical trends show an increasing number of cases after the second half of the 1980s. Snakebites predominated among adults (20-39 years old; 38%), in the male gender (78.9%) and in those living in rural areas (85.6%). The predominant snake envenomation type was bothropic. The incidence reported by the epidemiological surveillance in the State of Amazonas, reaching up to 200 cases/100,000 inhabitants in some areas, is among the highest annual snakebite incidence rates of any region in the world. The majority of the cases were reported in the rainy season with a case-fatality rate of 0.6%. Snakebite envenomation is a great disease burden in the State of Amazonas, representing a challenge for future investigations, including approaches to estimating incidence under-notification and case-fatality rates as well as the factors related to severity and disabilities.

The effect of deforestation on the water cycle in the amazon basin: an attempt reformulate the problem

If widespread deforestation in Amazon results in reduced evaporative water flux, then either a decrease in evaporation is compensated locally by reduced rainfall,or else changed moisture balance expresses itself downwind in the yet undisturbed forest. The question of where rain will occur is crucial. It is suggested that the appearance of clouds and the occurrence of rainout is governed primarily by the interplay of local meteorologic and physical geography parameters with the atmospheric stability structure except for a few well-defined periods when rain is dominated by large scale atmospheric instability. This means that the study of these phenomena (local heat balances,studies on cloud formation mechanism, vertical atmospheric stability, etc.) must be made on the scale of the cloud size, a few tens of kilometers at most.

A type system for value-dependent information flow analysis

Information systems are widespread and used by anyone with computing devices as well as corporations and governments. It is often the case that security leaks are introduced during the development of an application. Reasons for these security bugs are multiple but among them one can easily identify that it is very hard to define and enforce relevant security policies in modern software. This is because modern applications often rely on container sharing and multi-tenancy where, for instance, data can be stored in the same physical space but is logically mapped into different security compartments or data structures. In turn, these security compartments, to which data is classified into in security policies, can also be dynamic and depend on runtime data. In this thesis we introduce and develop the novel notion of dependent information flow types, and focus on the problem of ensuring data confidentiality in data-centric software. Dependent information flow types fit within the standard framework of dependent type theory, but, unlike usual dependent types, crucially allow the security level of a type, rather than just the structural data type itself, to depend on runtime values. Our dependent function and dependent sum information flow types provide a direct, natural and elegant way to express and enforce fine grained security policies on programs. Namely programs that manipulate structured data types in which the security level of a structure field may depend on values dynamically stored in other fields The main contribution of this work is an efficient analysis that allows programmers to verify, during the development phase, whether programs have information leaks, that is, it verifies whether programs protect the confidentiality of the information they manipulate. As such, we also implemented a prototype typechecker that can be found at http://ctp.di.fct.unl.pt/DIFTprototype/.

Masonry infill walls under blast loading using confined underwater blast wave generators (WBWG)

The vulnerability of the masonry envelop under blast loading is considered critical due to the risk of loss of lives. The behaviour of masonry infill walls subjected to dynamic out-of-plane loading was experimentally investigated in this work. Using confined underwater blast wave generators (WBWG), applying the extremely high rate conversion of the explosive detonation energy into the kinetic energy of a thick water confinement, allowed a surface area distribution avoiding also the generation of high velocity fragments and reducing atmospheric sound wave. In the present study, water plastic containers, having in its centre a detonator inside a cylindrical explosive charge, were used in unreinforced masonry infills panels with 1.7m by 3.5m. Besides the usage of pressure and displacement transducers, pictures with high-speed video cameras were recorded to enable processing of the deflections and identification of failure modes. Additional numerical studies were performed in both unreinforced and reinforced walls. Bed joint reinforcement and grid reinforcement were used to strengthen the infill walls, and the results are presented and compared, allowing to obtain pressure-impulse diagrams for design of masonry infill walls.

A multi-criteria decision support system for a routing problem in waste collection

Autor proof

The non-emergency patient transport modelled as a team orienteering problem

This work presents an improved model to solve the non-emergency patients transport (NEPT) service issues given the new rules recently established in Portugal. The model follows the same principle of the Team Orienteering Problem by selecting the patients to be included in the routes attending the maximum reduction in costs when compared with individual transportation. This model establishes the best sets of patients to be transported together. The model was implemented in AMPL and a compact formulation was solved using NEOS Server. A heuristic procedure based on iteratively solving Orienteering Problems is presented, and this heuristic provides good results in terms of accuracy and computation time. Euclidean instances as well as asymmetric real data gathered from Google maps were used, and the model has a promising performance mainly with asymmetric cost matrices.

A taxonomy for the flexible job shop scheduling problem

This chapter aims at developing a taxonomic framework to classify the studies on the flexible job shop scheduling problem (FJSP). The FJSP is a generalization of the classical job shop scheduling problem (JSP), which is one of the oldest NP-hard problems. Although various solution methodologies have been developed to obtain good solutions in reasonable time for FSJPs with different objective functions and constraints, no study which systematically reviews the FJSP literature has been encountered. In the proposed taxonomy, the type of study, type of problem, objective, methodology, data characteristics, and benchmarking are the main categories. In order to verify the proposed taxonomy, a variety of papers from the literature are classified. Using this classification, several inferences are drawn and gaps in the FJSP literature are specified. With the proposed taxonomy, the aim is to develop a framework for a broad view of the FJSP literature and construct a basis for future studies.

A decision support system for a waste collection vehicle routing problem

The selective collection of municipal solid waste for recycling is a very complex and expensive process, where a major issue is to perform cost-efficient waste collection routes. Despite the abundance of commercially available software for fleet management, they often lack the capability to deal properly with sequencing problems and dynamic revision of plans and schedules during process execution. Our approach to achieve better solutions for the waste collection process is to model it as a vehicle routing problem, more specifically as a team orienteering problem where capacity constraints on the vehicles are considered, as well as time windows for the waste collection points and for the vehicles. The final model is called capacitated team orienteering problem with double time windows (CTOPdTW).We developed a genetic algorithm to solve routing problems in waste collection modelled as a CTOPdTW. The results achieved suggest possible reductions of logistic costs in selective waste collection.