subject:(Data processing)

1. Chung, David H. S. High-dimensional glyph-based visualization and interactive techniques.

Degree: PhD, 2014, Swansea University

URL: https://cronfa.swan.ac.uk/Record/cronfa42276 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.678364

► The advancement of modern technology and scientific measurements has led to datasets growing in both size and complexity, exposing the need for more efficient and… (more)

▼ The advancement of modern technology and scientific measurements has led to datasets growing in both size and complexity, exposing the need for more efficient and effective ways of visualizing and analysing data. Despite the amount of progress in visualization methods, high-dimensional data still poses a number of significant challenges in terms of the technical ability of realising such a mapping, and how accurate they are actually interpreted. The different data sources and characteristics which arise from a wide range of scientific domains as well as specific design requirements constantly create new special challenges for visualization research. This thesis presents several contributions to the field of glyph-based visualization. Glyphs are parametrised objects which encode one or more data values to its appearance (also referred to as visual channels) such as their size, colour, shape, and position. They have been widely used to convey information visually, and are especially well suited for displaying complex, multi-faceted datasets. Its major strength is the ability to depict patterns of data in the context of a spatial relationship, where multi-dimensional trends can often be perceived more easily. Our research is set in the broad scope of multi-dimensional visualization, addressing several aspects of glyph-based techniques, including visual design, perception, placement, interaction, and applications. In particular, this thesis presents a comprehensive study on one interaction technique, namely sorting, for supporting various analytical tasks. We have outlined the concepts of glyph- based sorting, identified a set of design criteria for sorting interactions, designed and prototyped a user interface for sorting multivariate glyphs, developed a visual analytics technique to support sorting, conducted an empirical study on perceptual orderability of visual channels used in glyph design, and applied glyph-based sorting to event visualization in sports applications. The content of this thesis is organised into two parts. Part I provides an overview of the basic concepts of glyph-based visualization, before describing the state-of-the-art in this field. We then present a collection of novel glyph-based approaches to address challenges created from real-world applications. These are detailed in Part II. Our first approach involves designing glyphs to depict the composition of multiple error-sensitivity fields. This work addresses the problem of single camera positioning, using both 2D and 3D methods to support camera configuration based on various constraints in the context of a real-world environment. Our second approach present glyphs to visualize actions and events "at a glance". We discuss the relative merits of using metaphoric glyphs in comparison to other types of glyph designs to the particular problem of real-time sports analysis. As a result of this research, we delivered a visualization software, MatchPad, on a tablet computer. It successfully helped coaching staff and team analysts to examine actions…

Subjects/Keywords: 004; Data mining; Data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Chung, D. H. S. (2014). High-dimensional glyph-based visualization and interactive techniques. (Doctoral Dissertation). Swansea University. Retrieved from https://cronfa.swan.ac.uk/Record/cronfa42276 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.678364

Chicago Manual of Style (16^th Edition):

Chung, David H S. “High-dimensional glyph-based visualization and interactive techniques.” 2014. Doctoral Dissertation, Swansea University. Accessed February 27, 2021. https://cronfa.swan.ac.uk/Record/cronfa42276 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.678364.

MLA Handbook (7^th Edition):

Chung, David H S. “High-dimensional glyph-based visualization and interactive techniques.” 2014. Web. 27 Feb 2021.

Vancouver:

Chung DHS. High-dimensional glyph-based visualization and interactive techniques. [Internet] [Doctoral dissertation]. Swansea University; 2014. [cited 2021 Feb 27]. Available from: https://cronfa.swan.ac.uk/Record/cronfa42276 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.678364.

Council of Science Editors:

Chung DHS. High-dimensional glyph-based visualization and interactive techniques. [Doctoral Dissertation]. Swansea University; 2014. Available from: https://cronfa.swan.ac.uk/Record/cronfa42276 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.678364

Rutgers University

2. Yan, Zhaokai, 1988-. Three essays on the adoption and application of emerging technologies in accounting.

Degree: PhD, Management, 2019, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/61671/

►

Technologies are evolving at an unprecedented pace and pose significant challenges and opportunities to the accounting and auditing profession. This dissertation consists of three essays… (more)

▼

Technologies are evolving at an unprecedented pace and pose significant challenges and opportunities to the accounting and auditing profession. This dissertation consists of three essays that examine how emerging technologies can be accepted and adopted by auditors and managerial accountants. The first essay attempts to incorporate the disruptive innovation concept (Christensen 1997) in understanding the adoption process of disruptive innovations in the audit domain. The essay defines sustaining and disruptive innovations from the auditing perspective and indicates that disruptive innovations can impact audit procedures at both the technology level and the methodology level. The disruptive innovations acceptance framework is then proposed to illustrate that sustaining innovations are adopted and developed within the audit practice, whereas disruptive innovations are developed by external parties. The disruption occurs when an emerging technology or methodology becomes accepted by audit regulations and adopted in audit practice. Further improvements on the adopted disruptive innovation become sustaining innovations. The second essay aims at proposing the Contract Analytics Framework (CAF) to aid in the analysis of populations of perceived low-risk contracts. The essay identifies and describes six functional areas in the CAF framework: (1) Document Management; (2) Content Identification; (3) Cutoff Testing; (4) Record Confirmation; (5) Term Verification; and (6) Additional Audit Tasks. The CAF framework can be applied to audit tasks based on auditing standards, especially in the audit stages of risk assessment, substantive tests, and review. The framework is implemented on a group of reinsurance contracts to demonstrate the feasibility of auditing full populations of contracts. The third essay proposes the Managerial Accounting Data Analytics (MADA) framework based on the balanced scorecard theory. MADA provides management accountants the ability to utilize comprehensive business analytics to conduct performance measurement and provide decision related information. With MADA, three types of business analytics (i.e., descriptive, predictive, and prescriptive) are implemented into four corporate performance measurement perspectives (i.e., financial, customer, internal process, and learning and growth) in an enterprise system environment. Other related issues that affect the successful utilization of business analytics within a corporate-wide business intelligence (BI) system, such as data quality and data integrity, are also discussed.

Advisors/Committee Members: Vasarhelyi, Miklos A. (chair), Kogan, Alexander (internal member), Moffitt, Kevin (internal member), Appelbaum, Deniz (outside member).

Subjects/Keywords: Data analytics; Auditing – Data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Yan, Zhaokai, 1. (2019). Three essays on the adoption and application of emerging technologies in accounting. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/61671/

Chicago Manual of Style (16^th Edition):

Yan, Zhaokai, 1988-. “Three essays on the adoption and application of emerging technologies in accounting.” 2019. Doctoral Dissertation, Rutgers University. Accessed February 27, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/61671/.

MLA Handbook (7^th Edition):

Yan, Zhaokai, 1988-. “Three essays on the adoption and application of emerging technologies in accounting.” 2019. Web. 27 Feb 2021.

Vancouver:

Yan, Zhaokai 1. Three essays on the adoption and application of emerging technologies in accounting. [Internet] [Doctoral dissertation]. Rutgers University; 2019. [cited 2021 Feb 27]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/61671/.

Council of Science Editors:

Yan, Zhaokai 1. Three essays on the adoption and application of emerging technologies in accounting. [Doctoral Dissertation]. Rutgers University; 2019. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/61671/

University of Johannesburg

3. Rorbye, Trevor Wayne. The impact on information systems controls within an organisation when making use of an EDI VAN.

Degree: 2014, University of Johannesburg

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

►

M.Com. (Computer Auditing)

The implementation of EDI into South Africa business has only started in the recent past. The main reason for this is the… (more)

Subjects/Keywords: Electronic data processing; Auditing - Data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Rorbye, T. W. (2014). The impact on information systems controls within an organisation when making use of an EDI VAN. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/10517

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):

Rorbye, Trevor Wayne. “The impact on information systems controls within an organisation when making use of an EDI VAN.” 2014. Thesis, University of Johannesburg. Accessed February 27, 2021. http://hdl.handle.net/10210/10517.

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

MLA Handbook (7^th Edition):

Rorbye, Trevor Wayne. “The impact on information systems controls within an organisation when making use of an EDI VAN.” 2014. Web. 27 Feb 2021.

Vancouver:

Rorbye TW. The impact on information systems controls within an organisation when making use of an EDI VAN. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2021 Feb 27]. Available from: http://hdl.handle.net/10210/10517.

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

Council of Science Editors:

Rorbye TW. The impact on information systems controls within an organisation when making use of an EDI VAN. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/10517

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

University of Johannesburg

4. Cumberlege, Engela Helena. The role of management in the design and implementation of value-adding accounting systems and procedures in the small organistion.

Degree: 2012, University of Johannesburg

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

►

M.Comm.

The primary objective of the dissertation is: • To explain the design and implementation of effective accounting systems and procedures in a small organisation… (more)

Subjects/Keywords: Accounting - Data processing.; Small Business - Data Processing.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Cumberlege, E. H. (2012). The role of management in the design and implementation of value-adding accounting systems and procedures in the small organistion. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/5880

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):

