Analysing and visualising areal crime data. A case study of residential burglary in San Francisco, USA

Dissertation submitted in partial fulfillment of the requirements for the Degree of Master of Science in Geospatial Technologies.

A state-contingent production approach to principal-agent problems with an application to point-source pollution control

Two basic representations of principal-agent relationships, the 'state-space' and 'parameterized distribution' formulations, have emerged. Although the state-space formulation appears more natural, analytical studies using this formulation have had limited success. This paper develops a state-space formulation of the moral-hazard problem using a general representation of production under uncertainty. A closed-form solution for the agency-cost problem is derived. Comparative-static results are deduced. Next we solve the principal's problem of selecting the optimal output given the agency-cost function. The analysis is applied to the problem of point-source pollution control. (C) 1998 Published by Elsevier Science S.A. All rights reserved.

Phlebotomine sandflies (Diptera: Psychodidae) in São Vicente Férrer, a sympatric area to cutaneous and visceral leishmaniasis in the state of Pernambuco, Brazil

INTRODUCTION: In the last decades, a considerable geographic expansion of the leishmaniases in all regions of Brazil has been observed. The present study was carried out to identify the composition of the phlebotomine sandfly fauna and verify the seasonal variation of the main species after environmental changes occurred in São Vicente Férrer Municipality, State of Pernambuco, Brazil. METHODS: Captures were carried out during four consecutive nights of each month using Centers for Disease Control and Prevention light traps from September 2009 to September 2010. The correlation between the number of phlebotomine sandflies captured and climatic factors (temperature and rainfall) was evaluated. RESULTS: A total of 13,872 specimens belonging to 20 species were captured, of which, 6,247 (45%) were females, and 7,625 (55%) were males. Lutzomyia migonei was the most abundant species with 9,964 (71.8%) specimens, being predominant in the intradomicile and peridomicile areas with 108 (86.4%) and 9,746 (97%), respectively. In the forest remnants, Lutzomyia complexa 2,395 (65%) and Lutzomyia sordellii 770 (20.8%) predominated. The correlation analysis between the total number of sandflies captured and climatic factors did not show a significant influence on population density. CONCLUSIONS: The high abundance of Lutzomyia migonei and Lutzomyia complexa indicates the possibility of new cases of cutaneous leishmaniasis (CL).

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced

What is the importance of open habitat in a predominantly closed forest area to the dung beetle (Coleoptera, Scarabaeinae) assemblage?

What is the importance of open habitat in a predominantly closed forest to the dung beetle assemblage? The Atlantic Forest in Brazil is one of the most highly disturbed ecosystems and is mainly represented by fragmented areas. However, in places where human disturbances have ceased, certain areas are showing a natural regeneration pattern. The aim of the present study was to determine how the dung beetle assemblage responds to distinct habitat structures in a fragment of Atlantic Forest. For such, open and closed forest areas were sampled in a fragment of the Atlantic Forest in the northeastern region of Brazil. Pitfall traps baited with excrement and carrion were used to collect the beetles. A total of 7,267 individuals belonging to 35 species were captured. Canthon chalybaeus and C. mutabilis were restricted to open areas. Nearly 90% of the individuals of C. aff. simulans and Deltochilum aff. irroratum were identified in these areas. A higher percentage (> 50%) of Canthon staigi, Dichotomius aff. depressicolis and D. aff. sericeus occurred in closed areas. Abundance differed between areas, with higher values in closed areas. Richness was not influenced by the habitat structure. NMDS ordination exhibited the segregation of areas and ANOSIM confirmed that this variable explained the assemblage of dung beetle species. The findings of the present study validate that open areas are associated to more restrictive conditions, limiting a higher abundance of dung beetle. Although situated near preserved fragments, the studied open areas increase the heterogeneity of the general landscape.

Kaupallisten lyhyen kantaman radiotekniikoiden kartoitus ja soveltuvuus analyysi metallisorvin ohjauksessa käytettävään point-to-point yhteyteen

Työssä tutkitaan kaupallisten lyhyen kantaman radiotekniikoiden ominaisuuksia sekä soveltuvuutta metallisorvin langattomaan ohjaukseen. Ominaisuuksien perusteella valitaan parhaiten sovellukseen käyvä radiotekniikka.

Kaupallisten lyhyen kantaman radiotekniikoiden kartoitus ja soveltuvuus analyysi metallisorvin ohjauksessa käytettävään point-to-point yhteyteen

Työssä vertaillaan kaupallisia lyhyen kantaman radiotekniikoita. Vertailujen pohjalta valitaan parhaiten sovelluskohteeseen soveltuva radiotekniikka.

Une nouvelle méthode de détection du glaucome par la mesure de l'asymétrie interoculaire : l’asymétrie du rapport de la surface neurorétinienne sur la surface du disque optique ou rim area to disc area asymmetry ratio (RADAAR)

Cette thèse constitue à la fois un apport de nature clinique et technologique dans l’approche diagnostique du glaucome. Plus précisément, nous nous proposons d’étudier une nouvelle façon de détecter le glaucome par la mesure de l’asymétrie du rapport de la surface de l’anneau neurorétinien et de la surface de la papille ou du disque optique ou rim to disc area asymmetry ratio (RADAAR). Pour atteindre cet objectif, nous avons recours à une base de données composée d’une population subdivisée en 4 différents groupes de diagnostic (normal, glaucome possible, glaucome probable et glaucome définitif). Les mesures du RADAAR sont calculées de différentes façons à partir des paramètres stéréométriques de la tête du nerf optique des sujets, produits par la microscopie confocale à balayage laser (Heidelberg Retina Tomograph (HRT) (Heidelberg Engineering, Germany)). Nous procédons à une analyse de données grâce au logiciel SPSS où nous mettons en exergue la distribution du RADAAR dans les différentes populations, sa validité et son utilité dans le dépistage du glaucome. Nous enrôlons donc 523 sujets dans cette étude avec 82 sujets atteints de glaucome définitif. La moyenne d’âge est de 62 ans. Il y a plus de femmes que d’hommes et plus de Caucasiens que d’Africains Caribéens. Nous trouvons que la distribution de la mesure du RADAAR est différente des sujets d’un groupe de diagnostic à l’autre. En termes de performance, la sensibilité de la mesure du RADAAR est très basse c'est-à-dire que sa capacité de détecter la maladie est basse. En revanche la mesure du RADAAR est plus spécifique c'est-à-dire que sa capacité d’identifier les sujets exempts de la maladie est plus grande. Elle tendrait à être aussi plus performante chez les Africains Caribéens que chez les Caucasiens. De même, elle serait plus sensible chez les hommes que chez les femmes. La mesure du RADAAR est utile si on l’associe à une autre méthode de diagnostic comme l’analyse de Régression de Moorfields (MRA) incluse dans le logiciel du HRT3 spécialement lors de la détection du glaucome dans la population à haut risque. En définitive, nous déterminons que la mesure du RADAAR se veut un outil d’aide au diagnostic. Elle est particulièrement intéressante dans le contexte de dépistage de glaucome.

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced