Rozprawy doktorskie na temat „Data storage representation”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 16 najlepszych rozpraw doktorskich naukowych na temat „Data storage representation”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Ugail, Hassan, i Eyad Elyan. "Efficient 3D data representation for biometric applications". IOS Press, 2007. http://hdl.handle.net/10454/2683.
Pełny tekst źródłaAn important issue in many of today's biometric applications is the development of efficient and accurate techniques for representing related 3D data. Such data is often available through the process of digitization of complex geometric objects which are of importance to biometric applications. For example, in the area of 3D face recognition a digital point cloud of data corresponding to a given face is usually provided by a 3D digital scanner. For efficient data storage and for identification/authentication in a timely fashion such data requires to be represented using a few parameters or variables which are meaningful. Here we show how mathematical techniques based on Partial Differential Equations (PDEs) can be utilized to represent complex 3D data where the data can be parameterized in an efficient way. For example, in the case of a 3D face we show how it can be represented using PDEs whereby a handful of key facial parameters can be identified for efficient storage and verification.
Folmer, Brennan Thomas. "Metadata storage for file management systems data storage and representation techniques for a file management system /". [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE1001141.
Pełny tekst źródłaCheeseman, Bevan. "The Adaptive Particle Representation (APR) for Simple and Efficient Adaptive Resolution Processing, Storage and Simulations". Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2018. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-234245.
Pełny tekst źródłaVanCalcar, Jenny E. (Jenny Elizabeth). "Collection and representation of GIS data to aid household water treatment and safe storage technology implementation in the northern region of Ghana". Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/34583.
Pełny tekst źródłaIncludes bibliographical references (leaves 46-51).
In 2005, a start-up social business called Pure Home Water (PHW) was begun in Ghana to promote and sell household water treatment and safe storage (HWTS) technologies. The original aim of the company was to offer a variety of products, allowing customers to choose the technology which best fit their individual needs. This differed from the typical implementation of HWTS promoters to date, in which an organization often distributes a single technology for the population to use. Instead, Pure Home Water wanted to give users a choice. PHW is also unique because they are attempting to sell their products without any subsidy. The goal is to create a sustainable business that will both bring better quality water to the population and be financially self-supporting. Because the company is new, a need existed to gather data on the demographic, health, and water and sanitation infrastructure within the region. Due to the geographic nature of the project, it was decided that a Geographic Information System (GIS) would be the best tool to store, analyze and represent the data.
(cont.) The system could be used to help plan relevant business strategies, and maps could be created to visually communicate important information among the Pure Home Water team and other interested parties. The final database did achieve the goal of collecting and bringing together important regional information in a form hopefully useful to PHW, future MIT teams and others. However, the use of the database for long-term planning is currently too advanced for the small company.
by Jenny E. VanCalcar.
M.Eng.
Elyan, Eyad, i Hassan Ugail. "Reconstruction of 3D human facial images using partial differential equations". Academy Publisher, 2007. http://hdl.handle.net/10454/2644.
Pełny tekst źródłaFang, Cheng-Hung. "Application for data mining in manufacturing databases". Ohio : Ohio University, 1996. http://www.ohiolink.edu/etd/view.cgi?ohiou1178653424.
Pełny tekst źródłaMunalula, Themba. "Measuring the applicability of Open Data Standards to a single distributed organisation: an application to the COMESA Secretariat". Thesis, University of Cape Town, 2008. http://pubs.cs.uct.ac.za/archive/00000461/.
Pełny tekst źródłaMunyaradzi, Ngoni. "Transcription of the Bleek and Lloyd Collection using the Bossa Volunteer Thinking Framework". Thesis, University of Cape Town, 2013. http://pubs.cs.uct.ac.za/archive/00000913/.
Pełny tekst źródłaWang, Yue. "Data Representation for Efficient and Reliable Storage in Flash Memories". Thesis, 2013. http://hdl.handle.net/1969.1/149536.
Pełny tekst źródłaCheeseman, Bevan. "The Adaptive Particle Representation (APR) for Simple and Efficient Adaptive Resolution Processing, Storage and Simulations". Doctoral thesis, 2017. https://tud.qucosa.de/id/qucosa%3A30873.
Pełny tekst źródłaZhu, Jihai. "Low-complexity block dividing coding method for image compression using wavelets : a thesis presented in partial fulfillment of the requirements for the degree of Master of Engineering in Computer Systems Engineering at Massey University, Palmerston North, New Zealand". 2007. http://hdl.handle.net/10179/704.
Pełny tekst źródłaLiu, Chunyang. "Summarizing data with representative patterns". Thesis, 2016. http://hdl.handle.net/10453/52923.
Pełny tekst źródłaThe advance of technology makes data acquisition and storage become unprecedentedly convenient. It contributes to the rapid growth of not only the volume but also the veracity and variety of data in recent years, which poses new challenges to the data mining area. For example, uncertain data mining emerges due to its capability to model the inherent veracity of data; spatial data mining attracts much research attention as the widespread of location-based services and wearable devices. As a fundamental topic of data mining, how to effectively and efficiently summarize data in this situation still remains to be explored. This thesis studied the problem of summarizing data with representative patterns. The objective is to find a set of patterns, which is much more concise but still contains rich information of the original data, and may provide valuable insights for further analysis of data. In the light of this idea, we formally formulate the problem and provide effective and efficient solutions in various scenarios. We study the problem of summarizing probabilistic frequent patterns over uncertain data. Probabilistic frequent pattern mining over uncertain data has received much research attention due to the wide applicabilities of uncertain data. It suffers from the problem of generating an exponential number of result patterns, which hinders the analysis of patterns and calls for the need to find a small number of representative patterns to approximate all other patterns. We formally formulate the problem of probabilistic representative frequent pattern (P-RFP) mining, which aims to find the minimal set of patterns with sufficiently high probability to represent all other patterns. The bottleneck turns out to be checking whether a pattern can probabilistically represent another, which involves the computation of a joint probability of the supports of two patterns. We propose a novel dynamic programming-based approach to address the problem and devise effective optimization strategies to improve the computation efficiency. To enhance the practicability of P-RFP mining, we introduce a novel approximation of the joint probability with both theoretical and empirical proofs. Based on the approximation, we propose an Approximate P-RFP Mining (APM) algorithm, which effectively and efficiently compresses the probabilistic frequent pattern set. The error rate of APM is guaranteed to be very small when the database contains hundreds of transactions, which further affirms that APM is a practical solution for summarizing probabilistic frequent patterns. We address the problem of directly summarizing uncertain transaction database by formulating the problem as Minimal Probabilistic Tile Cover Mining, which aims to find a high-quality probabilistic tile set covering an uncertain database with minimal cost. We define the concept of Probabilistic Price and Probabilistic Price Order to evaluate and compare the quality of tiles, and propose a framework to discover the minimal probabilistic tile cover. The bottleneck is to check whether a tile is better than another according to the Probabilistic Price Order, which involves the computation of a joint probability. We prove that it can be decomposed into independent terms and calculated efficiently. Several optimization techniques are devised to further improve the performance. We analyze the problem of summarizing co-locations mined from spatial databases. Co-location pattern mining finds patterns of spatial features whose instances tend to locate together in geographic space. However, the traditional framework of co-location pattern mining produces an exponential number of patterns because of the downward closure property, which makes it difficult for users to understand, assess or apply the huge number of resulted patterns. To address this issue, we study the problem of mining representative co-location patterns (RCP). We first define a covering relationship between two co-location patterns then formally formulate the problem of Representative Co-location Pattern mining. To solve the problem of RCP mining, we propose the RCPFast algorithm adopting the post-mining framework and the RCPMS algorithm pushing pattern summarization into the co-location mining process.
Sello, Mpho Constance. "Individual Document Management Techniques: an Explorative Study". Thesis, 2007. http://pubs.cs.uct.ac.za/archive/00000399/.
Pełny tekst źródłaKovacevic, Vlado S. "The impact of bus stop micro-locations on pedestrian safety in areas of main attraction". 2005. http://arrow.unisa.edu.au:8081/1959.8/28389.
Pełny tekst źródłaGerhards, Karl. "Unscharfe Suche für Terme geringer Frequenz in einem großen Korpus". Doctoral thesis, 2011. https://repositorium.ub.uni-osnabrueck.de/handle/urn:nbn:de:gbv:700-201101107278.
Pełny tekst źródłaHeisen, Burkhard Clemens. "New Algorithms for Macromolecular Structure Determination". Doctoral thesis, 2009. http://hdl.handle.net/11858/00-1735-0000-0006-B503-3.
Pełny tekst źródła