Modelo de localização de sistemas de águas residuais

Dissertação apresentada como requisito parcial para obtenção do grau de Mestre em Ciência e Sistemas de Informação Geográfica

Interaction between GIS and hydrologic model: a preliminary approach using ArcHydro Framework Data Model

In different regions of Brazil, population growth and economic development can degrade water quality, compromising watershed health and human supply. Because of its ability to combine spatial and temporal data in the same environment and to create water resources management (WRM) models, the Geographical Information System (GIS) is a powerful tool for managing water resources, preventing floods and estimating water supply. This paper discusses the integration between GIS and hydrological models and presents a case study relating to the upper section of the Paraíba do Sul Basin (Sao Paulo State portion), situated in the Southeast of Brazil. The case study presented in this paper has a database suitable for the basin's dimensions, including digitized topographic maps at a 50,000 scale. From an ArcGIS®/ArcHydro Framework Data Model, a geometric network was created to produce different raster products. This first grid derived from the digital elevation model grid (DEM) is the flow direction map followed by flow accumulation, stream and catchment maps. The next steps in this research are to include the different multipurpose reservoirs situated along the Paraíba do Sul River and to incorporate rainfall time series data in ArcHydro to build a hydrologic data model within a GIS environment in order to produce a comprehensive spatial-temporal model.

Towards the computer-aided diagnosis of dementia based on the geometric and network connectivity of structural MRI data

We present an intuitive geometric approach for analysing the structure and fragility of T1-weighted structural MRI scans of human brains. Apart from computing characteristics like the surface area and volume of regions of the brain that consist of highly active voxels, we also employ Network Theory in order to test how close these regions are to breaking apart. This analysis is used in an attempt to automatically classify subjects into three categories: Alzheimer’s disease, mild cognitive impairment and healthy controls, for the CADDementia Challenge.

Prolonged fluconazole exposure leads to a shift to Candida species with decreased susceptibility in breakthrough candidemia: prospective survey of the Fungal Infection Network of Switzerland

Objectives: To compare the clinical characteristics, species distribution and antifungal susceptibility of Candida bloodstream isolates (BSI) in breakthrough (BTC) vs. non-breakthrough candidemia (NBTC) and to study the effect of prolonged vs. short fluconazole (F) exposure in BTC.Methods: Candida BSI were prospectively collected during 2004- 2006 from 27 hospitals (seven university, 20 affiliated) of the FUNGINOS network. Susceptibility to F, voriconazole (V) and caspofungin (C) was tested in the FUNGINOS mycology reference laboratory by microtitre broth dilution method with the Sensititre YeastOneTM test panel. Clinical data were collected using standardized CRFs. BTC was defined as occurring during antifungal treatment/prophylaxis of at least three days duration prior to the candidemia. Susceptibility of BSI was defined according to 2010/2011 CLSI clinical breakpoints.Results: Out of 567 candidemia episodes, 550 Candida BSI were available. Of these, 43 (7.6%) were from BTC (37/43, 86% were isolated after F exposure). 38 BTC (88.4%) and 315 NBTC (55.6%) occurred in university hospitals (P < 0.001). The majority of patients developing BTC were immunocompromised: higher proportions of haematological malignancies (62.8% in BTC vs. 47.1% in NBTC, P < 0.001), neutropenia (37.2% vs. 11.8%, P < 0.001), acute GvHD (14% vs. 0.2%, P < 0.001), immunosuppressive drugs (74.4% vs. 7.8%, P < 0.001), and mucositis (32.6% vs. 2.3%, P < 0.001) were observed. Other differences between BTC and NBTC were higher proportions of patients with central venous catheters in the 2 weeks preceding candidemia (95.3% vs. 83.4%, P = 0.047) and receiving total parenteral nutrition (62.8% vs. 35.9%, P < 0.001), but a lower proportion of patients treated with gastric proton pump inhibitors (23.3% vs. 72.1%, P < 0.001). Overall mortality of BTC and NBTC was not different (34.9% vs. 31.7%, P = 0.73), while a trend to higher attributable mortality in BTC was found (13.9% vs. 6.9%, P = 0.12). Species identification showed a majority of C. albicans in both groups (51.2% in BTC vs. 62.9% in NBTC, P = 0.26), followed by C. glabrata (18.6% vs. 18.5%), C. tropicalis (2.3% vs. 6.3%) and C. parapsilosis (7.0% vs. 4.7%). Significantly more C. krusei were detected in BTC versus NBTC (11.6% vs. 1.6%, P = 0.002). The geometric mean MIC for F, V and C between BTC and NBTC isolates was not significantly different. However, in BTC there was a significant association between duration of F exposure and the Candida spp.: >10 days of F was associated with a significant shift from susceptible Candida spp. (C. albicans, C. parapsilosis, C. tropicalis, C. famata) to non-susceptible species (C. glabrata, C. krusei, C. norvegensis). Among 21 BTC episodes occurring after £10 days of F, 19% of the isolates were non-susceptible, in contrast to 68.7% in 16 BTC episodes occurring after >10 days of F (P = 0.003).Conclusions: Breakthrough candidemia occurred more often in immunocompromised hosts. Fluconazole administered for >10 days was associated with a shift to non-susceptible Candida spp.. Length of fluconazole exposure should be taken into consideration for the choice of empirical antifungal treatment.

