Pub Date : 2018-09-01DOI: 10.1109/SYNASC.2018.00027
Irina Maria Artinescu, C. Boldea
We propose in this paper a new method of image reconstruction by inpainting small pattern over a damaged scratch, using a variant of the parallel projection method (PPM) for solving the convex feasibility problem. The method is based on a fragmentation of the damaged region in small quadrilaterals and reconstruct the image by filling the scratch with PPM generated pattern. The algorithm is fast and directly parallelizable.
{"title":"An Image Inpainting Technique Based on Parallel Projection Methods","authors":"Irina Maria Artinescu, C. Boldea","doi":"10.1109/SYNASC.2018.00027","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00027","url":null,"abstract":"We propose in this paper a new method of image reconstruction by inpainting small pattern over a damaged scratch, using a variant of the parallel projection method (PPM) for solving the convex feasibility problem. The method is based on a fragmentation of the damaged region in small quadrilaterals and reconstruct the image by filling the scratch with PPM generated pattern. The algorithm is fast and directly parallelizable.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115684595","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}
Pub Date : 2018-09-01DOI: 10.1109/SYNASC.2018.00038
L. Capra, Matteo Camilli
Despite Petri Nets represent a sound and expressive formal model for distributed discrete-event systems, they cannot specify in a natural way structural changes caused by adaptation procedures that are likely to occur in distributed applications running in a dynamically changing environment. In this paper a framework based on the Symmetric Nets formalism (SN) is proposed, able to emulate the behaviour of any Place/Transition (P/T) system, and safely implement changes to system's layout during execution. The advantage of this proposal is twofold: (i) the intrinsic features of SN formalism (and its timed extension) for efficient (performance) analysis can be exploited, (ii) powerful off-the-shelf software tools, that natively support Symmetric Nets, can ease both the modelling and the analysis phases. The limited data abstraction capabilities of SN require the use of a highnumber of non observable transitions to simulate the atomic firing of Petri nets' transitions. This gives rise to complexity issues in the model analysis, that are thoroughly discussed and (partially) faced.
{"title":"A Symmetric Nets Emulator for Adaptive P/T Nets","authors":"L. Capra, Matteo Camilli","doi":"10.1109/SYNASC.2018.00038","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00038","url":null,"abstract":"Despite Petri Nets represent a sound and expressive formal model for distributed discrete-event systems, they cannot specify in a natural way structural changes caused by adaptation procedures that are likely to occur in distributed applications running in a dynamically changing environment. In this paper a framework based on the Symmetric Nets formalism (SN) is proposed, able to emulate the behaviour of any Place/Transition (P/T) system, and safely implement changes to system's layout during execution. The advantage of this proposal is twofold: (i) the intrinsic features of SN formalism (and its timed extension) for efficient (performance) analysis can be exploited, (ii) powerful off-the-shelf software tools, that natively support Symmetric Nets, can ease both the modelling and the analysis phases. The limited data abstraction capabilities of SN require the use of a highnumber of non observable transitions to simulate the atomic firing of Petri nets' transitions. This gives rise to complexity issues in the model analysis, that are thoroughly discussed and (partially) faced.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129764760","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}
Pub Date : 2018-09-01DOI: 10.1109/SYNASC.2018.00051
Marilena Lupascu, Dragos Gavrilut, D. Lucanu
In the ever changing malware landscape, office applications with support for VBA (Visual Basic for Applications) scripts have become an important piece of the puzzle, especially since they are one of the most effective email-based delivery method for new threats. This paper presents the research on approximatively 200 such cyber-attacks emphasizing social engineering techniques used, obfuscation methods applied and post-exploitation behavior.
在不断变化的恶意软件环境中，支持VBA (Visual Basic for applications)脚本的办公应用程序已经成为难题的重要组成部分，特别是因为它们是针对新威胁的最有效的基于电子邮件的传递方法之一。本文介绍了对大约200个这样的网络攻击的研究，强调使用的社会工程技术，应用的混淆方法和开发后行为。
{"title":"An Overview of Obfuscation Techniques used by Malware in Visual Basic for Application Scripts","authors":"Marilena Lupascu, Dragos Gavrilut, D. Lucanu","doi":"10.1109/SYNASC.2018.00051","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00051","url":null,"abstract":"In the ever changing malware landscape, office applications with support for VBA (Visual Basic for Applications) scripts have become an important piece of the puzzle, especially since they are one of the most effective email-based delivery method for new threats. This paper presents the research on approximatively 200 such cyber-attacks emphasizing social engineering techniques used, obfuscation methods applied and post-exploitation behavior.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128862673","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}
Pub Date : 2018-09-01DOI: 10.1109/SYNASC.2018.00046
Flaviu Berbecariu, C. Săcărea, Diana Sotropa
Formal Concept Analysis (FCA) is a prominent field of Applied Mathematics grounded on the formalization of the notions of concept and concept hierarchy. Based on the expressive power of the graphical representation of knowledge clusters as order diagrams, FCA is an expanding field, rooted now mainly in Knowledge Discovery and AI. This paper is devoted to a new idea for concept lattice navigation, based on recommender systems and a local navigation approach. By this we overcome one of the main problems in this field and propose an intelligent navigation assistant through the conceptual hierarchy. At each step, the visualization is limited to a local view consisting of three levels in the concept lattice and a recommender system provides the necessary navigation assistance.
{"title":"Using Recommender Systems to Support Navigation in Concept Lattices","authors":"Flaviu Berbecariu, C. Săcărea, Diana Sotropa","doi":"10.1109/SYNASC.2018.00046","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00046","url":null,"abstract":"Formal Concept Analysis (FCA) is a prominent field of Applied Mathematics grounded on the formalization of the notions of concept and concept hierarchy. Based on the expressive power of the graphical representation of knowledge clusters as order diagrams, FCA is an expanding field, rooted now mainly in Knowledge Discovery and AI. This paper is devoted to a new idea for concept lattice navigation, based on recommender systems and a local navigation approach. By this we overcome one of the main problems in this field and propose an intelligent navigation assistant through the conceptual hierarchy. At each step, the visualization is limited to a local view consisting of three levels in the concept lattice and a recommender system provides the necessary navigation assistance.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124758022","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}
Pub Date : 2018-09-01DOI: 10.1109/SYNASC.2018.00025
A. Balint, S. Balint, Loredana Tanasie
This paper is an axis symmetric 2D description of a single crystal tube growth process by micro-pulling–down (PD) method. The description concerns the following aspects: the inner and outer free surfaces equations and the pressure differences across this free surfaces (section 2.); limits of the pressure differences across the free surfaces (section 3.); static stability of the capillary free surfaces (section 4). In section 5 the above aspects are numerically investigated in the case of the growth of a silicon micro tube of inner radius equal to 4.28x10-3[m] and outer radius equal to 4.72x10-3 [m]. The advantage of this description is that it helps to better understand the dependence of the inner and outer radius size of the tube on the pressure difference across the inner and outer free surface respectively, and may help the automation of manufacturing.
{"title":"An Axis Symmetric 2D Description of the Growth Process of a Single Crystal Hollow Tube Grown from the Melt by Pulling Down Method","authors":"A. Balint, S. Balint, Loredana Tanasie","doi":"10.1109/SYNASC.2018.00025","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00025","url":null,"abstract":"This paper is an axis symmetric 2D description of a single crystal tube growth process by micro-pulling–down (PD) method. The description concerns the following aspects: the inner and outer free surfaces equations and the pressure differences across this free surfaces (section 2.); limits of the pressure differences across the free surfaces (section 3.); static stability of the capillary free surfaces (section 4). In section 5 the above aspects are numerically investigated in the case of the growth of a silicon micro tube of inner radius equal to 4.28x10-3[m] and outer radius equal to 4.72x10-3 [m]. The advantage of this description is that it helps to better understand the dependence of the inner and outer radius size of the tube on the pressure difference across the inner and outer free surface respectively, and may help the automation of manufacturing.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120998213","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}
Pub Date : 2018-09-01DOI: 10.1109/SYNASC.2018.00053
D. Mitrea, L. Tamás
In this research paper we aim to improve the functions of the Baxter robot [1] through data mining methods. Our case study belongs to the robotics domain, integrated in the context of Manufacturing Execution Systems (MES) and Product Lifecycle Management (PLM). The experimental data includes the parameters registered during the activities of the robot, such as the movement of the left or right arm and refers to collision events. The state of the art concerning the data mining methods is described, then our solution is detailed by presenting the approached data mining techniques. The adopted methods are detailed and then the experimental results are presented and discussed. Finally, the conclusions and further development possibilities are formulated, highlighting the utility of the adopted data mining methods, based on our previously stated objectives. An accuracy above 98% was achieved concerning the validation of our model.
{"title":"MES Specific Data Analysis. Case Study with the Baxter Robot","authors":"D. Mitrea, L. Tamás","doi":"10.1109/SYNASC.2018.00053","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00053","url":null,"abstract":"In this research paper we aim to improve the functions of the Baxter robot [1] through data mining methods. Our case study belongs to the robotics domain, integrated in the context of Manufacturing Execution Systems (MES) and Product Lifecycle Management (PLM). The experimental data includes the parameters registered during the activities of the robot, such as the movement of the left or right arm and refers to collision events. The state of the art concerning the data mining methods is described, then our solution is detailed by presenting the approached data mining techniques. The adopted methods are detailed and then the experimental results are presented and discussed. Finally, the conclusions and further development possibilities are formulated, highlighting the utility of the adopted data mining methods, based on our previously stated objectives. An accuracy above 98% was achieved concerning the validation of our model.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128088215","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}
Pub Date : 2018-09-01DOI: 10.1109/SYNASC.2018.00050
J. Davenport
There is little doubt that, in the minds of most symbolic computation researchers, the ideal paper consists of a problem statement, a new algorithm, a complexity analysis and preferably a few validating examples. There are many such great papers. This paradigm has served computer algebra well for many years, and indeed continues to do so where it is applicable. However, it is much less applicable to sparse problems, where there are many NP-hardness results, or to many problems coming from algebraic geometry, where the worst-case complexity seems to be rare. We argue that, in these cases, the field should take a leaf out of the practices of the SAT-solving community, and adopt systematic benchmarking, and benchmarking contests, as a way measuring (and stimulating) progress. This would involve a change of culture.
{"title":"The Rôle of Benchmarking in Symbolic Computation (Position Paper)","authors":"J. Davenport","doi":"10.1109/SYNASC.2018.00050","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00050","url":null,"abstract":"There is little doubt that, in the minds of most symbolic computation researchers, the ideal paper consists of a problem statement, a new algorithm, a complexity analysis and preferably a few validating examples. There are many such great papers. This paradigm has served computer algebra well for many years, and indeed continues to do so where it is applicable. However, it is much less applicable to sparse problems, where there are many NP-hardness results, or to many problems coming from algebraic geometry, where the worst-case complexity seems to be rare. We argue that, in these cases, the field should take a leaf out of the practices of the SAT-solving community, and adopt systematic benchmarking, and benchmarking contests, as a way measuring (and stimulating) progress. This would involve a change of culture.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128117545","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}
Pub Date : 2018-09-01DOI: 10.1109/synasc.2018.00010
{"title":"In Memoriam - Professor Stefan Maruster (September 5, 1937 - December 24, 2017)","authors":"","doi":"10.1109/synasc.2018.00010","DOIUrl":"https://doi.org/10.1109/synasc.2018.00010","url":null,"abstract":"","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122500817","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}
Pub Date : 2018-09-01DOI: 10.1109/SYNASC.2018.00064
Bashar Al Asaad, Madalina Erascu
The word post-truth was considered by Oxford Dictionaries Word of the Year 2016. The word is an adjective relating to or denoting circumstances in which objective facts are less influential in shaping public opinion than appeals to emotion and personal belief. This leads to misinformation and problems in society. Hence, it is important to make effort to detect these facts and prevent them from spreading. In this paper we propose machine learning techniques, in particular supervised learning, for fake news detection. More precisely, we used a dataset of fake and real news to train a machine learning model using Scikit-learn library in Python. We extracted features from the dataset using text representation models like Bag-of-Words, Term Frequency-Inverse Document Frequency (TF-IDF) and Bi-gram frequency. We tested two classification approaches, namely probabilistic classification and linear classification on the title and the content, checking if it is clickbait/nonclickbait, respectively fake/real. The outcome of our experiments was that the linear classification works the best with the TF-IDF model in the process of content classification. The Bi-gram frequency model gave the lowest accuracy for title classification in comparison with Bag-of-Words and TF-IDF.
{"title":"A Tool for Fake News Detection","authors":"Bashar Al Asaad, Madalina Erascu","doi":"10.1109/SYNASC.2018.00064","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00064","url":null,"abstract":"The word post-truth was considered by Oxford Dictionaries Word of the Year 2016. The word is an adjective relating to or denoting circumstances in which objective facts are less influential in shaping public opinion than appeals to emotion and personal belief. This leads to misinformation and problems in society. Hence, it is important to make effort to detect these facts and prevent them from spreading. In this paper we propose machine learning techniques, in particular supervised learning, for fake news detection. More precisely, we used a dataset of fake and real news to train a machine learning model using Scikit-learn library in Python. We extracted features from the dataset using text representation models like Bag-of-Words, Term Frequency-Inverse Document Frequency (TF-IDF) and Bi-gram frequency. We tested two classification approaches, namely probabilistic classification and linear classification on the title and the content, checking if it is clickbait/nonclickbait, respectively fake/real. The outcome of our experiments was that the linear classification works the best with the TF-IDF model in the process of content classification. The Bi-gram frequency model gave the lowest accuracy for title classification in comparison with Bag-of-Words and TF-IDF.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127114776","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}
Pub Date : 2018-09-01DOI: 10.1109/SYNASC.2018.00014
Sylvain Boulmé, Alexandre Maréchal, D. Monniaux, Michaël Périn, Hangfei Yu
The Verified Polyhedra Library operates upon a constraint-only representation of convex polyhedra and provides all common operations (image, pre-image, projection, convex hull, widening, inclusion and equality tests. . . ). Optionally, the soundness of the results is checked by a layer certified in Coq.
{"title":"The Verified Polyhedron Library: an Overview","authors":"Sylvain Boulmé, Alexandre Maréchal, D. Monniaux, Michaël Périn, Hangfei Yu","doi":"10.1109/SYNASC.2018.00014","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00014","url":null,"abstract":"The Verified Polyhedra Library operates upon a constraint-only representation of convex polyhedra and provides all common operations (image, pre-image, projection, convex hull, widening, inclusion and equality tests. . . ). Optionally, the soundness of the results is checked by a layer certified in Coq.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122264177","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：