Cumberlege, Engela Helena. “The role of management in the design and implementation of value-adding accounting systems and procedures in the small organistion.” 2012. Thesis, University of Johannesburg. Accessed February 27, 2021. http://hdl.handle.net/10210/5880.

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

MLA Handbook (7^th Edition):

Cumberlege, Engela Helena. “The role of management in the design and implementation of value-adding accounting systems and procedures in the small organistion.” 2012. Web. 27 Feb 2021.

Vancouver:

Cumberlege EH. The role of management in the design and implementation of value-adding accounting systems and procedures in the small organistion. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2021 Feb 27]. Available from: http://hdl.handle.net/10210/5880.

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

Council of Science Editors:

Cumberlege EH. The role of management in the design and implementation of value-adding accounting systems and procedures in the small organistion. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/5880

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

5. Fang, Qiong. Effective discovery of order-preserving submatrices.

Degree: 2012, Hong Kong University of Science and Technology

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

► As matrix is a common data presentation in many applications, the submatrix mining problem has been extensively studied to reveal interesting correlations among a set… (more)

▼ As matrix is a common data presentation in many applications, the submatrix mining problem has been extensively studied to reveal interesting correlations among a set of rows and a set of columns. Various submatrix models have been proposed to describe different local correlations, among which, the order-preserving submatrix (OPSM) model is proposed to capture the fact that the entry values of a set of rows follow the same trend under a set of columns. In this thesis, I systematically study the problem of mining OPSM patterns to address various real application needs. In gene expression analysis, as the OPSM model is regarded to be restrictive and not practical when sample contamination inevitably exists, I consider two relaxation strategies to relax the strict OPSM model. Three relaxed OPSM models and the corresponding pattern mining methods have been proposed. Experimental studies on real biological data show that my relaxed OPSM models lead to the discovery of interesting correlations with high biological significance. The experiments also justify the efficiency of my proposed pattern mining methods. Due to the prevalence of uncertain data, I define new probabilistic matrix representations, and formalize a novel probabilistic OPSM (POPSM) model. I propose an efficient POPSM mining framework called PROBAPRI. I demonstrate the superiority of my approach by two applications of POPSM. Experiments on biological datasets show that the POPSM model better captures the characteristics of the expression levels of biologically correlated genes. Experiments on a RFID trace dataset demonstrate the effectiveness of my POPSM model in capturing the common visiting behavior among users. Data in applications like recommender systems can also be organized as matrices, which however usually have extremely large size and high degree of sparsity. I propose a sparse OPSM (SOPSM) model for sparse matrices, and adopt two criteria to control the number and distribution of patterns mined from large matrices. Accordingly, I formulate a constrained SOPSM mining problem, and develop an effective approach called QUICK PROBING (QP) and its parallelization scheme. Experiments on two datasets from real recommender systems show that the QP framework achieves high scalability and is efficient for handling matrices having millions of rows and columns. Besides, QP predicts the ordered preference of users over a set of items with high accuracy.

Subjects/Keywords: Matrices – Data processing ; Electronic data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Fang, Q. (2012). Effective discovery of order-preserving submatrices. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7808 ; https://doi.org/10.14711/thesis-b1176704 ; http://repository.ust.hk/ir/bitstream/1783.1-7808/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):

Fang, Qiong. “Effective discovery of order-preserving submatrices.” 2012. Thesis, Hong Kong University of Science and Technology. Accessed February 27, 2021. http://repository.ust.hk/ir/Record/1783.1-7808 ; https://doi.org/10.14711/thesis-b1176704 ; http://repository.ust.hk/ir/bitstream/1783.1-7808/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):

Fang, Qiong. “Effective discovery of order-preserving submatrices.” 2012. Web. 27 Feb 2021.

Vancouver:

Fang Q. Effective discovery of order-preserving submatrices. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2012. [cited 2021 Feb 27]. Available from: http://repository.ust.hk/ir/Record/1783.1-7808 ; https://doi.org/10.14711/thesis-b1176704 ; http://repository.ust.hk/ir/bitstream/1783.1-7808/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:

Fang Q. Effective discovery of order-preserving submatrices. [Thesis]. Hong Kong University of Science and Technology; 2012. Available from: http://repository.ust.hk/ir/Record/1783.1-7808 ; https://doi.org/10.14711/thesis-b1176704 ; http://repository.ust.hk/ir/bitstream/1783.1-7808/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. Xu, Diwen CSE. MTPS : a multi-time-frame technical pattern and strategy backtesting system.

Degree: 2018, Hong Kong University of Science and Technology

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

► Strategy backtesting which is a process to take some user-defined trading rules and market information as input, simulate behaviors of market participants under these trading… (more)

▼ Strategy backtesting which is a process to take some user-defined trading rules and market information as input, simulate behaviors of market participants under these trading rules and finally report the strategy performance. Strategy backtesting systems are the most important applications of algorithmic trading since it provide individual or professional traders flexibility to design and test their customized ideas. Technical analysis is the most popular way for financial instruments traders to predict future price movement by researching historical data records. However, technical analyses highly rely on a various of technical indicators, patterns and personal charting heuristics, which makes it very difficult to be transformed into algorithmic trading strategies. Most technical traders especially for individual traders, on the other hand, are lack of knowledge about computer programming, and find it hard for them to script their strategies by coding. Therefore, a strategy backtesting system allowing users to describe complex and advanced technical strategies via pure graphical user interface (GUI) is in very highly demand. In this thesis, we design and implement a multi-time-frame technical pattern and strategy backtesting system, that is MTPS, to address the problem of describing complex technical patterns on GUI and applying these patterns in algorithmic trading strategies. By observing the cases that a large amount of profitable technical patterns are composed of sequences of characteristic candle bars, we introduce a hierarchical MTPS strategy description system that promote users to describe their technical patterns by describing sequences of technical events. This strategy description system endow users who are not knowledgeable about computer programming a much higher flexibility to include complicated and advanced patterns in their algorithmic strategies. In addition, we also provide users interfaces in MTPS to include technical indicators from multiple time-frames in one strategy which is a unique feature that most of the state-of-the-art strategy backtesting systems can not achieve. Besides, we present present the complete architecture of MTPS including the implementation details of all the software components and how they are organized in an event-driven design pattern. Moreover, we propose an efficient pattern matching algorithm for MTPS to minimize the delay between market data arrival and order placement. Last but not least, experiments are conducted showing that MTPS do capable to describe 3 complex and advanced technical pattens and backtesting strategies based on these 3 patterns to generate profit surpassing the ”buy-and-hold” strategies.

Subjects/Keywords: Electronic data processing ; Securities industry ; Data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Xu, D. C. (2018). MTPS : a multi-time-frame technical pattern and strategy backtesting system. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-95796 ; https://doi.org/10.14711/thesis-991012636367603412 ; http://repository.ust.hk/ir/bitstream/1783.1-95796/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):

Xu, Diwen CSE. “MTPS : a multi-time-frame technical pattern and strategy backtesting system.” 2018. Thesis, Hong Kong University of Science and Technology. Accessed February 27, 2021. http://repository.ust.hk/ir/Record/1783.1-95796 ; https://doi.org/10.14711/thesis-991012636367603412 ; http://repository.ust.hk/ir/bitstream/1783.1-95796/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):

Xu, Diwen CSE. “MTPS : a multi-time-frame technical pattern and strategy backtesting system.” 2018. Web. 27 Feb 2021.

Vancouver:

Xu DC. MTPS : a multi-time-frame technical pattern and strategy backtesting system. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2018. [cited 2021 Feb 27]. Available from: http://repository.ust.hk/ir/Record/1783.1-95796 ; https://doi.org/10.14711/thesis-991012636367603412 ; http://repository.ust.hk/ir/bitstream/1783.1-95796/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:

Xu DC. MTPS : a multi-time-frame technical pattern and strategy backtesting system. [Thesis]. Hong Kong University of Science and Technology; 2018. Available from: http://repository.ust.hk/ir/Record/1783.1-95796 ; https://doi.org/10.14711/thesis-991012636367603412 ; http://repository.ust.hk/ir/bitstream/1783.1-95796/1/th_redirect.html

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

University of Utah

7. Farver, Shane D. Fact checking at warp speed: how online news production is affecting adherence to accuracy in journalism.

Degree: MS;, Communication;, 2009, University of Utah

URL: http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/19/rec/474

► This thesis examines how news organizations that were formerly print-only have learned to navigate threats to accuracy brought about by the production of breaking online… (more)

Subjects/Keywords: Data processing; Editing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Farver, S. D. (2009). Fact checking at warp speed: how online news production is affecting adherence to accuracy in journalism. (Masters Thesis). University of Utah. Retrieved from http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/19/rec/474

Chicago Manual of Style (16^th Edition):

Farver, Shane D. “Fact checking at warp speed: how online news production is affecting adherence to accuracy in journalism.” 2009. Masters Thesis, University of Utah. Accessed February 27, 2021. http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/19/rec/474.

MLA Handbook (7^th Edition):

Farver, Shane D. “Fact checking at warp speed: how online news production is affecting adherence to accuracy in journalism.” 2009. Web. 27 Feb 2021.

