subject:(Data processing Computer science)

Johannes Gutenberg Universität Mainz

1. Hielscher, Michael. Autorenwerkzeuge für digitale, multimediale und interaktive Lernbausteine im Web 2.0.

Degree: 2012, Johannes Gutenberg Universität Mainz

URL: http://ubm.opus.hbz-nrw.de/volltexte/2013/3313/

►

Die Forschungsarbeit siedelt sich im Dreieck der Erziehungswissenschaften, der Informatik und der Schulpraxis an und besitzt somit einen starken interdisziplinären Charakter. Aus Sicht der Erziehungswissenschaften… (more)

▼

Die Forschungsarbeit siedelt sich im Dreieck der Erziehungswissenschaften, der Informatik und der Schulpraxis an und besitzt somit einen starken interdisziplinären Charakter. Aus Sicht der Erziehungswissenschaften handelt es sich um ein Forschungsprojekt aus den Bereichen E-Learning und Multimedia Learning und der Fragestellung nach geeigneten Informatiksystemen für die Herstellung und den Austausch von digitalen, multimedialen und interaktiven Lernbausteinen. Dazu wurden zunächst methodisch-didaktische Vorteile digitaler Lerninhalte gegenüber klassischen Medien wie Buch und Papier zusammengetragen und mögliche Potentiale im Zusammenhang mit neuen Web2.0-Technologien aufgezeigt. Darauf aufbauend wurde für existierende Autorenwerkzeuge zur Herstellung digitaler Lernbausteine und bestehende Austauschplattformen analysiert, inwieweit diese bereits Web 2.0-Technologien unterstützen und nutzen. Aus Sicht der Informatik ergab sich aus der Analyse bestehender Systeme ein Anforderungsproﬁl für ein neues Autorenwerkzeug und eine neue Austauschplattform für digitale Lernbausteine. Das neue System wurde nach dem Ansatz des Design Science Research in einem iterativen Entwicklungsprozess in Form der Webapplikation LearningApps.org realisiert und stetig mit Lehrpersonen aus der Schulpraxis evaluiert. Bei der Entwicklung kamen aktuelle Web-Technologien zur Anwendung. Das Ergebnis der Forschungsarbeit ist ein produktives Informatiksystem, welches bereits von tausenden Nutzern in verschiedenen Ländern sowohl in Schulen als auch in der Wirtschaft eingesetzt wird. In einer empirischen Studie konnte das mit der Systementwicklung angestrebte Ziel, die Herstellung und den Austausch von digitalen Lernbausteinen zu vereinfachen, bestätigt werden. Aus Sicht der Schulpraxis liefert LearningApps.org einen Beitrag zur Methodenvielfalt und zur Nutzung von ICT im Unterricht. Die Ausrichtung des Werkzeugs auf mobile Endgeräte und 1:1-Computing entspricht dem allgemeinen Trend im Bildungswesen. Durch die Verknüpfung des Werkzeugs mit aktuellen Software Entwicklungen zur Herstellung von digitalen Schulbüchern werden auch Lehrmittelverlage als Zielgruppe angesprochen.

This research work is positioned at the intersection of educational sciences, computer sciences and classroom teaching. As such, it has distinctly interdisciplinary character. From the viewpoint of educational sciences, this is a research project from the ﬁelds of e-learning and multimedia learning. It aims to ﬁnd software environments that are particularly suitable for both producing and exchanging digital, multimedia and interactive learning modules. Firstly, we compiled an overview of the methodical and pedagogical advantages of digital learning resources compared to classical media such as books and paper. The potential of these resources were assessed in the context of Web 2.0 technologies. Then, we analyzed both existing tools for authoring digital learning modules and also existing exchange platforms, to see how much they already support and use Web 2.0 technologies. …

Subjects/Keywords: Data processing Computer science

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hielscher, M. (2012). Autorenwerkzeuge für digitale, multimediale und interaktive Lernbausteine im Web 2.0. (Doctoral Dissertation). Johannes Gutenberg Universität Mainz. Retrieved from http://ubm.opus.hbz-nrw.de/volltexte/2013/3313/

Chicago Manual of Style (16^th Edition):

Hielscher, Michael. “Autorenwerkzeuge für digitale, multimediale und interaktive Lernbausteine im Web 2.0.” 2012. Doctoral Dissertation, Johannes Gutenberg Universität Mainz. Accessed January 18, 2021. http://ubm.opus.hbz-nrw.de/volltexte/2013/3313/.

MLA Handbook (7^th Edition):

Hielscher, Michael. “Autorenwerkzeuge für digitale, multimediale und interaktive Lernbausteine im Web 2.0.” 2012. Web. 18 Jan 2021.

Vancouver:

Hielscher M. Autorenwerkzeuge für digitale, multimediale und interaktive Lernbausteine im Web 2.0. [Internet] [Doctoral dissertation]. Johannes Gutenberg Universität Mainz; 2012. [cited 2021 Jan 18]. Available from: http://ubm.opus.hbz-nrw.de/volltexte/2013/3313/.

Council of Science Editors:

Hielscher M. Autorenwerkzeuge für digitale, multimediale und interaktive Lernbausteine im Web 2.0. [Doctoral Dissertation]. Johannes Gutenberg Universität Mainz; 2012. Available from: http://ubm.opus.hbz-nrw.de/volltexte/2013/3313/

Johannes Gutenberg Universität Mainz

2. Erbes, Rainer. Efficient parallel proximity queries and an application to highly complex motion planning problems with many narrow passages.

Degree: 2013, Johannes Gutenberg Universität Mainz

URL: http://ubm.opus.hbz-nrw.de/volltexte/2013/3438/

► In vielen Bereichen der industriellen Fertigung, wie zum Beispiel in der Automobilindustrie, wer- den digitale Versuchsmodelle (sog. digital mock-ups) eingesetzt, um die Entwicklung komplexer Maschinen… (more)

▼ In vielen Bereichen der industriellen Fertigung, wie zum Beispiel in der Automobilindustrie, wer- den digitale Versuchsmodelle (sog. digital mock-ups) eingesetzt, um die Entwicklung komplexer Maschinen m ̈oglichst gut durch Computersysteme unterstu ̈tzen zu k ̈onnen. Hierbei spielen Be- wegungsplanungsalgorithmen eine wichtige Rolle, um zu gew ̈ahrleisten, dass diese digitalen Pro- totypen auch kollisionsfrei zusammengesetzt werden k ̈onnen. In den letzten Jahrzehnten haben sich hier sampling-basierte Verfahren besonders bew ̈ahrt. Diese erzeugen eine große Anzahl von zuf ̈alligen Lagen fu ̈r das ein-/auszubauende Objekt und verwenden einen Kollisionserken- nungsmechanismus, um die einzelnen Lagen auf Gu ̈ltigkeit zu u ̈berpru ̈fen. Daher spielt die Kollisionserkennung eine wesentliche Rolle beim Design effizienter Bewegungsplanungsalgorith- men. Eine Schwierigkeit fu ̈r diese Klasse von Planern stellen sogenannte “narrow passages” dar, schmale Passagen also, die immer dort auftreten, wo die Bewegungsfreiheit der zu planenden Objekte stark eingeschr ̈ankt ist. An solchen Stellen kann es schwierig sein, eine ausreichende Anzahl von kollisionsfreien Samples zu finden. Es ist dann m ̈oglicherweise n ̈otig, ausgeklu ̈geltere Techniken einzusetzen, um eine gute Performance der Algorithmen zu erreichen.rnDie vorliegende Arbeit gliedert sich in zwei Teile: Im ersten Teil untersuchen wir parallele Kollisionserkennungsalgorithmen. Da wir auf eine Anwendung bei sampling-basierten Bewe- gungsplanern abzielen, w ̈ahlen wir hier eine Problemstellung, bei der wir stets die selben zwei Objekte, aber in einer großen Anzahl von unterschiedlichen Lagen auf Kollision testen. Wir im- plementieren und vergleichen verschiedene Verfahren, die auf Hu ̈llk ̈operhierarchien (BVHs) und hierarchische Grids als Beschleunigungsstrukturen zuru ̈ckgreifen. Alle beschriebenen Verfahren wurden auf mehreren CPU-Kernen parallelisiert. Daru ̈ber hinaus vergleichen wir verschiedene CUDA Kernels zur Durchfu ̈hrung BVH-basierter Kollisionstests auf der GPU. Neben einer un- terschiedlichen Verteilung der Arbeit auf die parallelen GPU Threads untersuchen wir hier die Auswirkung verschiedener Speicherzugriffsmuster auf die Performance der resultierenden Algo- rithmen. Weiter stellen wir eine Reihe von approximativen Kollisionstests vor, die auf den beschriebenen Verfahren basieren. Wenn eine geringere Genauigkeit der Tests tolerierbar ist, kann so eine weitere Verbesserung der Performance erzielt werden.rnIm zweiten Teil der Arbeit beschreiben wir einen von uns entworfenen parallelen, sampling- basierten Bewegungsplaner zur Behandlung hochkomplexer Probleme mit mehreren “narrow passages”. Das Verfahren arbeitet in zwei Phasen. Die grundlegende Idee ist hierbei, in der er- sten Planungsphase konzeptionell kleinere Fehler zuzulassen, um die Planungseffizienz zu erh ̈ohen und den resultierenden Pfad dann in einer zweiten Phase zu reparieren. Der hierzu in Phase I eingesetzte Planer basiert auf sogenannten Expansive Space Trees. Zus ̈atzlich haben wir den Planer…

Subjects/Keywords: Data processing Computer science

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Erbes, R. (2013). Efficient parallel proximity queries and an application to highly complex motion planning problems with many narrow passages. (Doctoral Dissertation). Johannes Gutenberg Universität Mainz. Retrieved from http://ubm.opus.hbz-nrw.de/volltexte/2013/3438/

Chicago Manual of Style (16^th Edition):

Erbes, Rainer. “Efficient parallel proximity queries and an application to highly complex motion planning problems with many narrow passages.” 2013. Doctoral Dissertation, Johannes Gutenberg Universität Mainz. Accessed January 18, 2021. http://ubm.opus.hbz-nrw.de/volltexte/2013/3438/.

MLA Handbook (7^th Edition):

Erbes, Rainer. “Efficient parallel proximity queries and an application to highly complex motion planning problems with many narrow passages.” 2013. Web. 18 Jan 2021.

Vancouver:

Erbes R. Efficient parallel proximity queries and an application to highly complex motion planning problems with many narrow passages. [Internet] [Doctoral dissertation]. Johannes Gutenberg Universität Mainz; 2013. [cited 2021 Jan 18]. Available from: http://ubm.opus.hbz-nrw.de/volltexte/2013/3438/.

Council of Science Editors:

Erbes R. Efficient parallel proximity queries and an application to highly complex motion planning problems with many narrow passages. [Doctoral Dissertation]. Johannes Gutenberg Universität Mainz; 2013. Available from: http://ubm.opus.hbz-nrw.de/volltexte/2013/3438/

Johannes Gutenberg Universität Mainz

3. Limbach, Sebastian. Software tools and efficient algorithms for the feature detection, feature tracking, event localization, and visualization of large sets of atmospheric data.

Degree: 2013, Johannes Gutenberg Universität Mainz

URL: http://ubm.opus.hbz-nrw.de/volltexte/2013/3503/

► Data sets describing the state of the earth's atmosphere are of great importance in the atmospheric sciences. Over the last decades, the quality and sheer… (more)

▼ Data sets describing the state of the earth's atmosphere are of great importance in the atmospheric sciences. Over the last decades, the quality and sheer amount of the available data increased significantly, resulting in a rising demand for new tools capable of handling and analysing these large, multidimensional sets of atmospheric data. The interdisciplinary work presented in this thesis covers the development and the application of practical software tools and efficient algorithms from the field of computer science, aiming at the goal of enabling atmospheric scientists to analyse and to gain new insights from these large data sets. For this purpose, our tools combine novel techniques with well-established methods from different areas such as scientific visualization and data segmentation. In this thesis, three practical tools are presented. Two of these tools are software systems (Insight and IWAL) for different types of processing and interactive visualization of data, the third tool is an efficient algorithm for data segmentation implemented as part of Insight.Insight is a toolkit for the interactive, three-dimensional visualization and processing of large sets of atmospheric data, originally developed as a testing environment for the novel segmentation algorithm. It provides a dynamic system for combining at runtime data from different sources, a variety of different data processing algorithms, and several visualization techniques. Its modular architecture and flexible scripting support led to additional applications of the software, from which two examples are presented: the usage of Insight as a WMS (web map service) server, and the automatic production of a sequence of images for the visualization of cyclone simulations. The core application of Insight is the provision of the novel segmentation algorithm for the efficient detection and tracking of 3D features in large sets of atmospheric data, as well as for the precise localization of the occurring genesis, lysis, merging and splitting events. Data segmentation usually leads to a significant reduction of the size of the considered data. This enables a practical visualization of the data, statistical analyses of the features and their events, and the manual or automatic detection of interesting situations for subsequent detailed investigation. The concepts of the novel algorithm, its technical realization, and several extensions for avoiding under- and over-segmentation are discussed. As example applications, this thesis covers the setup and the results of the segmentation of upper-tropospheric jet streams and cyclones as full 3D objects. Finally, IWAL is presented, which is a web application for providing an easy interactive access to meteorological data visualizations, primarily aimed at students. As a web application, the needs to retrieve all input data sets and to install and handle complex visualization tools on a local machine are avoided. The main challenge in the provision of customizable visualizations to large numbers of simultaneous users was…

Subjects/Keywords: Data processing Computer science

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Limbach, S. (2013). Software tools and efficient algorithms for the feature detection, feature tracking, event localization, and visualization of large sets of atmospheric data. (Doctoral Dissertation). Johannes Gutenberg Universität Mainz. Retrieved from http://ubm.opus.hbz-nrw.de/volltexte/2013/3503/

Chicago Manual of Style (16^th Edition):

Limbach, Sebastian. “Software tools and efficient algorithms for the feature detection, feature tracking, event localization, and visualization of large sets of atmospheric data.” 2013. Doctoral Dissertation, Johannes Gutenberg Universität Mainz. Accessed January 18, 2021. http://ubm.opus.hbz-nrw.de/volltexte/2013/3503/.

MLA Handbook (7^th Edition):

Limbach, Sebastian. “Software tools and efficient algorithms for the feature detection, feature tracking, event localization, and visualization of large sets of atmospheric data.” 2013. Web. 18 Jan 2021.

Vancouver:

Limbach S. Software tools and efficient algorithms for the feature detection, feature tracking, event localization, and visualization of large sets of atmospheric data. [Internet] [Doctoral dissertation]. Johannes Gutenberg Universität Mainz; 2013. [cited 2021 Jan 18]. Available from: http://ubm.opus.hbz-nrw.de/volltexte/2013/3503/.

Council of Science Editors:

Limbach S. Software tools and efficient algorithms for the feature detection, feature tracking, event localization, and visualization of large sets of atmospheric data. [Doctoral Dissertation]. Johannes Gutenberg Universität Mainz; 2013. Available from: http://ubm.opus.hbz-nrw.de/volltexte/2013/3503/

Johannes Gutenberg Universität Mainz

4. Hoffmann, Sebastian. Optimized scheduling in real-time environments with column generation.

Degree: 2014, Johannes Gutenberg Universität Mainz

URL: http://ubm.opus.hbz-nrw.de/volltexte/2014/3865/

►

Im Bereich sicherheitsrelevanter eingebetteter Systeme stellt sich der Designprozess von Anwendungen als sehr komplex dar. Entsprechend einer gegebenen Hardwarearchitektur lassen sich Steuergeräte aufrüsten, um alle… (more)

▼

Im Bereich sicherheitsrelevanter eingebetteter Systeme stellt sich der Designprozess von Anwendungen als sehr komplex dar. Entsprechend einer gegebenen Hardwarearchitektur lassen sich Steuergeräte aufrüsten, um alle bestehenden Prozesse und Signale pünktlich auszuführen. Die zeitlichen Anforderungen sind strikt und müssen in jeder periodischen Wiederkehr der Prozesse erfüllt sein, da die Sicherstellung der parallelen Ausführung von größter Bedeutung ist. Existierende Ansätze können schnell Designalternativen berechnen, aber sie gewährleisten nicht, dass die Kosten für die nötigen Hardwareänderungen minimal sind. Wir stellen einen Ansatz vor, der kostenminimale Lösungen für das Problem berechnet, die alle zeitlichen Bedingungen erfüllen. Unser Algorithmus verwendet Lineare Programmierung mit Spaltengenerierung, eingebettet in eine Baumstruktur, um untere und obere Schranken während des Optimierungsprozesses bereitzustellen. Die komplexen Randbedingungen zur Gewährleistung der periodischen Ausführung verlagern sich durch eine Zerlegung des Hauptproblems in unabhängige Unterprobleme, die als ganzzahlige lineare Programme formuliert sind. Sowohl die Analysen zur Prozessausführung als auch die Methoden zur Signalübertragung werden untersucht und linearisierte Darstellungen angegeben. Des Weiteren präsentieren wir eine neue Formulierung für die Ausführung mit fixierten Prioritäten, die zusätzlich Prozessantwortzeiten im schlimmsten anzunehmenden Fall berechnet, welche für Szenarien nötig sind, in denen zeitliche Bedingungen an Teilmengen von Prozessen und Signalen gegeben sind. Wir weisen die Anwendbarkeit unserer Methoden durch die Analyse von Instanzen nach, welche Prozessstrukturen aus realen Anwendungen enthalten. Unsere Ergebnisse zeigen, dass untere Schranken schnell berechnet werden können, um die Optimalität von heuristischen Lösungen zu beweisen. Wenn wir optimale Lösungen mit Antwortzeiten liefern, stellt sich unsere neue Formulierung in der Laufzeitanalyse vorteilhaft gegenüber anderen Ansätzen dar. Die besten Resultate werden mit einem hybriden Ansatz erzielt, der heuristische Startlösungen, eine Vorverarbeitung und eine heuristische mit einer kurzen nachfolgenden exakten Berechnungsphase verbindet.

The design process of embedded applications in safety-critical systems is very complex. With regard to the distributed hardware architecture, computing units can be upgraded to execute all existing tasks and transmit all arising messages on time. As the timing requirements are strict and have to be fulfilled in every periodic occurrence of the tasks, the guarantee of schedulability is of highest importance. Existing approaches are able to quickly generate possible design alternatives, but they come with no guarantee of minimal cost for the applied hardware modifications. We propose an approach that provides cost-minimal solutions to the distributed scheduling problem while satisfying all timing requirements. Our algorithm uses linear programming with column generation encapsulated in a branch and bound framework…

Subjects/Keywords: Data processing Computer science

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Hoffmann, S. (2014). Optimized scheduling in real-time environments with column generation. (Doctoral Dissertation). Johannes Gutenberg Universität Mainz. Retrieved from http://ubm.opus.hbz-nrw.de/volltexte/2014/3865/

Chicago Manual of Style (16^th Edition):

Hoffmann, Sebastian. “Optimized scheduling in real-time environments with column generation.” 2014. Doctoral Dissertation, Johannes Gutenberg Universität Mainz. Accessed January 18, 2021. http://ubm.opus.hbz-nrw.de/volltexte/2014/3865/.

MLA Handbook (7^th Edition):

Hoffmann, Sebastian. “Optimized scheduling in real-time environments with column generation.” 2014. Web. 18 Jan 2021.

Vancouver:

Hoffmann S. Optimized scheduling in real-time environments with column generation. [Internet] [Doctoral dissertation]. Johannes Gutenberg Universität Mainz; 2014. [cited 2021 Jan 18]. Available from: http://ubm.opus.hbz-nrw.de/volltexte/2014/3865/.

Council of Science Editors:

Hoffmann S. Optimized scheduling in real-time environments with column generation. [Doctoral Dissertation]. Johannes Gutenberg Universität Mainz; 2014. Available from: http://ubm.opus.hbz-nrw.de/volltexte/2014/3865/

Hong Kong University of Science and Technology

5. Cui, Weiwei. Visual summarization and exploration of text streams.

Degree: 2011, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-7318 ; https://doi.org/10.14711/thesis-b1155154 ; http://repository.ust.hk/ir/bitstream/1783.1-7318/1/th_redirect.html

► We are in the midst of a data explosion. Data in text format such as digitalized textural data and data from new social media like… (more)

Subjects/Keywords: Electronic data processing ; Text processing (Computer science) ; Visualization – Data processing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Cui, W. (2011). Visual summarization and exploration of text streams. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7318 ; https://doi.org/10.14711/thesis-b1155154 ; http://repository.ust.hk/ir/bitstream/1783.1-7318/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Cui, Weiwei. “Visual summarization and exploration of text streams.” 2011. Thesis, Hong Kong University of Science and Technology. Accessed January 18, 2021. http://repository.ust.hk/ir/Record/1783.1-7318 ; https://doi.org/10.14711/thesis-b1155154 ; http://repository.ust.hk/ir/bitstream/1783.1-7318/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Cui, Weiwei. “Visual summarization and exploration of text streams.” 2011. Web. 18 Jan 2021.

Vancouver:

Cui W. Visual summarization and exploration of text streams. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2011. [cited 2021 Jan 18]. Available from: http://repository.ust.hk/ir/Record/1783.1-7318 ; https://doi.org/10.14711/thesis-b1155154 ; http://repository.ust.hk/ir/bitstream/1783.1-7318/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cui W. Visual summarization and exploration of text streams. [Thesis]. Hong Kong University of Science and Technology; 2011. Available from: http://repository.ust.hk/ir/Record/1783.1-7318 ; https://doi.org/10.14711/thesis-b1155154 ; http://repository.ust.hk/ir/bitstream/1783.1-7318/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

6. Bai, Ge. Accelerating lossless data compression with graphics processors.

Degree: 2014, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-63079 ; https://doi.org/10.14711/thesis-b1301497 ; http://repository.ust.hk/ir/bitstream/1783.1-63079/1/th_redirect.html

► Lossless data compression tools, such as bzip2, gzip, and winzip, are widely used in our daily lives as well as in enterprise settings. With these… (more)

Subjects/Keywords: Graphics processing units ; Data compression (Computer science) ; Computer graphics ; Data processing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bai, G. (2014). Accelerating lossless data compression with graphics processors. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-63079 ; https://doi.org/10.14711/thesis-b1301497 ; http://repository.ust.hk/ir/bitstream/1783.1-63079/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Bai, Ge. “Accelerating lossless data compression with graphics processors.” 2014. Thesis, Hong Kong University of Science and Technology. Accessed January 18, 2021. http://repository.ust.hk/ir/Record/1783.1-63079 ; https://doi.org/10.14711/thesis-b1301497 ; http://repository.ust.hk/ir/bitstream/1783.1-63079/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Bai, Ge. “Accelerating lossless data compression with graphics processors.” 2014. Web. 18 Jan 2021.

Vancouver:

Bai G. Accelerating lossless data compression with graphics processors. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2014. [cited 2021 Jan 18]. Available from: http://repository.ust.hk/ir/Record/1783.1-63079 ; https://doi.org/10.14711/thesis-b1301497 ; http://repository.ust.hk/ir/bitstream/1783.1-63079/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bai G. Accelerating lossless data compression with graphics processors. [Thesis]. Hong Kong University of Science and Technology; 2014. Available from: http://repository.ust.hk/ir/Record/1783.1-63079 ; https://doi.org/10.14711/thesis-b1301497 ; http://repository.ust.hk/ir/bitstream/1783.1-63079/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Michigan State University

7. Chen, Fei. Privacy and integrity preserving computation in distributed systems.

Degree: 2011, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:1811

►

Thesis Ph. D. Michigan State University. Computer Science 2011.

Preserving privacy and integrity of private data has become core requirements for many distributed systems across… (more)

▼

Thesis Ph. D. Michigan State University. Computer Science 2011.

Preserving privacy and integrity of private data has become core requirements for many distributed systems across different parties. In these systems, one party may try to compute or aggregate useful information from the private data of other parties. However, this party is not be fully trusted by other parties. Therefore, it is important to design security protocols for preserving such private data. Furthermore, one party may want to query the useful information computed from such private data. However, query results may be modified by a malicious party. Thus, it is important to design query protocols such that query result integrity can be verified.In this dissertation, we study four important privacy and integrity preserving problems for different distributed systems. For two-tiered sensor networks, where storage nodes serve as an intermediate tier between sensors and a sink for storing data and processing queries, we proposed SafeQ, a protocol that prevents compromised storage nodes from gaining information from both sensor collected data and sink issued queries, while it still allows storage nodes to process queries over encrypted data and the sink to detect compromised storage nodes when they misbehave. For cloud computing, where a cloud provider hosts the data of an organization and replies query results to the customers of the organization, we propose novel privacy and integrity preserving schemes for multi-dimensional range queries such that the cloud provider can process encoded queries over encoded data without knowing the actual values, and customers can verify the integrity of query results with high probability. For distributed firewall policies, we proposed the first privacy-preserving protocol for cross-domain firewall policy optimization. For any two adjacent firewalls belonging to two different administrative domains, our protocol can identify in each firewall the rules that can be removed because of the other firewall. For network reachability, one of the key factors for capturing end-to-end network behavior and detecting the violation of security policies, we proposed the first cross-domain privacy-preserving protocol for quantifying network reachability.

Description based on online resource; title from PDF t.p. (viewed on May 7, 2012).

Advisors/Committee Members: Liu, Alex X., Torng, Eric, Enbody, Richard, Radha, Hayder.

Subjects/Keywords: Data protection; Computer security; Electronic data processing – Distributed processing; Computer science

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chen, F. (2011). Privacy and integrity preserving computation in distributed systems. (Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:1811

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Chen, Fei. “Privacy and integrity preserving computation in distributed systems.” 2011. Thesis, Michigan State University. Accessed January 18, 2021. http://etd.lib.msu.edu/islandora/object/etd:1811.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Chen, Fei. “Privacy and integrity preserving computation in distributed systems.” 2011. Web. 18 Jan 2021.

Vancouver:

Chen F. Privacy and integrity preserving computation in distributed systems. [Internet] [Thesis]. Michigan State University; 2011. [cited 2021 Jan 18]. Available from: http://etd.lib.msu.edu/islandora/object/etd:1811.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen F. Privacy and integrity preserving computation in distributed systems. [Thesis]. Michigan State University; 2011. Available from: http://etd.lib.msu.edu/islandora/object/etd:1811

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

8. Wu, Junfeng. Event-based state estimation : theory and applications.

Degree: 2013, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-62248 ; https://doi.org/10.14711/thesis-b1255604 ; http://repository.ust.hk/ir/bitstream/1783.1-62248/1/th_redirect.html

► This thesis focuses on remote state estimation problem where an estimator uses data sent by a sensor to estimate the state of a linear discrete-time… (more)

Subjects/Keywords: Event processing (Computer science) ; Electronic data processing ; Distributed processing ; Sensor networks ; Data processing ; Estimation theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Wu, J. (2013). Event-based state estimation : theory and applications. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-62248 ; https://doi.org/10.14711/thesis-b1255604 ; http://repository.ust.hk/ir/bitstream/1783.1-62248/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Wu, Junfeng. “Event-based state estimation : theory and applications.” 2013. Thesis, Hong Kong University of Science and Technology. Accessed January 18, 2021. http://repository.ust.hk/ir/Record/1783.1-62248 ; https://doi.org/10.14711/thesis-b1255604 ; http://repository.ust.hk/ir/bitstream/1783.1-62248/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Wu, Junfeng. “Event-based state estimation : theory and applications.” 2013. Web. 18 Jan 2021.

Vancouver:

Wu J. Event-based state estimation : theory and applications. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2013. [cited 2021 Jan 18]. Available from: http://repository.ust.hk/ir/Record/1783.1-62248 ; https://doi.org/10.14711/thesis-b1255604 ; http://repository.ust.hk/ir/bitstream/1783.1-62248/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wu J. Event-based state estimation : theory and applications. [Thesis]. Hong Kong University of Science and Technology; 2013. Available from: http://repository.ust.hk/ir/Record/1783.1-62248 ; https://doi.org/10.14711/thesis-b1255604 ; http://repository.ust.hk/ir/bitstream/1783.1-62248/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

9. Qiu, Yuan CSE. Towards online aggregation for SPJ queries.

Degree: 2019, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-102377 ; https://doi.org/10.14711/thesis-991012757568903412 ; http://repository.ust.hk/ir/bitstream/1783.1-102377/1/th_redirect.html

► Select-Project-Join (SPJ) Queries are essential building blocks of general queries. Efficiently estimating their output sizes critically affects the effectiveness of Cost-Based Optimizers (CBOs) in generating… (more)

Subjects/Keywords: Querying (Computer science) ; Data processing ; Databases ; Online data processing ; Relation algebras

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Qiu, Y. C. (2019). Towards online aggregation for SPJ queries. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-102377 ; https://doi.org/10.14711/thesis-991012757568903412 ; http://repository.ust.hk/ir/bitstream/1783.1-102377/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Qiu, Yuan CSE. “Towards online aggregation for SPJ queries.” 2019. Thesis, Hong Kong University of Science and Technology. Accessed January 18, 2021. http://repository.ust.hk/ir/Record/1783.1-102377 ; https://doi.org/10.14711/thesis-991012757568903412 ; http://repository.ust.hk/ir/bitstream/1783.1-102377/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Qiu, Yuan CSE. “Towards online aggregation for SPJ queries.” 2019. Web. 18 Jan 2021.

Vancouver:

Qiu YC. Towards online aggregation for SPJ queries. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2019. [cited 2021 Jan 18]. Available from: http://repository.ust.hk/ir/Record/1783.1-102377 ; https://doi.org/10.14711/thesis-991012757568903412 ; http://repository.ust.hk/ir/bitstream/1783.1-102377/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Qiu YC. Towards online aggregation for SPJ queries. [Thesis]. Hong Kong University of Science and Technology; 2019. Available from: http://repository.ust.hk/ir/Record/1783.1-102377 ; https://doi.org/10.14711/thesis-991012757568903412 ; http://repository.ust.hk/ir/bitstream/1783.1-102377/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

10. Chui, Sung Him. On encrypted-domain signal processing.

Degree: 2013, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-62302 ; https://doi.org/10.14711/thesis-b1251097 ; http://repository.ust.hk/ir/bitstream/1783.1-62302/1/th_redirect.html

► In this big data era, often a person (say Bob) needs another person (say Alice) to perform processing on his data. But both Alice and… (more)

Subjects/Keywords: Signal processing ; Data processing ; Cryptography ; Data encryption (Computer science)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chui, S. H. (2013). On encrypted-domain signal processing. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-62302 ; https://doi.org/10.14711/thesis-b1251097 ; http://repository.ust.hk/ir/bitstream/1783.1-62302/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Chui, Sung Him. “On encrypted-domain signal processing.” 2013. Thesis, Hong Kong University of Science and Technology. Accessed January 18, 2021. http://repository.ust.hk/ir/Record/1783.1-62302 ; https://doi.org/10.14711/thesis-b1251097 ; http://repository.ust.hk/ir/bitstream/1783.1-62302/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Chui, Sung Him. “On encrypted-domain signal processing.” 2013. Web. 18 Jan 2021.

Vancouver:

Chui SH. On encrypted-domain signal processing. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2013. [cited 2021 Jan 18]. Available from: http://repository.ust.hk/ir/Record/1783.1-62302 ; https://doi.org/10.14711/thesis-b1251097 ; http://repository.ust.hk/ir/bitstream/1783.1-62302/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chui SH. On encrypted-domain signal processing. [Thesis]. Hong Kong University of Science and Technology; 2013. Available from: http://repository.ust.hk/ir/Record/1783.1-62302 ; https://doi.org/10.14711/thesis-b1251097 ; http://repository.ust.hk/ir/bitstream/1783.1-62302/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Drexel University

11. Oxholm, Geoffrey. Reconstructing Geometry from Its Latent Structures.

Degree: 2014, Drexel University

URL: http://hdl.handle.net/1860/4562

►

Our world is full of objects with complex shapes and structures. Through extensive experience humans quickly develop an intuition about how objects are shaped, and… (more)

▼

Our world is full of objects with complex shapes and structures. Through extensive experience humans quickly develop an intuition about how objects are shaped, and what their material properties are simply by analyzing their appearance. We engage this intuitive understanding of geometry in nearly everything we do.It is not surprising then, that a careful treatment of geometry stands to give machines a powerful advantage in the many tasks of visual perception. To that end, this thesis focuses on geometry recovery in a wide range of real-world problems. First, we describe a new approach to image registration. We observe that the structure of the imaged subject becomes embedded in the image intensities. By minimizing the change in shape of these intensity structures we ensure a physically realizable deformation. We then describe a method for reassembling fragmented, thin-shelled objects from range-images of their fragments using only the geometric and photometric structure embedded in the boundary of each fragment. Third, we describe a method for recovering and representing the shape of a geometric texture (such as bark, or sandpaper) by studying the characteristic properties of texture – self similarity and scale variability. Finally, we describe two methods for recovering the 3D geometry and reflectance properties of an object from images taken under natural illumination. We note that the structure of the surrounding environment, modulated by the reflectance, becomes embedded in the appearance of the object giving strong clues about the object's shape.Though these domains are quite diverse, an essential premise – that observations of objects contain within them salient clues about the object's structure – enables new and powerful approaches. For each problem we begin by investigating what these clues are.We then derive models and methods to canonically represent these clues and enable their full exploitation. The wide-ranging success of each method shows the importance of our carefully formulated observations about geometry, and the fundamental role geometry plays in visual perception.

Ph.D., Computer Science – Drexel University, 2014

Advisors/Committee Members: Nishino, Ko.

Subjects/Keywords: Computer science; Geometry – Data processing; Geometrical constructions

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Oxholm, G. (2014). Reconstructing Geometry from Its Latent Structures. (Thesis). Drexel University. Retrieved from http://hdl.handle.net/1860/4562

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Oxholm, Geoffrey. “Reconstructing Geometry from Its Latent Structures.” 2014. Thesis, Drexel University. Accessed January 18, 2021. http://hdl.handle.net/1860/4562.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Oxholm, Geoffrey. “Reconstructing Geometry from Its Latent Structures.” 2014. Web. 18 Jan 2021.

Vancouver:

Oxholm G. Reconstructing Geometry from Its Latent Structures. [Internet] [Thesis]. Drexel University; 2014. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1860/4562.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Oxholm G. Reconstructing Geometry from Its Latent Structures. [Thesis]. Drexel University; 2014. Available from: http://hdl.handle.net/1860/4562

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Johannesburg

12. Schoeman, Isabella Lodewina. 'n Ekspertstelsel vir die beheer van pneumonie in 'n kritiese sorg eenheid.

Degree: 2012, University of Johannesburg

URL: http://hdl.handle.net/10210/5675

►

M.Sc.

Surgical patients admitted to an intensive care unit, are susceptible to infection by a large number of micro-organisms. Host defence mechanisms are breached by… (more)

Subjects/Keywords: Expert systems (Computer science); Medicine - Data processing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Schoeman, I. L. (2012). 'n Ekspertstelsel vir die beheer van pneumonie in 'n kritiese sorg eenheid. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/5675

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Schoeman, Isabella Lodewina. “'n Ekspertstelsel vir die beheer van pneumonie in 'n kritiese sorg eenheid.” 2012. Thesis, University of Johannesburg. Accessed January 18, 2021. http://hdl.handle.net/10210/5675.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Schoeman, Isabella Lodewina. “'n Ekspertstelsel vir die beheer van pneumonie in 'n kritiese sorg eenheid.” 2012. Web. 18 Jan 2021.

Vancouver:

Schoeman IL. 'n Ekspertstelsel vir die beheer van pneumonie in 'n kritiese sorg eenheid. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10210/5675.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schoeman IL. 'n Ekspertstelsel vir die beheer van pneumonie in 'n kritiese sorg eenheid. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/5675

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Reykjavík University

13. Þórhildur Þorleiksdóttir 1994-. Blackthorn Pruning: High-Performance Interactive Multimodal Learning with Approximate High-Dimensional Indexing .

Degree: 2018, Reykjavík University

URL: http://hdl.handle.net/1946/31204

► As the size of multimedia collections grows, so does the need for efficient and scalable search and exploration methods. In this thesis we present Blackthorn… (more)

Subjects/Keywords: Tölvunarfræði; Gagnavinnsla; Computer science; Data processing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

1994-, �. �. (2018). Blackthorn Pruning: High-Performance Interactive Multimodal Learning with Approximate High-Dimensional Indexing . (Thesis). Reykjavík University. Retrieved from http://hdl.handle.net/1946/31204

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

1994-, Þórhildur Þorleiksdóttir. “Blackthorn Pruning: High-Performance Interactive Multimodal Learning with Approximate High-Dimensional Indexing .” 2018. Thesis, Reykjavík University. Accessed January 18, 2021. http://hdl.handle.net/1946/31204.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

1994-, Þórhildur Þorleiksdóttir. “Blackthorn Pruning: High-Performance Interactive Multimodal Learning with Approximate High-Dimensional Indexing .” 2018. Web. 18 Jan 2021.

Vancouver:

1994- ��. Blackthorn Pruning: High-Performance Interactive Multimodal Learning with Approximate High-Dimensional Indexing . [Internet] [Thesis]. Reykjavík University; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1946/31204.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

1994- ��. Blackthorn Pruning: High-Performance Interactive Multimodal Learning with Approximate High-Dimensional Indexing . [Thesis]. Reykjavík University; 2018. Available from: http://hdl.handle.net/1946/31204

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Nelson Mandela Metropolitan University

14. Okere, Irene Onyekachi. A control framework for the assessment of information security culture.

Degree: MTech, Faculty of Business and Economic Sciences, 2013, Nelson Mandela Metropolitan University

URL: http://hdl.handle.net/10948/d1019861

► The modern organisation relies heavily on information to function effectively. With such reliance on information, it is vital that information be protected from both internal… (more)

▼ The modern organisation relies heavily on information to function effectively. With such reliance on information, it is vital that information be protected from both internal (employees) and external threats. The protection of information or information security to a large extent depends on the behaviour of humans (employees) in the organisation. The behaviour of employees is one of the top information security issues facing organisations as the human factor is regarded as the weakest link in the security chain. To address this human factor many researchers have suggested the fostering of a culture of information security so that information security becomes second nature to employees. Information security culture as defined for this research study exists in four levels namely artefacts, espoused values, shared tacit assumptions and information security knowledge. An important step in the fostering of an information security culture is the assessment of the current state of such a culture. Gaps in current approaches for assessing information security culture were identified and this research study proposes the use of a control framework to address the identified gaps. This research study focuses on the assessment of information security culture and addresses 5 research objectives namely 1) to describe information security culture in the field of information security, 2) to determine ways to foster information security culture in an organisation, 3) to demonstrate the gap in current approaches used to assess information security culture, 4) to determine the components that could be used for the assessment of information security culture for each of the culture’s underlying levels and 5) to describe a process for the assessment of information security culture for all four levels. This research study follows a qualitative approach utilising a design science strategy and multi-method qualitative data collection techniques including literature review, qualitative content analysis, argumentation, and modelling techniques. The research methods provide a means for the interpretation of the data and the development of the proposed control framework. Advisors/Committee Members: Van Niekerk, Johan Prof, Carroll, Mariana Dr.

Subjects/Keywords: Data encryption (Computer science); Business – Data processing – Security measures; Computer security

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Okere, I. O. (2013). A control framework for the assessment of information security culture. (Masters Thesis). Nelson Mandela Metropolitan University. Retrieved from http://hdl.handle.net/10948/d1019861

Chicago Manual of Style (16^th Edition):

Okere, Irene Onyekachi. “A control framework for the assessment of information security culture.” 2013. Masters Thesis, Nelson Mandela Metropolitan University. Accessed January 18, 2021. http://hdl.handle.net/10948/d1019861.

MLA Handbook (7^th Edition):

Okere, Irene Onyekachi. “A control framework for the assessment of information security culture.” 2013. Web. 18 Jan 2021.

Vancouver:

Okere IO. A control framework for the assessment of information security culture. [Internet] [Masters thesis]. Nelson Mandela Metropolitan University; 2013. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10948/d1019861.

Council of Science Editors:

Okere IO. A control framework for the assessment of information security culture. [Masters Thesis]. Nelson Mandela Metropolitan University; 2013. Available from: http://hdl.handle.net/10948/d1019861

University of Washington

15. Pervaiz, Fahad. Understanding Challenges in the Data Pipeline for Development Data.

Degree: PhD, 2019, University of Washington

URL: http://hdl.handle.net/1773/44145

► The developing world is relying more and more on data driven policies. Numerous development agencies have pushed for on-ground data collection to support the development… (more)

Subjects/Keywords: Data Cleaning; Data Pipeline; Data Processing; Computer science; Computer science and engineering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Pervaiz, F. (2019). Understanding Challenges in the Data Pipeline for Development Data. (Doctoral Dissertation). University of Washington. Retrieved from http://hdl.handle.net/1773/44145

Chicago Manual of Style (16^th Edition):

Pervaiz, Fahad. “Understanding Challenges in the Data Pipeline for Development Data.” 2019. Doctoral Dissertation, University of Washington. Accessed January 18, 2021. http://hdl.handle.net/1773/44145.

MLA Handbook (7^th Edition):

Pervaiz, Fahad. “Understanding Challenges in the Data Pipeline for Development Data.” 2019. Web. 18 Jan 2021.

Vancouver:

Pervaiz F. Understanding Challenges in the Data Pipeline for Development Data. [Internet] [Doctoral dissertation]. University of Washington; 2019. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/1773/44145.

Council of Science Editors:

Pervaiz F. Understanding Challenges in the Data Pipeline for Development Data. [Doctoral Dissertation]. University of Washington; 2019. Available from: http://hdl.handle.net/1773/44145

Nelson Mandela Metropolitan University

16. Koekemoer, Silma Marguerite. A strategy towards implementing standardised data structures in municipal information systems.

Degree: 2020, Nelson Mandela Metropolitan University

URL: http://hdl.handle.net/10948/46064

► The regulation pertaining to a Standard Chart of Accounts (SCOA) for Municipalities was published in 2014 and is applicable to all 257 municipalities and municipal… (more)

▼ The regulation pertaining to a Standard Chart of Accounts (SCOA) for Municipalities was published in 2014 and is applicable to all 257 municipalities and municipal entities in South Africa. The regulation represents a data classification framework or structure and affects all financial management and internal control systems (FMICS) used by municipalities and municipal entities, and affects key business processes within these organisations. Compliance with the SCOA regulation means that the full municipal accountability cycle should accommodate all seven of the SCOA segments, from the budget through transacting and reporting at the transaction level, with all seven of the segments being embedded in the master data table of the municipal FMICS. While the change to technology and systems may be self-evident, the related business change should not be underestimated. This information technology (IT) driven organisational change across the whole municipal environment represents the research topic and key objective of this research study, namely, a strategy towards implementing standard data structures in municipal IT systems. The study followed a pragmatic philosophy using diagnostic reasoning based on an inductive approach, multiple action research methods and a descriptive case study to derive the proposed implementation strategy. The research subjects, which included 25 pilot municipalities, were studied for the duration of the pilot implementation of the strategy with the objective of identifying and utilising the lessons learnt from their experience to fast track the rollout of the strategy to non-pilot municipalities. The study was limited to the local government environment and to South Africa as a geographic area and involved an accidental sample aligned to the implementation project under investigation. The proposed implementation strategy was, however, of a generic nature and is therefore applicable to any other institution or environment engaged in a similar implementation project. The main contribution of the study is an implementation strategy for standard data structures in municipal financial information systems and which consists of seven diagnostics, 17 guiding policies and 48 coherent actions. The strategy was developed and refined during six cycles of data collection, which were conducted at 25 municipalities actively involved in implementing of the standard data structures. The secondary contributions of the research study include three conference papers and one submission to an academic journal.

Subjects/Keywords: Data structures (Computer science); Municipal government – Data processing; Public administration – Data processing; Management information systems

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Koekemoer, S. M. (2020). A strategy towards implementing standardised data structures in municipal information systems. (Thesis). Nelson Mandela Metropolitan University. Retrieved from http://hdl.handle.net/10948/46064

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Koekemoer, Silma Marguerite. “A strategy towards implementing standardised data structures in municipal information systems.” 2020. Thesis, Nelson Mandela Metropolitan University. Accessed January 18, 2021. http://hdl.handle.net/10948/46064.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Koekemoer, Silma Marguerite. “A strategy towards implementing standardised data structures in municipal information systems.” 2020. Web. 18 Jan 2021.

Vancouver:

Koekemoer SM. A strategy towards implementing standardised data structures in municipal information systems. [Internet] [Thesis]. Nelson Mandela Metropolitan University; 2020. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10948/46064.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Koekemoer SM. A strategy towards implementing standardised data structures in municipal information systems. [Thesis]. Nelson Mandela Metropolitan University; 2020. Available from: http://hdl.handle.net/10948/46064

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Columbia University

17. Lu, Feihan. Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine.

Degree: 2018, Columbia University

URL: https://doi.org/10.7916/D8VD8FXF

► Bayesian statistical procedures use probabilistic models and probability distributions to summarize data, estimate unknown quantities of interest, and predict future observations. The procedures borrow strength… (more)

Subjects/Keywords: Statistics; Bayesian statistical decision theory; Data structures (Computer science); Neurosciences – Data processing; Medicine – Data processing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Lu, F. (2018). Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8VD8FXF

Chicago Manual of Style (16^th Edition):

Lu, Feihan. “Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine.” 2018. Doctoral Dissertation, Columbia University. Accessed January 18, 2021. https://doi.org/10.7916/D8VD8FXF.

MLA Handbook (7^th Edition):

Lu, Feihan. “Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine.” 2018. Web. 18 Jan 2021.

Vancouver:

Lu F. Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine. [Internet] [Doctoral dissertation]. Columbia University; 2018. [cited 2021 Jan 18]. Available from: https://doi.org/10.7916/D8VD8FXF.

Council of Science Editors:

Lu F. Bayesian Modeling Strategies for Complex Data Structures, with Applications to Neuroscience and Medicine. [Doctoral Dissertation]. Columbia University; 2018. Available from: https://doi.org/10.7916/D8VD8FXF

Hong Kong University of Science and Technology

18. Zhao, Baoxue. Accelerating astronomical source extraction with graphics processors.

Degree: 2014, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-72505 ; https://doi.org/10.14711/thesis-b1432227 ; http://repository.ust.hk/ir/bitstream/1783.1-72505/1/th_redirect.html

► In astronomical observatory projects, source extraction is the process of extracting celestial objects from observational images and outputting object catalogs. It is the basis for… (more)

Subjects/Keywords: Graphics processing units ; Astronomy ; Data processing ; Computer graphics ; Data compression (Computer science)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Zhao, B. (2014). Accelerating astronomical source extraction with graphics processors. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-72505 ; https://doi.org/10.14711/thesis-b1432227 ; http://repository.ust.hk/ir/bitstream/1783.1-72505/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Zhao, Baoxue. “Accelerating astronomical source extraction with graphics processors.” 2014. Thesis, Hong Kong University of Science and Technology. Accessed January 18, 2021. http://repository.ust.hk/ir/Record/1783.1-72505 ; https://doi.org/10.14711/thesis-b1432227 ; http://repository.ust.hk/ir/bitstream/1783.1-72505/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Zhao, Baoxue. “Accelerating astronomical source extraction with graphics processors.” 2014. Web. 18 Jan 2021.

Vancouver:

Zhao B. Accelerating astronomical source extraction with graphics processors. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2014. [cited 2021 Jan 18]. Available from: http://repository.ust.hk/ir/Record/1783.1-72505 ; https://doi.org/10.14711/thesis-b1432227 ; http://repository.ust.hk/ir/bitstream/1783.1-72505/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhao B. Accelerating astronomical source extraction with graphics processors. [Thesis]. Hong Kong University of Science and Technology; 2014. Available from: http://repository.ust.hk/ir/Record/1783.1-72505 ; https://doi.org/10.14711/thesis-b1432227 ; http://repository.ust.hk/ir/bitstream/1783.1-72505/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

19. Tan, Yuwei. Accelerating genomic sequence compression with graphics processors.

Degree: 2012, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-7573 ; https://doi.org/10.14711/thesis-b1180160 ; http://repository.ust.hk/ir/bitstream/1783.1-7573/1/th_redirect.html

► A modern sequencing instrument is able to generate hundreds of millions of short reads of genomic data on a daily basis. As a result, there… (more)

Subjects/Keywords: Graphics processing units ; Computer graphics ; Genomics – Data processing ; Data compression (Computer science)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Tan, Y. (2012). Accelerating genomic sequence compression with graphics processors. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7573 ; https://doi.org/10.14711/thesis-b1180160 ; http://repository.ust.hk/ir/bitstream/1783.1-7573/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Tan, Yuwei. “Accelerating genomic sequence compression with graphics processors.” 2012. Thesis, Hong Kong University of Science and Technology. Accessed January 18, 2021. http://repository.ust.hk/ir/Record/1783.1-7573 ; https://doi.org/10.14711/thesis-b1180160 ; http://repository.ust.hk/ir/bitstream/1783.1-7573/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Tan, Yuwei. “Accelerating genomic sequence compression with graphics processors.” 2012. Web. 18 Jan 2021.

Vancouver:

Tan Y. Accelerating genomic sequence compression with graphics processors. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2012. [cited 2021 Jan 18]. Available from: http://repository.ust.hk/ir/Record/1783.1-7573 ; https://doi.org/10.14711/thesis-b1180160 ; http://repository.ust.hk/ir/bitstream/1783.1-7573/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tan Y. Accelerating genomic sequence compression with graphics processors. [Thesis]. Hong Kong University of Science and Technology; 2012. Available from: http://repository.ust.hk/ir/Record/1783.1-7573 ; https://doi.org/10.14711/thesis-b1180160 ; http://repository.ust.hk/ir/bitstream/1783.1-7573/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Drexel University

20. Shortell, Thomas M. Secure Signal Processing and Secure Machine Learning using Fully Homomorphic Encryption.

Degree: 2018, Drexel University

URL: https://idea.library.drexel.edu/islandora/object/idea%3A8191

►

This dissertation focuses on the new techniques for secure and private computation for signal processing and machine learning. Specifically, the thesis will focuses on extending… (more)

Subjects/Keywords: Computer science; Data encryption (Computer science); Machine learning; Signal processing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Shortell, T. M. (2018). Secure Signal Processing and Secure Machine Learning using Fully Homomorphic Encryption. (Thesis). Drexel University. Retrieved from https://idea.library.drexel.edu/islandora/object/idea%3A8191

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Shortell, Thomas M. “Secure Signal Processing and Secure Machine Learning using Fully Homomorphic Encryption.” 2018. Thesis, Drexel University. Accessed January 18, 2021. https://idea.library.drexel.edu/islandora/object/idea%3A8191.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Shortell, Thomas M. “Secure Signal Processing and Secure Machine Learning using Fully Homomorphic Encryption.” 2018. Web. 18 Jan 2021.

Vancouver:

Shortell TM. Secure Signal Processing and Secure Machine Learning using Fully Homomorphic Encryption. [Internet] [Thesis]. Drexel University; 2018. [cited 2021 Jan 18]. Available from: https://idea.library.drexel.edu/islandora/object/idea%3A8191.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shortell TM. Secure Signal Processing and Secure Machine Learning using Fully Homomorphic Encryption. [Thesis]. Drexel University; 2018. Available from: https://idea.library.drexel.edu/islandora/object/idea%3A8191

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Johannesburg

21. Oosthuizen, Wouter. Audit considerations in neural net based knowledge systems.

Degree: 2014, University of Johannesburg

URL: http://hdl.handle.net/10210/10529

►

M.Com. (Computer Auditing)

Knowledge-based systems (KBS's) is one of the new and emerging technologies, and it is expected to impact dramatically on the information systems… (more)

Subjects/Keywords: Expert systems (Computer science); Neural networks (Computer science); Audutung - Data processing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Oosthuizen, W. (2014). Audit considerations in neural net based knowledge systems. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/10529

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Oosthuizen, Wouter. “Audit considerations in neural net based knowledge systems.” 2014. Thesis, University of Johannesburg. Accessed January 18, 2021. http://hdl.handle.net/10210/10529.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Oosthuizen, Wouter. “Audit considerations in neural net based knowledge systems.” 2014. Web. 18 Jan 2021.

Vancouver:

Oosthuizen W. Audit considerations in neural net based knowledge systems. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10210/10529.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Oosthuizen W. Audit considerations in neural net based knowledge systems. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/10529

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Michigan State University

22. Otto, Charles. Face search and clustering at scale.

Degree: 2016, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:4367

►

Thesis Ph. D. Michigan State University. Computer Science 2016

There has been a great deal of progress on the problem of unconstrained face recognition in… (more)

▼

Thesis Ph. D. Michigan State University. Computer Science 2016

There has been a great deal of progress on the problem of unconstrained face recognition in recent years, particularly with the emergence of deep learning methods for generating face representations. Developing robust face representations is not only of great practical interest for classic biometric problems like face verification, but also for emerging large scale face search problems. In both social media, and law-enforcement applications, an extremely large volume of face data is becoming commonplace. One emerging problem related to this high volume of data is to devise methods to search for persons of interest among the billions of shared photos on these websites. Another challenge is to group or cluster large collections of unlabeled face images by identity, for example as a prelude to manual examination of a collection of images in law-enforcement applications.Regarding the face search problem, we propose a face search system which combines a fast search procedure, coupled with a state-of-the-art commercial off the shelf (COTS) matcher, in a cascaded framework. Given a probe face, we first filter the large gallery of photos to find the top-k most similar faces using features learned by a convolutional neural network. The k retrieved candidates are re-ranked by combining similarities based on deep features and those output by the COTS matcher. We evaluate the proposed face search system on a gallery containing 80 million web-downloaded face images. Experimental results demonstrate that while the deep features perform worse than the COTS matcher on a mugshot dataset (93.7% vs. 98.6% [email protected] of 0.01%), fusing the deep features with the COTS matcher improves the overall performance (99.5% [email protected] of 0.01%). This shows that the learned deep features provide complementary information over representations used in state-of-the-art face matchers. On the unconstrained face image benchmarks, the performance of the learned deep features is competitive with reported accuracies. LFW database: 98.20% accuracy under the standard protocol and 88.03% [email protected] of 0.1% under the BLUFR protocol; IJB-A benchmark: 51.0% [email protected] of 0.1% (verification), rank 1 retrieval of 82.2% (closed-set search), 61.5% [email protected] of 1% (open-set search). The proposed face search system offers an excellent trade-off between accuracy and scalability on galleries with millions of images. Additionally, in a face search experiment involving photos of the Tsarnaev brothers, convicted of the Boston Marathon bombing, the proposed cascade face search system could find the younger brother's (Dzhokhar Tsarnaev) photo at rank 1 in 1 second on a 5M gallery and at rank 8 in 7 seconds on an 80M gallery, using a Intel Xeon processor clocked at 3.1 GHz.In terms of clustering, in social media, law enforcement, and other applications the number of unlabeled faces can be of the order of hundreds of million, while the number of identities (clusters) can range from a few thousand to millions. To address the…

Advisors/Committee Members: Jain, Anil K, Ross, Arun, Liu, Xiaoming, Aviyente, Selin.

Subjects/Keywords: Human face recognition (Computer science); Biometry – Data processing; Computer science

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Otto, C. (2016). Face search and clustering at scale. (Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:4367

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Otto, Charles. “Face search and clustering at scale.” 2016. Thesis, Michigan State University. Accessed January 18, 2021. http://etd.lib.msu.edu/islandora/object/etd:4367.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Otto, Charles. “Face search and clustering at scale.” 2016. Web. 18 Jan 2021.

Vancouver:

Otto C. Face search and clustering at scale. [Internet] [Thesis]. Michigan State University; 2016. [cited 2021 Jan 18]. Available from: http://etd.lib.msu.edu/islandora/object/etd:4367.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Otto C. Face search and clustering at scale. [Thesis]. Michigan State University; 2016. Available from: http://etd.lib.msu.edu/islandora/object/etd:4367

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

23. Liu, Peng. Improving the quality of shared-memory concurrent programs.

Degree: 2014, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-62762 ; https://doi.org/10.14711/thesis-b1274245 ; http://repository.ust.hk/ir/bitstream/1783.1-62762/1/th_redirect.html

► Shared-memory concurrent programs are pervasive in this multi-core era. In these programs, programmers use the threads to concurrently access the shared data and use the… (more)

▼ Shared-memory concurrent programs are pervasive in this multi-core era. In these programs, programmers use the threads to concurrently access the shared data and use the locks to synchronize between the threads to guarantee the data integrity or the correctness. Specifying the synchronization that achieves both the high performance and the correctness is very challenging. For example, programmers may specify the overly restrictively synchronization, which often leads to the performance bottleneck because it unnecessarily prevents multiple threads from concurrently accessing the shared data. On the other hand, programmers may specify the inadequate synchronization, which leads to concurrency bugs such as data races, atomicity violations and deadlocks. This thesis makes two main contributions. The first contribution is the proposal of two bug fixing techniques Axis and Grail. The manual fixing of the concurrency bugs is challenging and error-prone, e.g., 39% of the manual fixes are incorrect, because the programmers need to reason about the huge space of possible thread interleavings. Existing approaches have been proposed to automatically fix the atomicity violations, one important category of concurrency bugs. They either do not provide the correctness, e.g., new bugs may be introduced, or greatly sacrifice the concurrency, due to the imprecise reasoning. ⋅ Axis is the first automatic atomicity violation fixing technique that guarantees the correctness and besides, it allows more concurrency than existing approaches. The correctness guarantee and the precise reasoning of the concurrency is enabled by the use of the well-studied discrete control theory. Under the hood, Axis reduces the problem of violation fixing to a constraint solving problem and implements the solver based on the control theory. Our evaluation on 13 subjects shows that our patches commonly outperform that of existing approaches. With the deadlock-free guarantee, our patches incur moderate overhead (around 10%), which is a worthwhile cost for correctness. ⋅ Grail is a general fixing algorithm that departs from previous techniques (including Axis) by simultaneously providing both the correctness and the optimal performance guarantees. Grail synthesizes bug-free yet fully optimal synchronization. To achieve this, Grail builds a model of the buggy code that is both contextual, distinguishing among different runtime configurations to ensure efficiency, and global, accounting for the entire synchronization behavior of the involved threads to ensure correctness. Evaluation of Grail on 12 real-world bugs from popular codebases confirms its practical advantages, especially compared with existing techniques: The Grail patches are mostly 40% more efficient, and incur only 2% overhead. The second contribution is the proposal of the fixing of performance bottlenecks caused by the overly restrictive synchronization. Our proposed approach automatically fine tunes the existing overly restrictive synchronization to unleash more concurrency for the accesses of the…

Subjects/Keywords: Parallel programming (Computer science) ; Electronic data processing ; Distributed processing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Liu, P. (2014). Improving the quality of shared-memory concurrent programs. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-62762 ; https://doi.org/10.14711/thesis-b1274245 ; http://repository.ust.hk/ir/bitstream/1783.1-62762/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Liu, Peng. “Improving the quality of shared-memory concurrent programs.” 2014. Thesis, Hong Kong University of Science and Technology. Accessed January 18, 2021. http://repository.ust.hk/ir/Record/1783.1-62762 ; https://doi.org/10.14711/thesis-b1274245 ; http://repository.ust.hk/ir/bitstream/1783.1-62762/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Liu, Peng. “Improving the quality of shared-memory concurrent programs.” 2014. Web. 18 Jan 2021.

Vancouver:

Liu P. Improving the quality of shared-memory concurrent programs. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2014. [cited 2021 Jan 18]. Available from: http://repository.ust.hk/ir/Record/1783.1-62762 ; https://doi.org/10.14711/thesis-b1274245 ; http://repository.ust.hk/ir/bitstream/1783.1-62762/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu P. Improving the quality of shared-memory concurrent programs. [Thesis]. Hong Kong University of Science and Technology; 2014. Available from: http://repository.ust.hk/ir/Record/1783.1-62762 ; https://doi.org/10.14711/thesis-b1274245 ; http://repository.ust.hk/ir/bitstream/1783.1-62762/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

24. Yu, Jinxing CSE. Joint embeddings of Chinese words, characters, and fine-grained subcharacter components.

Degree: 2017, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-93101 ; https://doi.org/10.14711/thesis-991012572162503412 ; http://repository.ust.hk/ir/bitstream/1783.1-93101/1/th_redirect.html

► Word embeddings have attracted much attention recently given their simplicity of word representation and generalization ability for a lot of downstream tasks. Different from alphabetic… (more)

Subjects/Keywords: Natural language processing (Computer science) ; Chinese language ; Data processing ; Computational linguistics

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Yu, J. C. (2017). Joint embeddings of Chinese words, characters, and fine-grained subcharacter components. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-93101 ; https://doi.org/10.14711/thesis-991012572162503412 ; http://repository.ust.hk/ir/bitstream/1783.1-93101/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Yu, Jinxing CSE. “Joint embeddings of Chinese words, characters, and fine-grained subcharacter components.” 2017. Thesis, Hong Kong University of Science and Technology. Accessed January 18, 2021. http://repository.ust.hk/ir/Record/1783.1-93101 ; https://doi.org/10.14711/thesis-991012572162503412 ; http://repository.ust.hk/ir/bitstream/1783.1-93101/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Yu, Jinxing CSE. “Joint embeddings of Chinese words, characters, and fine-grained subcharacter components.” 2017. Web. 18 Jan 2021.

Vancouver:

Yu JC. Joint embeddings of Chinese words, characters, and fine-grained subcharacter components. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2017. [cited 2021 Jan 18]. Available from: http://repository.ust.hk/ir/Record/1783.1-93101 ; https://doi.org/10.14711/thesis-991012572162503412 ; http://repository.ust.hk/ir/bitstream/1783.1-93101/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Yu JC. Joint embeddings of Chinese words, characters, and fine-grained subcharacter components. [Thesis]. Hong Kong University of Science and Technology; 2017. Available from: http://repository.ust.hk/ir/Record/1783.1-93101 ; https://doi.org/10.14711/thesis-991012572162503412 ; http://repository.ust.hk/ir/bitstream/1783.1-93101/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

25. Beloucif, Meriem CSE. Improving semantic SMT for low resource languages.

Degree: 2018, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-93150 ; https://doi.org/10.14711/thesis-991012615464603412 ; http://repository.ust.hk/ir/bitstream/1783.1-93150/1/th_redirect.html

► We have managed to consistently improve the translation quality for challenging low resource languages by injecting semantic based objective functions into the training pipeline at… (more)

▼ We have managed to consistently improve the translation quality for challenging low resource languages by injecting semantic based objective functions into the training pipeline at an early (training) rather than late (tuning) stage as in previous attempts. The set of approaches suggested in this thesis are motivated by the fact that including semantics in a late stage tuning of machine translation models has already been shown to increase translation quality. Any shortage of parallel data constitutes a serious obstacle for conventional machine translation training techniques, because of their heavy dependency on memorization from big data. With low resource languages, for which parallel corpora are scarce, it becomes imperative to make learning from small data much more efficient by adding additional constraints to create stronger inductive biases—especially linguistically well-motivated constraints, such as the shallow semantic parses of the training sentences. However, while automatic semantic parsing is readily available to produce shallow semantic parses for a high resource output language (typically English), the problem is that there are no semantic parsers for low resource languages such as Oromo, Uyghur and Uzbek. We propose the first ever methods that inject a crosslingual semantic based objective function into training translation models for translation tasks like Chinese–English where we have semantic parsers for both languages. We report promising results showing that this way of training the machine translation model in general helps bias the learning towards semantically more correct bilingual constituents. Semantic statistical machine translation for low resource languages has been a difficult challenge since semantic parses are not usually available for low resource input languages but only for high resource output languages such as English. We extend our bilingual approaches to a low resource setup via our new training approaches which only require the output language semantic parse. We then thoroughly analyze the reasons behind the promising results that we achieved for multiple challenging low resource translation tasks such as Hausa, Uzbek, Uyghur, Swahili, Oromo and Amharic always translating into English. Our methods heavily rely on the degree of goodness of the semantic parser. We have noted that commonly used semantic parses completely fail to parse any sentence containing any form of the verb to be. Ignoring sentences containing the verb to be means that we are throwing away a good part of valuable data. Finally, we propose a novel way that attempts to semantically parse sentences that contains the verb to be and re-run all previous models on this new parsed data; we also contrast to a newer semantic parse which handles the verb to be . All our results show that building efficient MT systems for low resource languages could be more feasible than generally assumed.

Subjects/Keywords: Semantics ; Data processing ; Machine translating ; Natural language processing (Computer science)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Beloucif, M. C. (2018). Improving semantic SMT for low resource languages. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-93150 ; https://doi.org/10.14711/thesis-991012615464603412 ; http://repository.ust.hk/ir/bitstream/1783.1-93150/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Beloucif, Meriem CSE. “Improving semantic SMT for low resource languages.” 2018. Thesis, Hong Kong University of Science and Technology. Accessed January 18, 2021. http://repository.ust.hk/ir/Record/1783.1-93150 ; https://doi.org/10.14711/thesis-991012615464603412 ; http://repository.ust.hk/ir/bitstream/1783.1-93150/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Beloucif, Meriem CSE. “Improving semantic SMT for low resource languages.” 2018. Web. 18 Jan 2021.

Vancouver:

Beloucif MC. Improving semantic SMT for low resource languages. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2018. [cited 2021 Jan 18]. Available from: http://repository.ust.hk/ir/Record/1783.1-93150 ; https://doi.org/10.14711/thesis-991012615464603412 ; http://repository.ust.hk/ir/bitstream/1783.1-93150/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Beloucif MC. Improving semantic SMT for low resource languages. [Thesis]. Hong Kong University of Science and Technology; 2018. Available from: http://repository.ust.hk/ir/Record/1783.1-93150 ; https://doi.org/10.14711/thesis-991012615464603412 ; http://repository.ust.hk/ir/bitstream/1783.1-93150/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

26. Li, Mengyu. Effective keyword search on large scale graphs in a distributed system.

Degree: 2013, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-7978 ; https://doi.org/10.14711/thesis-b1240238 ; http://repository.ust.hk/ir/bitstream/1783.1-7978/1/th_redirect.html

► Keyword query is more user-friendly than the structured query (SQL, XQuery, SPARQL)as it requires no pre-knowledge about the underlying schema of the databases. In the… (more)

Subjects/Keywords: Keyword searching ; Querying (Computer science) ; Electronic data processing ; Distributed processing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Li, M. (2013). Effective keyword search on large scale graphs in a distributed system. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7978 ; https://doi.org/10.14711/thesis-b1240238 ; http://repository.ust.hk/ir/bitstream/1783.1-7978/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Li, Mengyu. “Effective keyword search on large scale graphs in a distributed system.” 2013. Thesis, Hong Kong University of Science and Technology. Accessed January 18, 2021. http://repository.ust.hk/ir/Record/1783.1-7978 ; https://doi.org/10.14711/thesis-b1240238 ; http://repository.ust.hk/ir/bitstream/1783.1-7978/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Li, Mengyu. “Effective keyword search on large scale graphs in a distributed system.” 2013. Web. 18 Jan 2021.

Vancouver:

Li M. Effective keyword search on large scale graphs in a distributed system. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2013. [cited 2021 Jan 18]. Available from: http://repository.ust.hk/ir/Record/1783.1-7978 ; https://doi.org/10.14711/thesis-b1240238 ; http://repository.ust.hk/ir/bitstream/1783.1-7978/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li M. Effective keyword search on large scale graphs in a distributed system. [Thesis]. Hong Kong University of Science and Technology; 2013. Available from: http://repository.ust.hk/ir/Record/1783.1-7978 ; https://doi.org/10.14711/thesis-b1240238 ; http://repository.ust.hk/ir/bitstream/1783.1-7978/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Columbia University

27. Sitaridi, Evangelia. GPU-Acceleration of In-Memory Data Analytics.

Degree: 2016, Columbia University

URL: https://doi.org/10.7916/D8FN16BZ

► Hardware advances strongly influence the database system design. The flattening speed of CPU cores makes many-core accelerators, such as GPUs, a vital alternative to explore… (more)

Subjects/Keywords: Memory management (Computer science); Electronic data processing; Graphics processing units; Computer science

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Sitaridi, E. (2016). GPU-Acceleration of In-Memory Data Analytics. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8FN16BZ

Chicago Manual of Style (16^th Edition):

Sitaridi, Evangelia. “GPU-Acceleration of In-Memory Data Analytics.” 2016. Doctoral Dissertation, Columbia University. Accessed January 18, 2021. https://doi.org/10.7916/D8FN16BZ.

MLA Handbook (7^th Edition):

Sitaridi, Evangelia. “GPU-Acceleration of In-Memory Data Analytics.” 2016. Web. 18 Jan 2021.

Vancouver:

Sitaridi E. GPU-Acceleration of In-Memory Data Analytics. [Internet] [Doctoral dissertation]. Columbia University; 2016. [cited 2021 Jan 18]. Available from: https://doi.org/10.7916/D8FN16BZ.

Council of Science Editors:

Sitaridi E. GPU-Acceleration of In-Memory Data Analytics. [Doctoral Dissertation]. Columbia University; 2016. Available from: https://doi.org/10.7916/D8FN16BZ

Columbia University

28. Bauer, Daniel. Grammar-Based Semantic Parsing Into Graph Representations.

Degree: 2017, Columbia University

URL: https://doi.org/10.7916/D8JH3ZRR

► Directed graphs are an intuitive and versatile representation of natural language meaning because they can capture relationships between instances of events and entities, including cases… (more)

Subjects/Keywords: Computer science; Directed graphs; Semantics – Data processing; Natural language processing (Computer science)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bauer, D. (2017). Grammar-Based Semantic Parsing Into Graph Representations. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8JH3ZRR

Chicago Manual of Style (16^th Edition):

Bauer, Daniel. “Grammar-Based Semantic Parsing Into Graph Representations.” 2017. Doctoral Dissertation, Columbia University. Accessed January 18, 2021. https://doi.org/10.7916/D8JH3ZRR.

MLA Handbook (7^th Edition):

Bauer, Daniel. “Grammar-Based Semantic Parsing Into Graph Representations.” 2017. Web. 18 Jan 2021.

Vancouver:

Bauer D. Grammar-Based Semantic Parsing Into Graph Representations. [Internet] [Doctoral dissertation]. Columbia University; 2017. [cited 2021 Jan 18]. Available from: https://doi.org/10.7916/D8JH3ZRR.

Council of Science Editors:

Bauer D. Grammar-Based Semantic Parsing Into Graph Representations. [Doctoral Dissertation]. Columbia University; 2017. Available from: https://doi.org/10.7916/D8JH3ZRR

Massey University

29. Xiao, Yujie. Ensembles of neural networks for language modeling.

Degree: M. Phil., Information Technology, 2018, Massey University

URL: http://hdl.handle.net/10179/15230

► Language modeling has been widely used in the application of natural language processing, and therefore gained a significant amount of following in recent years. The… (more)

Subjects/Keywords: Linguistic models; Data processing; Neural networks (Computer science); Natural language processing (Computer science)

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Xiao, Y. (2018). Ensembles of neural networks for language modeling. (Masters Thesis). Massey University. Retrieved from http://hdl.handle.net/10179/15230

Chicago Manual of Style (16^th Edition):

Xiao, Yujie. “Ensembles of neural networks for language modeling.” 2018. Masters Thesis, Massey University. Accessed January 18, 2021. http://hdl.handle.net/10179/15230.

MLA Handbook (7^th Edition):

Xiao, Yujie. “Ensembles of neural networks for language modeling.” 2018. Web. 18 Jan 2021.

Vancouver:

Xiao Y. Ensembles of neural networks for language modeling. [Internet] [Masters thesis]. Massey University; 2018. [cited 2021 Jan 18]. Available from: http://hdl.handle.net/10179/15230.

Council of Science Editors:

Xiao Y. Ensembles of neural networks for language modeling. [Masters Thesis]. Massey University; 2018. Available from: http://hdl.handle.net/10179/15230

Johannes Gutenberg Universität Mainz

30. Meister, Dirk. Advanced data deduplication techniques and their application.

Degree: 2013, Johannes Gutenberg Universität Mainz

URL: http://ubm.opus.hbz-nrw.de/volltexte/2013/3488/

►

Data deduplication describes a class of approaches that reduce the storage capacity needed to store data or the amount of data that has to be… (more)

▼

Data deduplication describes a class of approaches that reduce the storage capacity needed to store data or the amount of data that has to be transferred over a network. These approaches detect coarse-grained redundancies within a data set, e.g. a file system, and remove them.rnrnOne of the most important applications of data deduplication are backup storage systems where these approaches are able to reduce the storage requirements to a small fraction of the logical backup data size.rnThis thesis introduces multiple new extensions of so-called fingerprinting-based data deduplication. It starts with the presentation of a novel system design, which allows using a cluster of servers to perform exact data deduplication with small chunks in a scalable way.rnrnAfterwards, a combination of compression approaches for an important, but often over- looked, data structure in data deduplication systems, so called block and file recipes, is introduced. Using these compression approaches that exploit unique properties of data deduplication systems, the size of these recipes can be reduced by more than 92% in all investigated data sets. As file recipes can occupy a significant fraction of the overall storage capacity of data deduplication systems, the compression enables significant savings.rnrnA technique to increase the write throughput of data deduplication systems, based on the aforementioned block and file recipes, is introduced next. The novel Block Locality Caching (BLC) uses properties of block and file recipes to overcome the chunk lookup disk bottleneck of data deduplication systems. This chunk lookup disk bottleneck either limits the scalability or the throughput of data deduplication systems. The presented BLC overcomes the disk bottleneck more efficiently than existing approaches. Furthermore, it is shown that it is less prone to aging effects.rnrnFinally, it is investigated if large HPC storage systems inhibit redundancies that can be found by fingerprinting-based data deduplication. Over 3 PB of HPC storage data from different data sets have been analyzed. In most data sets, between 20 and 30% of the data can be classified as redundant. According to these results, future work in HPC storage systems should further investigate how data deduplication can be integrated into future HPC storage systems.rnrnThis thesis presents important novel work in different area of data deduplication re- search.

In dieser Doktorarbeit werden mehrere Forschungsergebnisse über verschiedene Aspekte von Datendeduplizierungssystemen vorgestellt. Datendeduplizierung beschreibt eine Klasse von Ansätzen, die es erlauben, die zur Speicherung von Daten notwendig Speicherkapazität zu reduzieren. Datendeduplizierungstechniken werden weiterhin eingesetzt, um die Menge der Daten, die über ein Netzwerk transferiert werden müssen, zu reduzieren. Diese Ansätze erkennen grob-körnige Redundanzen innerhalb einer Datenmenge und entfernen diese.rnrnEin wichtiges Anwendungsgebiet für Datendeduplizierungstechniken sind Speichersysteme zur Datensicherung, da…

Subjects/Keywords: Datendeduplizierung Kompression; Data Deduplication Compression; Data processing Computer science

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Meister, D. (2013). Advanced data deduplication techniques and their application. (Doctoral Dissertation). Johannes Gutenberg Universität Mainz. Retrieved from http://ubm.opus.hbz-nrw.de/volltexte/2013/3488/

Chicago Manual of Style (16^th Edition):

Meister, Dirk. “Advanced data deduplication techniques and their application.” 2013. Doctoral Dissertation, Johannes Gutenberg Universität Mainz. Accessed January 18, 2021. http://ubm.opus.hbz-nrw.de/volltexte/2013/3488/.

MLA Handbook (7^th Edition):

Meister, Dirk. “Advanced data deduplication techniques and their application.” 2013. Web. 18 Jan 2021.

Vancouver:

Meister D. Advanced data deduplication techniques and their application. [Internet] [Doctoral dissertation]. Johannes Gutenberg Universität Mainz; 2013. [cited 2021 Jan 18]. Available from: http://ubm.opus.hbz-nrw.de/volltexte/2013/3488/.

Council of Science Editors:

Meister D. Advanced data deduplication techniques and their application. [Doctoral Dissertation]. Johannes Gutenberg Universität Mainz; 2013. Available from: http://ubm.opus.hbz-nrw.de/volltexte/2013/3488/

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations