You searched for subject:(Data flow).
Showing records 1 – 30 of
505 total matches.
◁ [1] [2] [3] [4] [5] … [17] ▶
Delft University of Technology
1.
van der Bok, Kees (author).
Polyhedral Compilation for Data Flow Computers.
Degree: 2018, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:4b7278df-1660-4566-bf0f-1cc641853173 
► The increasing transistor density of Integrated Circuits (ICs) ever since their introduction, has scaled the computational performance of microprocessors. As a consequence of the gain…
(more)
▼ The increasing transistor density of Integrated Circuits (ICs) ever since their introduction, has scaled the computational performance of microprocessors. As a consequence of the gain in transistor density, the power dissipation density has also increased to a degree that has become a limiting factor in further performance scaling. The prevalent control
flow computing paradigm is, especially in the context of High Performance Computing (HPC), faced with this power crisis.
Data flow computing can achieve a better computations per unit power ratio and might therefore be the solution to achieving exa-scale computing, enabling progress in science and technology. This work contributes in investigating methods for increasing the abstraction level of
data flow programming by using a Polyhedral Process Network (PPN) as abstraction to facilitate automated analysis and transformation of
data flow applications. A Polyhedral Process Network (PPN) is a process network based on Polyhedral Compilation (PC) a mathematical framework for code analysis and optimisations. A tool has been implemented to translate a PPN to a
data flow implementation. The Maxeler
Data Flow Engine (DFE) technology, a
data flow hardware platform supported by a tool-
flow, is used as target technology. For a number of specific challenges involved in the transformation from PPN to DFE-implementation a method has been implemented. This has shown that a PPN as well as the capabilities of PC are useful concepts that are applicable to further increase of the abstraction-level of
data flow computing. However the transformation from PPN to DFE-implementation is complex. Therefore this work concludes that the development of a
data flow tailored Polyhedral Compilation (PC) abstraction is the most promising future direction.
Advisors/Committee Members: van Genderen, Arjan (mentor), Gaydadjiev, Georgi (mentor), Wong, Stephan (graduation committee), Strydis, Christos (graduation committee), Delft University of Technology (degree granting institution).
Subjects/Keywords: Data flow Computing; Polyhedral Compilation; Data Flow Engine; Polyhedral Process Networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
van der Bok, K. (. (2018). Polyhedral Compilation for Data Flow Computers. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:4b7278df-1660-4566-bf0f-1cc641853173
Chicago Manual of Style (16th Edition):
van der Bok, Kees (author). “Polyhedral Compilation for Data Flow Computers.” 2018. Masters Thesis, Delft University of Technology. Accessed March 02, 2021.
http://resolver.tudelft.nl/uuid:4b7278df-1660-4566-bf0f-1cc641853173.
MLA Handbook (7th Edition):
van der Bok, Kees (author). “Polyhedral Compilation for Data Flow Computers.” 2018. Web. 02 Mar 2021.
Vancouver:
van der Bok K(. Polyhedral Compilation for Data Flow Computers. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2021 Mar 02].
Available from: http://resolver.tudelft.nl/uuid:4b7278df-1660-4566-bf0f-1cc641853173.
Council of Science Editors:
van der Bok K(. Polyhedral Compilation for Data Flow Computers. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:4b7278df-1660-4566-bf0f-1cc641853173
Hong Kong University of Science and Technology
2.
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)
▼ 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 dataflow graph, with its vertices as specific operations and its edges as input/output relations or dataflow dependencies between operations. When deployed inside a data center in which a large number of processors are available, the dataflow graph is partitioned and placed onto different processors for improved processing throughput. For graph edges that cross the partition boundaries, the distributed execution engine needs to transferred data chunks between different processors. Increasingly higher data volumes and more substantial processing power of individual processors often bringing in communication bottleneck onto the inter-processor links, resulting in severe performance degradation to the distributed dataflow applications. In recent years, Remote Direct Memory Access (RDMA) becomes widely deployed in the data center as an alternative to the Transport Control Protocol (TCP). RDMA offers ultra-low latency and CPU bypass networking to application programmers. Programmers often designed existing applications around socket-based software stack that manages application buffers separately from networking buffers and does memory copies between them when sending and receiving data. With large-sized (up to hundreds MB) application buffers, the cost of such copies adds non-trivial overhead to the end-to-end communication pipeline. In this work, we attempted to design a zero-copy transport for distributing dataflow applications that unifies application and networking buffer management and eliminates unnecessary memory copies. Our prototype on top of TensorFlow shows 2.43x performance improvement over gRPC based transport and 1.21x performance improvement over an alternative RDMA transport with separate buffers and memory copies.
Subjects/Keywords: Electronic data processing
; Distributed processing
; Data flow computing
; Data centers
; Data processing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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 (16th Edition):
Yi, Bairen CSE. “Network optimization for distributed dataflow applications in datacenter.” 2019. Thesis, Hong Kong University of Science and Technology. Accessed March 02, 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 (7th Edition):
Yi, Bairen CSE. “Network optimization for distributed dataflow applications in datacenter.” 2019. Web. 02 Mar 2021.
Vancouver:
Yi BC. Network optimization for distributed dataflow applications in datacenter. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2019. [cited 2021 Mar 02].
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
Ryerson University
3.
Bassan, Jaspreet Kaur.
Classifying streaming data using grammar-based immune programming.
Degree: 2016, Ryerson University
URL: https://digital.library.ryerson.ca/islandora/object/RULA%3A5845
► This work proposes a technique for classifying unlabelled streaming data using grammar-based immune programming, a hybrid meta-heuristic where the space of grammar generated solutions is…
(more)
▼ This work proposes a technique for classifying unlabelled streaming data using grammar-based immune programming, a hybrid meta-heuristic where the space of grammar generated solutions is searched by an artificial immune system inspired algorithm. Data is labelled using an active learning technique and is buffered until the system trains adequately on the labelled data. The system is employed in static and in streaming data environments, and is tested and evaluated using synthetic and real-world data. The performances of the system employed in different data settings are compared with each other and with two benchmark problems. The proposed classification system adapted well to the changing nature of streaming data and the active learning technique made the process less computationally expensive by retaining only those instances which favoured the training process.
Subjects/Keywords: Data flow computing; Artificial immune systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Bassan, J. K. (2016). Classifying streaming data using grammar-based immune programming. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A5845
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Bassan, Jaspreet Kaur. “Classifying streaming data using grammar-based immune programming.” 2016. Thesis, Ryerson University. Accessed March 02, 2021.
https://digital.library.ryerson.ca/islandora/object/RULA%3A5845.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Bassan, Jaspreet Kaur. “Classifying streaming data using grammar-based immune programming.” 2016. Web. 02 Mar 2021.
Vancouver:
Bassan JK. Classifying streaming data using grammar-based immune programming. [Internet] [Thesis]. Ryerson University; 2016. [cited 2021 Mar 02].
Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A5845.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Bassan JK. Classifying streaming data using grammar-based immune programming. [Thesis]. Ryerson University; 2016. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A5845
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Oregon State University
4.
Chang, Chih-ming.
Micro data flow processor design.
Degree: MS, Electrical and Computer Engineering, 1993, Oregon State University
URL: http://hdl.handle.net/1957/35635
► Computer has evolved rapidly during the past several decades in terms of its implementation technology; it's architecture, however, has not changed dramatically since the von…
(more)
▼ Computer has evolved rapidly during the past several decades in terms of
its implementation technology; it's architecture, however, has not changed dramatically
since the von Neumann computer(control
flow) model emerged in the 1940s. One
main reason is that the performance for this kind of computers was able to satisfy
the requirement of most users. Another reason maybe that the engineers who designed
them are more familiar with this model. However, recent solutions to the problem
of parallelizing sequential nature instructions on a von Neumann machine complicate
both the compiler and the controller design. Therefore, another computer model, namely
the
data flow model, has regained attention since this model of computation exposes
parallelism inherent in the program naturally.
In terms of implementation methodology, we currently use synchronous sequential
logic, which is clock controlled for synchronization within circuits. This design
philosophy becomes hard to follow due to the occurrence of clock skew as the clock
frequency goes higher and higher. One way to eliminate these clock related problems
is to use the self-timed(asynchronous) implementation methodology. It features advantages
such as free of clock-skew, low power consumption, composibility and so forth.
Since
data flow(
data driven) computation model provides the execution of instructions
asynchronously, it is natural to implement a
data flow processor using self-timed circuits.
In this thesis, micro pipelines, one of the self-timed implementation methodology,
is used to implement a preliminary version of general purpose static
data flow
processor. Some interesting observations will be addressed in this thesis. An example
program of general difference recursive equation is given to test the correctness and
performance of this processor. We hope to gain more insight on how to design and
implement self-timed systems in the future.
Advisors/Committee Members: Lu, Shih-Lien (advisor).
Subjects/Keywords: Data flow computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chang, C. (1993). Micro data flow processor design. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/35635
Chicago Manual of Style (16th Edition):
Chang, Chih-ming. “Micro data flow processor design.” 1993. Masters Thesis, Oregon State University. Accessed March 02, 2021.
http://hdl.handle.net/1957/35635.
MLA Handbook (7th Edition):
Chang, Chih-ming. “Micro data flow processor design.” 1993. Web. 02 Mar 2021.
Vancouver:
Chang C. Micro data flow processor design. [Internet] [Masters thesis]. Oregon State University; 1993. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/1957/35635.
Council of Science Editors:
Chang C. Micro data flow processor design. [Masters Thesis]. Oregon State University; 1993. Available from: http://hdl.handle.net/1957/35635
Oregon State University
5.
Merani, Lalit T.
A micro data flow (MDF) : a data flow approach to self-timed VLSI system design for DSP.
Degree: MS, Electrical and Computer Engineering, 1993, Oregon State University
URL: http://hdl.handle.net/1957/36301
► Synchronization is one of the important issues in digital system design. While other approaches have been intriguing, up until now a globally clocked timing discipline…
(more)
▼ Synchronization is one of the important issues in digital system design. While
other approaches have been intriguing, up until now a globally clocked timing
discipline has been the dominant design philosophy. However, we have reached the
point, with advances in technology, where other options should be given serious
consideration. VLSI promises great processing power at low cost. This increase in
computation power has been obtained by scaling the digital IC process. But as this
scaling continues, it is doubtful that the advantages of faster devices can be fully
exploited. This is because the clock periods are getting much smaller in relation to the
interconnect propagation delays, even within a single chip and certainly at the board and
backplane level.
In this thesis, some alternative approaches to synchronization in digital system
design are described and developed. We owe these techniques to a long history of
effort in both digital computational system design as well as digital communication
system design. The latter field is relevant because large propagation delays have always
been a dominant consideration in its design methods.
Asynchronous design gives better performance than comparable synchronous
design in situations for which a global synchronization with a high speed clock
becomes a constraint for greater system throughput. Asynchronous circuits with
unbounded gate delays, or self-timed digital circuit can be designed by employing either
of two request-acknowledge protocols 4-cycle and 2-cycle.
We will also present an alternative approach to the problem of mapping
computation algorithms directly into asynchronous circuits.
Data flow graph or
language is used to describe the computation algorithms. The
data flow primitives have
been designed using both the 2-cycle and 4-cycle signaling schemes which are
compared in terms of performance and transistor count. The 2-cycle implementations
prove to be better than their 4-cycle counterparts.
A promising application of self-timed design is in high performance DSP
systems. Since there is no global constraint of clock distribution, localized forwardonly
connection allows computation to be extended and sped up using pipelining. A
decimation filter was designed and simulated to check the system level performance of
the two protocols. Simulations were carried out using VHDL for high level definition
of the design. The simulation results will demonstrate not only the efficacy of our
synthesis procedure but also the improved efficiency of the 2-cycle scheme over the 4-
cycle scheme.
Advisors/Committee Members: Lu, Shih-Lien (advisor).
Subjects/Keywords: Data flow computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Merani, L. T. (1993). A micro data flow (MDF) : a data flow approach to self-timed VLSI system design for DSP. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/36301
Chicago Manual of Style (16th Edition):
Merani, Lalit T. “A micro data flow (MDF) : a data flow approach to self-timed VLSI system design for DSP.” 1993. Masters Thesis, Oregon State University. Accessed March 02, 2021.
http://hdl.handle.net/1957/36301.
MLA Handbook (7th Edition):
Merani, Lalit T. “A micro data flow (MDF) : a data flow approach to self-timed VLSI system design for DSP.” 1993. Web. 02 Mar 2021.
Vancouver:
Merani LT. A micro data flow (MDF) : a data flow approach to self-timed VLSI system design for DSP. [Internet] [Masters thesis]. Oregon State University; 1993. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/1957/36301.
Council of Science Editors:
Merani LT. A micro data flow (MDF) : a data flow approach to self-timed VLSI system design for DSP. [Masters Thesis]. Oregon State University; 1993. Available from: http://hdl.handle.net/1957/36301
Oregon State University
6.
Freytag, Vincent R.
Program allocation for hypercube based dataflow systems.
Degree: MS, Electrical and Computer Engineering, 1993, Oregon State University
URL: http://hdl.handle.net/1957/36758
► The dataflow model of computation differs from the traditional control-flow model of computation in that it does not utilize a program counter to sequence instructions…
(more)
▼ The dataflow model of computation differs from the traditional control-
flow
model of computation in that it does not utilize a program counter to sequence
instructions in a program. Instead, the execution of instructions is based solely on the
availability of their operands. Thus, an instruction is executed in a dataflow computer
when all of its operands are available. This asynchronous nature of the dataflow model of
computation allows the exploitation of fine-grain parallelism inherent in programs.
Although the dataflow model of computation exploits parallelism, the problem of
optimally allocating a program to processors belongs to the class of NP-complete
problems. Therefore, one of the major issues facing designers of dataflow
multiprocessors is the proper allocation of programs to processors.
The problem of program allocation lies in maximizing parallelism while
minimizing interprocessor communication costs. The culmination of research in the area
of program allocation has produced the proposed method called the Balanced Layered
Allocation Scheme that utilizes heuristic rules to strike a balance between computation
time and communication costs in dataflow multiprocessors. Specifically, the proposed
allocation scheme utilizes Critical Path and Longest Directed Path heuristics when
allocating instructions to processors. Simulation studies indicate that the proposed
scheme is effective in reducing the overall execution time of a program by considering
the effects of communication costs on computation times.
Advisors/Committee Members: Lee, Ben (advisor), Kiaei, Sayfe (committee member).
Subjects/Keywords: Data flow computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Freytag, V. R. (1993). Program allocation for hypercube based dataflow systems. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/36758
Chicago Manual of Style (16th Edition):
Freytag, Vincent R. “Program allocation for hypercube based dataflow systems.” 1993. Masters Thesis, Oregon State University. Accessed March 02, 2021.
http://hdl.handle.net/1957/36758.
MLA Handbook (7th Edition):
Freytag, Vincent R. “Program allocation for hypercube based dataflow systems.” 1993. Web. 02 Mar 2021.
Vancouver:
Freytag VR. Program allocation for hypercube based dataflow systems. [Internet] [Masters thesis]. Oregon State University; 1993. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/1957/36758.
Council of Science Editors:
Freytag VR. Program allocation for hypercube based dataflow systems. [Masters Thesis]. Oregon State University; 1993. Available from: http://hdl.handle.net/1957/36758
University of Waterloo
7.
Sharma, Manoj Kumar.
A Design Space for Distributed Producer-Consumer Data Structures Using RDMA.
Degree: 2020, University of Waterloo
URL: http://hdl.handle.net/10012/16163
► Remote Direct Memory Access (RDMA) has become a standard networking technology and is prominently used in high-performance applications. While RDMA can provide both excellent performance…
(more)
▼ Remote Direct Memory Access (RDMA) has become a standard networking technology and is prominently used in high-performance applications.
While RDMA can provide both excellent performance and novel capabilities, it can be more difficult than traditional kernel-supported networking to use effectively. RDMA adoption can be simplified through the use of abstractions that target broad classes of applications. In this thesis, we propose flow structures as an abstraction targeting distributed applications in which data need to flow directly between producers and consumers. Flow structures are asymmetric distributed producer/consumer data structures in which some servers only produce and others only consume. We present a design space for RDMA implementations of flow structures and illustrate the space using several concrete implementations of a simple flow structure: a FIFO queue. Finally, we present an empirical study that illustrates the design tradeoffs along the dimensions of the design space, and that shows that flow structures abstractions can capture the performance advantages of RDMA while making it much easier to use.
Subjects/Keywords: Distributed Data Structures; Flow Structures; RDMA
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sharma, M. K. (2020). A Design Space for Distributed Producer-Consumer Data Structures Using RDMA. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16163
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Sharma, Manoj Kumar. “A Design Space for Distributed Producer-Consumer Data Structures Using RDMA.” 2020. Thesis, University of Waterloo. Accessed March 02, 2021.
http://hdl.handle.net/10012/16163.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Sharma, Manoj Kumar. “A Design Space for Distributed Producer-Consumer Data Structures Using RDMA.” 2020. Web. 02 Mar 2021.
Vancouver:
Sharma MK. A Design Space for Distributed Producer-Consumer Data Structures Using RDMA. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/10012/16163.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Sharma MK. A Design Space for Distributed Producer-Consumer Data Structures Using RDMA. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16163
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Delft University of Technology
8.
Meijers, Onno (author).
Implementation of the BiCGSTAB method for the Helmholtz Equation on a Maxeler Data Flow Machine.
Degree: 2017, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:adc4ad46-230f-4c29-be9e-6e914e8ea452
► To get a clear picture of the earth crust the Helmholtz equation needs to be solved and a high wave number is needed in order…
(more)
▼ To get a clear picture of the earth crust the Helmholtz equation needs to be solved and a high wave number is needed in order to provide fine grain details. The Stabilised BiConjugate Gradient method needs to be implemented to solve the Helmholtz equation. This is done on a Maxeler
data flow machine to improve calculation times. The algorithm is split into 3 parts and all of them use the same calculation kernel. An improvement in calculation time of 2.4 times faster than in the literature is achieved and a two times faster calculation is expected with more modern hardware. Maxeler’s
data flow machine shows great possibilities to decrease calculation times for high performance computing problems.
Advisors/Committee Members: Vuik, Kees (mentor), Gaydadjiev, Georgi (graduation committee), Delft University of Technology (degree granting institution).
Subjects/Keywords: Maxeler; Data Flow; Helmholtz equation; BiCGSTAB
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Meijers, O. (. (2017). Implementation of the BiCGSTAB method for the Helmholtz Equation on a Maxeler Data Flow Machine. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:adc4ad46-230f-4c29-be9e-6e914e8ea452
Chicago Manual of Style (16th Edition):
Meijers, Onno (author). “Implementation of the BiCGSTAB method for the Helmholtz Equation on a Maxeler Data Flow Machine.” 2017. Masters Thesis, Delft University of Technology. Accessed March 02, 2021.
http://resolver.tudelft.nl/uuid:adc4ad46-230f-4c29-be9e-6e914e8ea452.
MLA Handbook (7th Edition):
Meijers, Onno (author). “Implementation of the BiCGSTAB method for the Helmholtz Equation on a Maxeler Data Flow Machine.” 2017. Web. 02 Mar 2021.
Vancouver:
Meijers O(. Implementation of the BiCGSTAB method for the Helmholtz Equation on a Maxeler Data Flow Machine. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2021 Mar 02].
Available from: http://resolver.tudelft.nl/uuid:adc4ad46-230f-4c29-be9e-6e914e8ea452.
Council of Science Editors:
Meijers O(. Implementation of the BiCGSTAB method for the Helmholtz Equation on a Maxeler Data Flow Machine. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:adc4ad46-230f-4c29-be9e-6e914e8ea452
Rutgers University
9.
Jin, Tong, 1986-.
Autonomic data management for extreme scale coupled scientific workflows.
Degree: PhD, Electrical and Computer Engineering, 2016, Rutgers University
URL: https://rucore.libraries.rutgers.edu/rutgers-lib/49242/
► Advanced coupled scientific simulation workflows running at extreme scales are providing new capabilities and new opportunities for high fidelity modeling and insights in a wide…
(more)
▼ Advanced coupled scientific simulation workflows running at extreme scales are providing new capabilities and new opportunities for high fidelity modeling and insights in a wide range of application areas. These workflows compose multiple physical models along with visualization and analysis services that share and exchange large amounts of
data at runtime. Due to the huge I/O overhead, traditional file-based coupling approaches become infeasible. Instead, recent simulation-time
data management approaches using in-memory
data-staging methods have been explored to address this challenge. However, due to the complexities of emerging coupled applications and the architecture of current and future systems, these
data staging based solutions are also presenting several new challenges. First, many of these scientific workflows containing dynamically adaptive formulations, such as Adaptive Mesh Refinement (AMR), which exhibit dynamic runtime behaviors and result in dynamically changing
data volumes and imbalanced
data distributions. Such dynamic runtime behaviors increase the complexity of managing and processing simulation
data. In addition, these behaviors introduce new challenges of managing the staging resources as well as scheduling in-memory
data processing while satisfying constraints on (1) the amount of
data movement, (2) the overhead on the simulation, and/or (3) the quality of the simulations/analysis. Second, architectural trends indicate that emerging systems will have increasing numbers of cores per node and correspondingly decreasing amounts of DRAM memory per core as well as decreasing memory bandwidth. These trends can significantly impact the effectiveness of the online
data management approaches for runtime
data processing pipelines, and especially their ability to support
data intensive simulation workflows. To address the above dynamic
data management challenges, this thesis explores an autonomic approach to enable efficient runtime
data management, which can dynamically respond to the varying
data management requirements. Specifically, it first formulates an abstraction that can be used to realize autonomic
data management runtimes for coupled simulation workflows. To address the dynamic
data management challenges in tightly coupled simulation workflows containing dynamically adaptive formulations, this thesis then presents a realization of this autonomic approach that uses runtime cross-layer adaptations. This realization explores autonomic runtime adaptations at application layer, middleware layer, and resource layer. It also exploits a coordinated approach that dynamically combines these adaptations in a cross-layer manner. This thesis also presents an autonomic multi-tiered
data management runtime that leverages both DRAM and SSD to support autonomic
data management for loosely coupled scientific workflows. It demonstrates how an autonomic
data placement mechanism can dynamically manage and optimize
data placement across the DRAM and SSD storage levels in this multi-tiered runtime…
Advisors/Committee Members: Parashar, Manish (chair), Rodero, Ivan (internal member), Silver, Deborah (internal member), Yu, Hongfeng (outside member).
Subjects/Keywords: High performance computing; Electronic data processing; Data flow computing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Jin, Tong, 1. (2016). Autonomic data management for extreme scale coupled scientific workflows. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/49242/
Chicago Manual of Style (16th Edition):
Jin, Tong, 1986-. “Autonomic data management for extreme scale coupled scientific workflows.” 2016. Doctoral Dissertation, Rutgers University. Accessed March 02, 2021.
https://rucore.libraries.rutgers.edu/rutgers-lib/49242/.
MLA Handbook (7th Edition):
Jin, Tong, 1986-. “Autonomic data management for extreme scale coupled scientific workflows.” 2016. Web. 02 Mar 2021.
Vancouver:
Jin, Tong 1. Autonomic data management for extreme scale coupled scientific workflows. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2021 Mar 02].
Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/49242/.
Council of Science Editors:
Jin, Tong 1. Autonomic data management for extreme scale coupled scientific workflows. [Doctoral Dissertation]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/49242/
10.
Dhakal, Gaurav.
Cross System Data flow in b2b System Integration: A case study: customer to Nokia Siemens Networks Purchase Order Data Flow.
Degree: 2012, HAAGA-HELIA ammattikorkeakoulu
URL: http://www.theseus.fi/handle/10024/40059
► It is attempted in this thesis to shed light on the industry wide practice of b2b System Integration and the various issues arising out of…
(more)
▼ It is attempted in this thesis to shed light on the industry wide practice of b2b System Integration and the various issues arising out of it. There are many varieties of ERP system available in the market, and each company has chosen the system that they use, and the customization of the system based of meticulous study of their system re-quirements and feasibility.
This thesis is a product development theses with a cross system
data map of a Pur-chase Order arriving at the case company, Nokia Siemens Networks, document as a product, preceded by the discussion on of cross-system b2b
data flow.
In a scenario, where two companies having different ERP systems have trade or busi-ness transactions between them, the issue of system integration arises.
In the first part of this thesis, the concept of system integration is discussed to give an overview of what it is, why is it needed and the processes and steps involved.
The second part of the theses is a product development / case study part. Nokia Sie-mens Network is a leading network equipment manufacturer in global scale. It has business transactions with business enterprises that use various ranges of different ERP systems with different set-ups and customizations. So it is essential for case com-pany to understand and intercept the customer ERP system messages arriving to its system as (such as purchase order) according to their own ERP point of view.
It is quite common that there are different
data fields in two different organizational ERPs that hold exactly same
data. So there is a need of a mapping document, which links
data fields in customer ERP and case company ERP containing the same
data
Advisors/Committee Members: HAAGA-HELIA ammattikorkeakoulu.
Subjects/Keywords: ERP systems; system integration; data flow; cross system data flow; b2b; data mapping; mapping documentation; Rosettanet
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Dhakal, G. (2012). Cross System Data flow in b2b System Integration: A case study: customer to Nokia Siemens Networks Purchase Order Data Flow. (Thesis). HAAGA-HELIA ammattikorkeakoulu. Retrieved from http://www.theseus.fi/handle/10024/40059
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Dhakal, Gaurav. “Cross System Data flow in b2b System Integration: A case study: customer to Nokia Siemens Networks Purchase Order Data Flow.” 2012. Thesis, HAAGA-HELIA ammattikorkeakoulu. Accessed March 02, 2021.
http://www.theseus.fi/handle/10024/40059.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Dhakal, Gaurav. “Cross System Data flow in b2b System Integration: A case study: customer to Nokia Siemens Networks Purchase Order Data Flow.” 2012. Web. 02 Mar 2021.
Vancouver:
Dhakal G. Cross System Data flow in b2b System Integration: A case study: customer to Nokia Siemens Networks Purchase Order Data Flow. [Internet] [Thesis]. HAAGA-HELIA ammattikorkeakoulu; 2012. [cited 2021 Mar 02].
Available from: http://www.theseus.fi/handle/10024/40059.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Dhakal G. Cross System Data flow in b2b System Integration: A case study: customer to Nokia Siemens Networks Purchase Order Data Flow. [Thesis]. HAAGA-HELIA ammattikorkeakoulu; 2012. Available from: http://www.theseus.fi/handle/10024/40059
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
11.
Ding, Ye.
AVATAR : a system for the analysis of vast amount of trajectories and roads.
Degree: 2014, Hong Kong University of Science and Technology
URL: http://repository.ust.hk/ir/Record/1783.1-70930
;
https://doi.org/10.14711/thesis-b1333666
;
http://repository.ust.hk/ir/bitstream/1783.1-70930/1/th_redirect.html
► The value of large amount of trajectory data has received wide attention in many applications including human behavior analysis, urban transportation planning, and various location-based…
(more)
▼ The value of large amount of trajectory data has received wide attention in many applications including human behavior analysis, urban transportation planning, and various location-based services (LBS). Nowadays, both scientific and industrial communities are encouraged to collect as much trajectory data as possible, which brings many opportunities and problems, including: 1) the raw data collected by the GPS device requires reorganization and preprocessing to enable further analysis; 2) it is expensive and challenging to store and process such big trajectory data efficiently; and 3) by leveraging effective spatial-temporal queries from the trajectory data, it enables us to discover various knowledge that are difficult to identify intuitively. In this thesis, we propose a complete system from the preprocessing of raw trajectory data, to the storage and query processing of the trajectories, and finally the discovery of the hidden knowledge from such data. For each component of the system, we study and solve a specific problem regarding to the component, as: 1) inferring the road type in crowdsourced map services; 2) exploring the use of diverse replicas for big location tracking data; and 3) recommending trajectories for effective and efficient hunting of taxi passengers. For the road type inference problem, we propose a combined model based on stacked generalization to infer the types of road segments, and conduct eight experiments based on different classifiers to show that our method is much better than the baseline methods. For the use of diverse replicas for big trajectory data, we propose BLOT, a system abstraction which tries to find the optimal set of diverse replicas that suitable for the costs of a set of trajectory queries. Based on our greedy strategy, the experiments show that our solution is effective and efficient. For the taxi hunting route recommendation problem, we introduce the HUNTS system based on the estimations of the benefits of road segments, and make reasonable hunting trajectory recommendations for taxi drivers to make more money. Due to the low-density, sparsity, and uncertainty of trajectories, handling such data may face many challenges. In this thesis, we will discuss the important challenges and research issues of each aspect, and compare the differences between our methods and the state-of-the-art.
Subjects/Keywords: Location-based services
; Traffic flow
; Data processing
; Data mining
; Electronic data processing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ding, Y. (2014). AVATAR : a system for the analysis of vast amount of trajectories and roads. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-70930 ; https://doi.org/10.14711/thesis-b1333666 ; http://repository.ust.hk/ir/bitstream/1783.1-70930/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 (16th Edition):
Ding, Ye. “AVATAR : a system for the analysis of vast amount of trajectories and roads.” 2014. Thesis, Hong Kong University of Science and Technology. Accessed March 02, 2021.
http://repository.ust.hk/ir/Record/1783.1-70930 ; https://doi.org/10.14711/thesis-b1333666 ; http://repository.ust.hk/ir/bitstream/1783.1-70930/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 (7th Edition):
Ding, Ye. “AVATAR : a system for the analysis of vast amount of trajectories and roads.” 2014. Web. 02 Mar 2021.
Vancouver:
Ding Y. AVATAR : a system for the analysis of vast amount of trajectories and roads. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2014. [cited 2021 Mar 02].
Available from: http://repository.ust.hk/ir/Record/1783.1-70930 ; https://doi.org/10.14711/thesis-b1333666 ; http://repository.ust.hk/ir/bitstream/1783.1-70930/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:
Ding Y. AVATAR : a system for the analysis of vast amount of trajectories and roads. [Thesis]. Hong Kong University of Science and Technology; 2014. Available from: http://repository.ust.hk/ir/Record/1783.1-70930 ; https://doi.org/10.14711/thesis-b1333666 ; http://repository.ust.hk/ir/bitstream/1783.1-70930/1/th_redirect.html
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
The Ohio State University
12.
Chaudhuri, Abon.
Geometric and Statistical Summaries for Big Data
Visualization.
Degree: PhD, Computer Science and Engineering, 2013, The Ohio State University
URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1382235351
► In recent times, the visualization and data analysis paradigm is adapting fast to keep up with the rapid growth in computing power and data size.…
(more)
▼ In recent times, the visualization and
data analysis
paradigm is adapting fast to keep up with the rapid growth in
computing power and
data size. Modern scientific simulations run at
massive scale to produce huge datasets, which must be analyzed and
visualized by the domain experts to continue innovation. In the
presence of large-scale
data, it is important to identify and
extract the informative regions at an early stage so that the
following analysis algorithms, which are usually memory and
compute-intensive, can focus only on those regions. Transforming
the raw
data to a compact yet meaningful representation also helps
to maintain the interactivity of the query and visualization of
analysis results. In this dissertation, we propose a novel and
general-purpose framework suitable for exploring large-scale
data.
We propose to use importance-based
data summaries, which can
substitute for the raw
data to answer queries and drive visual
exploration. Since the definition of importance is dependent on the
nature of the
data and the task at hand, we propose to use suitable
statistical and geometric measures or combination of various
measures to quantify importance and perform
data reduction on
scalar and vector field
data. Our research demonstrates two
instances of the proposed framework.The first instance applies to
large number of streamlines computed from vector fields. We make
the visual exploration of such
data much easier compared to
navigating through a cluttered 3D visualization of the raw
data. In
this case, we introduce a fractal dimension based metric called box
counting ratio, which quantifies the geometric complexity of
streamlines (or parts of streamlines) by their space-filling
capacity. We utilize this metric to extract, organize and visualize
streamlines of varying density and complexity hidden in large
number of streamlines. The extracted complex regions from the
streamlines represent the
data summaries in this case. We organize
and present them on an interactive 2D information space, which
allows user selection and visualization of streamlines in the
original spatial domain. We also extend this framework to support
exploration using an ensemble of measures including the box
counting ratio. We strengthen our claims with elaborate case
studies using combustion and climate simulation datasets.We also
use our framework to speed up query-driven exploration of volume
data. Our approach speeds up range query response by using
distribution-based
data summaries as opposed to repeatedly scanning
sub-domains of the raw
data. Our work is mainly concerned with the
range distribution query, which returns the distribution of an
axis-aligned query region. Since the response time of such queries
scales up with the
data and the query size, maintaining
interactivity is a challenging task. Our research offers the
ability to answer distribution query for any arbitrary region in
constant time, regardless of
data and query size. We adapt an
integral image based
data structure to reduce the computation, I/O
and communication…
Advisors/Committee Members: Shen, Han-Wei (Advisor).
Subjects/Keywords: Computer Science; big data visualization; scientific visualization; flow visualization; data management; data analysis
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chaudhuri, A. (2013). Geometric and Statistical Summaries for Big Data
Visualization. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1382235351
Chicago Manual of Style (16th Edition):
Chaudhuri, Abon. “Geometric and Statistical Summaries for Big Data
Visualization.” 2013. Doctoral Dissertation, The Ohio State University. Accessed March 02, 2021.
http://rave.ohiolink.edu/etdc/view?acc_num=osu1382235351.
MLA Handbook (7th Edition):
Chaudhuri, Abon. “Geometric and Statistical Summaries for Big Data
Visualization.” 2013. Web. 02 Mar 2021.
Vancouver:
Chaudhuri A. Geometric and Statistical Summaries for Big Data
Visualization. [Internet] [Doctoral dissertation]. The Ohio State University; 2013. [cited 2021 Mar 02].
Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1382235351.
Council of Science Editors:
Chaudhuri A. Geometric and Statistical Summaries for Big Data
Visualization. [Doctoral Dissertation]. The Ohio State University; 2013. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1382235351
Rochester Institute of Technology
13.
Wright, Raymond.
Computer Application of Historical Data.
Degree: 1971, Rochester Institute of Technology
URL: https://scholarworks.rit.edu/theses/4384
Subjects/Keywords: Data analysis; Data collection; Data flow; Data retrieval
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wright, R. (1971). Computer Application of Historical Data. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/4384
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Wright, Raymond. “Computer Application of Historical Data.” 1971. Thesis, Rochester Institute of Technology. Accessed March 02, 2021.
https://scholarworks.rit.edu/theses/4384.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Wright, Raymond. “Computer Application of Historical Data.” 1971. Web. 02 Mar 2021.
Vancouver:
Wright R. Computer Application of Historical Data. [Internet] [Thesis]. Rochester Institute of Technology; 1971. [cited 2021 Mar 02].
Available from: https://scholarworks.rit.edu/theses/4384.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Wright R. Computer Application of Historical Data. [Thesis]. Rochester Institute of Technology; 1971. Available from: https://scholarworks.rit.edu/theses/4384
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Linnaeus University
14.
Magnusson, Erik.
An Investigation of Data Flow Patterns Impact on Maintainability When Implementing Additional Functionality.
Degree: Computer Science, 2016, Linnaeus University
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-57024
► JavaScript is breaking ground with the wave of new client-side frameworks. However, there are some key differences between some of them. One major distinction…
(more)
▼ JavaScript is breaking ground with the wave of new client-side frameworks. However, there are some key differences between some of them. One major distinction is the data flow pattern they applying. As of now, there are two predominant patterns used on client side frameworks, the Two-way data flow pattern and the Unidirectional data flow pattern. In this research, an empirical experiment was conducted to test the data flow patterns impact on maintainability. The scope of maintainability of this research is defined by a set of metrics: Amount of lines code, an amount of files and amount of dependencies. By analyzing the results, a conclusion could not be made to prove that the data flow patterns does affect maintainability, using this research method.
Subjects/Keywords: JavaScript; Framework; Client side; Unidirectional data flow; Two-way data flow; Data Flow Pattern; React; Flux; Angular 2; Ember; Vue; Engineering and Technology; Teknik och teknologier
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Magnusson, E. (2016). An Investigation of Data Flow Patterns Impact on Maintainability When Implementing Additional Functionality. (Thesis). Linnaeus University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-57024
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Magnusson, Erik. “An Investigation of Data Flow Patterns Impact on Maintainability When Implementing Additional Functionality.” 2016. Thesis, Linnaeus University. Accessed March 02, 2021.
http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-57024.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Magnusson, Erik. “An Investigation of Data Flow Patterns Impact on Maintainability When Implementing Additional Functionality.” 2016. Web. 02 Mar 2021.
Vancouver:
Magnusson E. An Investigation of Data Flow Patterns Impact on Maintainability When Implementing Additional Functionality. [Internet] [Thesis]. Linnaeus University; 2016. [cited 2021 Mar 02].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-57024.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Magnusson E. An Investigation of Data Flow Patterns Impact on Maintainability When Implementing Additional Functionality. [Thesis]. Linnaeus University; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-57024
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Johannesburg
15.
Yumlu, Cennet.
Calibration of the SIDRA capacity analysis package for South African traffic conditions.
Degree: 2014, University of Johannesburg
URL: http://hdl.handle.net/10210/10244
► M.Phil. (Civil Engineering)
The SIDRA (Signalised Intersection Design and Research Aid) is calibrated for South African traffic conditions. Traditionally, South African traffic engineers made use…
(more)
▼ M.Phil. (Civil Engineering)
The SIDRA (Signalised Intersection Design and Research Aid) is calibrated for South African traffic conditions. Traditionally, South African traffic engineers made use of American or Australian based information to analyze traffic operations at signalised intersections. Two major models used in South Africa are HCM (Highway Capacity Manual) by the Transportation Research Board in the USA and SIDRA by the Australian Road Research Board. SIDRA is gaining popularity in South Africa because of the practical problems of the mirror image, which has to be maintained in using the HCM method due to the right side driving in the USA and other possible differences on driver behavior, vehicle attributes, geometric design and traffic control. SIDRA seems to be more suitable for South African conditions. Recently the use of SIDRA in this country has been increased to 44 organizations. This study aims to prepare a unified default file for South African users. Due to the large number of model parameters in SIDRA, priority is given to important ones for which information is readily available. And this study is confined to signalised intersections rather than all intersection types.
Subjects/Keywords: Traffic engineering - South Africa; Traffic flow - South Africa; Traffic flow - Data processing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Yumlu, C. (2014). Calibration of the SIDRA capacity analysis package for South African traffic conditions. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/10244
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Yumlu, Cennet. “Calibration of the SIDRA capacity analysis package for South African traffic conditions.” 2014. Thesis, University of Johannesburg. Accessed March 02, 2021.
http://hdl.handle.net/10210/10244.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Yumlu, Cennet. “Calibration of the SIDRA capacity analysis package for South African traffic conditions.” 2014. Web. 02 Mar 2021.
Vancouver:
Yumlu C. Calibration of the SIDRA capacity analysis package for South African traffic conditions. [Internet] [Thesis]. University of Johannesburg; 2014. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/10210/10244.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Yumlu C. Calibration of the SIDRA capacity analysis package for South African traffic conditions. [Thesis]. University of Johannesburg; 2014. Available from: http://hdl.handle.net/10210/10244
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Virginia Tech
16.
Sehery, Wile Ali.
OneSwitch Data Center Architecture.
Degree: PhD, Computer Engineering, 2018, Virginia Tech
URL: http://hdl.handle.net/10919/94376
► In the last two-decades data center networks have evolved to become a key element in improving levels of productivity and competitiveness for different types of…
(more)
▼ In the last two-decades
data center networks have evolved to become a key element in improving levels of productivity and competitiveness for different types of organizations. Traditionally
data center networks have been constructed with 3 layers of switches, Edge, Aggregation, and Core. Although this Three-Tier architecture has worked well in the past, it poses a number of challenges for current and future
data centers.
Data centers today have evolved to support dynamic resources such as virtual machines and storage volumes from any physical location within the
data center. This has led to highly volatile and unpredictable traffic patterns. Also The emergence of "Big
Data" applications that exchange large volumes of information have created large persistent flows that need to coexist with other traffic flows. The Three-Tier architecture and current routing schemes are no longer sufficient for achieving high bandwidth utilization.
Data center networks should be built in a way where they can adequately support virtualization and cloud computing technologies.
Data center networks should provide services such as, simplified provisioning, workload mobility, dynamic routing and load balancing, equidistant bandwidth and latency. As
data center networks have evolved the Three-Tier architecture has proven to be a challenge not only in terms of complexity and cost, but it also falls short of supporting many new
data center applications.
In this work we propose OneSwitch: A switch architecture for the
data center. OneSwitch is backward compatible with current Ethernet standards and uses an OpenFlow central controller, a Location Database, a DHCP Server, and a Routing Service to build an Ethernet fabric that appears as one switch to end devices. This allows the
data center to use switches in scale-out topologies to support hosts in a plug and play manner as well as provide much needed services such as dynamic load balancing, intelligent routing, seamless mobility, equidistant bandwidth and latency.
Advisors/Committee Members: Clancy, Thomas Charles (committeechair), Mili, Lamine M. (committee member), Chantem, Thidapat (committee member), Gerdes, Ryan M. (committee member), Chen, Ing Ray (committee member).
Subjects/Keywords: Data Center; SDN; OpenFlow; Flow Optimization; Clos; Supermarket; Flow-Commodity; Load Balancing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sehery, W. A. (2018). OneSwitch Data Center Architecture. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/94376
Chicago Manual of Style (16th Edition):
Sehery, Wile Ali. “OneSwitch Data Center Architecture.” 2018. Doctoral Dissertation, Virginia Tech. Accessed March 02, 2021.
http://hdl.handle.net/10919/94376.
MLA Handbook (7th Edition):
Sehery, Wile Ali. “OneSwitch Data Center Architecture.” 2018. Web. 02 Mar 2021.
Vancouver:
Sehery WA. OneSwitch Data Center Architecture. [Internet] [Doctoral dissertation]. Virginia Tech; 2018. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/10919/94376.
Council of Science Editors:
Sehery WA. OneSwitch Data Center Architecture. [Doctoral Dissertation]. Virginia Tech; 2018. Available from: http://hdl.handle.net/10919/94376
Delft University of Technology
17.
Terleth, Niels (author).
Artificial Neural Networks for Flow Field Inference: A machine learning approach.
Degree: 2019, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:d69a58c4-91ea-4590-9153-c6fa35f374e5
► Due to their powerful approximation capabilities, artificial neural networks have seen a wide interest in various fields. A particular application is the use of an…
(more)
▼ Due to their powerful approximation capabilities, artificial neural networks have seen a wide interest in various fields. A particular application is the use of an artificial neural network to predict solutions of the governing equations for fluid flow i.e. the Navier-Stokes equations. This is done by taking the space and time variables as the inputs and the flow field variables (velocity and pressure) as outputs. Subsequently, the artificial neural network can be trained by using velocity field data on discrete points in a domain. This training is carried out by means of a scalar loss function, which is minimized by the backpropagation algorithm. By taking the gradients of the outputs with respect to the inputs, the Navier-Stokes can be formed and included in the same loss function. By including discrete velocity field data as well as the Navier-Stokes equations physics into the loss function, the trained artificial neural network could leverage its approximation capabilities to approximate the complex solutions of the flow variables. Only data on the velocity field is provided, such that the framework could be used to infer the pressure field, for which no data is given. In order to apply this approach to incompressible flows, the predicted velocity fields are strictly required to be divergence-free. To accomplish this, a divergence-free potential basis was proposed. This Data Physics Fluid Informed Neural Networks (DPFINN) framework was tested on several incompressible fluid flow test cases, for which analytical solutions were available. This work provides an extensive analysis for these test cases. The results of the test cases showed that the balance between the data and the physics loss function proved to be a delicate one, which depended on a number of different choices for the artificial neural network architectures, data and physics informing process as well as the training process. Overall, the flow fields were able to be inferred well, however simultaneous implementation of the data and the physics proved to be difficult. More complex artificial neural networks were shown to not always improve the performance. Thus, the framework results were showed to be largely dependent on the balance between the expressibility and the trainability of the framework.
Aerospace Engineering
Advisors/Committee Members: Dwight, Richard (mentor), Delft University of Technology (degree granting institution).
Subjects/Keywords: artificial neural networks; machine learning; Fluid flow; flow field inference; data assimilation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Terleth, N. (. (2019). Artificial Neural Networks for Flow Field Inference: A machine learning approach. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:d69a58c4-91ea-4590-9153-c6fa35f374e5
Chicago Manual of Style (16th Edition):
Terleth, Niels (author). “Artificial Neural Networks for Flow Field Inference: A machine learning approach.” 2019. Masters Thesis, Delft University of Technology. Accessed March 02, 2021.
http://resolver.tudelft.nl/uuid:d69a58c4-91ea-4590-9153-c6fa35f374e5.
MLA Handbook (7th Edition):
Terleth, Niels (author). “Artificial Neural Networks for Flow Field Inference: A machine learning approach.” 2019. Web. 02 Mar 2021.
Vancouver:
Terleth N(. Artificial Neural Networks for Flow Field Inference: A machine learning approach. [Internet] [Masters thesis]. Delft University of Technology; 2019. [cited 2021 Mar 02].
Available from: http://resolver.tudelft.nl/uuid:d69a58c4-91ea-4590-9153-c6fa35f374e5.
Council of Science Editors:
Terleth N(. Artificial Neural Networks for Flow Field Inference: A machine learning approach. [Masters Thesis]. Delft University of Technology; 2019. Available from: http://resolver.tudelft.nl/uuid:d69a58c4-91ea-4590-9153-c6fa35f374e5
University of Manchester
18.
Safie, Lily Suryani Binti.
A software component model that is both control-driven and data-driven.
Degree: PhD, 2012, University of Manchester
URL: https://www.research.manchester.ac.uk/portal/en/theses/a-software-component-model-that-is-both-controldriven-and-datadriven(ce21c34b-7257-4b8f-aa79-f6456b49a3a0).html
;
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553551
► A software component model is the cornerstone of any Component-based Software Development (CBSD) methodology. Such a model defines the modelling elements for constructing software systems.…
(more)
▼ A software component model is the cornerstone of any Component-based Software Development (CBSD) methodology. Such a model defines the modelling elements for constructing software systems. In software system modelling, it is necessary to capture the three elements of a system's behaviour: (i) control (ii) computation and (iii) data. Within a system, computations are performed according to the flow of control or the flow of data, depending on whether computations are control-driven or data-driven. Computations are function evaluations, assignments, etc., which transform data when invoked by control or data flow. Therefore a component model should be able to model control flow, data flow as well as computations. Current component models all model computations, but beside computations tend to model either control flow only or data flow only, but not both. In this thesis, we present a new component model which can model both control flow and data flow. It contains modelling elements that capture control flow and data flow explicitly. Furthermore, the modelling of control flow is separate from that of data flow; this enables the modelling of both control-driven and data-driven computations. The feasibility of the model is shown by means of an implementation of the model, in the form of a prototype tool. The usefulness of the model is then demonstrated for a specific domain, the embedded systems domain, as well as a generic domain. For the embedded systems domain, unlike current models, our model can be used to construct systems that are both control-driven and data-driven. In a generic domain, our model can be used to construct domain models, by constructing control flows and data flows which together define a domain model.
Subjects/Keywords: 005.1; software component model; data-driven; control-driven; data flow; control flow; component-based software development
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Safie, L. S. B. (2012). A software component model that is both control-driven and data-driven. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/a-software-component-model-that-is-both-controldriven-and-datadriven(ce21c34b-7257-4b8f-aa79-f6456b49a3a0).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553551
Chicago Manual of Style (16th Edition):
Safie, Lily Suryani Binti. “A software component model that is both control-driven and data-driven.” 2012. Doctoral Dissertation, University of Manchester. Accessed March 02, 2021.
https://www.research.manchester.ac.uk/portal/en/theses/a-software-component-model-that-is-both-controldriven-and-datadriven(ce21c34b-7257-4b8f-aa79-f6456b49a3a0).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553551.
MLA Handbook (7th Edition):
Safie, Lily Suryani Binti. “A software component model that is both control-driven and data-driven.” 2012. Web. 02 Mar 2021.
Vancouver:
Safie LSB. A software component model that is both control-driven and data-driven. [Internet] [Doctoral dissertation]. University of Manchester; 2012. [cited 2021 Mar 02].
Available from: https://www.research.manchester.ac.uk/portal/en/theses/a-software-component-model-that-is-both-controldriven-and-datadriven(ce21c34b-7257-4b8f-aa79-f6456b49a3a0).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553551.
Council of Science Editors:
Safie LSB. A software component model that is both control-driven and data-driven. [Doctoral Dissertation]. University of Manchester; 2012. Available from: https://www.research.manchester.ac.uk/portal/en/theses/a-software-component-model-that-is-both-controldriven-and-datadriven(ce21c34b-7257-4b8f-aa79-f6456b49a3a0).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.553551
University of California – Berkeley
19.
Mohan, Prashanth.
Protecting User Privacy in Remotely Managed Applications.
Degree: Computer Science, 2013, University of California – Berkeley
URL: http://www.escholarship.org/uc/item/29d9g8m5
► This thesis presents an end-to-end system architecture for online services to provide it's users with a ”privacy guarantee”. The privacy guarantee as described in this…
(more)
▼ This thesis presents an end-to-end system architecture for online services to provide it's users with a ”privacy guarantee”. The privacy guarantee as described in this thesis relates to the technological enforcement of the user's privacy policies by these online applications that are otherwise untrusted by the user.Applications on the Internet are complex in that they integrate different types of functionalities into a consistent interface for the user. This thesis categorizes these functionalities into three generic components – a learning module that operates on the data from multiple users to gather higher level trends and aggregates, a data storage and transformation module that provides the core functionality of data presentation and finally a client-side component that interacts with the cloud-side functionalities and is responsible for sourcing input from the user and presenting them on the user's device in a secure fashion.This thesis looks at the privacy risks introduced by each of these components and describes a ”trusted system” that can be used by these online services to prove that the user specified privacy policies are enforced. The system consists of multiple independently developed solutions – Gupt, Rubicon, Bubbles and MobAds. These solutions work at tandem with each other to provide an end-to-end privacy perspective.While privacy policies and EULAs have largely been enforced in the realm of legal proceedings, this prototype implementation of an end-to-end privacy enforcement architecture demonstrates that it is both feasible and practical to enforce user privacy policies within the system.
Subjects/Keywords: Computer science; Computer Security; Data Privacy; Data Security; Differential Privacy; Information Flow Control; Online Services
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Mohan, P. (2013). Protecting User Privacy in Remotely Managed Applications. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/29d9g8m5
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Mohan, Prashanth. “Protecting User Privacy in Remotely Managed Applications.” 2013. Thesis, University of California – Berkeley. Accessed March 02, 2021.
http://www.escholarship.org/uc/item/29d9g8m5.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Mohan, Prashanth. “Protecting User Privacy in Remotely Managed Applications.” 2013. Web. 02 Mar 2021.
Vancouver:
Mohan P. Protecting User Privacy in Remotely Managed Applications. [Internet] [Thesis]. University of California – Berkeley; 2013. [cited 2021 Mar 02].
Available from: http://www.escholarship.org/uc/item/29d9g8m5.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Mohan P. Protecting User Privacy in Remotely Managed Applications. [Thesis]. University of California – Berkeley; 2013. Available from: http://www.escholarship.org/uc/item/29d9g8m5
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Colorado School of Mines
20.
Ausmus, Jason R.
Data-driven approach to calculating nodal net load forecasts in power systems analysis, A.
Degree: PhD, Electrical Engineering, 2020, Colorado School of Mines
URL: http://hdl.handle.net/11124/174168
► The electric power grid is one of the largest and most complex systems ever built for the benefits of humanity. Most of the modern world…
(more)
▼ The electric power grid is one of the largest and most complex systems ever built for the benefits of humanity. Most of the modern world relies heavily upon this system, and its unavailability may result in severe economic, safety, and security issues. Ensuring the electric power grid maintains an adequate level of reliability is a challenging task that usually begins well in advance of real-time system operations. This task of ensuring grid reliability typically begins in system operations with the Operational Planning Analysis (OPA). TheOPA is a study required by the North American Electric Corporation (NERC) Reliability Standards. The goal of that study is to assess whether planned operations for the next day will exceed any operating limits or present any potential reliability threats to the system. The next day is also the same time frame in which the electricity markets begin to procure resources needed to meet the following day's demand or forecasted load. The foundation for these studies is the load forecast. The accuracy of it can determine the next day's system requirements, e.g., generation and system outages. The problem is that the load forecast is typically done at the system level, and for power system engineers, the accuracy of the
data is needed at the most granular level, the load bus. A bus or node level forecast does not exist in the industry today, and this research aims to develop a method based on the historical
data accumulated by the utility companies. This research also describes the concept of net load, which is the resultant value of load and resources real-time system operators monitor at the transmission system level. This dissertation discusses the current practice of the utilization of load forecast
data in the electric utility industry. It proposes a new
data-driven framework based on machine learning to predict net loads at the node or bus level.
Advisors/Committee Members: Sen, Pankaj K. (advisor), Zhang, Yingchen (advisor), Wang, Hua (committee member), Simões, M. Godoy (committee member), Ammerman, Ravel F. (committee member), Krishnan, Venkat (committee member).
Subjects/Keywords: data-driven; machine learning; power-flow; electric utility; big data analytics; power systems
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ausmus, J. R. (2020). Data-driven approach to calculating nodal net load forecasts in power systems analysis, A. (Doctoral Dissertation). Colorado School of Mines. Retrieved from http://hdl.handle.net/11124/174168
Chicago Manual of Style (16th Edition):
Ausmus, Jason R. “Data-driven approach to calculating nodal net load forecasts in power systems analysis, A.” 2020. Doctoral Dissertation, Colorado School of Mines. Accessed March 02, 2021.
http://hdl.handle.net/11124/174168.
MLA Handbook (7th Edition):
Ausmus, Jason R. “Data-driven approach to calculating nodal net load forecasts in power systems analysis, A.” 2020. Web. 02 Mar 2021.
Vancouver:
Ausmus JR. Data-driven approach to calculating nodal net load forecasts in power systems analysis, A. [Internet] [Doctoral dissertation]. Colorado School of Mines; 2020. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/11124/174168.
Council of Science Editors:
Ausmus JR. Data-driven approach to calculating nodal net load forecasts in power systems analysis, A. [Doctoral Dissertation]. Colorado School of Mines; 2020. Available from: http://hdl.handle.net/11124/174168
Rochester Institute of Technology
21.
Soldavini, Stephanie.
Using Reduced Graphs for Efficient HLS Scheduling.
Degree: MS, Computer Engineering, 2019, Rochester Institute of Technology
URL: https://scholarworks.rit.edu/theses/10311
► High-Level Synthesis (HLS) is the process of inferring a digital circuit from a high-level algorithmic description provided as a software implementation, usually in C/C++.…
(more)
▼ High-Level Synthesis (HLS) is the process of inferring a digital circuit from a high-level algorithmic description provided as a software implementation, usually in C/C++. HLS tools will parse the input code and then perform three main steps: allocation, scheduling, and binding. This results in a hardware architecture which can then be represented as a Register-Transfer Level (RTL) model using a Hardware Description Language (HDL), such as VHDL or Verilog. Allocation determines the amount of resources needed, scheduling finds the order in which operations should occur, and binding maps operations onto the allocated hardware resources. Two main challenges of scheduling are in its computational complexity and memory requirements. Finding an optimal schedule is an NP-hard problem, so many tools use elaborate heuristics to find a solution which satisfies prescribed implementation constraints. These heuristics require the Control/
Data Flow Graph (CDFG), a representation of all operations and their dependencies, which must be stored in its entirety and therefore use large amounts of memory.
This thesis presents a new scheduling approach for use in the HLS tool chain. The new technique schedules operations using an algorithm which operates on a reduced representation of the graph, which does not need to retain individual dependency information in order to generate a schedule. By using the simplified graph, the complexity of scheduling is significantly reduced, resulting in improved memory usage and lower computational effort. This new scheduler is implemented and compared to the existing scheduler in the open source version of the LegUp HLS tool. The results demonstrate that an average of 16 times speedup on the time required to determine the schedule can be achieved, with just a fraction of the memory usage (1/5 on average). All of this is achieved with 0 to 6% of added cost on the final hardware execution time.
Advisors/Committee Members: Marcin Lukowiak.
Subjects/Keywords: High-level synthesis; HLS; Reduced data flow graph; Resource efficient; Scheduling
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Soldavini, S. (2019). Using Reduced Graphs for Efficient HLS Scheduling. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/10311
Chicago Manual of Style (16th Edition):
Soldavini, Stephanie. “Using Reduced Graphs for Efficient HLS Scheduling.” 2019. Masters Thesis, Rochester Institute of Technology. Accessed March 02, 2021.
https://scholarworks.rit.edu/theses/10311.
MLA Handbook (7th Edition):
Soldavini, Stephanie. “Using Reduced Graphs for Efficient HLS Scheduling.” 2019. Web. 02 Mar 2021.
Vancouver:
Soldavini S. Using Reduced Graphs for Efficient HLS Scheduling. [Internet] [Masters thesis]. Rochester Institute of Technology; 2019. [cited 2021 Mar 02].
Available from: https://scholarworks.rit.edu/theses/10311.
Council of Science Editors:
Soldavini S. Using Reduced Graphs for Efficient HLS Scheduling. [Masters Thesis]. Rochester Institute of Technology; 2019. Available from: https://scholarworks.rit.edu/theses/10311
University of Alberta
22.
Jocksch, Adam.
Data mining flow graphs in a dynamic compiler.
Degree: MS, Department of Computing Science, 2009, University of Alberta
URL: https://era.library.ualberta.ca/files/d791sg75w
► This thesis introduces FlowGSP, a general-purpose sequence mining algorithm for flow graphs. FlowGSP ranks sequences according to the frequency with which they occur and according…
(more)
▼ This thesis introduces FlowGSP, a general-purpose
sequence mining algorithm for flow graphs. FlowGSP ranks sequences
according to the frequency with which they occur and according to
their relative cost. This thesis also presents two parallel
implementations of FlowGSP. The first implementation uses JavaTM
threads and is designed for use on workstations equipped with
multi-core CPUs. The second implementation is distributed in nature
and intended for use on clusters. The thesis also presents results
from an application of FlowGSP to mine program profiles in the
context of the development of a dynamic optimizing compiler.
Interpreting patterns within raw profiling data is extremely
difficult and heavily reliant on human intuition. FlowGSP has been
tested on performance-counter profiles collected from the IBM
WebSphere Application Server. This investigation identifies a
number of sequences which are known to be typical of WebSphere
Application Server behavior, as well as some sequences which were
previously unknown.
Subjects/Keywords: Hardware counter; Parallel; Flow graph; Data mining; Compiler
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Jocksch, A. (2009). Data mining flow graphs in a dynamic compiler. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/d791sg75w
Chicago Manual of Style (16th Edition):
Jocksch, Adam. “Data mining flow graphs in a dynamic compiler.” 2009. Masters Thesis, University of Alberta. Accessed March 02, 2021.
https://era.library.ualberta.ca/files/d791sg75w.
MLA Handbook (7th Edition):
Jocksch, Adam. “Data mining flow graphs in a dynamic compiler.” 2009. Web. 02 Mar 2021.
Vancouver:
Jocksch A. Data mining flow graphs in a dynamic compiler. [Internet] [Masters thesis]. University of Alberta; 2009. [cited 2021 Mar 02].
Available from: https://era.library.ualberta.ca/files/d791sg75w.
Council of Science Editors:
Jocksch A. Data mining flow graphs in a dynamic compiler. [Masters Thesis]. University of Alberta; 2009. Available from: https://era.library.ualberta.ca/files/d791sg75w
University of Alberta
23.
Fremont, Donna J.
A methodology for the evaluation of dataflow computer
architectures.
Degree: MS, Department of Computing Science, 1983, University of Alberta
URL: https://era.library.ualberta.ca/files/9306t137b
Subjects/Keywords: Data flow computing.; Computer architecture.
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Fremont, D. J. (1983). A methodology for the evaluation of dataflow computer
architectures. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/9306t137b
Chicago Manual of Style (16th Edition):
Fremont, Donna J. “A methodology for the evaluation of dataflow computer
architectures.” 1983. Masters Thesis, University of Alberta. Accessed March 02, 2021.
https://era.library.ualberta.ca/files/9306t137b.
MLA Handbook (7th Edition):
Fremont, Donna J. “A methodology for the evaluation of dataflow computer
architectures.” 1983. Web. 02 Mar 2021.
Vancouver:
Fremont DJ. A methodology for the evaluation of dataflow computer
architectures. [Internet] [Masters thesis]. University of Alberta; 1983. [cited 2021 Mar 02].
Available from: https://era.library.ualberta.ca/files/9306t137b.
Council of Science Editors:
Fremont DJ. A methodology for the evaluation of dataflow computer
architectures. [Masters Thesis]. University of Alberta; 1983. Available from: https://era.library.ualberta.ca/files/9306t137b
Queensland University of Technology
24.
Al Dahami, Abdulelah.
A stage-based model for enabling decision support in process mining.
Degree: 2017, Queensland University of Technology
URL: https://eprints.qut.edu.au/103533/
► This thesis introduces a decision support system tool that is representing the process tasks of a spaghetti-like model in stages for understanding business process mining…
(more)
▼ This thesis introduces a decision support system tool that is representing the process tasks of a spaghetti-like model in stages for understanding business process mining results. In addition, this representation helps to evaluate the proposed solution and compare it with others. This tool can break the issue of visualising and aligning tasks in process model and clearly show the comprehensive flow relations with more accurate dependencies for decision-makers in terms of the business's perspective.
Subjects/Keywords: Process Mining; Data Mining; Model Discovery; Dependency; Bidirectional Flow
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Al Dahami, A. (2017). A stage-based model for enabling decision support in process mining. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/103533/
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Al Dahami, Abdulelah. “A stage-based model for enabling decision support in process mining.” 2017. Thesis, Queensland University of Technology. Accessed March 02, 2021.
https://eprints.qut.edu.au/103533/.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Al Dahami, Abdulelah. “A stage-based model for enabling decision support in process mining.” 2017. Web. 02 Mar 2021.
Vancouver:
Al Dahami A. A stage-based model for enabling decision support in process mining. [Internet] [Thesis]. Queensland University of Technology; 2017. [cited 2021 Mar 02].
Available from: https://eprints.qut.edu.au/103533/.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Al Dahami A. A stage-based model for enabling decision support in process mining. [Thesis]. Queensland University of Technology; 2017. Available from: https://eprints.qut.edu.au/103533/
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
25.
Huang, Hongtai.
On the Identification of Associations between Flow Cytometry Data, Systemic Sclerosis and Cancer.
Degree: 2015, Johns Hopkins University
URL: http://jhir.library.jhu.edu/handle/1774.2/37905
► This work seeks to develop reliable biomarkers of disease activity, progression and outcomes through the identification of significant associations between high-throughput flow cytometry data and…
(more)
▼ This work seeks to develop reliable biomarkers of disease activity, progression and outcomes through the identification of significant associations between high-throughput
flow cytometry
data and a scleroderma clinical phenotype – initially, interstitial lung disease (ILD) - which is the leading cause of morbidity and mortality in Systemic Sclerosis (SSc). A specific aim of the work involves developing a clinically useful screening tool (hereafter a filter). Such a filter could yield accurate assessments of disease state such as the risk or presence of SSc-ILD, the activity of lung involvement and the possibility to respond to therapeutic intervention. Ultimately this instrument should facilitate a refined stratification of SSc patients into clinically relevant subsets at the time of diagnosis and subsequently during the course of the disease, preventing bad outcomes from disease progression or unnecessary treatment side effects. This role could involve a scenario in
which an SSc patient passes the presumptive (FVCstpp) test for ILD, but the filter indicates that their
flow cytometry (FC) profile is consistent with ILD. In such a case, a physician might: 1) increase frequency of testing to detect early development of ILD; 2) implement more sophisticated diagnostic procedures (e.g., high resolution chest CT scan - HRCT) to confirm the presence of ILD; and 3) consider prophylactic disease modifying treatments. Note that the intention of this research is not to develop screening tools that merely aim at predictive accuracy, but to produce methods that also contribute to the understanding of disease mechanisms. Having used ILD as phenotype, subsequent analyses in this thesis used different phenotypes: antiTopoisomerase (ATA), antiCentromere Anti Nuclear Antibodies (these antibodies are most strongly associated with diffuse and limited systemic sclerosis respectively) and cancer. This research was based on clinical and peripheral blood
flow cytometry
data (Immune Response In Scleroderma, IRIS) from consented patients followed at the Johns Hopkins Scleroderma Center. Methods. The methods utilized in the work involve: (1)
data mining (Conditional Random Forests - CRF) to identify subsets of FC variables that are highly effective in classifying ILD patients; (2) Gene Set Enrichment Analysis (GSEA) to further refine FC subsets; (3) stochastic simulation and Classification and Regression Trees (CART) to design, test and validate ILD filters; and (4) Stepwise Generalized Linear Model (GLM) regression and Drop-in-Deviance testing to identify minimal size, best performing models for predicting ILD status from both FC and selected clinical variables. Results. IRIS
flow cytometry
data provides useful information in assessing the ILD status of SSc patients. Our hybrid analysis approach proved successful in predicting SSc patient ILD status with a high degree of success (out-of-sample > 82%; training
data set 79 patients, validation
data
set 40 patients). Pre-partitioning patients into groups using CART significantly increased…
Advisors/Committee Members: Burke, Thomas A (advisor).
Subjects/Keywords: Data Analysis;
Flow Cytometry;
Systemic Sclerosis;
Autoimmune disorders
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Huang, H. (2015). On the Identification of Associations between Flow Cytometry Data, Systemic Sclerosis and Cancer. (Thesis). Johns Hopkins University. Retrieved from http://jhir.library.jhu.edu/handle/1774.2/37905
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Huang, Hongtai. “On the Identification of Associations between Flow Cytometry Data, Systemic Sclerosis and Cancer.” 2015. Thesis, Johns Hopkins University. Accessed March 02, 2021.
http://jhir.library.jhu.edu/handle/1774.2/37905.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Huang, Hongtai. “On the Identification of Associations between Flow Cytometry Data, Systemic Sclerosis and Cancer.” 2015. Web. 02 Mar 2021.
Vancouver:
Huang H. On the Identification of Associations between Flow Cytometry Data, Systemic Sclerosis and Cancer. [Internet] [Thesis]. Johns Hopkins University; 2015. [cited 2021 Mar 02].
Available from: http://jhir.library.jhu.edu/handle/1774.2/37905.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Huang H. On the Identification of Associations between Flow Cytometry Data, Systemic Sclerosis and Cancer. [Thesis]. Johns Hopkins University; 2015. Available from: http://jhir.library.jhu.edu/handle/1774.2/37905
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
26.
Χατζημιχαήλ, Σπύρος.
Σύγχρονοι αλγόριθμοι ομαδοποίησης για ροές δεδομένων.
Degree: 2009, University of Patras
URL: http://nemertes.lis.upatras.gr/jspui/handle/10889/1727
► Σε αυτή την πτυχιακή εργασία γίνεται μελέτη του προβλήματος της ομαδοποίησης δεδομένων και πιο συγκεκριμένα οnline ομαδοποίηση σε ροές δεδομένων. Στην αρχή παρουσιάζεται η απλή…
(more)
▼ Σε αυτή την πτυχιακή εργασία γίνεται μελέτη του προβλήματος της ομαδοποίησης δεδομένων και πιο συγκεκριμένα οnline ομαδοποίηση σε ροές δεδομένων.
Στην αρχή παρουσιάζεται η απλή offline εκδοχή του προβλήματος, όπου όλα τα δεδομένα προς ομαδοποίηση είναι γνωστά εκ των προτέρων. Παρουσιάζονται οι πιο βασικοί αλγόριθμοι και στοιχειώδεις εφαρμογές που καταδεικνύουν ότι η εύρεση αποδοτικών αλγορίθμων μπορεί να δώσει ώθηση σε νέα περιβάλλοντα που η ομαδοποίηση αποτελεί υπολογιστικό πυρήνα.
Στη συνέχεια γίνεται εισαγωγή στο μοντέλο ροών δεδομένων, όπου εκεί η γνώση του αλγορίθμου για τη φύση των δεδομένων αποκτάται σταδιακά, όσο παρουσιάζονται νέα στοιχεία. Ο περιορισμός της διαθέσιμης μνήμης και η ανάγκη μας για αποδοτικούς αλγορίθμους μας οδηγεί σε κατασκευή προσεγγιστικών ευρετικών. Παρουσιάζονται ανοιχτά προβλήματα που έχουν τεθεί στη βιβλιογραφία καθώς και διάφορες εφαρμογές που προκύπτουν από δεδομένα που σχηματίζουν ροές.
Συνεχίζοντας γίνεται μια εκτενής μελέτη της σύγχρονης βιβλιογραφίας και παρουσιάζονται οι πιο αντιπροσωπευτικοί αλγόριθμοι από κάθε βασική τεχνική προσέγγισης, όπως η ομαδοποίηση με βάση την πυκνότητα, ομαδοποίηση με γραμμική παλινδρόμηση, ομαδοποίηση δύο σταδίων κα. Παρουσιάζεται επίσης και ένας νέος αλγόριθμος που συνδυάζει προεπεξεργασία των δεδομένων της ροής με έναν online αλγόριθμο ομαδοποίησης και παραγωγή της τελικής ομαδοποίησης με μία παραλλαγή του LocalSearch.
Τέλος ακολουθούν διάφορα πειραματικά αποτελέσματα που πραγματοποιήθηκαν επί αυτών των αντιπροσωπευτικών αλγορίθμων και γίνεται σύγκριση μεταξύ τους. Παρατηρούμε ότι τα νέα σχήματα που που προκύπτουν με βάση τον αλγόριθμο Localsearch πετυχαίνουν πολύ καλύτερα τελικά αποτελέσματα σε σχέση με τον αλγόριθμο Birch.
-
Advisors/Committee Members: Λυκοθανάσης, Σπυρίδων, Λυκοθανάσης, Σπυρίδων, Παπαθεοδώρου, Θεόδωρος, Φωτάκης, Δημήτριος.
Subjects/Keywords: Αλγόριθμοι; Ομαδοποίηση; Ροές δεδομένων; 004.35; Algorithms; Grouping; Data flow
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Χατζημιχαήλ, . (2009). Σύγχρονοι αλγόριθμοι ομαδοποίησης για ροές δεδομένων. (Masters Thesis). University of Patras. Retrieved from http://nemertes.lis.upatras.gr/jspui/handle/10889/1727
Chicago Manual of Style (16th Edition):
Χατζημιχαήλ, Σπύρος. “Σύγχρονοι αλγόριθμοι ομαδοποίησης για ροές δεδομένων.” 2009. Masters Thesis, University of Patras. Accessed March 02, 2021.
http://nemertes.lis.upatras.gr/jspui/handle/10889/1727.
MLA Handbook (7th Edition):
Χατζημιχαήλ, Σπύρος. “Σύγχρονοι αλγόριθμοι ομαδοποίησης για ροές δεδομένων.” 2009. Web. 02 Mar 2021.
Vancouver:
Χατζημιχαήλ . Σύγχρονοι αλγόριθμοι ομαδοποίησης για ροές δεδομένων. [Internet] [Masters thesis]. University of Patras; 2009. [cited 2021 Mar 02].
Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/1727.
Council of Science Editors:
Χατζημιχαήλ . Σύγχρονοι αλγόριθμοι ομαδοποίησης για ροές δεδομένων. [Masters Thesis]. University of Patras; 2009. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/1727
Colorado State University
27.
González-Nicolás Álvarez, Ana.
Methodologies to detect leakages from geological carbon storage sites.
Degree: PhD, Civil and Environmental Engineering, 2014, Colorado State University
URL: http://hdl.handle.net/10217/83767
► Geological carbon storage (GCS) has been proposed as a favorable technology to reduce carbon dioxide (CO2) emissions to the atmosphere. Candidate storage formations include abandoned…
(more)
▼ Geological carbon storage (GCS) has been proposed as a favorable technology to reduce carbon dioxide (CO2) emissions to the atmosphere. Candidate storage formations include abandoned oil and natural gas reservoirs, un-mineable coal seams, and deep saline aquifers. The large global storage capacity and widespread occurrence of deep saline formations make them ideal repositories of large volumes of CO2, however they generally lack of
data for geological characterization in comparison to oil and gas reservoirs. Thus, properties of the injected formation or the sealing formation are unknown, which implies that the evolution and movement of the CO2 plume are uncertain in these geological formations. The first part of this research aims to provide an understanding of the main sources of uncertainty during the injection of CO2 that cause leakage variability and fluid pressure change near the injection well, which could be responsible for fracturing the sealing formation. With this purpose the effect of uncertain parameters such as permeability and porosity of injected aquifer, permeability of CO2 leakage pathways through the sealing layers, system compressibility, and brine residual saturation are investigated using stochastic and global sensitivity analyses. These analyses are applied to a potential candidate site for GCS located at the Michigan Basin. Results show aquifer permeability and system compressibility are the most influential parameters on fluid overpressure and CO2 mass leakage. Other parameters, such as rock porosity, permeability of passive wells, and brine residual saturation do not influence fluid overpressure nearby the injection well. CO2 mass leakage is found to be sensitive to passive well permeability as well as the type of statistical distribution applied to describe well permeability. Scarce
data of the Michigan Basin exist that can be used directly to describe the spatial distribution at the basin scale of the caprock overlying the candidate site. The continuity of this formation is uncertain. The second part of this investigation explores the application of binary permeability fields for the study of CO2 leakage from GCS at the candidate site. A sequential indicator simulation algorithm is used to populate binary permeability fields representing a caprock formation with potential leaky areas (or inclusions). Results of the caprock continuity uncertainty conclude that increasing the probability of inclusions occurrence increases the CO2 leakage. In addition, the correlation length used by the sequential indicator simulator affects the occurrence of inclusions. The third part investigates the detection and location of the presence of possible brine or carbon leakage pathways at the caprock during the injection operations of a GCS system. A computational framework for the assimilation of changes in head pressure
data into a subsurface
flow model is created to study the evolution of the CO2 plume and brine movement. The capabilities of two
data assimilation algorithms, the ensemble smoother (ES)…
Advisors/Committee Members: Baù, Domenico (advisor), Fontane, Darrell (committee member), Ronayne, Michael (committee member), Sale, Thomas (committee member).
Subjects/Keywords: carbon sequestration; CO2 leakage; data assimilation; ECLIPSE; multiphase flow; uncertainty
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
González-Nicolás Álvarez, A. (2014). Methodologies to detect leakages from geological carbon storage sites. (Doctoral Dissertation). Colorado State University. Retrieved from http://hdl.handle.net/10217/83767
Chicago Manual of Style (16th Edition):
González-Nicolás Álvarez, Ana. “Methodologies to detect leakages from geological carbon storage sites.” 2014. Doctoral Dissertation, Colorado State University. Accessed March 02, 2021.
http://hdl.handle.net/10217/83767.
MLA Handbook (7th Edition):
González-Nicolás Álvarez, Ana. “Methodologies to detect leakages from geological carbon storage sites.” 2014. Web. 02 Mar 2021.
Vancouver:
González-Nicolás Álvarez A. Methodologies to detect leakages from geological carbon storage sites. [Internet] [Doctoral dissertation]. Colorado State University; 2014. [cited 2021 Mar 02].
Available from: http://hdl.handle.net/10217/83767.
Council of Science Editors:
González-Nicolás Álvarez A. Methodologies to detect leakages from geological carbon storage sites. [Doctoral Dissertation]. Colorado State University; 2014. Available from: http://hdl.handle.net/10217/83767
Syracuse University
28.
Ruscher, Christopher John.
APPLICATION OF DATA FUSION TO FLUID DYNAMIC DATA.
Degree: PhD, Mechanical and Aerospace Engineering, 2014, Syracuse University
URL: https://surface.syr.edu/etd/114
► In recent years, there have been improvements in the methods of obtaining fluid dynamic data, which has led to the generation of vast amounts…
(more)
▼ In recent years, there have been improvements in the methods of obtaining fluid dynamic
data, which has led to the generation of vast amounts of
data. Extracting the useful information from large
data sets can be a challenging task when investigating
data from a single source. However, most experiments use
data from multiple sources, such as particle image velocimetry (PIV), pressure sensors, acoustic measurements, and computational fluid dynamics (CFD), to name a few. Knowing the strengths and weaknesses of each measurement technique, one can fuse the
data together to improve the understanding of the problem being studied. Concepts from the
data fusion community are used to combine fluid dynamic
data from the different
data sources. The
data is fused using techniques commonly used by the fluid dynamics community, such as proper orthogonal decomposition (POD), linear stochastic estimation (LSE), and wavelet analysis. This process can generate large quantities of
data and a method of handling all of the
data and the techniques in an efficient manner is required. To accomplish this, a framework was developed that is capable of tracking, storing, and, manipulating
data.
With the framework and techniques,
data fusion can be applied.
Data fusion is first applied to a synthetic
data set to determine the best methods of fusing
data.
Data fusion was then applied to airfoil
data that was obtained from PIV, CFD, and pressure to test the ideas from the synthetic
data. With the knowledge gained from applying fusion to the synthetic
data and airfoil
data, these techniques are ultimately applied to
data for a Mach 0.6 jet obtained from large-window PIV (LWPIV), time-resolved PIV (TRPIV), and pressure.
Through the fusion of the different
data sets, occlusion in the jet
data were estimated within 6% error using a new POD based technique called Fused POD. In addition, a technique called Dynamic Gappy POD was created to fuse TRPIV and LWPIV to generate a large-window time-resolved
data set. This technique had less error than other standard techniques for accomplishing this such as pressure-based stochastic estimation.
The work presented in this document lays the groundwork for future applications of
data fusion to fluid dynamic
data. With the success of the work in this document, one can begin to apply the ideas from
data fusion to other types of fluid dynamic problems, such as bluff bodies, unsteady aerodynamics, and other. These ideas could be used to help improve understanding in the field of fluid dynamics due to the current limitations of obtaining
data and the need to better understand
flow phenomena.
Advisors/Committee Members: John F. Dannenhoffer, Mark N. Glauser.
Subjects/Keywords: Airfoil; Data Fusion; Fluid Dynamics; Jet Flow; Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ruscher, C. J. (2014). APPLICATION OF DATA FUSION TO FLUID DYNAMIC DATA. (Doctoral Dissertation). Syracuse University. Retrieved from https://surface.syr.edu/etd/114
Chicago Manual of Style (16th Edition):
Ruscher, Christopher John. “APPLICATION OF DATA FUSION TO FLUID DYNAMIC DATA.” 2014. Doctoral Dissertation, Syracuse University. Accessed March 02, 2021.
https://surface.syr.edu/etd/114.
MLA Handbook (7th Edition):
Ruscher, Christopher John. “APPLICATION OF DATA FUSION TO FLUID DYNAMIC DATA.” 2014. Web. 02 Mar 2021.
Vancouver:
Ruscher CJ. APPLICATION OF DATA FUSION TO FLUID DYNAMIC DATA. [Internet] [Doctoral dissertation]. Syracuse University; 2014. [cited 2021 Mar 02].
Available from: https://surface.syr.edu/etd/114.
Council of Science Editors:
Ruscher CJ. APPLICATION OF DATA FUSION TO FLUID DYNAMIC DATA. [Doctoral Dissertation]. Syracuse University; 2014. Available from: https://surface.syr.edu/etd/114
Cranfield University
29.
Han, Wei.
Modelling for data management & exchange in Concurrent Engineering - A case study of civil aircraft assembly line.
Degree: MSc by Research, 2013, Cranfield University
URL: http://dspace.lib.cranfield.ac.uk/handle/1826/8465
► This research aims to improve the dataflow performance of the Concurrent Engineering (CE) practice in the detail design stage of the aircraft Assembly Line (AL)…
(more)
▼ This research aims to improve the dataflow performance of the Concurrent
Engineering (CE) practice in the detail design stage of the aircraft Assembly
Line (AL) in the C919 aircraft project. As the final integrator of the aircraft,
Shanghai Aircraft Manufacturing Company Ltd. (SAMC) is responsible for
developing the AL with global suppliers. Although CE has been implemented in
AL projects to shorten lead time, reduce development cost and improve design
quality, the lack of experience and insufficient infrastructure may lead to many
challenges in cooperation with distributed suppliers, especially regarding data
management/exchange and workflow control. In this research, the particular CE
environment and activities in SAMC AL projects were investigated. By
assessing the CE performance and benchmarking, the improvement
opportunities are identified, and then an activity-oriented workflow and dataflow
model is established by decomposing the work process to detail levels. Based
on this model, a Product Data Management (PDM) based support platform is
proposed to facilitate data management/exchange in dynamic workflow to
improve work efficiency and interoperability. This solution is mocked-up on the
Siemens Teamcenter 8.1 PLM(Product Lifecycle Management) software and its
feasibility is checked. The mock-up is evaluated by SAMC experts and suppliers.
The feedback shows the acceptance of the model by experts and the urgency
of improving data/work flow design before PLM implementing.
The result of this research is useful for enterprises in similar environments
transiting from pre-PLM to implementing PLM and who wanting to strengthen
CE in the new product development.
Subjects/Keywords: Concurrent Engineering; PDM; interoperability; workflow/data flow; aircraft assembly line
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Han, W. (2013). Modelling for data management & exchange in Concurrent Engineering - A case study of civil aircraft assembly line. (Masters Thesis). Cranfield University. Retrieved from http://dspace.lib.cranfield.ac.uk/handle/1826/8465
Chicago Manual of Style (16th Edition):
Han, Wei. “Modelling for data management & exchange in Concurrent Engineering - A case study of civil aircraft assembly line.” 2013. Masters Thesis, Cranfield University. Accessed March 02, 2021.
http://dspace.lib.cranfield.ac.uk/handle/1826/8465.
MLA Handbook (7th Edition):
Han, Wei. “Modelling for data management & exchange in Concurrent Engineering - A case study of civil aircraft assembly line.” 2013. Web. 02 Mar 2021.
Vancouver:
Han W. Modelling for data management & exchange in Concurrent Engineering - A case study of civil aircraft assembly line. [Internet] [Masters thesis]. Cranfield University; 2013. [cited 2021 Mar 02].
Available from: http://dspace.lib.cranfield.ac.uk/handle/1826/8465.
Council of Science Editors:
Han W. Modelling for data management & exchange in Concurrent Engineering - A case study of civil aircraft assembly line. [Masters Thesis]. Cranfield University; 2013. Available from: http://dspace.lib.cranfield.ac.uk/handle/1826/8465
30.
Nguyen, Phong Hai.
Statistical flow data applied to visual analytics.
Degree: The Institute of Technology, 2011, Linköping UniversityLinköping University
URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-70978
► Statistical flow data such as commuting, migration, trade and money flows has gained manyinterests from policy makers, city planners, researchers and ordinary citizens as…
(more)
▼ Statistical flow data such as commuting, migration, trade and money flows has gained manyinterests from policy makers, city planners, researchers and ordinary citizens as well. Therehave appeared numerous statistical data visualisations; however, there is a shortage of applicationsfor visualising flow data. Moreover, among these rare applications, some are standaloneand only for expert usages, some do not support interactive functionalities, and somecan only provide an overview of data. Therefore, in this thesis, I develop a web-enabled,highly interactive and analysis support statistical flow data visualisation application that addressesall those challenges.My application is implemented based on GAV Flash, a powerful interactive visualisationcomponent framework, thus it is inherently web-enabled with basic interactive features. Theapplication uses visual analytics approach that combines both data analysis and interactivevisualisation to solve cluttering issue, the problem of overlapping flows on the display. A varietyof analysis means are provided to analyse flow data efficiently including analysing bothflow directions simultaneously, visualising time-series flow data, finding most attracting regionsand figuring out the reason behind derived patterns. The application also supportssharing knowledge between colleagues by providing story-telling mechanism which allowsusers to create and share their findings as a visualisation story. Last but not least, the applicationenables users to embed the visualisation based on the story into an ordinary web-pageso that public stand a golden chance to derive an insight into officially statistical flow data.
Subjects/Keywords: Visual Analytics; Information and Geographic Visualization; Flow Data Visualization
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Nguyen, P. H. (2011). Statistical flow data applied to visual analytics. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-70978
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Nguyen, Phong Hai. “Statistical flow data applied to visual analytics.” 2011. Thesis, Linköping UniversityLinköping University. Accessed March 02, 2021.
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-70978.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Nguyen, Phong Hai. “Statistical flow data applied to visual analytics.” 2011. Web. 02 Mar 2021.
Vancouver:
Nguyen PH. Statistical flow data applied to visual analytics. [Internet] [Thesis]. Linköping UniversityLinköping University; 2011. [cited 2021 Mar 02].
Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-70978.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Nguyen PH. Statistical flow data applied to visual analytics. [Thesis]. Linköping UniversityLinköping University; 2011. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-70978
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
◁ [1] [2] [3] [4] [5] … [17] ▶
. 
Open Access Theses and Dissertations