Vancouver:

Farver SD. Fact checking at warp speed: how online news production is affecting adherence to accuracy in journalism. [Internet] [Masters thesis]. University of Utah; 2009. [cited 2021 Feb 27]. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/19/rec/474.

Council of Science Editors:

Farver SD. Fact checking at warp speed: how online news production is affecting adherence to accuracy in journalism. [Masters Thesis]. University of Utah; 2009. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd2/id/19/rec/474

8. Ahmad, Yanif. Pulse: Database Support for Efficient Query Processing Of Temporal Polynomial Models.

Degree: PhD, Computer Science, 2009, Brown University

URL: https://repository.library.brown.edu/studio/item/bdr:74/

► This thesis investigates the practicality and utility of mathematical models to represent continuous and occasionally unavailable data stream attributes, and processing relational-style queries in a… (more)

▼ This thesis investigates the practicality and utility of mathematical models to represent continuous and occasionally unavailable data stream attributes, and processing relational-style queries in a stream processing engine directly on these models. We present Pulse, a framework for processing continuous queries over stream attributes modeled as piecewise polynomial functions. We use piece-wise polynomials to provide a compact, approximate representation of the input dataset and provide query language extensions for users to specify precision bounds to control this approximation. Pulse represents queries as simultaneous equation systems for a variety of relational operators including filters, joins and standard aggregates. In the stream context, we continually solve these equation systems as new data arrives into the system. We have implemented Pulse on top of the Borealis stream processing engine and evaluated it on two real-world datasets from financial and moving object applications. Pulse is able to achieve significant performance improvements by processing queries directly on the mathematical representation of these polynomials, in comparison to standard tuple-based stream processing, thereby demonstrating the viability of our system in the face of having to meet precision requirements. In addition to our primary contribution of describing the core design and architecture of Pulse, this thesis presents a selectivity estimator and a multi-query optimizer to scale query processing capabilities. Our selectivity estimator uses histograms defined on a parameter space of polynomial coefficients for estimation, passing selectivities to our multi-query optimizer which may then determine how to construct a global query plan that shares work across individual queries. We evaluate these components on both a synthetic dataset and a financial dataset. Our experiments show that our optimization mechanisms provide significant reductions in processing overhead, and that our estimation algorithm provides an accurate and low overhead estimator for selective operators, that can be enhanced by sampling, while also being a general technique that can handle operators such as min and max aggregates, where sampling is known to be inaccurate. Advisors/Committee Members: Cetintemel, Ugur (director), Zdonik, Stanley (reader), Jannotti, John (reader), Madden, Samuel (reader).

Subjects/Keywords: Data stream processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Ahmad, Y. (2009). Pulse: Database Support for Efficient Query Processing Of Temporal Polynomial Models. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:74/

Chicago Manual of Style (16^th Edition):

Ahmad, Yanif. “Pulse: Database Support for Efficient Query Processing Of Temporal Polynomial Models.” 2009. Doctoral Dissertation, Brown University. Accessed February 27, 2021. https://repository.library.brown.edu/studio/item/bdr:74/.

MLA Handbook (7^th Edition):

Ahmad, Yanif. “Pulse: Database Support for Efficient Query Processing Of Temporal Polynomial Models.” 2009. Web. 27 Feb 2021.

Vancouver:

Ahmad Y. Pulse: Database Support for Efficient Query Processing Of Temporal Polynomial Models. [Internet] [Doctoral dissertation]. Brown University; 2009. [cited 2021 Feb 27]. Available from: https://repository.library.brown.edu/studio/item/bdr:74/.

Council of Science Editors:

Ahmad Y. Pulse: Database Support for Efficient Query Processing Of Temporal Polynomial Models. [Doctoral Dissertation]. Brown University; 2009. Available from: https://repository.library.brown.edu/studio/item/bdr:74/

University of Johannesburg

9. Boessenkool, Marnix Guillaume. Internal control and systems software, including analysis of MVS/XA SP 2.2.

Degree: 2014, University of Johannesburg

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

►

M.Com. (Computer Auditing)

In this chapter the actual topic will be presented. The reason for this study will be motivated with reference to current audit… (more)

Subjects/Keywords: Auditing - Data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Boessenkool, M. G. (2014). Internal control and systems software, including analysis of MVS/XA SP 2.2. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/9872

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):

Boessenkool, Marnix Guillaume. “Internal control and systems software, including analysis of MVS/XA SP 2.2.” 2014. Thesis, University of Johannesburg. Accessed February 27, 2021. http://hdl.handle.net/10210/9872.

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

MLA Handbook (7^th Edition):

Boessenkool, Marnix Guillaume. “Internal control and systems software, including analysis of MVS/XA SP 2.2.” 2014. Web. 27 Feb 2021.

Vancouver:

Boessenkool MG. Internal control and systems software, including analysis of MVS/XA SP 2.2. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2021 Feb 27]. Available from: http://hdl.handle.net/10210/9872.

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

Council of Science Editors:

Boessenkool MG. Internal control and systems software, including analysis of MVS/XA SP 2.2. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/9872

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

University of Johannesburg

10. Van der Bank, Dirk Johannes. Die evaluering van 'n aantal kriptologiese algoritmes.

Degree: 2014, University of Johannesburg

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

►

M.Sc. (Computer Science)

The main themes of this thesis are the characteristics of natural language, cryptographic algorithms to encipher natural language and possible figures of… (more)

Subjects/Keywords: Cryptography - Data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Van der Bank, D. J. (2014). Die evaluering van 'n aantal kriptologiese algoritmes. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/9730

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):

Van der Bank, Dirk Johannes. “Die evaluering van 'n aantal kriptologiese algoritmes.” 2014. Thesis, University of Johannesburg. Accessed February 27, 2021. http://hdl.handle.net/10210/9730.

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

MLA Handbook (7^th Edition):

Van der Bank, Dirk Johannes. “Die evaluering van 'n aantal kriptologiese algoritmes.” 2014. Web. 27 Feb 2021.

Vancouver:

Van der Bank DJ. Die evaluering van 'n aantal kriptologiese algoritmes. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2021 Feb 27]. Available from: http://hdl.handle.net/10210/9730.

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

Council of Science Editors:

Van der Bank DJ. Die evaluering van 'n aantal kriptologiese algoritmes. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/9730

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

University of Johannesburg

11. Herdan, David Errol. A cryptographically secure protocol for key exchange.

Degree: 2014, University of Johannesburg

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

►

M.Sc. (Computer Science)

Since the emergence of electronic communication, scientists have strived to make these communication systems as secure as possible. Classical cryptographical methods provided… (more)

Subjects/Keywords: Cryptography - Data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Herdan, D. E. (2014). A cryptographically secure protocol for key exchange. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/12037

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):

Herdan, David Errol. “A cryptographically secure protocol for key exchange.” 2014. Thesis, University of Johannesburg. Accessed February 27, 2021. http://hdl.handle.net/10210/12037.

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

MLA Handbook (7^th Edition):

Herdan, David Errol. “A cryptographically secure protocol for key exchange.” 2014. Web. 27 Feb 2021.

Vancouver:

Herdan DE. A cryptographically secure protocol for key exchange. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2021 Feb 27]. Available from: http://hdl.handle.net/10210/12037.

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

Council of Science Editors:

Herdan DE. A cryptographically secure protocol for key exchange. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/12037

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

Oregon State University

12. Narasimhan, Revathy. Simultaneous Segmentation and Classification of Bird Song Using CNN.

Degree: MS, Electrical and Computer Engineering, 2016, Oregon State University

URL: http://hdl.handle.net/1957/60040

► In bioacoustics, automatic animal voice detection and recognition from audio recordings is an emerging topic for animal preservation. Our research focuses on bird bioacoustics, where… (more)

Subjects/Keywords: Birdsongs – Data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Narasimhan, R. (2016). Simultaneous Segmentation and Classification of Bird Song Using CNN. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/60040

Chicago Manual of Style (16^th Edition):

Narasimhan, Revathy. “Simultaneous Segmentation and Classification of Bird Song Using CNN.” 2016. Masters Thesis, Oregon State University. Accessed February 27, 2021. http://hdl.handle.net/1957/60040.

MLA Handbook (7^th Edition):

Narasimhan, Revathy. “Simultaneous Segmentation and Classification of Bird Song Using CNN.” 2016. Web. 27 Feb 2021.

Vancouver:

Narasimhan R. Simultaneous Segmentation and Classification of Bird Song Using CNN. [Internet] [Masters thesis]. Oregon State University; 2016. [cited 2021 Feb 27]. Available from: http://hdl.handle.net/1957/60040.

Council of Science Editors:

Narasimhan R. Simultaneous Segmentation and Classification of Bird Song Using CNN. [Masters Thesis]. Oregon State University; 2016. Available from: http://hdl.handle.net/1957/60040

Rutgers University

13. Li, Qiao, 1989-. Developing an intelligent assistant for the audit plan brainstorming session.

Degree: PhD, Management, 2019, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/60018/

►

