Dissertations / Theses on the topic 'Entropy map'

This thesis examines the utility of mathematical complexity measures for the analysis of stratospheric dynamics. Through theoretical considerations and tests with artificial data sets, e.g., the iteration of the logistic map, suitable parameters are determined for the application of the statistical entropy measures sample entropy (SE) and Rényi entropy (RE) to methane (a long-lived stratospheric tracer) data from simulations of the SOCOL chemistry-climate model. The SE is shown to be useful for quantifying the variability of recurring patterns in a time series and is able to identify tropical patterns similar to those reported by previous studies of the ``tropical pipe'' region. However, the SE is found to be unsuitable for use in polar regions, due to the non-stationarity of the methane data at extra-tropical latitudes. It is concluded that the SE cannot be used to analyse climate complexity on a global scale. The focus is turned to the RE, which is a complexity measure of probability distribution functions (PDFs). Using the second order RE and a normalisation factor, zonal PDFs of ten consecutive days of methane data are created with a Bayesian optimal binning technique. From these, the RE is calculated for every day (moving 10-day window). The results indicate that the RE is a promising tool for identifying stratospheric mixing barriers. In Southern Hemisphere winter and early spring, RE produces patterns similar to those found in other studies of stratospheric mixing. High values of RE are found to be indicative of the strong fluctuations in tracer distributions associated with relatively unmixed air in general, and with gradients in the vicinity of mixing barriers, in particular. Lower values suggest more thoroughly mixed air masses. The analysis is extended to eleven years of model data. Realistic inter-annual variability of some of the RE structures is observed, particularly in the Southern Hemisphere. By calculating a climatological mean of the RE for this period, additional mixing patterns are identified in the Northern Hemisphere. The validity of the RE analysis and its interpretation is underlined by showing that qualitatively similar patterns can be seen when using observational satellite data of a different tracer. Compared to previous techniques, the RE has the advantage that it requires significantly less computational effort, as it can be used to derive dynamical information from model or measurement tracer data without relying on any additional input such as wind fields. The results presented in this thesis strongly suggest that the RE is a useful new metric for analysing stratospheric mixing and its variability from climate model data. Furthermore, it is shown that the RE measure is very robust with respect to data gaps, which makes it ideal for application to observations. Hence, using the RE for comparing observations of tracer distributions with those from model simulations potentially presents a novel approach for analysing mixing in the stratosphere.

Submitted by Jordan (jordanbiblio@gmail.com) on 2017-03-28T12:16:26Z No. of bitstreams: 1 DISS_2015_Benedito Carlos de Jesus.pdf: 4720583 bytes, checksum: c95f22d20d611f53829e3bab5a6b93f2 (MD5)
Approved for entry into archive by Jordan (jordanbiblio@gmail.com) on 2017-03-28T15:53:40Z (GMT) No. of bitstreams: 1 DISS_2015_Benedito Carlos de Jesus.pdf: 4720583 bytes, checksum: c95f22d20d611f53829e3bab5a6b93f2 (MD5)
Made available in DSpace on 2017-03-28T15:53:40Z (GMT). No. of bitstreams: 1 DISS_2015_Benedito Carlos de Jesus.pdf: 4720583 bytes, checksum: c95f22d20d611f53829e3bab5a6b93f2 (MD5) Previous issue date: 2015-07-01
O presente trabalho apresenta os resultados de um estudo feito junto aos alunos de Licenciatura Plena e Bacharelado em Ciências Biológicas da UNEMAT – UNIVERSIDADE ESTADUAL DE MATO GROSSO, situada no município de Cáceres-MT. A pesquisa foi realizada na turma 2014/2-CAC690 de período integral com 27 alunos no segundo semestre de 2014, sendo utilizada a tríade do contexto da pesquisa: ato de ensinar – contexto de sala de aula – avaliação. Nesta tríade sugere que o professor no ato de ensinar, utilize mapas conceituais como ferramenta de ensino para negociar significados. E dentro do contexto da sala de aula, investigar quais os conhecimentos prévios que os alunos de biologia têm sobre entropia e através do mapa conceitual construído pelos alunos avaliar a evolução dos conceitos estudados. A estratégia a ser desenvolvida para a construção dos mapas conceituais envolveu a metodologia qualitativa, onde o significado que os alunos dão aos conceitos de entropia e a vida são focos de atenção especial do pesquisador, porque isso significava que nas três etapas especificas que fossem construídos os mapas conceituais pudessem averiguar se os alunos hierarquizaram, diferenciaram os conceitos principais dos secundários, relacionaram os conceitos de entropia com a termodinâmica e como eles integrariam os conceitos de entropia, isto é, como eles reconciliam integrativamente esse conceito. Ao todo foram seis etapas (aulas), sendo a primeira para aplicação do pré-teste, a segunda para orientar na construção do mapa conceitual, a terceira e quarta, quinta e sexta para a construção dos mapas conceituais. As análises dos mapas conceituais serviram para avaliar se houve a aprendizagem significativa.
The present work presents the results of a study done by graduate students and Bachelor of biological sciences UNEMAT-UNIVERSIDADE ESTADUAL DE MATO GROSSO, in the municipality of Cáceres-MT. The survey was conducted in the class 2014/2-full-time CAC690 with 27 students in the second half of 2014, being used the search context triad: Act of teaching – classroom context – assessment. In this triad suggests that the teacher in the Act of teaching, use conceptual maps as teaching tool to negotiate meanings. And within the context of the classroom, into which the previous knowledge that biology students have about entropy and through the concept map constructed by the students evaluate the evolution of the concepts studied. The strategy to be developed for the construction of concept maps involved the qualitative methodology, where the meaning that students give to the concepts of entropy and life are foci of attention and Special attention of the researcher, because this meant that in three specific steps that were built the conceptual maps could ascertain whether students rank, differentiated the main concepts of the secondary, related the concepts of entropy in thermodynamics and how they integrated the concepts of entropy, i.e. how they reconcile this concept integrativamente. Altogether there were seven steps (classes), being the first and the last to implement the tests, for subsequent comparison of the results. The results served to analyse and assess whether what was examined proved to be efficient and significant learning was reached.

The human vision system is generally recognized as being superior to all known artificial vision systems. Visual attention, among many processes that are related to human vision, is responsible for identifying relevant regions in a scene for further processing. In most cases, analyzing an entire scene is unnecessary and inevitably time consuming. Hence considering visual attention might be advantageous. A subfield of computer vision where this particular functionality is computationally emulated has been shown to retain high potential in solving real world vision problems effectively. In this monograph, elements of visual attention are explored and algorithms are proposed that exploit such elements in order to enhance image understanding capabilities. Satellite images are given special attention due to their practical relevance, inherent complexity in terms of image contents, and their resolution. Processing such large-size images using visual attention can be very helpful since one can first identify relevant regions and deploy further detailed analysis in those regions only. Bottom-up features, which are directly derived from the scene contents, are at the core of visual attention and help identify salient image regions. In the literature, the use of intensity, orientation and color as dominant features to compute bottom-up attention is ubiquitous. The effects of incorporating an entropy feature on top of the above mentioned ones are also studied. This investigation demonstrates that such integration makes visual attention more sensitive to fine details and hence retains the potential to be exploited in a suitable context. One interesting application of bottom-up attention, which is also examined in this work, is that of image segmentation. Since low salient regions generally correspond to homogenously textured regions in the input image; a model can therefore be learned from a homogenous region and used to group similar textures existing in other image regions. Experimentation demonstrates that the proposed method produces realistic segmentation on satellite images. Top-down attention, on the other hand, is influenced by the observer’s current states such as knowledge, goal, and expectation. It can be exploited to locate target objects depending on various features, and increases search or recognition efficiency by concentrating on the relevant image regions only. This technique is very helpful in processing large images such as satellite images. A novel algorithm for computing top-down attention is proposed which is able to learn and quantify important bottom-up features from a set of training images and enhances such features in a test image in order to localize objects having similar features. An object recognition technique is then deployed that extracts potential target objects from the computed top-down attention map and attempts to recognize them. An object descriptor is formed based on physical appearance and uses both texture and shape information. This combination is shown to be especially useful in the object recognition phase. The proposed texture descriptor is based on Legendre moments computed on local binary patterns, while shape is described using Hu moment invariants. Several tools and techniques such as different types of moments of functions, and combinations of different measures have been applied for the purpose of experimentations. The developed algorithms are generalized, efficient and effective, and have the potential to be deployed for real world problems. A dedicated software testing platform has been designed to facilitate the manipulation of satellite images and support a modular and flexible implementation of computational methods, including various components of visual attention models.

