The Time Slice Selection Bake-off
| dc.contributor.advisor | Childs, Hank | |
| dc.contributor.author | Kawakami, Yuya | |
| dc.date.accessioned | 2022-10-04T19:41:44Z | |
| dc.date.available | 2022-10-04T19:41:44Z | |
| dc.date.issued | 2022-10-04 | |
| dc.description.abstract | As the size of data from scientific simulations grows, the ability to identify key time steps in a simulation has emerged as a key challenge. In response, a number of time slice selection methods and algorithms have been proposed. However, no past work has performed a comparative analysis of selection methods as well as their evaluation metrics. This thesis presents results from quantitative and qualitative study of selection methods and evaluation metrics to fill thisgap. Our work has three major thrusts. First, we identify similarities and dissimilarities between different time slice slice selection algorithms. Second, we evaluate conditions under which these methods may fail. Third, we also perform a comparative study with evaluation metrics to investigate how selection methods perform under the set of evaluation metrics in literature. In all, this thesis aims to understand the space of time slice selection methods, to inform future research in this area. | en_US |
| dc.identifier.uri | https://hdl.handle.net/1794/27610 | |
| dc.language.iso | en_US | |
| dc.publisher | University of Oregon | |
| dc.rights | All Rights Reserved. | |
| dc.subject | High-Performance Computing | en_US |
| dc.subject | In Situ Processing | en_US |
| dc.subject | Scientific Visualization | en_US |
| dc.title | The Time Slice Selection Bake-off | |
| dc.type | Electronic Thesis or Dissertation | |
| thesis.degree.discipline | Department of Computer and Information Science | |
| thesis.degree.grantor | University of Oregon | |
| thesis.degree.level | masters | |
| thesis.degree.name | M.S. |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Kawakami_oregon_0171N_13347.pdf
- Size:
- 4.53 MB
- Format:
- Adobe Portable Document Format