Constructing Hypothesis Lattices for Virtual Experiments in Data Intensive Research

D. Kovalev, S. Stupnikov
{"title":"Constructing Hypothesis Lattices for Virtual Experiments in Data Intensive Research","authors":"D. Kovalev, S. Stupnikov","doi":"10.1109/IVMEM.2019.00008","DOIUrl":null,"url":null,"abstract":"Data intensive research is increasingly dependent on the explicit use of hypotheses, simulations and computational models. This paper is devoted to the development of infrastructure for explicit management of virtual experiments and research hypotheses. In particular, hypothesis lattices construction issues are considered. Basic concepts for working with research hypotheses such as hypotheses structure, its basic properties, causal correspondence of equations and variables over the defined structures are provided. The notion of hypotheses lattice is presented as a graph whose vertices are hypotheses, edges are the derived by relationship between hypotheses. An algorithm for constructing hypothesis lattices in virtual experiments is presented. A proof of the proposition on the complexity of the algorithm for constructing a lattice of hypotheses is provided. The developed method for constructing hypothesis lattices is implemented as a program component in the Python3 language.","PeriodicalId":166102,"journal":{"name":"2019 Ivannikov Memorial Workshop (IVMEM)","volume":"603 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Ivannikov Memorial Workshop (IVMEM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IVMEM.2019.00008","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Data intensive research is increasingly dependent on the explicit use of hypotheses, simulations and computational models. This paper is devoted to the development of infrastructure for explicit management of virtual experiments and research hypotheses. In particular, hypothesis lattices construction issues are considered. Basic concepts for working with research hypotheses such as hypotheses structure, its basic properties, causal correspondence of equations and variables over the defined structures are provided. The notion of hypotheses lattice is presented as a graph whose vertices are hypotheses, edges are the derived by relationship between hypotheses. An algorithm for constructing hypothesis lattices in virtual experiments is presented. A proof of the proposition on the complexity of the algorithm for constructing a lattice of hypotheses is provided. The developed method for constructing hypothesis lattices is implemented as a program component in the Python3 language.
数据密集型研究中虚拟实验假设格的构造
数据密集型研究越来越依赖于假设、模拟和计算模型的明确使用。本文致力于开发虚拟实验和研究假设的明确管理基础设施。特别考虑了假设格的构造问题。提供了研究假设的基本概念,如假设结构,其基本性质,方程和变量在定义结构上的因果对应关系。假设格的概念被提出为一个图,它的顶点是假设,边是由假设之间的关系推导出来的。提出了一种虚拟实验中假设格的构造算法。给出了构造假设格算法复杂性的证明。开发的构造假设格的方法在Python3语言中作为程序组件实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信