Made available in DSpace on 2017-07-21T19:26:03Z (GMT). No. of bitstreams: 1 Romeu Miqueias.pdf: 9797233 bytes, checksum: d4b08f71cb22063247e9bb495366dd55 (MD5) Previous issue date: 2013-01-31
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Synchronization is a dynamical behavior exhibited by a wide range of systems. Neurons, firefly and Josephson junctions are examples of these systems. It is defined as an adjustment of rhythms of oscillating objects due to weak interaction between them, and it is studied using different mathematical models including the coupled map lattices (CMLs). In CML the synchronization corresponds to process in which all state variables become identical at the same instant. Usually we study the CML synchronization by calculating the conditional Lyapunov exponents. However, if the coupling or network topology is time-varying, this exponents are not readily determined. In this work we propose new quantities to study the synchronization in these CMLs. These quantities are defined as weighted averages over all possible topologies and, if the topology is constant, they are equivalent to the usual Lyapunov exponents. We find an analytical expression for the effective quantities when the topology is invariant over translation on the network and demonstrate that an ensemble of short time observations can be used to predict the long-term behavior of the lattice. Also we point that, if network has constant and homogeneous structure, the effective quantities correspond to the projection on the eigenvectors associated with this structure. We show the availability of effective quantities using them to build a lattice with constant topology that exhibits the same synchronization critical properties of the lattice with time-varying topology. Finally, we present a cryptosystem for communication systems based on two replica synchronized networks whose elements are not synchronous. We investigate it as to operation time, robustness and security against intruders. Our results suggest that it is safe and efficient for a wide range of parameters.
A sincronização é um comportamento dinâmico exibido por uma ampla variedade de sistemas naturais tais como neurônios, vaga-lumes e junções Josephson. Ela é definida como um ajuste de ritmos de objetos oscilantes devido a uma fraca interação entre eles, e é estudada usando diferentes modelos matemáticos tais como as redes de mapas acoplados (RMAs). Em uma RMA, o processo de sincronização representa uma evolução conjunta entre todas variáveis de estados. Este processo é geralmente investigado com base nos expoentes de Lyapunov condicionais. No entanto, para redes com topologia variável tais expoentes não são facilmente determinados. Neste trabalho propomos novas quantidades para estudar a sincronização nestas redes. Estas quantidades são definidas como médias ponderadas sobre todas as topologias possíveis e, no caso em que a topologia é constante, equivalem aos expoentes de Lyapunov usuais. Encontramos uma expressão analítica para as quantidades efetivas para o caso em que a topologia é invariante sobre translação na rede e demonstramos que um conjunto de observações sobre um intervalo curto de tempo pode ser usado para predizer o comportamento da rede a longo prazo. Também verificamos que, se a rede possui uma estrutura constante e homogênea, as quantidades efetivas podem ser obtidas considerando a projeção sobre os autovetores associados a esta estrutura. Mostramos a eficácia das quantidades efetivas usando-as para construir uma rede com topologia constante que exibe as mesmas propriedades de sincronização da rede com topologia variável. Por último apresentamos um criptossistema para sistemas de comunicação que é baseado em duas réplicas de redes sincronizadas cujos elementos são não-síncronos. Investigamos este sistema quanto ao tempo de operação, a robustez e a segurança contra intrusos. Nossos resultados sugerem que ele é seguro e eficiente para uma amplo intervalo de parâmetros.

La biodiversité marine et terrestre subit de multiples perturbations dues à la pression anthropique ainsi qu'au changement global, qui peuvent affecter la diversité spécifique et le fonctionnement des écosystèmes associés. Dans ce contexte, la cartographie des indices de diversité permet d'analyser les variations spatio-temporelles de la diversité spécifique, et d'identifier des régions à caractère prioritaire dans un cadre de gestion. Le premier objectif de cette thèse est d'évaluer la pertinence des deux approches disponibles pour la cartographie des indices de diversité, ici considérée sans la prise en compte de variables explicatives dans un modèle pour l'interpolation spatiale : (i) l'approche indirecte qui consiste à interpoler individuellement chaque espèce des assemblages échantillonnés, puis à calculer a posteriori l'indice de diversité sur l'ensemble de la zone étudiée, (ii) l'approche directe qui consiste à calculer a priori l'indice au niveau des assemblages, puis à l'interpoler sur l'ensemble de la zone d'étude. Nous montrons que les deux approches présentent des limites importantes pour cartographier rigoureusement les indices de diversité. En effet, d'une part l'approche indirecte est difficile à mettre en œuvre en pratique due à la forte proportion des espèces rares dans le milieu naturel (données zéro inflatées). D'autre part, le non-respect de la propriété mathématique de l'addivitié des indices rend l'approche directe non pertinente pour l'interpolation. Le second objectif de la thèse est d'étudier la variabilité spatio-temporelle de la diversité des assemblages de poissons démersaux en mer Méditerranée, région présentant un grand intérêt scientifique, de par sa forte diversité ainsi que des conditions environnementales et anthropiques contrastées qui s'y exercent. Une approche multi-composante et multi-échelle a été adoptée pour analyser un jeu de données constitué de 19 886 traits de chalut réalisés entre 10 à 800 m de profondeur dans le cadre des campagnes scientifiques annuelles MEDITS effectuées depuis 1994 dans la zone nord Méditerranéenne ainsi qu'en Algérie plus récemment. Nous montrons que la diversité des assemblages de poissons démersaux ne suit pas le gradient longitudinal traditionnellement attendu et/ou observé pour d'autres groupes faunistiques pour aucun des indices et échelles analysés. Néanmoins, nous avons identifié des hotspots de richesse spécifique à Malte, dans la zone Ibérique, et les mers Egée et Ionienne. En revanche, l'équitabilité, les divergences taxonomique, phylogénétique et fonctionnelle n'ont pas présentés de tels hotspots, mais se sont révélées spatialement hétérogènes au sein de chaque région. D'autre part toutes les composantes de la diversité étudiées sont stables au cours des deux dernières décennies. Ce travail apporte des éléments de connaissance essentiels dans cette zone pour la cartographie d'indices de diversité par de futurs modèles incluant des variables explicatives abiotiques et/ou biotiques qui, compte tenu de ce qui a été souligné par le premier volet de la thèse, constituerait une alternative pour l'interpolation spatiale des indices. Toutefois, des efforts restent nécessaires pour identifier et acquérir des données pertinentes à l'échelle de la zone d'étude sur les facteurs biotiques et abiotiques susceptibles d'influencer la distribution de la diversité des assemblages demersaux, par exemple, les interactions entre espèces, l'effort de pêche à partir des données Vessel Monitoring System. Dans l'ensemble, les résultats de cette thèse confirment la nécessité d'utiliser des indices complémentaires lors de l'élaboration des stratégies de suivi de la diversité et la localisation de zones prioritaires de protection, et a permis d'identifier des indices proxies pour suivre les poissons démersaux en Méditerranée. D'autre part, elle met en évidence les limites et le besoin d'avancées méthodologiques pour une cartographie pertinente des indices de diversité
Increasing human pressures and global environmental change may severely affect species diversity and ecosystems? functioning. In this context, mapping diversity indices allows monitoring spatial and/or temporal variation in diversity, and helps identifying areas for effective conservation planning. The first objective of this thesis is to evaluate the relevance of using the two available diversity indices' mapping approaches without explanatory variables: i) the indirect approach interpolating each individual species distribution over the studied area, then computing a posteriori the diversity index, (ii) the community-level approach interpolating directly a diversity index over the studied area. We show that mapping index by interpolation methods used in the frame of direct or indirect approach suffers from two main limitations. Firstly, diversity indices are not additive making the direct approach irrelevant to use the direct approach. Secondly, many species in natural communities are scarce (i.e. zero inflated data) making difficult to apply the indirect approach. The second objective of this thesis is to study large spatio-temporal diversity of demersal fish assemblages in the Mediterranean Sea, an area of a particular scientific interest, both for its high diversity and direct human pressure in this region. A multi-component and multi-scale approach was applied to analyze a dataset of 19,886 hauls from 10 to 800 m depth performed annually during the last two decades by standardized scientific bottom trawl field surveys across the Mediterranean Sea, within the MEDITS program. We show that the diversity of demersal fish assemblages sampled by trawl do not follow the observed or expected decreasing longitudinal/latitudinal diversity gradients, for any of the indices and spatial scales analysed. However, we identified hotspots of species richness at both local and regional scales in the Iberian region, Malta, the Eastern Ionian and Aegean seas. In contrast, evenness as well as taxonomic, phylogenetic and functional divergences did not show regional hotspots. All studied diversity components remained stable over the last two decades. Finally, our analysis represents an essential step towards future studies focused on the drivers shaping demersal fish communities? diversity in the Mediterranean Sea using models that will include biotic and/or abiotic explanatory variables to map diversity indices. However, it will require identification and availability of accurate data of these variables at the scale of the Mediterranean Sea (e.g. species interactions, fishing effort from Vessel Monitoring System (VMS) data). Overall, our results highlight the need of using complementary diversity indices through different spatial scales when developing monitoring strategies and defining protected areas. They also identify suitable proxies to monitor demersal fish communities in the Mediterranean Sea. Moreover, this work underlines the main limits of approaches for mapping diversity indices, and the need of further developments in this field

