Pub Date : 2018-09-01DOI: 10.1109/SYNASC.2018.00039
B. Mursa, A. Andreica, L. Dioşan
Network motifs bring a great interest to many fields, because they are a perfect candidate to speed up the applied research in the understanding of complex networks dynamics. One of the biggest problems raised in the process of finding these motifs is the performance. Starting from splitting the initial network into subgraphs to the subgraphs clusterization, each algorithm used addresses an NP problem. Hence there are many algorithms that are trying to solve network motifs discovery, however there is no perfect approach talking from a time performance perspective, but only solutions that are faster than others. This paper presents a redesign of one of the most competitive algorithms for subgraphs enumeration found in the literature called ESU. In the proposed approach a given network can be processed by using parallel programming, either with a process-driven model, or a hybrid one (process-driven and thread-driven). Finally, the existing and proposed models are compared using benchmark graphs, revealing competitive results.
{"title":"Parallel Acceleration of Subgraph Enumeration in the Process of Network Motif Detection","authors":"B. Mursa, A. Andreica, L. Dioşan","doi":"10.1109/SYNASC.2018.00039","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00039","url":null,"abstract":"Network motifs bring a great interest to many fields, because they are a perfect candidate to speed up the applied research in the understanding of complex networks dynamics. One of the biggest problems raised in the process of finding these motifs is the performance. Starting from splitting the initial network into subgraphs to the subgraphs clusterization, each algorithm used addresses an NP problem. Hence there are many algorithms that are trying to solve network motifs discovery, however there is no perfect approach talking from a time performance perspective, but only solutions that are faster than others. This paper presents a redesign of one of the most competitive algorithms for subgraphs enumeration found in the literature called ESU. In the proposed approach a given network can be processed by using parallel programming, either with a process-driven model, or a hybrid one (process-driven and thread-driven). Finally, the existing and proposed models are compared using benchmark graphs, revealing competitive results.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"90 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":"127047824","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.00062
Liviu Octavian Mafteiu-Scai, Irina Maria Artinescu, Vlad Mafteiu-Scai
Image restoration is a very common process in present and mainly consist in attempts to recover an image that has been degraded, by altering some areas or data missing and as a result a lot of algorithms have been proposed over time. In this work, parallel algorithms based on convex feasibility, for inpainting a scratch of an image are proposed.
{"title":"Parallelizations of an Inpainting Algorithm Based on Convex Feasibility","authors":"Liviu Octavian Mafteiu-Scai, Irina Maria Artinescu, Vlad Mafteiu-Scai","doi":"10.1109/SYNASC.2018.00062","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00062","url":null,"abstract":"Image restoration is a very common process in present and mainly consist in attempts to recover an image that has been degraded, by altering some areas or data missing and as a result a lot of algorithms have been proposed over time. In this work, parallel algorithms based on convex feasibility, for inpainting a scratch of an image are proposed.","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":"122423647","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.00065
R. Stoean, C. Stoean, A. Samide
The inhibition of corrosion is an important aspect not only from the theoretical viewpoint of physical and material sciences but also from the practical aspect of the frequent exposure and use of metals in our lives. The traditional investigation of this process is done through electrochemical measurements with local and selective inspection of some optical microscopy slides. This paper proposes a more objective and automatic way of examining the effectiveness of the employed inhibitors through convolutional neural networks. In spite of the limitation of the number of samples to few hundreds, as they can be provided from the electrochemical laboratory, the deep learner manages to offer valuable information regarding the entire surface of a metal plate and to distinguish between the states under observation.
{"title":"Deep Learning for Metal Corrosion Control: Can Convolutional Neural Networks Measure Inhibitor Efficiency?","authors":"R. Stoean, C. Stoean, A. Samide","doi":"10.1109/SYNASC.2018.00065","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00065","url":null,"abstract":"The inhibition of corrosion is an important aspect not only from the theoretical viewpoint of physical and material sciences but also from the practical aspect of the frequent exposure and use of metals in our lives. The traditional investigation of this process is done through electrochemical measurements with local and selective inspection of some optical microscopy slides. This paper proposes a more objective and automatic way of examining the effectiveness of the employed inhibitors through convolutional neural networks. In spite of the limitation of the number of samples to few hundreds, as they can be provided from the electrochemical laboratory, the deep learner manages to offer valuable information regarding the entire surface of a metal plate and to distinguish between the states under observation.","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":"130897977","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.00040
Kaixun Hua, D. Simovici
We present a method for determining the number of clusters existent in a data set involving a bi-criteria optimization that makes use of the entropy and the cohesion of a partition. The results are promising and may be applicable in dealing with clusterings of imbalanced data.
{"title":"Dual Criteria Determination of the Number of Clusters in Data","authors":"Kaixun Hua, D. Simovici","doi":"10.1109/SYNASC.2018.00040","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00040","url":null,"abstract":"We present a method for determining the number of clusters existent in a data set involving a bi-criteria optimization that makes use of the entropy and the cohesion of a partition. The results are promising and may be applicable in dealing with clusterings of imbalanced data.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"41 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":"123646240","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.00076
Cristina M. Noaica
ACSTL is a segmentation method that was initially developed for iris images that are captured with an LG2200-iris sensor. ACSTL provided a 0.326 segmentation error on the entire LG2200 dataset, but a much higher error for images from other infrared sensors, such as a close-up camera (CASIA Interval dataset). This paper shows a method to improve ACSTL in terms of both segmentation performance and the average execution time per image. The improvements are brought to the image processing and to the iris boundary selection algorithm of ACSTL.
{"title":"Improving ACSTL Iris Segmentation Method","authors":"Cristina M. Noaica","doi":"10.1109/SYNASC.2018.00076","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00076","url":null,"abstract":"ACSTL is a segmentation method that was initially developed for iris images that are captured with an LG2200-iris sensor. ACSTL provided a 0.326 segmentation error on the entire LG2200 dataset, but a much higher error for images from other infrared sensors, such as a close-up camera (CASIA Interval dataset). This paper shows a method to improve ACSTL in terms of both segmentation performance and the average execution time per image. The improvements are brought to the image processing and to the iris boundary selection algorithm of ACSTL.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"29 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":"121993191","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.00022
Ana C. Camargos Couto, D. J. Jeffrey
This paper describes a method for generating integer matrices which, when QR-decomposed through Householder transformations, require only rational computations and give rational results. The motivation is pedagogical: we want to avoid the unnecessary complications that arise from heavy arithmetic manipulations of expressions containing square-roots in linear algebra problem sets and exams.
{"title":"Rational Householder Transformations","authors":"Ana C. Camargos Couto, D. J. Jeffrey","doi":"10.1109/SYNASC.2018.00022","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00022","url":null,"abstract":"This paper describes a method for generating integer matrices which, when QR-decomposed through Householder transformations, require only rational computations and give rational results. The motivation is pedagogical: we want to avoid the unnecessary complications that arise from heavy arithmetic manipulations of expressions containing square-roots in linear algebra problem sets and exams.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"4 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":"123335698","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.00057
C. Bǎdicǎ, Georgian Vladutu
Online reviews have a significant impact on opinion sharing, thus playing an important role in the purchase process. In this paper we examine the relations between the online review rating score and helpfulness on one hand and attributes measured by the readability tests on the other hand. Furthermore we investigated the interaction between users and, based on our data sets, we found that most of these are between customers and product owners. Lastly we proposed a sentiment analysis algorithm of reviews and we experimentally evaluated it using the review rating scores.
{"title":"Application of Meaningful Text Analytics to Online Product Reviews","authors":"C. Bǎdicǎ, Georgian Vladutu","doi":"10.1109/SYNASC.2018.00057","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00057","url":null,"abstract":"Online reviews have a significant impact on opinion sharing, thus playing an important role in the purchase process. In this paper we examine the relations between the online review rating score and helpfulness on one hand and attributes measured by the readability tests on the other hand. Furthermore we investigated the interaction between users and, based on our data sets, we found that most of these are between customers and product owners. Lastly we proposed a sentiment analysis algorithm of reviews and we experimentally evaluated it using the review rating scores.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"49 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":"123395800","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.00035
Robert W. McGrail, Thuy Trang Nguyen, Thanh Thuy Trang Tran, A. Tripathi
This article presents a term rewriting system for the first-order equational theory of quandles that is both terminating and confluent. As a consequence, it has unique normal forms and so encodes a decision procedure for quandle identities. However, the problem of computing a normal form for this term rewriting system is, in worst case, EXP hard.
{"title":"A Terminating and Confluent Term Rewriting System for the Pure Equational Theory of Quandles","authors":"Robert W. McGrail, Thuy Trang Nguyen, Thanh Thuy Trang Tran, A. Tripathi","doi":"10.1109/SYNASC.2018.00035","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00035","url":null,"abstract":"This article presents a term rewriting system for the first-order equational theory of quandles that is both terminating and confluent. As a consequence, it has unique normal forms and so encodes a decision procedure for quandle identities. However, the problem of computing a normal form for this term rewriting system is, in worst case, EXP hard.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"8 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":"126052046","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.00036
Gabriel Ciobanu, E. Todoran
We present a denotational semantics for a simple concurrent language based on Milner's CCS extended with multiparty synchronous interactions. We show that our denotational model is weakly abstract with respect to a corresponding operational semantics. The denotational semantics is designed with metric spaces and continuation semantics for concurrency. The significance of the results presented in this paper is given also by the flexibility provided by the continuations technique.
{"title":"On the Abstractness of Continuation Semantics","authors":"Gabriel Ciobanu, E. Todoran","doi":"10.1109/SYNASC.2018.00036","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00036","url":null,"abstract":"We present a denotational semantics for a simple concurrent language based on Milner's CCS extended with multiparty synchronous interactions. We show that our denotational model is weakly abstract with respect to a corresponding operational semantics. The denotational semantics is designed with metric spaces and continuation semantics for concurrency. The significance of the results presented in this paper is given also by the flexibility provided by the continuations technique.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"41 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":"127574872","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.00037
Mihai Bica, D. Gorgan
Deploying, executing and managing large task based workflows on cloud or distributed systems can be challenging. This paper proposes a solution for deploying and launching task based applications on large scale distributed systems. Scaling the existing systems to hundreds of thousands or million of nodes add significant overhead and in some cases will slow down the scalable systems below Amdahl's law because of the cost of managing so many nodes. The proposed solution for task deployment is inspired from computer virus models and realizes the deployment in an exponential fashion by starting with a single container that self divides until it populates all nodes in the datacenter. The architectural model is having the structural shape of binary tree, task metadata messages are routed on the tree model, longest message travel distance is at most log2(n). We compare two solutions for large task deployment and execution. A classical solution of using a linear method for deployment is compared with the computer virus inspired propagation model. Experimental results confirm that this solution is suitable for task based applications that can scale to few millions of worker nodes. Sending messages from the master node to worker nodes should not be a problem according to our simulation.
{"title":"Scalable Task Deployment System Inspired from Virus Propagation Models for Large Distributed Workflow Based Systems","authors":"Mihai Bica, D. Gorgan","doi":"10.1109/SYNASC.2018.00037","DOIUrl":"https://doi.org/10.1109/SYNASC.2018.00037","url":null,"abstract":"Deploying, executing and managing large task based workflows on cloud or distributed systems can be challenging. This paper proposes a solution for deploying and launching task based applications on large scale distributed systems. Scaling the existing systems to hundreds of thousands or million of nodes add significant overhead and in some cases will slow down the scalable systems below Amdahl's law because of the cost of managing so many nodes. The proposed solution for task deployment is inspired from computer virus models and realizes the deployment in an exponential fashion by starting with a single container that self divides until it populates all nodes in the datacenter. The architectural model is having the structural shape of binary tree, task metadata messages are routed on the tree model, longest message travel distance is at most log2(n). We compare two solutions for large task deployment and execution. A classical solution of using a linear method for deployment is compared with the computer virus inspired propagation model. Experimental results confirm that this solution is suitable for task based applications that can scale to few millions of worker nodes. Sending messages from the master node to worker nodes should not be a problem according to our simulation.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"9 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":"122558457","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
扫码关注我们
求助内容：
应助结果提醒方式：