• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 147
  • 136
  • 47
  • 42
  • 15
  • 10
  • 7
  • 5
  • 4
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • Tagged with
  • 498
  • 64
  • 50
  • 48
  • 48
  • 47
  • 46
  • 46
  • 43
  • 41
  • 40
  • 38
  • 38
  • 38
  • 35
  • 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.
71

Implementing the GraphQL Interface on top of a Graph Database

Mattsson, Linn January 2020 (has links)
Since becoming an open source project in 2015, GraphQL has gained popularity as it is used as a query language from front-end to back-end, ensuring that no over-fetching or under-fetching is performed. While the query language has been openly available for a few years, there has been little academic research in this area. The aim of this thesis is to create an approach for using GraphQL on top of a graph database, as well as evaluate the optimisation techniques available for this approach. This was done by developing logical plans and query executions plans, and the suitable optimisation technique was found to be parallel execution and batching of database calls. The implementation was done in Java by using graph computing framework Apache TinkerPop, which is compatible with a number of graph databases. However, this implementation focuses on graph database management system Neo4j. To evaluate the implementation, query templates and data from Linköping GraphQL Benchmark was used. The logical plans were created by converting a GraphQL query into a tree of logical operators. The query execution plans were based on four different primitives from the Apache TinkerPop framework, and the physical operators were each influenced by one or more logical operators. The performance tests of the implementation showed that the query execution times were largely dependant on the query template as well as the number of database nodes visited. The pattern between execution times and the number of threads used in the parallel execution was concluded as lower execution times (<100 ms) were improved when 4-6 threads are used, while higher execution times were improved for 12-24 threads used. For the very fast query executions (<5 ms), using threading caused more overhead than the time saved by parallel execution, and for these cases it was better to not use any threading.
72

Episode 6.05 – Don’t Cares, the Logical Kind

Tarnoff, David 01 January 2020 (has links)
Like a wild card in a game of poker, an unspecified truth table entry called a “don’t care” can make our sum-of-products expressions so much nicer.
73

Myth and Language

Forsman, Rodger January 1965 (has links)
The word 'myth' appears frequently in contemporary theological and exegetical writing. Unfortunately, it is used with a variety of meanings by different authors, and this gives rise to the layman’s general misunderstanding of what is really a technical term. This thesis is an essay in the clarification of the notion of myth, through the use of the techniques of logical analysis of language. / Thesis / Bachelor of Divinity (BD)
74

A Computing Memory: Design and Applications wih Special Reference to Correlation

Lawrence, Dave, A. 05 1900 (has links)
<p> The philosophy of parallel processing within computers is discussed and a word-organized memory array is described in which each word location includes an independent, autonomous, arithmetic and logical processor. Several examples of computations within the memory are suggested and application in the solution of potential field problems is discussed. The concept of the arithmetic memory cell is introduced and applied in a design outline for a digital instrument capable of measuring correlation functions and mean values of fluctuating voltages. </p> / Thesis / Master of Engineering (ME)
75

Migrating an Operational Database Schema to Data Warehouse Schemas

PHIPPS, CASSANDRA J. 22 May 2002 (has links)
No description available.
76

Causality Representation and Time Warp Optimizations

Chetlur, Malolan 04 April 2007 (has links)
No description available.
77

Design of a digital logic analyzer

Vorhis, Gregory J. January 1983 (has links)
No description available.
78

Design and implementation of a microcomputer simulation system

Wallace, Jr., Walter K. January 1983 (has links)
No description available.
79

Partition Testing for Broad Efficacy and in Genetic Subgroups

Tang, Szu-Yu 19 December 2012 (has links)
No description available.
80

Logical goal-setting frameworks for leprosy projects

Ogbeiwi, Osahon 12 May 2020 (has links)
Yes / Goal setting is a fundamental practice in the effective management of healthcare services worldwide. This study investigated the extent to which leprosy goal formulation in Nigeria is logical and SMART. Method: Document review of baseline problems, goal statements and goal attainments for 2016 in six leprosy projects using a customised logical framework matrix. Results: A total of 15 main problems, 6 aims, 19 objectives and 42 indicators were found. The goals were problem-based and logically linked, with a pattern of a single aim per project, multiple objectives per aim, and multiple indicators per objective. Goal statements specified only impact in 5/6 aims, and only outcome and terminal timeframe in 17/19 (89.5%) objectives. Only one objective stated all four SMART components of outcome, indicator, target and timeframe. While three (7.1%) indicators and two (10.5%) objectives were measurable, no target was attainable. Discussion: Goal-setting frameworks for leprosy projects should be problem based and logical according to best practice. That most leprosy objectives were not completely SMART is similar to the reported structure of objectives published by other health organisations globally.

Page generated in 0.0446 seconds