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

{"title":"Frontiers of Data-Intensive Compute Algorithms: Sustainable MLOps and Beyond","authors":"","doi":"10.1109/synasc51798.2020.00010","DOIUrl":"https://doi.org/10.1109/synasc51798.2020.00010","url":null,"abstract":"","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"77 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":"133172214","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}

{"title":"The Driver's Attention Level","authors":"Ionut-Adrian Tarba, Mihail Gaianu, Sebastian-Aurelian Ștefănigă","doi":"10.1109/SYNASC51798.2020.00048","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00048","url":null,"abstract":"Road accidents are directly proportional to the number of cars on the market. Without car safety systems, this number will keep rising. The main factor for the accidents are drowsiness and fatigue. These can be detected by analysing images with the driver so, an example of a driver monitoring system may include a monitoring camera, mounted in front of the driver. A method based on machine learning and computer vision can be a solution to solve the problem of driver safety. The objectives of our work includes an analysis of different approaches of driver monitoring systems and the implementation of a system based on convolutional neural networks which analyze the images coming from a monochrome infrared monitoring camera placed in front of the driver seat. The goal of this work is to decide if the driver is attentive or not (attentive) on the road. Our research was done by implementing a classifier based on AlexNet architecture and return one of the 6 attention classed. To improve the system accuracy, the face was detected using DNN Face Detector (using OpenCV approach). The final system is able to detect when the driver is not paying attention to the road, based on existing test data.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"23 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":"121613576","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}

{"title":"Cohesion Network Analysis: Customized Curriculum Management in Moodle","authors":"Gabriel Gutu-Robu, Darius Mihai, M. Dascalu, M. Cărăbaş, Stefan Trausan-Matu, Sunhea Choi, K. Godfrey, B. Brands, B. Koletzko","doi":"10.1109/SYNASC51798.2020.00037","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00037","url":null,"abstract":"Learning Management Systems frequently act as platforms for online content which is usually structured hierarchically into modules and lessons to ease navigation. However, the volume of information may be overwhelming, or only part of the lessons may be relevant for an individual; thus, the need for customized curricula emerges. We introduce a Moodle plugin developed to help learners customize their curriculum to best fit their learning needs by relying on specific filtering criteria and semantic relatedness. For this experiment, a Moodle instance was created for doctors working in the field of nutrition in early life. The platform includes 78 lessons tackling a wide variety of topics, organized into five modules. Our plugin enables users to specify basic filtering criteria, including their field of expertise, topics of interest from a predefined taxonomy, or expected themes (e.g., background knowledge, practice & counselling, or guidelines) for a preliminary pre-screening of lessons. In addition, learners can also provide a description in natural language of their learning interests. This text is compared with each lesson's description using Cohesion Network Analysis, and lessons are selected above an experimentally set threshold. Our approach also takes into account prior knowledge requirements, and may suggest lessons for further reading. Overall, the plugin covers the management of the entire course lifecycle, namely: a) creating a customized curriculum; b) tracking the progress of completed lessons; c) generating completion certificates with corresponding CME points.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"24 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":"128649829","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}

{"title":"Towards Efficient Governance In Distributed Ledger Systems Using High-Performance Computational Nodes","authors":"Togoe Nicolae-Bogdan-Cristian, Spataru Alexe Luca, Ciprian-Petrisor Pungila","doi":"10.1109/SYNASC51798.2020.00054","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00054","url":null,"abstract":"Due to increasing popularity in distributed ledger systems and the increasing demand of a stable model of a blockchain, fitting both for the development of IoT (Internet of Things) and DApps(Decentralized Applications), the current generation of blockchain needs to solve its main problems ranging from scalability to security and to bring improvements, in order to fit the real-world needs of society nowadays. One of many solutions brought by current prospective blockchains is a form of governance through different types of nodes, usually equipped with more computational resources, that have a more important significance in the network. In this paper, we tried to showcase the applicability of democratic governance in the blockchain ecosystem through the use of supernodes, in order to solve some of the current dilemmas. Despite the multitude of the use-cases, we will focus on four that show great potential in improving the blockchain technology, by outlining both their positive and negative points. Besides that, current blockchains that have a form of governance will be analyzed by examining the use-cases of the supernodes as well as the benefits and negative aspects they give to the ecosystem.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"18 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":"121517087","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}

{"title":"Multi-Agent Recommendation and Aspect Level Sentiment Analysis in B2B CRM Systems","authors":"Doru Rotovei, V. Negru","doi":"10.1109/SYNASC51798.2020.00046","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00046","url":null,"abstract":"In today's world of big data, multi-tenant cloud Customer Relationship Management Systems with an ever increasing pressure to customize offerings for each prospect, there is a need for distributed problem solving that can help salespeople win sales using data driven recommendations. With this work we are proposing a Decision Support System constructed as a multi-agent architecture for Business to Business Customer Relationship Management Systems that can guide salespeople during the conversion of a prospect into a client. The implementation and the results using real-world CRM data are presented and discussed in this paper.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"508 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133356262","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}