During the initial stages of an audit, audit engagement teams are required to conduct brainstorming sessions to evaluate risk factors and discuss the susceptibility of… (more)

▼

During the initial stages of an audit, audit engagement teams are required to conduct brainstorming sessions to evaluate risk factors and discuss the susceptibility of the entity’s financial statements to material misstatement, either as a result of error or fraud (AICPA 2012). At present, the most commonly used decision support tool for audit plan brainstorming is the checklist (Bellovary and Johnstone 2007), which has shown limitations. Large audit firms have been investing in substantive resources to the utilization of Artificial Intelligence (AI) to take advantage of their past audit experience and industry knowledge (Kokina and Davenport 2017). This dissertation suggests that the latest intelligent assistant technology can be applied in the auditing domain to provide risk assessment decision supports to audit engagement teams during audit plan brainstorming discussions. Firstly, an interactive audit cognitive assistant framework is proposed to provide auditors with information retrieval and risk assessment help. The proposed framework provides a new method of knowledge organization for the audit domain, which potentially develops a knowledge base that stores many auditors’ knowledge and experience in audit risk identification and assessment. Furthermore, a Natural Language Processing (NLP)-based audit plan knowledge discovery system (APKDS) is proposed. By applying NLP techniques, the proposed system can continuously collect auditors’ professional experience and expertise in audit brainstorming discussions and transfer the discussion into classified knowledge for future use. The output of the proposed system can provide insights into how auditors identify and assess risks during the audit plan and how audit decisions are made. Finally, we propose a prototype for the APKDS framework and illustrate the development of important modules in the system. Experimental brainstorming meeting recordings are used as training and testing datasets in model building and training. We demonstrate that the proposed objectives of the system can be realized and the proposed system can provide effective decision-making support to auditors. In the end, we proposed the potential application of the audit cognitive assistant to other audit phases.

Advisors/Committee Members: Vasarhelyi, Miklos (chair), Kogan, Alexander (internal member), Brown-Liburd, Helen (internal member), Warren, Donald (outside member).

Subjects/Keywords: Auditing – Data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Li, Qiao, 1. (2019). Developing an intelligent assistant for the audit plan brainstorming session. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/60018/

Chicago Manual of Style (16^th Edition):

Li, Qiao, 1989-. “Developing an intelligent assistant for the audit plan brainstorming session.” 2019. Doctoral Dissertation, Rutgers University. Accessed February 27, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/60018/.

MLA Handbook (7^th Edition):

Li, Qiao, 1989-. “Developing an intelligent assistant for the audit plan brainstorming session.” 2019. Web. 27 Feb 2021.

Vancouver:

Li, Qiao 1. Developing an intelligent assistant for the audit plan brainstorming session. [Internet] [Doctoral dissertation]. Rutgers University; 2019. [cited 2021 Feb 27]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/60018/.

Council of Science Editors:

Li, Qiao 1. Developing an intelligent assistant for the audit plan brainstorming session. [Doctoral Dissertation]. Rutgers University; 2019. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/60018/

Rutgers University

14. Beavers, Traymon Everett, 1992-. Methodology for analyzing preclinical experiments.

Degree: PhD, Statistics and Biostatistics, 2019, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/60593/

► The dissertation examines three distinct methodologies for analyzing data yielded from preclinical experiments: 1) Big data has created new challenges for data analysis, particularly in… (more)

▼ The dissertation examines three distinct methodologies for analyzing data yielded from preclinical experiments: 1) Big data has created new challenges for data analysis, particularly in the realm of creating meaningful groups or clusters of data or classification. Clustering techniques, such as K-means or hierarchical clustering, based on pairwise distances of N objects, are popular methods for performing exploratory analysis on large datasets such as these. Unfortunately, these methods are not always possible to apply to big data due to memory or time constraints generated by calculations of order N². A work-around is to take a random sample of the large dataset and perform the clustering technique with the reduced dataset; however, this is not a foolproof solution since the structure of the dataset, particularly at the edges of the dataset, is not guaranteed to be maintained. In this chapter we will propose a new solution through the concept of “data nuggets”. These data nuggets reduce a larger dataset into a small collection of nuggets of data, each containing a center, weight, and a scale parameter. Once the data is re-expressed as data nuggets, we may apply algorithms that compute standard statistical methods, such as principal components analysis (PCA), clustering, classification, etc. We apply the methodology of data nuggets to the analysis of a dataset from flow cytometry in Biopharmaceutical research. This was conducted by performing weighted PCA and weighted K-means clustering on a dataset containing millions of observations (B-cells), and the objective was to find clusters that characterize cells according to which proteins are active on their surfaces. An R package was also developed to conduct these methods. 2) There are many cases in preclinical drug discovery when experiments are repeated but not precisely replicated regarding treatment arms. Further, full datasets are not always immediately accessible, leaving analysts to rely on summary measures such as sample mean and standard error. If one is only interested in comparing two treatment arms at a time, meta-analysis is a useful tool; however, when one applies this method they are limited to only comparing two of the potentially numerous treatment arms at a time. Further, information from experiments lacking these two treatment arms is not used. Mixed treatment comparisons meta-analysis, also known as network meta-analysis, can be used instead to compare all available treatment arms at once. This chapter will explain, explore, and compare two frequentist methods that exist to apply network meta-analysis. We focus on sets of experiments with designs typically found in preclinical experiments. We also use simulations to compare network meta-analysis results to those given by mixed-effect linear models for these types of experiments. An R package was also developed to perform both methods of network meta-analysis. 3) Power calculations for hypothesis tests play a critical role in conducting both clinical and non-clinical trials. Many programs exist to… Advisors/Committee Members: Cabrera, Javier (chair), Kolassa, John (internal member), Tyler, David (internal member), Lubomirski, Mariusz (outside member), School of Graduate Studies.

Subjects/Keywords: Experiments – Data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Beavers, Traymon Everett, 1. (2019). Methodology for analyzing preclinical experiments. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/60593/

Chicago Manual of Style (16^th Edition):

Beavers, Traymon Everett, 1992-. “Methodology for analyzing preclinical experiments.” 2019. Doctoral Dissertation, Rutgers University. Accessed February 27, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/60593/.

MLA Handbook (7^th Edition):

Beavers, Traymon Everett, 1992-. “Methodology for analyzing preclinical experiments.” 2019. Web. 27 Feb 2021.

Vancouver:

Beavers, Traymon Everett 1. Methodology for analyzing preclinical experiments. [Internet] [Doctoral dissertation]. Rutgers University; 2019. [cited 2021 Feb 27]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/60593/.

Council of Science Editors:

Beavers, Traymon Everett 1. Methodology for analyzing preclinical experiments. [Doctoral Dissertation]. Rutgers University; 2019. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/60593/

Hong Kong University of Science and Technology

15. Huang, Zengfeng. Computing summaries over distributed data.

Degree: 2013, Hong Kong University of Science and Technology

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

► Consider a distributed system with k nodes, where each node holds a part of the data. The goal is to extract some useful information from… (more)

Subjects/Keywords: Electronic data processing ; Distributed processing ; Mathematical models ; Big data ; Data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Huang, Z. (2013). Computing summaries over distributed data. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-61754 ; https://doi.org/10.14711/thesis-b1250313 ; http://repository.ust.hk/ir/bitstream/1783.1-61754/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):

Huang, Zengfeng. “Computing summaries over distributed data.” 2013. Thesis, Hong Kong University of Science and Technology. Accessed February 27, 2021. http://repository.ust.hk/ir/Record/1783.1-61754 ; https://doi.org/10.14711/thesis-b1250313 ; http://repository.ust.hk/ir/bitstream/1783.1-61754/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):

Huang, Zengfeng. “Computing summaries over distributed data.” 2013. Web. 27 Feb 2021.

Vancouver:

Huang Z. Computing summaries over distributed data. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2013. [cited 2021 Feb 27]. Available from: http://repository.ust.hk/ir/Record/1783.1-61754 ; https://doi.org/10.14711/thesis-b1250313 ; http://repository.ust.hk/ir/bitstream/1783.1-61754/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:

Huang Z. Computing summaries over distributed data. [Thesis]. Hong Kong University of Science and Technology; 2013. Available from: http://repository.ust.hk/ir/Record/1783.1-61754 ; https://doi.org/10.14711/thesis-b1250313 ; http://repository.ust.hk/ir/bitstream/1783.1-61754/1/th_redirect.html

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

16. Cao, Xiang. Efficient Data Management and Processing in Big Data Applications.

Degree: PhD, Computer Science, 2017, University of Minnesota

URL: http://hdl.handle.net/11299/188863

► In today's Big Data applications, huge amount of data are being generated. With the rapid growth of data amount, data management and processing become essential.… (more)

