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

Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing最新文献

筛选
英文 中文
Infrastructure as Code for Heterogeneous Computing 作为异构计算代码的基础设施
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2020-01-01 DOI: 10.1109/SYNASC51798.2020.00011
D. Vladusic, Dragan Radolovic
{"title":"Infrastructure as Code for Heterogeneous Computing","authors":"D. Vladusic, Dragan Radolovic","doi":"10.1109/SYNASC51798.2020.00011","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00011","url":null,"abstract":"","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"92 1","pages":"1-2"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86973328","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
An efficient method for computing the outer inverse AT, S(2) through Gauss-Jordan elimination 利用高斯-约当消去法计算外逆AT S(2)的一种有效方法
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2019-10-10 DOI: 10.1007/s11075-019-00803-w
Jie Ma, Feng Gao, Yongshu Li
{"title":"An efficient method for computing the outer inverse AT, S(2) through Gauss-Jordan elimination","authors":"Jie Ma, Feng Gao, Yongshu Li","doi":"10.1007/s11075-019-00803-w","DOIUrl":"https://doi.org/10.1007/s11075-019-00803-w","url":null,"abstract":"","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"75 1","pages":"77-106"},"PeriodicalIF":0.0,"publicationDate":"2019-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74648239","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
Toward on-Line Predictive Models for Forecasting Workload in Clouds 云中工作量在线预测模型的研究
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2018-09-01 DOI: 10.1109/SYNASC.2018.00048
Dong Nguyen Doan
{"title":"Toward on-Line Predictive Models for Forecasting Workload in Clouds","authors":"Dong Nguyen Doan","doi":"10.1109/SYNASC.2018.00048","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00048","url":null,"abstract":"Forecasting workload plays a crucial role in term of Quality of Service (QoS) guarantee in cloud computing. However, there are existing challenges including continuous forecast and multi-step-ahead prediction due to the time series structure characteristics of workload. The most used approaches to forecast workload are predictive models based on time series analysis such as Auto-Regressive Integrated Moving Average (ARIMA) and Exponential Smoothing (ES) models, but these models do not address the limitations yet. This paper presents the strategies to apply machine learning to tackle the challenges of time series data streaming and develop on-line predictive models to continuously forecast and support the multi-step-ahead prediction. The empirical results show that the proposed approach yields much better accuracy than other methods, namely Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM).","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"15 1","pages":"260-265"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81910895","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
The Blockchain, Today and Tomorrow 区块链，今天和明天
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2018-09-01 DOI: 10.1109/SYNASC.2018.00077
Ometita Radu Adrian
{"title":"The Blockchain, Today and Tomorrow","authors":"Ometita Radu Adrian","doi":"10.1109/SYNASC.2018.00077","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00077","url":null,"abstract":"Software engineering principles have enabled us to continually increase the complexity of the problems that we can solve using software by promoting the sensible use of abstraction, separation, composition and generalisation. Writing software for a public blockchain makes the code we write publicly available for inspection, and potential exploits may result in the loss of funds that the program manages. This unprecedented level of exposure and ease of exploitation requires new methods to improve our confidence in the correctness of the code that we write. This paper explores the main current techniques used to achieve this increased level of confidence, especially in the area of programming language design, starting from the first Turing Complete blockchain implementation Ethereum, and ending with some of the more principled approaches, Scilla and Rholang.","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"56 1","pages":"458-462"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75492692","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
A set-based approach to model checking of nonlinear systems (invited tutorial) 基于集的非线性系统模型检验方法(特邀教程)
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2018-09-01 DOI: 10.1109/SYNASC.2018.00018
M. Prandini
{"title":"A set-based approach to model checking of nonlinear systems (invited tutorial)","authors":"M. Prandini","doi":"10.1109/SYNASC.2018.00018","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00018","url":null,"abstract":"","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"143 1","pages":"34"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80324477","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 with Quantifiers and Theories Using Saturation-Based Reasoning 量词推理和基于饱和推理的理论
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2018-09-01 DOI: 10.1109/SYNASC.2018.00015
A. Voronkov
{"title":"Reasoning with Quantifiers and Theories Using Saturation-Based Reasoning","authors":"A. Voronkov","doi":"10.1109/SYNASC.2018.00015","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00015","url":null,"abstract":"","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"109 1","pages":"18"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80624602","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
Self-adaptive forecast models in predictive maintenance systems 预测性维修系统中的自适应预测模型
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2018-09-01 DOI: 10.1109/SYNASC.2018.00013
E. Lughofer
{"title":"Self-adaptive forecast models in predictive maintenance systems","authors":"E. Lughofer","doi":"10.1109/SYNASC.2018.00013","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00013","url":null,"abstract":"","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"24 1","pages":"8"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84496049","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
Detecting proteine coding regions using a customized multi-scales splines construction. 使用自定义的多尺度样条构造检测蛋白质编码区域。
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2017-01-01 DOI: 10.1109/SYNASC.2017.00072
Darian M Onchis
{"title":"Detecting proteine coding regions using a customized multi-scales splines construction.","authors":"Darian M Onchis","doi":"10.1109/SYNASC.2017.00072","DOIUrl":"10.1109/SYNASC.2017.00072","url":null,"abstract":"<p><p>In this experimental paper, we propose a method to detect proteins coding regions using a multiresolution wavelet-like system, constructed in multi-window splines-type spaces. The method is based on considering only the generators that prominently intersect the spectrum of the DNA (Deoxyribonucleic acid) sequence and on analysing jointly three different features namely time, scale and frequency. Numerical comparison and experimental results are presented.</p>","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"19 ","pages":"397-400"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6292491/pdf/emss-80804.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"36787806","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Constructive realizable multiresolution wavelet-like systems based on multi-windows spline-type spaces. 基于多窗口样条空间的构造可实现多分辨率类小波系统。
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2017-01-01 DOI: 10.1109/SYNASC.2017.00027
Darian M Onchis, Simone Zappalà
{"title":"Constructive realizable multiresolution wavelet-like systems based on multi-windows spline-type spaces.","authors":"Darian M Onchis, Simone Zappalà","doi":"10.1109/SYNASC.2017.00027","DOIUrl":"10.1109/SYNASC.2017.00027","url":null,"abstract":"<p><p>In this paper, we present a constructive realizable procedure for obtaining a multiresolution wavelet-like system in the framework of stability for spline-type spaces, considering only the generators that prominently intersect the spectrum of the signal to be approximated and stable under deformations through frequency shifts. The realizable system constructed in this way, can analyse jointly three different features of a signal namely time, scale and frequency. We present numerical tests and a detailed complexity analysis to compare the performances of our method against standard constructions.</p>","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"19 ","pages":"99-104"},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6289246/pdf/emss-80801.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"36824479","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Approximate Duals of Gabor-like Frames Based on Realizable Multi-Window Spline-Type Constructions. 基于可实现多窗口样条结构的类gabor框架的近似对偶。
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2016-01-01 DOI: 10.1109/SYNASC.2016.027
Darian M Onchis, Simone Zappalà
{"title":"Approximate Duals of Gabor-like Frames Based on Realizable Multi-Window Spline-Type Constructions.","authors":"Darian M Onchis, Simone Zappalà","doi":"10.1109/SYNASC.2016.027","DOIUrl":"10.1109/SYNASC.2016.027","url":null,"abstract":"<p><p>In the multi-window spline-type spaces, the fast computation of the realizable dual frame could be achieved through a constructive reformulation of the biorthogonal relations. In this paper, we extend the results obtained in spline-type spaces, for the constructive realization of an approximate dual Gabor-like frame. We demonstrate the advantages of this approach in both flexibility and speed. The method allows in a natural way to handle non standard Gabor constructions like non-uniformity in frequency and the reductions of the number of used modulations. Experimental tests are presented in support of the algorithm.</p>","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"18 ","pages":"99-104"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5405798/pdf/emss-71454.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"34957854","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
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学术官方微信