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

2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)最新文献

筛选
英文 中文
Extreme Points of the Unit Ball B4 in the Space of Real Polynomials of Degree at most Four with the Supremum Norm 最大范数为4次的实多项式空间中单位球B4的极值点
2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2022-09-01 DOI: 10.1109/SYNASC57785.2022.00013
Jan-Michael Holzinger, Róbert Vajda
{"title":"Extreme Points of the Unit Ball B4 in the Space of Real Polynomials of Degree at most Four with the Supremum Norm","authors":"Jan-Michael Holzinger, Róbert Vajda","doi":"10.1109/SYNASC57785.2022.00013","DOIUrl":"https://doi.org/10.1109/SYNASC57785.2022.00013","url":null,"abstract":"Denote by P<inf>n</inf> the space of real polynomials p of degree at most n equipped with the sup norm on the interval I = [−1, 1]. The unit ball B<inf>n</inf> with respect to the sup norm is a compact convex set. Let EB<inf>n</inf> denote the set of the extreme points of B<inf>n</inf>.","PeriodicalId":446065,"journal":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115634081","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
Evaluation of Class Activation Methods for Understanding Image Classification Tasks 理解图像分类任务的类激活方法评价
2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2022-09-01 DOI: 10.1109/SYNASC57785.2022.00033
Andrei Dugaesescu, A. Florea
{"title":"Evaluation of Class Activation Methods for Understanding Image Classification Tasks","authors":"Andrei Dugaesescu, A. Florea","doi":"10.1109/SYNASC57785.2022.00033","DOIUrl":"https://doi.org/10.1109/SYNASC57785.2022.00033","url":null,"abstract":"Machine Learning systems based on deep neural networks are powerful tools but their wide adoption has shown that both the designers and the users of DNN models must fight the barriers of understanding and controlling what has been learnt from data. To make such systems explainable and interpretable, model-specific post-hoc methods have been developed in the literature. This paper presents a family of such methods, Class Activation Mapping, used to explain the image classification process in Convolutional Neural Networks, and achieves a thorough evaluation of these methods. The analysis is done both a qualitative point of view, through the visualization of the activation heatmap of the image, and from a quantitative point of view, through several metrics that try to objectively quantify the relevant parts of an image which contributed to the classification. Several datasets are used to evaluate the discussed methods and a comparison between the obtained results is presented.","PeriodicalId":446065,"journal":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116987994","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
Fully-adaptive Model for Broadcasting with Universal Lists 具有通用列表的广播的完全自适应模型
2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2022-09-01 DOI: 10.1109/SYNASC57785.2022.00024
Saber Gholami, Hovhannes A. Harutyunyan
{"title":"Fully-adaptive Model for Broadcasting with Universal Lists","authors":"Saber Gholami, Hovhannes A. Harutyunyan","doi":"10.1109/SYNASC57785.2022.00024","DOIUrl":"https://doi.org/10.1109/SYNASC57785.2022.00024","url":null,"abstract":"In classical broadcasting, a piece of information must be transmitted to all entities of a network as quickly as possible, starting from a particular member. Since this problem has an enormous number of applications and is proven to be NP-Hard, several models are defined in the literature while trying to simulate real-world situations and relax several constraints. A well-known branch of broadcasting utilizes a universal list throughout the process. That is, once a vertex is informed, it must follow its corresponding list, regardless of the originator and the neighbor it received the message. The problem of broadcasting with universal lists could be categorized into two sub-models: non-adaptive and adaptive. In the latter model, a sender will skip the vertices on its list from which it has received the message, while those vertices will not be skipped in the first model.In this study, we will present another sub-model called fully adaptive. Not only does this model benefit from a significantly better space complexity compared to the classical model, but, as will be proved, it is faster than the two other sub-models. Since the suggested model fits real-world network architectures, we will design optimal broadcast algorithms for well-known interconnection networks such as trees, grids, and cube-connected cycles under the fully-adaptive model. We also present a tight upper bound for tori under the same model.","PeriodicalId":446065,"journal":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114794179","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
Local Optimization Often is Ill-conditioned in Genetic Programming for Symbolic Regression 符号回归遗传规划中的局部优化往往是病态的
2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2022-09-01 DOI: 10.1109/SYNASC57785.2022.00055
G. Kronberger
{"title":"Local Optimization Often is Ill-conditioned in Genetic Programming for Symbolic Regression","authors":"G. Kronberger","doi":"10.1109/SYNASC57785.2022.00055","DOIUrl":"https://doi.org/10.1109/SYNASC57785.2022.00055","url":null,"abstract":"Gradient-based local optimization has been shown to improve results of genetic programming (GP) for symbolic regression. Several state-of-the-art GP implementations use iterative nonlinear least squares (NLS) algorithms such as the Levenberg-Marquardt algorithm for local optimization. The effectiveness of NLS algorithms depends on appropriate scaling and conditioning of the optimization problem. This has so far been ignored in symbolic regression and GP literature. In this study we use a singular value decomposition of NLS Jacobian matrices to determine the numeric rank and the condition number. We perform experiments with a GP implementation and six different benchmark datasets. Our results show that rank-deficient and ill-conditioned Jacobian matrices occur frequently and for all datasets. The issue is less extreme when restricting GP tree size and when using many non-linear functions in the function set.","PeriodicalId":446065,"journal":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127895541","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}
引用次数: 3
Implementation Techniques for Mathematical Model Checking 数学模型检验的实现技术
2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2022-09-01 DOI: 10.1109/SYNASC57785.2022.00011
W. Schreiner
{"title":"Implementation Techniques for Mathematical Model Checking","authors":"W. Schreiner","doi":"10.1109/SYNASC57785.2022.00011","DOIUrl":"https://doi.org/10.1109/SYNASC57785.2022.00011","url":null,"abstract":"We report on the various implementation techniques that the model checker RISCAL applies for the formal verification of mathematical algorithms and theorems in finite models of configurable sizes. Originally, RISCAL was based entirely on semantic evaluation where every syntactic phrase is translated to an executable version of its denotational semantics, which allows to execute algorithms and to evaluate first-order formulas. Later this was extended by a translation of formulas from the RISCAL language to an SMT-LIB logic, which enables their decision by the application of external SMT (satisfiability modulo theories) solvers. Subsequently, semantic evaluation was extended to nondeterministic/concurrent transition systems which facilitates the verification of invariance properties by state space exploration; this was recently generalized to an automatabased technique for verifying system specifications expressed in a LTL (linear temporal logic) extension of the RISCAL formula language. Recently, the checking capabilities of RISCAL have been complemented (via an embedding of the RISCTP theorem proving interface) by capabilities for verifying formulas in domains of arbitrary size with the help of external theorem provers. We briefly sketch these techniques and discuss their purpose and relationship within the general problem area of algorithm specification and verification.","PeriodicalId":446065,"journal":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131113025","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
A web version of Tarski, a system for computing with Tarski formulas and semialgebraic sets 一个网络版本的塔斯基，一个系统计算与塔斯基公式和半代数集
2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2022-09-01 DOI: 10.1109/SYNASC57785.2022.00019
Z. Kovács, Christopher W. Brown, T. Recio, Róbert Vajda
{"title":"A web version of Tarski, a system for computing with Tarski formulas and semialgebraic sets","authors":"Z. Kovács, Christopher W. Brown, T. Recio, Róbert Vajda","doi":"10.1109/SYNASC57785.2022.00019","DOIUrl":"https://doi.org/10.1109/SYNASC57785.2022.00019","url":null,"abstract":"We report on successfully porting and making available online Tarski, a system for computing with Tarski formulas (Boolean combinations of polynomial sign conditions over the real numbers). Tarski provides operations like formula simplification and quantifier elimination, and is able to read and write SMT-LIB syntax. The web version of Tarski was created by using the Emscripten C++ to JavaScript/WebAssembly compiler. A terminal-based interpreter is provided via jquery.terminal. Tarski is also available as a JavaScript library. We report on an experimental use in the dynamic geometry software GeoGebra.","PeriodicalId":446065,"journal":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"246 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132649795","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
F-polynomials & Newton polytopes f多项式与牛顿多面体
2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2022-09-01 DOI: 10.1109/SYNASC57785.2022.00017
G. Koshevoy, Denis Mironov
{"title":"F-polynomials & Newton polytopes","authors":"G. Koshevoy, Denis Mironov","doi":"10.1109/SYNASC57785.2022.00017","DOIUrl":"https://doi.org/10.1109/SYNASC57785.2022.00017","url":null,"abstract":"We provide an effective algorithmic method for computation of Gross-Keel-Hacking-Kontsevich potential, Fpolynomials and Bernstein-Kazhdan decoration function and it’s complexity bounds. For simply laced Lie algebras we make conjecture and provide experimental evidence that Newton polytopes for Gross-Keel-Hacking-Kontsevich potential do not contain any interior lattice points.","PeriodicalId":446065,"journal":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127633744","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
Message from the Program Chairs 来自项目主席的信息
2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2022-09-01 DOI: 10.1109/SAINT.2006.44
{"title":"Message from the Program Chairs","authors":"","doi":"10.1109/SAINT.2006.44","DOIUrl":"https://doi.org/10.1109/SAINT.2006.44","url":null,"abstract":"The papers in this volume were presented at the 2006 International Symposium on Applications and the Internet (SAINT2006), held in Phoenix, Arizona, U.S.A., January 23-27, 2006. The technical papers were selected from 99 submissions, of which 41 were accepted. Of the 41, 33 were accepted as regular papers and the remaining 8 as short papers. The thematic topics range from: Flow Control and Analysis; Application Technology; Architecture and Network Systems; Communications and Configurations; Pervasive, Mobile and Embedded Systems; Implementation, Protocols, and Routing; Search, Allocation, and Verification techniques; QoS, Algorithms, and VoIP; Design, Ontologies, and Data Mining; and IPv6, Ad-hoc and Sensor Networks. These topics cover the underpinnings of Internet Applications and emerging technologies.","PeriodicalId":446065,"journal":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115764900","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
Machine Learning Models to Predict Soil Moisture for Irrigation Schedule 预测灌溉计划土壤湿度的机器学习模型
2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2022-09-01 DOI: 10.1109/SYNASC57785.2022.00043
Md Nahin Islam, D. Logofătu
{"title":"Machine Learning Models to Predict Soil Moisture for Irrigation Schedule","authors":"Md Nahin Islam, D. Logofătu","doi":"10.1109/SYNASC57785.2022.00043","DOIUrl":"https://doi.org/10.1109/SYNASC57785.2022.00043","url":null,"abstract":"The agriculture industry must alter its operations in the context of climate change. Farmers can plan their irrigation operations more effectively and efficiently with the exact measurement and forecast of moisture content in their fields. Sensor-based irrigation and machine learning algorithms have the potential to facilitate farmers with significantly effective water management solutions. However, today’s machine learning methods based on sensor data necessitate a huge quantity of data for effective training, which poses a number of challenges including affordability, battery life, internet availability, evaporation issues, and other factors. The purpose of this report is to find an efficient machine learning model by doing metric evaluation and comparing the R-squared value, that can predict soil humidity within a certain crop field scenario for the next couple of days using historical data.","PeriodicalId":446065,"journal":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129281940","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
On Measuring the Dissimilarity between Biological Sequences 生物序列间差异性的测量
2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2022-09-01 DOI: 10.1109/SYNASC57785.2022.00067
Alina Carunta, Mihai Plesu
{"title":"On Measuring the Dissimilarity between Biological Sequences","authors":"Alina Carunta, Mihai Plesu","doi":"10.1109/SYNASC57785.2022.00067","DOIUrl":"https://doi.org/10.1109/SYNASC57785.2022.00067","url":null,"abstract":"The antimicrobial resistance (AMR) of bacteria to antibiotics is tightly connected with their genetic structure changes. Many methods belonging to various disciplines are applied to analyze these genetic changes. The genes involved in AMR undergo different changes. These changes can be analyzed using distances between different variants (alleles) of a gene. This paper aims to study the dissimilarity between different variants of the sul2 gene using the Levenshtein distance between the corresponding DNA sequences, a distance based on binary representation and the distance induces by the global alignment scores computed using with the Needleman-Wunsch algorithm.","PeriodicalId":446065,"journal":{"name":"2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127649195","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
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信