▼ In today's Big Data applications, huge amount of data are being generated. With the rapid growth of data amount, data management and processing become essential. It is important to design efficient approaches to manage and process data. In this thesis, data management and processing are investigated for Big Data applications. Key-value store (KVS) is widely used in many Big Data applications by providing flexible and efficient performance. Recently, a new Ethernet accessed disk drive for key-value pairs called "Kinetic Drive" was developed by Seagate. It can reduce the management complexity, especially in large-scale deployment. It is important to manage the key-value pairs and store them in Kinetic Drives in an organized way. In this thesis, we present data allocation schemes on a large-scale key-value store system using Kinetic Drives. We investigate key indexing schemes and allocate data on drives accordingly. We propose efficient approaches to migrate data among drives. Also, it is necessary to manage huge amount of key-value pairs to provide attributes search for users. In this thesis, we design a large-scale searchable key-value store system based on Kinetic Drives. We investigate an indexing scheme to map data to the drives. We propose a key generation approach to reflect metadata information of the actual data and support users' attributes search requests. Nowadays, MapReduce has become a very popular framework to process data in many applications. Data shuffling usually accounts for a large portion of the entire running time of MapReduce jobs. In recent years, scale-up computing architecture for MapReduce jobs has been developed. With multi-processor, multi-core design connected via NUMAlink and large shared memories, NUMA architecture provides a powerful scale-up computing capability. In this thesis, we focus on the optimization of data shuffling phase in MapReduce framework in NUMA machine. We concentrate on the various bandwidth capacities of NUMAlink(s) among different memory locations to fully utilize the network. We investigate the NUMAlink topology and propose a topology-aware reducer placement algorithm to speed up the data shuffling phase. We extend our approach to a larger computing environment with multiple NUMA machines.

Subjects/Keywords: Big Data; Data Management; Data Processing

4 more images…

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Cao, X. (2017). Efficient Data Management and Processing in Big Data Applications. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/188863

Chicago Manual of Style (16^th Edition):

Cao, Xiang. “Efficient Data Management and Processing in Big Data Applications.” 2017. Doctoral Dissertation, University of Minnesota. Accessed February 27, 2021. http://hdl.handle.net/11299/188863.

MLA Handbook (7^th Edition):

Cao, Xiang. “Efficient Data Management and Processing in Big Data Applications.” 2017. Web. 27 Feb 2021.

Vancouver:

Cao X. Efficient Data Management and Processing in Big Data Applications. [Internet] [Doctoral dissertation]. University of Minnesota; 2017. [cited 2021 Feb 27]. Available from: http://hdl.handle.net/11299/188863.

Council of Science Editors:

Cao X. Efficient Data Management and Processing in Big Data Applications. [Doctoral Dissertation]. University of Minnesota; 2017. Available from: http://hdl.handle.net/11299/188863

University of Delaware

17. Zhang, Boyu. Enabling scalable data analysis for large computational structural biology datasets on large distributed memory systems supported by the MapReduce paradigm.

Degree: PhD, University of Delaware, Department of Computer and Information Sciences, 2015, University of Delaware

URL: http://udspace.udel.edu/handle/19716/17204

► Today, petascale distributed memory systems perform large-scale simulations and generate massive amounts of data in a distributed fashion at unprecedented rates. This massive amount of… (more)

▼ Today, petascale distributed memory systems perform large-scale simulations and generate massive amounts of data in a distributed fashion at unprecedented rates. This massive amount of data presents new challenges for the scientists analyzing the data. In order to classify and cluster this data, traditional analysis methods require the comparison of single records with each other in an iterative process and therefore involve moving data across nodes of the system. When both the data and the number of nodes increase, classification and clustering methods can put increasing pressure on the system's storage and bandwidth. Thus, the methods become inefficient and do not scale. New methodologies are needed to analyze data when it is distributed across nodes of large distributed memory systems. In general, when analyzing such scientific data, we focus on specific properties of the data records. For example, in structural biology datasets, properties include the molecular geometry or the location of a molecule in a docking pocket. Based on this observation, we propose a methodology that enables the scalable analysis for large datasets, composed of millions of individual data records, in a distributed manner on large distributed memory systems. The methodology comprises two general steps. The first step extracts concise properties or features of each data record in isolation and represents them as metadata in parallel. The second step performs the analysis (i.e., classification or clustering) on the extracted properties (i.e., metadata) using machine learning techniques. We apply the methodology to three different computational structural biology datasets to (1) identify class memberships for large RNA sequences from their secondary structures, (2) identify geometrical features that can be used to predict class memberships for structural biology datasets containing ligand conformations from protein-ligand docking simulations, and (3) find recurrent folding patterns within and across trajectories (i.e., intra- and inter-trajectory, respectively) in multiple trajectories sampled from folding simulations. Since our method naturally fits in the MapReduce paradigm, we adapt it for different MapReduce frameworks (i.e., Hadoop and MapReduce-MPI) and use the frameworks on high-end clusters for the three scientific challenges listed above. Our results show that our approach enables scalable classification and clustering analyses for large-scale computational structural biology datasets on large distributed memory systems. In addition, compared with traditional analysis approaches, our method achieves similar or better accuracy. Advisors/Committee Members: Taufer, Michela.

Subjects/Keywords: Data mining.; MapReduce (Computer file); RNA – Data processing.; Ligands – Data processing.; Protein folding – Data processing.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Zhang, B. (2015). Enabling scalable data analysis for large computational structural biology datasets on large distributed memory systems supported by the MapReduce paradigm. (Doctoral Dissertation). University of Delaware. Retrieved from http://udspace.udel.edu/handle/19716/17204

Chicago Manual of Style (16^th Edition):

Zhang, Boyu. “Enabling scalable data analysis for large computational structural biology datasets on large distributed memory systems supported by the MapReduce paradigm.” 2015. Doctoral Dissertation, University of Delaware. Accessed February 27, 2021. http://udspace.udel.edu/handle/19716/17204.

MLA Handbook (7^th Edition):

Zhang, Boyu. “Enabling scalable data analysis for large computational structural biology datasets on large distributed memory systems supported by the MapReduce paradigm.” 2015. Web. 27 Feb 2021.

Vancouver:

Zhang B. Enabling scalable data analysis for large computational structural biology datasets on large distributed memory systems supported by the MapReduce paradigm. [Internet] [Doctoral dissertation]. University of Delaware; 2015. [cited 2021 Feb 27]. Available from: http://udspace.udel.edu/handle/19716/17204.

Council of Science Editors:

Zhang B. Enabling scalable data analysis for large computational structural biology datasets on large distributed memory systems supported by the MapReduce paradigm. [Doctoral Dissertation]. University of Delaware; 2015. Available from: http://udspace.udel.edu/handle/19716/17204

Hong Kong University of Science and Technology

18. Yi, Bairen CSE. Network optimization for distributed dataflow applications in datacenter.

Degree: 2019, Hong Kong University of Science and Technology

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

► Dataflow is a prevailing programming paradigm for processing data in a distributed fashion. When programming dataflow applications, programmers express a data processing task as a… (more)

Subjects/Keywords: Electronic data processing ; Distributed processing ; Data flow computing ; Data centers ; Data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Yi, B. C. (2019). Network optimization for distributed dataflow applications in datacenter. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-102373 ; https://doi.org/10.14711/thesis-991012757568203412 ; http://repository.ust.hk/ir/bitstream/1783.1-102373/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):

Yi, Bairen CSE. “Network optimization for distributed dataflow applications in datacenter.” 2019. Thesis, Hong Kong University of Science and Technology. Accessed February 27, 2021. http://repository.ust.hk/ir/Record/1783.1-102373 ; https://doi.org/10.14711/thesis-991012757568203412 ; http://repository.ust.hk/ir/bitstream/1783.1-102373/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):

Yi, Bairen CSE. “Network optimization for distributed dataflow applications in datacenter.” 2019. Web. 27 Feb 2021.

Vancouver:

Yi BC. Network optimization for distributed dataflow applications in datacenter. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2019. [cited 2021 Feb 27]. Available from: http://repository.ust.hk/ir/Record/1783.1-102373 ; https://doi.org/10.14711/thesis-991012757568203412 ; http://repository.ust.hk/ir/bitstream/1783.1-102373/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:

Yi BC. Network optimization for distributed dataflow applications in datacenter. [Thesis]. Hong Kong University of Science and Technology; 2019. Available from: http://repository.ust.hk/ir/Record/1783.1-102373 ; https://doi.org/10.14711/thesis-991012757568203412 ; http://repository.ust.hk/ir/bitstream/1783.1-102373/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. 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 February 27, 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. 27 Feb 2021.

Vancouver:

Cui W. Visual summarization and exploration of text streams. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2011. [cited 2021 Feb 27]. 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

20. Xie, Xiaoheng. Entity resolution for hidden Web data.

Degree: 2012, Hong Kong University of Science and Technology

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

► Entity resolution (ER) identifies and merges records judged to represent the same real-world entity. With the development of the Internet, ER for hidden Web data… (more)

Subjects/Keywords: Data mining ; Web databases ; Data processing ; Electronic data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Xie, X. (2012). Entity resolution for hidden Web data. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-73423 ; https://doi.org/10.14711/thesis-b1198811 ; http://repository.ust.hk/ir/bitstream/1783.1-73423/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):