Les caméras sont devenues de plus en plus communes dans les véhicules, les smartphones et les systèmes d'aide à la conduite ADAS (Advanced Driver Assistance Systèmes). Les domaines d'application de ces caméras dans le monde des systèmes intelligents de transport deviennent de plus en plus variés : la détection des piétons, les avertissements de franchissement de ligne, la navigation... La navigation basée sur la vision a atteint une certaine maturité durant ces dernières années grâce à l'utilisation de technologies avancées. Les systèmes de navigation basée sur la vision ont le considérable avantage de pouvoir utiliser directement les informations visuelles présentes dans l'environnement, sans devoir adapter le moindre élément de l'infrastructure. De plus, contrairement aux systèmes utilisant le GPS, ils peuvent être utilisés à l'extérieur ainsi qu'à l'intérieur des locaux et des bâtiments sans aucune perte de précision. C'est pour ces raisons que les systèmes basés sur la vision sont une bonne option car ils fournissent des informations très riches et précises sur l'environnement, qui peuvent être utilisées pour la navigation. Un axe important de recherche porte actuellement sur la cartographie qui représente une étape indispensable pour la navigation. Cette étape engendre une problématique de la gestion de la mémoire assez conséquente requise par ces systèmes en raison de la quantité d'informations importante collectées par chaque capteur. En effet, l'espace mémoire nécessaire pour accueillir la carte d'une petite ville se mesure en dizaines de GO voire des milliers lorsque l'on souhaite couvrir des espaces de grandes dimensions. Cela rend impossible son intégration dans un système mobile tel que les smartphones, les véhicules, les vélos ou les robots. Le défi serait donc de développer de nouveaux algorithmes permettant de diminuer au maximum la taille de la mémoire nécessaire pour faire fonctionner ce système de localisation par vision. C'est dans ce contexte que se situe notre projet qui consiste à développer un nouveau système capable de résumer une carte 3D qui contient des informations visuelles collectées par plusieurs capteurs. Le résumé sera un ensemble des vues sphériques permettant de garder le même niveau de visibilité dans toutes les directions. Cela permettrait aussi de garantir, à moindre coût, un bon niveau de précision et de rapidité lors de la navigation. La carte résumant l'environnement sera constituée d'un ensemble d'informations géométriques, photométriques et sémantiques
Cameras have become increasingly common in vehicles, smart phones, and advanced driver assistance systems. The areas of application of these cameras in the world of intelligent transportation systems are becoming more and more varied : pedestrian detection, line crossing detection, navigation ... Vision-based navigation has reached a certain maturity in recent years through the use of advanced technologies. Vision-based navigation systems have the considerable advantage of being able to directly use the visual information already existing in the environment without having to adapt any element of the infrastructure. In addition, unlike systems using GPS, they can be used outdoors and indoors without any loss of precision. This guarantees the superiority of these systems based on computer vision. A major area of {research currently focuses on mapping, which represents an essential step for navigation. This step generates a problem of memory management quite substantial required by these systems because of the huge amount of information collected by each sensor. Indeed, the memory space required to accommodate the map of a small city is measured in tens of GB or even thousands when one wants to cover large spaces. This makes impossible to integrate this map into a mobile system such as smartphones , cameras embedded in vehicles or robots. The challenge would be to develop new algorithms to minimize the size of the memory needed to operate this navigation system using only computer vision. It's in this context that our project consists in developing a new system able to summarize a3D map resulting from the visual information collected by several sensors. The summary will be a set of spherical views allow to keep the same level of visibility in all directions. It would also guarantee, at a lower cost, a good level of precision and speed during navigation. The summary map of the environment will contain geometric, photometric and semantic information

Image registration is a fundamental problem that can be found in a diverse range of fields within the research community. It is used in areas such as engineering, science, medicine, robotics, computer vision and image processing, which often require the process of developing a spatial mapping between sets of data. Registration plays a crucial role in the medical imaging field where continual advances in imaging modalities, including MRI, CT and PET, allow the generation of 3D images that explicitly outline detailed in vivo information of not only human anatomy, but also human function. Mutual Information (MI) is a popular entropy-based similarity measure which has found use in a large number of image registration applications. Stemming from information theory, this measure generally outperforms most other intensity-based measures in multimodal applications as it does not assume the existence of any specific relationship between image intensities. It only assumes a statistical dependence. The basic concept behind any approach using MI is to find a transformation, which when applied to an image, will maximise the MI between two images. This thesis presents research using MI in three major topics encompassed by the computer vision and medical imaging field: rigid image registration, stereo vision, and non-rigid image registration. In the rigid domain, a novel gradient-based registration algorithm (MIGH) is proposed that uses Parzen windows to estimate image density functions and Gauss-Hermite quadrature to estimate the image entropies. The use of this quadrature technique provides an effective and efficient way of estimating entropy while bypassing the need to draw a second sample of image intensities (a procedure required in previous Parzen-based MI registration approaches). It is possible to achieve identical results with the MIGH algorithm when compared to current state of the art MI-based techniques. These results are achieved using half the previously required sample sizes, thus doubling the statistical power of the registration algorithm. Furthermore, the MIGH technique improves algorithm complexity by up to an order of N, where N represents the number of samples extracted from the images. In stereo vision, a popular passive method of depth perception, new extensions have been pro- posed in order to increase the robustness of MI-based stereo matching algorithms. Firstly, prior probabilities are incorporated into the MI measure to considerably increase the statistical power of the matching windows. The statistical power, directly related to the number of samples, can become too low when small matching windows are utilised. These priors, which are calculated from the global joint histogram, are tuned to a two level hierarchical approach. A 2D match surface, in which the match score is computed for every possible combination of template and matching windows, is also utilised to enforce left-right consistency and uniqueness constraints. These additions to MI-based stereo matching significantly enhance the algorithms ability to detect correct matches while decreasing computation time and improving the accuracy, particularly when matching across multi-spectra stereo pairs. MI has also recently found use in the non-rigid domain due to a need to compute multimodal non-rigid transformations. The viscous fluid algorithm is perhaps the best method for re- covering large local mis-registrations between two images. However, this model can only be used on images from the same modality as it assumes similar intensity values between images. Consequently, a hybrid MI-Fluid algorithm is proposed to compute a multimodal non-rigid registration technique. MI is incorporated via the use of a block matching procedure to generate a sparse deformation field which drives the viscous fluid algorithm, This algorithm is also compared to two other popular local registration techniques, namely Gaussian convolution and the thin-plate spline warp, and is shown to produce comparable results. An improved block matching procedure is also proposed whereby a Reversible Jump Markov Chain Monte Carlo (RJMCMC) sampler is used to optimally locate grid points of interest. These grid points have a larger concentration in regions of high information and a lower concentration in regions of small information. Previous methods utilise only a uniform distribution of grid points throughout the image.

L'analyse de séries temporelles biomédicales chaotiques tirées de systèmes dynamiques non-linéaires est toujours un challenge difficile à relever puisque dans certains cas bien spécifiques les techniques existantes basées sur les multi-fractales, les entropies et les graphes de récurrence échouent. Pour contourner les limitations des invariants précédents, de nouveaux descripteurs peuvent être proposés. Dans ce travail de recherche nos contributions ont porté à la fois sur l’amélioration d’indicateurs multifractaux (basés sur une fonction de structure) et entropiques (approchées) mais aussi sur des indicateurs de récurrences (non biaisés). Ces différents indicateurs ont été développés avec pour objectif majeur d’améliorer la discrimination entre des signaux de complexité différente ou d’améliorer la détection de transitions ou de changements de régime du système étudié. Ces changements agissant directement sur l’irrégularité du signal, des mouvements browniens fractionnaires et des signaux tirés du système du Lorenz ont été testés. Ces nouveaux descripteurs ont aussi été validés pour discriminer des fœtus en souffrance de fœtus sains durant le troisième trimestre de grossesse. Des mesures statistiques telles que l’erreur relative, l’écart type, la spécificité, la sensibilité ou la précision ont été utilisées pour évaluer les performances de la détection ou de la classification. Le fort potentiel de ces nouveaux invariants nous laisse penser qu’ils pourraient constituer une forte valeur ajoutée dans l’aide au diagnostic s’ils étaient implémentés dans des logiciels de post-traitement ou dans des dispositifs biomédicaux. Enfin, bien que ces différentes méthodes aient été validées exclusivement sur des signaux fœtaux, une future étude incluant des signaux tirés d’autres systèmes dynamiques nonlinéaires sera réalisée pour confirmer leurs bonnes performances
The analysis of biomedical time series derived from nonlinear dynamic systems is challenging due to the chaotic nature of these time series. Only few classical parameters can be detected by clinicians to opt the state of patients and fetuses. Though there exist valuable complexity invariants such as multi-fractal parameters, entropies and recurrence plot, they were unsatisfactory in certain cases. To overcome this limitation, we propose in this dissertation new entropy invariants, we contributed to multi-fractal analysis and we developed signal-based (unbiased) recurrence plots based on the dynamic transitions of time series. Principally, we aim to improve the discrimination between healthy and distressed biomedical systems, particularly fetuses by processing the time series using our techniques. These techniques were either validated on Lorenz system, logistic maps or fractional Brownian motions modeling chaotic and random time series. Then the techniques were applied to real fetus heart rate signals recorded in the third trimester of pregnancy. Statistical measures comprising the relative errors, standard deviation, sensitivity, specificity, precision or accuracy were employed to evaluate the performance of detection. Elevated discernment outcomes were realized by the high-order entropy invariants. Multi-fractal analysis using a structure function enhances the detection of medical fetal states. Unbiased cross-determinism invariant amended the discrimination process. The significance of our techniques lies behind their post-processing codes which could build up cutting-edge portable machines offering advanced discrimination and detection of Intrauterine Growth Restriction prior to fetal death. This work was devoted to Fetal Heart Rates but time series generated by alternative nonlinear dynamic systems should be further considered

Dissertation (Ph.D. in Software Engineering)--Naval Postgraduate School, March 2002.
Dissertation supervisor: Luqi. "March 2002." Description based on title screen as viewed on July 15, 2010. Author(s) subject terms: Software Engineering, Technology Transfer, Information Theory, Communication Theory, Statistical Mechanics, Dynamical Systems, Control Theory, Learning Curves, Entropy, Information Temperature, Temperature of Software (o Saboe), Technology Transfer Dynamics, Research Management, Diffusion of Innovation, Project Management, Physics of Software Includes bibliographical references (p. 457-489). Also available in print.

L’objectif de cette thèse est de proposer un Alphabet Structural (AS) permettant une caractérisation fine et précise des structures tridimensionnelles (3D) des protéines, à l’aide des chaînes de Markov cachées (HMM) qui permettent de prendre en compte la logique issue de l’enchaînement des fragments structuraux en intégrant l’augmentation des conformations 3D des structures protéiques désormais disponibles dans la banque de données de la Protein Data Bank (PDB). Nous proposons dans cette thèse un nouvel alphabet, améliorant l’alphabet structural HMM-SA27,appelé SAFlex (Structural Alphabet Flexibility), dans le but de prendre en compte l’incertitude des données (données manquantes dans les fichiers PDB) et la redondance des structures protéiques. Le nouvel alphabet structural SAFlex obtenu propose donc un nouveau modèle d’encodage rigoureux et robuste. Cet encodage permet de prendre en compte l’incertitude des données en proposant trois options d’encodages : le Maximum a posteriori (MAP), la distribution marginale a posteriori (POST)et le nombre effectif de lettres à chaque position donnée (NEFF). SAFlex fournit également un encodage consensus à partir de différentes réplications (chaînes multiples, monomères et homomères) d’une même protéine. Il permet ainsi la détection de la variabilité structurale entre celles-ci. Les avancées méthodologiques ainsi que l’obtention de l’alphabet SAFlex constituent les contributions principales de ce travail de thèse. Nous présentons aussi le nouveau parser de la PDB (SAFlex-PDB) et nous démontrons que notre parser a un intérêt aussi bien sur le plan qualitatif (détection de diverses erreurs)que quantitatif (rapidité et parallélisation) en le comparant avec deux autres parsers très connus dans le domaine (Biopython et BioJava). Nous proposons également à la communauté scientifique un site web mettant en ligne ce nouvel alphabet structural SAFlex. Ce site web représente la contribution concrète de cette thèse alors que le parser SAFlex-PDB représente une contribution importante pour le fonctionnement du site web proposé. Cette caractérisation précise des conformations 3D et la prise en compte de la redondance des informations 3D disponibles, fournies par SAFlex, a en effet un impact très important pour la modélisation de la conformation et de la variabilité des structures 3D, des boucles protéiques et des régions d’interface avec différents partenaires, impliqués dans la fonction des protéines
The purpose of this PhD is to provide a Structural Alphabet (SA) for more accurate characterization of protein three-dimensional (3D) structures as well as integrating the increasing protein 3D structure information currently available in the Protein Data Bank (PDB). The SA also takes into consideration the logic behind the structural fragments sequence by using the hidden Markov Model (HMM). In this PhD, we describe a new structural alphabet, improving the existing HMM-SA27 structural alphabet, called SAFlex (Structural Alphabet Flexibility), in order to take into account the uncertainty of data (missing data in PDB files) and the redundancy of protein structures. The new SAFlex structural alphabet obtained therefore offers a new, rigorous and robust encoding model. This encoding takes into account the encoding uncertainty by providing three encoding options: the maximum a posteriori (MAP), the marginal posterior distribution (POST), and the effective number of letters at each given position (NEFF). SAFlex also provides and builds a consensus encoding from different replicates (multiple chains, monomers and several homomers) of a single protein. It thus allows the detection of structural variability between different chains. The methodological advances and the achievement of the SAFlex alphabet are the main contributions of this PhD. We also present the new PDB parser(SAFlex-PDB) and we demonstrate that our parser is therefore interesting both qualitative (detection of various errors) and quantitative terms (program optimization and parallelization) by comparing it with two other parsers well-known in the area of Bioinformatics (Biopython and BioJava). The SAFlex structural alphabet is being made available to the scientific community by providing a website. The SAFlex web server represents the concrete contribution of this PhD while the SAFlex-PDB parser represents an important contribution to the proper function of the proposed website. Here, we describe the functions and the interfaces of the SAFlex web server. The SAFlex can be used in various fashions for a protein tertiary structure of a given PDB format file; it can be used for encoding the 3D structure, identifying and predicting missing data. Hence, it is the only alphabet able to encode and predict the missing data in a 3D protein structure to date. Finally, these improvements; are promising to explore increasing protein redundancy data and obtain useful quantification of their flexibility

La tesi versa sobre sistemes dinàmics discrets 1-dimensionals, des d'un punt de vista combinatori i topològic. Estem interessats en les òrbites periòdiques i l'entropia topològica de les aplicacions contínues definides en arbres i grafs.
El problema central és la caracterització del conjunt de períodes de totes les òrbites periòdiques d'una aplicació contínua d'un arbre en ell mateix. El teorema de Sharkovskii (1964) fou el primer resultat remarcable en aquest sentit. Aquest bonic teorema estableix que el conjunt de períodes d'una aplicació de l'interval és un segment inicial d'un ordre lineal (ordre de Sharkovskii). Recíprocament, donat qualsevol segment inicial d'aquest ordre, existeix una aplicació de l'interval que el té com a conjunt de períodes.
Durant les darreres dècades hi ha hagut diversos intents de trobar resultats similars al de Sharkovskii per a altres espais 1-dimensionals. Recentment, el cas d'arbres ha estat tractat especialment. El Teorema de Baldwin (1991) resol el problema en el cas de les n-estrelles i ha estat un dels avenços més significatius en aquesta direcció. Aquest resultat estableix que el conjunt de períodes per a una aplicació de la n-estrella és unió finita de segments inicials de n ordres parcials (ordres de Baldwin), i recíprocament.
El nostre objectiu principal és descriure l'estructura del conjunt de períodes de qualsevol aplicació contínua d'un arbre T en termes de les propietats combinatòries i topològiques de T: quantitat i disposició d'extrems, vèrtexs i arestes. En el capítol 1 discutim detalladament la manera més natural d'atacar el problema, i proposem una estratègia consistent en tres etapes consecutives. L'eina principal d'aquesta estratègia són els models minimals de patrons. Aquestes nocions es van desenvolupar i utilitzar durant les darreres dècades en el context de l'interval. En canvi, no es disposava de definicions operatives equivalents per a arbres, fins que al 1997 Alseda, Guaschi, Los, Manyosas i Mumbru proposaren de definir el patró d'un conjunt finit invariant P essencialment com una classe d'homotopia d'aplicacions relativa a P, i provaren (constructivament) que sempre existeix un model P-canònic amb propietats de minimalitat dinàmica.
L'objectiu del capítol 2 és implementar completament el programa proposat, duent a terme les etapes 2 i 3. El resultat principal d'aquest capítol diu que, donada una aplicació g definida en un arbre T, existeix un conjunt S de successions finites d'enters positius tal que el conjunt de períodes de g és (excepte un conjunt finit explícitament acotat) una unió finita de segments inicials d'ordres de Baldwin donats en termes del conjunt S, que depèn de les propietats combinatòries de l'arbre T. També provem el recíproc.
En el capítol 3 duem a terme experiments informàtics sobre la minimalitat dinàmica dels models canònics. En un esperit de programació modular, hem dissenyat moltes funcions autocontingudes que poden ser usades per implementar una gran varietat d'aplicacions d'ús divers. Entre altres, tenim funcions que calculen el model canònic d'un patró donat per l'usuari, calculen la matriu de Markov associada a un model monòton a trossos i extreuen tots els llaços simples d'una matriu de transició de Markov.
Finalment, en el capítol 4 generalitzem alguns resultats de Block i Coven, Misiurewicz i Nitecki i Takahashi, en els quals l'entropia topològica d'una aplicació de l'interval s'aproxima per les entropies de les seves òrbites periòdiques. Hem provat relacions anàlogues en el context de les aplicacions de grafs.
This memoir deals with one-dimensional discrete dynamical systems, from both a topological and a combinatorial point of view. We are interested in the periodic orbits and topological entropy of continuous self-maps defined on trees and graphs.
The central problem is the characterisation of the set of periods of all periodic orbits exhibited by any continuous map from a tree into itself. The Sharkovskii's Theorem (1964) was the first remarkable result in this setting. This theorem states that the set of periods of any interval map is an initial segment of a linear ordering (the so-called Sharkovskii ordering). Conversely, given any initial segment of the Sharkovskii ordering, there exists an interval map whose set of periods coincides with it.
During the last decades there have been several attempts to find results similar to that of Sharkovskii for other one-dimensional spaces. Recently, the case of maps defined on general trees has been specially treated. Baldwin's Theorem (1991), which solves the problem in the case of n-stars for any n, has been one of the most significant advances in this direction. This result states that the set of periods of any n-star map is a finite union of initial segments of n-many partial orderings (the Baldwin orderings). The converse is also true.
Our main purpose is to describe the generic structure of the set of periods of any continuous self-map defined on a tree T in terms of the combinatorial and topological properties of T: amount and arrangement of endpoints, vertices and edges. In Chapter 1 we make a detailed discussion about which is the more natural approach to this problem, and we propose a strategy consisting on three consecutive stages and using minimal models of patterns as the main tool. These notions were developed in the context of interval maps and widely used in a number of papers during the last two decades. However, equivalent operative definitions for tree maps were not available until 1997, when Alseda, Guaschi, Los, Manosas and Mumbru proposed to define the pattern of a finite invariant set P essentially as a homotopy class of maps relative to the points of P, and proved (constructively) that there always exists a P-canonical model displaying dynamic minimality properties.
The goal of Chapter 2 is to implement in full the above programme by completing stages 2 and 3. The main result of Chapter 2 tells us that for each tree map g defined on a tree T there exists a finite set S of sequences of positive integers such that the set of periods of g is (up to an explicitly bounded finite set) a finite union of initial segments of Baldwin orderings, given in terms of the set S, which depends on the combinatorial properties of the tree T. We also prove the converse result.
In Chapter 3 we report some computer experiments on the minimality of the dynamics of canonical models. In a spirit of modular programming, we have designed lots of self-contained functions which can be used to implement a wide variety of several-purpose software. Among other, we have functions that: compute the canonical model of a pattern provided by the user, calculate the Markov transition matrix associated to a piecewise monotone tree map and extract all the simple loops of a given length from a Markov transition matrix.
Finally, in Chapter 4 we generalize some results of Block & Coven, Misiurewicz & Nitecki and Takahashi, where the topological entropy of an interval map was approximated by the entropies of its periodic orbits. We prove analogous relations in the setting of graph maps.

The reported work lies in the area of automation in the construction industry, and involves multi-disciplinary engineering studies. In particular, sewer renovation methods, computer vision (CV) and robotics are all included. More specifically, the key objective of the research programme was to investigate the characteristics of retrofit components suited to mounting on an industrial / proprietary sewer tractor. The overall aim was the provision of a non-man-entry (NME) sewer renovation robot to undertake reconnection of lateral junctions, following a cured-in-place (CIP) relining process. The programme primarily involved theoretical studies of the requisite sensory and kinematic components, incorporation of a novel computer vision sensing system and production of a chainage measurement system and robotic drill task arm. The theory was supported by laboratory testing using a modified proprietary tractor, with emphasis placed on promoting applications of information technology driven systems (i.e. CV) to construction-industry tasks within hazardous environments involving significant health issues. The use of such techniques in the construction industry is rare. Chapter 1 reviews the context and history of sewer maintenance/dereliction in the UK. NME sewers are the most common type and are, by definition, difficult to maintain. Renovation, typically employing CIP liners, is therefore a cost-effective alternative to replacement. Lateral connections are, inevitably, blocked off during the relining process; it is suggested that application of a robust robotic system to the task of reconnecting them is novel and offers clear potential within such a hazardous environment. Chapters 2 and 3 develop the underlying theoretical models of the CV and kinematic systems respectively. The novel CV work (provided by third party specialists employing the TINA CV research environment) was incorporated by the author to provide detection and classification of lateral junctions, crucially noting the particular properties of direct and reflected illumination. Classification aspects include estimation of lateral/NME intersection angle and closure-to-target distance from the robot. The author proposes a separate procedure for estimating lateral diameter. A chainage measurement system, using a rotary encoder and inclinometer, was developed to determine invert path distance travelled. This allows for the inevitable wander and thereby gives the system robustness. The novel application of GRASP (a robotic modelling and simulation design tool) to NME environments, provided the ability to model arm designs without the need for the production of more than one expensive physical prototype. A mathematical solution for determining the requisite arm kinematics is presented. Chapter 4 details the hardware requirements of the robotic system components, whilst Chapters 5 and 6 present the laboratory evaluation results for the kinematic and CV systems respectively. The abilities of the CV system qualitatively to detect laterals under reflected illumination, and to provide quantitative classification data, are demonstrated. The chainage measurement system is assessed under a variety of initialisation conditions to determine suitability to task, and the ability of the robotic arm to physically simulate lateral reconnection is investigated. Chapter 7 discusses the specification for an industrially-applicable prototype, based on the findings herein. Appropriate comparisons with the pre-prototype system are made, including cost. Finally, Chapter 8 draws conclusions and makes suggestions for further work. Supporting documentation is provided in Chapter 9 and the Appendices.

Two applications of Category Theory are considered. The link between them is applications to Physics and more specifically to Entropy. The first research chapter is broader in scope and not explicitly about Physics, although connections to Statistical Mechanics are made towards the end of the chapter. Matroids are abstract structures that describe dependence, and strong maps are certain structure-preserving functions between them with desirable properties. We examine properties of various categories of matroids and strong maps: we compute limits and colimits; we find free and cofree constructions of various subcategories; we examine factorisation structures, including a translation principle from geometric lattices; we find functors with convenient properties to/from vector spaces, multisets of vectors, geometric lattices, and graphs; we determine which widely used operations on matroids are functorial (these include deletion, contraction, series and parallel connection, and a simplification monad); lastly, we find a categorical characterisation of the greedy algorithm. In conclusion, this project determines which aspects of Matroid Theory are most and least conducive to categorical treatment. The purpose of the second research chapter is to provide a categorical framework for generalising and unifying notions of Entropy in various settings, exploiting the fact that Entropy is a monotone subadditive function. A categorical characterisation of Entropy through a category of thermodynamical systems and adiabatic processes is found. A modelling perspective (adiabatic categories) that directly generalises an existing model is compared to an axiomatisation through topological and linear structures (topological weak semimodules), where the latter is based on a categorification of semimodules. Properties of each class of categories are examined; most notably a cancellation property of adiabatic categories generalising an existing result, and an adjunction between the categories of weak semimodules and symmetric monoidal categories. An adjunction between categories of adiabatic categories and topological weak semimodules is found. We examine in which cases each of these classes of categories constitutes a traced monoidal category. Lastly, examples of physical applications are provided. In conclusion, this project uncovers a way of, and makes progress towards, retrieving the statistical formulation of Entropy from simple axioms.

Geographic Information Systems (GIS) development in crime analyses encourages sustainable platforms within various types of users and decision makers. Since patterns of crime incidents are pinpointed and analyzed in crime mapping, accurate data acquisition must be considered as a key concept to construct a successful GIS application. Ankara City Police Department utilizes a semi-automated geocoding interface in which crime incidents including offenders and victims are pinpointed. However, this system has some accuracy errors during geocoding, because in this process point based data are located in the center of street line segments, and this may cause position errors up to 200 meters. Therefore, additional data editing must be done to reach a reasonable accuracy. In this context, real time data editing provides opportunity to gain time instead of expanding the GIS database within received hardcopy files from each police station. As the crime incidents occur daily, online editing must be used to maintain such an accurate and efficient spatial database. In this study, for effective and accurate geocoding, a Web based data acquisition method is proposed. This online entry system enables real-time editing for GIS repository. In this way this study aims to provide a fast and reliable data acquisition system by constructing a multi participant platform enabling online data entry from each police station.

This thesis is concerned with criminal defendants who become psychiatrically hospitalised as the outcome of their court proceedings. There are four routes whereby criminal defendants can become hospitalised in New Zealand. These are to be found not guilty by reason of insanity, to found to be under disability, to be found guilty and mentally disordered and for charges to be dropped and proceedings initiated under the Mental Health (Compulsory Assessment and Treatment) Act, 1992. The background to each of these options is explored, with an emphasis on the insanity defence, and the empirical literature reviewed. There are some theoretical contradictions in whether these legal provisions are therapeutic or punitive. The aim of the current study was to describe criminal defendants who enter the mental health system and become psychiatrically hospitalised via the Court Liaison Service. The Court Liaison Service is a part of the Regional Forensic Psychiatric Service. As part of this service, a nurse screens criminal defendants at court for indications that mental health intervention may be warranted. A sample of defendants, who were seen by the Court Liaison Service at Christchurch, is described. Of these defendants some receive a full psychiatric evaluation and a report is prepared for the courts. The characteristics of those who receive a report are compared with those who do not receive a report. Defendants, who are hospitalised as an outcome of their court proceedings, are compared with those who are not. The findings are consistent with international research, in that most defendants were male, and socially disadvantaged in a number of ways. The mental status screening assessment was a useful discriminator between those who received a report and those who did not, and between defendants who were hospitalised and those that were not. Most defendants who were hospitalised showed clear signs of psychotic processes. Defendants who received a report but who were not hospitalised are particularly vulnerable in terms of their mental health needs. This group showed more evidence of depression, and was rated to be of higher suicide risk. They tended to have psychopathic traits, and were more frequently referred because of concerns about dangerousness. A considerable proportion of all defendants have difficulties with substance abuse. Report and hospitalisation status could be effectively predicted, using information collected at the time of the Court Liaison screening. For example, using diagnosis and mental status data as predictor variables, there was 86% correct classification of cases as hospitalised or not. In conclusion, it is argued that the insanity defence serves little current pragmatic use. Revision is recommended in the current admission criteria to psychiatric hospitals for criminal defendants, with an emphasis on effective treatment programmes. The victim's perspective is not frequently considered in deliberations about mentally disordered offenders, and this is seen as important. Finally, the Court Liaison Service serves an extremely valuable function at the interface between the criminal justice and mental health systems in New Zealand.

Cette thèse traite de la modélisation de prix boursiers par les exponentielles de processus de Lévy. La première partie développe une méthode non-paramétrique stable de calibration de modèles exponentielle-Lévy, c'est-à-dire de reconstruction de ces modèles à partir des prix d'options cotées sur un marché financier. J'étudie les propriétés de convergence et de stabilité de cette méthode de calibration, décris sa réalisation numérique et donne des exemples de son utilisation. L'approche adoptée ici consiste à reformuler le problème de calibration comme celui de trouver un modèle exponentielle-Lévy risque-neutre qui reproduit les prix d'options cotées avec la plus grande précision possible et qui a l'entropie relative minimale par rapport à un processus "a priori" donné. Ce problème est alors résolu en utilisant la méthode de régularisation, provenant de la théorie de problèmes inverses mal posés. L'application de ma méthode de calibration aux données empiriques de prix d'options sur indice permet d'étudier certaines propriétés des mesures de Lévy implicites qui correspondent aux prix de marché.

La deuxième partie est consacrée au développement d'une méthode permettant de caractériser les structures de dépendance entre les composantes d'un processus de Lévy multidimensionnel et de construire des modèles exponentielle-Lévy multidimensionnels. Cet objectif est atteint grâce à l'introduction de la notion de copule de Lévy, qui peut être considérée comme l'analogue pour les processus de Lévy de la notion de copule, utilisée en statistique pour modéliser la dépendance entre les variables aléatoires réelles. Les exemples de familles paramétriques de copules de Lévy sont donnés et une méthode de simulation de processus de Lévy multidimensionnels, dont la structure de dépendance est décrite par une copule de Lévy, est proposée.

Dissertação (mestrado)—Universidade de Brasília, Instituto de Ciências Exatas, Departamento de Ciência da Computação, 2017.
Submitted by Raquel Almeida (raquel.df13@gmail.com) on 2017-08-11T17:54:07Z No. of bitstreams: 1 2017_GizeleFernandaAbdonJúlio.pdf: 8246830 bytes, checksum: 08a772c1a262f57b66e4c717dccfd722 (MD5)
Approved for entry into archive by Raquel Viana (raquelviana@bce.unb.br) on 2017-09-26T16:34:31Z (GMT) No. of bitstreams: 1 2017_GizeleFernandaAbdonJúlio.pdf: 8246830 bytes, checksum: 08a772c1a262f57b66e4c717dccfd722 (MD5)
Made available in DSpace on 2017-09-26T16:34:31Z (GMT). No. of bitstreams: 1 2017_GizeleFernandaAbdonJúlio.pdf: 8246830 bytes, checksum: 08a772c1a262f57b66e4c717dccfd722 (MD5) Previous issue date: 2017-09-26
Sistemas de múltiplas vistas são amplamente empregados na criação de vídeos 3D e de aplicações de ponto de vista livre. As múltiplas vistas, contendo vídeos de textura (cor) e profundidade, devem ser eficientemente comprimidas para serem transmitidas ao cliente e podem servir para síntese de vistas no receptor. Nesse contexto, a proposta deste trabalho é desenvolver um pré-processamento baseado no modelo de Distorção de Profundidade Admissível (ADD) que atue sobre os mapas de profundidade antes da codificação destes. Esse trabalho explora o modelo ADD e, adicionalmente, propõe a escolha e substituição dos valores de profundidade para aumentar a compressão dos mesmos de acordo com a distribuição dos blocos (coding units) empregados por codificadores padrões. Este pré-processamento tem como intuito a diminuição da carga de transmissão sem gerar perdas de qualidade na síntese da vista. Os histogramas dos mapas de profundidade após o pré-processamento são modificados, pois a alteração dos valores de profundidade dependerá da localização dos blocos. Os resultados mostram que é possível alcançar ganhos de compressão de até 13.9% usando o método da Mínima Variância no Bloco-ADD (ADD-MVB) sem a introdução de perdas por distorção e preservando a qualidade das imagens sintetizadas.
Multiview systems are widely used to create 3D video as well as in FreeViewpoint Video applications. The multiple views, consisting of texture images and depth maps, must be efficiently compressed and trasmitted to clients where they may be used towards the synthesis of virtual views. In this context, the Allowable Depth Distorion (ADD) has been used in a preprocessing step prior to depth coding. This work explores ADD and, additionally, the choice of depth value to increase compression for transmission in accordance to the distribution of blocks (e.g., coding units) commonly employed by standardized coders without generating synthesis quality losses. Their histograms will be modified depending on the location and where the pixel belongs in the image. Experimental results show that our proposal can achieve compression gains of up to 13.9% applying the minimum variance method within a block, without introducing losses in terms of distortion and preserving synthesized image quality.

Inom byggbranschen finns det problem med att personer kommer in på arbetsområdet där de kan komma till skada. Detta problem kallas problemet med tredje man på arbetsplats och byggföretagen jobbar idag på att hitta en lösning till detta. I examensarbetet ligger fokusen på att identifiera och kartlägga hur incidenterna går till och om det är möjligt att förebygga dessa. I rapporteringsdatabasen BIA har 1000 incidenter undersökts, kategoriserats och presenterats. Detta för att hitta samband och beteendemönster. Intervjuer har gjorts med branschaktiva och enkäter har skickats ut till insatta i ämnet för att inhämta kunskap och förståelse av problemet. De studerade incidenterna som undersökts kommer från Skanskas arbetsplatser. Incidenter som inträffat på andra ställen än Skanska Sverige undersöks inte. Studien undersöker inte om det är möjligt att förhindra skador på tredje man. Studien har visat att det finns vissa beteendemönster i hur och varför tredje man beträder arbetsplatser. Dessa beteendemönster kan delvis förklaras av hur och när folk tar sig till skolor och jobb. Studien visar också att i vissa fall har tredje man kommit in av misstag då avstängningar är otillräckliga. Material från intervjuer och enkäter stödjer också detta resultat. I dessa intervjuer och enkäter framgår också att det finns ett stort problem av bristande respekt hos tredje man vilket leder till aktiva beslut att beträda arbetsplatser. Slutsatsen som kan dras av examensarbetet är att problemet med tredje man på arbetsplatser är omfattande och det finns många orsaker till problemet. Det framgår också att problemet med tredje man existerar i betydande grad bland fotgängare, cyklister och bilister. Det som kan konstateras är att om problemet helt ska förhindras krävs åtgärder på många olika sätt, både för att stoppa de aktiva intrången och förhindra att personer kommer in av misstag eller missförstånd.
In the construction industry today, there is problems related to the public entering worksites where accidents might happen that also lead to injuries. This is called the problem with third person at worksites and today, companies do their best to find a solution for this. In this examination thesis the focus is to identify and map how these incidents occur, and if it is possible to prevent them. In the report database BIA, 1000 incidents has been studied, categorized and presented. This has been done to find similarities and behavioral patterns. To collect information and understanding about this issue, interviews and surveys has been done with people working in the construction industry. The incident reports that has been studied comes from Skanska’s worksites in Sweden. Incidents that has occurred at other work sites has not been studied. The study does not analyze if it is possible to avoid injuries to unauthorized people entering the work sites. The study shows there is signs of behavioral patterns concerning the public and how they end up within worksites. This can partly be explained in which time and way people travel between home and schools or work. The study also shows that in some cases third person has entered the worksite by mistake when fences and gates has been insufficient. The interview material and surveys also support this result. In these interviews and surveys it’s also apparent that there is a big issue concerning peoples lack of judgement, leading to decisions to enter construction sites. What can be summarized by this examination thesis is that the problem with unauthorized entry by third person at worksites is a major issue and there seems to be many causes to the problem. It also appears that the issue widely affects pedestrians, cyclists and motorists. What can be said about this is that if the problem is to be completely prevented, large effort needs to be applied in many ways, both to prevent active intrusion and to prevent people trespassing by accident.

Neste trabalho estudamos a dinâmica de modelos biofísicos caóticos que representam a actividade eléctrica de células excitáveis. Usando técnicas da teoria dos sistemas dinâmicos, quantificamos a complexidade das estruturas fisiológicas através da análise de determinadas aplicações no intervalo. Mais precisamente, caracterizamos a entropia topológica e um segundo invariante topológico, denotado por r, com o propósito de descrever o comportamento caótico dos modelos. Primeiramente, apresentamos um estudo da dinâmica de um modelo do tipo FitzHugh-Nagumo submetido a um estímulo periódico. No contexto dos ritmos fisiológicos, proporcionamos uma caracterização da dinâmica de uma família de aplicações na circunferência que foi proposta como modelo para osciladores não lineares periodicamente forçados. Atendendo à sua importância, analisamos modelos biofísicos para o comportamento "explosivo" de células excitáveis. A dinâmica de uma célula singular e a caracterização do efeito de acoplamento em células "explosivas" idênticas, é particularmente interessante para o nosso estudo. Finalmente, apresentamos algumas considerações sobre a relevância do comportamento caótico em sistemas neuronais como factor crucial de adaptação a um meio em constante evolução./ABSTRACT - In this work we study the dynamics of chaotic biophysical models that represent the electrical activity of excitable cells. Using techniques of dynamical systems theory, we quantify the complexity of the physiological structures, through the analysis of specific maps on the interval. More precisely, we characterize the topological entropy and a second topological invariant, denoted by r, in order to describe the chaotic behavior of the models. Firstly, we present a study of the dynamics of a FitzHugh-Nagumo type model under periodic function forcing. In the context of physiological rhythms, we provide a characterization of the dynamics of a family of circle maps that has been proposed as a model for periodically forced nonlinear oscillators. Regarding their importance, we analyse biophysical models for the bursting behavior of excitable cells. The dynamics of a single cell and the characterization of the effect of coupling on identical bursting cells, is particularly interesting for our study. Finally, we present some considerations about the relevance of the chaotic behavior in neural systems as a crucial factor of adaptation to an environment in constant evolution.

Submitted by Fabio Sobreira Campos da Costa (fabio.sobreira@ufpe.br) on 2017-07-11T13:06:08Z No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) TeseJoseversaoCD.pdf: 2349040 bytes, checksum: f9cf2bfb304c798e864da4edd16e3a90 (MD5)
Made available in DSpace on 2017-07-11T13:06:08Z (GMT). No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) TeseJoseversaoCD.pdf: 2349040 bytes, checksum: f9cf2bfb304c798e864da4edd16e3a90 (MD5) Previous issue date: 2016-02-26
CNPQ
Geradores de números pseudo-aleatórios são amplamente utilizados em aplicações científicas e tecnológicas. Particularmente em criptografia, estes são empregados em sistemas de chave secreta, como geradores de sequências de cifragem. Neste trabalho, propomos algumas metodologias para o projeto destes geradores a partir de mapas caóticos. A primeira é baseada em duas técnicas: salto de amostras e discretização codificada variante no tempo. Mostra-se que o procedimento possui alta taxa de geração de bits por amostra caótica quando comparado com a codificação fixa no tempo, além de dispensar pós-processamento para melhoria de suas propriedades aleatórias. A outra metodologia utilizada é o emprego de sequências-m para eliminar a correlação residual na sequência codificada. A discretização variante no tempo apresenta uma característica de correlação bem definida que é aproveitada por um novo bloco de pós-processamento que utiliza sequências-m de menor complexidade linear que a metodologia anterior. Validam-se os métodos propostos empregando a bateria de teste NIST.
Random number generators are widely used in scientific and technological applications. Particularly in cryptography, they are used in secret-key systems, such as key sequence generators. In this work, we present two methodologies for the design of these generators from chaotic maps. The first one is based on two techniques: Skipping and time-varying coded discretization. We show that the proposed method has higher bit generation rate when compared to fixed-time coded discretization and dispenses post-processing in order to improve their random properties. Another methodology is the use of m-sequences to eliminate the residual correlation of the coded sequence. The time-varying coded discretization has a well-defined correlation characteristic that is exploited by a new block ofpost-processing using m-sequences that requires less memory than the previous methodology. The effectiveness of this procedure is verified through the NIST test.