{"title":"Generating Minimal Unsatisfiable SAT Instances from Strong Digraphs","authors":"Gábor Kusper, Tamás Balla, C. Biró, T. Tajti, Zijian Győző Yang, Imre Baják","doi":"10.1109/SYNASC51798.2020.00024","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00024","url":null,"abstract":"We present a model generator which generates SAT problems from digraphs. There are a few restrictions on the input digraphs. There must be no self-loops, and its vertices must be Boolean variables or labeled by distinct Boolean variables. We call such digraphs communication graphs. The model is pretty straightforward: if the communication graph contains the edges ($a, b$) and ($a, c$), and there is no other edge from $a$, then this is encoded by the clause: ${neg a, b, c}$. The intuition is that $a$ can send a message to $b$ or $c$. We have to represent all cycles as well. If ($a, b, c, a$) is a cycle with the set of exit points ${d, e}$ in the input communication graph, then it is encoded by the clause: ${neg a,neg b,neg c, d, e}$, The intuition is the following: if there is a message in the cycle, then it has to leave the cycle and we have to be sent to $d$ or $e$. We call this model as the weak model of communication graphs. We show that the weak model is a Black-and-White SAT problem if and only if the input is a strongly connected communication graph. We prove also that all clauses in such models are independent. From this we obtain that a weak model generated from a strong digraph is a minimal unsatisfiable SAT instance if we add to it the black and the white clauses, which are the only solutions of a Black-and-White SAT problems. Minimal unsatisfiable SAT instances are one of the hardest unsatisfiable clause sets, so they are interesting from the viewpoint of testing SAT solvers. There are some techniques which generates special minimal unsatisfiable SAT instances from digraphs, see the work of H. Abbasizanjani, and O. Kullmann, but there was no general solution before our work. Although, our solution is a general one, the generation of weak models is difficult because we have to find all cycles, including non-simple cycles. Therefore, we discuss how to create models of digraphs without cycle detection. Finally, we present some test results using state-of-the-art SAT solvers. It seems that these minimal unsatisfiable SAT instances are very difficult for them even with 20 variables.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"24 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":"125635928","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}

{"title":"Knot Coloring as Verification","authors":"Robert W. McGrail, Thuy Trang Nguyen, Mary Sharac Granda","doi":"10.1109/SYNASC51798.2020.00016","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00016","url":null,"abstract":"This work presents the CMK knot coloring software system. CMK is a command-line tool written in SWI-Prolog that computes colorings of three-dimensional knots by finite quandles. The original purpose was to classify knots by certain computational properties. CMK features a predicate that computes knot quandle presentations from braid words. The authors describe the key algorithms. Errors in five braid representations within the Mathematica™ KnotData collection are revealed through CMK.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"18 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":"114946719","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}

{"title":"A Sentiment-based Similarity Model for Recommendation Systems","authors":"Mara Deac-Petrusel, Sergiu Limboi","doi":"10.1109/SYNASC51798.2020.00044","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00044","url":null,"abstract":"Recommendation Systems are tools that interpret the users' preferences in an attempt to generate fitting suggestions. Studies in this domain of research tend to conclude that the numerical user ratings are not powerful enough to truly express the users' preferences. The best way to overcome this is by extending the analysis to other elements provided by the user, such as text-based reviews of items. This data is believed to reveal a deeper understanding of the user's sentiment regarding a certain item. The goal of the proposed paper is to exploit the valuable information offered by the textual reviews, by mixing Sentiment Analysis techniques into the recommendation process. The contributions of this paper bring two major improvements to the traditional $boldsymbol{k}$ Nearest Neighbors collaborative filtering algorithm. As a first step, a sentiment rating approach is developed based on calculated sentiment scores for each item. The resulting sentiment ratings replace the numerical ones in the recommendation process. Next, a sentiment based user similarity measure is defined taking into account three factors of similitude: the attractiveness, relevance, and popularity of reviews and users. Several experimental setups using two different datasets demonstrate that the newly proposed similarity measure outperforms some of the traditional ones and can be successfully used in the recommendation process.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"118 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":"116369901","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}

{"title":"Efficient Parallel Simulations of Wireless Signal Wave Propagation","authors":"Dorin Ioniță, Filip-George Manole, E. Slusanschi","doi":"10.1109/SYNASC51798.2020.00020","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00020","url":null,"abstract":"A common pattern in high performance scientific computing is the structured grid pattern in which one or more elements of a matrix are computed as a stencil operation of other matrix neighbouring elements. Since there are multiple options to efficiently implement this pattern on modern computing architectures, we provide a comparison of the performance of a number of parallel implementations on a multi-core system with GPU capabilities and also on a FPGA embedded inside a SoC. The application used for this case study implements the propagation of wireless signals in a bi-dimensional environment, considering reflections and signal attenuation. The parallel programming paradigms examined in this paper include CUDA, TBB, Rust, OpenMP, and HLS as hardware description paradigm, with CUDA proving to be the fastest implementation.","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":"131774057","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}

{"title":"Increasing the Upper Bound for the EvoMan Game Competition","authors":"Gabriel-Codrin Cojocaru, Sergiu-Andrei Dinu, Eugen Croitoru","doi":"10.1109/SYNASC51798.2020.00045","DOIUrl":"https://doi.org/10.1109/SYNASC51798.2020.00045","url":null,"abstract":"This paper describes a comparison between algorithms for evolving agents able to play the game Evoman. Our team took part in the “Evoman: Game-playing Competition for WCCI 2020”, and won second place; beyond finding a good agent to satisfy the requirements of the competition - which aim at a good ability to generalise -, we have surpassed the existing non-general, best-known upper-bound. We have managed to exceed this upper bound with a Proximal Policy Optimization(PPO) algorithm, by discarding the competition requirements to generalise. We also present our other exploratory attempts: Q-learning, Genetic Algorithms, Particle Swarm Optimisation, and their PPO hybridizations. Finally, we map the behaviour of our algorithm in the space of game difficulty, generating plausible extensions to the existing upper-bound.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"18 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":"123500730","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}