Xie, Xiaoheng. “Entity resolution for hidden Web data.” 2012. Thesis, Hong Kong University of Science and Technology. Accessed February 27, 2021. http://repository.ust.hk/ir/Record/1783.1-73423 ; https://doi.org/10.14711/thesis-b1198811 ; http://repository.ust.hk/ir/bitstream/1783.1-73423/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):

Xie, Xiaoheng. “Entity resolution for hidden Web data.” 2012. Web. 27 Feb 2021.

Vancouver:

Xie X. Entity resolution for hidden Web data. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2012. [cited 2021 Feb 27]. Available from: http://repository.ust.hk/ir/Record/1783.1-73423 ; https://doi.org/10.14711/thesis-b1198811 ; http://repository.ust.hk/ir/bitstream/1783.1-73423/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:

Xie X. Entity resolution for hidden Web data. [Thesis]. Hong Kong University of Science and Technology; 2012. Available from: http://repository.ust.hk/ir/Record/1783.1-73423 ; https://doi.org/10.14711/thesis-b1198811 ; http://repository.ust.hk/ir/bitstream/1783.1-73423/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

21. Huang, Zhe. Towards a better computing cluster for big-data analytic systems.

Degree: 2015, Hong Kong University of Science and Technology

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

► In this study, multiple cost saving options for computing clusters specifically designed for big-data analytic systems are investigated. The ultimate goal is to allow the… (more)

▼ In this study, multiple cost saving options for computing clusters specifically designed for big-data analytic systems are investigated. The ultimate goal is to allow the computing clusters to provide more economical software hosting services for big-data analytic applications through hardware multiplexing, economics of scale, data sharing and so on. We are particularly interested in the research problems in the areas of virtual machine (VM) workload consolidation, job scheduling in big-data analytic framework and data deduplication in data storage systems. In particular, we seek to answer the following questions: (1) How should we group and assign virtual machines in order to minimize the cost of the data center? (2) How should we schedule jobs in a big-data analytic system according to their time budget? (3) How should files be distributed and stored in multiple servers in order to eliminate data redundancy maximally? By combining the answers to the above questions, we aim to produce advanced management systems that help the big-data application users reduce their overall operating cost without jeopardizing the quality of service of their applications. To produce insightful deigns, we mainly rely on advanced discrete optimization techniques and graph theoretic techniques to acquire intelligent decisions with system dynamics in consideration. For example, Lagrangian relaxation and M-convex optimization techniques are applied to solve the VM workload consolidation problem, while total unimodularity and robust optimization techniques are applied to perform job scheduling for big-data analytic systems in a real-time manner. The design principle that we value heavily is that the proposed solutions must consist of light-weight distributed algorithms that can be implemented for the real-world systems. Our proposals are derived with non-trivial theoretical foundations. To evaluate the practicality of the proposed systems, we built prototypes upon representative real-world platforms. For performance evaluations that require a large-scale data center, simulation programs are developed. Our results suggest that our proposed systems are efficient, agile and robust. We believe that after fine tuning, the prototype systems can be powerful tools for existing big-data analytic softwares.

Subjects/Keywords: Big data ; Data processing ; Electronic data processing ; Mathematical optimization

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Huang, Z. (2015). Towards a better computing cluster for big-data analytic systems. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-80127 ; https://doi.org/10.14711/thesis-b1552127 ; http://repository.ust.hk/ir/bitstream/1783.1-80127/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):

Huang, Zhe. “Towards a better computing cluster for big-data analytic systems.” 2015. Thesis, Hong Kong University of Science and Technology. Accessed February 27, 2021. http://repository.ust.hk/ir/Record/1783.1-80127 ; https://doi.org/10.14711/thesis-b1552127 ; http://repository.ust.hk/ir/bitstream/1783.1-80127/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):

Huang, Zhe. “Towards a better computing cluster for big-data analytic systems.” 2015. Web. 27 Feb 2021.

Vancouver:

Huang Z. Towards a better computing cluster for big-data analytic systems. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2015. [cited 2021 Feb 27]. Available from: http://repository.ust.hk/ir/Record/1783.1-80127 ; https://doi.org/10.14711/thesis-b1552127 ; http://repository.ust.hk/ir/bitstream/1783.1-80127/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:

Huang Z. Towards a better computing cluster for big-data analytic systems. [Thesis]. Hong Kong University of Science and Technology; 2015. Available from: http://repository.ust.hk/ir/Record/1783.1-80127 ; https://doi.org/10.14711/thesis-b1552127 ; http://repository.ust.hk/ir/bitstream/1783.1-80127/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

22. Li, Wei. Storage optimization for large wide tables in Hadoop.

Degree: 2015, Hong Kong University of Science and Technology

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

► Recent advances in data warehousing technologies are enabling the storage and processing of extremely large data sets. In viewing this opportunity, the leading cross-bank settlement… (more)

Subjects/Keywords: Apache Hadoop ; Big data ; Data warehousing ; 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, W. (2015). Storage optimization for large wide tables in Hadoop. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-91344 ; https://doi.org/10.14711/thesis-b1487570 ; http://repository.ust.hk/ir/bitstream/1783.1-91344/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, Wei. “Storage optimization for large wide tables in Hadoop.” 2015. Thesis, Hong Kong University of Science and Technology. Accessed February 27, 2021. http://repository.ust.hk/ir/Record/1783.1-91344 ; https://doi.org/10.14711/thesis-b1487570 ; http://repository.ust.hk/ir/bitstream/1783.1-91344/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, Wei. “Storage optimization for large wide tables in Hadoop.” 2015. Web. 27 Feb 2021.

Vancouver:

Li W. Storage optimization for large wide tables in Hadoop. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2015. [cited 2021 Feb 27]. Available from: http://repository.ust.hk/ir/Record/1783.1-91344 ; https://doi.org/10.14711/thesis-b1487570 ; http://repository.ust.hk/ir/bitstream/1783.1-91344/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 W. Storage optimization for large wide tables in Hadoop. [Thesis]. Hong Kong University of Science and Technology; 2015. Available from: http://repository.ust.hk/ir/Record/1783.1-91344 ; https://doi.org/10.14711/thesis-b1487570 ; http://repository.ust.hk/ir/bitstream/1783.1-91344/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

23. Qin, Bo CSE. On graph sparsifiers, graph sketches, fast linear solvers and network flow optimization.

Degree: 2017, Hong Kong University of Science and Technology

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

► Most graph algorithms run faster, sometimes by orders of magnitude, on sparse graphs (graphs containing few edges). By approximating a dense input graph by a… (more)

▼ Most graph algorithms run faster, sometimes by orders of magnitude, on sparse graphs (graphs containing few edges). By approximating a dense input graph by a suitable sparse graph or other data structure, one can improve an algorithm’s computation and storage efficiency. With this motivation, this thesis concentrates on the problem of how to construct a compact data structure that closely represents a given graph, as well as its related applications. Our first focus is graph sparsification. The generic graph sparsification problem is to approximate a given graph by a sparse graph (i.e., the graph sparsifier) on the same vertex set but retaining only a smaller subset of edges. Such a sparsifier usually preserves, with bounded error, some quantitative properties of the original graph, making it an appropriate candidate to replace the old graph in some computations. We present faster randomized and deterministic algorithms for constructing graph sparsifiers that preserve (up to small error) the value of every Laplacian quadratic form. We then extend the idea of graph sparsification to creating a novel data structure—graph sketches. Graph sketches differ from graph sparsifiers in two aspects: (i) Sketches can be any data structure, not limited to graphs, and (ii) Sketches only preserve the value of every fixed Laplacian quadratic form, with high probability. We present an algorithm for constructing nearly optimal graph sketches, which uses much less storage than even the graph sparsifier, matching the lower bound on the space size of sketches for storing graphs. Finally, we investigate two problems closely related to graph theory: the design of solvers for linear systems of equations, and the optimization of confluent network flows. For the former, we develop a new algorithm for solving a linear system for a special class of PSD matrices, those which can be decomposed into the sum of two almost commuting matrices. Our solver runs in time nearly linearly depending on the input size, beating previous best solvers. For the latter, we prove the logarithmic non-approximability of the single-sink Confluent Quickest Flow and Confluent Maximum Flow Over Time problems, and present polylogarithmic approximation algorithms. To the best of our knowledge, our algorithms are the first polynomial-time polylogarithmic approximation algorithms for these problems in a general network.

Subjects/Keywords: Electronic data processing ; Mathematical models ; Big data ; Data processing ; Sparse matrices

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Qin, B. C. (2017). On graph sparsifiers, graph sketches, fast linear solvers and network flow optimization. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-104956 ; https://doi.org/10.14711/thesis-991012530668903412 ; http://repository.ust.hk/ir/bitstream/1783.1-104956/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):

Qin, Bo CSE. “On graph sparsifiers, graph sketches, fast linear solvers and network flow optimization.” 2017. Thesis, Hong Kong University of Science and Technology. Accessed February 27, 2021. http://repository.ust.hk/ir/Record/1783.1-104956 ; https://doi.org/10.14711/thesis-991012530668903412 ; http://repository.ust.hk/ir/bitstream/1783.1-104956/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):

