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

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing 2020年第22届科学计算符号和数值算法国际研讨会

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2020-09-01 DOI: 10.1109/synasc51798.2020.00002

引用次数: 0

Recent results on the Lambert W function 关于Lambert W函数的最新结果

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2020-09-01 DOI: 10.1109/SYNASC51798.2020.00059

T. J. Ayoub, K. Basu, D. J. Jeffrey

引用次数: 0

Should I trust a deep learning condition monitoring prediction? 我应该相信深度学习状态监测预测吗?

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2020-09-01 DOI: 10.1109/SYNASC51798.2020.00038

D. Onchis

引用次数: 3

Results on graceful chromatic number for particular graphs 特定图的优美色数的结果

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2020-09-01 DOI: 10.1109/SYNASC51798.2020.00028

Camelia Obreja

{"title":"Results on graceful chromatic number for particular graphs","authors":"Camelia Obreja","doi":"10.1109/SYNASC51798.2020.00028","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00028","url":null,"abstract":"In graph theory, graph colorings are a major area of study. Graph colorings involve the constrained assignment of labels (colors) to vertices or edges. There are many types of colorings defined in the literature, the most common being the proper vertex coloring. The proper vertex $k$-coloring is defined as a vertex coloring from a set of $k$ colors such that no two adjacent vertices have the same color. In this paper, we focus on a variant of the proper vertex $k$-coloring problem, termed graceful coloring. A graceful $k$-coloring of an undirected connected graph $G$ is a proper vertex coloring using $k$ colors, that induces a proper edge coloring, where the color for an edge ($u, v$) is the absolute value of the difference between the colors assigned to vertices $u$ and $v$. The minimum $k$ for which a graph $G$ has a graceful $k$-coloring is termed the graceful chromatic number of the graph. In a previous work (Mincu, Obreja, Popa, SYNASC 2019) we find the graceful chromatic number for some well-known graphs and classes of graphs, such as diamond graph, Petersen graph, Moser spindle graph, Goldner-Harary graph, friendship graphs, fan graphs, and others. In this study, we continue the investigation and find the graceful chromatic number for other well-known individual graphs, like Dürer graph, Heawood graph, Möbius-Kantor graph, Nauru graph, Tietze's graph, Golomb graph and classes of graphs, like cactus, Gear, web graphs, etc. In a previous work (Mincu, Obreja, Popa, SYNASC 2019) we find the graceful chromatic number for some well-known graphs and classes of graphs, such as diamond graph, Petersen graph, Moser spindle graph, Goldner-Harary graph, friendship graphs, fan graphs, and others. In this study, we continue the investigation and find the graceful chromatic number for other well-known individual graphs, like Dürer graph, Heawood graph, Möbius-Kantor graph, Nauru graph, Tietze's graph, Golomb graph and classes of graphs, like cactus, Gear, web graphs, etc.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"169 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":"115466714","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

A general construction for generating pseudorandom sequences using the digit expansion of real functions 利用实数函数的数字展开生成伪随机序列的一般构造

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2020-09-01 DOI: 10.1109/SYNASC51798.2020.00019

Norbert Tihanyi, B. Borsos

引用次数: 1

Semantic Image Inpainting via Maximum Likelihood 基于最大似然的语义图像修复

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2020-09-01 DOI: 10.1109/SYNASC51798.2020.00034

Sebastian Ciobanu, Liviu Ciortuz

{"title":"Semantic Image Inpainting via Maximum Likelihood","authors":"Sebastian Ciobanu, Liviu Ciortuz","doi":"10.1109/SYNASC51798.2020.00034","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00034","url":null,"abstract":"Current approaches involve deep learning in solving an image inpainting task. We propose a meta-algorithm in which we can set a probabilistic distribution on images. The set distribution can be a classic one, e.g. Normal distribution, or a modern one, e.g. PixelCNN++. Our first observation is relatively unexpected: if a learnt distribution generates reasonable images, then this does not make it a good candidate for inpainting via our proposed algorithm and vice-versa (if a learnt distribution gives reasonable results on image inpainting via our algorithm, then this does not make it is a good candidate for sampling a new image). Our second observation is that although the visual results of the state-of-the-art method are superior to ours, the training time for our method is lower. Hence, one can experiment faster with our method to see, for example, if the desired inpainting is learnable. Moreover, using a specific distribution, our algorithm can be trained also on high-quality RGB images, like 1024 times 1024 pixels. As for the experiments, we included visual results and some quantitative comparisons. The Google Colab notebook with the code and the demo is available at: https://github.com/aciobanusebi/mle-inpainting","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":"125984300","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

What's Been Happening in the Romanian News Landscape? A Detailed Analysis Grounded in Natural Language Processing Techniques 罗马尼亚的新闻版图发生了什么?基于自然语言处理技术的详细分析

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2020-09-01 DOI: 10.1109/SYNASC51798.2020.00040

Cosmin Titiliuc, Stefan Ruseti, M. Dascalu

引用次数: 0

Gender Issues in Computer Science: Lessons Learnt and Reflections for the Future 计算机科学中的性别问题:经验教训和对未来的思考

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2020-09-01 DOI: 10.1109/SYNASC51798.2020.00014

M. L. Jaccheri, Cristina Pereira, Swetlana Fast

{"title":"Gender Issues in Computer Science: Lessons Learnt and Reflections for the Future","authors":"M. L. Jaccheri, Cristina Pereira, Swetlana Fast","doi":"10.1109/SYNASC51798.2020.00014","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00014","url":null,"abstract":"Women are underrepresented in Computer Science disciplines at all levels, from undergraduate and graduate studies to participation and leadership in academia and industry. Increasing female representation in the field is a grand challenge for academics, policymakers, and society. Although the problem has been addressed for many years, progress has been difficult to be measured and compared across countries and institutions, and has been invariably slow, despite all the momentum and impulse for change taking place across several countries. Therefore, it is important to reflect on knowledge, experiences, successes, and challenges of existing policies, initiatives and interventions. The main goal of this paper is to provide an overview of several initiatives, studies, projects, and their outcomes. It contributes to building a body of knowledge about gender aspects in several areas: research, education, projects, networks and resources. This paper is mainly based on discussions in working groups and the material collected for and during a series of talks on the topic held by the first author and by feedback received by the community. This paper provides the academic community, policymakers, industry and other stakeholders with numerous examples of best practices, as well as studies and recommendations on how to address key challenges about attracting, retaining, encouraging, and inspiring women to pursue a career in Computer Science. Future work should address the issue in a systematic and research based way.","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":"122903998","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}

引用次数: 15

Business Decisions Support using Sentiment Analysis in CRM Systems 在CRM系统中使用情感分析支持业务决策

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2020-09-01 DOI: 10.1109/SYNASC51798.2020.00057

Bashar Al Asaad, Doru Rotovei

引用次数: 0

Numerical simulation algorithm for fractional-order systems implemented in CUDA 在CUDA中实现分数阶系统的数值模拟算法

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) Pub Date : 2020-09-01 DOI: 10.1109/SYNASC51798.2020.00021

F. Rosu, C. Bonchis, E. Kaslik

引用次数: 2