• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 13
  • 5
  • 5
  • 1
  • 1
  • Tagged with
  • 27
  • 13
  • 11
  • 10
  • 7
  • 6
  • 6
  • 5
  • 4
  • 4
  • 4
  • 4
  • 4
  • 3
  • 3
  • 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.
21

Computational Flood Modeling and Visual Analysis

Johnson, Donald W 07 May 2016 (has links)
This dissertation introduces FESM (Flood Event Simulation Model), a Geographic Information System (GIS) tool designed for use on gaged river systems that can be used to guide logistic support during disaster events. FESM rapidly generates flood predictions using elevation data from real-world sensors or generated by other models. Verification and validation data for FESM are provided. In order to construct a visualization system for interacting with FESM outputs, single buffer and dual buffer techniques for moving massive datasets to the GPU for processing using OpenCL were rigorously tested and timed, and an analysis of the costs/benefits of using buffers or images was conducted. Finally, DRO (Dynamic Raster Overlay), a visualization system for analysis of datasets composed of multiple overlapping flood maps is introduced, and expert feedback is provided on the effectiveness of DRO with selected case studies.
22

Algoritmy pro vyhledání nejdelšího shodného prefixu / Longest Prefix Match Algorithms

Sedlář, František January 2013 (has links)
This master's thesis explains basics of the longest prefix match (LPM) problem. It analyzes and describes chosen LPM algorithms considering their speed, memory requirements and an ability to implement them in hardware. On the basis of former findings it proposes a new algorithm Generic Hash Tree Bitmap. It is much faster than many other approaches, while its memory requirements are even lower. An implementation of the proposed algorithm has become a part of the Netbench library.
23

Practical Application of Fast Disk Analysis for Selective Data Acquisition

gorbov, sergey 11 August 2016 (has links)
Using a forensic imager to produce a copy of the storage is a common practice. Due to the large volumes of the modern disks, the imaging may impose severe time overhead which ultimately delays the investigation process. We proposed automated disk analysis techniques that precisely identify regions on the disk that contain data. We also developed a high performance imager that produces AFFv3 images at rates exceeding 300MB/s. Using multiple disk analysis strategies we can analyze a disk within a few minutes and yet reduce the imaging time of by many hours. Partial AFFv3 images produced by our imager can be analyzed by existing digital forensics tools, which makes our approach to be easily incorporated into the workflow of practicing forensics investigators. The proposed approach renders feasible in the forensic environments where the time is critical constraint, as it provides significant performance boost, which facilitates faster investigation turnaround times and reduces case backlogs.
24

Interaktivní webové výukové aplikace z oblasti vektorové grafiky / Interactive apps for education of vector graphics theory

Lipa, Matúš January 2019 (has links)
This work deals with the creation of several interactive web applets for education of vector graphics. Described is the image signal, his discretization, vector and bitmap types of image record. Further they describe selected vector curves, their properties, algorithms for their construction and usage. The principles of rasterization of basic vector objects are explained. Using the Figma tool, graphical user interfaces for each applet are designed. These applets are implemented using HTML and Javascript. The implemented applets are placed on web pages that are used in computer graphics education.
25

Optimizing array processing on complex I/O stacks usingindices and data summarization

Xing, Haoyuan January 2021 (has links)
No description available.
26

Big Data Management Framework based on Virtualization and Bitmap Data Summarization

Su, Yu 18 May 2015 (has links)
No description available.
27

Snímání a zpracování digitálních obrazů s vysokým dynamickým rozsahem / Acquisition and Processing of Digital Images with High Dynamic Range

Mrázek, Zdeněk January 2016 (has links)
The target of this thesis is sumarize the theory of metods used for composition image sequence into single high dynamic range image. Selected methods and algorithms are described in theoretical part and implemented in practical part of this thesis. It was used C++ language with using OpenCV library.

Page generated in 0.0359 seconds