2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)最新文献

筛选
英文 中文
A Graph Theoretical Approach for Testing Binomiality of Reversible Chemical Reaction Networks 检验可逆化学反应网络二项性的图论方法
Hamid Rahkooy, Cristian Vargas Montero
{"title":"A Graph Theoretical Approach for Testing Binomiality of Reversible Chemical Reaction Networks","authors":"Hamid Rahkooy, Cristian Vargas Montero","doi":"10.1109/SYNASC51798.2020.00027","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00027","url":null,"abstract":"We study binomiality of the steady state ideals of chemical reaction networks. Considering rate constants as indeterminates, the concept of unconditional binomiality has been introduced and an algorithm based on linear algebra has been proposed in a recent work for reversible chemical reaction networks, which has a polynomial time complexity upper bound on the number of species and reactions. In this article, using a modified version of species-reaction graphs, we present an algorithm based on graph theory which performs by adding and deleting edges and changing the labels of the edges in order to test unconditional binomiality. We have implemented our graph theoretical algorithm as well as the linear algebra one in Maple and made experiments on biochemical models. Our experiments show that the performance of the graph theoretical approach is similar to or better than the linear algebra approach, while it is drastically faster than Gröbner basis and quantifier elimination methods.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117119558","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
Extractive Summarization using Cohesion Network Analysis and Submodular Set Functions 基于内聚网络分析和子模集函数的抽取摘要
Valentin Sergiu Cioaca, M. Dascalu, D. McNamara
{"title":"Extractive Summarization using Cohesion Network Analysis and Submodular Set Functions","authors":"Valentin Sergiu Cioaca, M. Dascalu, D. McNamara","doi":"10.1109/SYNASC51798.2020.00035","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00035","url":null,"abstract":"Numerous approaches have been introduced to automate the process of text summarization, but only few can be easily adapted to multiple languages. This paper introduces a multilingual text processing pipeline integrated in the open-source ReaderBench framework, which can be retrofit to cover more than 50 languages. While considering the extensibility of the approach and the problem of missing labeled data for training in various languages besides English, an unsupervised algorithm was preferred to perform extractive summarization (i.e., select the most representative sentences from the original document). Specifically, two different approaches relying on text cohesion were implemented: a) a graph-based text representation derived from Cohesion Network Analysis that extends TextRank, and b) a class of submodular set functions. Evaluations were performed on the DUC dataset and use as baseline the implementation of TextRank from Gensim. Our results using the submodular set functions outperform the baseline. In addition, two use cases on English and Romanian languages are presented, with corresponding graphical representations for the two methods.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"103 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114134077","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
Deep Visual Domain Adaptation 深度视觉域适应
G. Csurka
{"title":"Deep Visual Domain Adaptation","authors":"G. Csurka","doi":"10.1109/SYNASC51798.2020.00013","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00013","url":null,"abstract":"Domain adaptation (DA) aims at improving the performance of a model on target domains by transferring the knowledge contained in different but related source domains. With recent advances in deep learning models which are extremely data hungry, the interest for visual DA has significantly increased in the last decade and the number of related work in the field exploded. The aim of this paper, therefore, is to give a comprehensive overview of deep domain adaptation methods for computer vision applications. First, we detail and compared different possible ways of exploiting deep architectures for domain adaptation. Then, we propose an overview of recent trends in deep visual DA. Finally, we mention a few improvement strategies, orthogonal to these methods, that can be applied to these models. While we mainly focus on image classification, we give pointers to papers that extend these ideas for other applications such as semantic segmentation, object detection, person re-identifications, and others.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130658086","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}
引用次数: 183
Lung Tumor Segmentation Accelerated by CUDA CUDA加速肺肿瘤分割
Sorin Valcan, Mihail Gaianu
{"title":"Lung Tumor Segmentation Accelerated by CUDA","authors":"Sorin Valcan, Mihail Gaianu","doi":"10.1109/SYNASC51798.2020.00047","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00047","url":null,"abstract":"In the last few years the research done in automatising of medical diagnosis systems have increased significantly despite the fact that it is a slow process to gain trust in such a domain where every detail can make the difference between life and death. Lots of methods based on classic programmable algorithms and machine learning methods gave very good results in lung segmentation and tumor segmentation tasks which can lead to a big increase in early prevention of such dangerous diseases. The goal of this paper is to prove that a classic programmable algorithm can detect lung tumors on CT scans with very good precision and can run as fast as a neural network. To achieve it we implemented a segmentation algorithm using the CUDA API and managed to obtained important results in both precision and speed of detection.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134564700","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 analysis of aggregated coupling's suitability for software defect prediction 聚合耦合对软件缺陷预测的适用性分析
Diana-Lucia Miholca, Zsuzsanna Onet-Marian
{"title":"An analysis of aggregated coupling's suitability for software defect prediction","authors":"Diana-Lucia Miholca, Zsuzsanna Onet-Marian","doi":"10.1109/SYNASC51798.2020.00032","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00032","url":null,"abstract":"Software Defect Prediction is an important problem during the development of a software system, because it helps to focus the testing effort on those parts of the system which have a high probability of being defective. It is also well-researched, there being many papers presenting Machine Learning-based prediction models for this problem. But most of them use the same object-oriented structural software metrics as features. In this paper we investigate the impact of aggregated coupling, which combines structural and conceptual coupling, on software defects proneness. In this regard, we present three software metrics suites derived from both structural and conceptual coupling and analyze how their different combinations influence the performance of software defect prediction models. We analyze the relative performance of the models when using features extracted with LSI versus Doc2Vec in conjunction with Cosine versus Euclidean similarity for computing the conceptual coupling. The results suggest that all these features are complementary and their usage improves the performance of the machine learning models.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128701342","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}
引用次数: 4
Optimizing Deep Learning Models for Object Detection 优化对象检测的深度学习模型
Calin-George Barburescu, Gabriel Iuhasz
{"title":"Optimizing Deep Learning Models for Object Detection","authors":"Calin-George Barburescu, Gabriel Iuhasz","doi":"10.1109/SYNASC51798.2020.00051","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00051","url":null,"abstract":"Deep learning models for object detection have gotten larger and larger over the years, spanning from 3.9M trainable parameters for EfficientDet to 209M for the AmoebaNet-based NAS-FPN detector. Different strategies are currently being researched in order to improve the efficiency of deep learning models for object detection, one of which is running the training and inference of the neural network in low precision. Interesting results have been achieved by researchers, starting from the original paradigm of using operators and doing the necessary operations in IEEE single precision (FP32), to achieving similar accuracies of the models using custom minifloat formats (FP8). The results can be pushed even further by using genetic algorithms for hyperparameter tuning, in order to find specific hyperparameter for the FP8 version of the model. In this paper, we will present the results of our experiments utilizing YOLOv3 with hybrid floating-point format (HFP8). One of the experiments in this paper shows how our solution can be used for checking social distancing guidelines which is a very important topic in the current COVID-19 pandemic.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128712851","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
Detecting Individuals High in Neuroticism based on the Color Features of the Facebook Profile Picture 基于Facebook头像颜色特征的高神经质个体检测
D. Dudău, F. Sava, Andrei A. Rusu, Virgil Cervicescu
{"title":"Detecting Individuals High in Neuroticism based on the Color Features of the Facebook Profile Picture","authors":"D. Dudău, F. Sava, Andrei A. Rusu, Virgil Cervicescu","doi":"10.1109/SYNASC51798.2020.00053","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00053","url":null,"abstract":"Previous research has mostly focused on the link between the linguistic and behavioral footprints found on social media on the one hand and personality on the other. Despite the high amount of image-based contents posted and shared online and the valuable implicit information they might conceal about users' preferences and tendencies, the study of visual traces is in its infancy. The goal of the current paper is to test whether the color characteristics of the Facebook profile picture could mirror the level of neuroticism on a sample of 508 Romanian users. For this purpose, we assessed the classification performance of four machine learning algorithms having as input three sets of visual features: (1) the colorfulness, which indicates how colorful is an image; (2) the proportion of cold colors, along with the mean and standard deviation for saturation and value; (3) the emotional load, defined as pleasure, arousal, and dominance. None of the models showed good accuracy. However, this paper contributes to the literature by being part of a line of research that requires development not only in Romania but also worldwide.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121928082","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
SPIKE, an automatic theorem prover — revisited 斯派克,一个自动定理证明者——重新审视
Sorin Stratulat
{"title":"SPIKE, an automatic theorem prover — revisited","authors":"Sorin Stratulat","doi":"10.1109/SYNASC51798.2020.00025","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00025","url":null,"abstract":"SPIKE, an induction-based theorem prover built to reason on conditional theories with equality, is one of the few formal tools able to perform automatically mutual and lazy induction. Designed at the beginning of 1990s, it has been successfully used in many non-trivial applications and served as a prototype for different proof experiments and extensions. The first paper introducing SPIKE is [14], published shortly after the tool was created. The goal of this paper is to highlight and bring together in one spot the major changes supported by SPIKE since then.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123496157","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
AgriSen - A Dataset for Crop Classification AgriSen -一个农作物分类数据集
Teodora Selea, Marius-Florin Pslaru
{"title":"AgriSen - A Dataset for Crop Classification","authors":"Teodora Selea, Marius-Florin Pslaru","doi":"10.1109/SYNASC51798.2020.00049","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00049","url":null,"abstract":"The large amount of collected data in the field of Earth Observation has created the need for automatization in processing and extraction information from it. Thus, deep learning (DL) techniques have gained popularity among the remote sensing community. Agriculture is one of the domains where DL can improve the current state-of-the-art. In this paper, we focus on the task of crop type classification, a key task in the process of assessing the agricultural market and yield. To this purpose, we introduce a new dataset, based on publicly available data (images from satellite Sentinel-2 and annotations from Land Parcel Identification System), to be used for further research in this field.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117186083","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
Fischer-Ladner Closure for Many-Sorted Modal Logic with Application for Operational Semantics 多排序模态逻辑的fisher - ladner闭包及其在操作语义上的应用
Natalia Moanga
{"title":"Fischer-Ladner Closure for Many-Sorted Modal Logic with Application for Operational Semantics","authors":"Natalia Moanga","doi":"10.1109/SYNASC51798.2020.00022","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00022","url":null,"abstract":"In prior work we have developed a many-sorted polyadic modal logic. Progressively adding different operations and binders, we expressed operational semantics, thus enabling us to certify execution. In this paper we prove standard completeness for a many-sorted hybrid modal logic with satisfaction operators and PDL-inspired axioms. In order to do this, we define the Fischer-Ladner closure for our particular system and we prove a variant of the small model property.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127660190","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学术文献互助群
群 号:604180095
Book学术官方微信