O estudo tem por temática a rede para a atenção às pessoas adoecidas pelo uso problemático de álcool e outras drogas, em particular as percepções de profissionais que participam do processo de construção da rede sobre o cuidado a álcool e outras drogas no município de Volta Redonda por meio dos objetivos específicos: Descrever o processo da construção da rede de Saúde Mental em Volta Redonda; Compreender como ocorrem as decisões na prática do cuidado aos usuários de álcool e drogas; Descrever as dificuldades das equipes/gerentes de unidades de Saúde Mental, no processo de cuidado integrado aos usuários de álcool e drogas e ao final, propor outras formas de organização para a rede de saúde mental no município de Volta Redonda. Em suma pensar a rede de Saúde Mental e fazer um retrato com objetivo de apontar as fragilidades e fortalezas no atendimento às pessoas com o uso problemático de álcool e outras drogas para ofertar proposta de construção de outra realidade. Demarcamos como percurso teórico desta pesquisa, as questões voltadas à atenção em saúde mental e os serviços de saúde e, às questões relativas ao uso problemático de álcool e outras drogas. Escolhemos a metodologia qualitativa como trajetória. Utilizamos como forma de obtenção dos dados a entrevista semi estruturada. Nossos depoentes foram pessoas que participaram do processo de construção da rede de atenção em saúde mental. Os relatos dos entrevistados revelam que a política municipal de saúde mental é uma realidade, porém existem interferências tanto na área gerencial quanto das práticas em saúde, contribuindo para o distanciamento dessa mesma política. Assim foi possível concluir que a rede de serviço é complexa, porém não existe de fato como rede. Isto implica diretamente na perda da dimensão cuidadora que é o princípio básico da integralidade. / The study it has for thematic the net for the attention the sickness people for the problematic alcohol use and other drugs, in particular the perceptions of professionals who participate of the process of construction of the net on the care to these people. We search to analyze the model of attention to the health of alcohol users and other drugs in the Volta Redonda city in return by means of the specific objectives: To describe the process of the construction of the net of Mental Health in Volta Redonda; To understand as the decisions in practical of the care to the users of alcohol and the drugs occur; To describe the difficulties of the controlling teams/of units of mental health, in the process of care integrated to the users of alcohol and drugs and to the end to consider other forms of organization for the net of mental health in the Volta Redonda city in return, in short to think the net of mental health and to make a picture with objective to point the fragilities and strong in the attendance to the people with the problematic alcohol use and other drugs to offer proposal of construction of another reality. We demarcate as theoretical passage of this research, the questions directed to the attention in mental health and the services of health and, to the relative questions to the problematic alcohol use and other drugs. We choose the qualitative methodology as trajectory, we use as form of attainment of the data the structuralized half interview. Our deponents had been the people who had participated of the process of construction of the net of attention in mental health. The stories of the interviewed ones disclose that the municipal politics of mental health is a reality, however in such a way exist interferences in the managemental area how much of practical in health, contributing for the distanciamento of this the same politics. Thus it was possible to conclude that the net of services is complex, however does not exist in fact as net. This implies directly in the loss of the care dimension that is the basic principle of the completeness.

