To see the other types of publications on this topic, follow the link: Vector maps.
Dissertations / Theses on the topic 'Vector maps'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Vector maps.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Qvick, Faxå Alexander, and Jonas Bromö. "GPU accelerated rendering of vector based maps on iOS." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-107064.
Full textAbstract:
Digital maps can be represented as either raster (bitmap images) or vector data. Vector maps are often preferable as they can be stored more efficiently and rendered irrespective of screen resolution. Vector map rendering on demand can be a computationally intensive task and has to be implemented in an efficient manner to ensure good performance and a satisfied end-user, especially on mobile devices with limited computational resources. This thesis discusses different ways of utilizing the on-chip GPU to improve the vector map rendering performance of an existing iOS app. It describes an implementation that uses OpenGL ES 2.0 to achieve the same end-result as the old CPU-based implementation using the same underlying map infras- tructure. By using the OpenGL based map renderer as well as implementing other performance optimizations, the authors were able to achieve an almost fivefold increase in rendering performance on an iPad Air.
2
Niazy, Hussein. "Normalizability, integrability and monodromy maps of singularities in three-dimensional vector fields." Thesis, University of Plymouth, 2015. http://hdl.handle.net/10026.1/3659.
Full textAbstract:
In this thesis we consider three-dimensional dynamical systems in the neighbourhood of a singular point with rank-one and rank-two resonant eigenvalues. We first introduce and generalize here a new technique extending previous work which was described by Aziz an Christopher (2012), where a second first integral of a 3D system can be found if the system has a Darboux-analytic first integral and an inverse Jacobi multiplier. We use this new technique to find two independent first integrals one of which contains logarithmic terms, allowing for non-zero resonant terms in the formal normal form of vector field. We also consider sufficient conditions for the existence of one analytic first integral for three dimensional vector fields around a singularity. Starting from the generalized Lotka-Volterra system with rank-one resonant eigenvalues, using the normal form method, we find an inverse Jacobi multiplier of the system under suitable conditions. Moreover, these conditions are sufficient conditions for the existence of one analytic first integral of the system. We apply this to demonstrate the sufficiency of the conditions in Aziz and Christopher (2014). In the case of two-dimensional systems, Christopher et al (2003) addressed the question of orbital normalizability, integrability, normalizability and linearizability of a complex differential system in the neighbourhood at a critical point. We here address the question of normalizability, orbital normalizability, and integrability of three-dimensional systems in the neighbourhood at the origin for rank-one resonance system. We consider the case when the eigenvalues of three-dimensional systems have rank-one resonance satisfying the condition the sum of eigenvalues is equal to zero a typical example, and we use a further change of coordinates to bring the formal normal form for three-dimensional systems into a reduced normal form which contains a finite number of resonant monomials. By using this technique, we can find two independent first integrals formally. The first one of these first integrals is of Darboux-analytic type, and other first integral contains logarithmic terms corresponding to non-zero resonant monomials of the original system. We introduce the monodromy map in three-dimensional vector fields by using these two independent first integrals to study a relationship between normalizability and integrability of systems. In the case of rank-one resonant eigenvalues, we get a monodromy map which is in normal form, and then in the same way as the case of vector fields, we use a further change of coordinates to reduce this map into a reduced map which contains only a finite number of resonant monomials. This thesis also examines briefly the case of rank-two resonant eigenvalues of three-dimensional systems. The normal form in this case contains an infinite number of resonant monomials, we were not able to find a reduced normal form with a finite number of resonant monomials. This situation is therefore much more complex than the rank-one case. Thus, we simplify the investigation by truncating the 3D system to a 3D homogeneous cubic system as a first step to understanding the general case. Even though we can find two independent first integrals, the second one involves the hypergeometric function, leading to some interesting topics for further investigation.
3
Taraldsvik, Mats. "The future of web-based maps: can vector tiles and HTML5 solve the need for high-performance delivery of maps on the web?" Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for bygg, anlegg og transport, 2012. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-18625.
Full textAbstract:
The majority of the current maps available on the web with a standard browser are raster-based, which impose a couple of limitations with regard to functionality as well as performance. Most work is done on the server, and the raster image tiles that are rendered on the client can not be interacted with directly. Some solutions are available that solve this partially, but in the majority of cases, they depend on technology that is not standardised, and rely on third-party extensions that are only available on certain platforms.Creating map tiles and implementing efficient caching are crucial in high availability web maps, whether they are raster-based or vector-based. Due to the different storage models of raster images and vector data structures, there are also techniques that differ in their application (such as compression, client rendering and generalisation), and the increased exposure of raw information with vector data needs attention. The data formats chosen for representing spatial data in vector-based maps, have lots of implications for the efficiency and usability of the map application itself.The accelerated development and standardisation of the open web -- namely HTML5 -- are giving developers better tools to meet the functionality and performance requirements for vector maps on the web, without resorting to third-party software that is not supported across platforms. Previously, with the technology available, creating a functional, efficient vector map on the web was hard or impossible using only open technology, but with the recent advancements, it is interesting to see to what extent this can be accomplished.By developing an implementation of a vector map client and server, with multiple vector data structures in both binary and text formats for measuring efficiency between server and client, as well as assessing the impact of techniques such as generalisation, tiling and caching, the potential for future vector-based maps on the web have been analysed. Testing revealed interesting results, which suggest that it is possible to achieve performance with vector-based maps on the web that either matches or exceeds the current raster-based maps.
4
Gronow, Michael Justin. "Extension maps and the moduli spaces of rank 2 vector bundles over an algebraic curve." Thesis, Durham University, 1997. http://etheses.dur.ac.uk/5081/.
Full textAbstract:
Let SUc(2,Ʌ) be the moduli space of rank 2 vector bundles with determinant Ʌ on an algebraic curve C. This thesis investigates the properties of a rational map PU(_d,A) →(^c,d) SUc(2, A) where PU(_d,A) is a projective bundle of extensions over the Jacobian J(^d)(C). In doing so the degree of the moduli space SUc(2, Oc) is calculated for non- hyperelliptic curves of genus four (3.4.2). Information about trisecants to the Kummer variety K C SUc(2,Oc) is obtained in sections 4.3 and 4.4. These sections describe the varieties swept out by these trisecants in the fibres of PU1,o(_c) → J(^1)(C) for curves of genus 3, 4 and 5. The fibres of over ϵ(_d) over E ϵ SUc{2,A) are then studied. For certain values of d these correspond to the family of maximal line subbundles of E. These are either zero or one dimensional and a complete description of when these families are smooth is given (5.4.9), (5.4.10). In the one dimensional case its genus is also calculated (if connected) (5.5.5). Finally a correspondence on the curve fibres is shown to exist (5.6.2) and its degree is calculated (5.6.5). This in turn gives some information about multisecants to projective curves (5.7.4), (5.7.7).
5
Eriksson, Oskar, and Emil Rydkvist. "An in-depth analysis of dynamically rendered vector-based maps with WebGL using Mapbox GL JS." Thesis, Linköpings universitet, Programvara och system, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-121073.
Full textAbstract:
The regular way of displaying maps in a web browser is by downloading raster images from a server and lay them side by side to make up a map. If any information on the map is changed, new images has to be downloaded, it cannot be done on the client. The introduction of WebGL opens up a whole new world of delivering advanced graphics content to the end user in a web browser. Utilizing this technology for displaying maps means only the source data is sent to the web browser where the map gets rendered using the device's GPU. This adds a number of benefits such as the ability of changing map appearance on the client, add new features to the map and often less data transfer. It however sets higher expectations of the client device's hardware as it needs to render the map at a high enough frame rate to not appear slow and unresponsive. This thesis investigates a framework for client side map rendering in a web browser, Mapbox GL JS, with focus on performance. It shows how map source data can be generated as well as its corresponding style rules are constructed with performance in mind. It provides benchmarking results of different map data sets with different detail intensity and shows that a device with good GPU performance is needed for an acceptable user experience. It also shows that lowering the amount of rendered detail does not necessarily result in better performance.
6
Magalhães, Karina Mochetti de 1982. "Uma alternativa publica para o metodo de marcas d'agua Raster em mapas vetoriais (RAWVec)." [s.n.], 2009. http://repositorio.unicamp.br/jspui/handle/REPOSIP/276159.
Full textAbstract:
Orientador: Ricardo DahabDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-13T10:53:28Z (GMT). No. of bitstreams: 1 Magalhaes_KarinaMochettide_M.pdf: 3703797 bytes, checksum: 931cd070eb909803435fa87f05e0f83c (MD5) Previous issue date: 2009
Resumo: Marcas d'água vem sendo utilizadas em vários tipos de arquivos de multimídia, como áudio, vídeo e imagens de bitmap, para combater sua copia e distribuição ilegais. Somente com a popularização dos Sistemas de Informação Geográfica (GIS) e da utilização de dados espaciais na Web, marcas d'água para mapas vetoriais ganharam maior atenção, principalmente porque este tipo de imagem possui produção cara, mas pode ser reproduzido facilmente. Esse trabalho revisa o método RAWVec, que insere uma marca d'água representada por uma imagem raster ou bitmap num mapa vetorial, e apresenta uma alternativa publica para tal método.
Abstract: Watermarks have been used for a long time in several digital media to avoid the illegal copy and distribution of these items. Only with the popularization of Geographic Information Systems (GIS) and the use of spatial data on the Web, watermarks for vector maps gained more attention, mostly because vector maps are expensive to produce, but easy to copy. This work reviews the RAWVec Method that embeds a watermark, in the form of a bitmap image, into digital vector maps; and presents a semi-blind alternative method.
Mestrado
Mestre em Ciência da Computação
7
Mafra, Alexandre Teixeira. "Reconhecimento automático de locutor em modo independente de texto por Self-Organizing Maps." Universidade de São Paulo, 2002. http://www.teses.usp.br/teses/disponiveis/3/3132/tde-16052005-083957/.
Full textAbstract:
Projetar máquinas capazes identificar pessoas é um problema cuja solução encontra uma grande quantidade de aplicações. Implementações em software de sistemas baseados em medições de características físicas pessoais (biométricos), estão começando a ser produzidos em escala comercial. Nesta categoria estão os sistemas de Reconhecimento Automático de Locutor, que se usam da voz como característica identificadora. No presente momento, os métodos mais populares são baseados na extração de coeficientes mel-cepstrais (MFCCs) das locuções, seguidos da identificação do locutor através de Hidden Markov Models (HMMs), Gaussian Mixture Models (GMMs) ou quantização vetorial. Esta preferência se justifica pela qualidade dos resultados obtidos. Fazer com que estes sistemas sejam robustos, mantendo sua eficiência em ambientes ruidosos, é uma das grandes questões atuais. Igualmente relevantes são os problemas relativos à degradação de performance em aplicações envolvendo um grande número de locutores, e a possibilidade de fraude baseada em vozes gravadas. Outro ponto importante é embarcar estes sistemas como sub-sistemas de equipamentos já existentes, tornando-os capazes de funcionar de acordo com o seu operador. Este trabalho expõe os conceitos e algoritmos envolvidos na implementação de um software de Reconhecimento Automático de Locutor independente de texto. Inicialmente é tratado o processamento dos sinais de voz e a extração dos atributos essenciais deste sinal para o reconhecimento. Após isto, é descrita a forma pela qual a voz de cada locutor é modelada através de uma rede neural de arquitetura Self-Organizing Map (SOM) e o método de comparação entre as respostas dos modelos quando apresentada uma locução de um locutor desconhecido. Por fim, são apresentados o processo de construção do corpus de vozes usado para o treinamento e teste dos modelos, as arquiteturas de redes testadas e os resultados experimentais obtidos numa tarefa de identificação de locutor.The design of machines that can identify people is a problem whose solution has a wide range of applications. Software systems, based on personal phisical attributes measurements (biometrics), are in the beginning of commercial scale production. Automatic Speaker Recognition systems fall into this cathegory, using voice as the identifying attribute. At present, the most popular methods are based on the extraction of mel-frequency cepstral coefficients (MFCCs), followed by speaker identification by Hidden Markov Models (HMMs), Gaussian Mixture Models (GMMs) or vector quantization. This preference is motivated by the quality of the results obtained by the use of these methods. Making these systems robust, able to keep themselves efficient in noisy environments, is now a major concern. Just as relevant are the problems related to performance degradation in applications with a large number of speakers involved, and the issues related to the possibility of fraud by the use of recorded voices. Another important subject is to embed these systems as sub-systems of existing devices, enabling them to work according to the operator. This work presents the relevant concepts and algorithms concerning the implementation of a text-independent Automatic Speaker Recognition software system. First, the voice signal processing and the extraction of its essential features for recognition are treated. After this, it is described the way each speaker\'s voice is represented by a Self-Organizing Map (SOM) neural network, and the comparison method of the models responses when a new utterance from an unknown speaker is presented. At last, it is described the construction of the speech corpus used for training and testing the models, the neural network architectures tested, and the experimental results obtained in a speaker identification task.
8
Isaksson, Camilla. "HTML5-based Travel HabitApplication: Investigation of VectorWeb Mapping Possibilities." Thesis, KTH, Geodesi och geoinformatik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-126937.
Full textAbstract:
The subject of the report is to review and evaluate the potential for vector graphics in web maps. It ishoped that a web mapping only should display vector graphics. Compared to the traditional webmapping approach, that has raster tiles pre-rendered on the server side for each zoom level. Thedrawback with raster data is that it lacks in information content compared to vector data, which interms can contribute to a richer user interface. However, vector graphics, in comparison to raster datahave a complex data structure and are inefficient to handle such as raster data traditionally is managed.Thanks to new rendering techniques for vector graphics, such as by VML, SVG, but mainly throughthe canvas element, web maps can be improved since vector graphics can be drawn directly in theclient through the browser without the need to generate data on the server side and sent it to the client.By selecting three vector-based mobile mapping libraries that use HTML5, in particular the canvaselement, each library is examined and evaluated based on their ability to use vector graphics, bothperformance-wise, by randomly generating vector data on a map comprising of the world, but alsoaccording to a number of usability criteria. Thereafter, a mobile travel habit implementation isdeveloped based on one of the libraries that meets the criteria the best. The travel habit application isdesigned to register the user’s geographical movements and subsequently display the user’s completedtrip in terms of vector data on a map. The application is developed with the ASP.NET technique thatconsists of HTML, JavaScript and C# languages. Results show that each library is superior / comparesfavourably to the others for at least one of the assessment criteria. Based on the performance test forthe rendering of vector data, the Tile5 library performed best with a rendering time corresponding toapproximately half the time it took for the second best library Leaflet. However, since Tile5 indicatesdeficiencies in the documentation, Leaflet fits the overall established assessment criteria best and isselected for the implemented of the mobile application for travel habits. For future development, Tile5has the potential to become a useful and effective tool for vector web mapping and to compete withthe traditional mapping platforms that renders raster data.Motivet till rapporten är att granska och utvärdera möjligheterna för vektorgrafik i webbkartor,förhoppningen är att i en webbkarta endast visa vektorgrafik. Istället för på det traditionella sättet medraster data som genererats färdigt på server-sidan för varje zoom-nivå av kartan. Nackdelen medrasterdata är att den är fattig på information jämfört med vektordata, som i sin tur kan bidra till ettrikare användargränssnitt. Dock har vektorgrafik jämfört med rasterdata en komplex datastruktur ochär ineffektivt att hantera så som rasterdata traditionellt görs.Tack vare nya rittekniker för vektorgrafik, så som genom VML, SVG men främst via canvaselementet, kan webbkartor förbättras i och med att vektorgrafik kan ritas upp direkt genom browserutan att behöva generera data på server-sidan. Genom att välja ut tre vektor-baserade utvecklingsbibliotek som använder sig utav HTML5 och speciellt canvas elementet, så undersöks och utvärderasrespektive bibliotek utifrån deras möjlighet att använda vektorgrafik, både prestandamässigt, genomatt slumpmässigt generera vektor data på en karta omfattande av hela världen, men också utifrån ettantal användbarhetskriterier. Därefter utvecklas en test implementation, d.v.s. en applikation för resvanor,baserat på den utav biblioteken som uppfyller kriterierna bäst. Res-vane applikationen ärinriktad på att registrera användarens geografiska rörelser och kan sedan visa användarens genomfördaresa i form av vektordata på en karta. Applikationen är utvecklad med ASP.NET tekniken som bestårutav HTML, JavaScript och C# språken. Resultatet från den empiriska undersökningen visar attkartbiblioteken utmärker sig på förmånligt men på olika områden. Utifrån prestandatestet förrendering av vektordata, presterade Tile5 bibliotek bäst med en renderingstid motsvarande ungefärhäften av tiden det tog för det näst bästa biblioteket, Leaflet. Dock ledde bristande dokumentation förTile5 till att Leaflet, till det stora hela sett, passade bedömningskriterierna bäst och kom attimplementeras i den mobila test applikationen för resvanor. För framtida utvecklings, har Tile5potential att utvecklas till ett användbart och effektivt verktyg för vektorkartläggning och för attkonkurrera med traditionella webbkartor som renderar rasterdata.
9
Neteler, Markus [Verfasser]. "Spatio-temporal reconstruction of satellite-based temperature maps and their application to the prediction of tick and mosquito disease vector distribution in Northern Italy / Markus Georg Neteler." Hannover : Technische Informationsbibliothek und Universitätsbibliothek Hannover, 2010. http://d-nb.info/100506198X/34.
Full text
10
Erdas, Ozlem. "Modelling And Predicting Binding Affinity Of Pcp-like Compounds Using Machine Learning Methods." Master's thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/3/12608792/index.pdf.
Full textAbstract:
Machine learning methods have been promising tools in science and engineering fields. The use of these methods in chemistry and drug design has advanced after 1990s. In this study, molecular electrostatic potential (MEP) surfaces of PCP-like compounds are modelled and visualized in order to extract features which will be used in predicting binding affinity. In modelling, Cartesian coordinates of MEP surface points are mapped onto a spherical self-organizing map. Resulting maps are visualized by using values of electrostatic potential. These values also provide features for prediction system. Support vector machines and partial least squares method are used for predicting binding affinity of compounds, and results are compared.
11
Lehmann, Juliane [Verfasser], Dmitry [Akademischer Betreuer] Feichtner-Kozlov, and Jean-Marie [Akademischer Betreuer] Droz. "Selected topics in combinatorial topology and geometry : Nested set complexes, equivariant trisp closure maps, rigid Rips complexes, and vector space partitions / Juliane Lehmann. Gutachter: Dmitry Feichtner-Kozlov ; Jean-Marie Droz. Betreuer: Dmitry Feichtner-Kozlov." Bremen : Staats- und Universitätsbibliothek Bremen, 2011. http://d-nb.info/1071897667/34.
Full text
12
Costa, David Cavassana. "TRANSMISSÃO PROGRESSIVA DE MAPAS BASEADA EM GIS SERVICES." Universidade Federal do Maranhão, 2006. http://tedebc.ufma.br:8080/jspui/handle/tede/464.
Full textAbstract:
Made available in DSpace on 2016-08-17T14:53:16Z (GMT). No. of bitstreams: 1
David Cavassana.pdf: 893589 bytes, checksum: 3f41c9b2bbe82e8c81ee62e8eeb41a3b (MD5)
Previous issue date: 2006-12-01The Internet has created an good environment for the sharing of geospatial data. In this environment users can transfer, visualize, manipulate and interact with these data sets. This environment not only provides new opportunities for the utilization of geospatial data, but also introduces new problems that should be addressed in order to provide an efficient and effective use of these datasets. One of such problems is related to the use of these spatial datasets in low transfer rate environments, what often becomes an impediment for the publication of those data in the Internet, given the huge volume of data to be transmitted. This paper presents a progressive transmission algorithm for vector maps on the Web, which uses techniques based on the resolution of the client device with the aim of reducing the amount of transmitted data, sending the data incrementally, thus gradually increasing the level of map details. Scale-dependent transmission techniques are combined with simplification and progressive ones, in order to maximize the overall system performance in a Web GIS environment. Furthermore, an architecture based on Web services is presented, that implements the progressive transmission of maps and allows a greater flexibility in the use of this functionality and in the development of clients in different computing platforms.
A Internet criou um ambiente adequado para o compartilhamento de dados geoespaciais, permitindo aos usuários a transferência, visualização, manipulação e interação com esses dados. Esse ambiente não apenas fornece novas oportunidades na utilização dos dados espaciais, como também introduz novos problemas que devem ser resolvidos a fim de possibilitar a utilização eficiente e efetiva desses conjuntos de dados. Um desses problemas está relacionado com a utilização dos dados espaciais em ambientes com baixa velocidade de transmissão, o que, devido ao grande volume dos dados espaciais, torna-se um empecilho para a disponibilização desses dados na Internet. Este trabalho apresenta um algoritmo para transmissão progressiva de mapas vetoriais na Web, que utiliza técnicas baseadas na resolução do dispositivo cliente com o objetivo de reduzir a quantidade de dados transmitidos, enviando os dados aos poucos, aumentando gradativamente o nível de detalhes do mapa. São combinadas técnicas de transmissão progressiva, simplificação e transmissão dependente de escala, a fim de maximizar o desempenho do sistema no ambiente Web. Ademais, apresenta-se uma arquitetura baseada em serviços Web que implementa a transmissão progressiva de mapas e possibilita uma maior flexibilidade no uso desta funcionalidade e na construção de clientes em diferentes plataformas.
13
Tomasini, Jérôme. "Géométrie combinatoire des fractions rationnelles." Thesis, Angers, 2014. http://www.theses.fr/2014ANGE0032/document.
Full textAbstract:
Le but de cette thèse est d’étudier, à l’aide d’outils combinatoires simples, différentes structures géométriques construites à partir de l’action d’un polynôme ou d’une fraction rationnelle. Nous considérerons d’abord la structure de l'ensemble des solutions séparatrices d’un champ de vecteurs polynomial ou rationnel. Nous allons établir plusieurs modèles combinatoires de ces cartes planaires, ainsi qu’une formule fermée énumérant les différentes structures topologiques dans le cas polynomial. Puis nous parlerons de revêtements ramifiés de la sphère que nous modéliserons, via un objet combinatoire nommée carte équilibrée, à partir d’une idée originale de W.Thurston. Ce modèle nous permettra de démontrer (géométriquement) de nombreuses propriétés de ces objets, et d’offrir une nouvelle approche et de nouvelles perspectives au problème d’Hurwitz, qui reste encore aujourd’hui un problème ouvert. Et enfin nous aborderons le sujet de la dynamique holomorphe via les primitives majeures dont l’utilité est de permettre de paramétrer les systèmes dynamiques engendrés par l’itération de polynômes. Cette approche nous permettra de construire une bijection entre les suites de parking et les arbres de Cayley, ainsi que d’établir une formule fermée liée à l’énumération d’un certain type d’arbres relié à la fois aux primitives majeures et aux revêtements ramifiés polynomiauxThe main topic of this thesis is to study, thanks to simple combinatorial tools, various geometric structures coming from the action of a complex polynomial or a rational function on the sphere. The first structure concerns separatrix solutions of polynomial or rational vector fields. We will establish several combinatorial models of these planar maps, as well as a closed formula enumerating the different topological structures that arise in the polynomial settings. Then, we will focus on branched coverings of the sphere. We establish a combinatorial coding of these mappings using the concept of balanced maps, following an original idea of W. Thurston. This combinatorics allows us to prove (geometrically) several properties about branched coverings, and gives us a new approach and perspective to address the still open Hurwitz problem. Finally, we discuss a dynamical problem represented by primitive majors. The utility of these objects is to allow us to parameterize dynamical systems generated by the iterations of polynomials. This approach will enable us to construct a bijection between parking functions and Cayley trees, and to establish a closed formula enumerating a certain type of trees related to both primitive majors and polynomial branched coverings
14
Yoldas, Mine. "Predicting The Effect Of Hydrophobicity Surface On Binding Affinity Of Pcp-like Compounds Using Machine Learning Methods." Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613215/index.pdf.
Full textAbstract:
This study aims to predict the binding affinity of the PCP-like compounds by means of molecular hydrophobicity. Molecular hydrophobicity is an important property which affects the binding affinity of molecules. The values of molecular hydrophobicity of molecules are obtained on three-dimensional coordinate system. Our aim is to reduce the number of points on the hydrophobicity surface of the molecules. This is modeled by using self organizing maps (SOM) and k-means clustering. The feature sets obtained from SOM and k-means clustering
are used in order to predict binding affinity of molecules individually. Support vector regression and partial least squares regression are used for prediction.
15
Myburgh, Gerhard. "The impact of training set size and feature dimensionality on supervised object-based classification : a comparison of three classifiers." Thesis, Stellenbosch : Stellenbosch University, 2012. http://hdl.handle.net/10019.1/71655.
Full textAbstract:
Thesis (MSc)--Stellenbosch University, 2012.ENGLISH ABSTRACT: Supervised classifiers are commonly used in remote sensing to extract land cover information. They are, however, limited in their ability to cost-effectively produce sufficiently accurate land cover maps. Various factors affect the accuracy of supervised classifiers. Notably, the number of available training samples is known to significantly influence classifier performance and to obtain a sufficient number of samples is not always practical. The support vector machine (SVM) does perform well with a limited number of training samples. But little research has been done to evaluate SVM’s performance for geographical object-based image analysis (GEOBIA). GEOBIA also allows the easy integration of additional features into the classification process, a factor which may significantly influence classification accuracies. As such, two experiments were developed and implemented in this research. The first compared the performances of object-based SVM, maximum likelihood (ML) and nearest neighbour (NN) classifiers using varying training set sizes. The effect of feature dimensionality on classifier accuracy was investigated in the second experiment. A SPOT 5 subscene and a four-class classification scheme were used. For the first experiment, training set sizes ranging from 4-20 per land cover class were tested. The performance of all the classifiers improved significantly as the training set size was increased. The ML classifier performed poorly when few (<10 per class) training samples were used and the NN classifier performed poorly compared to SVM throughout the experiment. SVM was the superior classifier for all training set sizes although ML achieved competitive results for sets of 12 or more training samples per class. Training sets were kept constant (20 and 10 samples per class) for the second experiment while an increasing number of features (1 to 22) were included. SVM consistently produced superior classification results. SVM and NN were not significantly (negatively) affected by an increase in feature dimensionality, but ML’s ability to perform under conditions of large feature dimensionalities and few training areas was limited. Further investigations using a variety of imagery types, classification schemes and additional features; finding optimal combinations of training set size and number of features; and determining the effect of specific features should prove valuable in developing more costeffective ways to process large volumes of satellite imagery. KEYWORDS Supervised classification, land cover, support vector machine, nearest neighbour classification maximum likelihood classification, geographic object-based image analysis
AFRIKAANSE OPSOMMING: Gerigte klassifiseerders word gereeld aangewend in afstandswaarneming om inligting oor landdekking te onttrek. Sulke klassifiseerders het egter beperkte vermoëns om akkurate landdekkingskaarte koste-effektief te produseer. Verskeie faktore het ʼn uitwerking op die akkuraatheid van gerigte klassifiseerders. Dit is veral bekend dat die getal beskikbare opleidingseenhede ʼn beduidende invloed op klassifiseerderakkuraatheid het en dit is nie altyd prakties om voldoende getalle te bekom nie. Die steunvektormasjien (SVM) werk goed met beperkte getalle opleidingseenhede. Min navorsing is egter gedoen om SVM se verrigting vir geografiese objek-gebaseerde beeldanalise (GEOBIA) te evalueer. GEOBIA vergemaklik die integrasie van addisionele kenmerke in die klassifikasie proses, ʼn faktor wat klassifikasie akkuraathede aansienlik kan beïnvloed. Twee eksperimente is gevolglik ontwikkel en geïmplementeer in hierdie navorsing. Die eerste eksperiment het objekgebaseerde SVM, maksimum waarskynlikheids- (ML) en naaste naburige (NN) klassifiseerders se verrigtings met verskillende groottes van opleidingstelle vergelyk. Die effek van kenmerkdimensionaliteit is in die tweede eksperiment ondersoek. ʼn SPOT 5 subbeeld en ʼn vier-klas klassifikasieskema is aangewend. Opleidingstelgroottes van 4-20 per landdekkingsklas is in die eerste eksperiment getoets. Die verrigting van die klassifiseerders het beduidend met ʼn toename in die grootte van die opleidingstelle verbeter. ML het swak presteer wanneer min (<10 per klas) opleidingseenhede gebruik is en NN het, in vergelyking met SVM, deurgaans swak presteer. SVM het die beste presteer vir alle groottes van opleidingstelle alhoewel ML kompeterend was vir stelle van 12 of meer opleidingseenhede per klas. Die grootte van die opleidingstelle is konstant gehou (20 en 10 eenhede per klas) in die tweede eksperiment waarin ʼn toenemende getal kenmerke (1 tot 22) toegevoeg is. SVM het deurgaans beter klassifikasieresultate gelewer. SVM en NN was nie beduidend (negatief) beïnvloed deur ʼn toename in kenmerkdimensionaliteit nie, maar ML se vermoë om te presteer onder toestande van groot kenmerkdimensionaliteite en min opleidingsareas was beperk. Verdere ondersoeke met ʼn verskeidenheid beelde, klassifikasie skemas en addisionele kenmerke; die vind van optimale kombinasies van opleidingstelgrootte en getal kenmerke; en die bepaling van die effek van spesifieke kenmerke sal waardevol wees in die ontwikkelling van meer koste effektiewe metodes om groot volumes satellietbeelde te prosesseer. TREFWOORDE Gerigte klassifikasie, landdekking, steunvektormasjien, naaste naburige klassifikasie, maksimum waarskynlikheidsklassifikasie, geografiese objekgebaseerde beeldanalise
16
Pascual, Caro Xavier. "Modelling, monitoring and control of reverse somsis desalination plants using data-based techniques." Doctoral thesis, Universitat Rovira i Virgili, 2014. http://hdl.handle.net/10803/145387.
Full textAbstract:
This thesis presents two successful applications of data-driven models developed for a reverse osmosis desalination pilot plant. The Support Vector Regression (SVR) modeling approach for steady state operation of the reverse osmosis pilot plant M3 has performed better results than the commonly used first principle-based models. In the same way, the dynamic models have enabled the short-term prediction and simulation of the M3 plant behavior under non-steady state operation, with such a high accuracy that it makes the approach suitable for advanced reverse osmosis plant control algorithms, fault tolerant control and process optimization. In fact, SVR models have been proved to perform excellent results as part of a fault detection and isolation tool for the M3 plant. In addition, an alternative to SVR models which uses Self-Organizing Maps has been also demonstrated for fault detection and isolation, including a useful visual tool for the rapid fault detection during plant operation.Aquesta tesi presenta dues aplicacions de models basats en dades desenvolupades per a una planta pilot de dessalinització d’aigua mitjançant osmosi inversa. S’ha modelat l’operació estacionària de la planta M3 utilitzant Support Vector Regression (SVR), obtenint uns resultats millors que els dels models basats en primers principis. Així mateix, els models dinàmics han permès la simulació i la predicció a curt termini de l’M3 en condicions no estacionàries amb tal precisió que els fa idonis per a la seva aplicació en optimització de processos i algoritmes avançats de control. De fet, models SVR han estat utilitzats en un sistema de detecció i aïllament de fallades per a l’M3, obtenint excel•lents resultats. Addicionalment, també s’ha desenvolupat un sistema de detecció i aïllament de fallades alternatiu als models SVR que utilitza Self-Organizing-Maps i a més inclou una eina visual per a la ràpida detecció de fallades durant l’operació de la planta.
17
Schneider, Mauro Ulisses. "Emprego de comitê de máquinas para segmentação da íris." Universidade Presbiteriana Mackenzie, 2010. http://tede.mackenzie.br/jspui/handle/tede/1390.
Full textAbstract:
Made available in DSpace on 2016-03-15T19:37:30Z (GMT). No. of bitstreams: 1
Mauro Ulisses Schneider.pdf: 1455677 bytes, checksum: 6eba28391f8f6910fbf5457a57119bd3 (MD5)
Previous issue date: 2010-08-23Fundo Mackenzie de Pesquisa
The use of biometric systems has been widely stimulated by both the government and private entities to replace or improve traditional security systems. Biometric systems are becoming increasingly indispensable to protecting life and property, mainly due to its robustness, reliability, difficult to counterfeit and fast authentication. In real world applications, the devices for image acquisition and the environment are not always controlled and may under certain circumstances produce noisy images or with large variations in tonality, texture, geometry, hindering segmentation and consequently the authentication of the an individual. To deal effectively with such problems, this dissertation investigates the possibility of using committee machines combined with digital image processing techniques for iris segmentation. The components employed in the composition of the committee machines are support vector clustering, k-means and self organizing maps. In order to evaluate the performance of the tools developed in this dissertation, the experimental results obtained are compared with related works reported in the literature. Experiments on publicity available UBIRIS database indicate that committee machine can be successfully applied to the iris segmentation.
A utilização de sistemas biométricos vem sendo amplamente; incentivados pelo governo e entidades privadas a fim de substituir ou melhorar os sistemas de segurança tradicionais. Os sistemas biométricos são cada vez mais indispensáveis para proteger vidas e bens, sendo robustos, confiáveis, de difícil falsificação e rápida autenticação. Em aplicações de mundo real, os dispositivos de aquisição de imagem e o ambiente nem sempre são controlados, podendo em certas circunstâncias produzir imagens ruidosas ou com grandes variações na tonalidade, textura, geometria, dificultando a sua segmentação e por conseqüência a autenticação do indivíduo. Para lidar eficazmente com tais problemas, nesta dissertação é estudado o emprego de comitês de máquinas em conjunto com técnicas de processamento de imagens digitais para a segmentação da íris. Os componentes estudados na composição do comitê de máquinas são agrupamento por vetores-suporte, k-means e mapas auto- organizáveis. Para a avaliação do desempenho das ferramentas desenvolvidas neste trabalho, os resultados obtidos são comparados com trabalhos relacionados na literatura. Foi utilizada a base de dados pública UBIRIS disponível na internet.
18
Juozulynaitė, Gintarė. "Pareto atsitiktinių dydžių geometrinis maks stabilumas." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2010. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100830_094813-81556.
Full textAbstract:
Šiame darbe nagrinėjau vienmačių ir dvimačių Pareto atsitiktinių dydžių geometrinį maks stabilumą. Įrodžiau, kad vienmatis Pareto skirstinys yra geometriškai maks stabilus, kai alfa=1. Tačiau nėra geometriškai maks stabilus, kai alfa nelygu 1. Naudodamasi geometrinio maks stabilumo kriterijumi dvimačiams Pareto atsitiktiniams dydžiams, įrodžiau, kad dvimatė Pareto skirstinio funkcija nėra geometriškai maks stabili, kai vektoriaus komponentės nepriklausomos (kai alfa=1, beta=1 ir alfa nelygu 1, beta nelygu 1). Taip pat dvimatė Pareto skirstinio funkcija nėra geometriškai maks stabili, kai vektoriaus komponentės priklausomos (kai alfa=1, beta=1 ir alfa nelygu 1, beta nelygu 1). Dvimačių Pareto skirstinių tyrimas pateikė nelauktus rezultatus. Gauta, kad dvimatė Pareto skirstinio funkcija nėra geometriškai maks stabili, kai alfa=1, beta=1. Tačiau vienmatės marginaliosios Pareto skirstinio funkcijos yra geometriškai maks stabilios, kai alfa=1, beta=1.In this work I analyzed geometric max stability of univariate and bivariate Pareto random variables. I have proved, that univariate Pareto distribution is geometrically max stable when alpha=1. But it is not geometrically max stable when alpha unequal 1. Using the criterion of geometric max stability for bivariate Pareto random variables, I have proved, that bivariate Pareto distribution function is not geometrically max stable, when vectors’ components are independent (when alpha=1, beta=1 and alpha unequal 1, beta unequal 1). Also bivariate Pareto distribution function is not geometrically max stable, when vectors’ components are dependent (when alpha=1, beta=1 and alpha unequal 1, beta unequal 1). Research of bivariate Pareto distributions submitted unexpected results. Bivariate Pareto distribution function is not geometrically max stable, when alpha=1, beta=1. But marginal Pareto distribution functions are geometrically max stable, when alpha=1, beta=1.
19
Maisikeli, Sayyed Garba. "Aspect Mining Using Self-Organizing Maps With Method Level Dynamic Software Metrics as Input Vectors." NSUWorks, 2009. http://nsuworks.nova.edu/gscis_etd/226.
Full textAbstract:
As the size and sophistication of modern software system increases, so is the need for high quality software that is easy to scale and maintain. Software systems evolve and undergo change over time. Unstructured software updates and refinements can lead to code scattering and tangling which are the main symptoms of crosscutting concerns. Presence of crosscutting concerns in a software system can lead to bloated and inefficient software system that is difficult to evolve, hard to analyze, difficult to reuse and costly to maintain.
A crosscutting concern in a software system represents implementation of a unique idea or a functionality that could not be properly encapsulated. The presence of crosscutting concerns in software systems is attributed to the limitations of programming languages and structural degradation associated with repeated change. No matter how well large-scale software applications are decomposed, some ideas are difficult to modularize and encapsulate resulting in crosscutting concerns scattered across the entire software system where code implementing one concept is tangled and mixed with code implementing unrelated concept.
Aspect Mining is a reverse software engineering exploration technique that is concerned with the development of concepts, principles, methods and tools supporting the identification and extraction of re-factorable aspect candidates in legacy software systems. The main goal of Aspect Mining is to help software engineers and developers to locate and identify crosscutting concerns and portions of the software that may need refactoring, with the aim of improving the quality, scalability and maintainability and evolution of software system.
The aspect mining approach presented in this dissertation involved three-phases. In the first phase, selected large-scale legacy benchmark test programs were dynamically traced and investigated. Metrics representing interaction between code fragments were derived from the collected data. In the second phase, the formulated dynamic metrics were then submitted as input to Self Organizing Maps (SOMs) for clustering. In the third phase, clusters produced by the SOM were then mapped against the benchmark test program in order to identify code scattering and tangling symptoms. Crosscutting concerns were identified and candidate aspect seeds mined.
Overall, the methodology used in this dissertation is found to perform as well as and no worse than other existing Aspect Mining methodologies. In other cases, the methodology used in this dissertation was found to have outperformed some of the existing Aspect mining methods that use the same set of benchmark test programs. With regards to Aspect Mining precision as it relates to LDA, 100% precision was attained, and with respect to JHD 51% precision was attained by this dissertation methodology, which is the same as attained by existing Aspect mining methods. Lessons learned from the results of experiments carried out in this dissertation have shown that even highly structured software systems that are based on best practice software design principles are laden with code repetitions and presence of crosscutting concerns.
One of the major contributions of this dissertation is the presentation of a new unsupervised Aspect Mining approach that minimizes human interaction, where hidden software features can be identified and inferences about the general structure of software system can be made, thereby addressing one of the drawbacks in currently existing dynamic Aspect Mining methodologies. The strength of the Aspect Mining approach presented in this dissertation is that the input metrics required to represent software code fragments can easily be derived from other viable software metric formulations without complex formalisms.
Other contributions made by this dissertation include the presentation of a good and viable software visualization technique that can be used for software visualization, exploration, and study and understanding of internal structure and behavioral nature of large-scale software systems. Areas that may need further study include the need for determining the optimal number of vector components that may be required to effectively represent extractible software components. Other issues worth considering include the establishment of a set of datasets derived from popularly known test benchmarks that can be used as a common standard for comparison, evaluation and validation of newly introduced Aspect Mining techniques.
20
Rajnoha, Milan. "Geodynamická mapa Moravy a okolí." Master's thesis, Vysoké učení technické v Brně. Fakulta stavební, 2013. http://www.nusl.cz/ntk/nusl-226368.
Full textAbstract:
Result of this graduation theses is Geodynamic map of Moravia in scale 1:500 000. There were used available data from GPS measurements, seismic, geomorphologic and other data to construct map. Map is worked in GIS software. On the backround of researched data, there are determinated some locations, which are characterized by recent tectonic activity. These are analyzed for more detail.
21
Branco, Lucas Magalhães Pereira Castello 1988. "Mapas momento em teoria de calibre." [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306010.
Full textAbstract:
Orientador: Marcos Benevenuto JardimDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica
Made available in DSpace on 2018-08-22T22:29:57Z (GMT). No. of bitstreams: 1 Branco_LucasMagalhaesPereiraCastello_M.pdf: 1981391 bytes, checksum: 7ecd7674514f634b8bb527c0bcab1a06 (MD5) Previous issue date: 2013
Resumo: Neste trabalho os aspectos básicos da teoria de calibre são abordados, incluindo as noções de conexão e curvatura em fibrados principais e vetoriais, considerações sobre o grupo de transformações de calibre e o espaço de moduli de soluções para a equação anti-auto-dual em dimensão quatro (o espaço de moduli de instantons). Posteriormente, mapas momento e redução são introduzidos. Primeiramente, no contexto clássico de geometria simplética e depois no contexto de geometria hyperkähler. Por fim, são apresentadas aplicações da teoria de mapas momento e redução em teoria de calibre. As equações ADHM são introduzidas e mostra se que estas podem ser dadas como o conjunto de zeros de um mapa momento hyperkähler. Além disso, considerações são feitas acerca da construção ADHM de instantons, que relaciona soluções dessas equações com as soluções da equação de anti-auto-dualidade. O espaço de moduli de conexões planas é também abordado. Neste caso, a curvatura é vista como um mapa momento e os cálculos podem ser generalizados para o espaço de moduli de conexões planas sobre variedades Kähler de dimensões mais altas e para o espaço de moduli de instantons sobre variedades hyperkähler de dimensão quatro
Abstract: In this work it is developed the basic concepts of gauge theory, including the notions of connections and curvature on principal bundles and vector bundles, considerations on the group of gauge transformations and the moduli space of anti-self-dual connections in dimension four (the instanton moduli space). After, moment maps and reduction are introduced. First in the classical context of symplectic geometry, then in hyperkähler geometry. At last, applications to the theory of moment maps and reduction in gauge theory are given. The ADHM equations are introduced and it is shown that solutions to these equations can be given by the zeros of a hyperkähler moment map. Furthermore, the ADHM construction, that relates the ADHM equations to instanton solutions, is discussed. The moduli space of flat connections over a Riemann surface is also treated. In this case, the curvature is seen as a moment map and the calculations can be generalized to flat connections over higher-dimensional Kähler manifolds and to the instanton moduli space over four dimensional hyperkähler manifolds
Mestrado
Matematica
Mestre em Matemática
22
Silva, Júnior Vamilson Prudêncio da. "Potencial da linguagem SVG Scalable Vector Graphic para visualização de dados espaciais na internet." Florianópolis, SC, 2004. http://repositorio.ufsc.br/xmlui/handle/123456789/87447.
Full textAbstract:
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia Civil.Made available in DSpace on 2012-10-21T20:15:32Z (GMT). No. of bitstreams: 1 214402.pdf: 2811344 bytes, checksum: cedae089e1e0461a7d48d736ff61923d (MD5)
A expansão da Internet propiciou um meio para divulgação de informações com grande penetração em todo o mundo. Paralelamente, o impacto da informática sobre a cartografia causou surgimento de novas técnicas e recursos que potencializaram seu uso. Até recentemente os mapas digitais encontrados na Internet eram apresentados como imagens matriciais, com pouca ou nenhuma interatividade com o usuário, limitando-se a exibir o mapa na tela do computador. O surgimento da linguagem XML (extensible Markup Language) trouxe novas possibilidades para publicação de mapas na Internet, em função de sua capacidade de manipular dados gráficos. Este trabalho procura explorar o potencial da linguagem SVG, que é baseada em XML, para publicação de mapas no ambiente da Internet, apresentando ferramentas como um alternativa para qualquer instituição que necessite divulgar informações espaciais de maneira simplificada, sem necessariamente usar banco de dados ou servidor de mapas. Primeiramente faz-se uma abordagem teórica sobre disseminação dos dados espaciais na Internet e as linguagens de marcação envolvidas, mostrando suas principais características. Depois o trabalho aborda aspectos da seleção de mapas para publicação, a sua transformação para o formato SVG, implementação de JavaScripts nos arquivos para proporcionar interatividade e finalmente apresenta dois protótipos para montagem de uma página contendo o mapa e ferramentas para interação. Os protótipos foram projetados para casos onde os atributos e complexidade dos mapas é relativamente reduzida, dispensando a necessidade de um servidor de mapas. A linguagem SVG mostra-se promissora para apresentação de mapas na Internet devido a sua flexibilidade e grande capacidade de interação com o usuário, além de mostrar uma clara tendência de se tornar uma linguagem padrão nos próximos anos. O maior problema encontrado reside na necessidade de instalação de "plug-in" no navegador de Internet para visualização dos gráficos nesse formato.
23
Kurdej, Marek. "Exploitation of map data for the perception of intelligent vehicles." Thesis, Compiègne, 2015. http://www.theses.fr/2015COMP2174/document.
Full textAbstract:
La plupart des logiciels contrôlant les véhicules intelligents traite de la compréhension de la scène. De nombreuses méthodes existent actuellement pour percevoir les obstacles de façon automatique. La majorité d’entre elles emploie ainsi les capteurs extéroceptifs comme des caméras ou des lidars. Cette thèse porte sur les domaines de la robotique et de la fusion d’information et s’intéresse aux systèmes d’information géographique. Nous étudions ainsi l’utilité d’ajouter des cartes numériques, qui cartographient le milieu urbain dans lequel évolue le véhicule, en tant que capteur virtuel améliorant les résultats de perception. Les cartes contiennent en effet une quantité phénoménale d’information sur l’environnement : sa géométrie, sa topologie ainsi que d’autres informations contextuelles. Dans nos travaux, nous avons extrait la géométrie des routes et des modèles de bâtiments afin de déduire le contexte et les caractéristiques de chaque objet détecté. Notre méthode se base sur une extension de grilles d’occupations : les grilles de perception crédibilistes. Elle permet de modéliser explicitement les incertitudes liées aux données de cartes et de capteurs. Elle présente également l’avantage de représenter de façon uniforme les données provenant de différentes sources : lidar, caméra ou cartes. Les cartes sont traitées de la même façon que les capteurs physiques. Cette démarche permet d’ajouter les informations géographiques sans pour autant leur donner trop d’importance, ce qui est essentiel en présence d’erreurs. Dans notre approche, le résultat de la fusion d’information contenu dans une grille de perception est utilisé pour prédire l’état de l’environnement à l’instant suivant. Le fait d’estimer les caractéristiques des éléments dynamiques ne satisfait donc plus l’hypothèse du monde statique. Par conséquent, il est nécessaire d’ajuster le niveau de certitude attribué à ces informations. Nous y parvenons en appliquant l’affaiblissement temporel. Étant donné que les méthodes existantes n’étaient pas adaptées à cette application, nous proposons une famille d’opérateurs d’affaiblissement prenant en compte le type d’information traitée. Les algorithmes étudiés ont été validés par des tests sur des données réelles. Nous avons donc développé des prototypes en Matlab et des logiciels en C++ basés sur la plate-forme Pacpus. Grâce à eux nous présentons les résultats des expériences effectués en conditions réellesThis thesis is situated in the domains of robotics and data fusion, and concerns geographic information systems. We study the utility of adding digital maps, which model the urban environment in which the vehicle evolves, as a virtual sensor improving the perception results. Indeed, the maps contain a phenomenal quantity of information about the environment : its geometry, topology and additional contextual information. In this work, we extract road surface geometry and building models in order to deduce the context and the characteristics of each detected object. Our method is based on an extension of occupancy grids : the evidential perception grids. It permits to model explicitly the uncertainty related to the map and sensor data. By this means, the approach presents also the advantage of representing homogeneously the data originating from various sources : lidar, camera or maps. The maps are handled on equal terms with the physical sensors. This approach allows us to add geographic information without imputing unduly importance to it, which is essential in presence of errors. In our approach, the information fusion result, stored in a perception grid, is used to predict the stateof environment on the next instant. The fact of estimating the characteristics of dynamic elements does not satisfy the hypothesis of static world. Therefore, it is necessary to adjust the level of certainty attributed to these pieces of information. We do so by applying the temporal discounting. Due to the fact that existing methods are not well suited for this application, we propose a family of discoun toperators that take into account the type of handled information. The studied algorithms have been validated through tests on real data. We have thus developed the prototypes in Matlab and the C++ software based on Pacpus framework. Thanks to them, we present the results of experiments performed in real conditions
24
Gwynn, Xander Peter. "Assessment of remote data capture systems for the characterisation of rock fracture networks within slopes." Thesis, University of Exeter, 2009. http://hdl.handle.net/10036/104498.
Full textAbstract:
The use of remote techniques to capture the geometrical characteristics of rock masses has seen increased use and development in recent years. Apart from the obvious improved Health and Safety aspects, remote techniques allow rapid collection of digital data that can be subsequently analysed to provide input parameters for a variety of geomechanical applications. Remote data capture is a new technique used to collect geotechnical data and little independent work has been done concerning the comparative limitations and benefits of photogrammetry and laser scanning. Photogrammetry and laser scanning produce three dimensional digital representations of a studied rock face which can then be mapped for geotechnical data using specialist software. Research conducted at Camborne School of Mines, University of Exeter has focussed on developing robust and flexible methodologies for remote data capture techniques, namely photogrammetry and laser scanning. Geotechnical characterisation for photogrammetry was tested using the CSIRO Sirovision software and laser scanning was used with SplitFX from Split Engineering. A comparative method of assessing the error between orientation measurements was developed based on calculating the pole vector difference between remotely captured and traditionally hand-mapped data. This allowed for testing of the benefits of the remote data capture systems and limitations whilst comparing them with conventional hand-mapping. The thesis also describes the results of detailed comparisons between hand-mapping, photogrammetric and laser scanned data collection for discontinuity orientation, roughness, discontinuity trace lengths and potential end-use applications. During fieldwork in Cornwall, Brighton Cliffs and northern France it was found that remote data capture techniques struggled to collect orientation data from intensely fractured rock masses where features are primarily represented as discontinuity traces. It was found that both photogrammetry and laser scanning produce orientation data comparable to traditionally mapped data, with an average pole vector difference less than 12° from data mapped from the Tremough Campus road cutting to the University of Exeter’s Cornwall Campus. Set analysis on 151 comparable data points yielded a maximum set pole vector difference of 9.8°, where the closest difference was 2.24°. Testing the accuracy of discontinuity trace orientations captured by photogrammetry using the pole vector difference methods indicate that planar derived orientations are more accurate, with an average difference of 16.67° compared to 37.72°. This thesis contains the reviews and analyses of photogrammetry and laser scanning for use in characterising natural and manmade rock slopes. Improved field and post-processing methodologies have been developed to aid the safe, efficient and suitable geotechnical characterisation of rock fracture networks. The continual development and use of remote mapping techniques, whilst supplementing their unique qualities with traditional mapping, have the capability to revolutionise rock mass mapping. Particular development needed is the implementation of ISRM guidelines to standardise photogrammetric and laser scanning fieldwork and post-processing data analysis.
25
Marcantonio, Laurence Mark. "Unquenched lattice upsilon spectroscopy." Thesis, University of Glasgow, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.341965.
Full text
26
Zhou, Bin. "Computational Analysis of LC-MS/MS Data for Metabolite Identification." Thesis, Virginia Tech, 2011. http://hdl.handle.net/10919/36109.
Full textAbstract:
Metabolomics aims at the detection and quantitation of metabolites within a biological system. As the most direct representation of phenotypic changes, metabolomics is an important component in system biology research. Recent development on high-resolution, high-accuracy mass spectrometers enables the simultaneous study of hundreds or even thousands of metabolites in one experiment. Liquid chromatography-mass spectrometry (LC-MS) is a commonly used instrument for metabolomic studies due to its high sensitivity and broad coverage of metabolome.
However, the identification of metabolites remains a bottle-neck for current metabolomic studies. This thesis focuses on utilizing computational approaches to improve the accuracy and efficiency for metabolite identification in LC-MS/MS-based metabolomic studies. First, an outlier screening approach is developed to identify those LC-MS runs with low analytical quality, so they will not adversely affect the identification of metabolites. The approach is computationally simple but effective, and does not depend on any preprocessing approach. Second, an integrated computational framework is proposed and implemented to improve the accuracy of metabolite identification and prioritize the multiple putative identifications of one peak in LC-MS data. Through the framework, peaks are likely to have the m/z values that can give appropriate putative identifications. And important guidance for the metabolite verification is provided by prioritizing the putative identifications. Third, an MS/MS
spectral matching algorithm is proposed based on support vector machine classification. The approach provides an improved retrieval performance in spectral matching, especially in the presence of data heterogeneity due to different instruments or experimental settings used during the MS/MS spectra acquisition.Master of Science
27
Sypert, Robert Hall. "Diagnosis of Loblolly Pine (Pinus taeda L.) Nutrient Deficiencies by Foliar Methods." Thesis, Virginia Tech, 2006. http://hdl.handle.net/10919/34849.
Full textAbstract:
Quick identification of loblolly pine nutrient deficiencies has troubled foresters who wish to increase productivity through fertilization. In the past, extensive field trials were established that did not allow for quick identification of a large number of possibly limiting nutrients in individual stands. This study used single-tree fertilization with macro-nutrients (N, P, K, Ca, Mg, S) and micro-nutrients (Mn, Zn, B, Cu, Fe, Mo) to identify deficiencies using foliar techniques in one growing season. Four study sites in TX, AL, GA, and SC were established in loblolly pine plantations at or near canopy closure. Nutrient concentrations relative to the critical level, optimal nutrient ratios, DRIS methodology, vector analysis, and changes in individual fascicle and total current year foliage weight/area were used to identify deficiencies. Phosphorus was repeatedly indicated as most limiting growth at TX while K was implicated at SC. The GA site revealed multiple deficiencies including N, K, and S. The AL site revealed only a very suspect B deficiency. Critical level methodology was effective in identifying deficiencies of N, P, and K, while B, S, and Cu appeared to be available at sufficient quantities when concentrations were below the published critical levels. Concentrations of S were especially below the critical levels and not increased by fertilization indicating that the critical levels were too high. Nutrient ratio interpretability was reduced by luxury uptake of N in comparison to other deficient nutrients. DRIS methodology was hampered by the inability to create effective comparative norms. Deficiency detection with vector analysis created problems when B and Mn displayed greater uptake relative to controls than the macro-nutrients that provided relative foliage mass increases. Resulting diagnosis indicated deficiencies when B and Mn were really taken up as luxury consumption. Vector analysis may not be as effective as its individual parts. Foliage weight/area responses detected fewer deficiencies than the other techniques. No significant foliar responses were seen at the TX or AL sites. However, K at the SC site was identified as deficient by all foliage mass variables, and multiple deficiencies were detectable at the GA site.Master of Science
28
Restrepo, Ana Catalina. "Analysis of storm surge impacts on transportation systems in the Georgia coastal area." Thesis, Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42897.
Full textAbstract:
Many Climate Scientists believe that global warming will produce more extreme weather events such as tropical storms, hurricanes, intense rainfall, and flooding. These events are considered to be the most catastrophic natural events for transportation systems especially in coastal areas. Due to the severe damage from storm surge and flooding. Evaluating the magnitude of possible storm surges and their impacts on transportation systems in coastal areas is fundamental to developing adaptation plans and impact assessments to mitigate the damage.
This thesis focuses on existing transportation systems in the Georgia coastal area that could be affected by several storm surges. An existing storm surge model is used to estimate the storm surges and the surge heights based on the category, direction, and forward speed of a storm. The ground elevation of the ports, interstates, state roads, railroads, and the principal airports on the Georgia coast are identified through a GIS analysis using the national elevation data set. Having the storm surge elevation and the elevation of the existing infrastructure, a GIS study is performed to identify those parts of the transportation system that will be affected by each type of storm giving results such as the length or sections of transportation assets under or above the surge elevation. A literature review of storm surge, rising sea levels, and their impacts on coastal bridges, roads, airports, ports, and railroads is presented in the thesis. Also, a description of the software used to analyze and estimate the impacts of climate change on transportation systems is described.
29
Hamisi, Jonathan. "Defining The Geochemical Footprint For Gold Mineralisation Around Birthday Reef.Reefton Goldfield, New Zealand." Thesis, Stockholms universitet, Institutionen för geologiska vetenskaper, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-132115.
Full textAbstract:
Abstract Orogenic gold deposits from the Reefton goldfield in New Zealand hosted in Ordovician metasediments of the Greenland group have produce 67 tons of gold before 1951. The Blackwater mine in Waiuta account for about 1/3 of the gold production at Reefton prior 1951. The ore system at Blackwater consist of NE trending steeply dipping gold-bearing quartz veins (Birthday reef) occurring in faulted, sheared and folded alternating sequence of sandstone-mudstone metamorphosed to low greenschist facies and hydrothermally altered proximal to distal from the quartz vein. Host rock and ore forming fluids interaction resulted in a systematic change in the mineralogy and geochemistry of the wallrock developing a distinctive footprint of the ore system. The mineral assemblage subsequent to hydrothermal alteration is formed by quartz veining, chlorite, carbonates (minor calcite-dolomite-ankerite-siderite), albite, K-Mica and composite quartz-carbonate veining, carbonates spotting, pyrite, arsenopyrite, chalcopyrite, cobaltite, galena and in a lesser extent ullmannite, gersdorffite, pentlandite, millerite and sphalerite. Mass balance calculation based on geochemical data obtained by ultra-low detection analysis with a detection limit in part per trillion of Au, As and Sb provide new insight in the geochemical footprint of the ore system at Blackwater. A clear zone of roughly 40 meters (20 meters above and below the birthday reef) is enriched in Au, As and Sb up to respectively 6806%, 605% and 891% compared to the un-mineralised protolith. Furthermore, mass changes in K2O and Na2O indicate a consistent decrease in Na and increase in K in the vicinity of the Birthday reef reflecting the replacement of albite by K-mica. This is corroborated by pattern of alkali alteration index Na/Al for albite and 3K/Al for K-Mica showing similar trend. Carbonation and de/-hydration index also exhibits peaks in samples adjacent to the Birthday reef, though carbonation index is also influenced by carbonates content in the protolith or late carbonation that may not related to gold mineralisation. Using the indicators above-mentioned it is possible to define the mineralogical and geochemical “footprint” for the ore system in the host rock allowing to use this footprint as a tool for mineral exploration for orogenic gold deposits similar to Blackwater. Given that the geochemical footprint of orogenic gold deposit such as Blackwater is significantly wider than the economically viable part of the deposit defining the footprint of the ore system offers the potential for vectoring from sub-economic mineralisation towards higher-grade ore that is economically viable.
30
Vervier, Kevin. "Méthodes d’apprentissage structuré pour la microbiologie : spectrométrie de masse et séquençage haut-débit." Thesis, Paris, ENMP, 2015. http://www.theses.fr/2015ENMP0081/document.
Full textAbstract:
L'utilisation des technologies haut débit est en train de changer aussi bien les pratiques que le paysage scientifique en microbiologie. D'une part la spectrométrie de masse a d'ores et déjà fait son entrée avec succès dans les laboratoires de microbiologie clinique. D'autre part, l'avancée spectaculaire des technologies de séquençage au cours des dix dernières années permet désormais à moindre coût et dans un temps raisonnable de caractériser la diversité microbienne au sein d'échantillons cliniques complexes. Aussi ces deux technologies sont pressenties comme les piliers de futures solutions de diagnostic. L'objectif de cette thèse est de développer des méthodes d'apprentissage statistique innovantes et versatiles pour exploiter les données fournies par ces technologies haut-débit dans le domaine du diagnostic in vitro en microbiologie. Le domaine de l'apprentissage statistique fait partie intégrante des problématiques mentionnées ci-dessus, au travers notamment des questions de classification d'un spectre de masse ou d'un “read” de séquençage haut-débit dans une taxonomie bactérienne.Sur le plan méthodologique, ces données nécessitent des développements spécifiques afin de tirer au mieux avantage de leur structuration inhérente: une structuration en “entrée” lorsque l'on réalise une prédiction à partir d'un “read” de séquençage caractérisé par sa composition en nucléotides, et un structuration en “sortie” lorsque l'on veut associer un spectre de masse ou d'un “read” de séquençage à une structure hiérarchique de taxonomie bactérienneUsing high-throughput technologies is changing scientific practices and landscape in microbiology. On one hand, mass spectrometry is already used in clinical microbiology laboratories. On the other hand, the last ten years dramatic progress in sequencing technologies allows cheap and fast characterization of microbial diversity in complex clinical samples. Consequently, the two technologies are approached in future diagnostics solutions. This thesis aims to play a part in new in vitro diagnostics (IVD) systems based on high-throughput technologies, like mass spectrometry or next generation sequencing, and their applications in microbiology.Because of the volume of data generated by these new technologies and the complexity of measured parameters, we develop innovative and versatile statistical learning methods for applications in IVD and microbiology. Statistical learning field is well-suited for tasks relying on high-dimensional raw data that can hardly be used by medical experts, like mass-spectrum classification or affecting a sequencing read to the right organism. Here, we propose to use additional known structures in order to improve quality of the answer. For instance, we convert a sequencing read (raw data) into a vector in a nucleotide composition space and use it as a structuredinput for machine learning approaches. We also add prior information related to the hierarchical structure that organizes the reachable micro-organisms (structured output)
31
Sharkey, Kieran James. "An investigation of the running coupling and meson masses in lattice QCD." Thesis, University of Liverpool, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.343926.
Full text
32
Moreira, Mirley Ribeiro. "Atlas multimídia sobre movimentos de massa na serra do Mar paulista : município de Cubatão/SP /." Rio Claro : [s.n.], 2008. http://hdl.handle.net/11449/102883.
Full textAbstract:
Resumo: Os movimentos de massa na Serra do Mar são alvos de muito interesse e estudo devido à alta incidência e aos conseqüentes impactos ambientais e econômicos. Portanto, reunir várias informações sobre movimentos de massa, e disponibilizá-los como um produto de fácil aquisição e de navegabilidade para o conhecimento de alunos de graduação, é o desafio desse trabalho. Como área de aplicação, escolheu-se o município de Cubatão, pela significativa incidência de escorregamentos e pela importância da região no contexto nacional, frente a aspectos econômicos e ambientais. Desta forma, o objetivo principal é produzir um Atlas Multimídia sobre os processos de movimentos de massa, como contribuição ao ensino de graduação, nas áreas de Ciências da Terra e Engenharia e avaliar a aplicabilidade da linguagem SVG (Scalable Vectorial Graphics) na produção de mapas interativos. Foi efetuada uma consulta a docentes e alunos da área de Ciências da Terra, sobre o interesse na utilização de material didático multimídia como apoio ao ensino e aprendizado e os resultados obtidos mostraram o claro interesse deste público no desenvolvimento do material .O Atlas interativo elaborado, voltado especificamente a escorregamentos, usando interfaces gráficas na linguagem SVG,mostrou que é possível a publicação de aplicações cartográficas interativas utilizando o SVG. Acredita-se que a utilização deste tipo de material como apoio ao ensino e aprendizado seja uma tendência crescente, impulsionada pelos avanços tecnológicos e pela forte inserção da informática em todos os setores de atividade. Inseridos neste contexto, os atuais alunos, desde muito cedo, vivem a informática nos seus cotidianos e a inserção destes recursos em sala de aula torna os cursos mais atrativos para este público.Abstract: Mass movements of Serra do Mar are the subject of much interest and study due to high incidence, the consequent environmental and economic impacts. For these reasons, to get some information about mass movements and make them available as a product of easy acquisition and navigability for the knowledge of undergraduate students, it is the challenge of this work. The study area was the Cubatão city by the significant incidence of slip and the importance of the region in the national context, in face of economic and environmental aspects. Thus, the main goal is to produce an Atlas Multimedia about processes of mass movements, to contribute to the education of undergraduate students in Earth Sciences and Engineering areas and evaluate the applicability of the SVG (Scalable Vectorial Graphics) language in the production of interactive maps. It was done a questionnaire for the purpose of gathering information from teachers and students in Earth Sciences area, about the interest in the use of multimedia educational materials to support teaching and learning. The results showed clear interest of the public in developing the material. The Interactive Atlas prepared, specifically to landslide, using graphical interfaces in the SVG language, showed that it is possible to publish interactive mapping applications using SVG. It was believed that the use of such material to support teaching and learning is a growing trend, driven by technological advances and the strong integration of computer science technology in all sectors of this activity. In this context, the current students, from an early age, living in their everyday computing and the integration of these resources in the classroom make the courses more appealing to the public.
Orientador: Paulina Setti Riedel
Coorientador: Cristhiane da Silva Ramos
Banca: Teresa Galloti Florenzano
Banca: Diana Sarita Hamburger
Banca: Rosângela Doin de Almeida
Banca: Paulo Milton Barbosa Landim
Possui anexo 1 CD_ROM com o título: Atlas multimídia sobre movimentos de massa na sera do Mar paulista: município de Cubatão/SP
Doutor
33
Souza, Luis Gustavo Mota. "Modelos lineares locais para identificaÃÃo de sistemas dinÃmicos usando redes neurais competitivas." Universidade Federal do CearÃ, 2012. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=7267.
Full textAbstract:
nÃo hÃNesta tese aborda-se o problema de identificaÃÃo de sistemas dinÃmicos sobre a Ãtica dos modelos locais, em que o espaÃo de entrada à particionado em regiÃes de operaÃÃo menores sobre as quais sÃo construÃdos modelos de menor complexidade (em geral, lineares). Este tipo de modelo à uma alternativa aos chamados modelos globais em que a dinÃmica do sistema à identificada usando-se uma Ãnica estrutura (em geral, nÃo-linear) que cobre todo o espaÃo de entrada. Assim, o tema alvo desta tese à o projeto de modelos lineares locais cujo espaÃo de entrada à particionado por meio do uso de algoritmos de quantizaÃÃo vetorial, principalmente aqueles baseados em redes neurais competitivas. Para este fim, sÃo propostos trÃs novos modelos lineares locais baseados na rede SOM (self-organizing map), que sÃo avaliados na tarefa de identificaÃÃo do modelo inverso de quatro sistemas dinÃmicos comumente usados na literatura em benchmarks de desempenhos. Os modelos propostos sÃo tambÃm comparados com modelos globais baseados nas redes MLP (multilayer perceptron) e ELM (extreme learning machines), bem como com outros modelos lineares locais, tais como o modelo fuzzy Takagi-Sugeno e o modelo neural LLM (local linear mapping). Um amplo estudo à realizado visando comparar os desempenhos de todos os modelos supracitados segundo trÃs critÃrios de avaliaÃÃo, a saber: (i) erro mÃdio quadrÃtico normalizado, (ii) anÃlise dos resÃduos, e (iii) teste estatÃstico de Kolmogorov-Smirnov. De particular interesse para esta tese, à a avaliaÃÃo da robustez dos modelos locais propostos com relaÃÃo ao algoritmo de quantizaÃÃo vetorial usado no treinamento do modelo. Os resultados obtidos indicam que os desempenhos dos modelos locais propostos sÃo superiores aos dos modelos globais baseados na rede MLP e equivalentes aos modelos globais baseados na rede ELM.
In this thesis the problem of nonlinear system identification is approached from the viewpoint of local models. The input space is partitioned into smaller operational regions with lower complexity models (usually linear) built for each one. This type of model is an alternative to global models, for which the system dynamics is identified using a single structure (usually nonlinear ones) that covers the whole input space. The aim of this thesis is to design of local linear models whose input space is partitioned by means of vector quantization algorithms, special those based on competitive learning neural networks. For this purpose, three novel local linear modeling methods based on the SOM (self-organizing map) are introduced and evaluated on the identification of the inverse model of four dynamical systems commonly used in the literature for performance benchmarking. The proposed models are also compared with global models based on the MLP (multilayer perceptron) and ELM (extreme learning machines), as well as with alternative local linear models, such as the Takagi-Sugeno fuzzy model and the LLM(local linear mapping) neural model. A comprehensive study is carried out to compare the performances of all the aforementioned models according to three evaluation criteria, namely: (i) normalized mean squared error, (ii) residual analysis, and (iii) Kolmogorov-Smirnov test. Of particular interest to this thesis is the evaluation of the robustness of the proposed local models with respect to the vector quantization algorithm used to train the model. The obtained results indicates that the performance of the proposed local models are superior to those achieved by the MLP-based global models and equivalent to those achieved by ELM-based global models.
34
Moreira, Mirley Ribeiro [UNESP]. "Atlas multimídia sobre movimentos de massa na sera do Mar paulista: município de Cubatão/SP." Universidade Estadual Paulista (UNESP), 2008. http://hdl.handle.net/11449/102883.
Full textAbstract:
Made available in DSpace on 2014-06-11T19:32:18Z (GMT). No. of bitstreams: 0
Previous issue date: 2008-10-17Bitstream added on 2014-06-13T20:43:12Z : No. of bitstreams: 1
moreira_mr_dr_rcla.pdf: 2967010 bytes, checksum: a3a8fd8d971c6b62113182b986e3ed84 (MD5)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Os movimentos de massa na Serra do Mar são alvos de muito interesse e estudo devido à alta incidência e aos conseqüentes impactos ambientais e econômicos. Portanto, reunir várias informações sobre movimentos de massa, e disponibilizá-los como um produto de fácil aquisição e de navegabilidade para o conhecimento de alunos de graduação, é o desafio desse trabalho. Como área de aplicação, escolheu-se o município de Cubatão, pela significativa incidência de escorregamentos e pela importância da região no contexto nacional, frente a aspectos econômicos e ambientais. Desta forma, o objetivo principal é produzir um Atlas Multimídia sobre os processos de movimentos de massa, como contribuição ao ensino de graduação, nas áreas de Ciências da Terra e Engenharia e avaliar a aplicabilidade da linguagem SVG (Scalable Vectorial Graphics) na produção de mapas interativos. Foi efetuada uma consulta a docentes e alunos da área de Ciências da Terra, sobre o interesse na utilização de material didático multimídia como apoio ao ensino e aprendizado e os resultados obtidos mostraram o claro interesse deste público no desenvolvimento do material .O Atlas interativo elaborado, voltado especificamente a escorregamentos, usando interfaces gráficas na linguagem SVG,mostrou que é possível a publicação de aplicações cartográficas interativas utilizando o SVG. Acredita-se que a utilização deste tipo de material como apoio ao ensino e aprendizado seja uma tendência crescente, impulsionada pelos avanços tecnológicos e pela forte inserção da informática em todos os setores de atividade. Inseridos neste contexto, os atuais alunos, desde muito cedo, vivem a informática nos seus cotidianos e a inserção destes recursos em sala de aula torna os cursos mais atrativos para este público.
Mass movements of Serra do Mar are the subject of much interest and study due to high incidence, the consequent environmental and economic impacts. For these reasons, to get some information about mass movements and make them available as a product of easy acquisition and navigability for the knowledge of undergraduate students, it is the challenge of this work. The study area was the Cubatão city by the significant incidence of slip and the importance of the region in the national context, in face of economic and environmental aspects. Thus, the main goal is to produce an Atlas Multimedia about processes of mass movements, to contribute to the education of undergraduate students in Earth Sciences and Engineering areas and evaluate the applicability of the SVG (Scalable Vectorial Graphics) language in the production of interactive maps. It was done a questionnaire for the purpose of gathering information from teachers and students in Earth Sciences area, about the interest in the use of multimedia educational materials to support teaching and learning. The results showed clear interest of the public in developing the material. The Interactive Atlas prepared, specifically to landslide, using graphical interfaces in the SVG language, showed that it is possible to publish interactive mapping applications using SVG. It was believed that the use of such material to support teaching and learning is a growing trend, driven by technological advances and the strong integration of computer science technology in all sectors of this activity. In this context, the current students, from an early age, living in their everyday computing and the integration of these resources in the classroom make the courses more appealing to the public.
35
PATTA, SIVA VENKATA PRASAD. "Intelligent Decision Support Systems for Compliance Options : A Systematic Literature Review and Simulation." Thesis, Blekinge Tekniska Högskola, Institutionen för datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18449.
Full textAbstract:
The project revolves around logistics and its adoption to the new rules. Theobjective of this project is to focus on minimizing data tampering to the lowest level possible.To achieve the set goals in this project, Decision support system and simulation havebeen used. However, to get clear insight about how they can be implemented, a systematicliterature review (Case Study incl.) has been conducted, followed by interviews with personnelat Kakinada port to understand the real-time complications in the field. Then, a simulatedexperiment using real-time data from Kakinada port has been conducted to achieve the set goalsand improve the level of transparency on all sides i.e., shipper, port and terminal.
36
Veras, Ricardo da Costa. "Utilização de métodos de machine learning para identificação de instrumentos musicais de sopro pelo timbre." reponame:Repositório Institucional da UFABC, 2018.
Find full textAbstract:
Orientador: Prof. Dr. Ricardo SuyamaDissertação (mestrado) - Universidade Federal do ABC, Programa de Pós-Graduação em Engenharia da Informação, Santo André, 2018.
De forma geral a Classificação de Padrões voltada a Processamento de Sinais vem sendo estudada e utilizada para a interpretação de informações diversas, que se manifestam em forma de imagens, áudios, dados geofísicos, impulsos elétricos, entre outros. Neste trabalho são estudadas técnicas de Machine Learning aplicadas ao problema de identificação de instrumentos musicais, buscando obter um sistema automático de reconhecimento de timbres. Essas técnicas foram utilizadas especificamente com cinco instrumentos da categoria de Sopro de Madeira (o Clarinete, o Fagote, a Flauta, o Oboé e o Sax). As técnicas utilizadas foram o kNN (com k = 3) e o SVM (numa configuração não linear), assim como foram estudadas algumas características (features) dos áudios, tais como o MFCC (do inglês Mel-Frequency Cepstral Coefficients), o ZCR (do inglês Zero Crossing Rate), a entropia, entre outros, sendo fonte de dados para os processos de treinamento e de teste. Procurou-se estudar instrumentos nos quais se observa uma aproximação nos timbres, e com isso verificar como é o comportamento de um sistema classificador nessas condições específicas. Observou-se também o comportamento dessas técnicas com áudios desconhecidos do treinamento, assim como com trechos em que há uma mistura de elementos (gerando interferências para cada modelo classificador) que poderiam desviar os resultados, ou com misturas de elementos que fazem parte das classes observadas, e que se somam num mesmo áudio. Os resultados indicam que as características selecionadas possuem informações relevantes a respeito do timbre de cada um dos instrumentos avaliados (como observou-se em relação aos solos), embora a acurácia obtida para alguns dos instrumentos tenha sido abaixo do esperado (como observou-se em relação aos duetos).
In general, Pattern Classification for Signal Processing has been studied and used for the interpretation of several information, which are manifested in many ways, like: images, audios, geophysical data, electrical impulses, among others. In this project we study techniques of Machine Learning applied to the problem of identification of musical instruments, aiming to obtain an automatic system of timbres recognition. These techniques were used specifically with five instruments of Woodwind category (Clarinet, Bassoon, Flute, Oboe and Sax). The techniques used were the kNN (with k = 3) and the SVM (in a non-linear configuration), as well as some audio features, such as MFCC (Mel-Frequency Cepstral Coefficients), ZCR (Zero Crossing Rate), entropy, among others, used as data source for the training and testing processes. We tried to study instruments in which an approximation in the timbres is observed, and to verify in this case how is the behavior of a classifier system in these specific conditions. It was also observed the behavior of these techniques with audios unknown to the training, as well as with sections in which there is a mixture of elements (generating interferences for each classifier model) that could deviate the results, or with mixtures of elements that are part of the observed classes, and added in a same audio. The results indicate that the selected characteristics have relevant information regarding the timbre of each one of evaluated instruments (as observed on the solos results), although the accuracy obtained for some of the instruments was lower than expected (as observed on the duets results).
37
Handschin, Charles. "Spectroscopie EUV résolue temporellement à l'échelle femtoseconde par imagerie de vecteur vitesse et génération d'harmoniques d'ordres élevés." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00944627.
Full textAbstract:
Cette thèse fait l'étude expérimentale de dynamiques de relaxations ultrarapides au sein d'atomes et de molécules (Ar, NO2, C2H2). Les méthodes expérimentales qui sont utilisées sont basées sur l'interaction d'un rayonnement laser avec le système atomique ou moléculaire étudié et font intervenir le processus de génération d'harmoniques d'ordres élevés, ainsi que la spectrométrie d'imagerie de vecteur vitesse. Au cours de cette thèse, deux approchesexpérimentales de type pompe-sonde ont été mises en œuvre. Une première approche exploitela sensibilité du processus de génération d'harmoniques à la structure électronique dumilieu pour la sonder. Cette méthode a été utilisée sur la molécule de dioxyde d'azote pourobserver sa relaxation électronique à travers l'intersection conique des états X2A1-A2B2suite à une excitation autour de 400 nm. Une seconde approche utilise le rayonnementharmonique comme source de photons dans le domaine de l'extrême ultraviolet (EUV)pour exciter ou sonder les espèces d'intérêt. Cette approche a été couplée avec l'utilisationd'un spectromètre d'imagerie de vecteur vitesse (VMIS), qui a été développé durant lathèse. Des expériences menées sur un système modèle comme l'argon ont permis de validerle dispositif expérimental, qui a ensuite été mis en application pour étudier la photodissociationde la molécule d'acétylène, après excitation autour de 9,3 eV du complexe deRydberg 3d-4s. Les deux méthodes mises en œuvre permettent toutes-deux de réaliserdes études dynamiques résolues en temps à l'échelle femtoseconde.
38
Jones, Christina Michele. "Applications and challenges in mass spectrometry-based untargeted metabolomics." Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/54830.
Full textAbstract:
Metabolomics is the methodical scientific study of biochemical processes associated with the metabolome—which comprises the entire collection of metabolites in any biological entity. Metabolome changes occur as a result of modifications in the genome and proteome, and are, therefore, directly related to cellular phenotype. Thus, metabolomic analysis is capable of providing a snapshot of cellular physiology. Untargeted metabolomics is an impartial, all-inclusive approach for detecting as many metabolites as possible without a priori knowledge of their identity. Hence, it is a valuable exploratory tool capable of providing extensive chemical information for discovery and hypothesis-generation regarding biochemical processes. A history of metabolomics and advances in the field corresponding to improved analytical technologies are described in Chapter 1 of this dissertation. Additionally, Chapter 1 introduces the analytical workflows involved in untargeted metabolomics research to provide a foundation for Chapters 2 – 5.
Part I of this dissertation which encompasses Chapters 2 – 3 describes the utilization of mass spectrometry (MS)-based untargeted metabolomic analysis to acquire new insight into cancer detection. There is a knowledge deficit regarding the biochemical processes of the origin and proliferative molecular mechanisms of many types of cancer which has also led to a shortage of sensitive and specific biomarkers. Chapter 2 describes the development of an in vitro diagnostic multivariate index assay (IVDMIA) for prostate cancer (PCa) prediction based on ultra performance liquid chromatography-mass spectrometry (UPLC-MS) metabolic profiling of blood serum samples from 64 PCa patients and 50 healthy individuals. A panel of 40 metabolic spectral features was found to be differential with 92.1% sensitivity, 94.3% specificity, and 93.0% accuracy. The performance of the IVDMIA was higher than the prevalent prostate-specific antigen blood test, thus, highlighting that a combination of multiple discriminant features yields higher predictive power for PCa detection than the univariate analysis of a single marker. Chapter 3 describes two approaches that were taken to investigate metabolic patterns for early detection of ovarian cancer (OC). First, Dicer-Pten double knockout (DKO) mice that phenocopy many of the features of metastatic high-grade serous carcinoma (HGSC) observed in women were studied. Using UPLC-MS, serum samples from 14 early-stage tumor DKO mice and 11 controls were analyzed. Iterative multivariate classification selected 18 metabolites that, when considered as a panel, yielded 100% accuracy, sensitivity, and specificity for early-stage HGSC detection. In the second approach, serum metabolic phenotypes of an early-stage OC pilot patient cohort were characterized. Serum samples were collected from 24 early-stage OC patients and 40 healthy women, and subsequently analyzed using UPLC-MS. Multivariate statistical analysis employing support vector machine learning methods and recursive feature elimination selected a panel of metabolites that differentiated between age-matched samples with 100% cross-validated accuracy, sensitivity, and specificity. This small pilot study demonstrated that metabolic phenotypes may be useful for detecting early-stage OC and, thus, supports conducting larger, more comprehensive studies.
Many challenges exist in the field of untargeted metabolomics.
Part II of this dissertation which encompasses Chapters 4 – 5 focuses on two specific challenges. While metabolomic data may be used to generate hypothesis concerning biological processes, determining causal relationships within metabolic networks with only metabolomic data is impractical. Proteins play major roles in these networks; therefore, pairing metabolomic information with that acquired from proteomics gives a more comprehensive snapshot of perturbations to metabolic pathways. Chapter 4 describes the integration of MS- and NMR-based metabolomics with proteomics analyses to investigate the role of chemically mediated ecological interactions between Karenia brevis and two diatom competitors, Asterionellopsis glacialis and Thalassiosira pseudonana. This integrated systems biology approach showed that K. brevis allelopathy distinctively perturbed the metabolisms of these two competitors. A. glacialis had a more robust metabolic response to K. brevis allelopathy which may be a result of its repeated exposure to K. brevis blooms in the Gulf of Mexico. However, K. brevis allelopathy disrupted energy metabolism and obstructed cellular protection mechanisms including altering cell membrane components, inhibiting osmoregulation, and increasing oxidative stress in T. pseudonana. This work represents the first instance of metabolites and proteins measured simultaneously to understand the effects of allelopathy or in fact any form of competition.
Chromatography is traditionally coupled to MS for untargeted metabolomics studies. While coupling chromatography to MS greatly enhances metabolome analysis due to the orthogonality of the techniques, the lengthy analysis times pose challenges for large metabolomics studies. Consequently, there is still a need for developing higher throughput MS approaches. A rapid metabolic fingerprinting method that utilizes a new transmission mode direct analysis in real time (TM-DART) ambient sampling technique is presented in Chapter 5. The optimization of TM-DART parameters directly affecting metabolite desorption and ionization, such as sample position and ionizing gas desorption temperature, was critical in achieving high sensitivity and detecting a broad mass range of metabolites. In terms of reproducibility, TM-DART compared favorably with traditional probe mode DART analysis, with coefficients of variation as low as 16%. TM-DART MS proved to be a powerful analytical technique for rapid metabolome analysis of human blood sera and was adapted for exhaled breath condensate (EBC) analysis. To determine the feasibility of utilizing TM-DART for metabolomics investigations, TM-DART was interfaced with traveling wave ion mobility spectrometry (TWIMS) time-of-flight (TOF) MS for the analysis of EBC samples from cystic fibrosis patients and healthy controls. TM-DART-TWIMS-TOF MS was able to successfully detect cystic fibrosis in this small sample cohort, thereby, demonstrating it can be employed for probing metabolome changes.
Finally, in Chapter 6, a perspective on the presented work is provided along with goals on which future studies may focus.
39
Kuparowitz, Tomáš. "Použití mobilního robotu v inteligentním domě." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2013. http://www.nusl.cz/ntk/nusl-220068.
Full textAbstract:
Aim of this thesis is to search the market for suitable autonomous robot to be used by smart house. The research in this work is partly done on the range of abilities of smart houses in matter of sensor systems, ability of data processing and their use by mobile robots. The output of this thesis is robotics application written using Microsoft Robotics Developer Studio (C#) and simulated using Visual Simulation Environment. Main feature of this robotic application is the interface between robot and smart house, and robot and user. This interface enables employer to directly control robot's movement or to use automated pathfinding. The robot is able to navigate in dynamic environment and to register, interact and eventually forget temporary obstacles.
40
Hruboš, Zdeněk. "Oscilátory generující nekonvenční signály." Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2016. http://www.nusl.cz/ntk/nusl-239937.
Full textAbstract:
Dizertační práce se zabývá elektronicky nastavitelnými oscilátory, studiem nelineárních vlastností spojených s použitými aktivními prvky a posouzením možnosti vzniku chaotického signálu v harmonických oscilátorech. Jednotlivé příklady vzniku podivných atraktorů jsou detailně diskutovány. V doktorské práci je dále prezentováno modelování reálných fyzikálních a biologických systémů vykazujících chaotické chování pomocí analogových elektronických obvodů a moderních aktivních prvků (OTA, MO-OTA, CCII ±, DVCC ±, atd.), včetně experimentálního ověření navržených struktur. Další část práce se zabývá možnostmi v oblasti analogově – digitální syntézy nelineárních dynamických systémů, studiem změny matematických modelů a odpovídajícím řešením. Na závěr je uvedena analýza vlivu a dopadu parazitních vlastností aktivních prvků z hlediska kvalitativních změn v globálním dynamickém chování jednotlivých systémů s možností zániku chaosu v důsledku parazitních vlastností použitých aktivních prvků.
41
David, Hélène. "Etude de matrices polymères permettant la libération contrôlée d'agents actifs en agriculture : expérimentation et modélisation des transferts de matière." Saint-Etienne, 1989. http://www.theses.fr/1989STET4004.
Full textAbstract:
L'agent actif considéré a été l'éthoprophos, principe nématicide utilisé en agrochimie, mais dans un premier temps, l'aniline a été utilisé comme agent simulant. Les processus d'absorption et de désorption dans l'eau, ont été modélisés, dans le cas d'un granulé composé d'EVA pur, à l'aide d'une solution analytique de l'équation de Fick. Un modèle mathématique basé sur une méthode numérique a été construit pour décrire les transferts à travers un granulé composé par un noyau et une enveloppe
42
Chen, Shyan-Shion, and 陳賢修. "Connection between Maps and Vector Fields." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/60107434936510397932.
Full textAbstract:
碩士國立交通大學
應用數學研究所
86
We are interested in the relationship between a map and the vector field corresponding to it obtained from Takens's lemma. More specifically, we are interested in the symmetric maps such as symplectic or (and) reversible maps. We use the method of the product normal form to construct the corresponding vector fields for the so-called McMillan class of area-preserving maps. Numerical simulation are performed to study the periodic orbits of the vector fields near fixed points and the periodic points of the maps.
43
HsiehHungMing and 謝鴻銘. "Topology-Preserving Watermarking of Vector Maps." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/63114177289577025572.
Full textAbstract:
碩士義守大學
資訊工程學系
92
As the popularity of computer and the prevalence of Internet in recent years, people can easily surf on the Internet and download the information around the world. All items are the efforts of creators. Accordingly, stealing one’s copies without the permission of creators will be tort and illegality. Thus, how to protect the valuable media effectively becomes a presently crucial theme for researching. Also, digital watermarking is one of major techniques to solve this problem. Up to now, the researches regarding digital watermarking mainly focus on particular media, such as digital image, audio, video, etc. As the vector map becomes available gradually, these techniques of digital watermarking are difficult to be applied directly on the protection of digital map. This paper mainly probes into the techniques of digital watermarking which are really appropriate to the vector map, and maintain the hypothesis of correct topology that can stably resist the destruction of noise. We will test by real map to demonstrate the performance of proposed method.
44
Chang, Chih-Wei, and 張志偉. "The Kodaira Maps of Toric Vector Bundles." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/a9gc5e.
Full text
45
Tsai, Yu Lin, and 蔡玉玲. "On Genenalized Vector Saddle Points and Generalized Vector Minimax Theorems for Set-Valued Maps and Vector Valued Functions." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/84558085642551804347.
Full textAbstract:
碩士國立彰化師範大學
數學系
90
In this paper, we first prove some existence theorems of generalized vector saddle point for multivalued map or vector valued function. As a consequence, we establish the existence theoremsof generalized vector minimax theorem. We also establish the existencetheorem of generalized vector quasi-variational-like inequality problem for vector valued function and the relationship between the solutions of the generalized vector saddle point problem and the generalized vectorquasi-variational-like inequality problem for vector valued functions.From which we establish another existence theorem of generalized vector saddle point problems.
46
Chen, I.-Chieh, and 陳怡潔. "Integration of vector maps based on multiple geometric features." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/46522032265701674314.
Full textAbstract:
碩士國立臺灣大學
土木工程學研究所
100
Map is one of the most intuitive tools in recording and representing the geographic information. Under the consideration of preserving cartographic data in a compact and efficient manner, digital maps composed of vectors are mostly used. Also, users can apply coordinate transformation to analyze data with different datum definitions. A complete coordinate transformation analysis includes model choosing, observation using, parameter estimation, and quality assessment. Typically, control points are used as observables to solve transformation parameters, while check points are used for a quality assessment. As a consequence, poor distribution or an insufficient number of control/check points might lead to a biased transformation solution. In this study, linear features and projective invariant points were both used as observables in a coordinate transformation analysis between multiple vector maps. The goal was to provide a better geometric constraint for the transformation. Furthermore, two numerical indices, namely the absolute consistency and relative similarity, were used for evaluating the quality of a transformation solution. Based on the case studies using both simulated and real datasets, it has been proven that the proposed approach is capable of fully making use the geometric connotation inherent in a vector map and providing a comprehensive quality evaluation on the obtained transformation. Consequently, a more reliable and robust integration analysis for digital vector maps can be achieved when the proposed approach is implemented.
47
Chiang, Ya-Wen, and 江雅雯. "A Generalized Vector Variational Inequality for Set-Valued Maps." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/39704335127282645991.
Full textAbstract:
碩士東吳大學
數學系
89
Abstract. In this paper, we study a generalized vector variational inequality, and we extend it for set-valued maps with some kinds of conditions. We establish the extence of solution for generalized vector variational inequality by using KKM THEOREM.
48
Chen, Fu-Mei, and 陳富美. "Metadata Embedding for Vector Maps by Using Reversible Steganographic Algorithms." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/17764355267847349951.
Full textAbstract:
博士國立東華大學
企業管理學系
97
A vector map consists of a sequence of two-dimensional coordinates to represent points, lines, and polygons in a digital map. They are data widely used in economic, social and environmental decision support and planning applications and are also the fuel of many applications based on Geographic Information Systems (GIS). Nowadays, more and more vector maps have been compiled and made available for dissemination via internet. Accordingly, there is need for providing the details of the downloaded vector maps to be available on demand. Metadata which is the “data about data” are introduced to provide the details of vector maps. In this thesis, we have explored an important issue on metadata embedding for vector maps by using reversible steganographic algorithms. The basic idea of this research comes from utilizing the characteristics of steganographic technologies to develop metadata embedding methods for vector maps. Thus, the major objective of this research is to propose and compare methods of using reversible steganographic algorithms to embed metadata in vector maps and to provide a better metadata storing mechanism than current used. Experiments are implemented to evaluate the feasibility of the proposed methods. In this thesis, we have successfully explored and proposed three reversible steganographic algorithms to embed metadata in vector maps. The first algorithm, which is named as the original algorithm, is used to embed 2(n-2) bits of metadata in a vector map, where n represents the total vertices in a vector map. To the best of our knowledge, the algorithm has achieved the highest bit per vertex (BPV) in th literature of steganograhy for vector maps. The second algorithm, which is named as the extended algorithm, is improved from the original algorithm for the purpose of decreasing the distortion of stego vector maps and increasing the accuracy of recovery vector maps. The experimental results, compare with the results from the original algorithm, show that the extended algorithm has reduced 50%-60% of distortion rate in stego vector maps and improved 40%-60% of accuracy in recovery vector maps. The third algorithm, which is named as the extensive algorithm, is proposed to have better data embedding capacity. The algorithm can be used to embed 2(n-2)s bits of metadata in a vector map. The n in the third algorithm also represents the total vertices of vector maps and the s here represents the segmentation values that create sub-intervals between the intervals designed for metadata embedding. Results show that we have successfully implementing a cover vector map with 65,828 vertices by using the extensive reversible steganographic algorithm to embed and extract metadata with insignificant distortion in stego vector maps and high accuracy of recovery vector maps. Although our approaches have already delivered good results, the main limitations of the proposed algorithms are coming from map precision and machine precision errors when considering cover vector map with small amount of vertices. Since the definitive capacity limit is reached when map precision and machine precision errors occur. Thus, the first suggested future work is to use other approaches to divide intervals or even use different approaches and rules to decide intervals for increased capacity or to avoid map precision and machine precision errors. The second future work which is worth to be investigated is to survey the effects of cover vector maps’ features to the algorithms proposed in this thesis, such as the complexity, the smoothness of boundary, and the included angle between vertices of cover maps. Finally, it is also worth to survey how to apply these algorithms in online mapping systems for providing better spatial vector data services.
49
Liou, Ciou-Liang, and 劉秋良. "The Development of A Reversible Data Hiding Systemfor Vector Maps." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/cz698z.
Full textAbstract:
碩士國立東華大學
企業管理學系
96
In the rapid development of the rich Internet application, people can conveniently send digital information through the network. Nevertheless, the more widespread the Internet develops, the more important to the transmitting security. Therefore, many researches carry out the studies on how to maintain the security when transmitting information via the Internet. As opposed to cryptography, data hiding provides another mechanism for insuring information security. Data hiding uses a camouflage concept to embed secret messages into cover media to confuse the eavesdropper’s attention and transmit secret messages while sending cover media. Currently, many researches of data hiding stress on the applications to images, audio, videos, and 3D models. In the meanwhile, vector maps have become a very popular image formation. The advantage of vector map contains small file size and accurate graphic representation at all scales. Therefore, we would like to focus on using vector maps as the cover media and propose data hiding algorithms in this paper. In this paper, we introduce data hiding algorithm for vector maps. Experiment results show that the algorithm maintain high embedding capacity yet with little distortion. In addition, the algorithm is with blind detection that does not require original map for secret message extraction. Furthermore, the algorithm is robust against affine transformation including rotation, translation, and uniform scaling. Therefore, we also provide robustness contribution for data hiding on vector maps. Accordingly, we use oriented object analysis and design to develop the system; as a result, on the basis of algorithm in chapter 3, we embedded the copyright data and metadata into vector map to carry out the system. Through the software framework, we would like to know how the components work in real case. Then system designers can have an overall understanding to the system framework by taking UML to illustrate the blueprint for the system. Consequently, they can easily be familiar with the system mechanism and to accomplish the maintenances. In summary, we present a reversible data hiding algorithm and develop a reversible data hiding system for vector maps. The system contains five characteristics: high data capacity, imperceptible distortion for the stego map, robust against affine attacks for vector map, nice reversibility for recover map, and to reducing stealing probability of secret messages from hacker attacking.
50
Huang, Chia-Cheng, and 黃家政. "Efficient Browsing and Heuristic Shortest-Path Search on Digital Vector Maps." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/20061489591982516521.
Full textAbstract:
碩士義守大學
資訊工程學系碩士班
95
As the rapid development of computer hardware and software, people have widely used electronic maps in a variety of geographical information application systems. One of most important technologies is the indexing and searching technology on spatial data. For a general embedded device, memory size is often insufficient to load all maps into memory at once because of the volume, power and cost. When browsing a large map, the transmission speed between main memory and auxiliary memory is a critical bottleneck. The access frequency of memory will influence the display speed of map data. This research firstly uses the multi-dimensional indexing technology to solve the key problem. Next, one of the most important issues is to find the best path in network analysis. The best path is not only the meaning that the required distance is shortest, but it is also possible to general geographical meaning, such as travel time, transportation charges, etc. Since the shortest path problem is usually applied to urgent tasks, these systems by request should calculate the shortest path as soon as possible. Most systems solving the shortest path are almost based on Dijkstra algorithm, and many systems use different approaches according to own properties. Based on traditional Dijkstra algorithm, this research adopts heuristic approaches to meet the requirement. We will show some experimental results to demonstrate the performance.