Pub Date : 2019-09-01DOI: 10.1109/SYNASC49474.2019.00052
D. Dumitru, A. Andreica, L. Dioşan, Z. Bálint
Cellular automata have been widely used for solving the edge detection problem. This paper proposes an algorithm which optimizes cellular automata rules using Particle Swarm Optimization based on an existing method in the literature. Moreover, the method is extended from grayscale to colour images by performing the optimization on each colour channel individually. A discussion on choosing the proper fitness function as well as comparative results with respect to the state-of-the-art are presented. As our algorithm is comparable to the Canny and Sobel edge detectors, it could be used in image segmentation tasks as a subroutine for edge detection.
{"title":"Particle Swarm Optimization of Cellular Automata Rules for Edge Detection","authors":"D. Dumitru, A. Andreica, L. Dioşan, Z. Bálint","doi":"10.1109/SYNASC49474.2019.00052","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00052","url":null,"abstract":"Cellular automata have been widely used for solving the edge detection problem. This paper proposes an algorithm which optimizes cellular automata rules using Particle Swarm Optimization based on an existing method in the literature. Moreover, the method is extended from grayscale to colour images by performing the optimization on each colour channel individually. A discussion on choosing the proper fitness function as well as comparative results with respect to the state-of-the-art are presented. As our algorithm is comparable to the Canny and Sobel edge detectors, it could be used in image segmentation tasks as a subroutine for edge detection.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"12 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116584872","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 : 2019-09-01DOI: 10.1109/SYNASC49474.2019.00025
Roxana E. Sichitiu, M. Frîncu, Ovidiu Vaduvescu
There is an exponential volume of captured images, millions of captures taken every night being processed and scrutinized. Big Data analysis has become essential for the study of the solar system, discovery and orbital knowledge of the asteroids. This analysis often requires more advanced algorithms capable of processing the available data and solve the essential problems in almost real time. One such problem that needs very rapid investigation involves the detection of Near Earth Asteroids(NEAs) and their orbit refinement which should answer the question "will the Earth collide in the future with any hazardous asteroid?". This paper proposes a cloud distributed architecture meant to render near real-time results, focusing on the image stacking techniques aimed to detect very faint moving objects, and pairing of unknown objects with known orbits for asteroid discovery and identification.
{"title":"Digital Tracking Cloud Distributed Architecture for Detection of Faint NEAs","authors":"Roxana E. Sichitiu, M. Frîncu, Ovidiu Vaduvescu","doi":"10.1109/SYNASC49474.2019.00025","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00025","url":null,"abstract":"There is an exponential volume of captured images, millions of captures taken every night being processed and scrutinized. Big Data analysis has become essential for the study of the solar system, discovery and orbital knowledge of the asteroids. This analysis often requires more advanced algorithms capable of processing the available data and solve the essential problems in almost real time. One such problem that needs very rapid investigation involves the detection of Near Earth Asteroids(NEAs) and their orbit refinement which should answer the question \"will the Earth collide in the future with any hazardous asteroid?\". This paper proposes a cloud distributed architecture meant to render near real-time results, focusing on the image stacking techniques aimed to detect very faint moving objects, and pairing of unknown objects with known orbits for asteroid discovery and identification.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117302408","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 : 2019-09-01DOI: 10.1109/SYNASC49474.2019.00041
S. Vitel, Gheorghe Balan, Dumitru-Bogdan Prelipcean
The current threat landscape is diverse and has lately been shifting from the binary executable application to a more light-coded and data-oriented approach. Considering this, the use of Microsoft Office documents in attacks has increased. The number of malicious samples is high and the complexity of evasion techniques is also challenging. The VBA macros are highly used in enterprise environments with benign purposes, so, in terms of detection, the number of false alarms should be close to zero. In this paper we discuss and propose a solution which focuses on keeping the rate of false positives as low as possible and, at the same time, maximizes the detection rate.
{"title":"Improving Detection of Malicious Office Documents Using One-Side Classifiers","authors":"S. Vitel, Gheorghe Balan, Dumitru-Bogdan Prelipcean","doi":"10.1109/SYNASC49474.2019.00041","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00041","url":null,"abstract":"The current threat landscape is diverse and has lately been shifting from the binary executable application to a more light-coded and data-oriented approach. Considering this, the use of Microsoft Office documents in attacks has increased. The number of malicious samples is high and the complexity of evasion techniques is also challenging. The VBA macros are highly used in enterprise environments with benign purposes, so, in terms of detection, the number of false alarms should be close to zero. In this paper we discuss and propose a solution which focuses on keeping the rate of false positives as low as possible and, at the same time, maximizes the detection rate.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114695915","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 : 2019-09-01DOI: 10.1109/SYNASC49474.2019.00014
Tateaki Sasaki
This paper proposes a new method of enhancing Buchberger's algorithm for the lexicographic order (LEX-order) Groebner bases. The idea is to append polynomials to the input system, where we generate polynomials to be appended by computing PRSs (polynomial remainder sequences) of input polynomials and making them close to basis elements by the GCD operation. In order to do so, we first restrict the input system to satisfy three reasonable conditions (we call such systems "healthy"), and we compute redundant PRSs so that the variable-eliminated remainders are not in a triangular form but in a rectangular form; we call the corresponding PRSs "rectangular PRSs (rectPRSs)"; see 2. A for details of rectPRSs. The lowest order element of the LEX-order Groebner basis can be computed from the last set of remainders of rectPRSs and the GCD operation; see [20]. We generate other polynomials to be appended by computing rectPRSs of leading coefficients of mutually similar remainders and converting the order-reduced leading coefficient to a polynomial in the given ideal. By these we are able to compute the second-lowest element of the Groebner basis, too. The research is on-going now. Our method seems promising but it contains many problems, theoretical as well as computational, so we open our research.
{"title":"An Attempt to Enhance Buchberger's Algorithm by Using Remainder Sequences and GCD Operation","authors":"Tateaki Sasaki","doi":"10.1109/SYNASC49474.2019.00014","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00014","url":null,"abstract":"This paper proposes a new method of enhancing Buchberger's algorithm for the lexicographic order (LEX-order) Groebner bases. The idea is to append polynomials to the input system, where we generate polynomials to be appended by computing PRSs (polynomial remainder sequences) of input polynomials and making them close to basis elements by the GCD operation. In order to do so, we first restrict the input system to satisfy three reasonable conditions (we call such systems \"healthy\"), and we compute redundant PRSs so that the variable-eliminated remainders are not in a triangular form but in a rectangular form; we call the corresponding PRSs \"rectangular PRSs (rectPRSs)\"; see 2. A for details of rectPRSs. The lowest order element of the LEX-order Groebner basis can be computed from the last set of remainders of rectPRSs and the GCD operation; see [20]. We generate other polynomials to be appended by computing rectPRSs of leading coefficients of mutually similar remainders and converting the order-reduced leading coefficient to a polynomial in the given ideal. By these we are able to compute the second-lowest element of the Groebner basis, too. The research is on-going now. Our method seems promising but it contains many problems, theoretical as well as computational, so we open our research.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114804661","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 : 2019-09-01DOI: 10.1109/synasc49474.2019.00003
{"title":"[Copyright notice]","authors":"","doi":"10.1109/synasc49474.2019.00003","DOIUrl":"https://doi.org/10.1109/synasc49474.2019.00003","url":null,"abstract":"","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128187066","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 : 2019-09-01DOI: 10.1109/SYNASC49474.2019.00032
Doru Rotovei, V. Negru
In this work, we are proposing a methodology for data-driven decision making using sentiment analysis. The analysis of sentiment is done by text mining the activity notes recorded in Customer Relationship Management Systems used to manage complex sales in business to business environments. We built the sentiment enhanced sales prediction models using Artificial Neural Networks, Support Vector Machines and Random Forests and involving different sentiment features. The approach produced meaningful results with Random Forest obtaining the best improvement compared to a baseline model without sentiment features. The best model showed that new attributes incorporating sentiment information improved the accuracy from a baseline of 85.15% to 89.11 %. This model was used to conduct an analysis and an evaluation of the steps needed to be taken to win a possible losing deal in a real-world business to business customer relationship management system.
{"title":"Data Driven Sales Prediction Using Communication Sentiment Analysis in B2B CRM Systems","authors":"Doru Rotovei, V. Negru","doi":"10.1109/SYNASC49474.2019.00032","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00032","url":null,"abstract":"In this work, we are proposing a methodology for data-driven decision making using sentiment analysis. The analysis of sentiment is done by text mining the activity notes recorded in Customer Relationship Management Systems used to manage complex sales in business to business environments. We built the sentiment enhanced sales prediction models using Artificial Neural Networks, Support Vector Machines and Random Forests and involving different sentiment features. The approach produced meaningful results with Random Forest obtaining the best improvement compared to a baseline model without sentiment features. The best model showed that new attributes incorporating sentiment information improved the accuracy from a baseline of 85.15% to 89.11 %. This model was used to conduct an analysis and an evaluation of the steps needed to be taken to win a possible losing deal in a real-world business to business customer relationship management system.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132712235","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 : 2019-09-01DOI: 10.1109/SYNASC49474.2019.00037
A. Bołtuć, K. Szerszeń
The paper presents identification of material properties in elastoplastic boundary value problems. The direct problem is solved using the parametric integral equation system (PIES), while optimization is performed by the particle swarm optimization method (PSO). PIES is characterized by effective way of modeling of the plastic domain, only by parametric surfaces, without discretization. This makes the proposed approach more favorable (in terms of complexity) than identification using so-called element methods (the finite element method, FEM and the boundary element method, BEM). The paper contains some examples of identification of the yield stress and the plastic modulus in selected elastoplastic problems.
{"title":"Identification of Elastoplastic Material Properties Using PIES and PSO","authors":"A. Bołtuć, K. Szerszeń","doi":"10.1109/SYNASC49474.2019.00037","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00037","url":null,"abstract":"The paper presents identification of material properties in elastoplastic boundary value problems. The direct problem is solved using the parametric integral equation system (PIES), while optimization is performed by the particle swarm optimization method (PSO). PIES is characterized by effective way of modeling of the plastic domain, only by parametric surfaces, without discretization. This makes the proposed approach more favorable (in terms of complexity) than identification using so-called element methods (the finite element method, FEM and the boundary element method, BEM). The paper contains some examples of identification of the yield stress and the plastic modulus in selected elastoplastic problems.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127128435","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 : 2019-09-01DOI: 10.1109/synasc49474.2019.00006
T. Ida, L. Kovács, V. Negru, M. Frîncu, Gabriel Istrate, F. Manea, M. Marin, A. Florea
{"title":"SYNASC 2019 Chairs and Organizing Committees","authors":"T. Ida, L. Kovács, V. Negru, M. Frîncu, Gabriel Istrate, F. Manea, M. Marin, A. Florea","doi":"10.1109/synasc49474.2019.00006","DOIUrl":"https://doi.org/10.1109/synasc49474.2019.00006","url":null,"abstract":"","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127391417","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 : 2019-09-01DOI: 10.1109/SYNASC49474.2019.00016
Sergiu Zaharia, Traian Rebedea, Stefan Trausan-Matu
Applications are one of the most used attack surfaces, and they must be secured at source code level, early in the development phase. Static Analysis Security Testing solutions, able to detect vulnerabilities in source code are limited to the most used programming languages and development frameworks. The proposed method consists of a security scanning solution based on an Intermediate Representation of source code which is loosely coupled with the programming language structure and to the data flow, preserving at the same time the security vulnerability patterns. The ability to identify vulnerable source code snippets in the Intermediate Representation of the original source code is the core idea for this research project. Using loosely coupled control flows and data flows representations of the original source code enables the development of new security scanners, which in the future will be able to evaluate applications written in new and exotic languages.
{"title":"Source Code Vulnerabilities Detection Using Loosely Coupled Data and Control Flows","authors":"Sergiu Zaharia, Traian Rebedea, Stefan Trausan-Matu","doi":"10.1109/SYNASC49474.2019.00016","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00016","url":null,"abstract":"Applications are one of the most used attack surfaces, and they must be secured at source code level, early in the development phase. Static Analysis Security Testing solutions, able to detect vulnerabilities in source code are limited to the most used programming languages and development frameworks. The proposed method consists of a security scanning solution based on an Intermediate Representation of source code which is loosely coupled with the programming language structure and to the data flow, preserving at the same time the security vulnerability patterns. The ability to identify vulnerable source code snippets in the Intermediate Representation of the original source code is the core idea for this research project. Using loosely coupled control flows and data flows representations of the original source code enables the development of new security scanners, which in the future will be able to evaluate applications written in new and exotic languages.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126622187","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 : 2019-09-01DOI: 10.1109/SYNASC49474.2019.00015
Aaron E. Naiman
We discuss building square, integer matrices, such that the Gram–Schmidt process leads to rational orthonormal matrices. We show some interesting properties that arise while searching for integer entries, as well as a process for doing this by direct computation.
{"title":"Rational Gram-Schmidt-Searching vs. Computing","authors":"Aaron E. Naiman","doi":"10.1109/SYNASC49474.2019.00015","DOIUrl":"https://doi.org/10.1109/SYNASC49474.2019.00015","url":null,"abstract":"We discuss building square, integer matrices, such that the Gram–Schmidt process leads to rational orthonormal matrices. We show some interesting properties that arise while searching for integer entries, as well as a process for doing this by direct computation.","PeriodicalId":102054,"journal":{"name":"2019 21st International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126798862","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
扫码关注我们
求助内容：
应助结果提醒方式：