CoordenaÃÃo de AperfeiÃoamento de Pessoal de NÃvel Superior / Este trabalho à baseado no artigo The Mean Curvature Cylindrically Bounded Submanifolds, nele abordaremos uma estimativa para a curvatura mÃdia de subvariedades completas cilindricamente limitadas. Ademais apresentaremos uma relaÃÃo entre uma estimativa da curvatura mÃdia e o fato de M ser estocasticamente incompleta. / This work is based on the article The Mean Curvature Cylindrically Bounded Submanifolds, it will discuss an estimate for the mean curvature of complete cylindrically submanifolds bounded. Furthermore we present a relationship between an estimate of the mean curvature and the fact that M is stochastically incomplete.

Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico / In this work, we study some parameters of monophonic convexity in some classes of graphs and we present our results about this subject. We prove that decide if the $m$-interval number is at most 2 and decide if the $m$-percolation time is at most 1 are NP-complete problems even on bipartite graphs. We also prove that the $m$-convexity number is as hard to approximate as the maximum clique problem, which is, $O(n^{1-varepsilon})$-unapproachable in polynomial-time, unless P=NP, for each $varepsilon>0$. Finally, we obtain polynomial time algorithms to compute the $m$-convexity number on hereditary graph classes such that the computation of the clique number is polynomial-time solvable (e.g. perfect graphs and planar graphs). / Neste trabalho, estudamos alguns parÃmetros para a convexidade monofÃnica em algumas classes de grafos e apresentamos nossos resultados acerca do assunto. Provamos que decidir se o nÃmero de $m$-intervalo à no mÃximo 2 e decidir se o tempo de $m$-percolaÃÃo à no mÃximo 1 sÃo problemas NP-completos mesmo em grafos bipartidos. TambÃm provamos que o nÃmero de $m$-convexidade à tÃo difÃcil de aproximar quanto o problema da Clique MÃxima, que Ã, $O(n^{1-varepsilon})$-inaproximÃvel em tempo polinomial, a menos que P=NP, para cada $varepsilon>0$. Finalmente, apresentamos um algoritmo de tempo polinomial para determinar o nÃmero de $m$-convexidade em classes hereditÃrias de grafos onde a computaÃÃo do tamanho da clique mÃxima à em tempo polinomial (como grafos perfeitos e grafos planares).