Qin, Bo CSE. “On graph sparsifiers, graph sketches, fast linear solvers and network flow optimization.” 2017. Web. 27 Feb 2021.

Vancouver:

Qin BC. On graph sparsifiers, graph sketches, fast linear solvers and network flow optimization. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2017. [cited 2021 Feb 27]. Available from: http://repository.ust.hk/ir/Record/1783.1-104956 ; https://doi.org/10.14711/thesis-991012530668903412 ; http://repository.ust.hk/ir/bitstream/1783.1-104956/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:

Qin BC. On graph sparsifiers, graph sketches, fast linear solvers and network flow optimization. [Thesis]. Hong Kong University of Science and Technology; 2017. Available from: http://repository.ust.hk/ir/Record/1783.1-104956 ; https://doi.org/10.14711/thesis-991012530668903412 ; http://repository.ust.hk/ir/bitstream/1783.1-104956/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. Wang, Senhong. Accelerating in-memory cross match of astronomical catalogs.

Degree: 2014, Hong Kong University of Science and Technology

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

► New astronomy projects generate observation images continuously and these images are converted into tabular catalogs online. Furthermore, each such new table, called a sample table,… (more)

Subjects/Keywords: Graphics processing units ; Astronomical photography ; Data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Wang, S. (2014). Accelerating in-memory cross match of astronomical catalogs. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-63082 ; https://doi.org/10.14711/thesis-b1301502 ; http://repository.ust.hk/ir/bitstream/1783.1-63082/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):

Wang, Senhong. “Accelerating in-memory cross match of astronomical catalogs.” 2014. Thesis, Hong Kong University of Science and Technology. Accessed February 27, 2021. http://repository.ust.hk/ir/Record/1783.1-63082 ; https://doi.org/10.14711/thesis-b1301502 ; http://repository.ust.hk/ir/bitstream/1783.1-63082/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):

Wang, Senhong. “Accelerating in-memory cross match of astronomical catalogs.” 2014. Web. 27 Feb 2021.

Vancouver:

Wang S. Accelerating in-memory cross match of astronomical catalogs. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2014. [cited 2021 Feb 27]. Available from: http://repository.ust.hk/ir/Record/1783.1-63082 ; https://doi.org/10.14711/thesis-b1301502 ; http://repository.ust.hk/ir/bitstream/1783.1-63082/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:

Wang S. Accelerating in-memory cross match of astronomical catalogs. [Thesis]. Hong Kong University of Science and Technology; 2014. Available from: http://repository.ust.hk/ir/Record/1783.1-63082 ; https://doi.org/10.14711/thesis-b1301502 ; http://repository.ust.hk/ir/bitstream/1783.1-63082/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. Zhao, Jiuxin. Accelerating site frequency spectrum estimation with graphics processors.

Degree: 2012, Hong Kong University of Science and Technology

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

► Estimating Site Frequency Spectrum (SFS) from gene sequences is an important task in population genetic analysis. SFS is a statistical summary that describes the distribution… (more)

Subjects/Keywords: Graphics processing units ; Gene mapping – Data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Zhao, J. (2012). Accelerating site frequency spectrum estimation with graphics processors. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7762 ; https://doi.org/10.14711/thesis-b1198330 ; http://repository.ust.hk/ir/bitstream/1783.1-7762/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, Jiuxin. “Accelerating site frequency spectrum estimation with graphics processors.” 2012. Thesis, Hong Kong University of Science and Technology. Accessed February 27, 2021. http://repository.ust.hk/ir/Record/1783.1-7762 ; https://doi.org/10.14711/thesis-b1198330 ; http://repository.ust.hk/ir/bitstream/1783.1-7762/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, Jiuxin. “Accelerating site frequency spectrum estimation with graphics processors.” 2012. Web. 27 Feb 2021.

Vancouver:

Zhao J. Accelerating site frequency spectrum estimation with graphics processors. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2012. [cited 2021 Feb 27]. Available from: http://repository.ust.hk/ir/Record/1783.1-7762 ; https://doi.org/10.14711/thesis-b1198330 ; http://repository.ust.hk/ir/bitstream/1783.1-7762/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 J. Accelerating site frequency spectrum estimation with graphics processors. [Thesis]. Hong Kong University of Science and Technology; 2012. Available from: http://repository.ust.hk/ir/Record/1783.1-7762 ; https://doi.org/10.14711/thesis-b1198330 ; http://repository.ust.hk/ir/bitstream/1783.1-7762/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. Gao, Xiang. Efficient parallel programming on datacenter platforms with disciplined memory access.

Degree: 2012, Hong Kong University of Science and Technology

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

► Many distributed system technologies and programming frameworks are developed to support parallelized computation on the datacenter platform. While simplifying data-centric parallel computation, existing system technologies… (more)

Subjects/Keywords: Electronic data processing ; Distributed processing ; Database management

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Gao, X. (2012). Efficient parallel programming on datacenter platforms with disciplined memory access. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-7871 ; https://doi.org/10.14711/thesis-b1213383 ; http://repository.ust.hk/ir/bitstream/1783.1-7871/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):

Gao, Xiang. “Efficient parallel programming on datacenter platforms with disciplined memory access.” 2012. Thesis, Hong Kong University of Science and Technology. Accessed February 27, 2021. http://repository.ust.hk/ir/Record/1783.1-7871 ; https://doi.org/10.14711/thesis-b1213383 ; http://repository.ust.hk/ir/bitstream/1783.1-7871/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):

Gao, Xiang. “Efficient parallel programming on datacenter platforms with disciplined memory access.” 2012. Web. 27 Feb 2021.

Vancouver:

Gao X. Efficient parallel programming on datacenter platforms with disciplined memory access. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2012. [cited 2021 Feb 27]. Available from: http://repository.ust.hk/ir/Record/1783.1-7871 ; https://doi.org/10.14711/thesis-b1213383 ; http://repository.ust.hk/ir/bitstream/1783.1-7871/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:

Gao X. Efficient parallel programming on datacenter platforms with disciplined memory access. [Thesis]. Hong Kong University of Science and Technology; 2012. Available from: http://repository.ust.hk/ir/Record/1783.1-7871 ; https://doi.org/10.14711/thesis-b1213383 ; http://repository.ust.hk/ir/bitstream/1783.1-7871/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

27. Lee, Dexter CSE. A GPU implementation of the dynamic Yannakakis algorithm.

Degree: 2018, Hong Kong University of Science and Technology

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

► With the need to perform data updates on database systems that are increasing in size, researchers are looking for ways to evaluate join queries efficiently… (more)

Subjects/Keywords: Graphics processing units ; Algorithms ; Data processing

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Lee, D. C. (2018). A GPU implementation of the dynamic Yannakakis algorithm. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-95800 ; https://doi.org/10.14711/thesis-991012636367103412 ; http://repository.ust.hk/ir/bitstream/1783.1-95800/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):

Lee, Dexter CSE. “A GPU implementation of the dynamic Yannakakis algorithm.” 2018. Thesis, Hong Kong University of Science and Technology. Accessed February 27, 2021. http://repository.ust.hk/ir/Record/1783.1-95800 ; https://doi.org/10.14711/thesis-991012636367103412 ; http://repository.ust.hk/ir/bitstream/1783.1-95800/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):

Lee, Dexter CSE. “A GPU implementation of the dynamic Yannakakis algorithm.” 2018. Web. 27 Feb 2021.

Vancouver:

Lee DC. A GPU implementation of the dynamic Yannakakis algorithm. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2018. [cited 2021 Feb 27]. Available from: http://repository.ust.hk/ir/Record/1783.1-95800 ; https://doi.org/10.14711/thesis-991012636367103412 ; http://repository.ust.hk/ir/bitstream/1783.1-95800/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:

Lee DC. A GPU implementation of the dynamic Yannakakis algorithm. [Thesis]. Hong Kong University of Science and Technology; 2018. Available from: http://repository.ust.hk/ir/Record/1783.1-95800 ; https://doi.org/10.14711/thesis-991012636367103412 ; http://repository.ust.hk/ir/bitstream/1783.1-95800/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

28. Shen, Tianwei CSE. Efficient and accurate data association in large-scale structure-from-motion and beyond.

Degree: 2019, Hong Kong University of Science and Technology

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

