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

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

筛选
英文 中文
Evaluating the effort of building a Machine Learning model for malware detection from ground zero 评估从零开始构建恶意软件检测的机器学习模型的努力
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2022-01-01 DOI: 10.1109/SYNASC57785.2022.00066
A. Gabriel
{"title":"Evaluating the effort of building a Machine Learning model for malware detection from ground zero","authors":"A. Gabriel","doi":"10.1109/SYNASC57785.2022.00066","DOIUrl":"https://doi.org/10.1109/SYNASC57785.2022.00066","url":null,"abstract":"","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"12 1","pages":"365-370"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75494925","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
Symbolic Regression with augmented dataset using RuleFit 使用RuleFit增强数据集的符号回归
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2022-01-01 DOI: 10.1109/SYNASC57785.2022.00058
F. O. França
{"title":"Symbolic Regression with augmented dataset using RuleFit","authors":"F. O. França","doi":"10.1109/SYNASC57785.2022.00058","DOIUrl":"https://doi.org/10.1109/SYNASC57785.2022.00058","url":null,"abstract":"","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"136 2","pages":"323-326"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72488358","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
Obfuscation Techniques Based on Random Strings Used in Malicious VBA Scripts 恶意VBA脚本中基于随机字符串的混淆技术
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2022-01-01 DOI: 10.1109/SYNASC57785.2022.00063
Marilena Lupascu
{"title":"Obfuscation Techniques Based on Random Strings Used in Malicious VBA Scripts","authors":"Marilena Lupascu","doi":"10.1109/SYNASC57785.2022.00063","DOIUrl":"https://doi.org/10.1109/SYNASC57785.2022.00063","url":null,"abstract":"","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"9 1","pages":"347-352"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84267144","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
Comparison of OLS and NLS to fit Transformation-Interaction-Rational expressions OLS与NLS拟合Transformation-Interaction-Rational表达式的比较
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2022-01-01 DOI: 10.1109/SYNASC57785.2022.00057
F. O. França
{"title":"Comparison of OLS and NLS to fit Transformation-Interaction-Rational expressions","authors":"F. O. França","doi":"10.1109/SYNASC57785.2022.00057","DOIUrl":"https://doi.org/10.1109/SYNASC57785.2022.00057","url":null,"abstract":"","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"33 1","pages":"319-322"},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81411943","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
Accelerated dynamical approaches for finding the unique positive solution of KS-tensor equations 寻找ks张量方程唯一正解的加速动力学方法
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2021-04-02 DOI: 10.1007/S11075-021-01095-9
Xuezhong Wang, Changxin Mo, Maolin Che, Yiming Wei
{"title":"Accelerated dynamical approaches for finding the unique positive solution of KS-tensor equations","authors":"Xuezhong Wang, Changxin Mo, Maolin Che, Yiming Wei","doi":"10.1007/S11075-021-01095-9","DOIUrl":"https://doi.org/10.1007/S11075-021-01095-9","url":null,"abstract":"","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"2013 1","pages":"1787-1810"},"PeriodicalIF":0.0,"publicationDate":"2021-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73711432","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}
引用次数: 6
A class of blending functions with C∞ smoothness 一类C∞光滑的混合函数
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2021-01-11 DOI: 10.1007/S11075-020-01049-7
Yuanpeng Zhu
{"title":"A class of blending functions with C∞ smoothness","authors":"Yuanpeng Zhu","doi":"10.1007/S11075-020-01049-7","DOIUrl":"https://doi.org/10.1007/S11075-020-01049-7","url":null,"abstract":"","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 1","pages":"555-582"},"PeriodicalIF":0.0,"publicationDate":"2021-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89883645","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
Combining weak classifiers: a logical analysis 结合弱分类器:逻辑分析
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2021-01-01 DOI: 10.1109/SYNASC54541.2021.00038
J. Brossier, O. Lafitte
{"title":"Combining weak classifiers: a logical analysis","authors":"J. Brossier, O. Lafitte","doi":"10.1109/SYNASC54541.2021.00038","DOIUrl":"https://doi.org/10.1109/SYNASC54541.2021.00038","url":null,"abstract":"","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"24 1","pages":"178-181"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78222549","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
Methods of acceleration for feature extractions in medical imaging using GPU processing 基于GPU处理的医学影像特征提取加速方法
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2021-01-01 DOI: 10.1109/SYNASC54541.2021.00047
Sebastian-Aurelian Ștefănigă
{"title":"Methods of acceleration for feature extractions in medical imaging using GPU processing","authors":"Sebastian-Aurelian Ștefănigă","doi":"10.1109/SYNASC54541.2021.00047","DOIUrl":"https://doi.org/10.1109/SYNASC54541.2021.00047","url":null,"abstract":"","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"26 1","pages":"234-241"},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78616670","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
Acceleration of convergence of some infinite sequences {An} whose asymptotic expansions involve fractional powers of n via the ${tilde {d}}^{(m)}$ transformation 通过${tilde {d}}^{(m)}$变换，若干无穷序列{An}的渐近展开式包含n的分数次幂的收敛加速
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2020-03-23 DOI: 10.1007/s11075-019-00870-z
A. Sidi
{"title":"Acceleration of convergence of some infinite sequences {An} whose asymptotic expansions involve fractional powers of n via the ${tilde {d}}^{(m)}$ transformation","authors":"A. Sidi","doi":"10.1007/s11075-019-00870-z","DOIUrl":"https://doi.org/10.1007/s11075-019-00870-z","url":null,"abstract":"","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"3 1","pages":"1409-1445"},"PeriodicalIF":0.0,"publicationDate":"2020-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82416496","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 improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in $mathbb {R}^{n}$ 计算$mathbb {R}^{n}$中有限点集凸包的礼品包装算法的有效改进
Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2020-03-21 DOI: 10.1007/s11075-020-00873-1
Thanh An Phan, Nam-Dung Hoàng, Nguyen Kieu Linh
{"title":"An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in $mathbb {R}^{n}$","authors":"Thanh An Phan, Nam-Dung Hoàng, Nguyen Kieu Linh","doi":"10.1007/s11075-020-00873-1","DOIUrl":"https://doi.org/10.1007/s11075-020-00873-1","url":null,"abstract":"","PeriodicalId":91954,"journal":{"name":"Proceedings. International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"35 1","pages":"1499-1518"},"PeriodicalIF":0.0,"publicationDate":"2020-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83129287","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
下一页 尾页
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学术官方微信