The maximum voltage drop in an on-chip power distribution network: analysis of square, triangular and hexagonal power pad arrangements

A mathematical model of the voltage drop which arises in on-chip power distribution networks is used to compare the maximum voltage drop in the case of different geometric arrangements of the pads supplying power to the chip. These include the square or Manhattan power pad arrangement, which currently predominates, as well as equilateral triangular and hexagonal arrangements. In agreement with the findings in the literature and with physical and SPICE models, the equilateral triangular power pad arrangement is found to minimize the maximum voltage drop. This headline finding is a consequence of relatively simple formulas for the voltage drop, with explicit error bounds, which are established using complex analysis techniques, and elliptic functions in particular.

The maximum voltage drop in an on-chip power distribution network: analysis of square, triangular and hexagonal power pad arrangements

A mathematical model of the voltage drop which arises in on-chip power distribution networks is used to compare the maximum voltage drop in the case of different geometric arrangements of the pads supplying power to the chip. These include the square or Manhattan power pad arrangement, which currently predominates, as well as equilateral triangular and hexagonal arrangements. In agreement with the findings in the literature and with physical and SPICE models, the equilateral triangular power pad arrangement is found to minimize the maximum voltage drop. This headline finding is a consequence of relatively simple formulas for the voltage drop, with explicit error bounds, which are established using complex analysis techniques, and elliptic functions in particular.

State-space model identification of a wireless THz network

We model the large scale fading of wireless THz communications links deployed in a metropolitan area taking into account reception through direct line of sight, ground or wall reflection and diffraction. The movement of the receiver in the three dimensions is modelled by an autonomous dynamic linear system in state-space whereas the geometric relations involved in the attenuation and multi-path propagation of the electric field are described by a static non-linear mapping. A subspace algorithm in conjunction with polynomial regression is used to identify a Wiener model from time-domain measurements of the field intensity.

Dynamic recurrent neural network for system identification and control

A dynamic recurrent neural network (DRNN) that can be viewed as a generalisation of the Hopfield neural network is proposed to identify and control a class of control affine systems. In this approach, the identified network is used in the context of the differential geometric control to synthesise a state feedback that cancels the nonlinear terms of the plant yielding a linear plant which can then be controlled using a standard PID controller.

Using GIS Network Analyst to Identify Suppliers for a Produce Co-op in Waterville, ME

