Zaloguj się

Gotowe bibliografie tematyczne / Data structures / Rozprawy doktorskie

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Data structures.

Rozprawy doktorskie na temat „Data structures”

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 25 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Data structures”.

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.

1

Jarvis, Kimberley James. "Transactional data structures." Thesis, University of Manchester, 2011. https://www.research.manchester.ac.uk/portal/en/theses/transactional-data-structures(7060eaec-7dbd-4d5a-be1a-a753d9aa32d5).html.

Pełny tekst źródła

Streszczenie:

Concurrent programming is difficult and the effort is rarely rewarded by faster execution. The concurrency problem arises because information cannot pass instantly between processors resulting in temporal uncertainty. This thesis explores the idea that immutable data and distributed concurrency control can be combined to allow scalable concurrent execution and make concurrent programming easier. A concurrent system that does not impose a global ordering on events lends itself to a scalable distributed implementation. A concurrent programming environment in which the ordering of events affectin

Style APA, Harvard, Vancouver, ISO itp.

2

Eastep, Jonathan M. (Jonathan Michael). "Smart data structures : an online machine learning approach to multicore data structures." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/65967.

Pełny tekst źródła

Streszczenie:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student submitted PDF version of thesis.<br>Includes bibliographical references (p. 175-180).<br>As multicores become prevalent, the complexity of programming is skyrocketing. One major difficulty is eciently orchestrating collaboration among threads through shared data structures. Unfortunately, choosing and hand-

Style APA, Harvard, Vancouver, ISO itp.

3

Ohashi, Darin. "Cache Oblivious Data Structures." Thesis, University of Waterloo, 2001. http://hdl.handle.net/10012/1060.

Pełny tekst źródła

Streszczenie:

This thesis discusses cache oblivious data structures. These are structures which have good caching characteristics without knowing Z, the size of the cache, or L, the length of a cache line. Since the structures do not require these details for good performance they are portable across caching systems. Another advantage of such structures isthat the caching results hold for every level of cache within a multilevel cache. Two simple data structures are studied; the array used for binary search and the linear list. As well as being cache oblivious, the structures presented in this

Style APA, Harvard, Vancouver, ISO itp.

4

Chaudhary, Amitabh. "Applied spatial data structures for large data sets." Available to US Hopkins community, 2002. http://wwwlib.umi.com/dissertations/dlnow/3068131.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Miner, andrew S. "Data structures for the analysis of large structured Markov models." W&M ScholarWorks, 2000. https://scholarworks.wm.edu/etd/1539623985.

Pełny tekst źródła

Streszczenie:

High-level modeling formalisms are increasingly popular tools for studying complex systems. Given a high-level model, we can automatically verify certain system properties or compute performance measures about the system. In the general case, measures must be computed using discrete-event simulations. In certain cases, exact numerical analysis is possible by constructing and analyzing the underlying stochastic process of the system, which is a continuous-time Markov chain (CTMC) in our case. Unfortunately, the number of states in the underlying CTMC can be extremely large, even if the high-lev

Style APA, Harvard, Vancouver, ISO itp.

6

Jürgens, Marcus. "Index structures for data warehouses." [S.l. : s.n.], 1999. http://www.diss.fu-berlin.de/2000/93/index.html.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Jürgens, Marcus. "Index structures for data warehouses." Berlin ; Heidelberg : Springer, 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=96554155X.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Colbrook, Adrian. "The engineering of data structures." Thesis, University of Surrey, 1990. http://epubs.surrey.ac.uk/843605/.

Pełny tekst źródła

Streszczenie:

Abstraction in computer programming provides a means of reducing complexity by emphasising the significant information (program behaviour) whilst suppressing the immaterial (program implementation). This aids program construction, improves reliability and maintainability, and eases the application of formal correctness proofs. The importance of data abstraction in the specification, design and implementation of large systems raises the question as to whether such methods may be applied in the context of programming languages designed before the widespread use of abstraction techniques. The pro

Style APA, Harvard, Vancouver, ISO itp.

9

Jürgens, Marcus. "Index structures for data warehouses /." Berlin [u.a.] : Springer, 2002. http://www.loc.gov/catdir/enhancements/fy0817/2002021075-d.html.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Goulet, Jean 1939. "Data structures for chess programs." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=65427.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

11

Smith, Lorna J. "Protein structures from NMR data." Thesis, University of Oxford, 1992. http://ora.ox.ac.uk/objects/uuid:89d541b3-618f-4581-aea3-f18050098e67.

Pełny tekst źródła

Streszczenie:

This thesis describes the use of nuclear magnetic resonance techniques to determine the structures of two proteins in solution, hen egg-white lysozyme and human interleukin-4. Using 2D <sup>1</sup>H methods an extensive set of structural data has been collected for hen lysozyme (1158 NOE distance restraints, 68 o and 24 <sub>?1</sub> dihedral angle restraints) and these data have been used in distance geometry-dynamical simulated annealing calculations to determine an ensemble of NMR structures for the protein. The overall Ca RMSD from the average for a set of 16 calculated structures is 1.8 ±

Style APA, Harvard, Vancouver, ISO itp.

12

VALENTIM, CAIO DIAS. "DATA STRUCTURES FOR TIME SERIES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2012. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=21522@1.

Pełny tekst źródła

Streszczenie:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>Séries temporais são ferramentas importantes para análise de eventos que ocorrem em diferentes domínios do conhecimento humano, como medicina, física, meteorologia e finanças. Uma tarefa comum na análise de séries temporais é a busca por eventos pouco frequentes que refletem fatos de interesse sobre o domínio de origem da série. Neste trabalho, buscamos desenvolver técnicas para detecção de eventos raros em séries temporais. Formalmente, uma série temporal A igual a (a1, a2,..

Style APA, Harvard, Vancouver, ISO itp.

13

Obiedat, Mohammad. "Incrementally Sorted Lattice Data Structures." Thesis, The George Washington University, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3732474.

Pełny tekst źródła

Streszczenie:

<p> Data structures are vital entities that strongly impact the efficiency of several software applications. Compactness, predictable memory access patterns, and good temporal and spacial locality of the structure's operations are increasingly becoming essential factors in the selection of a data structure for a specific application. In general, the less data we store and move the better for efficiency and power consumption, especially in infrastructure software and applications for hand-held devices like smartphones. In this dissertation, we extensively study a data structure named latt

Style APA, Harvard, Vancouver, ISO itp.

14

Moss, Graeme E. "Benchmarking purely functional data structures." Thesis, University of York, 2000. http://etheses.whiterose.ac.uk/10869/.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

Russel, Daniel. "Kinetic data structures in practice /." May be available electronically:, 2007. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

Karras, Panagiotis. "Data structures and algorithms for data representation in constrained environments." Thesis, Click to view the E-thesis via HKUTO, 2007. http://sunzi.lib.hku.hk/hkuto/record/B38897647.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

Lamoureux, Michael G. "Dynamic data structures for generalized range queries on orthogonal data." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0021/NQ54595.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

Poyias, Andreas. "Engineering compact dynamic data structures and in-memory data mining." Thesis, University of Leicester, 2018. http://hdl.handle.net/2381/42282.

Pełny tekst źródła

Streszczenie:

Compact and succinct data structures use space that approaches the information-theoretic lower bound on the space that is required to represent the data. In practice, their memory footprint is orders of magnitude smaller than normal data structures and at the same time they are competitive in speed. A main drawback with many of these data structures is that they do not support dynamic operations efficiently. It can be exceedingly expensive to rebuild a static data structure each time an update occurs. In this thesis, we propose a number of novel compact dynamic data structures including m-Bons

Style APA, Harvard, Vancouver, ISO itp.

19

Fischer, Johannes. "Data Structures for Efficient String Algorithms." Diss., lmu, 2007. http://nbn-resolving.de/urn:nbn:de:bvb:19-75053.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

20

Kabiri, Chimeh Mozhgan. "Data structures for SIMD logic simulation." Thesis, University of Glasgow, 2016. http://theses.gla.ac.uk/7521/.

Pełny tekst źródła

Streszczenie:

Due to the growth of design size and complexity, design verification is an important aspect of the Logic Circuit development process. The purpose of verification is to validate that the design meets the system requirements and specification. This is done by either functional or formal verification. The most popular approach to functional verification is the use of simulation based techniques. Using models to replicate the behaviour of an actual system is called simulation. In this thesis, a software/data structure architecture without explicit locks is proposed to accelerate logic gate circuit

Style APA, Harvard, Vancouver, ISO itp.

21

Karlsson, Johan T. "On data structures and memory models /." Luleå : Department of Computer Science and Electrical Engineering, Luleå University of Technology, 2006. http://epubl.ltu.se/1402-1544/2006/24/index.html.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

22

Butts, Robert O. "Heterogeneous construction of spatial data structures." Thesis, University of Colorado at Denver, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=1588178.

Pełny tekst źródła

Streszczenie:

<p> Linear spatial trees are typically constructed in two discrete, consecutive stages: calculating location codes, and sorting the spatial data according to the codes. Additionally, a GPU R-tree construction algorithm exists which likewise consists of sorting the spatial data and calculating nodes' bounding boxes. Current GPUs are approximately three orders of magnitude faster than CPUs for perfectly vectorizable problems. However, the best known GPU sorting algorithms only achieve 10-20 times speedup over sequential CPU algorithms. Both calculating location codes and bounding boxes are perfe

Style APA, Harvard, Vancouver, ISO itp.

23

Sinnamon, Neville David. "Visual operations on generic data structures." Thesis, Queen's University Belfast, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.241498.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

24

Parsons, M. S. "Applicative languages and graphical data structures." Thesis, University of Kent, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.379988.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

Pǎtraşcu, Mihai. "Lower bound techniques for data structures." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/45866.

Pełny tekst źródła

Streszczenie:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.<br>Includes bibliographical references (p. 135-143).<br>We describe new techniques for proving lower bounds on data-structure problems, with the following broad consequences: * the first [omega](lg n) lower bound for any dynamic problem, improving on a bound that had been standing since 1989; * for static data structures, the first separation between linear and polynomial space. Specifically, for some problems that have constant query time when polynomial space is allowed, we can

Style APA, Harvard, Vancouver, ISO itp.

26

Oosthuizen, Daniel Rudolph. "Data modelling of industrial steel structures." Thesis, Stellenbosch : Stellenbosch University, 2003. http://hdl.handle.net/10019.1/53346.

Pełny tekst źródła

Streszczenie:

Thesis (MScEng)--Stellenbosch University, 2003.<br>ENGLISH ABSTRACT: AP230 of STEP is an application protocol for structural steel-framed buildings. Product data relating to steel structures is represented in a model that captures analysis, design and manufacturing views. The information requirements described in AP230 were analysed with the purpose of identifying a subset of entities that are essential for the description of simple industrial steel frames with the view to being able to describe the structural concept, and to perform the structural analysis and design of such structures.

Style APA, Harvard, Vancouver, ISO itp.

27

Rybin, Pavel. "Speculative parallelisation with dynamic data structures." Thesis, University of Manchester, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.525935.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

28

Daoud, Amjad M. "Efficient data structures for information retrieval." Diss., Virginia Tech, 1993. http://hdl.handle.net/10919/40031.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

29

Normore, Lorraine Dombrowski. "Strategies in searching hierarchical data structures /." The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487265143147771.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

Lu, Haibin. "Data structures for dynamic router table." [Gainesville, Fla.] : University of Florida, 2003. http://purl.fcla.edu/fcla/etd/UFE0000920.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

Choudhury, Sabyasachy. "Hierarchical Data Structures for Pattern Recognition." Thesis, Indian Institute of Science, 1987. https://etd.iisc.ac.in/handle/2005/74.

Pełny tekst źródła

Streszczenie:

Pattern recognition is an important area with potential applications in computer vision, Speech understanding, knowledge engineering, bio-medical data classification, earth sciences, life sciences, economics, psychology, linguistics, etc. Clustering is an unsupervised classification process corning under the area of pattern recognition. There are two types of clustering approaches: 1) Non-hierarchical methods 2) Hierarchical methods. Non-hierarchical algorithms are iterative in nature and. perform well in the context of isotropic clusters. Time-complexity of these algorithms is order of (0 (n

Style APA, Harvard, Vancouver, ISO itp.

32

Choudhury, Sabyasachy. "Hierarchical Data Structures for Pattern Recognition." Thesis, Indian Institute of Science, 1987. http://hdl.handle.net/2005/74.

Pełny tekst źródła

Streszczenie:

Pattern recognition is an important area with potential applications in computer vision, Speech understanding, knowledge engineering, bio-medical data classification, earth sciences, life sciences, economics, psychology, linguistics, etc. Clustering is an unsupervised classification process corning under the area of pattern recognition. There are two types of clustering approaches: 1) Non-hierarchical methods 2) Hierarchical methods. Non-hierarchical algorithms are iterative in nature and. perform well in the context of isotropic clusters. Time-complexity of these algorithms is order of (0 (n)

Style APA, Harvard, Vancouver, ISO itp.

33

García, Cava David. "Data-based vibration structural health monitoring methodology for composite laminated structures." Thesis, University of Strathclyde, 2016. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=26903.

Pełny tekst źródła

Streszczenie:

Composite materials are steadily replacing traditional materials in a wide range of industry sectors thanks to their remarkable properties. Damage in composite materials exhibits complex failure modes which are difficult to identify by conventional techniques. Composite materials demonstrate complex nonlinear vibration behaviour where conventional vibration-based structural health monitoring (VSHM) methods might not give adequate information for damage identification. This thesis investigates the capabilities of singular spectrum analysis (SSA) as a technique for developing a completely data-b

Style APA, Harvard, Vancouver, ISO itp.

34

Sinha, Arnab. "Self-describing objects with tangible data structures." Phd thesis, Université Rennes 1, 2014. http://tel.archives-ouvertes.fr/tel-01062441.

Pełny tekst źródła

Streszczenie:

Pervasive computing or ambient computing aims to integrate information systems into the environment, in a manner as transparent as possible to the users. It allows the information systems to be tightly coupled with the physical activities within the environment. Everyday used objects, along with their environment, are made smarter with the use of embedded computing, sensors etc. and also have the ability to communicate among themselves. In pervasive computing, it is necessary to sense the real physical world and to perceive its "context" ; a high level representation of the physical situation.

Style APA, Harvard, Vancouver, ISO itp.

35

Byers, Patrick. "Computability over abstract data types." Thesis, University of Surrey, 1990. http://epubs.surrey.ac.uk/844617/.

Pełny tekst źródła

Streszczenie:

This thesis extends the study of the notion of termination equivalence of abstract structures first proposed by Kfoury. The connection with abstract data types (ADTs) is made by demonstrating that many kinds of equivalence between ADT implementations are in fact instances of termination equivalence between their underlying algebras. The results in the thesis extend the original work in two directions. The first is to consider how the termination equivalence of structures is dependent upon the choice of programming formalism. The termination equivalences for all of the common classes of program

Style APA, Harvard, Vancouver, ISO itp.

36

GILARDI, ANDREA. "Statistical Models and Data Structures for Spatial Data on Road Networks." Doctoral thesis, Università degli Studi di Milano-Bicocca, 2021. http://hdl.handle.net/10281/314016.

Pełny tekst źródła

Streszczenie:

Negli ultimi anni è nato un interesse sempre crescente verso l’analisi statistica di dati spaziali aventi supporto di network. Gli esempi più classici di questa tipologia di eventi sono, ad esempio, gli incidenti stradali, i furti di auto, i crimini, e gli interventi delle ambulanze, mentre le linee che compongono la network rappresentano tipicamente le strade, i fiumi, i binari della ferrovia, oppure le terminazioni nervose. L’analisi di questi fenomeni è interessante sotto diversi punti di vista. Innanzitutto, i modelli statistici presentano diverse problematiche legate al supporto spaziale

Style APA, Harvard, Vancouver, ISO itp.

37

Duch, Brown Amàlia. "Design and Analysis of Multidimensional Data Structures." Doctoral thesis, Universitat Politècnica de Catalunya, 2004. http://hdl.handle.net/10803/6647.

Pełny tekst źródła

Streszczenie:

Aquesta tesi està dedicada al disseny i a l'anàlisi d'estructures de dades multidimensionals, és a dir, estructures de dades que serveixen per emmagatzemar registres $K$-dimensionals que solen representar-se com a punts en l'espai $[0,1]^K$. Aquestes estructures tenen aplicacions en diverses àrees de la informàtica com poden ser els sistemes d'informació geogràfica, la robòtica, el processament d'imatges, la world wide web, el data mining, entre d'altres. <br/><br/>Les estructures de dades multidimensionals també es poden utilitzar com a indexos d'estructures de dades que emmagatzemen, possibl

Style APA, Harvard, Vancouver, ISO itp.

38

García, Fernández Ismael. "Parallel spatial data structures for interactive rendering." Doctoral thesis, Universitat de Girona, 2012. http://hdl.handle.net/10803/107998.

Pełny tekst źródła

Streszczenie:

The main question explored in this thesis is how to define novel parallel random-access data structures for surface and image spatial data with efficient construction, storage, and query memory access patterns. Our main contribution is a set of parallel-efficient methods to evaluate irregular, sparse or even implicit geometries and textures in different applications: a method to decouple shape and shading details from high-resolution meshes, mapping them interactively onto lower resolution simpler domains; an editable framework to map highresolution meshes to simpler cube-based domains, genera

Style APA, Harvard, Vancouver, ISO itp.

39

Eid, Ashraf. "Efficient associative data structures for bitemporal databases." Thesis, University of Ottawa (Canada), 2002. http://hdl.handle.net/10393/6226.

Pełny tekst źródła

Streszczenie:

Most applications require storing multiple versions of data and involve a lot of temporal semantics in their schema. This requires maintenance and querying of temporal relations. A Bitemporal DBMS will simplify the development and maintenance of such applications by moving temporal support from the application into the DBMS engine. The success of such Bitemporal DBMSs relies mainly on the availability of high performance indices that handle update and search operations efficiently. A successful associative data structure (index) is the one that can efficiently partition the space of the attrib

Style APA, Harvard, Vancouver, ISO itp.

40

Zhou, WeiNing. "A comparison of data structures in C++." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ59346.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

41

Zhu, Yingchun. "Optimizing parallel programs with dynamic data structures." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0035/NQ64708.pdf.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

42

Karlsson, Jonas S. "Scalable distributed data structures for database management." [S.l. : Amsterdam : s.n.] ; Universiteit van Amsterdam [Host], 2000. http://dare.uva.nl/document/57022.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

Zhu, Yingchun 1968. "Optimizing parallel programs with dynamic data structures." Thesis, McGill University, 2000. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=36745.

Pełny tekst źródła

Streszczenie:

Distributed memory parallel architectures support a memory model where some memory accesses are local, and thus inexpensive, while other memory accesses are remote, and potentially quite expensive. In order to achieve efficiency on such architectures, we need to reduce remote accesses. This is particularly challenging for applications that use dynamic data structures.<br>In this thesis, I present two compiler techniques to reduce the overhead of remote memory accesses for dynamic data structure based applications: locality techniques and communication optimizations. Locality techniques include

Style APA, Harvard, Vancouver, ISO itp.

44

Toussaint, Richard. "Data structures and operations for geographical information." Thesis, McGill University, 1995. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=23945.

Pełny tekst źródła

Streszczenie:

The topic of this thesis revolves around the organization of geographical information in permanent memory. Our premise is that a recognized and fully documented direct access storage technique called Multidimensional Paging or Multipaging would provide a well balanced storing structure for this category of data. Since multipaging uses a multidimensional perspective on the information to allocate it to pages in secondary storage then spatial data, which is fundamentally multidimensional by nature, would surely offer a suitable profile.<br>First, we attempt to evaluate the efficiency of multipag

Style APA, Harvard, Vancouver, ISO itp.

45

Cardwell, Gregory S. "Residual network data structures in Android devices." Thesis, Monterey, California. Naval Postgraduate School, 2011. http://hdl.handle.net/10945/5506.

Pełny tekst źródła

Streszczenie:

Approved for public release; distribution is unlimited<br>The emergence and recent ubiquity of Smartphones present new opportunities and challenges to forensic examiners. Smartphones enable new mobile application and use paradigms by being constantly attached to the Internet via one of several physical communication media, e.g. cellular radio, WiFi, or Bluetooth. The Smartphone's storage medium represents a potential source of current and historical network metadata and records of prior data transfers. By using known ground truth data exchanges in a controlled experimental environment, thi

Style APA, Harvard, Vancouver, ISO itp.

46

Jürgens, Marcus [Verfasser]. "Index structures for data warehouses / Marcus Jürgens." Berlin, 2000. http://d-nb.info/96554155X/34.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

47

Sharp, Jonathan Paul. "Biased search data structures and rectangular tiling." Thesis, University of Warwick, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.397264.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

48

Sargeant, J. "Efficient stored data structures for dataflow computing." Thesis, University of Manchester, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.374591.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

Brown, Ewan Mitchell. "Molecular structures from diffraction and spectroscopic data." Thesis, University of Edinburgh, 1994. http://hdl.handle.net/1842/12902.

Pełny tekst źródła

Streszczenie:

Modifications have been made to the programs used at Edinburgh for the analysis of the nuclear magnetic resonance spectra of molecules dissolved in liquid crystal solvents. In addition, an investigation has been made into the use of molecular mechanics force fields to calculate vibrational corrections to diffraction and spectroscopic data, necessary if a structural analysis is to be carried out using data from diverse sources. The technique of combined analysis has been applied to the structural determination of the three isomeric difluorobenzenes and to 2-chloropyrimidine, 3,6-dichloropyridaz

Style APA, Harvard, Vancouver, ISO itp.

50

Höner, zu Siederdissen Christian, Sonja J. Prohaska, and Peter F. Stadler. "Algebraic dynamic programming over general data structures." Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-206280.

Pełny tekst źródła

Streszczenie:

Background: Dynamic programming algorithms provide exact solutions to many problems in computational biology, such as sequence alignment, RNA folding, hidden Markov models (HMMs), and scoring of phylogenetic trees. Structurally analogous algorithms compute optimal solutions, evaluate score distributions, and perform stochastic sampling. This is explained in the theory of Algebraic Dynamic Programming (ADP) by a strict separation of state space traversal (usually represented by a context free grammar), scoring (encoded as an algebra), and choice rule. A key ingredient in this theory is the use

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!