Dans cette thèse, notre but est de donner un cadre numérique général pour approcher les solutions des problèmes du transport optimal (TO). L’idée générale est d’introduire une régularisation entropique du problème initial. Le problème régularisé correspond à minimiser une entropie relative par rapport à une mesure de référence donnée. En effet, cela équivaut à trouver la projection d’un couplage par rapport à la divergence de Kullback-Leibler. Cela nous permet d’utiliser l’algorithme de Bregman/Dykstra et de résoudre plusieurs problèmes variationnels liés au TO. Nous nous intéressons particulièrement à la résolution des problèmes du transport optimal multi-marges (TOMM) qui apparaissent dans le cadre de la dynamique des fluides (équations d’Euler incompressible à la Brenier) et de la physique quantique (la théorie de fonctionnelle de la densité ). Dans ces cas, nous montrons que la régularisation entropique joue un rôle plus important que de la simple stabilisation numérique. De plus, nous donnons des résultats concernant l’existence des transports optimaux (par exemple des transports fractals) pour le problème TOMM
In this thesis we aim at giving a general numerical framework to approximate solutions to optimal transport (OT) problems. The general idea is to introduce an entropic regularization of the initialproblems. The regularized problem corresponds to the minimization of a relative entropy with respect a given reference measure. Indeed, this is equivalent to find the projection of the joint coupling with respect the Kullback-Leibler divergence. This allows us to make use the Bregman/Dykstra’s algorithm and solve several variational problems related to OT. We are especially interested in solving multi-marginal optimal transport problems (MMOT) arising in Physics such as in Fluid Dynamics (e.g. incompressible Euler equations à la Brenier) and in Quantum Physics (e.g. Density Functional Theory). In these cases we show that the entropic regularization plays a more important role than a simple numerical stabilization. Moreover, we also give some important results concerning existence and characterization of optimal transport maps (e.g. fractal maps) for MMOT

