发布求助
文献互助 智能选刊 最新文献

Time最新文献

筛选
英文 中文
Neural-Symbolic Temporal Decision Trees for Multivariate Time Series Classification 多元时间序列分类的神经符号时间决策树
Time Pub Date : 2022-01-01 DOI: 10.4230/LIPIcs.TIME.2022.13
G. Pagliarini, Simone Scaboro, Giuseppe Serra, G. Sciavicco, Eduard Ionel Stan
{"title":"Neural-Symbolic Temporal Decision Trees for Multivariate Time Series Classification","authors":"G. Pagliarini, Simone Scaboro, Giuseppe Serra, G. Sciavicco, Eduard Ionel Stan","doi":"10.4230/LIPIcs.TIME.2022.13","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2022.13","url":null,"abstract":"Multivariate time series classification is a widely known problem, and its applications are ubiquitous. Due to their strong generalization capability, neural networks have been proven to be very powerful for the task, but their applicability is often limited by their intrinsic black-box nature. Recently, temporal decision trees have been shown to be a serious alternative to neural networks for the same task in terms of classification performances, while attaining higher levels of transparency and interpretability. In this work, we propose an initial approach to neural-symbolic temporal decision trees, that is, an hybrid method that leverages on both the ability of neural networks of capturing temporal patterns and the flexibility of temporal decision trees of taking decisions on intervals based on (possibly, externally computed) temporal features. While based on a proof-of-concept implementation, in our experiments on public datasets, neural-symbolic temporal decision trees show promising results. .","PeriodicalId":75226,"journal":{"name":"Time","volume":"5 1","pages":"13:1-13:15"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87036100","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Getting to the CORE of Complex Event Recognition (Invited Talk) 复杂事件识别的核心(特邀演讲)
Time Pub Date : 2022-01-01 DOI: 10.4230/LIPIcs.TIME.2022.3
Stijn Vansummeren
{"title":"Getting to the CORE of Complex Event Recognition (Invited Talk)","authors":"Stijn Vansummeren","doi":"10.4230/LIPIcs.TIME.2022.3","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2022.3","url":null,"abstract":"In this talk, I will give an overview of our recent work on complex event recognition. 2012 ACM Subject Classification Information systems → Query languages for non-relational engines; Information systems → Stream management; Theory of computation → Formal languages and automata theory Abstract Complex Event Recognition (CER for short) refers to the activity of processing high-velocity streams of primitive events by evaluating queries that detect complex events : collections of primitive events that satisfy some pattern. In particular, CER queries match incoming events on the basis of their content; where they occur in the input stream; and how this order relates to other events in the stream. CER has been successfully applied in diverse domains such as maritime monitoring, network intrusion detection, industrial control systems and real-time analytics, among others. In this talk, I will survey our recent work on developing a formal framework for specifying and evaluating CER queries. This framework consist of a formal, core query language called Complex Event Logic (CEL) for specifying CER queries [4]. In contrast to previous proposals, CEL has a compositional and denotational semantics, and encompasses all operators that are considered “common base operators” in the literature. Using CEL, we have been able to get a better understanding of the relative expressiveness of these operators as well as the impact of common evaluation heuristics such as selection policies The framework also consists of an formal computational for CEL,","PeriodicalId":75226,"journal":{"name":"Time","volume":"101 1","pages":"3:1-3:2"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77365568","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reasoning on Dynamic Transformations of Symbolic Heaps 符号堆动态变换的推理
Time Pub Date : 2022-01-01 DOI: 10.4230/LIPIcs.TIME.2022.9
N. Peltier
{"title":"Reasoning on Dynamic Transformations of Symbolic Heaps","authors":"N. Peltier","doi":"10.4230/LIPIcs.TIME.2022.9","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2022.9","url":null,"abstract":"Building on previous results concerning the decidability of the satisfiability and entailment problems for separation logic formulas with inductively defined predicates, we devise a proof procedure to reason on dynamic transformations of memory heaps. The initial state of the system is described by a separation logic formula of some particular form, its evolution is modeled by a finite transition system and the expected property is given as a linear temporal logic formula built over assertions in separation logic.","PeriodicalId":75226,"journal":{"name":"Time","volume":"16 1","pages":"9:1-9:20"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91115496","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Uprooted. 扎根。
Time Pub Date : 2021-10-26 DOI: 10.2307/j.ctv20rsk12.9
D. Cray
{"title":"Uprooted.","authors":"D. Cray","doi":"10.2307/j.ctv20rsk12.9","DOIUrl":"https://doi.org/10.2307/j.ctv20rsk12.9","url":null,"abstract":"","PeriodicalId":75226,"journal":{"name":"Time","volume":"169 27 1","pages":"69-70"},"PeriodicalIF":0.0,"publicationDate":"2021-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43458553","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
Sick and Tired: 生病和疲劳:
Time Pub Date : 2021-10-01 DOI: 10.2307/j.ctv1zjgbcm.11
{"title":"Sick and Tired:","authors":"","doi":"10.2307/j.ctv1zjgbcm.11","DOIUrl":"https://doi.org/10.2307/j.ctv1zjgbcm.11","url":null,"abstract":"","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"68799904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Olisipo: A Probabilistic Approach to the Adaptable Execution of Deterministic Temporal Plans 确定性时间计划适应性执行的概率方法
Time Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.TIME.2021.15
Tomás Ribeiro, Oscar Lima, Michael Cashmore, A. Micheli, R. Ventura
{"title":"Olisipo: A Probabilistic Approach to the Adaptable Execution of Deterministic Temporal Plans","authors":"Tomás Ribeiro, Oscar Lima, Michael Cashmore, A. Micheli, R. Ventura","doi":"10.4230/LIPIcs.TIME.2021.15","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.15","url":null,"abstract":"The robust execution of a temporal plan in a perturbed environment is a problem that remains to be solved. Perturbed environments, such as the real world, are non-deterministic and filled with uncertainty. Hence, the execution of a temporal plan presents several challenges and the employed solution often consists of replanning when the execution fails. In this paper, we propose a novel algorithm, named Olisipo, which aims to maximise the probability of a successful execution of a temporal plan in perturbed environments. To achieve this, a probabilistic model is used in the execution of the plan, instead of in the building of the plan. This approach enables Olisipo to dynamically adapt the plan to changes in the environment. In addition to this, the execution of the plan is also adapted to the probability of successfully executing each action. Olisipo was compared to a simple dispatcher and it was shown that it consistently had a higher probability of successfully reaching a goal state in uncertain environments, performed fewer replans and also executed fewer actions. Hence, Olisipo offers a substantial improvement in performance for disturbed environments. 2012 ACM Subject Classification Computing methodologies → Robotic planning","PeriodicalId":75226,"journal":{"name":"Time","volume":"4 1","pages":"15:1-15:15"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74550069","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Interval Temporal Random Forests with an Application to COVID-19 Diagnosis 区间时间随机森林在COVID-19诊断中的应用
Time Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.TIME.2021.7
F. Manzella, G. Pagliarini, G. Sciavicco, Eduard Ionel Stan
{"title":"Interval Temporal Random Forests with an Application to COVID-19 Diagnosis","authors":"F. Manzella, G. Pagliarini, G. Sciavicco, Eduard Ionel Stan","doi":"10.4230/LIPIcs.TIME.2021.7","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.7","url":null,"abstract":"Symbolic learning is the logic-based approach to machine learning. The mission of symbolic learning is to provide algorithms and methodologies to extract logical information from data and express it in an interpretable way. In the context of temporal data, interval temporal logic has been recently proposed as a suitable tool for symbolic learning, specifically via the design of an interval temporal logic decision tree extraction algorithm. Building on it, we study here its natural generalization to interval temporal random forests, mimicking the corresponding schema at the propositional level. Interval temporal random forests turn out to be a very performing multivariate time series classification method, which, despite the introduction of a functional component, are still logically interpretable to some extent. We apply this method to the problem of diagnosing COVID-19 based on the time series that emerge from cough and breath recording of positive versus negative subjects. Our experiment show that our models achieve very high accuracies and sensitivities, often superior to those achieved by classical methods on the same data. Although other recent approaches to the same problem (based on different and more numerous data) show even better statistical results, our solution is the first logic-based, interpretable, and explainable one. © Federico Manzella, Giovanni Pagliarini, Guido Sciavicco, and Ionel Eduard Stan;licensed under Creative Commons License CC-BY 4.0 28th International Symposium on Temporal Representation and Reasoning (TIME 2021).","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"7:1-7:18"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79935896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic 线性时序逻辑中本体中介查询fo -可重写性的决定
Time Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.TIME.2021.10
V. Ryzhikov, Yury Savateev, M. Zakharyaschev
{"title":"Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic","authors":"V. Ryzhikov, Yury Savateev, M. Zakharyaschev","doi":"10.4230/LIPIcs.TIME.2021.10","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.10","url":null,"abstract":"11 Our concern is the problem of determining the data complexity of answering an ontology-mediated 12 query (OMQ) given in linear temporal logic LTL over ( Z , < ) and deciding whether it is rewritable to an 13 FO ( < )-query, possibly with extra predicates. First, we observe that, in line with the circuit complexity 14 and FO-definability of regular languages, OMQ answering in AC 0 , ACC 0 and NC 1 coincides 15 with FO ( <, ≡ )-rewritability using unary predicates x ≡ 0 (mod n ), FO ( <, MOD )-rewritability, and 16 FO ( RPR )-rewritability using relational primitive recursion, respectively. We then show that deciding 17 FO ( < )-, FO ( <, ≡ )- and FO ( <, MOD )-rewritability of LTL OMQs is ExpSpace -complete, and that 18 these problems become PSpace -complete for OMQs with a linear Horn ontology and an atomic 19 query, and also a positive query in the cases of FO ( < )- and FO ( <, ≡ )-rewritability. Further, we 20 consider FO ( < )-rewritability of OMQs with a binary-clause ontology and identify OMQ classes, for 21 which deciding it is PSpace -, Π p 2 - and coNP -complete. 22","PeriodicalId":75226,"journal":{"name":"Time","volume":"49 1","pages":"10:1-10:15"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81638264","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A Neuro-Symbolic Approach to Structured Event Recognition 结构化事件识别的神经符号方法
Time Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.TIME.2021.11
Gianluca Apriceno, Andrea Passerini, L. Serafini
{"title":"A Neuro-Symbolic Approach to Structured Event Recognition","authors":"Gianluca Apriceno, Andrea Passerini, L. Serafini","doi":"10.4230/LIPIcs.TIME.2021.11","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.11","url":null,"abstract":"","PeriodicalId":75226,"journal":{"name":"Time","volume":"15 1","pages":"11:1-11:14"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82341120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Simple Temporal Networks: A Practical Foundation for Temporal Representation and Reasoning (Invited Talk) 简单时间网络:时间表征和推理的实践基础(特邀演讲)
Time Pub Date : 2021-01-01 DOI: 10.4230/LIPIcs.TIME.2021.1
Luke Hunsberger, Roberto Posenato
{"title":"Simple Temporal Networks: A Practical Foundation for Temporal Representation and Reasoning (Invited Talk)","authors":"Luke Hunsberger, Roberto Posenato","doi":"10.4230/LIPIcs.TIME.2021.1","DOIUrl":"https://doi.org/10.4230/LIPIcs.TIME.2021.1","url":null,"abstract":"Since Simple Temporal Networks (STNs) were first introduced in 1991, there have been numerous theoretic and algorithmic advances that have made them practical for a wide variety of applications. However, the presentation of most of the important advances have been scattered across numerous conference papers and journal articles. As a result, it is too easy for even experienced researchers to be unaware of results that could positively impact their work. In this talk we review the most important results about STNs for researchers in Artificial Intelligence who are interested in incorporating the management of time and temporal constraints into their projects. 2012 ACM Subject Classification Computing methodologies → Temporal reasoning; Theory of computation → Network optimization; Theory of computation → Dynamic graph algorithms; Mathematics of computing → Graph algorithms","PeriodicalId":75226,"journal":{"name":"Time","volume":"1 1","pages":"1:1-1:5"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76903399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信