The idea for organizing a cooperative market on Waterville Main Street was proposed by Aime Schwartz in the fall of 2008. The Co-op would entail an open market located on Main Street to provide fresh, local produce and crafts to town locals. Through shorter delivery distances and agreements with local farmers, the co-op theoretically will offer consumers lower prices on produce than can be found in conventional grocery stores, as well as an opportunity to support local agriculture. One of the tasks involved with organizing the Co-op is to source all of the produce from among the hundreds of farmers located in Maine. The purpose of this project is to show how Geographic Information System (GIS) tools can be used to help the Co-op and other businesses a) site nearby farms that carry desired produce and products, and b) determine which farms are closest to the business site. Using GIS for this purpose will make it easier and more efficient to source produce suppliers, and reduce the workload on business planners. GIS Network Analyst is a tool that provides network-based spatial analysis, and can be used in conjunction with traditional GIS technologies to determine not only the geometric distance between points, but also distance over existing networks (like roads). We used Network Analyst to find the closest produce suppliers to the Co-op for specific produce items, and compute how far they are over existing roads. This will enable business planners to source potential suppliers by distance before contacting individual farmers, allowing for more efficient use of their time and a faster planning process.

On the use of simple geometric descriptors provided by RGB-D sensors for re-identification

[EN]The re-identification problem has been commonly accomplished using appearance features based on salient points and color information. In this paper, we focus on the possibilities that simple geometric features obtained from depth images captured with RGB-D cameras may offer for the task, particularly working under severe illumination conditions. The results achieved for different sets of simple geometric features extracted in a top-view setup seem to provide useful descriptors for the re-identification task, which can be integrated in an ambient intelligent environment as part of a sensor network.

Geometric and Combinatorial Aspects of NonEquilibrium Statistical Mechanics

Non-Equilibrium Statistical Mechanics is a broad subject. Grossly speaking, it deals with systems which have not yet relaxed to an equilibrium state, or else with systems which are in a steady non-equilibrium state, or with more general situations. They are characterized by external forcing and internal fluxes, resulting in a net production of entropy which quantifies dissipation and the extent by which, by the Second Law of Thermodynamics, time-reversal invariance is broken. In this thesis we discuss some of the mathematical structures involved with generic discrete-state-space non-equilibrium systems, that we depict with networks in all analogous to electrical networks. We define suitable observables and derive their linear regime relationships, we discuss a duality between external and internal observables that reverses the role of the system and of the environment, we show that network observables serve as constraints for a derivation of the minimum entropy production principle. We dwell on deep combinatorial aspects regarding linear response determinants, which are related to spanning tree polynomials in graph theory, and we give a geometrical interpretation of observables in terms of Wilson loops of a connection and gauge degrees of freedom. We specialize the formalism to continuous-time Markov chains, we give a physical interpretation for observables in terms of locally detailed balanced rates, we prove many variants of the fluctuation theorem, and show that a well-known expression for the entropy production due to Schnakenberg descends from considerations of gauge invariance, where the gauge symmetry is related to the freedom in the choice of a prior probability distribution. As an additional topic of geometrical flavor related to continuous-time Markov chains, we discuss the Fisher-Rao geometry of nonequilibrium decay modes, showing that the Fisher matrix contains information about many aspects of non-equilibrium behavior, including non-equilibrium phase transitions and superposition of modes. We establish a sort of statistical equivalence principle and discuss the behavior of the Fisher matrix under time-reversal. To conclude, we propose that geometry and combinatorics might greatly increase our understanding of nonequilibrium phenomena.

Geometric tools in Juan de Álava's stonecutting workshop

Stonemasonry of the Gothic vault in its totality is based upon geometry of the line, whereas classic stereotomy relies on the comprehensive knowledge of the surface and the highly sophisticated sides of the voussoirs necessary for its vaults. It is obvious that this leap in the art of construction was paralleled and accompanied by an extension of the horizons of geometry. In Spain, it was made possible thanks to the centuries-old tradition of stone building begun in the most remote medieval times and to the presence of outstanding architects or stonemasons such as Juan de Álava, whose professional work surpassed the established limits and provided the art of building with new instruments.