Smooth maps with singularities describe important physical phenomena such as the collisions of rigid spheres among them and/or with the walls of a container. Questions about the ergodic properties of these models (which can be mapped into billiard models) were first raised by Boltzmann in the nineteenth century and lie at the foundation of Statistical Mechanics. Billiard models also describe the diffusive motion of electrons bouncing off positive nuclei (Lorentz gas models) and in this situation the physical measure can be considered infinite. It is therefore of great importance to study the ergodic properties of maps when the measure they preserves is infinite. The aim of this thesis is to present an original result on smooth maps with singularities which preserve an infinite measure. Such result establishes the atomicity of the tail $\sigma$-algebra (and hence strong chaotic properties) in the presence of a totally conservative behavior.

碩士
中原大學
資訊工程研究所
93
In Mobile Learning, students learn and observe objects for the learning goal in the place, and use mobile equipments to inquire and to record data on Internet. By this mechanism, this paper designs a system to ask questions and to guide students where to learn. The mechanism of question can compose sentence, not question base, to ask student. According to a status of the student’s answers, the system guides the student to this position to learn and to observe what kinds of concept. This paper uses the structure of Knowledge Map to store knowledge. We analyse keywords in the context and store them into Knowledge Map structure. By this knowledge structure, we can find out what kinds of questioning styles and how to compute the Entropy of each concept. According to the idea of the law of diminishing marginal utility, we stand on the status of the students’ answers to decrease the Entropy of concept gradually. It avoided students receiving the same concepts in the guidance. It will include testing concepts in the question so that we can compute the question’s Entropy by concept’s Entropy after we knowing the testing concepts. The Intelligent Agent will choose the maximum Entropy of question to guide students to learn. After answering questions, the system will estimate the students’ answers to guide them to next position. The Intelligent Agent produces questions by knowledge instructions. The knowledge instructions, which operates in Knowledge Map, composes concepts which has gotten from Knowledge Map. Then according to Transformational-Generative Grammar, it composes knowledge instructions into a sentence and transforms the sentence into a question. This paper implements a system for question and guidance and handles the plants’ data of Cherng Gong Elementary School in Taoyuan County. We integrated this system into a Mobile Learning system (Knowledge-Enhanced System, KEN), and went to Cherng Gong Elementary School to test this system with a lesson plan. We marshaled some problems in this test.