► Data association, in the context of Structure-from-Motion (SfM) and Simultaneous Localization and Mapping (SLAM), is the process of associating uncertain measurements (e.g., image pixels, local… (more)

▼ Data association, in the context of Structure-from-Motion (SfM) and Simultaneous Localization and Mapping (SLAM), is the process of associating uncertain measurements (e.g., image pixels, local descriptors, and 3D tracks) to the same object or identity. It forms the foundation of many 3D computer vision problems, starting from finding local feature correspondences, identifying similar images with overlaps, up to bundle adjustment and related graph-based optimization problems that seek to achieve a harmonious status in terms of geometric and photometric quantities. Unlike deterministic pose estimation algorithms that typically have closed-form solutions, data association usually works in a noisy setting and does not possess an analytical form. It dramatically affects the efficiency and accuracy of the reconstruction. This thesis explores the elements of the data association problem in the context of 3D reconstruction and related issues. More specifically, we first give a thorough overview of the state-of-the-art SfM pipeline, with a focus on the functionality of data association in each of its sub-steps. Then we describe three novel methods to solve the data association in SfM-related 3D computer vision problems. First, we propose a learning-based algorithm for the efficient and accurate association of similar images that depict the same scene, which often serves as the first step in a large-scale 3D reconstruction to accelerate the later image matching pipeline. Though Convolutional Neural Networks (CNNs) have achieved superior performance on object image retrieval, Bag-of-Words (BoW) models with handcrafted local features still dominate the retrieval of overlapping images in 3D reconstruction. We narrow down this gap by presenting an efficient CNN-based method to retrieve images with overlaps, which we refer to as the matchable image retrieval problem. We propose a batched triplet-based loss function combined with mesh re-projection to learn the CNN representation effectively. The proposed method significantly accelerates the image retrieval process in 3D reconstruction and outperforms the state-of-the-art CNN-based and BoW methods for matchable image retrieval. Based on the pairwise image matching, we present a match graph construction method that tackles the issues of completeness, efficiency, and consistency in a unified framework. Pairwise image matching of unordered image collections greatly affects the efficiency and accuracy of SfM. Insufficient match pairs may result in disconnected structures or incomplete components, while costly redundant pairs containing erroneous ones may lead to folded and superimposed structures. This approach starts by chaining all but singleton images using a visual-similarity-based minimum spanning tree. Then the minimum spanning tree is incrementally expanded to form locally consistent strong triplets. Finally, a global community-based graph algorithm is introduced to strengthen global consistency by reinforcing potentially dominant connected components. We demonstrate the…

Subjects/Keywords: Image processing ; Data processing ; Photogrammetry ; Computer vision

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Shen, T. C. (2019). Efficient and accurate data association in large-scale structure-from-motion and beyond. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-100354 ; https://doi.org/10.14711/thesis-991012730762303412 ; http://repository.ust.hk/ir/bitstream/1783.1-100354/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):

Shen, Tianwei CSE. “Efficient and accurate data association in large-scale structure-from-motion and beyond.” 2019. Thesis, Hong Kong University of Science and Technology. Accessed February 27, 2021. http://repository.ust.hk/ir/Record/1783.1-100354 ; https://doi.org/10.14711/thesis-991012730762303412 ; http://repository.ust.hk/ir/bitstream/1783.1-100354/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):

Shen, Tianwei CSE. “Efficient and accurate data association in large-scale structure-from-motion and beyond.” 2019. Web. 27 Feb 2021.

Vancouver:

Shen TC. Efficient and accurate data association in large-scale structure-from-motion and beyond. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2019. [cited 2021 Feb 27]. Available from: http://repository.ust.hk/ir/Record/1783.1-100354 ; https://doi.org/10.14711/thesis-991012730762303412 ; http://repository.ust.hk/ir/bitstream/1783.1-100354/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:

Shen TC. Efficient and accurate data association in large-scale structure-from-motion and beyond. [Thesis]. Hong Kong University of Science and Technology; 2019. Available from: http://repository.ust.hk/ir/Record/1783.1-100354 ; https://doi.org/10.14711/thesis-991012730762303412 ; http://repository.ust.hk/ir/bitstream/1783.1-100354/1/th_redirect.html

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

Latrobe University

29. Murugesan, Selvaraaju. Wavelets and filter banks : novel design and applications.

Degree: PhD, 2014, Latrobe University

URL: http://hdl.handle.net/1959.9/501712

►

Thesis (Ph.D.) - La Trobe University, 2014

Submission note: "A thesis submitted in total fulfilment of the requirements for the degree of Doctor of Philosophy… (more)

Subjects/Keywords: Signal processing.; Wavelets (Mathematics) – Data processing.

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Murugesan, S. (2014). Wavelets and filter banks : novel design and applications. (Doctoral Dissertation). Latrobe University. Retrieved from http://hdl.handle.net/1959.9/501712

Chicago Manual of Style (16^th Edition):

Murugesan, Selvaraaju. “Wavelets and filter banks : novel design and applications.” 2014. Doctoral Dissertation, Latrobe University. Accessed February 27, 2021. http://hdl.handle.net/1959.9/501712.

MLA Handbook (7^th Edition):

Murugesan, Selvaraaju. “Wavelets and filter banks : novel design and applications.” 2014. Web. 27 Feb 2021.

Vancouver:

Murugesan S. Wavelets and filter banks : novel design and applications. [Internet] [Doctoral dissertation]. Latrobe University; 2014. [cited 2021 Feb 27]. Available from: http://hdl.handle.net/1959.9/501712.

Council of Science Editors:

Murugesan S. Wavelets and filter banks : novel design and applications. [Doctoral Dissertation]. Latrobe University; 2014. Available from: http://hdl.handle.net/1959.9/501712

Rutgers University

30. Kim, Joseph Jung-Woong, 1983-. Single cell high content textural image analysis of dynamic epigenetic signatures as a response to defined microenvironmental parameters.

Degree: PhD, Biomedical Engineering, 2015, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/46370/

►

Currently, quantifiable investigations of the epigenome require cell lysis and are population based, prohibiting direct investigations of intact intranuclear structural organization and introducing noise into… (more)

▼

Currently, quantifiable investigations of the epigenome require cell lysis and are population based, prohibiting direct investigations of intact intranuclear structural organization and introducing noise into data obtained from inherently heterogeneous stem cell populations. To address this, we have developed and employed a single-cell high-content image informatics framework to capture organizational signatures of epigenetic signaling components from images of cellular nuclei obtained via superresolution nanoscopy. High dimensional quantitative texture descriptors of the organizational dynamics of key posttranslational modifications to core histone proteins were imaged in different human stem cell systems using time-gated stimulated emission depletion confocal nanoscopy. Influential texture descriptors were identified, validated at the nanoscale using immuno-gold electron microscopy, and organizational sub-classifiers were generated from this bioimage informatics data representing a range of “open” versus “closed” chromatin states. When applied to growth factor-induced lineage differentiation of human mesenchymal stem cells, the organizational classifiers showed a clear evolution with temporal cell state, which was more sensitive than the conventional mass spectrometry-based quantitation of the relative abundance of these PTMs. When a range of stem cell phenotypes sharing common DNA sequences were imaged, clear sub-classifiers emerged correlating with the divergent phenotypes for undifferentiated, adipogenic, and osteogenic hMSCs, as well as for human foreskin fibroblasts, induced pluripotent stem cells, neural stem cells, and reprogrammed neurons. Thus, high content bioimage informatics reflective of chromatin organization yields a higher order organizational signature corresponding to an epigenetic “activity” state. To elucidate the influence of biophysical factors on stem cell epigenetic states, these imaging-based organizational classifiers were tested on human mesenchymal stem cells exposed to physically constraining cues, and successfully predicted the early differentiation toward adipogenic hMSCs on hydrogel substrates with spatially graded mechanical stiffness, as well as osteogenic hMSCs on soft-lithographed, graded nanotopographies. In summary, in contrast to the traditional reductionist, population-level readouts in epigenomics, the approach outlined in this thesis offers a more integrated, single-cell, organizational index of emergent stem cell activity in response to defined environmental cues, and can be applied for the screening of discrete microenvironmental properties for the enhancement of stem cell behavioral control and facilitated integration in regenerative medicine applications.

Advisors/Committee Members: Moghe, Prabhas (chair), Verzi, Michael (internal member), Androulakis, Ioannis (internal member), Boustany, Nada (internal member), Serrano, Lourdes (internal member), Madabhushi, Anant (outside member).

Subjects/Keywords: Epigenetics; Image processing – Data processing; Electron microscopy

Record Details Similar Records Cite « Share

❌

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

APA (6^th Edition):

Kim, Joseph Jung-Woong, 1. (2015). Single cell high content textural image analysis of dynamic epigenetic signatures as a response to defined microenvironmental parameters. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/46370/

Chicago Manual of Style (16^th Edition):

Kim, Joseph Jung-Woong, 1983-. “Single cell high content textural image analysis of dynamic epigenetic signatures as a response to defined microenvironmental parameters.” 2015. Doctoral Dissertation, Rutgers University. Accessed February 27, 2021. https://rucore.libraries.rutgers.edu/rutgers-lib/46370/.

MLA Handbook (7^th Edition):

Kim, Joseph Jung-Woong, 1983-. “Single cell high content textural image analysis of dynamic epigenetic signatures as a response to defined microenvironmental parameters.” 2015. Web. 27 Feb 2021.

Vancouver:

Kim, Joseph Jung-Woong 1. Single cell high content textural image analysis of dynamic epigenetic signatures as a response to defined microenvironmental parameters. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2021 Feb 27]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46370/.

Council of Science Editors:

Kim, Joseph Jung-Woong 1. Single cell high content textural image analysis of dynamic epigenetic signatures as a response to defined microenvironmental parameters. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46370/

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

Open Access Theses and Dissertations