Дисертації з теми "Mapping of data usage"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Mapping of data usage".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Ramos, milis Guilherme. "Apport des mesures des compteurs Linky pour la connaissance des charges du réseau de distribution." Electronic Thesis or Diss., Université Grenoble Alpes, 2024. http://www.theses.fr/2024GRALT021.
The distribution grid occupies a central position in the energy transition. This results in two key changes for the network: an (r)evolution of uses and a digital (r)evolution. In this context, this thesis begins by creating a new mapping of the uses of data from smart meters. Building upon this mapping, the thesis will delve into two central themes of great importance in the context of energy transition. The first is an analysis of the Diversity Factor of Low Voltage (LV) charges and its estimation. The second involves estimating the load curves of customers on the LV grid using an innovative method
Suljevic, Benjamin. "Mapping HW resource usage towards SW performance." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-44176.
Kamuhanda, Dany. "Visualising M-learning system usage data." Thesis, Nelson Mandela Metropolitan University, 2015. http://hdl.handle.net/10948/11015.
Romaniuk, Helena. "Analysis of product usage panel data." Thesis, University of Southampton, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.326798.
Densham, Martin. "Bathymetric mapping with QuickBird data /." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Sep%5FDensham.pdf.
Thesis Advisor(s) :Philip A. Durkee, Edward B. Thornton. Includes bibliographical references (p. 43-44). Also available online.
Currie, Sheila. "Data classification for choropleth mapping." Thesis, University of Ottawa (Canada), 1989. http://hdl.handle.net/10393/5725.
Densham, Martin P. J. "Bathymetric mapping with QuickBird data." Thesis, Monterey, California. Naval Postgraduate School, 2005. http://hdl.handle.net/10945/2121.
Royal Navy
Fletcher, George H. L. "On the data mapping problem." [Bloomington, Ind.] : Indiana University, 2007. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3276692.
Olsson, Marcus. "Data Warehouse : An Outlook of Current Usage of External Data." Thesis, University of Skövde, Department of Computer Science, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-682.
A data warehouse is a data collection that integrates large amounts of data from several sources, with the aim to support the decision-making process in a company. Data could be acquired from internal sources within the own organization, as well as from external sources outside the organization.
The comprehensive aim of this dissertation is to examine the current usage of external data and its sources for integration into DWs, in order to give users of a DW the best possible foundation for decision-making. In order to investigate this problem, we have conducted an interview study with DW developers.
Based on the interview study, the result shows that it is relative common to integrate external data into DWs. The study also identifies different types of external data that are integrated, and what external sources it is common to acquire data from. In addition, opportunities and pitfalls of integrating external data have also been highlighted.
Onojeghuo, Alex Okiemute. "Reedbed mapping using remotely sensed data." Thesis, Lancaster University, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.577547.
Najmuddin, Ilyas Juzer. "Austin Fracture mapping using frequency data derived from seismic data." Texas A&M University, 2003. http://hdl.handle.net/1969/34.
Winblad, Emanuel. "Visualization of web site visit and usage data." Thesis, Linköpings universitet, Medie- och Informationsteknik, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-110576.
Wang, Guilian. "Schema mapping for data transformation and integration." Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2006. http://wwwlib.umi.com/cr/ucsd/fullcit?p3211371.
Title from first page of PDF file (viewed June 7, 2006). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 135-142).
Steutel, Donovan. "Efficient Materials Mapping Using Hyperspectral Imaging Data." Thesis, University of Hawaii at Manoa, 2002. http://hdl.handle.net/10125/6962.
xvi, 117 leaves
Mackin, Stephen. "Mineralogical mapping using airborne imaging spectrometry data." Thesis, Durham University, 1989. http://etheses.dur.ac.uk/6306/.
Kaufman, Alan P. (Alan Philip). "Data and algorithms for genomic physical mapping." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/36508.
Includes bibliographical references (leaves 116-122).
by Alan P. Kaufman.
M.S.
Cai, Xuemei. "A Lexical Comparison Using Word Embedding Mapping from an Academic Word Usage Perspective." Thesis, Uppsala universitet, Institutionen för lingvistik och filologi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-425266.
Bayir, Murat Ali. "A New Reactive Method For Processing Web Usage Data." Master's thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/12607323/index.pdf.
Smart-SRA'
is introduced. Web usage mining is a type of web mining, which exploits data mining techniques to discover valuable information from navigations of Web users. As in classical data mining, data processing and pattern discovery are the main issues in web usage mining. The first phase of the web usage mining is the data processing phase including session reconstruction. Session reconstruction is the most important task of web usage mining since it directly affects the quality of the extracted frequent patterns at the final step, significantly. Session reconstruction methods can be classified into two categories, namely '
reactive'
and '
proactive'
with respect to the data source and the data processing time. If the user requests are processed after the server handles them, this technique is called as &lsquo
reactive&rsquo
, while in &lsquo
proactive&rsquo
strategies this processing occurs during the interactive browsing of the web site. Smart-SRA is a reactive session reconstruction techique, which uses web log data and the site topology. In order to compare Smart-SRA with previous reactive methods, a web agent simulator has been developed. Our agent simulator models behavior of web users and generates web user navigations as well as the log data kept by the web server. In this way, the actual user sessions will be known and the successes of different techniques can be compared. In this thesis, it is shown that the sessions generated by Smart-SRA are more accurate than the sessions constructed by previous heuristics.
Brohman, Kathryn. "Explaining variation in data warehouse usage, an interpretation perspective." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape2/PQDD_0015/NQ58115.pdf.
Jung, Changhee. "Effective techniques for understanding and improving data structure usage." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/49101.
Damineni, Sarath Chandra, and Sai Manikanta Munukoti. "Product Usage Data collection and Analysis in Lawn-mowers." Thesis, Blekinge Tekniska Högskola, Institutionen för datavetenskap, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-20658.
Khanna, Gaurav. "A Data-Locality Aware Mapping and Scheduling Framework for Data-Intensive Computing." The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1218559278.
Hoffmann, Steve. "Genome Informatics for High-Throughput Sequencing Data Analysis." Doctoral thesis, Universitätsbibliothek Leipzig, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-152643.
Diese Arbeit stellt drei verschiedene algorithmische und statistische Strategien für die Analyse von Hochdurchsatz-Sequenzierungsdaten vor. Zuerst führen wir eine auf enhanced Suffixarrays basierende heuristische Methode ein, die kurze Sequenzen mit grossen Genomen aligniert. Die Methode basiert auf der Idee einer fehlertoleranten Traversierung eines Suffixarrays für Referenzgenome in Verbindung mit dem Konzept der Matching-Statistik von Chang und einem auf Bitvektoren basierenden Alignmentalgorithmus von Myers. Die vorgestellte Methode unterstützt Paired-End und Mate-Pair Alignments, bietet Methoden zur Erkennung von Primersequenzen und zum trimmen von Poly-A-Signalen an. Auch in unabhängigen Benchmarks zeichnet sich das Verfahren durch hohe Sensitivität und Spezifität in simulierten und realen Datensätzen aus. Für eine große Anzahl von Sequenzierungsprotokollen erzielt es bessere Ergebnisse als andere bekannte Short-Read Alignmentprogramme. Zweitens stellen wir einen auf dynamischer Programmierung basierenden Algorithmus für das spliced alignment problem vor. Der Vorteil dieses Algorithmus ist seine Fähigkeit, nicht nur kollineare Spleiß- Ereignisse, d.h. Spleiß-Ereignisse auf dem gleichen genomischen Strang, sondern auch zirkuläre und andere nicht-kollineare Spleiß-Ereignisse zu identifizieren. Das Verfahren zeichnet sich durch eine hohe Genauigkeit aus: während es bei der Erkennung kollinearer Spleiß-Varianten vergleichbare Ergebnisse mit anderen Methoden erzielt, schlägt es die Wettbewerber mit Blick auf Sensitivität und Spezifität bei der Vorhersage nicht-kollinearer Spleißvarianten. Die Anwendung dieses Algorithmus führte zur Identifikation neuer Isoformen. In unserer Publikation berichten wir über eine neue Isoform des Tumorsuppressorgens p53. Da dieses Gen eines der am besten untersuchten Gene des menschlichen Genoms ist, könnte die Anwendung unseres Algorithmus helfen, eine Vielzahl weiterer Isoformen bei weniger prominenten Genen zu identifizieren. Drittens stellen wir ein datenadaptives Modell zur Identifikation von Single Nucleotide Variations (SNVs) vor. In unserer Arbeit zeigen wir, dass sich unser auf empirischen log-likelihoods basierendes Modell automatisch an die Qualität der Sequenzierungsexperimente anpasst und eine \"Entscheidung\" darüber trifft, welche potentiellen Variationen als SNVs zu klassifizieren sind. In unseren Simulationen ist diese Methode auf Augenhöhe mit aktuell eingesetzten Verfahren. Schließlich stellen wir eine Auswahl biologischer Ergebnisse vor, die mit den Besonderheiten der präsentierten Alignmentverfahren in Zusammenhang stehen
Teniente, Avilés Ernesto Homar. "3D mapping and path planning from range data." Doctoral thesis, Universitat Politècnica de Catalunya, 2016. http://hdl.handle.net/10803/392615.
Esta tesis reporta investigación sobre el mapeo, clasificación de terreno y planificación de trayectorias. Estos son problemas clásicos en robótica los cuales generalmente se estudian de forma independiente, aquí se vinculan enmarcandolos con una modalidad propioceptiva común: un láser de rango 3D. El objetivo final es ofrecer trayectorias de navegación para escenarios complejos en el marco de la robótica móvil. Por esta razón también entregamos regiones transitables en un mapa global consistente calculado previamente. Primero examinamos el problema de registro de nubes de puntos adquiridas en diferentes instancias de tiempo. Contribuimos con un novedoso mecanismo de registro de pares de imagenes de rango 3D usando correspondencias punto a punto y punto a línea, en una estrategia de búsqueda de correspondencias jerárquica. Para la minimización optamos por una metrica que considera no sólo la distancia entre puntos, sino también la orientación de los marcos de referencia relativos. También proponemos FAMSA, una técnica para el registro rápido simultaneo de multiples nubes de puntos, la cual aprovecha las correspondencias de puntos obtenidas durante el registro secuencial, usando inicialmente la historia de correspondencias para acelerar el cálculo de las correspondecias en los nuevos registros de imagenes. Para propagar adecuadamente el modelo del ruido del sensor y del registro de imagenes, empleamos la propagación de error de primer orden, y para corregir el error acumulado del registro local, consideramos la alineación probabilística de nubes de puntos 3D utilizando un Filtro Extendido de Información de estados retrasados. En esta tesis adaptamos el algóritmo Pose SLAM para el caso de mapas con imagenes de rango 3D, Pose SLAM es la variante de SLAM donde solamente se estima la trayectoria del robot, usando los datos del sensor como restricciones relativas entre las poses robot. Estas técnicas de mapeo se prueban en varios escenarios adquiridos con nuestros sensores 3D produciendo modelos 3D impresionantes. Los mapas obtenidos se procesan para identificar regiones navegables y para planificar secuencias de navegación. Presentamos un par de métodos para lograr la clasificación de zonas transitables fuera de línea. Los datos de entrenamiento se adquieren de forma automática usando secuencias de navegación obtenidas manualmente. Las características transitables se captan de las huella de la trayectoria del robot, lo cual permite capturar restricciones del terreno difíciles de modelar. Con sólo algunas de las zonas transitables como muestras de entrenamiento positivo, nuestros algoritmos se prueban en escenarios reales para encontrar el resto del terreno transitable. Los algoritmos se comparan con algunas variantes de la máquina de soporte de vectores (SVM) y una parametrizacion ingenua. También, contribuimos con un planificador de trayectorias que garantiza llegar a una posicion deseada del robot en significante menor tiempo de cálculo a otras alternativas. Para buscar el mejor camino, nuestro planificador emplea un arbol de busqueda incremental basado en el algoritmo A*. Incluimos una póliza de coste híbrido para crecer de manera eficiente el árbol, combinando el muestro aleatorio del espacio continuo de comandos cinemáticos del robot con una métrica de coste al objetivo que también concidera las cinemática del robot. El planificador además permite reconectado de nodos, y, para acelerar la búsqueda de nodos, se incluye una heurística que penaliza la expansión de nodos cerca de los obstáculos, que limita el número de nodos explorados. El método conoce las céldas que ha visitado del espacio de configuraciones, evitando la expansión de nodos en configuraciones que han sido vistadas en la primera iteración completa del algoritmo. Los métodos propuestos se validán con amplios experimentos con escenarios reales en diferentes entornos exteriores, asi como su comparación con otras técnicas como los algoritmos A*, RRT y RRT*.
Vennesland, Audun. "Finding and Mapping Expertise Automatically Using Corporate Data." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2007. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-8831.
In an organization, both management as well as new and experienced employees often have a need to get in touch with experts in a variety of situations. The new staff members need to learn how to perform their job, the management need - amongst other things - to man projects and vacancies, and other employees are often dependent on others' expertise to accomplish their tasks. Traditionally this problem has often been approached with computer applications using semi-automatic methods involving self-assessments of expertise stored in databases. These methods prove to be time-consuming, they do not consider the dynamics of expertise and the self-assessed expertise is often difficult to validate. This report presents an overview of issues involved in expertise finding and the development of a simple, yet effective prototype which tries to overcome the mentioned problems by using a fully automatic approach. A study of the Urban Development area at the Municipality of Trondheim is carried out to analyze this organizations' possessed expertise, sought after expertise and to collect necessary information for building the expertise finder prototype. The study found that a lot of expertise evidence is found in the formal correspondence archived in the case handling systems' document repository, and that the structure and content of these documents could fit a fully-automatic Expertise finder well. Four alternative test cases have been evaluated during the testing and evaluation of the prototype. One of these test cases - where expert profiles are modelled on-the-fly based on employees' names occurring in formal documents - is able to compete with- and in some cases outperform evaluation scores presented in related research.
Sims, LT Todd E. "Wireless Sensor Node Data Gathering and Location Mapping." Thesis, Monterey, California. Naval Postgraduate School, 2012. http://hdl.handle.net/10945/6869.
Gamal, Eldin Tawfik Ahmed. "Autonomous Small Scale Data-logger for Temperature Mapping." UNF Digital Commons, 2015. http://digitalcommons.unf.edu/etd/585.
Seetan, Raed. "A Data Mining Approach to Radiation Hybrid Mapping." Diss., North Dakota State University, 2014. https://hdl.handle.net/10365/27315.
Borck, Michael Geoffery. "Feature Extraction from Multi-modal Mobile Mapping Data." Thesis, Curtin University, 2016. http://hdl.handle.net/20.500.11937/57505.
Ozaygen, Alkim. "Analysing the Usage Data of Open Access Scholarly Books: What Can Data Tell Us?" Thesis, Curtin University, 2019. http://hdl.handle.net/20.500.11937/79585.
Eddie, Sarah Joan. "Hearing Aid Usage in Different Listening Environments." Thesis, University of Canterbury. Communication Disorders, 2007. http://hdl.handle.net/10092/1418.
Chen, Rita. "ScratchStats : a site for visualizing and understanding scratch usage data." Thesis, Massachusetts Institute of Technology, 2010. http://scratch.mit.edu.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 65-66).
This thesis introduces ScratchStats, an extension to the Scratch website where users can view and understand Scratch usage data through a series of interactive visualizations. Scratch is a visual programming language that makes it easy to create interactive stories, games, and artwork. Accompanying the Scratch application is the Scratch Online Community, a website that allows users to upload and share their creations. The visualizations created in this thesis describe community, personal, and network statistics. ScratchStats aims to provide answers to questions about Scratch usage, promote reflection and introspective learning, and aid in teaching data literacy.
by Rita Chen.
M.Eng.
Erhardt, Keeley Donovan. "Bismuth : a blockchain-based program for verifying responsible data usage." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/119629.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 74-75).
The amount of digital information generated, collected and stored is growing at a staggering rate. Data-driven insights are increasingly relied upon to make decisions, directly impacting individuals. The burgeoning importance of data in shaping the world around us requires a shift in the current data ownership, exchange and usage paradigm. Responsible data use should be verifiably free from leaking sensitive information, discriminatory usage, illegal applications, and other misuse. Additionally, a standard of correctness for computations executed against datasets should be enforced. Enlisting trusted parties to vet the code being executed against sensitive data can reduce the prevalence of irresponsible or malevolent data usage. Trusted parties can attest to attributes of the code-for example, that the code is privacy-preserving, or that it is legal to execute against data collected from users in a certain country, or that a computation reliably and correctly computes an answer as advertised-to ensure that individuals' personal information is used appropriately. This thesis presents an illustration of a design to structure, vet and verify the code that is executed against sensitive data, along with a proposal for using blockchain-based smart con- tracts to audit and enforce proper usage of vetted code to promote a paradigm of "safe" question-and-answer exchange. Finally, this thesis demonstrates Bismuth, a blockchain-based program built to implement the ideas presented in this work and to assist in a transition towards more thoughtful and responsible data usage.
by Keeley Donovan Erhardt.
M. Eng.
Day, Allen Jason. "The construction and usage of a microarray data warehousing system." Diss., Restricted to subscribing institutions, 2008. http://proquest.umi.com/pqdweb?did=1666908781&sid=1&Fmt=2&clientId=1564&RQT=309&VName=PQD.
STAGNI, Federico. "On Usage Control for Data Grids: Models, Architectures, and Specifications." Doctoral thesis, Università degli studi di Ferrara, 2009. http://hdl.handle.net/11392/2389199.
Gadea, Cristian. "Collaborative Web-Based Mapping of Real-Time Sensor Data." Thesis, Université d'Ottawa / University of Ottawa, 2011. http://hdl.handle.net/10393/19772.
Block, Lorraine Joy. "Mapping nursing wound care data elements to SNOMED-CT." Thesis, University of British Columbia, 2016. http://hdl.handle.net/2429/60290.
Applied Science, Faculty of
Nursing, School of
Graduate
Polowinski, Jan. "Semi-Automatic Mapping of Structured Data to Visual Variables." Master's thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-108497.
Während Semantic-Web-Daten maschinenverstehbar und hervorragend filterbar sind, sind sie — in ihrer Rohform — nicht leicht von Menschen verstehbar. Eine Visualisierung der Daten ist deshalb notwendig. Die Kernherausforderung dabei ist eine flexible Abbildung der strukturierten aber heterogenen Daten auf Visuelle Variablen. Diese Arbeit beschreibt eine hochflexible halbautomatische Lösung bei maximaler Unterstützung des Visualisierungsprozesses, welcher die Abbildungsmöglichkeiten, aus denen der Nutzer zu wählen hat, auf eine sinnvolle Teilmenge reduziert. Die Grundlage dafür sind einerseits Metriken und das Wissen über die Struktur der Daten und andererseits das Wissen über verfügbare Visualisierungsstrukturen, -plattformen und bekannte grafische Fakten, welche durch eine neuentwickelte Visualisierungsontologie bereitgestellt werden. Basierend auf Standards des Semantic Webs und der Model-getriebenen Architektur, wurde desweiteren ein deklaratives, plattformunabhängiges Visualisierungsvokabular und -framework entwickelt
Abdul, Hamid Juazer Rizal. "Mapping of forests using imaging spectrometry and lidar data." Thesis, University of Nottingham, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.415722.
Lewis, Sian Patricia. "Mapping forest parameters using geostatistics and remote sensing data." Thesis, University College London (University of London), 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.407744.
Gonalves, Jos Alberto. "Integration of SAR and SPOT data for topographic mapping." Thesis, University of London, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268797.
Diener, Matthias. "Automatic task and data mapping in shared memory architectures." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2015. http://hdl.handle.net/10183/131871.
Reducing the cost of memory accesses, both in terms of performance and energy consumption, is a major challenge in shared-memory architectures. Modern systems have deep and complex memory hierarchies with multiple cache levels and memory controllers, leading to a Non-Uniform Memory Access (NUMA) behavior. In such systems, there are two ways to improve the memory affinity: First, by mapping tasks that share data (communicate) to cores with a shared cache, cache usage and communication performance are improved. Second, by mapping memory pages to memory controllers that perform the most accesses to them and are not overloaded, the average cost of accesses is reduced. We call these two techniques task mapping and data mapping, respectively. For optimal results, task and data mapping need to be performed in an integrated way. Previous work in this area performs the mapping only separately, which limits the gains that can be achieved. Furthermore, most previous mechanisms require expensive operations, such as communication or memory access traces, to perform the mapping, require changes to the hardware or to the parallel application, or use a simple static mapping. These mechanisms can not be considered generic solutions for the mapping problem. In this thesis, we make two contributions to the mapping problem. First, we introduce a set of metrics and a methodology to analyze parallel applications in order to determine their suitability for an improved mapping and to evaluate the possible gains that can be achieved using an optimized mapping. Second, we propose two automatic mechanisms that perform task mapping and combined task/data mapping, respectively, during the execution of a parallel application. These mechanisms work on the operating system level and require no changes to the hardware, the applications themselves or their runtime libraries. An extensive evaluation with parallel applications from multiple benchmark suites as well as real scientific applications shows substantial performance and energy efficiency improvements that are significantly higher than simple mechanisms and previous work, while maintaining a low overhead.
Gharabaghi, Sara. "Quantitative Susceptibility Mapping (QSM) Reconstruction from MRI Phase Data." Wright State University / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=wright1610018553822445.
Griffiths, G. H. "Mapping rangeland vegetation in Northern Kenya from Landsat data." Thesis, Aston University, 1985. http://publications.aston.ac.uk/14254/.
Firoozi, Nejad Behnam. "Population mapping using census data, GIS and remote sensing." Thesis, Queen's University Belfast, 2016. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.705917.
Järpehult, Oscar, and Martin Lindblom. "Longitudinal measurements of link usage on Twitter." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-159331.
Hawana, Leila Mohammed. "Knowing Without Knowing: Real-Time Usage Identification of Computer Systems." PDXScholar, 2019. https://pdxscholar.library.pdx.edu/open_access_etds/4680.
Li, Haiyan. "Data visualization of asymmetric data using Sammon mapping and applications of self-organizing maps." College Park, Md. : University of Maryland, 2005. http://hdl.handle.net/1903/2358.
Thesis research directed by: Business and Management. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
Luczak-Rösch, Markus [Verfasser]. "Usage-dependent maintenance of structured Web data sets / Markus Luczak-Rösch." Berlin : Freie Universität Berlin, 2014. http://d-nb.info/1068253827/34.
Willenberg, Darren. "Quantifying MyCiTi supply usage via Big Data and Agent Based Modelling." Master's thesis, University of Cape Town, 2017. http://hdl.handle.net/11427/27362.