• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 266
  • 52
  • 27
  • 25
  • 18
  • 10
  • 6
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 3
  • Tagged with
  • 468
  • 468
  • 350
  • 332
  • 179
  • 98
  • 63
  • 61
  • 56
  • 51
  • 50
  • 49
  • 48
  • 48
  • 46
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
31

Ordered Merkle Tree a Versatile Data-Structure for Security Kernels

Mohanty, Somya Darsan 17 August 2013 (has links)
Hidden undesired functionality is an unavoidable reality in any complex hardware or software component. Undesired functionality — deliberately introduced Trojan horses or accidentally introduced bugs — in any component of a system can be exploited by attackers to exert control over the system. This poses a serious security risk to systems — especially in the ever growing number of systems based on networks of computers. The approach adopted in this dissertation to secure systems seeks immunity from hidden functionality. Specifcally, if a minimal trusted computing base (TCB) for any system can be identifed, and if we can eliminate hidden functionality in the TCB, all desired assurances regarding the operation of the system can be guaranteed. More specifcally, the desired assurances are guaranteed even if undesired functionality may exist in every component of the system outside the TCB. A broad goal of this dissertation is to characterize the TCB for various systems as a set of functions executed by a trusted security kernel. Some constraints are deliberately imposed on the security kernel functionality to reduce the risk of hidden functionality inside the security kernel. In the security model adopted in this dissertation, any system is seen as an interconnection of subsystems, where each subsystem is associated with a security kernel. The security kernel for a subsystem performs only the bare minimal tasks required to assure the integrity of the tasks performed by the subsystem. Even while the security kernel functionality may be different for each system/subsystem, it is essential to identify reusable components of the functionality that are suitable for a wide range of systems. The contribution of the research is a versatile data-structure — Ordered Merkle Tree (OMT), which can act as the reusable component of various security kernels. The utility of OMT is illustrated by designing security kernels for subsystems participating in, 1) a remote fle storage system, 2) a generic content distribution system, 3) generic look-up servers, 4) mobile ad-hoc networks and 5) the Internet’s routing infrastructure based on the border gateway protocol (BGP).
32

A Framework for Hadoop Based Digital Libraries of Tweets

Bock, Matthew 17 July 2017 (has links)
The Digital Library Research Laboratory (DLRL) has collected over 1.5 billion tweets for the Integrated Digital Event Archiving and Library (IDEAL) and Global Event Trend Archive Research (GETAR) projects. Researchers across varying disciplines have an interest in leveraging DLRL's collections of tweets for their own analyses. However, due to the steep learning curve involved with the required tools (Spark, Scala, HBase, etc.), simply converting the Twitter data into a workable format can be a cumbersome task in itself. This prompted the effort to build a framework that will help in developing code to analyze the Twitter data, run on arbitrary tweet collections, and enable developers to leverage projects designed with this general use in mind. The intent of this thesis work is to create an extensible framework of tools and data structures to represent Twitter data at a higher level and eliminate the need to work with raw text, so as to make the development of new analytics tools faster, easier, and more efficient. To represent this data, several data structures were designed to operate on top of the Hadoop and Spark libraries of tools. The first set of data structures is an abstract representation of a tweet at a basic level, as well as several concrete implementations which represent varying levels of detail to correspond with common sources of tweet data. The second major data structure is a collection structure designed to represent collections of tweet data structures and provide ways to filter, clean, and process the collections. All of these data structures went through an iterative design process based on the needs of the developers. The effectiveness of this effort was demonstrated in four distinct case studies. In the first case study, the framework was used to build a new tool that selects Twitter data from DLRL's archive of tweets, cleans those tweets, and performs sentiment analysis within the topics of a collection's topic model. The second case study applies the provided tools for the purpose of sociolinguistic studies. The third case study explores large datasets to accumulate all possible analyses on the datasets. The fourth case study builds metadata by expanding the shortened URLs contained in the tweets and storing them as metadata about the collections. The framework proved to be useful and cut development time for all four of the case studies. / Master of Science
33

A Reparameterized Multiple Membership Model for Multilevel Nonnested Longitudinal Data

Sun, Shuyan 26 October 2012 (has links)
No description available.
34

Algorithms and data structures for hierarchical image processing

Tsanakas, Panagiotis D. January 1985 (has links)
No description available.
35

Sequential and parallel algorithms for the generalized maximum subarray problem : a thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Computer Science in the University of Canterbury /

Bae, Sung Eun. January 2007 (has links)
Thesis (Ph. D.)--University of Canterbury, 2007. / Typescript (photocopy). Includes bibliographical references (p. 212-223). Also available via the World Wide Web.
36

The representation of symmetric patterns using the Quadtree data structure /

Lodolini, Lucia. January 1988 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 1988. / Includes bibliographical references (leaves 101-103).
37

Algorithms and data structures for the implimentation of a relational database system

Orenstein, J. A. January 1982 (has links)
No description available.
38

Multipaged implementation of MRDS on UNIX

Pal, Jatinder. January 1984 (has links)
No description available.
39

Quadtree algorithms for image processing /

Benjamin, Jim Isaac. January 1991 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 1991. / Typescript. Includes bibliographical references (leaves 48-50).
40

Data structures and algorithms for data representation in constrained environments

Karras, Panagiotis. January 2007 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2007. / Title proper from title frame. Also available in printed format.

Page generated in 0.0945 seconds