Submitted by Cássia Santos (cassia.bcufg@gmail.com) on 2014-11-11T12:06:48Z No. of bitstreams: 2 Tese Geiziane Tessarolo - 2014.pdf: 5275889 bytes, checksum: fb092b496eb6eae85e89c28d423c44d9 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Jaqueline Silva (jtas29@gmail.com) on 2014-11-17T15:10:55Z (GMT) No. of bitstreams: 2 Tese Geiziane Tessarolo - 2014.pdf: 5275889 bytes, checksum: fb092b496eb6eae85e89c28d423c44d9 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2014-11-17T15:10:55Z (GMT). No. of bitstreams: 2 Tese Geiziane Tessarolo - 2014.pdf: 5275889 bytes, checksum: fb092b496eb6eae85e89c28d423c44d9 (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2014-04-29 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / Aim Species Distribution Models (SDM) can be used to predict the location of unknown populations from known species occurrences. It follows that how the data used to calibrate the models are collected can have a great impact on prediction success. We evaluated the influence of different survey designs and their interaction with the modelling technique on SDM performance. Location Iberian Peninsula Methods We examine how data recorded using seven alternative survey designs (random, systematic, environmentally stratified by class and environmentally stratified using p-median, biased due to accessibility, biased by human density aggregation and biased towards protected areas) could affect SDM predictions generated with nine modelling techniques (BIOCLIM, Gower distance, Mahalanobis distance, Euclidean distance, GLM, MaxEnt, ENFA and Random Forest). We also study how sample size, species’ characteristics and modelling technique affected SDM predictive ability, using six evaluation metrics. Results Survey design has a small effect on prediction success. Characteristics of species’ ranges rank highest among the factors affecting SDM results: the species with lower relative occurrence area (ROA) are predicted better. Model predictions are also improved when sample size is large. Main conclusions The species modelled – particularly the extent of its distribution – are the largest source of influence over SDM results. The environmental coverage of the surveys is more important than the spatial structure of the calibration data. Therefore, climatic biases in the data should be identified to avoid erroneous conclusions about the geographic patterns of species distributions. / Aim Species Distribution Models (SDM) can be used to predict the location of unknown populations from known species occurrences. It follows that how the data used to calibrate the models are collected can have a great impact on prediction success. We evaluated the influence of different survey designs and their interaction with the modelling technique on SDM performance. Location Iberian Peninsula Methods We examine how data recorded using seven alternative survey designs (random, systematic, environmentally stratified by class and environmentally stratified using p-median, biased due to accessibility, biased by human density aggregation and biased towards protected areas) could affect SDM predictions generated with nine modelling techniques (BIOCLIM, Gower distance, Mahalanobis distance, Euclidean distance, GLM, MaxEnt, ENFA and Random Forest). We also study how sample size, species’ characteristics and modelling technique affected SDM predictive ability, using six evaluation metrics. Results Survey design has a small effect on prediction success. Characteristics of species’ ranges rank highest among the factors affecting SDM results: the species with lower relative occurrence area (ROA) are predicted better. Model predictions are also improved when sample size is large. Main conclusions The species modelled – particularly the extent of its distribution – are the largest source of influence over SDM results. The environmental coverage of the surveys is more important than the spatial structure of the calibration data. Therefore, climatic biases in the data should be identified to avoid erroneous conclusions about the geographic patterns of species distributions.

Cette recherche porte sur la question de l'existence de lacunes constitutionnelles. Elle vise à évaluer les représentations fondées sur l'hypothèse de telles inexistences normatives. La diversité des propriétés attachées à l'idée de lacune normative dans le champ du droit constitutionnel invite à proposer une cartographie des différents concepts qui peuvent lui être attachés. Les lacunes constitutionnelles sont à la fois des phénomènes et des instruments. Phénomènes, elles sont difficiles à connaître et impossibles à nier. Elles sont difficiles à connaître : leur appréhension est affectée à la fois par les variations dont peuvent faire l'objet les dogmes qui structurent la représentation systématique des normes juridiques et par diverses formes d'indétermination linguistique. Elles sont impossibles à nier: une évaluation des différents arguments formulés au soutien de la thèse de la nécessaire complétude des systèmes normatifs permet d'établir leurs limites. Instruments, les lacunes constitutionnelles ont une fonction critique et une fonction subversive. Utilisées par la doctrine, elles ont une fonction critique: elles semblent une unité de mesure, perfectible, sur le fondement de laquelle elle évalue les dispositions constitutionnelles. Utilisées par les interprètes authentiques, elles ont une fonction subversive: elles constituent une ressource argumentative propre à justifier le contournement de certaines dispositions constitutionnelles. / This research relates to the question of the existence of gaps in the constitution. It aims to assess the representations based on the hypothesis of these normative non-existences. The range of properties linked to the idea of normative gaps in the field of constitutional law necessitates the mapping of its various connected concepts. Constitutional gaps are both phenomena and instruments. As phenomena, they are difficult to recognise yet impossible to deny. They are difficult to recognise as their understanding is affected both by the variations in the dogma that structure the systematic re-presentation of the legal norms, and by various forms of linguistic indecision. They are impossible to deny insomuch that an assessment of the various arguments in favour of the theory of the necessary completeness of the system of norms makes it possible to establish their limits. As instruments, constitutional gaps have a critical and a subversive function. Used for doctrinal analysis, their function is critical : they appear as a unit of measure, perfectible, serving as a basis to evaluate constitutional provisions. Used by authoritative interpreters, they have a subversive function: they constitute an argumentative resource that can justify the circumvention of specific constitutional provisions.

Cette thèse apporte quatre principales contributions : une méthode d'éliminateur de phénomènes de ''chattering'' d'automates hybrides, par calcul d'une dynamique régulière équivalente à l'aide d'une convexification de Filippov ; une méthode d'accélération de la simulation de certains comportements Zénon, dits géométriques, pour certains automates hybrides ; des preuves de préservation par les méthodes ci-dessus d'une sémantique des automates hybrides à base d'analyse non-standard ; développement de trois logiciels prototypes, l'un sous la forme d'une bibliothèque Simulink, le second sous la forme d'un environnement de simulation de composants FMI, et le troisième étant une implémentation de la méthode de régularisation dans le langage de modélisation de systèmes hybrides Acumen. / This thesis deals with Zeno behavior of hybrid systems, and it has four main contributions : a method of eliminating "chattering" phenomena of hybrid automata, by computing an equivalent dynamics using a new convexification approach ; a method for accelerating the simulation of geometric-Zeno behavior in which the solution converges to a Zeno limit point according to a geometric series ; a proof of preservation by the above methods of a semantics of hybrid automata based on non-standard analysis ; a development of three prototype software, one in the form of a Simulink library, the other in the form of an FMI simulation environment, and the third being an implementation of the regularization method in the Modeling and simulation tool Acumen.

Le ZX-Calculus est un langage graphique puissant et intuitif, issu de la théorie des catégories, et qui permet de raisonner et calculer en quantique. Les évolutions quantiques sont vues dans ce formalisme comme des graphes ouverts, ou diagrammes, qui peuvent être transformés localement selon un ensemble d’axiomes qui préservent le résultat du calcul. Un aspect des plus importants du langage est sa complétude : Étant donnés deux diagrammes qui représentent la même évolution quantique, puis-je transformer l’un en l’autre en utilisant seulement les règles graphiques permises par le langage ? Si c’est le cas, cela veut dire que le langage graphique capture entièrement la mécanique quantique. Le langage est connu comme étant complet pour une sous-classe (ou fragment) particulière d’évolutions quantiques, appelée Clifford. Malheureusement, celle-ci n’est pas universelle : on ne peut pas représenter, ni même approcher, certaines évolutions. Dans cette thèse, nous proposons d’élargir l’ensemble d’axiomes pour obtenir la complétude pour des fragments plus grands du langage, qui en particulier sont approximativement universels, voire universels. Pour ce faire, dans un premier temps nous utilisons la complétude d’un autre langage graphique et transportons ce résultat au ZX-Calculus. Afin de simplifier cette fastidieuse étape, nous introduisons un langage intermédiaire, intéressant en lui-même car il capture un fragment particulier mais universel de la mécanique quantique : Toffoli-Hadamard. Nous définissons ensuite la notion de diagramme linéaire, qui permet d’obtenir une preuve uniforme pour certains ensembles d’équations. Nous définissons également la notion de décomposition d’un diagramme en valeurs singuliaires, ce qui nous permet de nous épargner un grand nombre de calculs. Dans un second temps, nous définissons une forme normale qui a le mérite d’exister pour une infinité de fragments du langage, ainsi que pour le langage lui-même, sans restriction. Grâce à cela, nous reprouvons les résultats de complétude précédents, mais cette fois sans utiliser de langage tiers, et nous en dérivons de nouveaux, pour d’autres fragments. Les états contrôlés, utilisés pour la définition de forme normale, s’avèrent en outre utiles pour réaliser des opérations non-triviales telles que la somme, le produit terme-à-terme, ou la concaténation. / The ZX-Calculus is a powerful and intuitive graphical language, based on category theory, that allows for quantum reasoning and computing. Quantum evolutions are seen in this formalism as open graphs, or diagrams, that can be transformed locally according to a set of axioms that preserve the result of the computation. One of the most important aspects of language is its completeness: Given two diagrams that represent the same quantum evolution, can I transform one into the other using only the graphical rules allowed by the language? If this is the case, it means that the graphical language captures quantum mechanics entirely. The language is known to be complete for a particular subclass (or fragment) of quantum evolutions, called Clifford. Unfortunately, this one is not universal: we cannot represent, or even approach, certain quantum evolutions. In this thesis, we propose to extend the set of axioms to obtain completeness for larger fragments of the language, which in particular are approximately universal, or even universal. To do this, we first use the completeness of another graphical language and transport this result to the ZX-Calculus. In order to simplify this tedious step, we introduce an intermediate language, interesting in itself as it captures a particular but universal fragment of quantum mechanics: Toffoli-Hadamard. We then define the notion of a linear diagram, which provides a uniform proof for some sets of equations. We also define the notion of singular value decomposition of a diagram, which allows us to avoid a large number of calculations. In a second step, we define a normal form that exists for an infinite number of fragments of the language, as well as for the language itself, without restriction. Thanks to this, we reprove the previous completeness results, but this time without using any third party language, and we derive new ones for other fragments. The controlled states, used for the definition of the normal form, are also useful for performing non-trivial operations such as sum, term-to-term product, or concatenation.

This thesis examines so called folding neural networks as a mechanism for machine learning. Folding networks form a generalization of partial recurrent neural networks such that they are able to deal with tree structured inputs instead of simple linear lists. In particular, they can handle classical formulas - they were proposed originally for this purpose. After a short explanation of the neural architecture we show that folding networks are well suited as a learning mechanism in principle. This includes three parts: the proof of their universal approximation ability, the aspect of information theoretical learnability, and the examination of the complexity of training. Approximation ability: It is shown that any measurable function can be approximated in probability. Explicit bounds on the number of neurons result if only a finite number of points is dealt with. These bounds are new results in the case of simple recurrent networks, too. Several restrictions occur if a function is to be approximated in the maximum norm. Afterwards, we consider briefly the topic of computability. It is shown that a sigmoidal recurrent neural network can compute any mapping in exponential time. However, if the computation is subject to noise almost the capability of tree automata arises. Information theoretical learnability: This part contains several contributions to distribution dependent learnability: The notation of PAC and PUAC learnability, consistent PAC/ PUAC learnability, and scale sensitive versions are considered. We find equivalent characterizations of these terms and examine their respective relation answering in particular an open question posed by Vidyasagar. It is shown at which level learnability only because of an encoding trick is possible. Two approaches from the literature which can guarantee distribution dependent learnability if the VC dimension of the concept class is infinite are generalized to function classes: The function class is stratified according to the input space or according to a so-called luckiness function which depends on the output of the learning algorithm and the concrete training data. Afterwards, the VC, pseudo-, and fat shattering dimension of folding networks are estimated: We improve some lower bounds for recurrent networks and derive new lower bounds for the pseudodimension and lower and upper bounds for folding networks in general. As a consequence, folding architectures are not distribution independent learnable. Distribution dependent learnability can be guaranteed. Explicit bounds on the number of examples which guarantee valid generalization can be derived using the two approaches mentioned above. We examine in which cases these bounds are polynomial. Furthermore, we construct an explicit example for a learning scenario where an exponential number of examples is necessary. Complexity: It is shown that training a fixed folding architecture with perceptron activation function is polynomial. Afterwards, a decision problem, the so-called loading problem, which is correlated to neural network training is examined. For standard multilayer feed-forward networks the following situations turn out to be NP-hard: Concerning the perceptron activation function, a classical result from the literature, the NP-hardness for varying input dimension, is generalized to arbitrary multilayer architectures. Additionally, NP-hardness can be found if the input dimension is fixed but the number of neurons may vary in at least two hidden layers. Furthermore, the NP-hardness is examined if the number of patterns and number of hidden neurons are correlated. We finish with a generalization of the classical NP result as mentioned above to the sigmoidal activation function which is used in practical applications.

Despite technological advances in public health informatics, the evaluation of infectious disease surveillance systems data remains incomplete. In this study, a thorough evaluation was performed of the West Virginia Electronic Disease Surveillance System (WVEDSS, 2007-2010) and the West Virginia Electronic Disease Surveillance System NationalEDSS -Based System (WVEDSS-NBS; March 2012 - March 2014) for Category II infectious diseases in West Virginia. The purpose was to identify key areas in the surveillance system process from disease diagnosis to disease prevention that need improvement. Grounded in the diffusion of innovation theory, a quasi-experimental, interrupted, time-series design was used to evaluate the 2 data sets. Research questions examined differences in mean reporting time, the 24-hour standard, and comparison of complete fields (DOB, gender etc.) of the data sets using independent samples t tests. The study found (a) that the mean reporting times were shorter for WVEDSS compared to WVEDSS-NBS (p < .05) for all vaccine-preventable infectious diseases (VPID) in Category II except for mumps; (b) that the 24-hour standard was not met for WVEDSS compared to WVEDSS-NBS (p < .05) for all VPID in Category II except for mumps, and (c) that most fields were complete for WVEDSS compared to WVEDSS-NBS (p < .05) for all VPID in Category II except for meningococcal disease. Healthcare professionals in the state can use the results of this research to improve the system attributes of timeliness and completeness. Implications for positive social change included improved access to public health data to better understand health disparities, which, in turn could reduce morbidity and mortality within the population.

Mathematical definitions provide a precise, unambiguous way to formulate concepts. They also provide a common language between disciplines. Thus, they are the basis for a well-founded scientific discussion. In addition, mathematical definitions allow for deeper insights into the defined subject based on mathematical theorems that are incontrovertible under the given definition. Besides their value in mathematics, mathematical definitions are indispensable in other sciences like physics, chemistry, and computer science. In computer science, they help to derive the expected behavior of a computer program and provide guidance for the design and testing of software. Therefore, mathematical definitions can be used to design and implement advanced algorithms. One class of widely used algorithms in computer science is the class of particle-based algorithms, also known as particle methods. Particle methods can solve complex problems in various fields, such as fluid dynamics, plasma physics, or granular flows, using diverse simulation methods, including Discrete Element Methods (DEM), Molecular Dynamics (MD), Reproducing Kernel Particle Methods (RKPM), Particle Strength Exchange (PSE), and Smoothed Particle Hydrodynamics (SPH). Despite the increasing use of particle methods driven by improved computing performance, the relation between these algorithms remains formally unclear. In particular, particle methods lack a unifying mathematical definition and precisely defined terminology. This prevents the determination of whether an algorithm belongs to the class and what distinguishes the class. Here we present a rigorous mathematical definition for determining particle methods and demonstrate its importance by applying it to several canonical algorithms and those not previously recognized as particle methods. Furthermore, we base proofs of theorems about parallelizability and computational power on it and use it to develop scientific computing software. Our definition unified, for the first time, the so far loosely connected notion of particle methods. Thus, it marks the necessary starting point for a broad range of joint formal investigations and applications across fields.:1 Introduction 1.1 The Role of Mathematical Definitions 1.2 Particle Methods 1.3 Scope and Contributions of this Thesis 2 Terminology and Notation 3 A Formal Definition of Particle Methods 3.1 Introduction 3.2 Definition of Particle Methods 3.2.1 Particle Method Algorithm 3.2.2 Particle Method Instance 3.2.3 Particle State Transition Function 3.3 Explanation of the Definition of Particle Methods 3.3.1 Illustrative Example 3.3.2 Explanation of the Particle Method Algorithm 3.3.3 Explanation of the Particle Method Instance 3.3.4 Explanation of the State Transition Function 3.4 Conclusion 4 Algorithms as Particle Methods 4.1 Introduction 4.2 Perfectly Elastic Collision in Arbitrary Dimensions 4.3 Particle Strength Exchange 4.4 Smoothed Particle Hydrodynamics 4.5 Lennard-Jones Molecular Dynamics 4.6 Triangulation refinement 4.7 Conway's Game of Life 4.8 Gaussian Elimination 4.9 Conclusion 5 Parallelizability of Particle Methods 5.1 Introduction 5.2 Particle Methods on Shared Memory Systems 5.2.1 Parallelization Scheme 5.2.2 Lemmata 5.2.3 Parallelizability 5.2.4 Time Complexity 5.2.5 Application 5.3 Particle Methods on Distributed Memory Systems 5.3.1 Parallelization Scheme 5.3.2 Lemmata 5.3.3 Parallelizability 5.3.4 Bounds on Time Complexity and Parallel Scalability 5.4 Conclusion 6 Turing Powerfulness and Halting Decidability 6.1 Introduction 6.2 Turing Machine 6.3 Turing Powerfulness of Particle Methods Under a First Set of Constraints 6.4 Turing Powerfulness of Particle Methods Under a Second Set of Constraints 6.5 Halting Decidability of Particle Methods 6.6 Conclusion 7 Particle Methods as a Basis for Scientific Software Engineering 7.1 Introduction 7.2 Design of the Prototype 7.3 Applications, Comparisons, Convergence Study, and Run-time Evaluations 7.4 Conclusion 8 Results, Discussion, Outlook, and Conclusion 8.1 Problem 8.2 Results 8.3 Discussion 8.4 Outlook 8.5 Conclusion