Spatial analysis of geometric design consistency and road sight distance

Because of the high number of crashes occurring on highways, it is necessary to intensify the search for new tools that help in understanding their causes. This research explores the use of a geographic information system (GIS) for an integrated analysis, taking into account two accident-related factors: design consistency (DC) (based on vehicle speed) and available sight distance (ASD) (based on visibility). Both factors require specific GIS software add-ins, which are explained. Digital terrain models (DTMs), vehicle paths, road centerlines, a speed prediction model, and crash data are integrated in the GIS. The usefulness of this approach has been assessed through a study of more than 500 crashes. From a regularly spaced grid, the terrain (bare ground) has been modeled through a triangulated irregular network (TIN). The length of the roads analyzed is greater than 100 km. Results have shown that DC and ASD could be related to crashes in approximately 4% of cases. In order to illustrate the potential of GIS, two crashes are fully analyzed: a car rollover after running off road on the right side and a rear-end collision of two moving vehicles. Although this procedure uses two software add-ins that are available only for ArcGIS, the study gives a practical demonstration of the suitability of GIS for conducting integrated studies of road safety.

Information geometric measurements of generalisation

Neural networks can be regarded as statistical models, and can be analysed in a Bayesian framework. Generalisation is measured by the performance on independent test data drawn from the same distribution as the training data. Such performance can be quantified by the posterior average of the information divergence between the true and the model distributions. Averaging over the Bayesian posterior guarantees internal coherence; Using information divergence guarantees invariance with respect to representation. The theory generalises the least mean squares theory for linear Gaussian models to general problems of statistical estimation. The main results are: (1)~the ideal optimal estimate is always given by average over the posterior; (2)~the optimal estimate within a computational model is given by the projection of the ideal estimate to the model. This incidentally shows some currently popular methods dealing with hyperpriors are in general unnecessary and misleading. The extension of information divergence to positive normalisable measures reveals a remarkable relation between the dlt dual affine geometry of statistical manifolds and the geometry of the dual pair of Banach spaces Ld and Ldd. It therefore offers conceptual simplification to information geometry. The general conclusion on the issue of evaluating neural network learning rules and other statistical inference methods is that such evaluations are only meaningful under three assumptions: The prior P(p), describing the environment of all the problems; the divergence Dd, specifying the requirement of the task; and the model Q, specifying available computing resources.

Algorithms for Geometric Matching, Clustering, and Covering

With the popularization of GPS-enabled devices such as mobile phones, location data are becoming available at an unprecedented scale. The locations may be collected from many different sources such as vehicles moving around a city, user check-ins in social networks, and geo-tagged micro-blogging photos or messages. Besides the longitude and latitude, each location record may also have a timestamp and additional information such as the name of the location. Time-ordered sequences of these locations form trajectories, which together contain useful high-level information about people's movement patterns.

The first part of this thesis focuses on a few geometric problems motivated by the matching and clustering of trajectories. We first give a new algorithm for computing a matching between a pair of curves under existing models such as dynamic time warping (DTW). The algorithm is more efficient than standard dynamic programming algorithms both theoretically and practically. We then propose a new matching model for trajectories that avoids the drawbacks of existing models. For trajectory clustering, we present an algorithm that computes clusters of subtrajectories, which correspond to common movement patterns. We also consider trajectories of check-ins, and propose a statistical generative model, which identifies check-in clusters as well as the transition patterns between the clusters.

The second part of the thesis considers the problem of covering shortest paths in a road network, motivated by an EV charging station placement problem. More specifically, a subset of vertices in the road network are selected to place charging stations so that every shortest path contains enough charging stations and can be traveled by an EV without draining the battery. We first introduce a general technique for the geometric set cover problem. This technique leads to near-linear-time approximation algorithms, which are the state-of-the-art algorithms for this problem in either running time or approximation ratio. We then use this technique to develop a near-linear-time algorithm for this

shortest-path cover problem.